Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/31203
Title: An optimal algorithm towards successive location privacy in sensor networks with dynamic programming
Authors: Zhao, B
Wang, D 
Shao, Z 
Cao, J 
Chan, KCC 
Su, J
Keywords: Algorithms
Dynamic programming
Location privacy
Wireless sensor networks
Issue Date: 2010
Source: IEICE Transactions on information and systems, 2010, v. E93-D, no. 3, p. 531-533 How to cite?
Journal: IEICE Transactions on Information and Systems 
Abstract: In wireless sensor networks, preserving location privacy under successive inference attacks is extremely critical. Although this problem is NP-complete in general cases, we propose a dynamic programming based algorithm and prove it is optimal in special cases where the correlation only exists between p immediate adjacent observations.
URI: http://hdl.handle.net/10397/31203
ISSN: 0916-8532
DOI: 10.1587/transinf.E93.D.531
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

3
Last Week
0
Last month
0
Citations as of Sep 15, 2017

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
0
Citations as of Sep 24, 2017

Page view(s)

38
Last Week
4
Last month
Checked on Sep 25, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.