Routing Algorithm For Mobile Ad-hoc Networks Research Articles

On the Repair Time Scaling Wall for MANETs

The inability of mobile ad hoc network (MANET) deployments to scale beyond about 100 nodes, in practice, has traditionally been blamed on insufficient network capacity for supporting routing related control traffic. This letter observes, however, that network capacity remains significantly underutilized by standard MANET routing algorithms at this scale of deployment. Therefore, instead of characterizing the scaling limit for MANET routing in terms of capacity, this letter characterizes it in terms of the interaction between the dynamics of path failure (caused by mobility) and of path repair. This leads to the discovery of the repair time scaling wall, which is used to explain the observed scaling limits in MANETs. The impact of repair time scaling wall on MANETs is identified, and techniques to extend the scaling limits are described.

A Cross Layer Distributed Topology Control Algorithm for Mobile Ad Hoc Networks

Objectives: Mobile Ad-Hoc Networks (MANETs) have several constraints because of its changing nature. So the routing and topology control algorithms for MANETs should be designed in such a way that on any instance the network should ensure minimum interference among the nodes. Hence there is always a need for Quality of Service (QoS). This is contradictory to the objective of minimizing interference. Analysis of Methods: The existing topology control algorithms have taken only the interference as the deciding factor. But the implementation of those works have failed to justify that interference caused delay and thereby the QoS. Several security related issues are there in MANETs. The commonly used security strategy for MANET is Certificate management. In Voting based revocation systems, time consumption and communication overheads are high. In non-Voting based revocation systems, security is at risk. Findings: So in the proposed work, the delay-constrained topology control problem is taken with delay and security as performance metrics. The delay caused due to transmission, contention and queuing delay are taken into account in the proposed algorithm. How the mobility of a node plays a major role in MANET is investigated and the unstable links along with malicious nodes are removed from the topology. Improvement: The results obtained from this proposed cross-layer distributed algorithm for MANETs, where delay plays a crucial role are compared with the existing protocols and has proven to be more advantageous.

An Energy Entropy-Based Minimum Power Cost Multipath Routing in MANET

Mobile Ad hoc Networks (MANETs) are non-infrastructure networks consisting of mobile nodes. Since the mobile nodes have limited battery power, they are very important to using energy efficiently in MANETs. In order to maximize the lifetime of MANET, traffic should be sent via a route that can avoid nodes with low energy while minimizing the total transmission power. This paper proposes an Energy Entropy-based minimum Power cost Multipath routing algorithm in MANET (EEPMM). It is typically proposed to increase the reliability of data transmission or to provide load balancing. In simulation experiments, we compare EEPMM routing protocol with SHM and MEA-DSR routing protocol, in terms of the network lifetime, and the energy consumption when a packet is transmitted. The performance results indicate that the proposed scheme is quite adaptive for energy-efficient communication in MANETs.

Genetic based optimization for multicast routing algorithm for MANET

Mobile Ad hoc Network (MANET) is established for a limited period, for special extemporaneous services related to mobile applications. This ad hoc network is set up for a limited period, in environments that change with the application. While in Internet the TCP/IP protocol suite supports a wide range of application, in MANETs protocols are tuned to specific customer/application. Multicasting is emerging as a popular communication format where the same packet is sent to multiple nodes in a network. Routing in multicasting involves maintaining routes and finding new node locations in a group and is NP-complete due to the dynamic nature of the network. In this paper, a Hybrid Genetic Based Optimization for Multicast Routing algorithm is proposed. The proposed algorithm uses the best features of Genetic Algorithm (GA) and particle swarm optimization (PSO) to improve the solution. Simulations were conducted by varying number of mobile nodes and results compared with Multicast AODV (MAODV) protocol, PSO based and GA based solution. The proposed optimization improves jitter, end to end delay and Packet Delivery Ratio (PDR) with faster convergence.

FBeeAdHoc: A secure routing protocol for BeeAdHoc based on fuzzy logic in MANETs

