Name
Abstract | ||
|---|---|---|
Routing is the foremost issue in mobile ad hoc networks (MANETs). In a wireless environment characterized by small bandwidth and limited computation resources, position-based routing is attractive because it requires little communication and storage overhead. To guarantee delivery and improve performance, most position-based routing protocols, e. g. GFG, forward a message in greedy mode until the message is forwarded to a node that has no neighbor closer to the destination. They then switch to a less efficient mode. Face routing, where the message is forwarded along the perimeter of the void, is one example. This paper tackles the void problem from a different angle. We construct a virtual small world network by adding virtual long links to reduce the chance of a protocol encountering local minima in greedy mode, and thus decrease the chance to invoke inefficient methods. Experiments show that this method effectively improves the performance of the greedy-face combinations in terms of average hop count. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/GLOCOM.2006.964 | GLOBECOM 2006 - 2006 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE |
Keywords | Field | DocType |
position-based (geometric) routing, mobile ad hoc networks (MANETs), simulation, small world model | Link-state routing protocol,Dynamic Source Routing,Static routing,Computer science,Destination-Sequenced Distance Vector routing,Computer network,Wireless Routing Protocol,Routing Information Protocol,Geographic routing,Zone Routing Protocol,Distributed computing | Conference |
ISSN | Citations | PageRank |
1930-529X | 2 | 0.40 |
References | Authors | |
15 | 2 | |