Mobile Ad Hoc Network Routing Protocols Research Articles

Design and Development of Network Reliability based Secure Multicast Routing Protocol for MANET

In Mobile Ad hoc network (MANET), link quality and stability of links as well as nodes play a major role. In ad hoc network, links are often changing which could affect the node mobility and integrity of data packets. In this research work, Network Reliability based Secure Multicast Routing Protocol (NRSMRP) is proposed to achieve network reliability by means of creation of reliable multicast tree. This multicast tree is constructed based on link quality and reliability trust metric. In first phase, node categorization and reliability metric calculation are implemented with the help of link quality. In second phase, reliable multicast tree is formed based on parent node and child node. Parent node must have god capacity and signal strength to communicate with child node. In last phase, authentication based multicast routes are established based on the calculation of direct reputation of mobile nodes. From the results, proposed protocol achieves better performance than existing schemes.

Enhanced AODV Protocol for Detection and Prevention of Blackhole Attack in Mobile Ad Hoc Network

Mobile Ad-hoc Network (MANET) is a kind of wireless network that has the most challenging network infrastructure. It is formed using the mobile nodes without any centralized administration from the security perspective and is a self-configuring fastest emerging wireless technology, each node on the MANET will act like a router which forwards the packets. Dynamic nature of this network makes routing protocols to play a prominent role in setting up efficient route among a pair of nodes. Dynamic Source Routing (DSR) and Ad-hoc On-Demand Distance Vector (ADOV) is a reactive MANET routing protocols. Most of the attacks on MANETs are routing protocol attacks. Attacks on routing protocols, especially internal attacks will cause the damage to MANETs. Sinkhole and black hole attacks are a type of internal attack which is affected by attempting to draw all network traffic to malicious nodes that fake routing update and degrade the performance of the network. The black hole nodes should be detected from the network as early as possible via detection mechanism and should also guarantee the higher detection rate and less cross-over error rate. In this paper, we studied the characteristics of black hole attack and how it will affect the performance of the distance vector routing on demand routing protocol such as (ADOV) protocol, which recognizes the presence of black hole node from packet flow information between nodes and isolates it from the network via applying AODV protocol that one of popular routing protocol. We have evaluated the performance of the system using widely used simulator NS2, results prove the effectiveness of our prevention and detection method.

A Model-Based Reinforcement Learning Algorithm for Routing in Energy Harvesting Mobile Ad-Hoc Networks

Dynamic topology, lack of a fixed infrastructure and limited energy in mobile ad-hoc networks (MANETs) give rise to a challenging operational environment. MANET routing protocols should consider dynamic network changes (e.g., link qualities and nodes residual energy) in such circumstances and be able to adapt to these changes to efficiently handle the traffic flows. In this paper, we assume an energy harvesting MANET in which the nodes have recharging capability and thus their residual energy level is randomly changing with time. We present a bi-objective intelligent routing protocol that aims at reducing an expected long-run cost function composed of end-to-end delay and the path energy cost. We formulate the routing problem as a Markov decision process which captures both the link state dynamics due to node mobility and energy state dynamics due to nodes rechargeable energy sources. We propose a multi-agent reinforcement learning-based algorithm to approximate the optimal routing policy in the absence of a priori knowledge of the system statistics. The proposed algorithm is built using the principles of model-based RL. More specifically, we model each node’s cost function by deriving an expression for the expected value of end-to-end costs. Also the transition probabilities are estimated online using a tabular maximum likelihood method. Simulation results show that our model-based scheme outperforms its model-free counterpart and operates closely to standard value-iteration which assumes perfect statistics.

Performance Evaluation of Unicast Routing Protocols in MANETs – Current State and Future Prospects

