A self-organizing routing algorithm for wireless sensor networks
conference contributionposted on 2009-01-28, 14:22 authored by Fang Yao, Shuang-Hua Yang
Wireless sensor networks (WSN) are designed to collect and process sensory data from environments. Some environments are dangerous or un-reachable to human beings and it is difficult to replace sensor nodes when they are out of battery or even destroyed, i.e. wireless sensor nodes are in general prone to failure. This kind of characteristics require WSN to detect whether or not its next destination is still available (alive) and to maintain a transferring path if the next destination in the route does not exist (dead). In the normal state, nodes are in power-saving 'sleep' state. When a route is created for some purpose, all nodes in this route will be active and be ready to respond requests from its neighbors. Our approach is to maintain the routing table up-to-date by sending message from a last node to its next node and judging whether the next node is alive according to the response. If problems happen, node will self-organize and try to maintain transferring.
- Computer Science
CitationYAO, F. and YANG, S.H., 2006. A self-organizing routing algorithm for wireless sensor networks. IN: Proceedings, IEEE International Conference on Systems, Man and Cybernetics, (SMC '06). 8-11 Oct., Taipai, Taiwan, Vol. 4, pp. 3388-3393.
- VoR (Version of Record)
NotesThis is a conference paper [© IEEE]. It is also available at: http://ieeexplore.ieee.org/ Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.