EEAODR: An energy‐efficient ad hoc on‐demand routing protocol for mobile ad hoc networks

Mobile ad hoc networks (MANETs) are characterized by random, multi‐hop topologies that do not have a centralized coordinating entity or a fixed infrastructure that may change rapidly over time. In addition, mobile nodes operate with portable and finite power sources. In this work, we propose an energy‐efficient routing protocol for MANETs to minimize energy consumption and increase the network's consistency. Traditional works mainly focused on the shortest path‐based schemes to minimize energy, which might result into network failure because some nodes might exhaust fast as they are used repetitively, while some other nodes might not be used at all. This can lead to energy imbalance and to network life reduction. We propose an energy‐efficient ad hoc on‐demand routing protocol that balances energy load among nodes so that a minimum energy level is maintained among nodes and the network life increases. We focused on increasing the network longevity by distributing energy consumption in the network. We also compared the simulation results with a popular existing on‐demand routing protocol in this area, AODV, to establish the superiority of our approach. Copyright © 2009 John Wiley & Sons, Ltd.     

Energy‐aware geographic routing in wireless sensor networks with anchor nodes

Energy efficiency has become an important design consideration in geographic routing protocols for wireless sensor networks because the sensor nodes are energy constrained and battery recharging is usually not feasible. However, numerous existing energy‐aware geographic routing protocols are energy‐inefficient when the detouring mode is involved in the routing. Furthermore, most of them rarely or at most implicitly take into account the energy efficiency in the advance. In this paper, we present a novel energy‐aware geographic routing (EAGR) protocol that attempts to minimize the energy consumption for end‐to‐end data delivery. EAGR adaptively uses an existing geographic routing protocol to find an anchor list based on the projection distance of nodes for guiding packet forwarding. Each node holding the message utilizes geographic information, the characteristics of energy consumption, and the metric of advanced energy cost to make forwarding decisions, and dynamically adjusts its transmission power to just reach the selected node. Simulation results demonstrate that our scheme exhibits higher energy efficiency, smaller end‐to‐end delay, and better packet delivery ratio compared to other geographic routing protocols. Copyright © 2011 John Wiley & Sons, Ltd.     

An Energy-Aware Routing Protocol for Mobile Ad Hoc Networks Based on Route Energy Comprehensive Index

The design of energy-aware routing protocols has always been an important issue for mobile ad hoc networks (MANETs), because reducing the network energy consumption and increasing the network lifetime are the two main objectives for MANETs. Hence, this paper proposes an energy-aware routing protocol that simultaneously meets above two objectives. It first presents Route Energy Comprehensive Index (RECI) as the new routing metric, then chooses the path with both minimum hops and maximum RECI value as the route in route discovery phase, and finally takes some measures to protect the source nodes and the sink nodes from being overused when their energies are low so as to prolong the life of the corresponding data flow. Simulation results show that the proposed protocol can significantly reduce the energy consumption and extend the network lifetime while improve the average end-to-end delay compared with other protocols.     

An Acknowledgment-Based Approach for the Detection of Routing Misbehavior in MANETs

We study routing misbehavior in MANETs (mobile ad hoc networks) in this paper. In general, routing protocols for MANETs are designed based on the assumption that all participating nodes are fully cooperative. However, due to the open structure and scarcely available battery-based energy, node misbehaviors may exist. One such routing misbehavior is that some selfish nodes will participate in the route discovery and maintenance processes but refuse to forward data packets. In this paper, we propose the 2ACK scheme that serves as an add-on technique for routing schemes to detect routing misbehavior and to mitigate their adverse effect. The main idea of the 2ACK scheme is to send two-hop acknowledgment packets in the opposite direction of the routing path. In order to reduce additional routing overhead, only a fraction of the received data packets are acknowledged in the 2ACK scheme. Analytical and simulation results are presented to evaluate the performance of the proposed scheme     

POWER-AWARE ROUTING BASED ON DSR FOR MOBILE AD HOC NETWORKS

