Secure way routing protocol for mobile ad hoc network

Mobile adhoc network is dynamic in nature and it operates completely in an infrastructure-less environment. It discovers the way routes dynamically to reach the destination. Securing a dynamic way route, which is not known before establishing communication, is always a challenge in the mobile ad hoc network. Most of the existing secure routing protocols target to evade specific type of attacks or malicious behaviour of the nodes or networks. We propose a novel secure way routing protocol for securing the dynamic way routes in MANET. It provides a unique session key for each route to secure the data communication. Moreover, it authenticates the data packets using asymmetric cryptography and secures the routing field message using two-way asymmetric cryptography. The proposal is implemented and tested for assessing the protocol’s performance. We have also compared the protocol with the other secure routing protocols for evaluating its performance.     

Cross‐layer design for topology control and routing in MANETs

A mobile ad hoc network (MANET) is a self‐organized and adaptive wireless network formed by dynamically gathering mobile nodes. Since the topology of the network is constantly changing, the issue of routing packets and energy conservation become challenging tasks. In this paper, we propose a cross‐layer design that jointly considers routing and topology control taking mobility and interference into account for MANETs. We called the proposed protocol as Mobility‐aware Routing and Interference‐aware Topology control (MRIT) protocol. The main objective of the proposed protocol is to increase the network lifetime, reduce energy consumption, and find stable end‐to‐end routes for MANETs. We evaluate the performance of the proposed protocol by comprehensively simulating a set of random MANET environments. The results show that the proposed protocol reduces energy consumption rate, end‐to‐end delay, interference while preserving throughput and network connectivity. Copyright © 2010 John Wiley & Sons, Ltd.     

MECOR: Minimal Energy Consumption with Optimized Routing in MANET

Energy and routing efficiency is a long-research topic from past decades in the area of MANET. The prior research contribution focusing on addressing both the issues are associated with issues like (1) few benchmarked studies, (2) adoption of conventional routing protocols based on shortest path to mitigate both issues, and (3) inefficient design principles of routing. Hence, this paper proposes a novel routing protocol in mobile ad hoc network (MANET) termed as MECOR i.e. minimal energy consumption with optimized routing. MECOR presents a simple communication strategy based on mathematical and signaling properties of mobile nodes in MANET to jointly address the energy and routing issues in MANET. The outcome of the MECOR was compared with conventional routing algorithm as well as recent studies of energy efficient routing policy to find that MECOR can minimize 58.82 % of energy in most challenging mobility scenarios of MANET.     

Routing mechanisms for mobile ad hoc networks based on the energy drain rate

Untethered nodes in mobile ad hoc networks strongly depend on the efficient use of their batteries. In this paper, we propose a new metric, the drain rate, to forecast the lifetime of nodes according to current traffic conditions. This metric is combined with the value of the remaining battery capacity to determine which nodes can be part of an active route. We describe new route selection mechanisms for MANET routing protocols, which we call the minimum drain rate (MDR) and the conditional minimum drain rate (CMDR). MDR extends nodal battery life and the duration of paths, while CMDR also minimizes the total transmission energy consumed per packet. Using the ns-2 simulator and the dynamic source routing (DSR) protocol, we compare MDR and CMDR against prior proposals for energy-aware routing and show that using the drain rate for energy-aware route selection offers superior performance results. Methods keywords are system design and simulations.     

A Power-Aware Multicast Routing Protocol for Mobile Ad Hoc Networks With Mobility Prediction