Mobile ad hoc network (MANET) is a group of mobile nodes that are formed dynamically by an autonomous system and communicates with each other without any supporting infrastructure. These networks are vulnerable to a number of security threats due to their unique features such as open nature, lack of infrastructure, node mobility and limited physical security of the nodes. Hence designing a secure routing protocol has become a popular research topic. Bio/Nature-inspired routing algorithms (Swarm Intelligence) such as BeeAdHoc have been offered for developing routing algorithms for MANETs. In this paper, the security vulnerabilities of BeeAdHoc are investigated and then a security framework, FBeeAdHoc, which utilizes fuzzy set theory and digital signature is proposed. A toolbox TRUTIME is used with MATLAB for simulation. The results of our experiments show that our proposed framework is able to counter the different types of threats and achieves better performance as compared to ad hoc on-demand distance vector (AODV).

Efficient Internet Access Framework for Mobile Ad Hoc Networks

The development of the Internet services and applications and the trend in the fourth generation (4G) wireless networks to all-IP networks have led to a growing demand for enabling Mobile Ad hoc NETworks (MANETs) to connect to the Internet and achieving the goal of omnipresence Internet which is accessible anytime and anywhere. However, such integration gives rise to a number of challenges. In this paper, an efficient framework which has considered six main challenges encountered in the MANET---Internet integration is proposed. An adaptive distributed multipath internet gateways discovery protocol is proposed, where the gateways advertise their information dynamically to an adaptive limited number of mobile nodes. For mobile nodes that cannot receive this information, an efficient dynamic routing algorithm for MANETs---Internet integration derived from the ant colony optimization algorithms is proposed. In addition, an improved Quality of Services based gateway selection mechanism providing load-balancing is proposed. The simulation study confirms that the proposed framework is scalable and able to cope with changes on the number and mobility of active sources connecting to the Internet and outperforms other conventional approaches in terms of end-to-end delay, packet delivery ratio while attaining acceptable overhead and fair load distribution among all gateways.

Secure routing in MANETs: a bio-inspired approach with honey bees

Mobile Ad Hoc Networks (MANETs) have created ample interest in recent times owing to their various advantages compared to the networks that require basic infrastructure for them to work. This paper elaborates various attacks that can be perpetrated on MANETs and their current solutions. Bio-inspired methods have recently gained importance in computing owing to the need for flexible, adaptable ways of solving engineering problems. Bio-inspired algorithms are based on the structure and functioning of complex natural systems and tend to solve problems in an adaptable and distributed fashion. Thus, bio-inspired techniques can accurately apply to MANETs to solve various issues in the design and working of MANETs. Our bee-inspired protocol is an on-demand path routing algorithm for MANETs inspired by the behavioural principles of honey bees. The algorithm works with multiple types of agents: scouts, workers and soldiers.

A NOVEL APPROACH OF HYBRID MULTIPATH ROUTING PROTOCOL FOR MANETS USING RECEIVED SIGNAL STRENGTH

Mobile ad hoc networks (MANETs) are special kind of distributed networks that comprise wireless mobile nodes which can freely and dynamically self-organize into capricious and temporary manner. The demand for ubiquitous information access and spontaneous information exchange has multiplied considerably and with predictions to grow even more within the future. To satisfy this increasing demand, new protocols standards and merchandise addressing wireless networking have emerged. Designing an appropriate routing algorithm in MANETs is very complex because of dynamic mobility, resource constraints and limited battery power. For improving the performance of MANETs, we proposed new routing algorithm called Hybrid Multipath Progressive Routing Protocol (HMPRP). In this protocol we apply the most well-liked properties a famed MANETs the Ad-hoc On-demand Distance Vector routing protocol (AODV) using the received signal strength. Using this protocol we can reduce the routing overhead and overload will optimize the bandwidth capacity of MANETs. This routing protocol is compared with the standard AODV, OLSR, and ZRP protocol.

Comparative Analysis of Routing Protocols in Mobile Ad-Hoc Networks (MANETs)

ad-hoc network (MANET) is a collection of mobile nodes that is said to be connected through a wireless medium forming rapidly changing topologies. Mantes are infra- structure less in nature and can be set up anytime, anywhere. In this paper, a survey has been conducted of protocol properties of various MANET routing algorithms and analyzed them. The routing algorithms considered in the paper are said to be classified into two categories proactive (table driven) and reactive (on demand). The algorithms considered in this paper are AODV, DSDV and DSR. The comparison among these routing protocols is based on the various protocol property and category parameters.

