Preserving context privacy in distributed hash table wireless sensor networks
Springer International Publishing
Wireless Sensor Networks (WSN) are often deployed in hostile or difficult scenarios, such as military battlefields and disaster recovery, where it is crucial for the network to be highly fault tolerant, scalable and decentralized. For this reason, peer-to-peer primitives such as Distributed Hash Table (DHT), which can greatly enhance the scalability and resilience of a network, are increasingly being introduced in the design of WSN’s. Securing the communication within the WSN is also imperative in hostile settings. In particular, context information, such as the network topology and the location and identity of base stations (which collect data gathered by the sensors and are a central point of failure) can be protected using traffic encryption and anonymous routing. In this paper, we propose a protocol achieving a modified version of onion routing over wireless sensor networks based on the DHT paradigm. The protocol prevents adversaries from learning the network topology using traffic analysis, and therefore p reserves the context privacy of the network. Furthermore, the proposed scheme is designed to minimize the computational burden and power usage of the nodes, through a novel partitioning scheme and route selection algorithm.
Wireless sensor networks , Context privacy , Anonymity , Onion routing , Distributed hash table
Palmieri, P. (2016) 'Preserving Context Privacy in Distributed Hash Table Wireless Sensor Networks', in Qing, S., Okamoto, E., Kim, K. & Liu, D. (eds.) Information and Communications Security: 17th International Conference, ICICS 2015, Beijing, China, December 9-11, 2015, Revised Selected Papers. Cham: Springer International Publishing, pp. 436-444. doi: 10.1007/978-3-319-29814-6_37
© Springer International Publishing Switzerland 2016. The final publication is available at Springer via http://doi.org/10.1007/978-3-319-29814-6_37