Fine-Grained Analysis of Packet Loss in MANETs

In the last two decades, Multi-Cast schemes in mobile ad-hoc networks have been widely studied and lots of research results have been put into use and changed our everyday life. However, packet loss for Multi-Cast schemes in mobile ad-hoc networks has not been well studied yet. The influence of node density and relay schemes on packet loss is not clear. Thus, we study the packet loss problem for Multi-Cast schemes in MANETs in this paper. First, we present a general Multi-Cast probabilistic model to get a better understanding of the packet loss problem. Second, based on the general model and Chernoff Bounds, we prove that the up'er bound of the general packet loss for Multi-Cast is Ω(me <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">- 2</sup> ), where n is the node number and m denotes number of hops. Thus we can conclude that large node density decreases the packet loss rate by exponential factor, and bigger hops increase packet loss rate linearly. In addition, we present a reliable Multi-Cast protocol(RMP). Through an ACK Aware Tree to complete packet acknowledgement and repair host selection, RMP is able to minimize the impact of packet loss on the Multi-Cast throughput in the simulation.

Mobile Ad hoc Networks (MANET) comprises of self-organizing autonomous mobile nodes. MANETs are open and decentralized. Therefore they are vulnerable to malicious entities. MANETs are multi-hop wireless network where all nodes supportively maintain network connectivity without a centralized infrastructure. Since MANETs are infrastructure less and independent, the secure communication is the main issue. Therefore they are vulnerable to malicious entities. Here the location identity and traffic can be traced out by an outside observer. Anonymity means secure communications by hiding node identities and preventing traffic analysis attacks by outside observers. This paper proposes Position based Anonymous Routing Scheme in MANETs (PARS).Here the routing is based on Greedy Perimeter Stateless Routing Protocol. The objective is an anonymous routing protocol for the network. The proposed one is a zone based anonymous GPSR based protocol that can provide source, destination and route anonymity. Performance of the proposed system is compared with that of GPSR and AODV using Network Simulator. Index Terms: Anonymous routing, position-based routing, random forwarder, zone partition. I. Introduction Mobile Ad hoc Networks are collection of independent mobile nodes that can communicate by radio waves. It is an infrastructure less self-organizing network. The nodes that are in radio range can communicate by single hop or by multi hop with the help of intermediate nodes. The network is open and decentralized and fully distributed. So they are perfect choice for communication and information sharing. MANETs are susceptible to malicious entities that aim to alter and analyzed the traffic analysis by communication eaves dropping or attacking routing protocols. MANETs are characterized by their distributed operation, multi hop routing, dynamic topology and shared physical medium. Nodes in a MANET are independently free to move in any direction. Due to the lack of a centralized coordinator security is the major concern here. Wireless communication can endure interferences or malicious interceptions; whereas multi-hop communication assumes that each node will perform properly its functions to support network services. Further, self-organization increases the complexity of security management operations as access control, node authentication, secure routing and cryptographic key distribution. There is no fixed infrastructure and the topology is frequently changing due to node mobility or environmental changes. Therefore, it is very hard to maintain a stable and efficient end-to-end route in an ad-hoc network. Each node in MANET is energy constrained. There is verylimited physical security in MANET. The type of attacks can be Active attacks or Passive attacks. The common security issues are Passive attacks which include eaves dropping and information disclosure. Active attacks include Do Sand Data modification. There are other more specific problems with mobile ad hoc network such as vulnerability of channels and nodes, Byzantine black hole and Byzantine wormhole attack. The security issue also includes attacks that may inject erroneous routing information and diverting network traffic thus making routing inefficient. There are many methods to reduce the impact of these attacks, which include a secure routing using public and private key s to get a certification authority and use of digital signatures and prior it rust relationships. Routing is the process of communication from one node to the other host in a network. Routing is the process off or warding packet towards its destination using most efficient path. Routing efficiency is measured in terms of Number of hops, traffic, security, etc. Routing protocols in MANETs are divided as reactive proactive and hybrid. Reactive Protocol maintains the routes in on demand manner. In route discovery phase it floods the route request (RREQ) packets throughout the network. Dynamic source Routing (DSR), ad hoc on- demand distance vector routing (AODV) are some of the examples of reactive protocols. In proactive approach every node in the MANET continuously maintains the complete routing information of the entire network. This is accomplished by flooding network periodically with network status information. Global State Routing (GSR), Hierarchical State Routing (HSR) and Destination Sequenced Distance Vector Routing (DSDV) are some of the examples of proactive

