To Improve the Performance of Routing Protocol in Mobile WBAN by Optimizing the Scheduling Mechanism

2018 ◽  
Vol 6 (9) ◽  
pp. 86 ◽  
Author(s):  
Rani Kumari ◽  
Parma Nand
Keyword(s):  
Ad Hoc ◽  
Average Energy ◽  
Base Station ◽  
Delivery Ratio ◽  
Network Simulator ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Cost Parameters ◽  
The Cost ◽  
The Ideal

Current building up year's part of scientist's keen on Mobile Ad-hoc Networks (MANETs), an accumulation of versatile hubs that progressively frame a system association incidentally with no base station of static framework. Caused by versatility of hubs, directing play an essential part in transmission and various steering conventions are accessible like table-driven, on-request and half breed. The convention shows the system which decreases course circles and affirms dependable message trade. The Associative Based Routing (ABR) steering framework is a non-request directing convention intended for specially appointed portable hubs. Jump check, add up to impedance, hub connect delay, lingering vitality of anode and the hub transmission control are the cost parameters doled out for connection and way of the specially appointed systems. These parameters are consolidated in various advancement work concerning different directing calculation for choosing the ideal way. In this specialized research paper gets to the changed ABR steering convention with two distinctive topology's multicast parameters to secure dynamic system execution measurements like Packet Delivery Ratio (PDR), Routing Overhead (RO), Average Energy (AE), End-to-End Delay (E-to-E D) and Throughput by means of Network Simulator 2 (NS2).

Modelling of Random Selfish Behavior Attack using Single Sided Laplacian Distribution and Performance Evaluation for High Security Communications in Mobile Ad-hoc Networks

2020 ◽  
Vol 10 ◽  
Author(s):  
Kirti A. Adoni ◽  
Anil S. Tavildar ◽  
Krishna K. Warhade
Keyword(s):  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Average Energy ◽  
Delivery Ratio ◽  
Malicious Nodes ◽  
Packet Delivery ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Average Energy Consumption ◽  
Laplacian Distribution

Background: The performance of Mobile Ad-hoc Networks get severely degraded due to various attacks including Selfish Behaviour attack. The detection of malicious nodes and avoidance of such nodes for data forwarding is important to enhance the MANET’s performance. Methods: A probabilistic model based on Single Sided Laplacian distribution for the random ON/OFF switching time of this attack is proposed. The model is used to make appropriate decisions regarding assignment of trust levels to suspicious nodes. The proposed protocol, based on this trust along with Confidence values of nodes, referred to as OLSRT-C protocol is used to select the optimum path for data forwarding. Simulations are carried out using Network Simulator NS2.35. Results: The random behavior of Selfish Behaviour attack is analyzed by considering all the possible random parameters. The random deployment of mobile nodes, number of malicious nodes, number of times the malicious nodes switch and timing instances at which these nodes change their states are considered. From the results, it is observed that, the OLSRTC protocol gives stable performance for Packet Delivery Ratio and Routing Overheads whereas for OLSR protocol, Packet Delivery Ratio gradually reduces and Routing Overheads increase, for percentage of malicious nodes increase from 10% to 50%. For OLSRT-C protocol, Average Energy Consumption per node increases marginally compared to OLSR protocol. Conclusion: The proposed OLSRT-C protocol successfully mitigates randomized Selfish Behaviour attack with marginal increase in the Average Energy Consumption per node. The Protocol Efficacy for OLSRT-C protocol is much higher compared to OLSR protocol.

Performance Enhanced AODV Routing Protocol Security in Mobile Ad-Hoc Networks

2012 ◽  
Vol 3 (3) ◽  
pp. 57-70 ◽  
Author(s):  
Raees Khan ShahSani ◽  
Muhammad Bakhsh ◽  
Amjad Mahmood
Keyword(s):  
Black Hole ◽  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Denial Of Service ◽  
Geographic Location ◽  
Delivery Ratio ◽  
Network Simulator ◽  
Mobile Ad Hoc ◽  
Hoc Networks

With the emergence of mobile ad-hoc networks, more users desire connectivity regardless of geographic location. MANETs are a promising technology in terms of the applications in the military, emergency situations, and general daily life activities. Various protocols have been developed to handle the routing information in such networks. However, most protocols are vulnerable to various threats. Among them, the Black-hole type of denial-of-service attack causes a major degradation in the performance and trust of the network nodes. In this paper, the authors review and highlight the limitations of the existing solutions and propose a new algorithm to handle the black-hole attacks. The proposed algorithm is comparatively efficient and easy to implement for detecting and avoiding the black-hole attacks. The proposed algorithm has been implemented in Network Simulator (ns-2) to evaluate its performance in term of packet delivery ratio, network load, and end-to-end delay. The simulation results show that the proposed algorithm achieves a considerable enhancement in the overall networking performance and avoids the black-hole attack successfully.

Neighborhood-Based Route Discovery Protocols for Mobile Ad Hoc Networks