Energy consumption is a crucial design concern in Mobile Ad hoc NETworks （MANETs） since nodes are powered by batteries with limited energy, whereas Dynamic Source Routing （DSR） protocol does not take the energy limitation of MANET nodes into account. This paper proposes an energy-saving routing algorithm based on DSR： Power Aware Routing protocol based on DSR （PAR-DSR）. The design objective of PAR-DSR is to select energy-efficient paths. The main features of PAR-DSR are： （1） Nodes use the Signal Attenuation Rate （SAR） to conduct power control operations; （2） Minimum path cost as metric to balance the traffic and energy consumption of wireless nodes. The simulation results show that PAR-DSR can greatly reduce the energy consumption of MANET nodes. The average node lifetime of PAR-DSR is 50%-77% longer than that of DSR.     

Localized energy efficient routing in mobile ad hoc networks

We consider the problem of localized energy aware routing in mobile ad hoc networks. In localized routing algorithms, each node forwards a message based on the position of itself, its neighbors and the destination. The objective of energy aware routing algorithms is to minimize the total power for routing a message from source to destination or to maximize the total number of routing tasks that a node can perform before its battery power depletes. In this paper we propose new localized energy aware routing algorithms called OLEAR. The algorithms have very high packet delivery rate with low packet forwarding and battery power consumption. In addition, they ensure good energy distribution among the nodes. Finally, packets reach the destination using smaller number of hops. All these properties make our algorithm suitable for routing in any energy constrained environment. We compare the performance of our algorithms with other existing energy and non‐energy aware localized algorithms. Simulation experiments show that our algorithms present comparable energy consumption and distribution to other energy aware algorithms and better packet delivery rate. Copyright © 2006 John Wiley & Sons, Ltd.     

Developing multi-path routing protocol in MANET using hybrid SM-CSBO based on novel multi-objective function

One of the infrastructure-free networks is mobile ad hoc networks (MANETs) that are built with limited battery life using wireless mobile devices. This restricted battery capability in MANETs creates the necessity of considering the energy-awareness constraint in designing them. As routing protocols, the major aim of MANETs is to create the energy awareness in the network; it improves the network's lifetime through effectively utilizing the available restricted energy. Moreover, it creates some limitations like the mobility constraint, wireless link's sensitivity to environmental impacts, and restricted transmission range and residual energy of nodes that causes rapid modifications in the network topology and frequent link failure. By taking those problems, this paper plans to develop a new multipath routing protocol, where the hybrid optimization algorithm with the integration of cuckoo search optimization (CSO) and butterfly optimization algorithm (BOA) is proposed and named sensory modality-based cuckoo search butterfly optimization (SM-CSBO) for determining the optimal path between the source and destination. The main goal is to select the path with better link quality and more stable links to guarantee reliable data transmission. The multi-objective function is considered with the factors regarding distance, normalized energy, packet delivery ratio, and control overhead to develop an effective routing protocol in MANET. The proposed model of SM-CSBO algorithm has superior than 5.8%, 30.4%, 36.7%, and 39.3%, correspondingly maximized than PSO, SFO, CSO, and SFO algorithms while considering the number of nodes as 150. The simulation outcomes proved that it enhances network performance when compared with the other traditional protocols.     

Improving assurance of a sustainable route-split MANET routing by adapting node battery exhaustion

Assurance networks are designed to realize trustable Internet-Of-Things including terminal devices/infrastructure service applications for new generation networks. To construct assurance networks, it is necessary to evaluate them quantitatively. In this paper, we provide one of case studies to evaluate them quantitatively. In mobile ad hoc networks (MANETs), the network environments change over time due to the movement of nodes, the battery level of nodes, and so on. Assurance networks must maintain high performance even when such diverse changes of the network environments occur in the widely applicable domain. And if their performance degrades, they must early recover from the changes. So far, we have proposed a routing method for MANETs, called Route-Split Routing (RSR). RSR can suppress escalation of control packets in large scale MANETs. However, with RSR, drawbacks occur when some nodes exhaust their batteries. In this paper, we propose a sustainable route-split routing scheme to improve assurance by adapting node faults due to battery exhaustion for MANETs. To evaluate the assurance of the proposed method, we have implemented it with a simulator and have conducted simulation experiments. The results indicate that the proposed method can maintain high throughput when some nodes experience various levels of battery power and power consumption and even when some nodes die simultaneously.     

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.     

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.     

