Mobility and Direction Aware Ad-hoc on Demand Distance Vector Routing Protocol

Swidan, Andraws; Abdelghany, Haytham Bani; Saifan, Ramzi; Žilić, Željko

doi:10.1016/j.procs.2016.08.011

Cited by 17 publications

(12 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nodes with high mobility in the cache were deleted according to the node stability and the congestion degree. The premise of the protocol proposed by Swidana, A. et al [16] was that the velocity of the node had been measured before, the basic idea of which was to prevent high mobility nodes from participating in route discovery. Khalaf, M. et al [17] proposed two probability models for speed perception, with which two protocols were proposed by improving the ad-hoc on-demand distance vector (AODV) [18] routing algorithm.…”

Section: Topology Change Perception Methods and Processing Methodsmentioning

confidence: 99%

“…Neighbor node or link mobility awareness [10][11][12][13][14][15][16][17]19,20]. • Neighbor node mobility awareness combined with congestion level perception [11,12,15].…”

mentioning

confidence: 99%

“…These mobility aware methods can also be divided into location aided [11,13,14,16,17] and non-location aided [10,12,15,19,20]. The former refers to estimating the neighbor node/path mobility by means of information from auxiliary devices, such as global positioning system (GPS) receivers, with the advantage of simple and fast calculation and the disadvantage of introducing GPS errors and new interference.…”

mentioning

confidence: 99%

“…• Selecting stable node/link during route discovery [10][11][12][13]17,19]. • Excluding or preventing high mobility nodes from participating in route discovery [15,16].…”

mentioning

confidence: 99%

See 3 more Smart Citations

TARCS: A Topology Change Aware-Based Routing Protocol Choosing Scheme of FANETs

Hong

Zhang

2019

Electronics

View full text Add to dashboard Cite

The rapid change of topology is one of the most important factors affecting the performance of the routing protocols of flying ad hoc networks (FANETs). A routing scheme suitable for highly dynamic mobile ad hoc networks is proposed for the rapid change of topology in complex scenarios. In the scheme moving nodes sense changes of the surrounding network topology periodically, and the current mobile scenario is confirmed according to the perceived result. Furthermore, a suitable routing protocol is selected for maintaining network performances at a high level. The concerned performance metrics are packet delivery ratio, network throughput, average end-to-end delay and average jitter. The experiments combine the random waypoint model, the reference point group mobility model and the pursue model to a chain scenario, and simulate the large changes of the network topology. Results show that an appropriate routing scheme can adapt to rapid changes in network topology and effectively improve network performance. Abstract:The rapid change of topology is one of the most important factors affecting the performance of the routing protocols of flying ad hoc networks (FANETs). A routing scheme suitable for highly dynamic mobile ad hoc networks is proposed for the rapid change of topology in complex scenarios. In the scheme moving nodes sense changes of the surrounding network topology periodically, and the current mobile scenario is confirmed according to the perceived result. Furthermore, a suitable routing protocol is selected for maintaining network performances at a high level. The concerned performance metrics are packet delivery ratio, network throughput, average end-to-end delay and average jitter. The experiments combine the random waypoint model, the reference point group mobility model and the pursue model to a chain scenario, and simulate the large changes of the network topology. Results show that an appropriate routing scheme can adapt to rapid changes in network topology and effectively improve network performance.

show abstract

Section: Topology Change Perception Methods and Processing Methodsmentioning

confidence: 99%

“…Neighbor node or link mobility awareness [10][11][12][13][14][15][16][17]19,20]. • Neighbor node mobility awareness combined with congestion level perception [11,12,15].…”

mentioning

confidence: 99%

mentioning

confidence: 99%

“…• Selecting stable node/link during route discovery [10][11][12][13]17,19]. • Excluding or preventing high mobility nodes from participating in route discovery [15,16].…”

mentioning

confidence: 99%

See 2 more Smart Citations

TARCS: A Topology Change Aware-Based Routing Protocol Choosing Scheme of FANETs

Hong

Zhang

2019

Electronics

View full text Add to dashboard Cite

show abstract

“…TCP delivers reliability by starting a timer whenever it transmits a segment. If it does not receive a confirmation from the receiver within the time limit, otherwise, it retransmits the segment (Meherand Kulkarni, 2011;Swidan et al, 2016). Different kinds of TCPvariants are available with diverse congestion control technique.…”

Section: Introductionmentioning

confidence: 99%

Dynamic TCP-Vegas based on cuckoo search for efficient congestion control for MANET

Sunitha¹,

Nagaraju

Narsimha

2017

IJSISE

View full text Add to dashboard Cite

In the internet congestion control, transmission control protocol (TCP)-Vegas is a source algorithm that provides better performance. However, it has two main issues: first one is rerouting and unable to identify updation of round-trip time (RTT) when changes occurred in the network, these two problems leads to affects the performance of Vegas. These drawbacks persist mostly in the Vegas estimation process of the propagation delay, i.e. BaseRTT. In this paper, we proposed a novel algorithm that uses the cuckoo search optimisation algorithm for selecting the optimal value of BaseRTT. Also, our proposed algorithm has dynamically considered slow start algorithm based on the estimation in real time, the available bandwidth and adjust decrease/ increase rate in congestion avoidance phase for a particular network environment. Simulation results have shown that our proposed algorithm can effectively avoid packet losses and attain the maximum throughput when compared with existing algorithms.

show abstract

Modified Light Weight distributed QoS Algorithm for wide area ad hoc networks

Ghazani

2018

Int J Communication

View full text Add to dashboard Cite

Summary The direction and velocity of a node are the most important parameters to create a valuable path in ad hoc networks. A valuable path is one that has a longer life time and more durability than others. As we know, the durability of a path is under the influence of the nodes' velocity. This paper proposes an algorithm to provide QoS in ad hoc networks. The proposed algorithm entitled Modified Light Weight distributed QoS Algorithm, considering the direction and relative velocity of the nodes and predicting the value of link durability, chooses a path with longer duration time, minimizes the link breaks, and improves QoSs. We implemented it in a simulation environment by using the Network Simulator Version 2 software and evaluated the effectiveness of it in packet delivery ratio, packet delivery latency, average end‐to‐end delay, routing overhead, and dropped packets. The simulation results demonstrate that Modified Light Weight distributed QoS Algorithm improves the QoS parameters in ad hoc networks.

show abstract

Mobility and Direction Aware Ad-hoc on Demand Distance Vector Routing Protocol

Cited by 17 publications

References 7 publications

TARCS: A Topology Change Aware-Based Routing Protocol Choosing Scheme of FANETs

TARCS: A Topology Change Aware-Based Routing Protocol Choosing Scheme of FANETs

Dynamic TCP-Vegas based on cuckoo search for efficient congestion control for MANET

Modified Light Weight distributed QoS Algorithm for wide area ad hoc networks

Contact Info

Product

Resources

About