A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Geographic routing with limited information in sensor networks
IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005.
Geographic routing with greedy relaying strategies have been widely studied as a routing scheme in sensor networks. These schemes assume that the nodes have perfect information about the location of the destination. When the distance between the source and destination is normalized to unity, the asymptotic routing delays in these schemes are Θ( 1 M(n) ), where M (n) is the maximum distance traveled in a single hop (transmission range of a radio). Three scenarios are considered: (i) where nodesdoi:10.1109/ipsn.2005.1440935 dblp:conf/ipsn/SubramanianS05 fatcat:gojeolzcrbfntblrjqfghy6dsm