Straight Routing Algorithm for Dense Sensor Networks
Date Issued
2004
Date
2004
Author(s)
Su, Chia-Chang
DOI
en-US
Abstract
Sensor networks are large-scale distributed sensing networks comprised of many small sensing devices equipped with memory, processors, and short-range wireless communication radio. In order to constrain communication overhead, dense sensor networks call for new and highly efficient methods for distributing queries to nodes that have observed interesting events in the network. A highly efficient data-centric routing mechanism will offer significant power cost reductions, and improve network longevity. In this paper we present an alternative energy efficient routing protocol, which is called Straight Routing Algorithm (SRA), for dense wireless sensor network.
According to the previous works [5], the probability of two lines would be intersected on the plane is high. Both Rumor Routing and SRA are based on this fact to create paths. In this way, when a query is generated it can be sent in the form of the random walk until the path is found; instead of flooding this query throughout the network. Hence, the main contribution of SRA is providing a scheme to construct the path Straightly. If the lines generated from source and destination are both straight, more energy will be saved, path quality will be improved and response time will be reduced.
We compare the performance of Straight Routing Algorithm, Rumor Routing and a well-known protocol, AODV. According to the simulation results, they indicate that SRA not only can achieve more energy saving than Rumor routing but also can reduce the response time. Moreover, it also can provide better path quality.
Subjects
演算法
路由協定
無線感知網路
routing
protocols
sensor network
algorithm
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-93-R91922088-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):cbef402ac338f5a3b866038cc0e81355