Mobile Ad hoc Networks (MANETs) are considered as a reunion of wireless mobile devices (nodes) that form a temporary wireless network. In order to facilitate communication in MANET, every node has to participate in the routing process. Finding an optimal route is a fundamental task in MANET, where routes tend to be multi-hoped and susceptible. Several routing protocols exist and can be classified as; topology-based and position-based routing protocols. However, the efficiency of these protocols in highly dynamic and dense environments is a challenging task to be considered for increasing perceived Quality of Service (QoS) in MANET. This paper focuses on the presentation and basic operation of each category. A qualitative evaluation between both categories is conducted to achieve a performance comparison in terms of packet- delivery ratio, End-to End delay and routing overhead. Results show that position-based overcome topology-based routing protocols in high dynamic and sparse environments. Recommendations for designing and implementing efficient position-based protocols are presented.

양방향 경로 설정 및 루프 방지를 통한 개선된 AntHocNet

MANET (Mobile Ad hoc Network)에서 라우팅은 네트워크 토폴로지의 동적인 변화에 큰 영향을 받는다. AntHocNet은 집단 개미가 최적 경로를 통해 먹이를 찾아가는 원리를 모방한 집단생태 특성 기반 MANET 라우팅 프로토콜이다. 하지만, AntHocNet은 다른 MANET 라우팅 프로토콜과 달리 단방향 경로만을 지원하여 양방향 통신이 요구되는 다양한 응용 환경에서 사용하기에 많은 제약이 따른다. 또한, AntHocNet은 다중 경로를 통한 확률적 라우팅으로 인해 루핑 문제 (looping problems)를 빈번히 발생시킨다. 본 논문에서는 AntHocNet에서 양방향 경로 수립을 위한 향상된 경로 수립 방안을 제안한다. 또한, 다양한 시나리오별 루핑 문제의 발생 원인을 분석하고 루프 방지를 위한 해결 방안을 제시한다. NS-2 시뮬레이션을 통해 기존 AntHocNet과의 성능을 비교하였으며, 제안 방안이 라우팅 오버헤드, 종단간 지연 시간, 패킷 전달률 측면에서 기존 방안에 비해 우수한 성능을 보임을 확인하였다. Routing in mobile ad hoc networks (MANETs) is highly challenging because of the dynamic nature of network topology. AntHocNet is a bio-inspired routing protocol for MANETs that mimics the foraging behavior of ants. However, unlike many other MANET routing protocols, the paths constructed in AntHocNet are unidirectional, which requires a separate path setup if a route in the reverse direction is also required. Because most communication sessions are bidirectional, this unidirectional path setup approach is often inefficient. Moreover, AntHocNet suffers from looping problems because of its property of multiple paths and stochastic data routing. In this paper, we propose a modified path setup procedure that constructs bidirectional paths. We also propose solutions to some of the looping problems in AntHocNet. Simulation results show that performance is significantly enhanced in terms of overhead, end-to-end delay, and delivery ratio when loops are prevented. Performance is further improved, in terms of overhead, when bidirectional paths setup is employed.

A design and classification framework for routing protocols in MANETs

Mobile Ad Hoc Networks (MANETs) are infrastructure-less, self-organising, self-configuring and variable size multihop wireless networks. Many routing protocols have been proposed to deal with routing in such networks. Each routing protocol uses a unique design feature to handle dynamic nature and critical resources of the network. We have put together all the data structure information for routing and routing mechanisms as a design framework to explain the complete design space of the unicast routing protocols in MANETs. A feature of the framework is that the different aspects of routing protocols are well separated. By exploring the design space of the routing protocols in MANETs using the framework, one can possibly better understand the design structures, and can design new routing protocols. To demonstrate the utility of the design framework, we have analysed 27 representative routing protocols of different types, and have categorised them according to the proposed design framework.

A Survey of Ant Colony Optimization Based Routing Protocols for Mobile Ad Hoc Networks

