MQ-Routing: Mobility-, GPS- and energy-aware routing protocol in MANETs for disaster relief scenarios

Mobile-Ad-Hoc-Networks (MANETs) are self-configuring networks of mobile nodes, which communicate through wireless links. The main issues in MANETs include the mobility of the network nodes, the scarcity of computational, bandwidth and energy resources. Thus, MANET routing protocols should explicitly consider network changes and node changes into the algorithm design. MANETs are particularly suited to guarantee connectivity in disaster relief scenarios, which are often impaired by the absence of network infrastructures. Moreover, such scenarios entail strict requirements on the lifetime of the device batteries and on the reactivity to possibly frequent link failures. This work proposes a proactive routing protocol, named MQ-Routing, aimed at maximizing the minimum node lifetime and at rapidly adapting to network topology changes. The proposed protocol modifies the Q-Routing algorithm, developed via Reinforcement Learning (RL) techniques, by introducing: (i) new metrics, which account for the paths availability and the energy in the path nodes, and which are dynamically combined and adapted to the changing network topologies and resources; (ii) a fully proactive approach to assure the protocol usage and reactivity in mobile scenarios. Extensive simulations validate the effectiveness of the proposed protocol, through comparisons with both the standard Q-Routing and the Optimized Link State Routing (OLSR) protocols.     

A new algorithm for cluster head selection in LEACH protocol for wireless sensor networks

In wireless sensor network, a large number of sensor nodes are distributed to cover a certain area. Sensor node is little in size with restricted processing power, memory, and limited battery life. Because of restricted battery power, wireless sensor network needs to broaden the system lifetime by reducing the energy consumption. A clustering‐based protocols adapt the use of energy by giving a balance to all nodes to become a cluster head. In this paper, we concentrate on a recent hierarchical routing protocols, which are depending on LEACH protocol to enhance its performance and increase the lifetime of wireless sensor network. So our enhanced protocol called Node Ranked–LEACH is proposed. Our proposed protocol improves the total network lifetime based on node rank algorithm. Node rank algorithm depends on both path cost and number of links between nodes to select the cluster head of each cluster. This enhancement reflects the real weight of specific node to success and can be represented as a cluster head. The proposed algorithm overcomes the random process selection, which leads to unexpected fail for some cluster heads in other LEACH versions, and it gives a good performance in the network lifetime and energy consumption comparing with previous version of LEACH protocols.     

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

Genetic Algorithms With Immigrants and Memory Schemes for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks

In recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile networks [mobile ad hoc networks (MANETs)], wireless sensor networks, etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, i.e., the network topology changes over time due to energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to be a dynamic optimization problem. In this paper, we propose to use GAs with immigrants and memory schemes to solve the dynamic SP routing problem in MANETs. We consider MANETs as target systems because they represent new-generation wireless networks. The experimental results show that these immigrants and memory-based GAs can quickly adapt to environmental changes (i.e., the network topology changes) and produce high-quality solutions after each change.      

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.     

基于频率域多目标MANETs可信路由决策研究

移动Ad-hoc网络(MANETs)具有开放的媒质,动态的拓扑结构,分布式的合作和受限的网络能力等基本特点。网络中移动节点具有匿名性和高度自治的特点,网络通讯依靠在通信路径上的中间节点转发数据包,实现无线传输范围外节点间的正常通信。该文提出了一种独特的MANETs中基于频率下多目标可信路由决策算法,它和现在大多数路由算法都是在时间域下使用单一约束参数选择路由的方式截然不同。利用概率理论分析安全和可信路由,基于概率密度函数的时频相互转化,减小计算复杂度,解决MEANTs中节点间缺乏物理安全以及在低信任水平和节点相互勾结扰乱网络操作情况下,发现可信安全路由难的问题。实例分析证明了此算法的可行性。     

E‐TDGO: An encrypted trust‐based dolphin glowworm optimization for secure routing in mobile ad hoc network

Mobile ad hoc networks (MANETs) are independent networks, where mobile nodes communicate with other nodes through wireless links by multihop transmission. Security is still an issue to be fixed in MANETs. Hence, a routing protocol named encrypted trust‐based dolphin glowworm optimization (DGO) (E‐TDGO) is designed using Advanced Encryption Standard‐128 (AES‐128) and trust‐based optimization model for secure routing in MANET. The proposed E‐TDGO protocol includes three phases, namely, k‐path discovery, optimal path selection, and communication. At first, k paths are discovered based on the distance and the trust level of the nodes. From the k paths discovered, the optimal path is selected using a novel algorithm, DGO, which is developed by combining glowworm swarm optimization (GSO) algorithm and dolphin echolocation algorithm (DEA). Once the optimal path is selected, communication begins in the network such that E‐TDGO protocol ensures security. The routing messages are encrypted using AES‐128 with shared code and key to offer security. The experimental results show that the proposed E‐TDGO could attain throughput of 0.11, delay of 0.01 second, packet drop of 0.44, and detection rate of 0.99, at the maximum number of rounds considered in the network of 75 nodes with attack consideration.     

