Sciweavers

Share
15 search results - page 1 / 3
» Void Traversal for Guaranteed Delivery in Geometric Routing
Sort
View
CORR
2008
Springer
98views Education» more  CORR 2008»
11 years 5 months ago
Void Traversal for Guaranteed Delivery in Geometric Routing
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
Mikhail Nesterenko, Adnan Vora
CORR
2008
Springer
94views Education» more  CORR 2008»
11 years 5 months ago
Stateless and Delivery Guaranteed Geometric Routing on Virtual Coordinate System
Abstract-- Stateless geographic routing provides relatively good performance at a fixed overhead, which is typically much lower than conventional routing protocols such as AODV. Ho...
Ke Liu, Nael B. Abu-Ghazaleh
OPODIS
2008
11 years 7 months ago
Fast Geometric Routing with Concurrent Face Traversal
We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal. Our simulation results demonstrate tha...
Thomas Clouser, Mark Miyashita, Mikhail Nesterenko
MOBICOM
2006
ACM
11 years 11 months ago
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
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...
Hannes Frey, Ivan Stojmenovic
INFOCOM
2009
IEEE
12 years 4 days ago
VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual-Coordinate-Based Routing Protocols in Wireless Sensor Networks
Abstract—Because the global positioning system (GPS) consumes a large amount of power and does not work indoors, many virtual-coordinate-based routing protocols are proposed for ...
Ming-Jer Tsai, Fang-Ru Wang, Hong-Yen Yang, Yuan-P...
books