The Community for Technology Leaders
Green Image
Issue No. 10 - Oct. (2012 vol. 23)
ISSN: 1045-9219
pp: 1805-1818
Mohamed M.E.A. Mahmoud , University of Waterloo, Waterloo
Xuemin Shen , University of Waterloo, Waterloo
In wireless sensor networks, adversaries can make use of the traffic information to locate the monitored objects, e.g., to hunt endangered animals or kill soldiers. In this paper, we first define a hotspot phenomenon that causes an obvious inconsistency in the network traffic pattern due to the large volume of packets originating from a small area. Second, we develop a realistic adversary model, assuming that the adversary can monitor the network traffic in multiple areas, rather than the entire network or only one area. Using this model, we introduce a novel attack called Hotspot-Locating where the adversary uses traffic analysis techniques to locate hotspots. Finally, we propose a cloud-based scheme for efficiently protecting source nodes' location privacy against Hotspot-Locating attack by creating a cloud with an irregular shape of fake traffic, to counteract the inconsistency in the traffic pattern and camouflage the source node in the nodes forming the cloud. To reduce the energy cost, clouds are active only during data transmission and the intersection of clouds creates a larger merged cloud, to reduce the number of fake packets and also boost privacy preservation. Simulation and analytical results demonstrate that our scheme can provide stronger privacy protection than routing-based schemes and requires much less energy than global-adversary-based schemes.
Privacy, Monitoring, Wireless sensor networks, Cryptography, Correlation, Wireless communication, Data privacy, and anonymity, Wireless sensor network privacy, source-location privacy-preserving schemes, context privacy

M. M. Mahmoud and X. Shen, "A Cloud-Based Scheme for Protecting Source-Location Privacy against Hotspot-Locating Attack in Wireless Sensor Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 23, no. , pp. 1805-1818, 2012.
253 ms
(Ver 3.3 (11022016))