An Optimal Algorithm towards Successive Location Privacy in Sensor Networks with Dynamic Programming

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.

[1]  Liang Zhang,et al.  Protecting Receiver-Location Privacy in Wireless Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[2]  G. McCormick.  Nonlinear Programming: Theory, Algorithms and Applications , 1983 .

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Dan Wang,et al.  Towards Successive Privacy Protection in Sensor Networks , 2008, 2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing.

[5]  Donggang Liu,et al.  Location Privacy in Sensor Networks Against a Global Eavesdropper , 2007, 2007 IEEE International Conference on Network Protocols.

[6]  Wade Trappe,et al.  Enhancing Source-Location Privacy in Sensor Network Routing , 2005, ICDCS.

[7]  Bo Sheng,et al.  Privacy-aware routing in sensor networks , 2009, Comput. Networks.

[8]  Andrey V. Savkin,et al.  Mobility modelling and trajectory prediction for cellular networks with mobile base stations , 2003, MobiHoc '03.