203 search results - page 22 / 41 » On greedy geographic routing algorithms in sensing-covered n... |
101
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
MOBICOM
2006
ACM
15 years 5 months ago
2006
ACM
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
74
Voted
MOBIHOC
2003
ACM
15 years 11 months ago
2003
ACM
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
116
click to vote
ALGOSENSORS
2004
Springer
15 years 5 months ago
2004
Springer
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
107
Voted
ICUMT
2009
14 years 9 months ago
2009
Traditional routing strategies for multi-hop wireless networks forward packets by selecting at the sender side the next hop for each packet. Recently, such a paradigm has been call...