A Survey of Key Pre-Distribution and Overlay Routing in Unstructured Wireless Networks

Abstract

Unstructured wireless networks such as mobile ad hoc networks and wireless sensor networks have been rapidly growing in the past decade. Security is known as a challenging issue in such networks, in which there is no xed infrastructure or central trusted authority. Further, node limitations in processing power, storage, and energy consumption add further complexity to addressing security in such networks. While cryptography has proven to be an e ective solution capable of satisfying most network security requirements, it requires the use of e cient key pre-distribution algorithms compatible with the limitation of unstructured wireless networks. Typically, a key pre-distribution algorithm forms a cryptographic overlay layer above the network routing layer and as such introduces the need for relying on two layers of routing for secure delivery of information. In this paper, we conduct a categorical review of key pre-distribution methods for unstructured wireless networks. We also compare di erent key pre-distribution schemes in terms of performance and security strength. Finally, we provide an overview of recent overlay routing algorithms relying on key pre-distribution.

RUbIn: A Framework for Reliable and Ubiquitous Inference in WSNs

“…In WSNs, key-distribution algorithms are categorized into two types of random and regular [14]. In both types of these algorithms, you can nd tracks of inference in identifying the overlay neighboring nodes that are also physically neighboring nodes through a shared key, nding the overlay path, and nally, formulating the overlay network.…”