A mobile ad hoc network (MANET) is a dynamically reconfigurable wireless network that does not have a fixed infrastructure. Due to the high mobility of nodes, the network topology of MANETs changes very fast, making it more difficult to find the routes that message packets use. Because mobile nodes have limited battery power, it is therefore very important to use energy in a MANET efficiently. In this paper, we propose a power-aware multicast routing protocol (PMRP) with mobility prediction for MANETs. In order to select a subset of paths that provide increased stability and reliability of routes, in routing discovery, each node receives the RREQ packet and uses the power-aware metric to get in advance the power consumption of transmitted data packets. If the node has enough remaining power to transmit data packets, it uses the global positioning system (GPS) to get the location information (i.e., position, velocity and direction) of the mobile nodes and utilizes this information to calculate the link expiration time (LET) between two connected mobile nodes. During route discovery, each destination node selects the routing path with the smallest LET and uses this smallest link expiration time as the route expiration time (RET). Each destination node collects several feasible routes and then selects the path with the longest RET value as the primary routing path. Then the source node uses these routes between the source node and each destination node to create a multicast tree. In the multicast tree, the source node will be the root node and the destination nodes will be the leaf nodes. Simulation results show that the proposed PMRP outperforms MAODV (Royer, E. M. & Perkins, C. E. (1999). In Proceedings of the ACM MOBICOM, pp. 207–218, August 1999.) and RMAODV (Baolin, S. & Layuan, L. (2005). In Proceeding of the 2005 IEEE International symposium on microwave antenna, propagation and EMC technologies for wireless communications, Vol. 2, pp. 1514–1517, August 2005.).     

A Shoelace-Based QoS Routing Protocol for Mobile Ad Hoc Networks Using Directional Antenna

In this paper, we propose a new quality-of-service (QoS) routing protocol for mobile ad hoc network (MANET) using directional antennas. The proposed scheme offers a bandwidth-based routing protocol for QoS support in MANET using the concept of multi-path. Our MAC sub-layer adopts the CDMA-over-TDMA channel model. The on-demand QoS routing protocol calculates the end-to-end bandwidth and allocates bandwidth from the source node to the destination node. The paths are combined with multiple cross links, called shoelace, when the network bandwidth is strictly limited. Due to the property of the directional antenna, these cross links can transmit data simultaneously without any data interference. We develop a shoelace-based on-demand QoS routing protocol by identifying shoelaces in a MANET so as to construct a QoS route, which satisfied the bandwidth requirement, more easily. The shoelace-based route from the source to the destination is a route whose sub-path is constructed by shoelace structure. With the identified shoelaces, our shoelace-based scheme offers a higher success rate to construct a QoS route. Finally, simulation results demonstrate that the proposed routing protocol outperform existing QoS routing protocols in terms of success rate, throughput, and average latency.     

A region-based routing protocol for wireless mobile ad hoc networks

Flooding-based route discovery is widely assumed in existing routing protocols of wireless ad hoc networks. Network-wide flooding enables the discovery of optimal routes from sources to destinations; however, as all network nodes are required to participate in the relays of route request packets, substantial control overhead is inevitable. Some efficient broadcast schemes can suppress redundant packet relays, but they often suppress the discovery of optimal routes, too. In this article we propose to dynamically create a prerouting region between each source-destination pair and limit the propagations of route request packets only within this region. The prerouting region effectively restricts route discovery activities to the nodes that most likely constitute the optimal or near-optimal routes. Consequently, not only is route construction overhead significantly reduced; route optimality is also guaranteed. The article presents a region-based routing (REGR) protocol covering both new route formation cases and route update cases. Simulations show that our protocol is particularly beneficial to dense and large-scale mobile ad hoc networks.     

Energy Efficient QoS Aware Hierarchical KF-MAC Routing Protocol in Manet

The paper proposes an energy efficient quality of services (QoS) aware hierarchical KF-MAC routing protocol in mobile ad-hoc networks. The proposed KF-MAC (K-means cluster formation firefly cluster head selection based MAC routing) protocol reduces the concentration of QoS parameters when the node transmits data from source to destination. At first, K-means clustering technique is utilized for clustering the network into nodes. Then the clustered nodes are classified and optimized by the firefly optimization algorithm to find cluster heads for the clustered nodes. The transmission of data begins in the network nodes and TDMA based MAC routing does communication. The observation on KF-MAC protocol performs well for QoS parameters such as bandwidth, delay, bit error rate and jitter. The evaluation of proposed protocol based on a simulation study concludes that the proposed protocol provides a better result in contrast to the existing fuzzy based energy aware routing protocol and modified dynamic source routing protocol. With KF-MAC protocol, the collision free data transmission with low average energy consumption is achieved.     

