An Adaptive Backoff Algorithm for Mobile Ad-Hoc Networks

2011 ◽  
Vol 3 (3) ◽  
pp. 1-19 ◽  
Author(s):  
Yaser Khamayseh ◽  
Muneer Bani Yassein ◽  
Iman I. Badran ◽  
Wail Mardini
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Adaptive Strategy ◽  
Delay Performance ◽  
Backoff Algorithm ◽  
End To End Delay ◽  
Mobile Ad Hoc ◽  
Two Phases ◽  
Hoc Networks

Collision is a common problem in Mobile Ad Hoc Networks (MANETs). There are several backoff algorithms that have been proposed to avoid this problem. This paper proposes a new backoff algorithm called the Square Root Backoff (SRB). Moreover, it identifies that no algorithm can perform the best in all cases. Therefore, an adaptive strategy is proposed to choose the best backoff mechanism from a set of mechanisms based on network density and mobility parameters. The proposed adaptive algorithm is implemented in two phases, the offline phase and the online phase. Such design aims at reducing the time complexity of the algorithm by performing some of the computations prior to the actual deployment and of the network. Results from simulations demonstrate that the SRB algorithm achieved better performance than BEB and LB. Moreover, the adaptive backoff algorithm obtains the best throughput and end-to-end delay performance over the other backoff algorithms.

An Adaptive Backoff Algorithm for Mobile Ad-Hoc Networks

2012 ◽  
pp. 236-254
Author(s):  
Yaser Khamayseh ◽  
Muneer Bani Yassein ◽  
Iman I. Badran ◽  
Wail Mardini
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Adaptive Algorithm ◽  
Ad Hoc ◽  
Adaptive Strategy ◽  
Delay Performance ◽  
Backoff Algorithm ◽  
Mobile Ad Hoc ◽  
Two Phases ◽  
Hoc Networks

Collision is a common problem in Mobile Ad Hoc Networks (MANETs). There are several backoff algorithms that have been proposed to avoid this problem. This paper proposes a new backoff algorithm called the Square Root Backoff (SRB). Moreover, it identifies that no algorithm can perform the best in all cases. Therefore, an adaptive strategy is proposed to choose the best backoff mechanism from a set of mechanisms based on network density and mobility parameters. The proposed adaptive algorithm is implemented in two phases: the offline phase and the online phase. Such design aims at reducing the time complexity of the algorithm by performing some of the computations prior to the actual deployment and of the network. Results from simulations demonstrate that the SRB algorithm achieved better performance than BEB and LB. Moreover, the adaptive backoff algorithm obtains the best throughput and end-to-end delay performance over the other backoff algorithms.

scholarly journals Performance Comparison of IACO,AODV Networking Routing Protocols

2011 ◽  
pp. 33-37
Author(s):  
Miss Shweta Mod ◽  
Mr. Jitendra Prithvira
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Performance Comparison ◽  
Delivery Ratio ◽  
End To End Delay ◽  
Distance Vector ◽  
Mobile Ad Hoc ◽  
Hoc Networks

There are several standard protocols for Mobile Ad hoc Networks (MANET) that have been developed for devices with higher computing features. The Efficient routing protocols can provide significant benefits to mobile ad hoc networks, in terms of both performance and reliability. Many routing protocols for such networks have been proposed so far. Amongst the most popular ones are Ad hoc On-demand Distance Vector (AODV), Improved Ant Colony Optimization (IACO). In this paper we present our observations regarding the performance comparison of the above protocols in mobile ad hoc networks (MANETs). We perform extensive simulations, using NS-2 simulator. The Average end-to-end delay and the Packet Delivery Ratio have been considered as the two performance parameters

scholarly journals Adaptive Strategy to Change Firing Phases of Collided Nodes in Extended-Desync TDMA-Based MANETs

Sensors ◽  
2021 ◽  
Vol 21 (20) ◽  
pp. 6776
Author(s):  
Cheol-Woong Lee ◽  
Gyu-Min Lee ◽  
Byeong-Hee Roh
Keyword(s):  
Mathematical Model ◽  
Comparative Analysis ◽  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Potential Problem ◽  
Adaptive Strategy ◽  
Packet Delivery ◽  
Mobile Ad Hoc ◽  
Hoc Networks

As a multi-hop extension of the desynchronization-based TDMA (Desync-TDMA), the extended Desync-TDMA (Ext-Desync) with self-adapting property is proposed to overcome the limitations of existing CSMA/CA and dynamic TDMA-based schemes for Mobile Ad-hoc Networks (MANETs). However, existing studies overlooked the potential problem of firing message collisions caused by node movements, leading to the severe degradation of MANET networking performance. In this paper, we derive a mathematical model to evaluate the problem due to collisions of firing messages for moving nodes. With the derived model, we propose a method for a collided node to determine whether it changes its firing phase or not, adaptively in a distributed manner, by considering both the collision situation and the slot utilization. The comparative analysis between the proposed method and existing representative ones is also presented for various networking features. The performances of the proposed method are compared with CSMA/CA as well as other existing Ext-Desync-based schemes. The numerical results show that the proposed method achieved much faster resolution and higher slot utilization in collision situations than other Ext-Desync-based schemes. In addition, we also show that the proposed method outperformed the comparable methods, including CSMA/CA, in terms of packet delivery ratios and end-to-end delays.

scholarly journals A_WCETT: Giao thức cải thiện hiệu năng mạng di động tùy biến 5G dựa trên tác tử di động

2017 ◽  
pp. 14
Author(s):  
Vũ Khánh Quý
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocol ◽  
Loss Rate ◽  
Ad Hoc ◽  
End To End Delay ◽  
Distance Vector ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Throughput And Delay

This paper presents a modification of a well-known routing protocol, namely Ad hoc On-Demand Distance Vector, as a solution to improve the performance of mobile ad hoc networks in 5G. We adapted the mobile agent technology and a novel metric for routing in those networks. The metric is a function of the loss rate, the bandwidth and the end-to-end delay of the link. In deed, we established a new tunable parameter to obtain a tradeoff between throughput and delay when computing the new metric. As a result, any routing protocol using this metric can always choose a high-throughput and low-delay path between a source and a destination. Hence, the achievable performance of the mobile ad hoc networks in 5G has been improved remarkably with our modified routing protocol. 

Sign in / Sign up

Export Citation Format

Share Document