2013 ◽  
Vol 5 (3) ◽  
pp. 68-87 ◽  
Author(s):  
Sanaa A. Alwidian ◽  
Ismail M. Ababneh ◽  
Muneer O. Bani Yassein
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Selection Process ◽  
Delivery Ratio ◽  
Route Discovery ◽  
Network Simulator ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Network–wide broadcasting is used extensively in mobile ad hoc networks for route discovery and for disseminating data throughout the network. Flooding is a common approach to performing network-wide broadcasting. Although it is a simple mechanism that can achieve high delivery ratio, flooding consumes much of the communication bandwidth and causes serious packet redundancy, contention and collision. In this paper, the authors propose new broadcast schemes that reduce the overhead associated with flooding. In these schemes, a node selects a subset of its neighbors for forwarding the packet being broadcast to additional nodes. The selection process has for goal reducing the number of neighbors and maximizing the number of nodes that they can reach (i.e., forward the packet to). By applying this novel neighborhood-based broadcasting strategy, the authors have come up with routing protocols that have very low overhead. These protocols were implemented and simulated within the GloMoSim 2.03 network simulator. The simulation experiments show that our routing protocols can reduce the overhead for both low and high mobility substantially, as compared with the well-known and promising AODV routing protocol. In addition, they outperform AODV by increasing the delivery ratio and decreasing the end-to-end delays of data packets.

scholarly journals Performance Analysis of AODV and OLSR protocol in Mobile Ad Hoc Network using NS3

2020 ◽  
pp. 372-379
Author(s):  
Soumya S. ◽  
Krishna Prasad K. ◽  
Navin N. Bappalige
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Base Station ◽  
Delivery Ratio ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile Ad Hoc networks is a network in which energy is a main constraint and selection of a protocol that minimizes the energy usage is a key issue. Mobile Ad hoc network communicates with other nodes, without the help of base station and Communication is possible by forwarding a data unit consisting of control information and user data known as packets from one node to other. Furthermore, another key issue in mobile ad hoc networks is routing since the nodes are in mobility and tend to change the paths and move out of the network. The evaluation of energy efficient routing protocols can be effectively performed using NS3. Three types of routing protocols can be seen, Reactive, Proactive and Hybrid and in this paper, AODV a reactive protocol and OLSR a proactive protocol is compared and Delivery ratio of packets, Packet Loss and count of packets received are evaluated to analyze the energy efficiency of protocols based on these metrics.

scholarly journals Competitive analysis of single and multi-path routing protocols in mobile Ad-Hoc network

2020 ◽  
Vol 19 (1) ◽  
pp. 293
Author(s):  
Mohammed Ahmed Jubair ◽  
Mustafa Hamid Hassan ◽  
Salama A. Mostafa ◽  
Hairulnizam Mahdin ◽  
Aida Mustapha ◽  
...  
Keyword(s):  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Delivery Ratio ◽  
Network Simulator ◽  
Mobile Nodes ◽  
Dynamic Source ◽  
Mobile Ad Hoc ◽  
Hoc Networks

<p>A Mobile Ad-hoc Network (MANET) refers to a dynamic and wireless network, which can be designed without an existing infrastructure as every node serves as a router. A MANET is a self-configuring system of mobile nodes that are connected wirelessly. Every node serves as a sink, as well as a router to send packets. The movement of the nodes is not restricted as they can move in any direction, and they have the ability to get organized into a network. Due to their free and independent movement, they do not have a fixed position; they often change positions. In this study, the Dynamic Source Routing (DSR) and Ad-hoc On Multipath Demand Distance Vector (AOMDV) protocols are compared using Network Simulator NS2.35. DSR is a reactive gateway discovery algorithm whereby the connection of a MANET mobile device is established only on demand. Basically, AOMDV was specially tailored for ad-hoc networks that are highly dynamic to respond to link failures and breakages in the network. It ensures that the paths for destinations are sustained, and it defines the new routing information using destination serial numbers to ensure loop freedom always while avoiding problems. More so, it is a protocol that is based on a timer that can discover ways through which the mobile nodes respond to link breakages and change in topology. A comparison of protocols has been carried out individually and jointly with the aim of evaluating their performance. The performance is measured in terms of End-to-End Delay, Packet Delivery Ratio, Packet Loss Ratio, and Routing Overhead Ratio. The performance of the routing protocols was done using two scenarios; when there is a change in the simulation time and when there is a change in the number of nodes.</p>

scholarly journals Energy-efficient and reliable routing protocol for dynamic-property-based clustering mobile ad hoc networks

2017 ◽  
Vol 13 (1) ◽  
pp. 155014771668360 ◽  
Author(s):  
Young-jun Oh ◽  
Kang-whan Lee
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Clustering Algorithm ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Optimal Path ◽  
Base Station ◽  
Delivery Ratio ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile ad hoc networks comprise mobile nodes. The nodes both send and receive messages and can communicate with each other. Thus, the network builds its own network structure that is not dependent on the infrastructure. Owing to the characteristics of mobile ad hoc networks, they have been used in environments of poor communication, such as those in which the infrastructure cannot be built; for example, disaster areas and war zones. In this article, we propose an advanced energy-conserving optimal path schedule algorithm. The proposed algorithm sets the routing path using the relative angle, which is the distance between the source node and the base station. Using simulation results, we compared the proposed algorithm to existing algorithms. The protocol used by the proposed algorithm provides a higher packet delivery ratio and lower energy consumption than the lowest ID clustering algorithm and the mobility-based metric for clustering in the mobile ad hoc network algorithm.

