A new efficient distributed route discovery for wireless mobile ad hoc networks

Khalaf, Mustafa Bani; Al‐Dubai, Ahmed; Buchanan, William J.

doi:10.1109/wts.2012.6266129

Cited by 3 publications

(4 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are many reactive routing protocols in the literature to search a route within the network area [14][15][16]. The conventional approach is to locate the destination with simple flooding, in which the source node broadcasts the RREQ packet in the entire network.…”

Section: Related Workmentioning

confidence: 99%

Distributed Destination Search Routing for 5G and beyond Networks

Waqas

Saeed

Mahmood

et al. 2022

Sensors

View full text Add to dashboard Cite

Fifth-generation and beyond networks target multiple distributed network application such as Internet of Things (IoT), connected robotics, and massive Machine Type Communication (mMTC). In the absence of a central management unit, the device need to search and establish a route towards the destination before initializing data transmission. In this paper, we proposes a destination search and routing method for distributed 5G and beyond networks. In the proposed method, the source node makes multiple attempts to search for a route towards the destination by expanding disk-like patterns originating from the source node. The source node increases the search area in each attempt, accommodating more nodes in the search process. As a result, the probability of finding the destination increases, which reduces energy consumption and time delay of routing. We propose three variants of routing for high, medium, and low-density network scenarios and analyze their performance for various network configurations. The results demonstrate that the performance of the proposed solution is better than previously proposed techniques in terms of time latency and reduced energy consumption, making it applicable for 5G and beyond networks.

show abstract

Section: Related Workmentioning

confidence: 99%

Distributed Destination Search Routing for 5G and beyond Networks

Waqas

Saeed

Mahmood

et al. 2022

Sensors

View full text Add to dashboard Cite

show abstract

“…There are also a lot of approaches give their unique solutions. Bani Khalaf M. et al [10] proposed a new distributed route discovery scheme to handle the broadcast operation efficiently by reducing the number of the broadcast redundancy request packets and the number of collision and contentions. In [11], Lukas Wallentin et al proposed a new cross layer optimized route discovery scheme using a distributed route pre-selection technique in combination with artificial delaying of route discovery packets.…”

Section: Related Workmentioning

confidence: 99%

A Novel Approach for Efficient Route Request Flooding in MANETs with Directional Antennas

Qian

Zhang²,

Wu³

et al. 2014

Proceedings of the 2nd International Conference on Soft Computing in Information Communication Technology

View full text Add to dashboard Cite

In recent years, using directional antennas to reduce the amount of interference and collisions in mobile ad hoc networks has become more and more popular. Due to the problem of broadcast storm caused by flooding route requests, a novel route request flooding approach called Hexagonal Flooding Strategy (HFS) for Ad Hoc networks using directional antennas is introduced in this paper. With directional antennas, the flooding of route request packets is limited among selected forwarding nodes. By constructing a honeycomb pattern, the forwarding nodes which form the honeycomb vertices are selected. The transmissions between forwarding nodes which form the honeycomb edges are reshaped according to certain rules to optimize flow directions. Through simulations we evaluate the performance of HFS using route discovery success rate, average number of nodes and forwardings involved in the route discovery process. Simulation results show that HFS can: (a) improve route discovery success rate, (b) reduce the number of nodes and forwardings involved in the route discovery process.

show abstract

“…Assume = V (V is the average speed of mobile node) and substitute ⋅ Δ for ⋅ Δ from formula (11). We get…”

Section: Encountered Recentlymentioning

confidence: 99%

“…In probabilistic algorithms [8][9][10][11], intermediate nodes forward the message based on a fixed or dynamic probability. The number of the forwarding nodes is reduced greatly, while the broadcast is still omnidirectional as shown in Figure 1.…”

Section: Introductionmentioning

confidence: 99%

An Improved Directional Broadcast Algorithm Based on Brownian Motion

Lou

Wang

et al. 2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Several broadcast algorithms have been developed in recent years. However, the problem of reducing routing overhead in ad hoc networks is always to be concerned. This paper proposes an improved directional broadcast algorithm based on Brownian motion for AODV protocol (DBB-AODV). We bring Brownian motion into network model and gain the distribution of the nodes which encountered destination before. This algorithm uses encounter records to predict the direction to destination and forwards RREQ packets with reasonable probability according to the distribution just mentioned. Simulation results indicate that DBB-AODV saves up to 20% of average routing overhead compared to the probabilistic protocol and about 80% of the blind flooding.

show abstract

A new efficient distributed route discovery for wireless mobile ad hoc networks

Abstract: Abstract-

Cited by 3 publications

References 17 publications

Distributed Destination Search Routing for 5G and beyond Networks

Distributed Destination Search Routing for 5G and beyond Networks

A Novel Approach for Efficient Route Request Flooding in MANETs with Directional Antennas

An Improved Directional Broadcast Algorithm Based on Brownian Motion

Contact Info

Product

Resources

About