Routing In Mobile Ad Research Articles

Data aggregation and routing in Mobile Ad hoc network: Introduction to Self-Adaptive Tasmanian Devil Optimization

Mobile Ad-Hoc Network (MANETs) is referred to as the mobile wireless nodes that make up ad hoc networks. The network topology may fluctuate on a regular basis due to node mobility. Each node serves as a router, passing traffic throughout the network, and they construct the network’s infrastructure on their own. MANET routing protocols need to be able to store routing information and adjust to changes in the network topology in order to forward packets to their destinations. While mobile networks are the main application for MANET routing techniques, networks with stationary nodes and no network infrastructure can also benefit from using them. In this paper, we proposed a Self Adaptive Tasmanian Devil Optimization (SATDO) based Routing and Data Aggregation in MANET. The first step in the process is clustering, where the best cluster heads are chosen according to a number of limitations, such as energy, distance, delay, and enhanced risk factor assessment on security conditions. In this study, the SATDO algorithm is proposed for this optimal selection. Subsequent to the clustering process, routing will optimally take place via the same SATDO algorithm introduced in this work. Finally, an improved kernel least mean square-based data aggregation method is carried out to avoid data redundancy. The efficiency of the suggested routing model is contrasted with the conventional algorithms via different performance measures.

Secured Routing in Mobile Ad hoc Networks (MANETs)

A Mobile Adhoc Network (MANET) is prone to attacks. Adversaries take hold of the network, thus degrading their performance. Various attacks are prevalent in MANET, out of which Byzantine attack plays a vital role. A node or group of nodes present in the routing path between the source and the destination may be compromised due to Byzantine attack. In this paper, Cohen Kappa Reliability Coefficient based Mitigation (CKRCM) mechanism is proposed to deal with these attacks. The intermediate nodes are monitored by their neighbors for a timestamp. If the monitoring node does not receive an acknowledgment, then the nodes are perceived to be attacked. The trustworthiness of the nodes is built by computing the trusts and reliabilities of the nodes. It is seen that the proposed scheme outperforms the existing scheme in terms of Throughput, Packet Delivery Ratio (PDR) and Packet Loss Ratio (PLR).

Secure routing in mobile Ad hoc networks: a predictive approach

In recent years, wireless technologies have gained enormous popularity and used vastly in a variety of applications. Mobile Ad hoc Networks (MANETs) are temporary networks which are built for specific purposes; they do not require any pre-established infrastructure. The dynamic nature of these networks makes them more utilizable in ubiquitous computing. These autonomous systems of wireless mobile nodes can be set up anywhere and anytime. However, due to high mobility, absence of centralized authority and open media nature, MANETs are more vulnerable to various security threats. As a result, they are prone to more security issues as compared to the traditional networks. Ad hoc networks are highly susceptible to various types of attacks. Sequence number attacks are such hazardous attacks which greatly diminish the performance of the network in different scenarios. Sequence number attacks suck some or all data packets and discard them. In past few years, various researchers proposed different solutions for detecting the sequence number attacks. In this paper, first we review notable works done by various researchers to detect sequence number attacks. The review thoroughly presents distinct aspects of the proposed approach. In addition, we propose a proactive predictive approach to mitigate sequence number attacks which discovers misbehaving nodes during route discovery phase. The proposed approach suggests modifications in Ad hoc on-demand distance vector (AODV) routing protocol.

Secure Routing in Mobile Ad hoc Network

