A Novel Dynamic Noise-Dependent Probabilistic Algorithm for Route Discovery in MANETs

2013 ◽  
pp. 52-68
Author(s):  
Hussein Al-Bahadili ◽  
Alia Sabri
Keyword(s):  
Noise Level ◽  
Ad Hoc ◽  
Network Services ◽  
Route Discovery ◽  
Probabilistic Algorithm ◽  
Dynamic Noise ◽  
Wide Range ◽  
Simulation Results ◽  
Hoc Networks ◽  
Broadcasting Algorithm

In mobile ad hoc networks (MANETs), broadcasting is widely used in route discovery and other network services. The most widely used broadcasting algorithm is simple flooding, which aggravates a high number of redundant packet retransmissions, causing contention and collisions. Proper use of dynamic probabilistic algorithm significantly reduces the number of retransmissions, which reduces the chance of contention and collisions. In current dynamic probabilistic algorithm, the retransmission probability (pt) is formulated as a linear/non-linear function of a single variable, the number of first-hop neighbors (k). However, such algorithm is suffers in the presence of noise due to increasing packet-loss. In this paper, the authors propose a new dynamic probabilistic algorithm in which ptis determined locally by the retransmitting nodes considering both k and the noise-level. This algorithm is referred to as the dynamic noise-dependent probabilistic (DNDP) algorithm. The performance of the DNDP algorithm is evaluated through simulations using the MANET simulator (MANSim). The simulation results show that the DNDP algorithm presents higher network reachability than the dynamic probabilistic algorithm at a reasonable increase in the number of retransmissions for a wide range of noise-level. The effects of nodes densities and nodes speeds on the performance of the DNDP algorithm are also investigated.

A Novel Dynamic Noise-Dependent Probabilistic Algorithm for Route Discovery in MANETs

2011 ◽  
Vol 7 (1) ◽  
pp. 52-67 ◽  
Author(s):  
Hussein Al-Bahadili ◽  
Alia Sabri
Keyword(s):  
Noise Level ◽  
Ad Hoc ◽  
Network Services ◽  
Route Discovery ◽  
Probabilistic Algorithm ◽  
Dynamic Noise ◽  
Wide Range ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Broadcasting Algorithm

In mobile ad hoc networks (MANETs), broadcasting is widely used in route discovery and other network services. The most widely used broadcasting algorithm is simple flooding, which aggravates a high number of redundant packet retransmissions, causing contention and collisions. Proper use of dynamic probabilistic algorithm significantly reduces the number of retransmissions, which reduces the chance of contention and collisions. In current dynamic probabilistic algorithm, the retransmission probability (pt) is formulated as a linear/non-linear function of a single variable, the number of first-hop neighbors (k). However, such algorithm is suffers in the presence of noise due to increasing packet-loss. In this paper, the authors propose a new dynamic probabilistic algorithm in which pt is determined locally by the retransmitting nodes considering both k and the noise-level. This algorithm is referred to as the dynamic noise-dependent probabilistic (DNDP) algorithm. The performance of the DNDP algorithm is evaluated through simulations using the MANET simulator (MANSim). The simulation results show that the DNDP algorithm presents higher network reachability than the dynamic probabilistic algorithm at a reasonable increase in the number of retransmissions for a wide range of noise-level. The effects of nodes densities and nodes speeds on the performance of the DNDP algorithm are also investigated.

scholarly journals PERFORMANCE COMPARISON WITH ACCESSIBILITY PREDICTION AND LINK BREAKAGE PREDICTION IN MANETS

2015 ◽  
pp. 48-54
Author(s):  
TEJAL ARVIND SONAWALE ◽  
SHIKHA NEMA
Keyword(s):  
Ad Hoc ◽  
Power Level ◽  
Performance Comparison ◽  
Delivery Ratio ◽  
Route Discovery ◽  
Network Resources ◽  
Average Delay ◽  
Network Bandwidth ◽  
Multiple Routes ◽  
Hoc Networks

Ad Hoc Networks face a lot of problems due to issues like mobility, power level, load of the network, bandwidth constraints, dynamic topology which lead to link breaks, node break down and increase in overhead. As nodes are changing their position consistently, routes are rapidly being disturbed, thereby generating route errors and new route discoveries. The need for mobility awareness is widely proclaimed. In our dissertation we present a scheme AOMDV-APLP that makes AOMDV aware of accessibility of neighbor nodes in the network. Nodes acquire the accessibility information of other nodes through routine routing operations and keep in their routing table. Based on this information route discovery is restricted to only “accessible” and “start” nodes. Further route with the strongest signal strength is selected from multiple routes using Link life value predicted by Link Breakage prediction technique. Simulation result shows that using accessibility and link life knowledge in route discovery process MAC overhead, routing overhead and average delay is reduced 3 times, and improve the Packet delivery ratio to a large extent than standard AOMDV which reflects effective use of network resources.

