ACM Home Page
Please provide us with feedback. Feedback
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Full text PdfPdf (407 KB)
Source International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing table of contents
Annapolis, Maryland, USA
SESSION: Routing table of contents
Pages: 267 - 278  
Year of Publication: 2003
ISBN:1-58113-684-6
Authors
Fabian Kuhn  ETH Zurich, Zurich, Switzerland
Roger Wattenhofer  ETH Zurich, Zurich, Switzerland
Aaron Zollinger  ETH Zurich, Zurich, Switzerland
Sponsors
ACM: Association for Computing Machinery
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 20,   Downloads (12 Months): 94,   Citation Count: 66
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/778415.778447
What is a DOI?

ABSTRACT

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 simulation. GOAFR is the first ad-hoc algorithm to be both asymptotically optimal and average-case efficient. For our simulations we identify a network density range critical for any routing algorithm. We study a dozen of routing algorithms and show that GOAFR outperforms other prominent algorithms, such as GPSR or AFR.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
4
5
 
6
 
7
O. Dousse, P. Thiran, and M. Hasler. Connectivity in ad-hoc and hybrid networks. In Proc. IEEE Infocom, New York, NY, USA, June 2002.
 
8
G. Finn. Routing and addressing problems in large metropolitan-scale internetworks. Technical Report ISI/RR-87-180, USC/ISI, March 1987.
9
10
 
11
S. Giordano, I. Stojmenovic, and L. Blazevic. Position based routing algorithms for ad hoc networks: a taxonomy, July 2001.
 
12
T. Hou and V. Li. Transmission range control in multihop packet radio networks. IEEE Transactions on Communications, 34(1):38--44, 1986.
 
13
D. B. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless networks. In Imielinski and Korth, editors, Mobile Computing, volume 353. Kluwer Academic Publishers, 1996.
14
 
15
Y. Ko and N. Vaidya. Geocasting in mobile ad hoc networks: Location-based multicast algorithms. Technical Report TR-98-018, Texas A&M University, September 1998.
 
16
E. Kranakis, H. Singh, and J. Urrutia. Compass routing on geometric networks. In Proc. 11th Canadian Conference on Computational Geometry, pages 51--54, Vancouver, Canada, August 1999.
17
18
 
19
M. Mauve, J. Widmer, and H. Hartenstein. A survey on position-based routing in mobile ad-hoc networks. In IEEE Network, November 2001.
20
 
21
 
22
H. Takagi and L. Kleinrock. Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Transactions on Communications, 32(3):246--257, 1984.
 
23

CITED BY  66

Collaborative Colleagues:
Fabian Kuhn: colleagues
Roger Wattenhofer: colleagues
Aaron Zollinger: colleagues