Abstract— MANET is a wireless Mobile ad-hoc network which includes mobile nodes. In MANET mobile refers to the movable nodes which can change their location frequently. MANET is a network which has no central infrastructure; it is a self-managing and self-configuring network. In MANET devices can be heterogeneous like laptops, mobiles, PDAs etc. Due to the movement of the nodes and no infrastructure MANET can be used in disaster and emergency situations. MANET has the characteristics of dynamic topology, multi hop routing, energy constraint and easy setup. The nodes in the MANET work as a both host and a router, to make routes in the network. Due to all these flexible features of MANET there are many security vulnerabilities arises. In MANET routing is a main concern due to the mobility and the node work as a router. The security of the routing layer is essential because if any attack interrupts the communication then security of whole network can be compromised. There are different types of attacks in MANET: such as internal attacks, external attacks and other attacks of all layers. Network layer attacks are identified in this paper. Some routing protocols are used for the security of routing in MANET like SAODV, SRP, SEAD and Ariadne etc. In this paper we present a review of routing attacks and their possible solutions how to avoid from these attacks. Keywords- Mobile ad-hoc network, Routing, Attacks, Security

New Approaches to Routing in Mobile Ad hoc Networks

Worldwide Interoperability for Microwave Access (Wimax) is power station through which mobile network, commonly known as A Mobile Ad-hoc Network (MANET) is used by the people. A MANET can be described as an infrastructure-less and self-configure network with autonomous nodes. Participated nodes in MANETs move through the network constantly causing frequent topology changes. Designing suitable routing protocols to handle the dynamic topology changes in MANETs can enhance the performance of the network. In this regard, this paper proposes four algorithms for the routing problem in MANETs. First, we propose a new method called Classical Logic-based Routing Algorithm for the routing problem in MANETs. Second is a routing algorithm named Fuzzy Logic-based Routing Algorithm (FLRA). Third, a Reinforcement Learning-based Routing Algorithm is proposed to construct optimal paths in MANETs. Finally, a fuzzy logic-based method is accompanied with reinforcement learning to mitigate existing problems in FLRA. This algorithm is called Reinforcement Learning and Fuzzy Logic-based (RLFLRA) Routing Algorithm. Our proposed approaches can be deployed in dynamic environments and take four important fuzzy variables such as available bandwidth, residual energy, mobility speed, and hop-count into consideration. Simulation results depict that learning process has a great impact on network performance and RLFLRA outperforms other proposed algorithms in terms of throughput, route discovery time, packet delivery ratio, network access delay, and hop-count.

An efficient protocol for load-balanced multipath routing in mobile ad hoc networks

In this paper, we propose a new routing protocol called the Least Common Multiple based Routing (LCMR) for load-balanced multipath routing in Mobile Ad hoc NETworks (MANETs). First, we find multiple paths between a source to a destination, when those exist, along with the estimates of the time to route a packet along each of these paths. The data packets originating from the source to the destination are then distributed along these multiple paths in such a way that the number of data packets sent along any such path is inversely proportional to the routing time through this path. This distribution strategy keeps the load balanced along all the paths so that the overall routing time for sending the data packets is minimized. Routes between a given source-destination pair are discovered in a way similar to that in the Ad hoc On-demand Distance Vector (AODV) routing protocol with the difference that instead of the number of hops, the routing time for reaching the destination along every route is measured, and multiple routes, if those exist, will also be determined by the route discovery process. Our proposed technique for distribution of packets along different routes is very elegant with a better performance than the existing load-balanced routing protocols like Fibonacci Multipath Load Balancing (FMLB) and Multiple AODV (MAODV), as established from a theoretical analysis as well as through simulation results.

Neighborhood-based interference minimization on Greedy based backup routing in Mobile Ad hoc Networks

Neighborhood-based interference minimization on Greedy based backup routing in Mobile Ad hoc Networks

IWDRP: An Intelligent Water Drops Inspired Routing Protocol for Mobile Ad Hoc Networks

