29 search results - page 2 / 6 » Greedy Virtual Coordinates for Geographic Routing |
PERCOM
2009
ACM
14 years 4 days ago
2009
ACM
— As sensor networks are deployed over various terrains, the complexity of their topology continues to grow. Voids in networks often cause existing geographic routing algorithms ...
ALGOSENSORS
2004
Springer
13 years 10 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 ...
MOBIHOC
2006
ACM
14 years 4 months ago
2006
ACM
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...
APNOMS
2009
Springer
13 years 12 months ago
2009
Springer
Applications in wireless sensor networks (WSNs) experience the routing hole problem. That is, the current node cannot forward to the destination, although it is the closest node, b...
COMPGEOM
2007
ACM
13 years 9 months ago
2007
ACM
Sensor networks are emerging as a paradigm for future computing, but pose a number of challenges in the fields of networking and distributed computation. One challenge is to devis...