Comparative Assessment and Performance Analysis of Numerous Mobile Ad-Hoc Network Routing Protocols

2019 ◽  
Vol 16 (9) ◽  
pp. 3906-3911
Author(s):  
Karan Singh ◽  
Rajeev Gupta

Recent progression in the field of information and communication cause increase of packet count over the World Wide Web network. These communicated packets should deliver on time from origin node to destination node using a reliable and shortest route. In this way routing plays an important part in dispatching the packets to destination form the source. This routing becomes more crucial when packets delivery is done in independent mobile nodes which dynamically form a temporary network. This network named as Mobile Ad-Hoc Network and therefore it is said to be particular reason-specific, self-ruling and dynamic. In this paper we analyzed 3 protocols and for a quality of service (i.e., Packet Delivery Ratio) and achieved comparative study of various protocols of routing with respect to Operation of protocols, Route maintenance, Routing table, Route, Route selection, Routing structure, Routing Approaches, Protocol types, Merits and Demerits.

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Huang Qiong ◽  
Yin Pengfei ◽  
Chen Qianbin ◽  
Gong Pu ◽  
Yang Xiaolong

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.


A mobile ad hoc network (MANET) is a combination of multiple mobile nodes, which are interconnected by radio link. In MANET, sensor nodes are free to move, and each node can act as a host or router. Routing is one of the most challenging tasks because nodes move frequently. Therefore, in MANET, the routing protocol plays an important role in selecting the best route to efficiently transmit data from the source node to the destination node. In this paper, the best path with efficient Ad Hoc on Demand Distance Vector (AODV) routing protocol is chosen as the routing mechanism. The properties of each node are categorized using firefly algorithm. The Artificial Neural Network (ANN) is trained as per these properties and hence in case if the gray hole node is detected within the route, it is identified and the route between the source and the destination is changed. At last, to show how effectively the proposed AODV with Firefly and ANN works is computed in terms of performance parameters. The throughput and PDR is increased by 4.13 % and 3.15 % compared to the network which is affected by gray hole attack. The energy up to 44.02 % has been saved.


2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Ramesh Sekaran ◽  
Ganesh Kumar Parasuraman

The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET.


2020 ◽  
Vol 8 (6) ◽  
pp. 5580-5585

Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile hosts forming a temporary network without the aid of any stand-alone infrastructure or centralized administration. Due to the mobility of the nodes in the network, these nodes are self-organizing and self-configuring. Not only they act as hosts, but also, they function as routers. In MANETs, routing protocols are necessary to find specific paths between the source and the destination. The primary goal of any ad-hoc network routing protocol is to meet the challenges of the dynamically changing topology. Therefore, an efficient route between any two nodes with minimum routing overhead and bandwidth consumption should be established. The design of these routing protocols is challenging due to the mobility and the dynamic nature of the mobile ad-hoc networks. MANET routing protocols are categorized into two types: proactive and reactive. In this paper, the MANET characteristics and challenges are highlighted. Moreover, a comparison is conducted between three protocols: namely, DSDV, DSR and AODV in terms of both properties and performance.


Author(s):  
CHANDNI CHANDNI ◽  
ANJALI BHARTI ◽  
KANIKA SHARMA

A mobile ad-hoc network (MANET) is composed of mobile nodes without any infrastructure. Mobile nodes selforganize to form a network over radio links. The goal of MANETs is to extend mobility into the realm of autonomous, mobile and wireless domains, where a set of nodes form the network routing infrastructure in an ad-hoc fashion. The majority of applications of MANETs are in areas where rapid deployment and dynamic reconfiguration are necessary and wired network is not available. Due to their time varying nature of the topology of these networks traditional routing methods cannot be directly used .In this paper a number of routing protocols which are used in MANETS are studied and compared on a range of parameters.


2018 ◽  
Vol 7 (2.27) ◽  
pp. 150
Author(s):  
Rupinder Kaur ◽  
Sandeep Singh Kang

