An optimal algorithm towards successive location privacy in sensor networks with dynamic programming

Baokang Zhao, Dan Wang, Zili Shao, Jiannong Cao, Chun Chung Chan, Jinshu Su

Research output: Journal article publicationJournal articleAcademic researchpeer-review

3 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)531-533
Number of pages3
JournalIEICE Transactions on Information and Systems
Issue number3
Publication statusPublished - 1 Jan 2010


  • Algorithms
  • Dynamic programming
  • Location privacy
  • Wireless sensor networks

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Cite this