Bee-MANET: A New Swarm-based Routing Protocol for Wireless Ad Hoc Networks

Recently, mobile ad hoc networks (MANETs) have drawn attention by many researchers due to the development of portable devices and wireless network appliances have accounted for ad hoc networks. Many academic researchers have shown great interest in ad hoc networks for twenty years. One of the main fields adopted by researchers studying on Mobile Ad-hoc Networks is to develop routing protocols in wireless systems. Routing protocol development is related to complexity, scalability, adaptability, productivity, and battery life in wireless systems. Routing protocols for wireless systems are developed in order to cope with these problems. In this paper, a new routing protocol for mobile ad hoc network (Bee-MANET) was presented to improve network throughput. Bee-MANET, AODV and Beeadhoc routing algorithms for MANETs are empirically compared in order to research their large-scale behaviors. The results presented as graphs and brief discussion is given. DOI: http://dx.doi.org/10.5755/j01.eee.20.3.3421

Secure Last Acknowledged Packet Routing Algorithm (SLAPRA) for MANETs

Mobile Ad Hoc Networks (MANETs) are becoming more pervasive thanks to their advantages of being infrastructureless and portable. However such networks suffer from a variety of attacks due to several inherent factors such as mobility, signal attenuation and interference, and limited computation power and battery resources on mobile devices. Secure light-weight routing for a reliable path consisting of trustable nodes has not been an easy task. In this research, we propose the Secure Last Acknowledged Packet Routing Algorithm (SLAPRA),capable ofefficient and prompt attack detection and malicious node isolation, and demonstrate the validity of the algorithm through simulation.

DVR-Based Manet Routing Protocols Taxonomy

In ad hoc network, each node is equipped with a wireless transmitter and receiver (transceiver) that is powered by a battery. Two nodes willing to communicate with each other need to be either in the direct common range of each other or should be helped by other nodes to act as routers forwarding their packets. A node in a Mobile Ad hoc Network (MANET) acts as dual role of a host and a router as well. Designing routing algorithm for MANET is a difficult job compared to designing routing algorithm for wired networks. The important challenges in routing in MANET are due to same intrinsic characteristic of MANET, like limited battery power, highly dynamic nature of network topology, limited bandwidth, asymmetric links, scalability, mobility of nodes etc. In this paper, we analyzed DVR based routing protocols aiming to find suitable path through special neighbours between hops in MANET. This paper classified various routing protocols based on DVR for MANET and compared on the characteristics (routing metrics), performance and complexity.

Design of DAODV MANET Routing Protocol

hoc networking is a concept in computer communications, which means that users wanting to communicate with each other form a temporary network, without any form of centralized administration. Each node participating in the network acts both as a host and as a router. The study of distributed network and mobile ad hoc network (MANET) are currently two hotspots in distributed computing and mobile communication researching domain. We build up a distributed overlay network on top of MANET's physical infrastructure, to effectively integrate distributed network's advantage on sustaining highly dynamic network into the design of MANET routing protocol. We deploy passive MANET routing algorithms with innovative distributed routing mechanisms. We propose a new kind of MANET routing protocol named distributed Computing based ad-hoc on demand routing (DAODV). Our work indicates that DAODV has an improved routing performance in comparison with the popularly used AODV protocol.

Fuzzy Controllers Based Multipath Routing Algorithm in MANET

Mobile ad hoc networks (MANETs) consist of a collection of wireless mobile nodes which dynamically exchange data among themselves without the reliance on a fixed base station or a wired backbone network. Due to the limited transmission range of wireless network nodes, multiple hops are usually needed for a node to exchange information with any other node in the network. Multipath routing allows the establishment of multiple paths between a single source and single destination node. The multipath routing in mobile ad hoc networks is difficult because the network topology may change constantly, and the available alternative path is inherently unreliable. This paper introduces a fuzzy controllers based multipath routing algorithm in MANET (FMRM). The key idea of FMRM algorithm is to construct the fuzzy controllers with the help to reduce reconstructions in the ad hoc network. The simulation results show that the proposed approach is effective and efficient in applications to the MANETs. It is an available approach to multipath routing decision.

