Multiple k-hop clusters based routing scheme to preserve source-location privacy in WSNs

Abstract

Privacy is becoming one of the most notable challenges threatening wireless sensor networks (WSNs). Adversaries may use RF (radio frequency) localization techniques to perform hop-by-hop trace back to the source sensor’s location. A multiple k-hop clusters based routing strategy (MHCR) is proposed to preserve source-location privacy as well as enhance energy efficiency for WSNs. Owing to the inherent characteristics of intra-cluster data aggregation, each sensor of the interference clusters is able to act as a fake source to confuse the adversary. Moreover, dummy traffic could be filtered efficiently by the cluster heads during the data aggregation, ensuring no energy consumption be burdened in the hotspot of the network. Through careful analysis and calculation on the distribution and the number of interference clusters, energy efficiency is significantly enhanced without reducing the network lifetime. Finally, the security and delay performance of MHCR scheme are theoretically analyzed. Extensive analysis and simulation results demonstrate that MHCR scheme can improve both the location privacy security and energy efficiency markedly, especially in large-scale WSNs.

Keywords

wireless sensor networks / source-location privacy / energy efficiency / k-hop cluster / circular routing

References

[1] MehtaK, LiuD, WrightM. Location privacy in sensor networks against a global eavesdropper [C]. IEEE International Conference on Network Protocols, 2007, Beijing, IEEE: 314-323

[2] LiuZ X, WangJ X, ZhangS G. A neighbor information based false data filtering scheme in wireless sensor networks [J]. Journal of Central South University, 2012, 19: 3147-3153

[3] KamatP, ZhangY, TrappeW, OzturkC. Enhancing source-location privacy in sensor network routing [C]. IEEE International Conference on Distributed Computing Systems, 2005, Columbus, IEEE: 599-608

[4] MahmoudM M, ShenX S. A cloud-based scheme for protecting source-location privacy against hotspot-locating attack in wireless sensor networks [J]. IEEE Transactions on Parallel and Distributed Systems, 2012, 23(10): 1805-1818

[5] YangY, ShaoM, ZhuS, UrgaokarB, CaoG. Towards event source unobservability with minimum network traffic in sensor networks [C]. ACM Conference on Wireless Network Security, 2008, Alexandria, IEEE: 77-88

[6] LiY, RenJ. Source-location privacy through dynamic routing in wireless sensor networks [C]. IEEE International Conference on Communications, 2010, Cape Town, IEEE: 1-9

[7] LiuA F, RenJ, XuJ, ZengZ, CaenZ. Analysis and avoidance of energy hole problem in heterogeneous wireless sensor networks [J]. Ruanjian Xuebao/Journal of Software, 2012, 23(9): 2438-2448

[8] JuR, Yao-xueZ, KangL. An energy-efficient cyclic diversionary routing strategy against global eavesdroppers in wireless sensor networks [J]. International Journal of Distributed Sensor Networks, 20131-9

[9] LiuA, JinX, CuiG, ChenZ. Deployment guidelines for achieving maximum lifetime and avoiding energy holes in sensor network [J]. Information Sciences, 2013, 230: 197-226

[10] BicakciK, BagciI E, TavliB. Lifetime bounds of wireless sensor networks preserving perfect sink unobservability [J]. IEEE Communications Letters, 2011, 15(2): 205-207

[11] BicakciK, GultekinH, TavliB, BagciI. Maximizing lifetime of event-unobservable wireless sensor networks [J]. Computer Standards & Interfaces, 2011, 33(4): 401-410

[12] OzturkC, ZhangY, TrappeW. Source location privacy in energy-constrained sensor network routing [C]. ACM Workshop on Security of Ad Hoc and Sensor Networks, 2004, 25: 88-93

[13] LiY, RenJ. Preserving source-location privacy in wireless sensor networks [C]. IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, ROME: IEEE, 20091-9

[14] LiY, RenJ, WuJ. Quantitative measurement and design of source-location privacy schemes for wireless sensor networks [J]. IEEE Transactions on Parallel and Distributed Systems, 2012, 23(7): 1302-1311

[15] TrappeW, WashingtonL, AnshelM, BoklanK. Introduction to Cryptography with coding theory [J]. The Mathematical Intelligencer, 2007, 29(3): 66-69

[16] LiuA, RenJ, LiX, ChenZ, ShenX S. Design principles and improvement of cost function based energy aware routing algorithms for wireless sensor networks [J]. Computer Networks, 2012, 56(7): 1951-1967

[17] NocettiF G, GonzalezJ S, StojmenovicI. Connectivity based k-hop clustering in wireless networks [J]. Telecommunication systems, 2003, 22(1/2/3/4): 205-220

[18] AngioneG, BellavistaP, CorradiA, MagistrettiE. A k-hop clustering protocol for dense mobile ad-hoc networks [C]. IEEE International Conference on Distributed Computing Systems Workshops, 2006, Lisboa, IEEE: 10-10

[19] LamportL, ShostakR, PeaseM. The Byzantine generals problem [J]. ACM Transactions on Programming Languages and Systems, 1982, 4(3): 382-401