Energy and mobility conscious multipath routing scheme for route stability and load balancing in MANETs

A Review on Cooperative Bait Based Intrusion Detection in MANET

An adaptive congestion and energy aware multipath routing scheme for mobile ad-hoc networks through stable link prediction

Node’s mobility, bursty data traffic, and dynamic nature of the network make congestion avoidance and control a challenging task in Mobile Adhoc Networks (MANETs). Congestion results in high packet loss rate, increased delays, and wastage of network resources due to re-transmissions. In this paper, we propose In-route data rate adaptation to avoid packet loss. Proposed scheme is based on the analysis of queue length of the forwarding nodes, number of data source nodes, and rate of link changes. In proposed technique, queue length of forwarding nodes is communicated periodically to the neighbor nodes using existing control messages of the underlying routing protocol. Keeping in view the queue length of forwarding nodes, number of data source nodes, and rate of link changes, initially the intermediate nodes buffer the incoming data packets upto some threshold and then, gradually shift the effect of congestion to the data source nodes. Then, the source node adapts its sending data rate to avoid congestion and to ensure reliable data communication. We have performed simulations in NS-2 simulator by varying different network metrics such as data rate, number of source nodes, and node speed. Results show that proposed technique improves network performance in terms of packet delivery ratio upto 15 %, reduction of average end-to-end delay and packet loss due to interface queue overflow upto 25 % and 14 % respectively, as compared to the static rate adaptation scheme.

Security has become important to mobile ad hoc networks (MANETs) due mainly to their use for many mission and life-critical applications. However, the broadcast nature of inter-node communications and node mobility in MANETs make it very challenging to secure MANETs. Moreover, their constantly changing topology causes network node density and neighbor relationships to change dynamically. This paper presents an intrusion detection system (IDS) for MANETs at the application layer. The IDS utilizes (1) both anomaly and misuse detection schemes to identify attacks in MANETs and (2) mobile agents (MAs) to augment each node's intrusion-detection capability. In particular, each node is equipped with a local IDS, and MAs will be dispatched periodically or on-demand to augment each node's IDS. We present the design of this IDS and the overall network structure, as well as the methods for authenticating and dispatching MAs. We also evaluate the trade-offs between different design parameters of MAs.

Mobile Ad-hoc networks (MANETs) are self-organizing multi-hop wireless networks composed of independent mobile nodes. Due to the characteristics of dynamic topology and limited resources, MANETs are vulnerable to attacks from malicious nodes. However, traditional security policies with encryption and authentication cannot be well suited for MANETs, because of absence of trusted third party. In order to decrease hazards from malicious nodes, the concept of trust has been introduced to MANETs. In this paper, we first propose a novel trust model, in which nodes calculate trust value according to multiple events including historical interactions, interactions context factors and recommendations from neighbor nodes. Then the model is introduced into AOMDV, forming a novel trusted multipath routing protocol, termed as Trust-based Ad Hoc On-demand Multipath Distance Vector protocol (TAOMDV). The TAOMDV provides a flexible way to select the shortest path or multiple shortest paths from all trust satisfied paths to balance load. Experiments show that TAOMDV improves significantly in network loss ratio and average end-to-end latency.