This paper deals with the problem of routing in Mobile Ad hoc Networks (MANET). A mobile ad hoc network is a collection of mobile devices deployed without any pre-established infrastructure or centralized administration. Routing is a very challenging issue since the appearance of this technology. The main goal of every routing protocol is to find a route between two communicating nodes while optimizing overall performances of the network. This paper introduces a novel routing protocol inspired from the nature and that should deal with the dynamic aspect of MANET. The used approach, called Intelligent Water Drops (IWD), mimics the processes that happen in the natural river systems, particularly, the actions that water drops perform in the rivers to find the shortest path to their destination (sea). In fact, it is observed that water drops of a river often find good paths among lots of possible paths in their ways from a source to a destination. We combined these ideas with a route failure prediction mechanism to develop a new routing protocol for MANETs called IWDRP. This prediction method is based on the received signal strength indicator. Further simulation results show that IWDRP is able to achieve better results in terms of packet delivery, end-to-end delay in comparison with AODV-BFABL. The achievement in this paper has certain reference value to the further study of the routing issue in MANETs.

Modeling and optimization of Quality of Service routing in Mobile Ad hoc Networks

Abstract Mobile ad hoc networks (MANETs) are a group of mobile nodes that are connected without using a fixed infrastructure. In these networks, nodes communicate with each other by forming a single-hop or multi-hop network. To design effective mobile ad hoc networks, it is important to evaluate the performance of multi-hop paths. In this paper, we present a mathematical model for a routing protocol under energy consumption and packet delivery ratio of multi-hop paths. In this model, we use geometric random graphs rather than random graphs. Our proposed model finds effective paths that minimize the energy consumption and maximizes the packet delivery ratio of the network. Validation of the mathematical model is performed through simulation.

A robust energy efficient ant colony optimization routing algorithm for multi-hop ad hoc networks in MANETs

The Ant Colony Optimization (ACO) routing technique is an adaptive and reliable approach to find the paths in routing for Mobile Ad hoc Networks (MANETs). In ACO algorithms, the ant as agents traverses across the network to find the shortest path from the source to its destination. During the traversal, the ants deposits pheromones on its path. The path with high probability of pheromone is chosen as the optimized path to transfer data packets between the source and the destination. The quantity of the pheromone laid down on a path depends on its quality metrics viz. minimum number of hops, minimum energy path cost and packet transfer delay. Due to the high dynamic nature of MANETs, the path with high probability of the pheromone deposition may rapidly become unavailable due to link failures. Therefore, it is a challenging task in MANETs to construct a reliable path that is less likely to be disconnected for a long period of time. In this paper, a novel robust energy efficient ACO routing algorithm named AntHocMMP has been proposed. This algorithm is meant to achieve robustness of paths for reliable communication with adaptive re-transmission delays in MANETs. This proposed algorithm enhances the performance of Max---Min---Path (MMP) approach by using ant as agents to find the optimal path in the network. The selection of the optimal path is based on the residual energy of the nodes in that path. A robust route with minimum energy path cost with a short hop-count is chosen for pheromone deposition. Therefore, to keep the paths connected in a dynamic topology, the proposed AntHocMMP redistributes the pheromone based on the energy path cost and it constructs an alternative path for reliable communication between the source and the destination nodes. In this paper, a study has also been done on the effects of re-transmission delays spent in reliably delivering the packets to the destination nodes. The simulation result shows that AntHocMMP achieves a good packet delivery ratio in a wider communication range than the existing algorithms viz. R-ACO1, LAR, MMP and AntHocNet routing algorithms. The statistical analysis viz. t test and Anova-test have been performed that proves which in turn the proposed AntHocMMP dominates the other existing algorithms in a more significant way.

Efficient Load Sharing using Multipath Channel Awareness Routing in Mobile Ad hoc Networks

Objectives: To develop a new multipath load sharing algorithm using channels sensing, node energy level analysis and malicious node detection. It aims at finding an efficient load sharing technique that gives better throughput delivery, less delay and security for data transformation. Methods/Analysis: A channel sensing between the nodes is performed to measure the signal to noise ratio and reject the path if the noise strength is greater than the signal strength. Prior energy level analysis is done for consistent data transmission over a period of time without any interrupt. A watchdog timer method is adopted for malicious node identification and removal. Findings: The quality of service in MANETs has been improved such as throughput has been increased 15% and packet delivery ratio has been increased 20% and the overall delay has been minimized 27%. Conclusion/Application: We proposed an efficient best path selection load sharing algorithm, which involves channel sensing, node energy level analysis and malicious node removal for security concern.

