Name
Abstract | ||
|---|---|---|
Geometric routing in mobile ad-hoc networks (MANETs) is comprised of two forwarding modes: greedy forwarding and face forwarding. It is known that face forwarding is inefficient and fails frequently in practical situations. A previous work, NEAR [2], avoids switching to face forwarding by predicting local minima and not forwarding messages to them. However, NEAR predicts excessive local minima, which results in subop- timal routing performance. Also, it is not fully localized due to its bridge detection scheme. Aiming to further improve the performance, we propose a destination- region-based Local minimum AwaRe GEometric Routing (LARGER) algorithm which improves the accuracy of the local minima prediction by dividing the network into a number of regions and predicting local minima based on the region where the destination is located. Simulation results show that LARGER substantially improves the prediction accuracy and the routing performance of NEAR and that of the other state-of-the-art geometric routing algorithms in terms of route length. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/MOBHOC.2007.4428646 | MASS |
Keywords | Field | DocType |
destination region,local minimum aware geometric routing,bridge detection,manets,mobile radio,manet,mobile ad hoc networks,telecommunication network routing,ad hoc networks,geometric routing,local minimum prediction,mobile ad hoc network,local minima | Equal-cost multi-path routing,Dynamic Source Routing,Computer science,Static routing,Destination-Sequenced Distance Vector routing,Computer network,Wireless ad hoc network,Routing table,Geographic routing,Virtual routing and forwarding,Distributed computing | Conference |
ISSN | ISBN | Citations |
2155-6806 | 978-1-4244-1455-0 | 16 |
PageRank | References | Authors |
0.67 | 10 | 2 |