Mobile Ad Hoc Networks (MANETs) are infrastructure-less networks that are mainly used for establishing communication during the situation where wired network fails. Security related information collection is a fundamental part of the identification of attacks in Mobile Ad Hoc Networks (MANETs). A node should find accessible routes to remaining nodes for information assortment and gather security related information during route discovery for choosing secured routes. During data communication, malicious nodes enter the network and cause disturbances during data transmission and reduce the performance of the system. In this manuscript, a Time Interval Based Blockchain Model (TIBBM) for security related information assortment that identifies malicious nodes in the MANET is proposed. The proposed model builds the Blockchain information structure which is utilized to distinguish malicious nodes at specified time intervals. To perform a malicious node identification process, a Network Block Monitoring Node (NBMN) is selected after route selection and this node will monitor the blocks created by the nodes in the routing table. At long last, NBMN node understands the location of malicious nodes by utilizing the Blocks created. The proposed model is compared with the traditional malicious node identification model and the results show that the proposed model exhibits better performance in malicious node detection.

Since last decades, mobile ad hoc network has emerged drastically as a new generation networking technology. Nowadays, computers are used as necessary gadgets and its derived gadgets such as PDA, notebook, mobile, tablet. Their utility increases, when they are connected to the data networking medium. Wireless network is one of the popular network media that connect the mobile devices. Mobile ad hoc network (MANET) is widely accepted wireless network, as it proves the best fit for various applications such as military operations, natural disasters, and remote areas, and at the same time, MANET is more vulnerable to various attacks on the different networking layers. The working mechanism of MANET is based on the mobile nodes. All the nodes are assumed as trusted nodes, but some malicious nodes get affected in MANET working approach. This paper presents a review study of different types of vulnerable attacks on different network layers of MANET. MANET attacks are broadly classified according to the TCP/IP layer architecture. This study gives us the scope of developing secure IDPS for the MANET.

Mobile Ad-hoc Networks (MANETs) features such as open medium, dynamic topology, lack of centralised management and lack of infrastructure expose them to a number of security attacks. Black hole attack is one type of attack that is more common in MANET reactive routing protocols such as Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR). Black hole attack takes advantage of route discovery process in reactive routing protocols. In this type of attack, a malicious node misleads other nodes in the network by pretending to have the shortest and updated route to a target node whose packets it wants to interrupt. It then redirects all packets destined to a target node to itself and discards them instead of forwarding. This paper analyses the performance of AODV and DSR when attacked by black hole, by varying the mobility of the nodes in the network. The analysis is carried out by simulating scenarios of AODV based MANET and DSR based MANET using Network Simulator 2 (NS-2) and introducing the black hole attack in each of the scenarios. The different scenarios are generated by changing the mobility of the nodes. The performance metrics that are used to do the analysis are throughput, packet delivery ratio and end-to-end delay. The simulation results show that the performance of both AODV and DSR degrades in the presence of black hole attack. Throughput and packet delivery ratio decrease when the network is attacked by black hole because the malicious node absorbs or discards some of the packets. End-to-end delay is also reduced in the presence of a black hole attack because a malicious node pretends to have a valid route to destination without checking the routing table, and therefore shortens the route discovery process. The results also show that throughput decreases slightly when mobility of the nodes is increased in the network. The increase in the speed of the nodes decreases both end-to-end delay and packet delivery ratio.

The mobile ad hoc networks have made the source and the influenced shortest path routing extremely challenging owing to their unstable and dynamic topology. Even though the nodes keep moving and this increases the packets and their retransmission and this brings down the delivery ratio. The Ad hoc networks with their quick deployment and minimal configuration are well-suited for these emergency situations such as disasters that are human-induced, medical situations or emergency, military conflicts and so on. Every mobile node found in a Mobile Ad hoc Network (MANET) can perform a routing function to establish some communication among various nodes, their "death" and also of some nodes owing to the exhaustion of energy that can disrupt service of the whole network. The ad hoc on-demand distance vector routing (AODV) is that routing protocol which gets established at a time there is a demand for another new route. It is found to be similar to the energy and the other parameters of Quality of Service that includes throughput, security, jitter and end-to-end delay. For this work, there is a probabilistic routing scheme which is quality aware for enhancing and improving the mobile ad hoc network and its throughput and this is known as a Differential Evolution (DE). As opposed to looking out for a path that is the shortest, this heuristic has proposed the best path to ensure that there is an overall quality of service that is ensured. This algorithm which is based on the DE has improved the chances of selecting the ideal route for data transmission.