Methodologies for Addressing the Performance Issues of Routing in Mobile Ad hoc Networks: A Review

The objective of this review article is to offer an insight into the performance issues pertinent to routing in Mobile Ad hoc Networks. This work has studied the approaches for solving the performance issues such as changes in topology, energy consumption of mobile nodes, delay, routing overhead, message delivery time, throughput, packet delivery ratio, security of networks and mobility management. To provide a perception of solutions for these issues, this study concentrates on various methodologies such as Effective Hierarchical Routing Algorithm, Link Stability with Energy Aware Multipath Routing protocol, Path Encounter Rate metric and Trust-based Source Routing protocol. Effective Hierarchical Routing Algorithm computes the route and has decreased the load of routing protocols. Link Stability with Energy Aware Multipath Routing protocol finds routes with small delay. Delivery ratio of packet in LSEA is improved on par with Ad hoc On-demand Distance Vector Routing (AODV). Delivery ratio of packets in LSEA was enhanced by 40%. To get an efficient metric for routing in high mobility situations, Path Encounter Rate metric was proposed. Throughput achieved with this metric was 30% higher than those obtained by the hop-count metric. To choose a least-cost route with security constraints, TSR was proposed. TSR has improved the packet delivery ratio, ratio of identifying the malicious nodes as well as network throughput. This review of different methods can be used by researchers to find a better solution to these issues.

A Novel Approach of Cluster based Routing in Mobile Ad hoc Networks

The research on the various issues in Mobile ad hoc networks are getting popularity because of its challenging nature and all time connectivity to communicate . MANET is a random deployable network where devices mobile with dynamic topology. In the network topology, each device is termed as a node and the virtual connectivity among each node is termed as the link. Nodes in the network are dynamically organized into virtual partitions called cluster. Network simulators provide the platform to analyze the working of computer networks along with the typical devices, traffic and other entities using ns2. In this paper we analyze and provide ways of how nodes are made for routing after clustering among nodes during simulation. General Terms Clustering Scheme, Mobile adhoc Network.

Efficient Path Selection Routing based on Traffic-Size for Mobile Ad Hoc Networks

Routing in Mobile Ad hoc Networks (MANETs) is a complex one due to the absence of any central coordinator and infrastructure. Congestion is one of the prominent reasons for link-failure in network due to the heavy traffic which leads to failure of nodes, network partition and topology change. Due to power drainage among nodes, network topology changes and the nodes should be well adaptive to respond quickly to the changes. Various existing routing protocols forward the data packets towards the destination through the path having less number of hop counts. However, these protocols do not minimize the traffic load in the network and thus causes congestion which reduces the network operation. A routing protocol called Efficient Path Selection (EPS) is proposed which enhances the quality of services' issues such as Packet Delivery Ratio, End to End delay, Energy Consumption and also provide secure transmission of data packets. This paper provides secure and efficient path routing. The simulation signifies that proposed protocol provides reliable secure transmission than the existing Implicit Source Routing (ISR) protocol.

A New Scheme of Routing in Mobile Ad hoc Networks for Reducing Delay and Finding Shortest Path

Wireless networks offer more flexibility and adapt easily to changes in the configuration of the network. Wireless ad hoc network is a decentralized type of wireless network. Mobile ad hoc network is a type of ad hoc network, in which each and every node can change its location. Frequent link breakages exist due to its high mobility of nodes which leads to frequent path failures and route discoveries. An efficient and fundamental data dissemination mechanism is broadcasting, the mobile node blindly rebroadcasts the first received route request, even if there is no route to destination leads to broadcast storm problem.. In this paper a hybrid protocol is proposed, which combines the advantages of neighbor coverage based probabilistic rebroadcast protocol and adhoc on demand distance vector routing protocol and is simulated by Network Simulator. The neighbor coverage and probabilistic mechanism significantly decreases the number of retransmissions so as to reduce the routing overhead. Adhoc on demand distance vector routing protocol finds the shortest path to destination by evaluating the hop count. The shortest path reduces the average end to end delay more effectively. Thus hybrid protocol improves the routing performance.

