Flooding in Secure Wireless Sensor Networks

Abstract

The flooding algorithm remains one of the simplest and most effective ways to quickly disseminate information across all nodes in a Wireless Sensor Network. Though fast, this algorithm remains unsecure as the packets can be intercepted by malice agents to reveal the information. In this paper, simulations of a flooding algorithm in Sensor Networks secured by a Random Key Pre-distribution model are presented. We conducted these simulations on ns-3 over a theoretical Peer-to-peer and a standard based IEEE 802.15.4 network. This is followed by a demonstration of the robustness of the network through a random black hole attack. © 2017 Copyright held by the owner/author(s).