Please login using the form on menu list.|
It is required to login for Full-Text PDF.
An Optimal Algorithm towards Successive Location Privacy in Sensor Networks with Dynamic Programming
Keith C.C. CHAN
IEICE TRANSACTIONS on Information and Systems Vol.E93-D No.3 pp.531-533
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,
Full Text: PDF(148.8KB)
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.