The advancements of diverse radio technologies and emerging applications have spawned increasing heterogeneity in mobile ad hoc networks (MANETs). But the collaborative nature of communications and operations often requires that these heterogeneous MANETs to be interoperable. Nonetheless, the existing interconnection protocols designed for the Internet (namely inter-domain routing protocol such as BGP) are not adequate for handling the unique challenges in MANETs. In this paper, we present a novel Inter-MANET Routing protocol called InterMR that can handle the heterogeneity and dynamics of MANETs. Our first contribution is an Inter-MANET address scheme based on a variety of node attributes (e.g., symbolic name, property, etc.); this allows dynamic merging/split of network topologies without a separate Name Server. Our second contribution is to provide a seamless routing mechanism across heterogeneous MANETs without modifying the internal routing mechanisms in each MANET. The proposed scheme can transparently adapt to topological changes due to node mobility in MANETs by dynamically assigning the gateway functionalities. We show, by packet-level simulation, that the performance of InterMR can be improved by up to 112% by adaptive gateway assignment functionalities. We also show that InterMR is scalable with only modest overhead by analysis.

As technology progresses, networking undergoes continuous evolution to align with contemporary trends. Mobile Ad hoc Networks (MANETs) have emerged as a pivotal technology facilitating communication among mobile nodes sans a central administering node. MANETs find diverse applications spanning communication networks to battlefield scenarios. Nonetheless, MANETs encounter various challenges, including load balancing, energy efficiency, packet loss, and connection failures. Routing, among these challenges, assumes a pivotal role in defining network performance and connectivity capacity within MANETs. Moreover, the energy consumption of mobile nodes, often reliant on batteries with limited rechargeability, presents a significant concern in MANETs. This paper delves into diverse techniques devised to tackle the issues of energy efficiency and load balancing in MANETs. Additionally, it offers a comparative analysis to consolidate the survey findings. The outcomes of this study enrich our comprehension of energy-efficient and load-balanced routing protocols in MANETs, thereby facilitating the design and deployment of efficient networking solutions.

ABSTRACTQuality of service (QoS) provisioning in mobile ad hoc networks (MANETs) is one of the fundamental concerns in this area. Autonomous mobility of nodes is one of the main factors affecting the network QoS. A lack of fixed infrastructure and central control on the nodes complicate guaranteeing the QoS in MANETs. Security is a major factor affecting the QoS in such networks. This paper proposes a new routing method based on trust among the nodes and applies a clustering approach to MANETs. This routing scheme can calculate the trustworthiness of the route and the shortest routes to the destination by avoiding identified malicious nodes. The effects of node mobility and number of malicious nodes on routing performances are investigated in the reported research. Simulation is used to show the effectiveness of the proposed approach in comparison with a categorized trust method, Ad hoc On‐demand Distance Vector, trust vector‐based Ad hoc On‐demand Distance Vector, and trust vector‐based dynamic source routing in terms of end‐to‐end delay, network throughput, and packet delivery ratio at the expense of a moderate increase in the routing overhead. The proposed trust‐based routing method finds the trustworthy route by applying end‐to‐end trust calculation and finds the optimal route by performing clustering scheme from the source node to the destination node. In the extended proposed routing method, adding a nonce‐based encryption scheme results in improved packet delivery ratio, network throughput, and malicious node detection rate. Copyright © 2013 John Wiley &amp; Sons, Ltd.