scholarly journals Monitoring System-Based Flying IoT in Public Health and Sports Using Ant-Enabled Energy-Aware Routing

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Inam Ullah Khan ◽  
Muhammad Abul Hassan ◽  
Mohammad Dahman Alshehri ◽  
Mohammed Abdulaziz Ikram ◽  
Hasan J. Alyamani ◽  
...  
Keyword(s):  
Ad Hoc ◽  
Residual Energy ◽  
Base Station ◽  
Rapid Decline ◽  
Energy Aware ◽  
Remote Communication ◽  
Aerial Vehicles ◽  
Wide Range ◽  
Hoc Networks ◽  
High Level

In recent decades, the Internet of flying networks has made significant progress. Several aerial vehicles communicate with one another to form flying ad hoc networks. Unmanned aerial vehicles perform a wide range of tasks that make life easier for humans. However, due to the high frequency of mobile flying vehicles, network problems such as packet loss, latency, and perhaps disrupted channel links arise, affecting data delivery. The use of UAV-enabled IoT in sports has changed the dynamics of tracking and working on player safety. WBAN can be merged with aerial vehicles to collect data regarding health and transfer it to a base station. Furthermore, the unbalanced energy usage of flying things will result in earlier mission failure and a rapid decline in network lifespan. This study describes the use of each UAV’s residual energy level to ensure a high level of safety using an ant-based routing technique called AntHocNet. In health care, the use of IoT-assisted aerial vehicles would increase operational performance, surveillance, and automation optimization to provide a smart application of flying IoT. Apart from that, aerial vehicles can be used in remote communication for treatment, medical equipment distribution, and telementoring. While comparing routing algorithms, simulation findings indicate that the proposed ant-based routing protocol is optimal.

A Secure Routing Scheme Against Malicious Nodes in Ad Hoc Networks

2018 ◽  
pp. 284-307
Author(s):  
Abdelaziz Amara Korba ◽  
Mohamed Amine Ferrag
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc ◽  
False Positive Rate ◽  
Secure Routing ◽  
Malicious Nodes ◽  
High Detection Rate ◽  
Routing Scheme ◽  
Wide Range ◽  
Positive Rate ◽  
Hoc Networks

This chapter proposes a new cluster-based secure routing scheme to detect and prevent intrusions in ad hoc networks. The proposed scheme combines both specification and anomaly detection techniques to provide an accurate detection of wide range of routing attacks. The proposed secure scheme provides an adaptive response mechanism to isolate malicious nodes from the network. A key advantage of the proposed secure scheme is its capacity to prevent wormhole and rushing attacks and its real-time detection of both known and unknown attacks which violate specification. The simulation results show that the proposed scheme shows high detection rate and low false positive rate compared to other security mechanisms.

Improving Energy Efficiency and Throughput in Heterogeneous Mobile Ad Hoc Networks

2011 ◽  
pp. 37-49
Author(s):  
Manu J. Pillai ◽  
M. P. Sebastian
Keyword(s):  
Ad Hoc ◽  
Transmission Rate ◽  
Mac Protocol ◽  
Signal Loss ◽  
High Data ◽  
Communication Links ◽  
Adhoc Networks ◽  
Simulation Results ◽  
Demand Routing ◽  
Hoc Networks

The nodes are expected to transmit at different power levels in heterogeneous mobile adhoc networks, thus leading to communication links of different length. Conventional MAC protocols that unconditionally presume that links are bi-directional and with unvarying energy distribution may not succeed or execute badly under such circumstances. Interference and signal loss resulting out of distance and fading diminish the entire throughput attained in heterogeneous networks to a greater extent. This article presents a MAC protocol, which adaptively transmits data frames using either the energy efficient nodes or a list of high data rate assistant nodes. In addition, a cross-layer based energy level on-demand routing protocol that adaptively regulates the transmission rate on basis of congestion is projected as well. Simulation results illustrate that the proposed protocols considerably diminish energy consumption and delay, and attain high throughput in contrast with the Hybrid MAC and traditional IEEE 802.11 protocols

Sign in / Sign up

Export Citation Format

Share Document