Developing highly efficient routing protocols for Mobile Ad hoc NETworks (MANETs) is a challenging task. In order to fulfill multiple routing requirements, such as low packet delay, high packet delivery rate, and effective adaptation to network topology changes with low control overhead, and so on, new ways to approximate solutions to the known NP-hard optimization problem of routing in MANETs have to be investigated. Swarm intelligence (SI)-inspired algorithms have attracted a lot of attention, because they can offer possible optimized solutions ensuring high robustness, flexibility, and low cost. Moreover, they can solve large-scale sophisticated problems without a centralized control entity. A successful example in the SI field is the ant colony optimization (ACO) meta-heuristic. It presents a common framework for approximating solutions to NP-hard optimization problems. ACO has been successfully applied to balance the various routing related requirements in dynamic MANETs. This paper presents a comprehensive survey and comparison of various ACO-based routing protocols in MANETs. The main contributions of this survey include: 1) introducing the ACO principles as applied in routing protocols for MANETs; 2) classifying ACO-based routing approaches reviewed in this paper into five main categories; 3) surveying and comparing the selected routing protocols from the perspective of design and simulation parameters; and 4) discussing open issues and future possible design directions of ACO-based routing protocols.

Mobile Ad Hoc Network Energy Cost Algorithm Based on Artificial Bee Colony

A mobile ad hoc network (MANET) is a collection of mobile nodes that dynamically form a temporary network without using any existing network infrastructure. MANET selects a path with minimal number of intermediate nodes to reach the destination node. As the distance between each node increases, the quantity of transmission power increases. The power level of nodes affects the simplicity with which a route is constituted between a couple of nodes. This study utilizes the swarm intelligence technique through the artificial bee colony (ABC) algorithm to optimize the energy consumption in a dynamic source routing (DSR) protocol in MANET. The proposed algorithm is called bee DSR (BEEDSR). The ABC algorithm is used to identify the optimal path from the source to the destination to overcome energy problems. The performance of the BEEDSR algorithm is compared with DSR and bee-inspired protocols (BeeIP). The comparison was conducted based on average energy consumption, average throughput, average end-to-end delay, routing overhead, and packet delivery ratio performance metrics, varying the node speed and packet size. The BEEDSR algorithm is superior in performance than other protocols in terms of energy conservation and delay degradation relating to node speed and packet size.

SMRRP: scalable multipath reactive routing protocol for mobile ad hoc networks

Routing scalability is a prime issue in a large mobile ad hoc network (MANET) and has a direct impact on the performance of the network. The performance of MANET degrades appreciably for a poorly scaled network. The present work aims at proposing a new routing protocol scalable multipath reactive routing protocol (SMRRP) for MANETs which aims at reducing the routing overhead incurred in recovering from route breaks. The SMRRP computes stable multiple disjoint paths from source node to destination node. The proposed routing protocol is suitable for a dynamic self-starting network and scales well to large populations of mobile nodes wishing to form mobile ad hoc networks.

SMRRP: scalable multipath reactive routing protocol for mobile ad hoc networks

Routing scalability is a prime issue in a large mobile ad hoc network (MANET) and has a direct impact on the performance of the network. The performance of MANET degrades appreciably for a poorly scaled network. The present work aims at proposing a new routing protocol scalable multipath reactive routing protocol (SMRRP) for MANETs which aims at reducing the routing overhead incurred in recovering from route breaks. The SMRRP computes stable multiple disjoint paths from source node to destination node. The proposed routing protocol is suitable for a dynamic self-starting network and scales well to large populations of mobile nodes wishing to form mobile ad hoc networks.

A survey on the fundamental and advanced mobile ad hoc network routing protocols

The mobile ad hoc network (MANET) is considered by many researchers as a key technology in the development of the next generations of wireless networks. In addition to its lively topology, auto-configuration and auto-healing characteristics, the MANET does not require the presence of an infrastructure to operate. Thus, making this type of network a more robust and profitable solution. Unquestionably, the core technology behind the advantages of the MANET is the routing algorithm. In this paper, we provide an extensive study of the MANET routing protocols. After presenting the basic as well as the most recent routing algorithms developed for MANETs, multiple protocols are simulated in a variation of conditions in order to extract their advantages and shortcomings. From a versatility point of view, ad hoc on-demand multipath distance vector (AOMDV) produces the most interesting results during the experiments which, is why this protocol has become vastly popular.

QoS Parametric Inspection of Uniform and Assorted Trajectories for MANET Routing Protocols