Interference aware routing for mobile ad hoc networks based on node＇s sending and receiving capabilities

How to efficiently build routes among nodes is increasing important for mobile ad hoc networks （MANETs）. This paper puts forward an interference aware routing protocol called Interference aware cross layer routing protocol （IA-CLR） for MANETs based on the IEEE 802.11 medium access layer （MAC）. By defining the node＇s sending and receiving capabilities, IA-CLR can indicate the interference strength of the link in a real and comprehensive way. Further more, in order to choose the route with minimum bottleneck link interference, a new routing metric is proposed by combining the MAC layer and the network layer for cross layer design. Simulation results show that IA-CLR can significantly improve the performances of network such as the average end-to-end delay, the packets loss ratio and the throughput.     

Moralism: mobility prediction with link stability based multicast routing protocol in MANETs

In recent research, link stability is getting tremendous attention in mobile adhoc networks (MANETs), because of several impediments that occur in a reliable and robust network. Link stability metric is used to improve network performance in terms of end-to-end delay, data success delivery ratio (DSDR) and available route time (ART). Energy consumption, bandwidth and communication delay of major concern in ad hoc networks. A high mobility of MANET nodes reduces the reliability of network communication. In a dynamic networks, high mobility of the nodes makes it very difficult to predict the dynamic routing topology and hence cause route/link failures. Multicast in MANETs is an emerging trend that effectively improves the performance while lowering the energy consumption and bandwidth usage. Multicast routing protocol transmits a packet to multicast a group at a given time instant to achieve a better utilization of resources. In this paper, node mobility is considered to map better their movement in the network. So, the links with long active duration time can be identified as a stable link for route construction. Variation in signal strength is used to identify whether the direction of the node is towards or away from estimating node. We consider signal strength as QoS metric to calculate link stability for route construction. Efforts are made to identify the link with highly probable longer lifetime as the best suitable link between two consecutive nodes. We predict the movement time of nodes that define the route path to the node destination. Exata/cyber simulator is used for network simulation. The simulation results of the proposed routing protocol are compared with on-demand multicast routing protocol and E-ODMRP, which works on minimum hop count path. Analysis of our simulation results has shown improvement of various routing performance metrics such as DSDR, ART, routing overhead and packet drop ratio.     

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.

     

An energy aware algorithm for OLSR clustering

One of the important aspects of a mobile ad hoc network (MANET) is the limitation of the amount of available energy and the network lifetime. The tremendous amount of using mobile nodes in wireless communication medium makes energy efficiency a fundamental requirement for MANETs. In this paper, we propose a novel energy aware clustering algorithm for the optimized link state routing (OLSR) routing protocol. This algorithm takes into account the node density and mobility and gives major improvements regarding the number of elected cluster heads. Our objective is to elect a reasonable number of cluster heads that will serve for hierarchical routing based on OLSR. The proposed algorithm aims to increase the network lifetime by considering the ad hoc residual energy while taking routing decisions. It also optimizes the delay of carried flows by adopting a selective forwarding approach based on a hierarchical routing model.     

A framework for post-disaster communication using wireless ad hoc networks

