Zonal Rumor Routing for Wireless Sensor Networks

has to be relayed to nodes interested in those events. Moreover, nodes may also generate queries to find events they are interested in. Thus there is a need to route the information about the observed events to other nodes in the network. Different routing algorithms have been developed for sensor networks. Routing algorithms that flood the network with events or queries for reliable delivery [3,7,8] of the event information, require relatively high energy consumption [1]. Some routing algorithms are dependent on the geographical locations of the sensors [10,11]. For sensor networks in which it would be impossible to determine the exact locations of the sensors, such algorithms are unacceptable. There exist routing algorithms that need not be aware of the physical location of the sensor nodes for routing [1,3,7,8]. Routing algorithms for wireless sensor networks are constrained by power, memory and computational resources. Rumor Routing algorithm for sensor networks spreads the informa...

• Type: Conference
• Year: 2005
• Where: ITCC
• Authors: Tarun Banka, Gagan Tandon, Anura P. Jayasumana
• Keywords: Information Technology, ITCC 2005, Routing Algorithm, Rumor Routing, Sensor Networks