PSO-Optimized Hopfield Neural Network-Based Multipath Routing for Mobile Ad-hoc Networks

Mobile ad-hoc network (MANET) is a dynamic collection of mobile computers without the need for any existing infrastructure. Nodes in a MANET act as hosts and routers. Designing of robust routing algorithms for MANETs is a challenging task. Disjoint multipath routing protocols address this problem and increase the reliability, security and lifetime of network. However, selecting an optimal multipath is an NP-complete problem. In this paper, Hopfield neural network (HNN) which its parameters are optimized by particle swarm optimization (PSO) algorithm is proposed as multipath routing algorithm. Link expiration time (LET) between each two nodes is used as the link reliability estimation metric. This approach can find either node-disjoint or link-disjoint paths in single phase route discovery. Simulation results confirm that PSO-HNN routing algorithm has better performance as compared to backup path set selection algorithm (BPSA) in terms of the path set reliability and number of paths in the set.

Analog Based Routing Algorithm using Ant Agents for MANETs (ABRAAM)

A mobile ad hoc network (MANET) is an anthology of wireless mobile hosts forming a short-lived network without the help of any centralized infrastructure. In such an environment, the reliable and shortest path finding between two hosts to transfer the payload is an extremely challenging task. The absence of a centralized infrastructure is a big problem in MANET where we cannot apply traditional routing algorithm used for standard wired networks. The three parameters tSignal Strength, Angle and Time of arrival are non-trivial parameters to decide the longevity and duration of a wireless link in a discovered route. A source node can analyze the reliability of a path and can establish an efficient routing algorithm for MANET by carefully measuring all analog measures and can predetermine the payload size which can be forwarded via that path.

Transient chaotic neural network-based disjoint multipath routing for mobile ad-hoc networks

Due to mobility of wireless hosts, routing in mobile ad-hoc networks (MANETs) is a challenging task. Multipath routing is employed to provide reliable communication, load balancing, and improving quality of service of MANETs. Multiple paths are selected to be node-disjoint or link-disjoint to improve transmission reliability. However, selecting an optimal disjoint multipath set is an NP-complete problem. Neural networks are powerful tools for a wide variety of combinatorial optimization problems. In this study, a transient chaotic neural network (TCNN) is presented as multipath routing algorithm in MANETs. Each node in the network can be equipped with a neural network, and all the network nodes can be trained and used to obtain optimal or sub-optimal high reliable disjoint paths. This algorithm can find both node-disjoint and link-disjoint paths with no extra overhead. The simulation results show that the proposed method can find the high reliable disjoint path set in MANETs. In this paper, the performance of the proposed algorithm is compared to the shortest path algorithm, disjoint path set selection protocol algorithm, and Hopfield neural network (HNN)-based model. Experimental results show that the disjoint path set reliability of the proposed algorithm is up to 4.5 times more than the shortest path reliability. Also, the proposed algorithm has better performance in both reliability and the number of paths and shows up to 56% improvement in path set reliability and up to 20% improvement in the number of paths in the path set. The proposed TCNN-based algorithm also selects more reliable paths as compared to HNN-based algorithm in less number of iterations.

A link stability-based multicast routing protocol for wireless mobile ad hoc networks

Recently, several studies have been conducted to design mobility-based multicast routing protocols for wireless mobile ad hoc networks (MANET). These protocols assume that the mobility parameters of the network are fixed, and so they cannot perform well under real MANET scenarios in which the mobility parameters of the hosts vary over time at random. Finding the optimal solution to the multicast routing problem is incredibly hard, if the mobility parameters are assumed to be random variables. This becomes more difficult when the probability distribution function of these random variables is assumed to be unknown. In this paper, we propose a weighted multicast routing algorithm for MANET in which the mobility parameters are supposed to be random variables with unknown distribution. In this method, the multicast routing problem is first transformed into an equivalent stochastic Steiner tree problem in which the random weight associated with a communication link is its expected duration time. Then, a learning automata-based algorithm is proposed for solving the proxy Steiner tree problem. The aim of the proposed algorithm is to find the most stable multicast route (with the maximum duration) against the host mobility. Experimental results confirm the superiority of the proposed method over the best existing mobility-based multicast routing protocols in terms of the packet delivery ratio, multicast route lifetime, control message overhead, and end-to-end delay.

