For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
An Optimal Algorithm towards Successive Location Privacy in Sensor Networks with Dynamic Programming
Baokang ZHAO Dan WANG Zili SHAO Jiannong CAO Keith C.C. CHAN Jinshu SU
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2010/03/01
Online ISSN: 1745-1361
Print ISSN: 0916-8532
Type of Manuscript: Special Section LETTER (Special Section on Trust, Security and Privacy for Pervasive Applications)
wireless sensor networks, location privacy, algorithms, dynamic programming,
Full Text: PDF(149.3KB)
>>Buy this Article
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.