A routing protocol for mobile ad‐hoc networks using the profit optimization model

Recently, wireless networks have become one of the major development trends in computer network technology. Because there is no more need of the wired transmission medium, applications have thus diversified. One such growing field of wireless networks is the mobile ad‐hoc network (MANET). A MANET consists of mobile hosts (such as portable laptops, vehicles, etc.), and no fixed infrastructure is required. MANETs provide ease of self‐configuration and can extend coverage at a low cost. Numerous applications have therefore been proposed under this network environment for daily life use. Because MANETs nodes are capable of moving, MANET network topology changes frequently. Thus, the traditional routing protocols fail to fit such an environment. In this paper, we propose an efficient routing protocol for MANETs, which integrates the mathematical model of profit optimization (the Kelly formula) from the field of economics to cope with the routing problem caused by node mobility. Some numerical simulations have been conducted to evaluate the performance of the proposed method using the network simulator NS‐2. The results show that our proposed method outperforms conventional routing protocols in packet delivery ratio comparisons; and the average end‐to‐end delays are within a tolerable range. Copyright © 2013 John Wiley & Sons, Ltd.     

A cluster-based trust-aware routing protocol for mobile ad hoc networks

Routing protocols are the binding force in mobile ad hoc network (MANETs) since they facilitate communication beyond the wireless transmission range of the nodes. However, the infrastructure-less, pervasive, and distributed nature of MANETs renders them vulnerable to security threats. In this paper, we propose a novel cluster-based trust-aware routing protocol (CBTRP) for MANETs to protect forwarded packets from intermediary malicious nodes. The proposed protocol organizes the network into one-hop disjoint clusters then elects the most qualified and trustworthy nodes to play the role of cluster-heads that are responsible for handling all the routing activities. The proposed CBTRP continuously ensures the trustworthiness of cluster-heads by replacing them as soon as they become malicious and can dynamically update the packet path to avoid malicious routes. We have implemented and simulated the proposed protocol then evaluated its performance compared to the clustered based routing protocol (CBRP) as well as the 2ACK approach. Comparisons and analysis have shown the effectiveness of our proposed scheme.     

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 energy efficient and QoS routing protocol for MANET realised over multi-objective red deer algorithm (RD-MOCER) in support of emergency disaster management

Terrorist attacks have contributed significantly to using wireless technologies to identify concrete destruction survivors. A dynamic ad hoc mobile network (MANET) consists of wireless linked nodes, which route hop-by-hop without the support of a fixed infrastructure acquires information from trapped survivors. The energy efficiency that extends the lifespan of the network is an essential prerequisite of MANET. Researchers have suggested many strategies to accomplish this purpose and a cluster of these techniques in MANETs are used to provide an energy-efficient approach. In this paper we are proposing a red deer multi-objective constraint applied for an energy efficient QoS routing (RD-MOCER) algorithm to the number of clusters in an ad hoc network and the energy dispensing in nodes to provide an energy effective solution and to minimise network traffic. Intracluster and intercluster traffic is handled by the cluster heads in the proposed approach. The algorithm suggested takes account of mobile nodes' node degrees, transmitting capacity and battery power usage. This approach gives a variety of options at a time, the key benefit of which is that the ideal Pareto front results in these solutions. We correlate the findings with two other well-known methods of clustering; MOPSO and MOEAQ-based clustering with different results. We conduct detailed simulations to demonstrate that the solution proposed is an effective and stronger solution to clustering in ad hoc cell networks than the other two techniques.     

Load balanced routing protocols for ad hoc mobile wireless networks - [Topics in ad hoc and sensor networks]

Mobile ad hoc networks are collections of mobile nodes that can dynamically form temporary networks without the need for pre-existing network infrastructure or centralized administration. These nodes can be arbitrarily located and can move freely at any given time. Hence, the network topology can change rapidly and unpredictably. Because wireless link capacities are usually limited, congestion is possible in MANETs. Hence, balancing the load in a MANET is important since nodes with high loads will deplete their batteries quickly, thereby increasing the probability of disconnecting or partitioning the network. This article discusses the various load metrics and summarizes the principles behind several existing load balanced ad hoc routing protocols. Finally, a qualitative comparison of the various load metrics and load balanced routing protocols is presented.     