An efficient anonymous communication protocol for peer-to-peer applications over mobile ad-hoc networks

An efficient anonymous communication protocol, called MANET Anonymous Peer-to-peer Communication Protocol (MAPCP), for P2P applications over mobile ad-hoc networks (MANETs) is proposed in this work. MAPCP employs broadcasts with probabilistic-based flooding control to establish multiple anonymous paths between communication peers. It requires no hop-by-hop encrypt ion/decryption along anonymous paths and, hence, demands lower computational complexity and power consumption than those MANET anonymous routing protocols. Since MAPCP builds multiple paths to multiple peers within a single query phase without using an extra route discovery process, it is more efficient in P2P applications. Through analysis and extensive simulations, we demonstrate that MAPCP always maintains a higher degree of anonymity than a MANET anonymous single-path routing protocol in a hostile environment. Simulation results also show that MAPCP is resilient to passive attacks     

LSCR:一种Mobile Ad hoc网络链路状态分组路由算法

本文提出了一种Mobile Ad hoc网络(Manet)链路状态分组路由算法(Link State-hased Cluster Routing Algo-rithm-LSCR)，该算法对Manet节点进行动态分组，每一组选举出一个具有最大度数的头结点(CH-Cluster Header)，该cH负责本组信息的管理、组内结点与组外结点之间的通信以及与其他组的CH之间交换链路状态信息等工作．本算法将改进的链路状态协议与分组路由协议有机结合，有效提高了Manet网络的路由效率．分析和实验结果表明，这种算法具有路由收敛速度快、维护成本相对较低，数据包发送成功率高，发送等待时间短等特点。     

Load Balancing Technique for Congestion Control Multipath Routing Protocol in MANETs

A mobile ad hoc network (MANET) is a collection of wireless mobile nodes that can communicate without a central controller or fixed infrastructure. Due to node mobility, designing a routing protocol to provide an efficient and suitable method to route the data with less energy consumption, packet drop and to prolong the network lifetime has become a challenging issue in MANETs. In MANETs, reducing energy consumption and packet loss involves congestion control and load balancing techniques. Thus, this paper introduces an efficient routing technique called the multipath load balancing technique for congestion control (MLBCC) in MANETs to efficiently balance the load among multiple paths by reducing the congestion. MLBCC introduces a congestion control mechanism and a load balancing mechanism during the data transmission process. The congestion control mechanism detects the congestion by using an arrival rate and an outgoing rate at a particular time interval T. The load balancing mechanism selects a gateway node by using the link cost and the path cost to efficiently distribute the load by selecting the most desirable paths. For an efficient flow of distribution, a node availability degree standard deviation parameter is introduced. Simulation results of MLBCC show the performance improvements in terms of the control overhead, packet delivery ratio, average delay and packet drop ratio in comparison with Fibonacci sequence multipath load balancing, stable backbone-based multipath routing protocol and ad hoc on demand multipath distance vector routing. In addition, the results show that MLBCC efficiently balances the load of the nodes in the network.

     

Efficient Route Selection Scheme in MANET Using Enhanced AODV Protocol

Mobile Ad Hoc network comprises of mobile nodes communicating over wireless medium. Due to ease of communication and flexibility, MANET has become an active area of research in wireless communication. However, issues such as limited battery capacity, dynamic topology and node mobility cause frequent link breakage due to which reroute discovery process is required to be initiated resulting in increase in latency and routing overheads. Many research works have been carried out for improvement of an existing routing scheme, however they do not scale-up well to provide stable and energy efficient route. This paper introduces a novel routing algorithm ENH-AODV (Enhanced AODV) that focuses on selection of an efficient route on the basis of quality of both links and nodes impending during route discovery process. In addition, each node maintains a list, consisting of details of nearby nodes with good energy level through hello mechanism. Simulation is carried out over network simulator and results prove that the proposed scheme is more effective and advantageous than AODV in terms of normalized routing load, end to end delay, packet delivery ratio and throughput.

     

