Sensor networks are large-scale distributed sensing networks comprised of many small sensing devices equipped with memory, processors, and short-range wireless communication radio. Instead of broadcast-based routing protocols, in this paper we propose a novel energy-efficient routing protocol, which is called straight line routing algorithm (SLR), for wireless sensor networks. To achieve the routing task without broadcasting, the source host constructs the event path and the sink host constructs the query path respectively. That is, the routing path is found as the query path and the event path first intersect. Moreover, the SLR is able to build both the query path and the event path without any help of the geographic information. We evaluate the performance of straight line routing and rumor routing protocols through extensive simulations. The simulation results indicate that compared with rumor routing, the SLR can save more energy consumption, provide better path quality, and improve the successful ratio of routing as well.
[1]
Charles E. Perkins,et al.
Ad-hoc on-demand distance vector routing
,
1999,
Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.
[2]
Keith Marzullo,et al.
Gossip versus Deterministic Flooding: Low Message Overhead and High Reliability for Broadcasting on Small Networks
,
1999
.
[3]
David A. Maltz,et al.
Dynamic Source Routing in Ad Hoc Wireless Networks
,
1994,
Mobidata.
[4]
Charles E. Perkins,et al.
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
,
1994,
SIGCOMM.
[5]
Deborah Estrin,et al.
Rumor Routing Algorithm For Sensor Networks
,
2002
.