Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1145/1374618.1374683 | MobiHoc |
Keywords | Field | DocType |
unit disk graph,efficient force-based geometric routing,arbitrary three-dimensional network,planar graph,localized planar graph construction,general network model,two-dimensional network,sensor network,face routing,position-based routing protocol,mobile ad hoc network,routing protocol,simulation,network model,three dimensional | Multipath routing,Link-state routing protocol,Dynamic Source Routing,Computer science,Policy-based routing,Static routing,Computer network,Destination-Sequenced Distance Vector routing,Wireless Routing Protocol,Geographic routing,Distributed computing | Conference |
Citations | PageRank | References |
1 | 0.42 | 8 |
Authors | ||
2 | ||