Deploying power‐aware on‐demand (PAOD) schemes over routing protocols of mobile wireless ad hoc networks

A mobile ad hoc network (MANET) is an autonomous collection of mobile nodes that communicate over relatively bandwidth‐constrained wireless links. MANETs need efficient algorithms to determine network connectivity, link scheduling, and routing. An important issue in network routing for MANETs is to conserve power while still achieve a high packet success rate. Traditional MANET routing protocols do not count for such concern. They all assume working with unlimited power reservoirs. Several ideas have been proposed for adding power‐awareness capabilities to ad hoc networks. Most of these proposals tackle the issue by either proposing new power‐aware routing protocols or modifying existing routing protocols through the deployment of power information as cost functions. None of them deal with counter‐measures that ought to be taken when nodes suffer from low power reserves and are subject to shut down in mid of normal network operations. In this paper, power‐awareness is added to a well‐known traditional routing protocol, the ad hoc on‐demand distance vector (AODV) routing protocol. The original algorithm is modified to deal with situations in which nodes experience low power reserves. Two schemes are proposed and compared with the original protocol using different performance metrics such as average end‐to‐end delays, transmission success rates, and throughputs. These schemes provide capabilities for AODV to deal with situations in which operating nodes have almost consumed their power reserves. Copyright © 2005 John Wiley & Sons, Ltd.     

Trust-Based Routing Mechanism in MANET: Design and Implementation

Mobile Ad hoc Network (MANET) is a self-organizing wireless network for mobile devices. It does not require any fixed infrastructure to be configured which makes it more suitable to be used in environments that require on-the-fly setup. This paper discusses the challenging issues in MANET routing security. It presents FrAODV, a trust-based scheme for securing AODV routing protocol in MANET using the friendship mechanism. The nodes can evaluate the routing paths according to some selected features (such as node reputation and identity information) before forwarding the data through these routes. We have used two types of implementation in our scheme, simulation (using NS2) and real test-bed (using JADHOC). This scheme is believed to provide a robust environment where MANET nodes can trust each other in a secure community.     

A Dynamic Alternate Path QoS Enabled Routing Scheme in Mobile Ad hoc Networks

A mobile ad hoc network (MANET) is a collection of self-organized mobile nodes that are capable of communicating with each other without the aid of any established infrastructure or centralized administration. Routing algorithm has been a challenge task in the wireless ad hoc network for a long time due to the dynamic nature of network topology. A recent trend in ad hoc network routing is the reactive on-demand philosophy where routes are established only when required. The on-demand routing protocol for ad hoc network is appealing because of its low routing overhead and its effectiveness when the frequency of route re-establishment and the demand of route queries are not high. However, considering the increasing demand of Quality-of-Service (QoS) requirements in many applications, the current on-demand routing protocols used for ad-hoc network should be adapted appropriately to effectively meet the stringent QoS requirements of specific multimedia traffic. We thus propose a routing protocol which tries its best to satisfy QoS requirements of specific multimedia traffic in the volatile environments of a MANET. The results of a series of simulations exhibit the practicability and feasibility of our approaches. This research was partially supported by National Science Council under grant NSC 93-2213-E-026-001     

IoT energy efficiency routing protocol using FHO-based clustering and improved CSO model-based routing in MANET

Many protocols, services, and electrical devices with built-in sensors have been developed in response to the rapid expansion of the Internet of Things. Mobile ad hoc networks (MANETs) consist of a collection of autonomous mobile nodes that can form an ad hoc network in the absence of any pre-existing infrastructure. System performance may suffer due to the changeable topology of MANETs. Since most mobile hosts operate on limited battery power, energy consumption poses the biggest challenge for MANETs. Both network lifetime and throughput improve when energy usage is reduced. However, existing approaches perform poorly in terms of energy efficiency. Scalability becomes a significant issue in large-scale networks as they grow, leading to overhead associated with routing updates and maintenance that can become unmanageable. This article employs a MANET routing protocol combined with an energy conservation strategy. The clustering hierarchy is used in MANETs to maximize the network's lifespan, considering its limited energy resources. In the MANET communication process, the cluster head (CH) is selected using Fire Hawk Optimization (FHO). When choosing nodes to act as a cluster for an extended period, CH election factors in connectivity, mobility, and remaining energy. This process is achieved using an optimized version of the Ad hoc On-Demand Distance Vector (AODV) routing protocol, utilizing Improved Chicken Swarm Optimization (ICSO). In comparison to existing protocols and optimization techniques, the proposed method offers an extended network lifespan ranging from 90 to 160 h and reduced energy consumption of 80 to 110 J, as indicated by the implementation results.     

