Constrained flooding: a robust and efficient routing framework for wireless sensor networks
Flooding protocols for wireless networks in general have been shown to be very inefficient and therefore are mainly used in network initialization or route discovery and maintenance. In this paper, we propose a framework of constrained flooding protocols. The framework incorporates a reinforcement learning kernel, a differential delay mechanism, and a constrained and probabilistic retransmission policy. This type of protocol takes the advantages of robustness from flooding, but maintains energy efficiency by constraining retransmissions. Without the use of any control packets, such a protocol adapts to the specific routing requirements of the task and the dynamic changes of the network. We analyze this framework in simulation using a real-world application in sensor networks.
- download PDF (257K)
Zhang, Y. ; Fromherz, M. P. J. Constrained flooding: a robust and efficient routing framework for wireless sensor networks. 20th IEEE International Conference on Advanced Information Networking and Applications (AINA 2006); 2006 April 18-20; Vienna; Austria.
Copyright © IEEE, 2006. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.