A Mobile Ad Hoc Network (MANET) is a self-governing network of mobile nodes without the inclusion of any wired links. Each node can move in an ad hoc manner and therefore, such a network should consist of routing protocols which can adapt to dynamically changing topologies. Numerous protocols have been proposed for the same. However, the trajectories followed by the individual nodes have not been distinctly dealt with. This paper presents a meticulous study on QoS parameters of proactive (OLSR) and reactive (DSR) protocols of MANETs for uniform as well as dissimilar trajectories of individual nodes in a small network of about 20 nodes. Also an examination of partial node failures for both the above mentioned protocols has been done. The performance metrics utilized in this study are average throughput and average delay. OPNET modeler has been utilized for this study. This assessment shows that for uniform trajectories, OLSR has almost same average delay but a higher average throughput as compared to DSR. Also it is seen that, as compared to uniform trajectories, non-uniform trajectories deliver a much higher average throughput. Node failures only reduce average throughputs whereas average delays remain unchanged.

A survey on the fundamental and advanced mobile ad hoc network routing protocols

The mobile ad hoc network (MANET) is considered by many researchers as a key technology in the development of the next generations of wireless networks. In addition to its lively topology, auto-configuration and auto-healing characteristics, the MANET does not require the presence of an infrastructure to operate. Thus, making this type of network a more robust and profitable solution. Unquestionably, the core technology behind the advantages of the MANET is the routing algorithm. In this paper, we provide an extensive study of the MANET routing protocols. After presenting the basic as well as the most recent routing algorithms developed for MANETs, multiple protocols are simulated in a variation of conditions in order to extract their advantages and shortcomings. From a versatility point of view, ad hoc on-demand multipath distance vector (AOMDV) produces the most interesting results during the experiments which, is why this protocol has become vastly popular.

Performance analysis of on-demand routing protocol for MANET using EA3ACK algorithm

Mobile ad-hoc networks (MANETs) do not have a fixed infrastructure. Every single node in the MANET works as both receiver and transmitter. Each node directly communicates with the other when they are both within their communication range. All nodes work as routers and take path in discovery and maintenance of routes to other nodes in the network. In this paper, a new intrusion detection system, enhanced adaptive 3 acknowledgement (EA3ACK), using EAACK with hybrid cryptography is (MARS4) specially designed for MANET. In the hybrid cryptography a two key method namely MARS4 which is a combination of RSA and MAJE4 is employed to reduce the routing overhead. Network simulator (NS2) is used to implement and test the proposed system. The proposed hybrid cryptography provides secured transmission, further it reduces routing overhead, improves packet delivery ratio and throughput.

Performance Evaluation of Topology based Routing Protocols in a VANET Highway Scenario

Vehicular Ad-Hoc Network (VANET) has been derived from the well-established Mobile Ad-hoc Network (MANET). It facilitates wireless communication among vehicles to roadside equipment. Such kind of communication is utilized for different purposes such as safety, comfort, or even entertainment. The performance of VANET applications are highly determined by its underlying routing protocols. In this paper, the authors investigate the performance of topology based MANET routing protocols (AODV, DSDV and DSR) in a VANET highway design using NCTUNS 6.0 simulator. Different parameters are varied including speed, node density, propagation loss model, fading effects, data rate and payload. The selected routing protocols are then evaluated in terms of performance metrics throughput, packet drop and packet collision. Results shows that the performance of routing protocols depends on the application requirements in terms of throughput, delay and percentage of packet drops.

QSLB: queue size based single path load balancing routing protocol for MANETs

A mobile ad hoc networks (MANETs) is a collection of independent mobile nodes, which are able to communicate in the wireless medium without the assistance of any infrastructure. Because of the dynamic nature of MANETs and resources constraints of wireless medium, load must be distributed throughout the network based on some parameters. Otherwise, resources of the heavily loaded nodes deplete soon and those nodes could not participate further in the communication. So, network performance degrades due to the congestion. Load at the nodes situated in the centre of the network is higher as compared to the other part of the network. In this paper, we propose a load balancing technique that distributes the traffic throughout the network in such a way that load at the centre of the network decreases. Simulation results show that the proposed routing protocol distributes the load efficiently and improve the network performance.

