Name
Abstract | ||
|---|---|---|
Route discovery in manymobile ad hoc protocols is based on flooding. However, flooding suffers from high overhead, which can increase contention and communication delays. In this paper,we propose twonewroute discovery algorithms that are aimed towards reducing these delays. Both algorithms are suitable for use with ad hoc protocols where nodes periodically broadcast Hello Messages. Using the GloMoSim simulator, the proposed algorithms were evaluated and compared to existing methods. The simulation results show that the proposed approach can reduce routing overhead, number of broken links, average delay, and the number of dropped packets. Small improvements in message delivery ratios are also observed. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.procs.2012.06.013 | Procedia Computer Science |
Keywords | Field | DocType |
MobileAd Hoc Networks,AODV,OLSR,DSR,Ad Hoc Routing Protocols | Mobile ad hoc network,Link-state routing protocol,Ad hoc On-Demand Distance Vector Routing,Computer science,Algorithm,Destination-Sequenced Distance Vector routing,Computer network,Ad hoc wireless distribution service,Optimized Link State Routing Protocol,Wireless ad hoc network,Vehicular ad hoc network,Distributed computing | Journal |
Volume | ISSN | Citations |
10 | 1877-0509 | 1 |
PageRank | References | Authors |
0.36 | 12 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amal Alhosban | 1 | 29 | 4.91 |
| Ismail Ababneh | 2 | 82 | 7.37 |
| Zaki Malik | 3 | 501 | 34.83 |