scholarly journals A Bioinspired Adaptive Congestion-Avoidance Routing for Mobile Ad Hoc Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Huang Qiong ◽  
Yin Pengfei ◽  
Chen Qianbin ◽  
Gong Pu ◽  
Yang Xiaolong
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Threshold Value ◽  
Recovery Phase ◽  
Network Routing ◽  
Delivery Ratio ◽  
Route Maintenance ◽  
Random Manner ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Traditional mobile Ad Hoc network routing protocols are mainly based on the Shortest Path, which possibly results in many congestion nodes that incur routing instability and rerouting. To mitigate the side-efforts, this paper proposed a new bioinspired adaptive routing protocol (ATAR) based on a mathematics biology model ARAS. This paper improved the ARAS by reducing the randomness and by introducing a new routing-decision metric “the next-hop fitness” which was denoted as the congestion level of node and the length of routing path. In the route maintenance, the nodes decide to forward the data to next node according to a threshold value of the fitness. In the recovery phase, the node will adopt random manner to select the neighbor as the next hop by calculation of the improved ARAS. With this route mechanism, the ATAR could adaptively circumvent the congestion nodes and the rerouting action is taken in advance. Theoretical analysis and numerical simulation results show that the ATAR protocol outperforms AODV and MARAS in terms of delivery ratio, ETE delay, and the complexity. In particular, ATAR can efficiently mitigate the congestion.

Secure Route Discovery in DSR against Black Hole Attacks in Mobile Ad Hoc Networks

2012 ◽  
pp. 125-143
Author(s):  
P. Subathra ◽  
S. Sivagurunathan
Keyword(s):  
Black Hole ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
False Negative ◽  
Delivery Ratio ◽  
Black Hole Attack ◽  
Dynamic Source ◽  
Mobile Ad Hoc ◽  
And Performance ◽  
Hoc Networks

A Mobile Ad hoc Network (MANET) is a collection of wireless nodes communicating over multi-hop paths without any infrastructure. Nodes must cooperate to provide necessary network functionalities. The security in routing protocols like Dynamic Source Routing (DSR) can be compromised by a “Black Hole” attack. Here, a malicious node claims to have the shortest path to the destination and attracts all traffic and drops them, leading to performance degradation. The situation becomes worse when two or more nodes cooperate and perform the “Cooperative black hole” attack. This chapter proposes a solution based on probing to identify and prevent such attacks. The proposed solution discovers a secure route between the source and destination by identifying and isolating the attacking nodes. Simulation results show that the protocol provides better security and performance in terms of detection time, packet delivery ratio, and false negative probability in comparison with trust and probe based schemes.

A Survey of Efficient Trust Management Schemes in Mobile Ad-Hoc Network

2021 ◽  
pp. 151-172
Author(s):  
J. Kaur ◽  
S. Kaur
Keyword(s):  
Trust Management ◽  
Ad Hoc ◽  
Delivery Ratio ◽  
Detection Accuracy ◽  
Mobile Nodes ◽  
Trust Value ◽  
Mobile Hosts ◽  
Wireless Medium ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile Ad Hoc Networks (MANETs) are comprised of an arrangement of self-sorting mobile hosts furnished with wireless interaction devices gathered in groups without the need of any settled framework as well as centralized organization to maintain a system over radio connections. Every mobile node can react as a host and also, the router freely utilizes the wireless medium inside the correspondence range to deal with the interaction between huge quantities of individual mobile nodes by framing a correspondence system and trading the information among them without using any described group of the base station. A trust-based model in MANET estimates and sets up trust relationship among objectives. Trust-based routing is utilized to keep away data from different attackers like a wormhole, DOS, black-hole, selfish attack and so forth. Trust can be executed in different steps like reputation, subjective rationale and from the supposition of the neighboring node. A trust estimation approach not just watches the behavior of neighbor nodes, additionally it screens the transmission of the information packet in the identification of the route for exact estimation of trust value. A survey is carried out to find some of the limitations behind the existing works which has been done by the researchers to implement various approaches thus to build the trust management framework. Through the survey, it is observed that existing works focused only on the authenticated transmission of the message, how it transmits packets to the destination node securely using a trust-based scheme. And also, it is observed that the routing approach only focused on the key management issues. Certain limitation observed in the implemented approaches of existing work loses the reliability of framework. Thus, to withstand these issues it is necessary to establish a reliable security framework that protects the information exchanged among the users in a network while detecting various misbehaving attacks among the users. Confidentiality, as well as the integrity of information, can be secured by combining context-aware access control with trust management. The performance parameters should be evaluated with the previous works packet delivery ratio, packet drop, detection accuracy, number of false positives, and overhead.

Sign in / Sign up

Export Citation Format

Share Document