Sciweavers

16 search results - page 2 / 4
» Geometric ad-hoc routing: of theory and practice
Sort
View
CORR
2008
Springer
98views Education» more  CORR 2008»
13 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
BROADNETS
2007
IEEE
13 years 11 months ago
Cross-layer optimization made practical
Abstract— Limited resources and time-varying nature of wireless ad hoc networks demand optimized use of resources across layers. Cross-layer optimization (CLO) for wireless netwo...
Ajit Warrier, Long Le, Injong Rhee
MOBIHOC
2003
ACM
14 years 4 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
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 ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
ALGOSENSORS
2004
Springer
13 years 10 months ago
On a Conjecture Related to Geometric Routing
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 ...
Christos H. Papadimitriou, David Ratajczak
TCOM
2008
120views more  TCOM 2008»
13 years 4 months ago
Network Coding for Efficient Multicast Routing in Wireless Ad-hoc Networks
Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networ...
Jingyao Zhang, Pingyi Fan, Khaled Ben Letaief