A Novel Cross-layer Routing Protocol for Increasing Packet Transfer Reliability in Mobile Sensor Networks

In mobile sensor networks (MSNs), sensor data is generally transferred via mobile sensor nodes by multi-hop fashion. Because of the mobility of the nodes in the network, the efficient routing protocols are needed to ensure end-to-end route reliability while incurring minimal power consumption and packet delay. In this study, we developed a new routing protocol to meet these requirements for MSNs based on a cross-layer interaction among five reference layers (application, transport, network, MAC and physical). The proposed protocol primarily exploits the idea of interaction among these five layers all-in-one protocol. Its primary goals are (i) to discover the most reliable route in network, (ii) to sustain the route reliability and (iii) to be energy efficient and delay aware. It has been designed, modeled and simulated by using OPNET Modeler simulation software. The simulation results of the proposed protocol have been compared to three well known routing protocols (i.e., AODV, Leach-Mobile, CBR-Mobile). According to the obtained results, the proposed protocol outperforms its counterparts in terms of route reliability and end-to-end delay performances.     

Power Management Based Grid Routing Protocol for IEEE 802.11 Based MANET

MANET(Mobile Ad Hoc Network)is a collection of wireless mobile nodes forming a temporary communica-tion network without the aid of any established infrastructure or centralized administration.The lifetime of a MANETdepends on the battery resources of the mobile nodes.So energy consumption may one of important design criterions forMANET.With changing the idle model to sleep model in the grid environment,this paper proposes a new energy-awarerouting protocol.Performance simulation results show that the proposed strategy can dynamic balance the traffic load in-side the whole network,extend the lifetime of a MANET,and without decreasing the throughput ratio.     

Local replacement for route recovery on a collaborative mobile ad hoc network

This paper presents an efficient route recovery approach for a collaborative mobile ad hoc network (MANET). In the collaborative MANET, the movement of a node can be controlled by other nodes. Based on the property of the controllable movement, each active node (each node on a route) can be protected by its neighboring nodes. When the movement of an active node causes a link breakage on a route, its neighboring nodes compete with each other to move to the original location of the moving active node. Using the movements of neighboring nodes, the proposed approach can achieve route recovery without pre‐establishing or dynamically finding backup routes. The proposed approach also has much less recovery overhead than previous approaches because of the local recovery. Finally, we perform extensive simulations to compare the proposed approach with previous approaches. The simulation results show that the proposed approach has better recovery performance under dense and sparse MANET architectures. Copyright © 2010 John Wiley & Sons, Ltd.     

Trust Based Detection and Elimination of Packet Drop Attack in the Mobile Ad-Hoc Networks

The mobile ad hoc network (MANET) is communication network of a mobile node without any prior infrastructure of communication. The network does not have any static support; it dynamically creates the network as per requirement by using available mobile nodes. This network has a challenging security problem. The security issue mainly contains a denial of service attacks like packet drop attack, black-hole attack, gray-hole attack, etc. The mobile ad-hoc network is an open environment so the working is based on mutual trust between mobile nodes. The MANETs are vulnerable to packet drop attack in which packets travel through the different node. The network while communicating, the node drops the packet, but it is not attracting the neighboring nodes to drop the packets. This proposed algorithm works with existing routing protocol. The concept of trusted list is used for secure communication path. The trusted list along with trust values show how many times node was participated in the communication. It differentiates between altruism and selfishness in MANET with the help of energy level of mobile components. The trust and energy models are used for security and for the differentiation between altruism and selfishness respectively.