Routing with adaptive path and limited flooding for mobile ad hoc networks
โ Scribed by Yun-Sheng Yen; Hung-Chieh Chang; Ruay-Shiung Chang; Han-Chieh Chao
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 870 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0045-7906
No coin nor oath required. For personal study only.
โฆ Synopsis
Self-healing and optimizing routing techniques (SHORT) a b s t r a c t
In MANET, each mobile host can freely move around and the network topology is dynamically changing. To send a datagram, a source host broadcasts a route discovery packet to the network. All neighboring nodes receiving this packet will rebroadcast this packet until it reaches the destination. It will have large flooding overhead, poor network performance and undesirable battery power consumption. To improve network performance, we design a novel routing protocol called RAPLF (Routing with Adaptive Path and Limited Flooding) for mobile ad hoc networks. Simulation results show that our protocol has better performance especially in packet delivery rate and flooding overhead when compared to similar protocols.
๐ SIMILAR VOLUMES
a b s t r a c t Flows transported across mobile ad hoc wireless networks suffer from route breakups caused by nodal mobility. In a network that aims to support critical interactive real-time data transactions, to provide for the uninterrupted execution of a transaction, or for the rapid transport of
## a b s t r a c t Path compression techniques are efficient on-demand routing optimizing techniques for mobile Ad Hoc networks. However, there is no efficient model for path compression techniques. This paper analyzed the principles and characteristics of path compression algorithms and proposed