3 search results - page 1 / 1 » Worst-Case optimal and average-case efficient geometric ad-h... |
64
Voted
MOBIHOC
2003
ACM
15 years 9 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 ...
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
OPODIS
2008
14 years 11 months ago
2008
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...