Sciweavers

105 search results - page 2 / 21
» Look-ahead Geographic Routing for Sensor Networks
Sort
View
MOBIHOC
2010
ACM
13 years 2 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan
INFOCOM
2009
IEEE
13 years 11 months ago
Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
Guang Tan, Marin Bertier, Anne-Marie Kermarrec
IPSN
2005
Springer
13 years 10 months ago
Geographic routing with limited information in sensor networks
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 ab...
Sundar Subramanian, Sanjay Shakkottai
IJAHUC
2006
128views more  IJAHUC 2006»
13 years 4 months ago
Avoid 'void' in geographic routing for data aggregation in sensor networks
: Wireless sensor networks have attracted great attention in research and industrial development due to its fast-growing application potentials. New techniques must be developed fo...
Shigang Chen, Guangbin Fan, Jun-Hong Cui
TON
2008
75views more  TON 2008»
13 years 4 months ago
An algorithmic approach to geographic routing in ad hoc and sensor networks
The one type of routing in ad hoc and sensor networks that currently appears to be most amenable to algorithmic analysis
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger