Sciweavers

1812 search results - page 2 / 363
» Stateless Routing in Network Simulations
Sort
View
MOBIHOC
2006
ACM
14 years 4 months ago
Minimizing recovery state In geographic ad-hoc routing
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...
Noa Arad, Yuval Shavitt
RTSS
2005
IEEE
13 years 10 months ago
Gradient-Ascending Routing via Footprints in Wireless Sensor Networks
A novel gradient-ascending stateless routing protocol, called GRASP (GRadient Ascending Stateless Protocol), is proposed for stationary wireless sensor networks. GRASP is built wi...
Jai-Jin Lim, Kang G. Shin
ICNP
2005
IEEE
13 years 11 months ago
Path Vector Face Routing: Geographic Routing with Local Face Information
Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a welldefined no...
Ben Leong, Sayan Mitra, Barbara Liskov
ADHOC
2007
108views more  ADHOC 2007»
13 years 5 months ago
A self-healing On-demand Geographic Path Routing Protocol for mobile ad-hoc networks
We present a self-healing On-demand Geographic Path Routing Protocol (OGPR) for mobile ad-hoc networks. OGPR is an efficient, stateless, and scalable routing protocol that inherit...
Venkata C. Giruka, Mukesh Singhal