Mobility-based multicast routing algorithm for wireless mobile Ad-hoc networks: A learning automata approach

During the last decades, many studies have been conducted on multicast routing in mobile ad hoc networks (MANET) and a host of algorithms have been proposed. In existing algorithms, the mobility characteristics are assumed to be constant, and so they do not scale well when the mobility parameters are not deterministic. To the best of our knowledge no work has been done on multicast routing when the mobility parameters are stochastic, while in realistic applications these parameters vary with time. In this paper, we propose a mobility-based multicast routing algorithm for wireless MANETs wherein the mobility characteristics are stochastic and unknown. The proposed algorithm estimates the expected relative mobility of each host, by sampling its movement parameters in various epochs, to realistically predict its motion behavior, and takes advantage of the Steiner connected dominating set to form the virtual multicast backbone. To do this, in this paper, a stochastic version of the minimum Steiner connected dominating set problem in weighted network graphs, where the relative mobility of each host is considered as its weight is initially introduced. Then, a distributed learning automata-based algorithm is designed to solve this problem. The designed algorithm is proposed for multicast routing in wireless mobile Ad-hoc networks. The experiments show the superiority of the proposed multicast routing algorithm over the existing methods in terms of the packet delivery ratio, multicast route lifetime, and end-to-end delay. We present a strong convergence theorem in which the convergence of the proposed distributed learning automata-based algorithm to the optimal solution is proved. It is shown that the most stable multicast route is found with a probability as close as to unity by the proper choice of the parameters of the distributed learning automata.

Cluster-Based Location Aided Routing Algorithm for Mobile Ad Hoc Networks

在大规模移动自组织网中,利用节点位置信息辅助建立路由被认为是一种有效提高无线网络路由可扩展性的方法.提出了一种可扩展与高效的、适用于移动自组织网络的路由算法——分簇覆盖的节点位置信息辅助路由算法(CLAR).CLAR使用如最小簇改变(LCC)算法,建立并保持的单跳分簇结构为拓扑.已有文献证明,LCC是更新成本最小的保持簇头节点密度均一的分簇算法.CLAR利用网络节点的位置信息提高无线网络路由的网络层性能,由目标节点的位置信息预测并构造一个较小的、形状为等腰三角形、矩形或圆形的区域.该区域需保证覆盖目标节点可能存在的位置,且根据源节点与目标节点间的相对位置决定该区域适宜的形状,从而限制源节点在一个较小的“请求域”内寻找可用路由,而不是在网络内盲目寻找.仿真实验结果表明,与其他路由算法相比较,CLAR路由算法在路由建立所需时长、路由代价、平均时延及数据包冲突等参数上表现优良.同时,算法保持了低平均时延、高数据包到达率、低控制开销及低路由寻找次数等优势.;Using location information to assist routing is often proposed as an efficient means to achieve scalability in large mobile ad hoc networks (MANET). This paper proposes an algorithm, named as Cluster-Based Location Aided Routing (CLAR), a scalable and efficient routing algorithm for MANET. CLAR runs on top of a one-hop cluster cover of the MANET, which can be created and maintained by, for instance, the Least Cluster Change (LCC) algorithm. It has been proven that LCC can maintain a cluster cover with a constant density of clusterheads with the minimal update cost. CLAR then utilizes nodes’ location information to improve the network layer performance of routing. The location information of destination node is used to predict a smaller isosceles triangle, rectangle, or circle request zone, which is selected according to the relative location of the source and the destination, that covers the estimated region where the destination may locate. Instead of searching the route in the entire network blindly, CLAR confines the route searching space into a much smaller estimated range. Simulation results have shown that CLAR outperforms other protocols significantly in route set up time, routing overhead, mean delay and packet collision, and simultaneously maintains low average end-to-end delay, high success delivery ratio, low control overhead, as well as low route discovery frequency.