Disaster management system requires timely delivery of large volumes of accurate messages so that an appropriate decision can be made to minimize the severity. When a disaster strikes, most of the infrastructure for communication gets uprooted. As a result, communication gets hampered. A well designed Internet of things (IoT) can play a significant role in the post-disaster scenario to minimize the losses, and save the precious lives of animals and human beings. In this paper, we have proposed a framework for post-disaster communication using wireless ad hoc networks. The framework includes: (i) a multi-channel MAC protocol to improve the network throughput, (ii) an energy aware multi-path routing to overcome the higher energy depletion rate at nodes associated with single shortest path routing, and (iii) a distributed topology aware scheme to minimize the transmission power. Above proposals, taken together intend to increase the network throughput, reduce the end-to-end delay, and enhance the network lifetime of an ad hoc network deployed for disaster response. A multi-channel MAC protocol permits the transmission from hidden and exposed nodes without interfering with the on-going transmission. We have compared the proposed framework with an existing scheme called Distressnet [1]. Simulation results show that the proposed framework achieves higher throughput, lower end-to-end delay, and an increased network longevity.     

AODV_RR: A Maximum Transmission Range Based Ad Hoc on-Demand Distance Vector Routing in MANET

Nodes in a mobile ad hoc network are battery constrained devices and energy efficiency becomes an important consideration. In a multi-hop mobile ad hoc network the most common method to achieve energy efficiency is the transmission power control scheme in which a node transmits the data packets to its nearest neighbor which is at minimum required power level. However this scheme minimizes only the transmission power within the node’s neighborhood and energy efficiency at the link level is possible. With this scheme it is not possible to minimize the overall energy consumption of the network and the communication overhead of the network is not minimized. An analysis has been performed and our results have proved that instead of using low transmission power, the routing strategy needs to be controlled and only certain nodes are to be allowed to receive and process this routing request based on the received signal strength, then the overall energy consumption of the network can be minimized and the communication overhead is also minimized. The modified routing strategy is applied to the basic ad hoc on-demand distance vector (AODV) routing protocol and a maximum transmission range based ad hoc on-demand distance vector routing protocol named AODV range routing (AODV_RR) is proposed and studied under different network sizes. Measurable difference in performance is realized and the proposed AODV_RR perform better than normal AODV with respect to all the selected metrics.     

移动自组织网络中能源信息熵的需求多路径路由协议(英文)

This paper provides a critical review of energy entropy theory in Mobile Ad Hoc Networks (MANETs) and proposes an Energy Entropy on Ad Hoc On-demand Distance Vector Multipath (EEAODVM) routing protocol. The essential idea of the protocol is to find every route which can minimize the node residual energy in the process of selecting path. It balances individual node battery energy utilization and hence prolongs the entire network lifetime. The results of simulation show that, with the proposed EEAODVM routing...     

移动Ad hoc网络路由协议的一种节能策略

针对移动Ad hoc网络中节点的有限能量供给问题，通过建立数学模型并结合路由协议的实际特点．提出了一种基于搜索具有最大可持续能量路由的节能策略，并在理论上进行了正确性证明。该策略首先将路由上所有节点可用能量的最小值即路由的可持续能量作为路由的权值，然后选择具有最大权值的路由，定量地解决了能量问题。最后以不具备能量特征的按需式路由协议AODV为例，提出了具体的节能措施，为解决类似问题开辟了一条新的途径。     

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.).     

Energy efficient routing protocols for mobile ad hoc networks

Although establishing correct and efficient routes is an important design issue in mobile ad hoc networks (MANETs), a more challenging goal is to provide energy efficient routes because mobile nodes' operation time is the most critical limiting factor. This article surveys and classifies the energy‐aware routing protocols proposed for MANETs. They minimize either the active communication energy required to transmit or receive packets or the inactive energy consumed when a mobile node stays idle but listens to the wireless medium for any possible communication requests from other nodes. Transmission power control approach and load distribution approach belong to the former category, and sleep/power‐down mode approach belongs to the latter category. While it is not clear whether any particular algorithm or a class of algorithms is the best for all scenarios, each protocol has definite advantages/disadvantages and is well suited for certain situations. The purpose of this paper is to facilitate the research efforts in combining the existing solutions to offer a more energy efficient routing mechanism. Copyright © 2003 John Wiley & Sons, Ltd.