Ad hoc无线网络路由协议比较分析

Adhoc是一组无线移动主机组成的一个无需基础设施或集中管理设备的临时网络。网络拓扑易变、带宽、能源有限是其主要特点。文章主要介绍Adhoc网络和组网关键技术——路由协议,并对现在具有代表性的协议性能进行了比较分析,指出了下一步的研究方向。     

Performance Analysis of Adaptive Routing Structure for Wireless Sensor Network Based on Load Balancing

Wireless sensor network consists of sensor nodes with battery operated device. The key challenges in the wireless sensor network are energy consumption and routing optimization. This work presents the cluster based load balancing (CBLB) routing protocol. The proposed routing protocol is used to minimize the energy consumption and increase the routing performance. It avoids the routing robustness, delay and increases the delivery rate and network performance. In existing techniques, different routing protocols such as LEACH, HEED and MESTER were used to increase the network performance and to decrease the energy consumption. But these existing techniques did not satisfy the performance requirements of wireless sensor networks. Hence, there is a requirement to develop a technique that meets the QoS requirements and needs of wireless sensor network. The proposed CBLB routing protocol creates a cluster head in the decentralized network and the cluster head will be used to distribute the workload evenly to the cluster members for reducing the energy consumption in wireless sensor network. Experimental results analyze the performance of the proposed protocol with the different existing protocols. The proposed protocol achieves high throughput, delivery rate and reduces the energy consumption, delay and routing overhead.     

Weighted dominating set based routing for ad hoc communications in emergency and rescue scenarios

Disasters create emergency situations and the services provided must be coordinated quickly via a communication network. Mobile adhoc networks (MANETs) are suited for ubiquitous communication during emergency rescue operations, since they do not rely on infrastructure. The route discovery process of on-demand routing protocols consumes too much bandwidth due to high routing overhead. Frequent route changes also results in frequent route computation process. Energy efficiency, quick response time, and scalability are equally important for routing in emergency MANETs. In this paper, we propose an energy efficient reactive protocol named Weighted-CDSR for routing in such situations. This protocol selects a subset of network nodes named Maximum Weighted Minimum Connected Dominating Set (MWMCDS) based on weight, which consists of link stability, mobility and energy. The MWMCDS provides the overall network control and data forwarding support. In this protocol, for every two nodes u and v in the network there exists a path between u and v such that all intermediate nodes belong to MWMCDS. Incorporating route stability into routing reduces the frequency of route failures and sustains network operations over an extended period of time. With fewer nodes providing overall network control and data forwarding support, the proposed protocol creates less interference and consumes less energy. The simulation results show that the proposed protocol is superior to other protocols in terms of packet delivery ratio, control message overhead, transmission delay and energy consumption.     

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.     

An ant colony optimization based routing algorithm for extending network lifetime in wireless sensor networks

Reducing the energy consumption of network nodes is one of the most important problems for routing in wireless sensor networks because of the battery limitation in each sensor. This paper presents a new ant colony optimization based routing algorithm that uses special parameters in its competency function for reducing energy consumption of network nodes. In this new proposed algorithm called life time aware routing algorithm for wireless sensor networks (LTAWSN), a new pheromone update operator was designed to integrate energy consumption and hops into routing choice. Finally, with the results of the multiple simulations we were able to show that LTAWSN, in comparison with the previous ant colony based routing algorithm, energy aware ant colony routing algorithms for the routing of wireless sensor networks, ant colony optimization-based location-aware routing algorithm for wireless sensor networks and traditional ant colony algorithm, increase the efficiency of the system, obtains more balanced transmission among the nodes and reduce the energy consumption of the routing and extends the network lifetime.     

A technique to improve network lifetime in mobile ad hoc networks

Energy is an important issue in mobile ad hoc networks (MANETs), and different energy‐aware routing mechanisms have been proposed to minimize the energy consumption in MANETs. Most of the energy‐aware routing schemes reported in the literature have considered only the residual battery capacity as the cost metric in computing a path. In this paper, we have proposed, an energy‐aware routing technique which considers the following parameters: (i) a cost metric, which is a function of residual battery power and energy consumption rate of participating nodes in path computation; (ii) a variable transmission power technique for transmitting data packets; and (iii) To minimize the over‐utilization of participating nodes, a limit is set on the number of paths that can be established to a destination through a participating node. The proposed scheme is simulated using Qualnet 4.5 simulator, and compared with Ad hoc On‐Demand Distance Vector (AODV) and Lifetime Enhancement Routing (LER). We observed that the proposed scheme performs better in terms of network lifetime and energy consumption. Copyright © 2014 John Wiley & Sons, Ltd.