The mobile ad-hoc network is the decentralized type of network in which mobile nodes can move from one location to another. Due to random mobility of the mobile nodes route establishment, route maintenance is the major issues of mobile ad-hoc networks. This research paper, focus on the route establishment and route maintenance properties of mobile ad-hoc network. The DCFR protocol is the route establishment and route maintenance protocol in which broker route will be recovered on the basis of node connectivity. The node, which has maximum connectivity, is selected as the best node for route recovery in DCFR Protocol. In this research work, the DCFR protocol is further improved by adding buffer size parameter for route recovery which also maintains quality of service in the network. The proposed DCFR protocol simulation results perform well as compared to existing DCFR protocol in terms of certain parameters  


Author(s):  
Animesh K. Trivedi ◽  
Rajan Arora ◽  
Rishi Kapoor ◽  
Sudip Sanyal

Mobile ad hoc networks inherently have very different properties from conventional networks. A mobile ad hoc network (MANET) is a collection of mobile nodes that are self configuring (network can be run solely by the operation of the end-users), capable of communicating with each other, establishing and maintaining connections as needed. Nodes in MANET are both routers and terminals. These networks are dynamic in the sense that each node is free to join and leave the network in a nondeterministic way. These networks do not have a clearly defined physical boundary, and therefore, have no specific entry or exit point. Although MANET is a very promising technology, challenges are slowing its development and deployment. Nodes in ad hoc networks are in general limited in battery power, CPU and capacity. Hence, the transmission ranges of these devices are also limited and nodes have to rely on the neighboring nodes in the network to route the packet to its destination node. Ad hoc networks are sometimes referred to as multi-hop networks, where a hop is a direct link between two nodes. MANET has many important applications, including battlefield operations, emergency rescues, mobile conferencing, home and community networking, sensor dust and so forth.


Author(s):  
Mohammed Ahmed Jubair ◽  
Mustafa Hamid Hassan ◽  
Salama A. Mostafa ◽  
Hairulnizam Mahdin ◽  
Aida Mustapha ◽  
...  

<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>


2016 ◽  
Vol 2 (2) ◽  
Author(s):  
Amit Singh ◽  
Nitin Mishra ◽  
Angad Singh

 A Wireless Mobile Ad-hoc Network consists of variety of mobile nodes that temporally kind a dynamic infrastructure less network. To modify communication between nodes that don’t have direct radio contact, every node should operate as a wireless router and potential forward knowledge traffic of behalf of the opposite node. In MANET Localization is a fundamental problem. Current localization algorithm mainly focuses on checking the localizability of a network and/or how to localize as many nodes as possible. It could provide accurate position information foe kind of expanding application. Localization provide information about coverage, deployment, routing, location, services, target tracking and rescue If high mobility among the mobile nodes occurs path failure breaks. Hence the location information cannot be predicted. Here we have proposed a localization based algorithm which will help to provide information about the localized and non-localized nodes in a network. In the proposed approach DREAM protocol and AODV protocol are used to find the localizability of a node in a network. DREAM protocol is a location protocol which helps to find the location of a node in a network whereas AODV is a routing protocol it discover route as and when necessary it does not maintain route from every node to every other. To locate the mobile nodes in a n/w an node identification algorithm is used. With the help of this algorithm localized and non-localized node can be easily detected in respect of radio range. This method helps to improve the performance of a module and minimize the location error and achieves improved performance in the form of UDP packet loss, received packet and transmitted packets, throughput, routing overhead, packet delivery fraction. All the simulation done through the NS-2 module and tested the mobile ad-hoc network.


Author(s):  
Sunil Kumar ◽  
Kamlesh Dutta

A Mobile Ad hoc NETwork (MANET) is a self-organizing, infrastructure-less network of mobile nodes connecting by wireless links. In operation, the nodes of MANETs do not have a central control mechanism. It is known for its properties of routable network, where each node acts as a router to forward packets to other specific nodes in the network. The unique properties of MANET have made it useful for large number of applications and led to a number of security challenges. Security in the mobile ad hoc network is a very critical job and requires the consideration of different security issues on all the layers of communication. The countermeasures are the functions that reduce or eliminate security vulnerabilities and attacks. This chapter provides a comprehensive study of all prominent attacks in Mobile Ad Hoc Networks described in the literature. It also provides various proactive and reactive approaches proposed to secure the MANETs. Moreover, it also points to areas of research that need to be investigated in the future.


Sign in / Sign up

Export Citation Format

Share Document