A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks

2013 ◽  
Vol 12 (3) ◽  
pp. 424-433 ◽  
Author(s):  
Xin Ming Zhang ◽  
En Bo Wang ◽  
Jing Jing Xia ◽  
Dan Keun Sung
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Overhead ◽  
Mobile Ad Hoc ◽  
Hoc Networks

scholarly journals Security Enhanced Location-aided Level-based Disjoint Multipath Routing Algorithm for Mobile Ad Hoc Networks

2019 ◽  
Vol 26 (4) ◽  
pp. 251-265
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Multipath Routing ◽  
Routing Overhead ◽  
Secure Data Transmission ◽  
Multiple Paths ◽  
Mobile Ad Hoc ◽  
Hoc Networks

In mobile ad hoc networks (MANET), the location-based multipath routing protocols involves less routing overhead compared to non-location-based protocols. This paper proposes two location-based algorithms, Enhanced Location-aided Level-based node Disjoint Multipath routing (ELLDMR) and Secure Location-aided Level-based node Disjoint Multipath routing (SLLDMR), to enhance the link lifetime and the security of the MANET. The objective of ELLDMR is to build multiple paths with non-critical nodes so that the lifetime of the routing path is significantly increased. It also hides the source, destination and path identity in intermediate nodes to avoid intrusion of routing attacks in the routing path. The SLLDMR is an enhancement over ELLDMR where it aims to overcome rushing attack and exhibit secure data transmission using two-level cryptographic processes. The performances of ELLDMR and SLLDMR are simulated using NS2 where it shows a minimum routing overhead, less end to end delay and high packet delivery compared to existing Location-aided Level-based node Disjoint Multipath routing (LLDMR) algorithm and Topology Hiding multipath protocol (TOHIP).

Neighbor Knowledge-based Rebroadcast algorithm for minimizing the routing overhead in Mobile Ad-hoc Networks

2019 ◽  
Vol 93 ◽  
pp. 101896 ◽  
Author(s):  
Y. Harold Robinson ◽  
R. Santhana Krishnan ◽  
E. Golden Julie ◽  
Raghvendra Kumar ◽  
Le Hoang Son ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Overhead ◽  
Knowledge Based ◽  
Mobile Ad Hoc ◽  
Hoc Networks

scholarly journals Reducing the Routing Overhead in Secure Mobile AD HOC Networks

2020 ◽  
Vol V9 (05) ◽  
Author(s):  
R. Pravallika ◽  
G. Anusha ◽  
S. Girija ◽  
Rajeswari Laxmi, G. Hyndavi ◽  
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Overhead ◽  
Mobile Ad Hoc ◽  
Hoc Networks

scholarly journals DYMO Self-Forwarding: A Simple Way for Reducing the Routing Overhead in MANETs

2017 ◽  
Vol 2017 ◽  
pp. 1-9
Author(s):  
Enrica Zola ◽  
Francisco Barcelo-Arroyo ◽  
Israel Martin-Escalona
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Routing Overhead ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Gps Devices ◽  
The Impact ◽  
Control Packets

Current routing protocols in Mobile Ad hoc Networks tend to use information on the position of the nodes in order to improve their features. In fact, without this information, protocols are hardly scalable since they tend to overflow the radio media with control packets, most of them being useless at the end. This paper presents the assessment of a modification of the DYMO protocol in order to include and use positioning information. The evaluation is carried out through simulations in realistic environments and connectivity condition. The possible error in the position is seldom considered in this kind of studies but here taken into account to catch the impact of realistic GPS devices or other sources of location techniques.

Sign in / Sign up

Export Citation Format

Share Document