Performance Study of MANET Routing Protocols in VANET

VANET (Vehicular Ad Hoc Network) is an evolving technology that brings numerous advantages, benefits and features of wireless networks to vehicles. VANET allows vehicles to communicate among themselves or with roadside equipment. Such kind of communication can be utilized for different purposes such as safety, comfort, or even entertainment. In VANET, routing of data, remains a challenging area for researchers due to its dynamic topology and the fast speed at which vehicles move. VANET is a sub class of MANET (Mobile Ad Hoc Network) with some distinct features. The performance of communication in VANET depends on the performance of its underlying network routing protocols. In this work, we performed simulation study to compare the most popular MANET routing protocols (namely: AODV, DSDV and DSR) for VANET by considering a real world scenario of a highway system. We used the famous NCTUns 6.0 network simulator for our comparative study. Numerous key simulation parameters have being considered which include speed, number of nodes, data rate, propagation model, fading and payload. The selected routing protocols were then evaluated in terms of important performance metrics which include throughput, packet drop, packet collision and average end to end delay. Our obtained simulation results show that the performance of the routing protocols depends largely on the application throughput, average delay and QoS (fewer packet drops).

Intelligent energy-aware efficient routing for MANET

Designing an energy efficient routing protocol is one of the main issue of Mobile Ad-hoc Networks (MANETs). It is challenging task to provide energy efficient routes because MANET is dynamic and mobile nodes are fitted with limited capacity of batteries. The high mobility of nodes results in quick changes in the routes, thus requiring some mechanism for determining efficient routes. In this paper, an Intelligent Energy-aware Efficient Routing protocol for MANET (IE2R) is proposed. In IE2R, Multi Criteria Decision Making (MCDM) technique is used based on entropy and Preference Ranking Organization METHod for Enrichment of Evaluations-II (PROMETHEE-II) method to determine efficient route. MCDM technique combines with an intelligent method, namely, Intuitionistic Fuzzy Soft Set (IFSS) which reduces uncertainty related to the mobile node and offers energy efficient route. The proposed protocol is simulated using the NS-2 simulator. The performance of the proposed protocol is compared with the existing routing protocols, and the results obtained outperforms existing protocols in terms of several network metrics.

ENGLISH

A mobile ad hoc network (MANET) is determined as a network that has many free autonomous nodes i.e. that can move locations and configure itself. It is often composed of mobile devices that can arrange themselves in various ways using wireless connections such as a cellular or satellite transmission to connect to various networks and operate without strict top-down network or any centralized administration. There are various applications of MANET, In Commercial Sector: Ad hoc can be implemented in emergency, rescue operations for disaster relief efforts, e.g. in fire, flood, or earth-quake. Local Level: e.g. conference or classroom. In mobile ad hoc network, congestion can take place between two intermediate nodes, Congestion occurs when bandwidth is insufficient and network data traffic exceeds capacity. This paper mainly studies and compares the performance of MANET routing protocols namely PSR, DSR, DSDV and AODV under various traffic loads with various maximum TCP congestion window size to improve congestion control in the routing. The metrics used to compare routing protocol performance are packet delivery ratio, average routing load, the average end-to-end time required with delay and average network throughput and mainly to overcome congestion situation and avoid packet loss in wireless networks.

Comparative Study of Throughput in MANET Routing Protocols with Variable Nodes using NS-2

Mobile Ad-hoc Network (MANET) is a collecting of wireless moveable nodes dynamically forming a temporary mesh without the aid of any constituted store or centralized body. As in MANET, the network anatomy is changing and often changes, so routing protocols should be fashioned to athletics the obligation of the MANET. It is a determinant division in the action valuation of MANET to select suitable mobility model have been proposed for ad hoc wireless networks based on diametrical scenarios. In this theme, we speculated and equated the action of the routing protocols AODV, DSDV, DSR and OLSR with indicator to varying throughput.