ACM Home Page
Please provide us with feedback. Feedback
Poster abstract: force-based geometric routing
Full text PdfPdf (139 KB)
Source
International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing table of contents
Hong Kong, Hong Kong, China
POSTER SESSION: Posters table of contents
Pages 453-454  
Year of Publication: 2008
ISBN:978-1-60558-073-9
Authors
Cong Liu  Florida Atlantic University, Boca Raton, FL, USA
Jie Wu  Florida Atlantic University, Boca Raton, FL, USA
Sponsors
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Additional Information:

abstract   references   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/1374618.1374683
What is a DOI?

ABSTRACT

Routing is the foremost issue in mobile ad hoc networks (MANETs) and sensor networks. To guarantee delivery and improve performance, most position-based routing protocols are based on face routing, which requires the underlying network to be a planar graph. Localized planar graph construction requires the radio model to be a unit disk graph and it is only applicable to two-dimensional networks. This paper presents an efficient force-based geometric routing algorithm which is applicable to general network models and has a worst-case bound for arbitrary three-dimensional networks.


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
R. Flury and R. Wattenhofer. Randomized 3D Geographic Routing. In Proc. of IEEE INFOCOM, 2008.
 
6