Greedy Flooding in Redoubtable Sensor Networks

In Wireless Sensor Networks, flooding in one of the basic communication primitives. It is used to propagate informations from one node to the entire network. Every node, receiving a piece of information, has to flood it to all its neighborhood. As informations to spread are important, such as fire or intrusion alerts, communications should be secured. In this paper, we present a greedy flooding algorithm for Wireless Sensor Networks secured by a Random Key Pre-distribution model that make them redoubtable. We present two theoretical upper bounds of the time complexity of this algorithm that depend on the network structure. We then use the ViSiDiA platform to implement and simulate our algorithm to validate these theoretical results.