REAQ-AODV: Route Stability and Energy Aware QoS Routing in Mobile Ad hoc Networks

Frequent changes in network topology, confined battery capacity of nodes and unreliable nature of wireless channels are the main challenges for reliable routing in Mobile Ad hoc Network (MANET). Selecting a long lasting route is a critical task in MANET. In this paper, we propose a new protocol, Route Stability and Energy Aware Ad hoc On-demand Distance Vector (RSEA-AODV) protocol which is an enhancement of Ad hoc On-demand Distance Vector (AODV) protocol. It designs a bi-objective optimization formulation to compute the reliability factor based on stability and residual energy of nodes. The route with the highest reliability factor value is selected for data transmission. This protocol is compared with other similar routing protocols: PERRA and AODV. We use ns-2 for simulation. Our simulation results show that, the proposed protocol increases the node expiration time by 12 - 32 % and accomplishes 7 - 13 % higher packet delivery ratio compared to PERRA or AODV. The packet delay and control overhead of the proposed protocol is comparable to that of AODV.

Routing in Mobile Ad hoc Networks using Bluetooth and Mobile Phones

Routing in Mobile Ad hoc Networks using Bluetooth and Mobile Phones

ANFIS and agent based bandwidth and delay aware anycast routing in mobile ad hoc networks

Anycast is a point to point flow of packets for obtaining services or sending data to one of a multitude of destinations that share one address. To meet needs of real time and multimedia applications, anycast routing in Mobile Ad hoc Networks (MANETs) must provide faster service with better Quality of Service (QoS). This paper proposes an Adaptive Neuro-Fuzzy Inference System (ANFIS) based multiple QoS constrained anycast routing in MANETs by using a set of static and mobile agents. Three types of agents are used in the scheme: static anycast manager agent, static optimization agent, and mobile anycast route creation agent. The scheme operates in the following steps. (1) Optimization agent at the client optimizes membership functions for bandwidth, link delay and packet loss rate to develop Fuzzy Inference System (FIS) by using ANFIS. (2) Anycast route creation agents are employed by the client to explore multiple paths from source (client) to all anycast members (servers) through intermediate nodes. These agents gather intermediate node's information such as available bandwidth, link delay, residual battery power, and stability of anycast servers. The information is passed on to the client. (3) Anycast manager agent at the client performs finding QoS factor by using optimized FIS for every path, and selects QoS anycast path based on QoS and server stability factor, and (4) Anycast route creation agent is also employed for maintaining the QoS path in the event of node/link failures. The simulation results demonstrate reduction in end-to-end delay and control overhead, improvement in packet delivery ratio and path success ratio, as compared to shortcut tree based anycast routing (SATR) in MANETs.

Quality of Service Routing in Mobile Ad hoc Networks Using Node Mobility and Energy Depletion Parameters

Exceptionally dynamic networks are Mobile Ad hoc Networks. Quality of Service (QoS) routing in such Networks are frequently limited by the network split due to either energy depletion or node mobility of the mobile nodes. In addition, to fulfill specific quality parameters, existence of multiple node-disjoint paths becomes essential. Such paths assist in the optimal traffic distribution and consistency in case of path breakages. Thus, to accommodate such problem, we present a node-disjoint multipath protocol. The metric system of measurement used to select the paths takes into account the stability of the nodes and the equivalent links.

Quality of Service Routing in Mobile Ad hoc Networks Using Node Mobility and Energy Depletion Parameters

Quality of Service Routing in Mobile Ad hoc Networks Using Node Mobility and Energy Depletion Parameters