Performance comparison of modified AODV in reference point group mobility and random waypoint mobility models

Author(s):  
Harris Simaremare ◽  
Abdusy Syarif ◽  
Abdelhafid Abouaissa ◽  
Riri Fitri Sari ◽  
Pascal Lorenz
2008 ◽  
Vol 2008 ◽  
pp. 1-10 ◽  
Author(s):  
Geetha Jayakumar ◽  
Gopinath Ganapathi

Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols plays an important role. We compare the performance of two prominent on-demand routing protocols for mobile ad hoc networks: dynamic source routing (DSR), ad hoc on-demand distance vector routing (AODV). A detailed simulation model with medium access control (MAC) and physical layer models is used to study the interlayer interactions and their performance implications. We demonstrate that even though DSR and AODV share similar on-demand behavior, the differences in the protocol mechanisms can lead to significant performance differentials. In this paper, we examine both on-demand routing protocols AODV and DSR based on packet delivery ratio, normalized routing load, normalized MAC load, average end-to-end delay by varying the node density, network loading, and mobility variations for reference point group mobility and random waypoint models. This framework aims to evaluate the effect of mobility models on the performance of mobile ad hoc networks (MANETs) routing protocols. Our results show that the protocol performance may vary drastically across mobility models and performance rankings of protocols may vary with the mobility models used. This effect can be explained by the interaction of the mobility characteristics with the connectivity graph properties.


Author(s):  
Ohm Sornil

This article describes how P2P resource discovery protocols perform poorly over mobile ad hoc networks mainly due to the frequent network dynamics. Peer-to-Peer search techniques including structured and unstructured can be employed over MANETs. Empirical studies indicate that searching in such resultant networks are not efficient and effective due to peer discovery, connectivity and mobility issues. The author proposes Addressed Query Gossip Resource Discovery algorithm, a lightweight resource discovery designed to suit the mobility requirements of ad hoc networks to optimize the search performance while at the same time minimize the extra usage of mobile and network resources. Mobility models represent the movements of mobile nodes. Such models are used to represent how the location, velocity and acceleration change over time. The author conducts performance analyses of the proposed protocol and widely used unstructured search techniques over MANET under 2 realistic mobility models, i.e., Random Waypoint and Reference Point Group Mobility models. The results show that the proposed protocol has the best performance in almost every measured metrics. In addition, the protocol consumes less energy, has less message overhead and good success ratio for random waypoint movement as compared to the reference group mobility model. After extensive evaluations, the simulation results clarify that the mobility models have a significant impact on the performance of peer-to-peer content discovery protocols over mobile ad hoc networks.


2015 ◽  
Vol 85 (3) ◽  
pp. 1317-1331 ◽  
Author(s):  
Cherry Ye Aung ◽  
Boon Chong Seet ◽  
Mingyang Zhang ◽  
Ling Fu Xie ◽  
Peter Han Joo Chong

Sign in / Sign up

Export Citation Format

Share Document