A Constrained Coding-Aware Routing Scheme in Wireless Ad-Hoc Networks

Zhao, Yao; Xiao, Song; Gan, Hongping; Li, Lizhao; Xiao, Lina

doi:10.3390/s19102252

Cited by 3 publications

(1 citation statement)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The verification method can determine whether a link can carry out data transmission. In wireless networks, it is often possible to provide validation at no cost [23]. If a retransmission of a confirmation request has reached the maximum allowable number of retransmissions and no response is received, the sending node considers that the link to the next hop has been broken, removes the link from its routing memory, and returns to the source node with a routing error [24].…”

Section: Routing Maintenance Mechanismmentioning

confidence: 99%

A dynamic source routing protocol based on path reliability and link monitoring repair

Qing

Lin

et al. 2021

PLoS ONE

View full text Add to dashboard Cite

The two most essential factors for mobile self-organizing networks applicable to drones are reliability and stability. In harsh communication environments, such as mountainous regions and natural disasters, the use of satellites and terrestrial communication stations has severe time delays due to the high speed of UAVs, resulting in frequent communication interruptions with UAVs. Therefore, UAVs need to establish self-organizing networks for communication and information sharing. High-speed movement will lead to rapid changes in the network topology, resulting in established links being in an unstable connection state and even frequent routing errors, thus preventing the establishment of stable communication links. In order to improve the communication quality of UAVs under high-speed movement, we propose a dynamic source routing protocol based on path reliability and monitoring repair mechanism (DSR-PM). The model performs data transmission by filtering the best reliability path. The link state information is monitored during transmission and broken links are repaired in time to ensure the communication stability and reliability of the links and improve the data transmission efficiency. We simulated the approach in NS2 software and the simulation results show that the DSR-PM protocol effectively reduces parameters such as overhead, packet loss and delay, improves network throughput, and provides better communication performance.

show abstract

Section: Routing Maintenance Mechanismmentioning

confidence: 99%

A dynamic source routing protocol based on path reliability and link monitoring repair

Qing

Lin

et al. 2021

PLoS ONE

View full text Add to dashboard Cite

show abstract

Distributed Network Coding-Aware Routing Protocol Incorporating Fuzzy-Logic-Based Forwarders in Wireless Ad hoc Networks

Rafiee

Mirjalily

2020

J Netw Syst Manage

View full text Add to dashboard Cite

Detection and isolation of wormhole nodes in wireless ad hoc networks based on post-wormhole actions

Bhatti,

Saleem,

Imran

et al. 2024

Sci Rep

View full text Add to dashboard Cite

The wormhole attack is one of the most treacherous attacks projected at the routing layer that can bypass cryptographic measures and derail the entire communication network. It is too difficult to prevent a priori; all the possible countermeasures are either too expensive or ineffective. Indeed, literature solutions either require expensive hardware (typically UWB or secure GPS transceivers) or pose specific constraints to the adversarial behavior (doing or not doing a suspicious action). The proposed solution belongs to the second category because the adversary is assumed to have done one or more known suspicious actions. In this solution, we adopt a heuristic approach to detect wormholes in ad hoc networks based on the detection of their illicit behaviors. Wormhole and post wormhole attacks are often confused in literature; that’s why we clearly state that our methodology does not provide a defence against wormholes, but rather against the actions that an adversary does after the wormhole, such as packet dropping, tampering with TTL, replaying and looping, etc. In terms of contributions, the proposed solution addresses the knock-out capability of attackers that is less targeted by the researcher’s community. In addition, it neither requires any additional hardware nor a change in it; instead, it is compatible with the existing network stack. The idea is simulated in ns2.30, and the average detection rate of the proposed solution is found to be 98-99%. The theoretical time to detect a wormhole node lies between 0.07-0.71 seconds. But, from the simulation, the average detection and isolation time is 0.67 seconds. In term of packet loss, the proposed solution has a relatively overhead of $$\approx$$ ≈ 22%. It works well in static and mobile scenarios, but the frame losses are higher in mobile scenarios as compared to static ones. The computational complexity of the solution is O(n). Simulation results advocate that the solution is effective in terms of memory, processing, bandwidth, and energy cost. The solution is validated using statistical parameters such as Accuracy, Precision, F1-Score and Matthews correlation coefficient ($$M_{cc}$$ M cc ).

show abstract

A Constrained Coding-Aware Routing Scheme in Wireless Ad-Hoc Networks

Cited by 3 publications

References 43 publications

A dynamic source routing protocol based on path reliability and link monitoring repair

A dynamic source routing protocol based on path reliability and link monitoring repair

Distributed Network Coding-Aware Routing Protocol Incorporating Fuzzy-Logic-Based Forwarders in Wireless Ad hoc Networks

Detection and isolation of wormhole nodes in wireless ad hoc networks based on post-wormhole actions

Contact Info

Product

Resources

About