New efficient velocity-aware probabilistic route discovery schemes for high mobility Ad hoc networks

Khalaf, Mustafa Bani; Al‐Dubai, Ahmed; Min, Geyong

doi:10.1016/j.jcss.2014.06.014

Cited by 22 publications

(21 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Other scholars have proposed different solutions to overcome the link prediction problems of the route in AODV, for example Khan et al (2011) proposed that node should cancels its retransmission if it has a density degree above a predefined density threshold. Another example in Khalaf et al (2015) that utilized the probabilistic concept to develop new probabilistic routing schemes, namely Simple Velocity Aware Probabilistic (SVAP) and Advanced Velocity Aware Probabilistic (AVAP) route discovery schemes for the aim of solving the frequent link breakages problem. However, these methods do not consider connectivity and power limitation issues in ad-hoc networks.…”

Section: Review Of Literaturementioning

confidence: 99%

“…We attempted to provide a better performance for AODV routing protocol of the method mentioned in previous works of Khalaf et al (2015). This was achieved by combining the technique of velocity-aware probabilistic route discovery schemes for high mobility Ad hoc networks proposed by Khalaf et al (2015) with the with link prediction in Mobile Adhoc Networks proposed by Yadav et al (2015).…”

Section: Fig 1 Research Designmentioning

confidence: 99%

“…This was achieved by combining the technique of velocity-aware probabilistic route discovery schemes for high mobility Ad hoc networks proposed by Khalaf et al (2015) with the with link prediction in Mobile Adhoc Networks proposed by Yadav et al (2015). The reason for doing so back to the feasibility of link prediction technique in advancing the velocity-aware probabilistic by estimating any potential link breakage among nodes and warns the other nodes about it in the route.…”

Section: Fig 1 Research Designmentioning

confidence: 99%

See 2 more Smart Citations

Improving Routing Discovery Based Velocity-Aware Probabilistic Using AODV with Link Prediction in Mobile Ad-hoc Networks

Bassfar

2017

American Journal of Applied Sciences

View full text Add to dashboard Cite

Abstract:The current process associated with enhancing the QoS in routing for MANETs has reserved a high importance due to the limitation of available route discovery in dynamic topology. The conventional methods of route discovery schemes in MANETs are commonly designed in order to estimate the number of nodes in routes using the standard probabilistic models. Such models are utilized by estimating the flood in a network using the RREQ packets. However, the current development in mobility, frequent breakages become more common which as a result lead to relocate the properties of same routes. As such, the network may experience additional demands for channel contention and high packets collision rate. For this, we proposed a new scheme for enhancing the routing discovery based velocity-aware probabilistic using AODV properties with link prediction in MANETs. The result of the new scheme was found to outperform the old one in which it offers better ROH, throughput and delay time. This study provides an important insight for predicting the routing failure in a network when using the velocity-aware probabilistic scheme alone.

show abstract

Section: Review Of Literaturementioning

confidence: 99%

Section: Fig 1 Research Designmentioning

confidence: 99%

Section: Fig 1 Research Designmentioning

confidence: 99%

See 1 more Smart Citation

Improving Routing Discovery Based Velocity-Aware Probabilistic Using AODV with Link Prediction in Mobile Ad-hoc Networks

Bassfar

2017

American Journal of Applied Sciences

View full text Add to dashboard Cite

show abstract

“…In [5,8], authors have presented distinct schemes to minimize repeated rebroadcasts as well to disperse rebroadcasts timing to relieve this trouble. Broadcast schemes have been classified by Williams and Camp [9] into four broad classes; the probability-based schemes, the distance-based schemes, the cluster-based schemes, as well as the counterbased schemes.…”

Section: Related Workmentioning

confidence: 99%

“…Authors in [9] used rapidity percipient probabilistic-route-discovery paradigms so they have the ability to eliminate the uneasy nodes through establishing routes among source node as well as its destination. Bani Yassein et al [15] presented a probabilistic distance, using the fuzzy logic.…”

Section: Related Workmentioning

confidence: 99%

A Novel Broadcast Scheme DSR-based Mobile Adhoc Networks

Yassein¹,

Al‐Dubai²

2016

ijacsa

View full text Add to dashboard Cite

Abstract-Traffic classification aims at assigning packet flows to adequate Quality of Service (QoS) aware transmission. Although a great deal of research was conducted on broadcast communication in ad-hoc networks, broadcasting is still a challenging issue. Although blind flooding is considered as the most well-known broadcasting mechanism, it is inefficient in terms of communication and resource utilization. Alternatively, the counter based broadcast scheme is one of the diversified efficacious schemes to alleviate blind flooding scarcity where it counts, on the received redundant packet number over the node and its neighbours, whereas the node contrasts the redundant packet itself as well as each neighbour node which has already rebroadcasted a packet. Currently, the existing counter-based schemes are mostly based on a fixed counter based approach. However, these schemes cannot perform efficiently in various operating conditions. Thus, unlike existing solutions, this paper suggests a dynamic counter-based threshold value and investigates its effectiveness within the renowned reactive routing protocols, namely, Dynamic Source Routing Protocol (DSR). Precisely, we develop a novel broadcasting counter-based algorithm, namely Inspired Counter-Based Broadcasting (DSR-ICB). DSR-ICB, through diversified simulation experiments, has demonstrated superior performance especially in terms of delay as well as redundant packets rate.

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

New efficient velocity-aware probabilistic route discovery schemes for high mobility Ad hoc networks

Cited by 22 publications

References 5 publications

Improving Routing Discovery Based Velocity-Aware Probabilistic Using AODV with Link Prediction in Mobile Ad-hoc Networks

Improving Routing Discovery Based Velocity-Aware Probabilistic Using AODV with Link Prediction in Mobile Ad-hoc Networks

A Novel Broadcast Scheme DSR-based Mobile Adhoc Networks

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

Contact Info

Product

Resources

About