scholarly journals Progressive AODV: A Routing Algorithm Intended for Mobile Ad-Hoc Networks

Mobile ad hoc networks are an independent wireless network that is built without permanent infrastructure and base station support. Each node in the network uses a wireless connection for connections and acts not only as an end system but also as a path to accelerating packets. Meanwhile, the network nodes are mobile and can move in each path with changing steps, creating a great dynamic of the network. Therefore, the protocols set for general ad hoc networks are inappropriate for such a situation. In addition, the performance of ad hoc routing protocols decreases with increasing network size. In this context, suggest a new way to extend the recital of routing in MANETs: the on-demand Progressive Distance Vector (PAODV). It is a modified variant of the standard AODV routing protocol, which shrinks the dynamic path when an optimal path exists and switches the traffic to it. Simulation studies with NS2 show that the proposed method improves network performance as network size, weight, or flexibility increase.

2017 ◽  
Vol 13 (1) ◽  
pp. 155014771668360 ◽  
Author(s):  
Young-jun Oh ◽  
Kang-whan Lee

Mobile ad hoc networks comprise mobile nodes. The nodes both send and receive messages and can communicate with each other. Thus, the network builds its own network structure that is not dependent on the infrastructure. Owing to the characteristics of mobile ad hoc networks, they have been used in environments of poor communication, such as those in which the infrastructure cannot be built; for example, disaster areas and war zones. In this article, we propose an advanced energy-conserving optimal path schedule algorithm. The proposed algorithm sets the routing path using the relative angle, which is the distance between the source node and the base station. Using simulation results, we compared the proposed algorithm to existing algorithms. The protocol used by the proposed algorithm provides a higher packet delivery ratio and lower energy consumption than the lowest ID clustering algorithm and the mobility-based metric for clustering in the mobile ad hoc network algorithm.


2009 ◽  
Vol 20 (11) ◽  
pp. 3086-3100
Author(s):  
Yi WANG ◽  
Liang DONG ◽  
Tao-Tao LIANG ◽  
Xin-Yu YANG ◽  
De-Yun ZHANG

Author(s):  
Chi-Kin Chau ◽  
Jon Crowcroft ◽  
Kang-Won Lee ◽  
Starsky H.Y. Wong

Because of the increasing number of diverse routing protocols proposed to deal with the network dynamics in mobile ad hoc networks (MANETs), the heterogeneity of MANETs has increased dramatically. While many of these extant proposals only concern enhancing routing in a single domain, little attention has been given to the interoperations among heterogeneous MANETs. Moreover, the existing inter-domain routing protocols (i.e., BGP) that have been designed for the Internet cannot cope with the new challenges derived from the MANETs, such as (1) the rapid dynamic changes of network topology due to mobility, and (2) the larger diversity in intra-domain ad hoc routing protocols. In this chapter, the authors address some of the major challenges and identify new directions to the development of seamless inter-domain routing for enabling end-to-end communications over heterogeneous MANET domains.


Sign in / Sign up

Export Citation Format

Share Document