Sciweavers

203 search results - page 3 / 41
» On greedy geographic routing algorithms in sensing-covered n...
Sort
View
ADHOC
2007
108views more  ADHOC 2007»
13 years 7 months ago
Hop-distance based addressing and routing for dense sensor networks without location information
One of the most challenging problems in wireless sensor networks is the design of scalable and efficient routing algorithms without location information. The use of specialized ha...
Serdar Vural, Eylem Ekici
FOCS
2008
IEEE
14 years 2 months ago
Some Results on Greedy Embeddings in Metric Spaces
Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of routing. Such routing algorithms have proven to be both ...
Ankur Moitra, Tom Leighton
COMCOM
2007
136views more  COMCOM 2007»
13 years 7 months ago
Demand-scalable geographic multicasting in wireless sensor networks
In this paper, we focus on the challenge of demand-scalable multicast routing in wireless sensor networks. Due to the ad-hoc nature of the placement of the sensor nodes as well as...
Shibo Wu, K. Selçuk Candan
SENSYS
2003
ACM
14 years 23 days ago
On the effect of localization errors on geographic face routing in sensor networks
In the absence of location errors, geographic routing - using a combination of greedy forwarding and face routing - has been shown to work correctly and efficiently. The effects o...
Karim Seada, Ahmed Helmy, Ramesh Govindan
ADHOC
2007
122views more  ADHOC 2007»
13 years 7 months ago
Modeling and analyzing the correctness of geographic face routing under realistic conditions
Geographic protocols are very promising for wireless ad hoc and sensor networks due to the low state storage and low message overhead. Under certain idealized conditions, geograph...
Karim Seada, Ahmed Helmy, Ramesh Govindan