Cooperative Routing Algorithm Research Articles

SQMCR: Stackelberg Q-Learning-Based Multi-Hop Cooperative Routing Algorithm for Underwater Wireless Sensor Networks

SQMCR: Stackelberg Q-Learning-Based Multi-Hop Cooperative Routing Algorithm for Underwater Wireless Sensor Networks

Adaptive cooperative routing transmission for energy heterogeneous wireless sensor networks

The mass machine type communication (mMTC) in 5G requires the technical support of the wireless sensor network (WSN). Compared with homogeneous WSNs, heterogeneous WSNs provide more flexibility and are more in line with the reality. For heterogeneous WSNs, the use of proper routing methods can prolong the lifetime as well as the stability of the system. This paper studies an energy heterogeneous WSN, where nodes can cooperate with each other to improve the energy efficient of the network. We focus on the network routing within distributed energy-efficient clustering (DEEC) protocol, a typical networking/communication protocol for heterogeneous WSNs. First, we derive a proposition on the choice of cooperative single-hop or multi-hop modes, which gives a sufficient condition on cooperative multi-hop transmission. Furthermore, we present two lemmas, which are the conditions on the distance threshold for mode selection. Based on the above, a novel adaptive cooperative routing algorithm combined with DEEC is proposed. Simulation results show that the proposed routing algorithm outperforms the benchmark schemes and can effectively reduce the network energy consumption and prolong the network lifetime.

Research on energy-efficient routing algorithm based on SWIPT in multi-hop clustered WSN for 5G system

As one of the basic supporting technologies of 5G system, wireless sensor networks technology is facing a new challenge to improve its transmission energy efficiency. This paper considers combining simultaneous wireless information and power transfer (SWIPT) technique and routing technique, and applying them to multi-hop clustered wireless sensor networks (MCWSN), where each node can decode information and harvest energy from a received radio-frequency signal. And the relay nodes in MCWSN can utilize the harvest energy to forward data to their next hop nodes according to the routing scheme. First, we formulate an energy-efficient routing problem of MCWSN with SWIPT. Then, a heuristic energy efficient cooperative SWIPT routing algorithm (EECSR) is presented to find a transmission path with the maximum energy efficiency. Specifically, in EECSR, the resource allocation problem in each hop of the path is transformed to some equivalent convex optimization problems, which are resolved via dual decomposition. Moreover, a distributed routing protocol based on EECSR is proposed. As far as we know, this is the first solution that considers energy efficiency optimization based on routing and SWIPT in MCWSN. Simulation results show that our EECSR algorithm has high energy efficiency and good robustness. And our distributed routing protocol has better real-time performance than traditional protocols.

Digital Media Art Communication Based on Wireless Cooperative Routing with Minimum Energy Consumption

Wireless cooperative routing algorithm transmits the data collected in the target area to users, so that users can obtain monitoring information timely and accurately. In the traditional low‐power adaptive clustering hierarchical routing protocol, the process of building clusters is random, the resources of nodes are not fully utilized, the node death speed is fast, the network life cycle is short, and the performance is not stable enough. In addition, the route maintenance process is cumbersome and will occupy a lot of bandwidth. In order to solve the problems of real‐time transmission of digital media art communication data and network lifetime optimization, a wireless cooperative routing algorithm based on minimum energy consumption is proposed. The facts of transmission strength consumption, node residual strength, and minimal information transmission extension are analyzed, a new weight feature is proposed, and a multipath statistics routing scheme is developed by using the usage of the minimal strength consumption. All digital media art propagation sensor nodes transmit data to sink nodes along multiple transmission paths. Simulation results show that the algorithm can prolong the network lifetime, reduce and balance the node energy consumption, reduce the data transmission delay, reduce the energy consumption of wireless cooperative routing based on the minimum energy consumption by 64.5%, and increase the number of compressed images by 182%.

An efficient cooperative routing algorithm for large-scale wireless networks based on capacity and location

An efficient cooperative routing algorithm for large-scale wireless networks based on capacity and location

An Efficient Cooperative Routing Algorithm for Large-Scale Wireless Networks based on Capacity and Location

Cooperative communication has been extensively used in small-scale wireless networks, by virtue of its capability to mitigate the fading effects. Extending cooperative communication technique to large-scale networks undergoes severe interference; multi-radio-multi-channel is exploited in large scale wireless networks to ameliorate throughput by concurrent transmissions over orthogonal channels to dwindle interference. Capitalising on these potential advantages, stand in need for efficacious routing and potent mapping of channels to radios. In this paper, we have proffered an algorithm by concurrently considering: 1) relay selection using distance and maximum-available-channel-capacity parameters; 2) channel assignment using dynamic global table. Our algorithm selects a relay-node based on the available channel capacity in the shortest-path to minimise the transmission delay without affecting aggregate throughput. The evaluation and analysis of the proposed model is compared with interference-aware-cooperative-routing algorithm and observed that the proposed algorithm has improved delay reduction by 27.5% and the average number of hops by 32.5%.

Simplified clustering and improved intercluster cooperation approach for wireless sensor network energy balanced routing

The equilibrium use of energy is very important for wireless sensor networks (WSN) with limited energy in order to avoid premature network collapse. The existing methods either need too complex calculations for precise clustering, or are too simple to overburden a few cluster heads. In order to solve these problems, we proposed energy balanced clustering routing (EBCR) in this paper. It could maximize the WSN life in energy non-harvesting scenario or improve energy utilization efficiency in energy harvesting scenario without increasing the amount of calculations. It gives a complete solution to the process of cluster head election, clustering, and intercluster routing algorithm. Firstly, a light weight cluster head election and a distributed cluttering method are proposed by introducing dynamic cluster radius and intersection region node division schemes with new principles. Thus, lightweight distributed clustering achieves the advantages of balancing the burden of cluster heads and alleviating hot zone problem. Then we optimized the cluster cooperative routing algorithm by analyzing cooperation and competition among cluster heads. The intercluster cooperative routing algorithm greatly improves the transmission efficiency between cluster heads. Moreover, this paper analyzes the reasons why the algorithm achieves more balanced energy usage, higher energy efficiency, and fewer calculations compared to the existing mainstream algorithms. At last, simulation results show that EBCR algorithm has advantages in terms of network energy consumption, number of surviving nodes in energy non-harvesting scenario compared with the delay-constrained energy-efficient cluster-based multi-hop routing (DCEM) method. Simulation also gives EBCR algorithm performance under various energy harvesting scenarios, which is quite satisfactory in energy utilization efficiency comparing with DCEM method. EBCR algorithm has superior performance in terms of balanced energy usage, low computation complexity, and high energy efficiency.

Should drivers cooperate? Performance evaluation of cooperative navigation on simulated road networks using network DEA

For drivers, traffic congestion causes enormous delays and increases energy consumption. For a city’s traffic management team, traffic congestion challenges economic growth and increases pollution. Many drivers rely on a GPS navigation system to choose the fastest route to reach their destination. The GPS algorithms generally work for a single driver, while ignoring their collective resulting impact on the road network. If there exists a cooperative centralised routing algorithm that minimises the whole network congestion, the city can greatly benefit from congestion reduction, though some drivers may suffer from such a cooperative routing algorithm. These drivers may opt-out from the cooperative centralised routing, which, in turn, impacts the whole network routing efficiency. So, does having higher proportions of cooperative drivers on the road network always work better? In this paper, we take a heuristic cooperative routing algorithm which minimises the network congestion. We simulate a road network and measure its performance under various proportions of cooperative drivers. We measure both the congestion and the average drivers’ perceived road network performance. Network data envelopment analysis (network DEA) technique is used to see which proportions of cooperative drivers can best benefit the city and drivers collectively.

Graphene-Grid Deployment in Energy Harvesting Cooperative Wireless Sensor Networks for Green IoT

Energy harvesting (EH) technology is an effective way to resolve the energy supply problem for green Internet of Things application. However, it is extremely vulnerable to the unpredictable environmental changes, and as a result, sensor nodes are charged in an uncontrollable way. In this paper, we focus on EH cooperative wireless sensor networks (EHC-WSNs), a new type of WSNs that integrates EH and wireless energy transfer technologies to provide the continuous and controllable energy supply. We propose the graphene-grid deployment strategy to guarantee energy coverage and network connectivity, whereby a Graphene-based Energy Cooperation Management (GECM) mechanism is designed under the energy-neutral operation. Furthermore, we divide GECM into two different phases, i.e., graphene-based energy cooperative charging strategy and graphene-based opportunistic cooperative routing algorithm, which are optimized according to the graphene-grid structure. Extensive simulations show that the proposed GECM can maximize the harvested energy utilization and prolong the network lifetime.

Channel-aware cooperative routing in underwater acoustic sensor networks

This paper proposes cooperative routing algorithms to improve the performance of underwater acoustic sensor networks (UW-ASNs). With the consideration of the poor acoustic link quality, a cross-layer design of physical layer and network layer is described for selecting simultaneously routing relays (RR) for forwarding data on routing paths and cooperative relays (CR) for one-hop cooperative communications. In the networks, sources that have data to transmit independently selects their own relays (i.e., both RR and CR) among their neighbors based on their link quality indicators (i.e., signal-to-noise ratio (SNR), time of arrival (ToA)) and their physical distances represented by hop count (HC) to the destination. Exploiting packet receiving or overhearing in the networks, these parameters are averaged and updated frequently to adapt to the unreliable and varying characteristics of acoustic channel over the time. By this way, the “best” relays with the “best” estimated measurements are selected reliably. Our simulation results show that the proposed algorithms improve the network performance in terms of end-to-end delay, energy consumption and packet delivery ratio.

Multipath Cooperative Routing with Efficient Acknowledgement for LEO Satellite Networks

Multipath routing can significantly improve the network throughput and end-to-end (e2e) delay. Network coding based multipath routing removes the complicated coordination among multiple paths so that it further enhances data transmission efficiency. Traditional network coding based multipath routing protocols, however, are inefficient for Low Earth Orbit (LEO) satellite networks with the long link delay and regular network topology . Considering these characteristics, in this paper, we first formulate the multipath cooperative routing problem, then propose a Network Coding based Multipath Cooperative Routing (NCMCR) protocol for LEO satellite networks to improve the throughput. We propose source-based and destination-based multipath cooperative routing algorithms, which deliver different parts of a data flow along multiple link-disjoint paths dynamically and cooperatively. Furthermore, we design an efficient No-Stop-Wait ACK mechanism for our NCMCR protocol to accelerate the data transmission, where a source node continuously sends subsequent batches before it receives ACK messages for the batches sent previously. Under the proposed acknowledgement mechanism, we theoretically analyze the number of coded packets that should be sent and the transmission times of each batch for successfully decoding a batch. NS2-based simulation results demonstrate that our NCMCR outperforms the most related protocols.

Channel-Aware Energy-Efficient Two-Hop Cooperative Routing Protocol for Underwater Acoustic Sensor Networks

This paper sought to investigate the performance of multi-hop underwater acoustic sensor networks (UW-ASNs) when they deploy cooperative routing algorithms combining the cooperative communication and routing methods. Taking into account energy efficiency, the studied schemes are discriminated by different policies of selecting next hop nodes as well as relay nodes of one-hop cooperative communications such that the transmission energy of routing paths is minimized. In order to take full advantage of broadcast nature in wireless communication, we propose to use a node exploited as a joint relay for two-hop cooperative communication. In addition, the unreliable communication of acoustic channels is addressed by the incorporated channel-aware mechanism which updates the links by exploiting packet receptions. On the bases of communication, two cooperative routing protocols are developed. The simulation results show that the network employing the proposed schemes achieves improved performance in terms of energy efficiency, throughput, and end-to-end delay as compared to the related works.

Spectrum-aware outage minimizing cooperative routing in cognitive radio sensor networks

This paper investigates the optimal path selection problem for end-to-end (e2e) outage probability minimization in clustered cognitive radio sensor networks. In order to improve outage performance of the optimal path, under a high node density regime, we consider feasibility of virtual multiple-input single-output (v-MISO) links in addition to conventional single-input single-output (SISO) links in the path. Since sensor nodes in such networks are allowed to access the spectrum of the primary network only in an opportunistic manner, the path selection problem is studied under the constraints of probabilistic interference to PU receivers and only single use of any PU channel along the path. The above problem is formulated as a joint hop-constrained routing, spectrum assignment and transmit power control problem. A convex optimization framework is used to find a closed form expression for the optimal transmit power of each transmitting node along the optimal route. Extension of the analytical result facilitates design of a novel routing algorithm, called spectrum aware-minimum outage intelligent cooperative routing (SA-MOICR) algorithm, which not only selects the minimum outage path for a given routing session, but also determines the number of nodes and the unique PU channel to be used for transmission in each hop along the path. Simulation results are found to corroborate our analytical results and quantify the significant improvement of the SA-MOICR scheme over only SISO or only v-MISO based routing solutions in terms of the achievable e2e outage probability.

Packet Forwarding in Common Sink Multi-Domain Wireless Sensor Networks Using Non-Cooperative Game

Multi-domain wireless sensor networks (WSNs) are sensor networks belonging to different network authorities coexisting in the same area. As such networks may be deployed in hostile environments, resource sharing between different sensor networks may necessary to prolong the network lifetime. However, with their limited power supply, sensor nodes may act selfishly by declining to cooperate to conserve their own energy. This paper is focused on how to determine packet forwarding strategies decisions which are beneficial to all networks under constrained resources in multi-domain WSNs. This paper proposes a non-cooperative game algorithm in a packet forwarding game in non-cooperative multi-domain WSNs. The objective is to achieve the best mutual strategy between two multi-domain WSNs. Our results show that the proposed method outperforms the non-game theoretic approach which uses pure cooperative and non-cooperative AODV routing algorithms, in terms of successful packet delivery ratio, network lifetime, and fairness in terms of difference in energy consumption in each domain.

Opportunistic Energy Cooperation Mechanism for Large Internet of Things

The limited capacity of battery power becomes one of the major constraints in the applications of Internet of things (IoT). Ambient energy harvesting technologies and wireless energy transfer technologies have appeared to resolve the energy supply problem, making it possible for the sensor nodes to operate perpetually. In this paper, we focus on energy efficiency maximization and network throughput optimization problems for energy cooperation in Energy Harvesting Cooperative Wireless Sensor Networks (EHC-WSNs). In order to maximize the efficiency of energy charging phase, a Region-based Proactive Energy Cooperation (RPEC) charging strategy is developed, which is used to charge the life-critical cooperators or receivers in time. By introducing a novel metric that converts optimal forwarder selection from the multi-dimensional problem to one-dimensional problem, an Energy-Neutral-based Opportunistic Cooperative Routing (ENOCR) algorithm is proposed to optimize the relay nodes selection and improve the network throughput. Extensive simulations show that the proposed Opportunistic Energy Cooperation Mechanism (OECM) can significantly improve energy efficiency and network lifetime.

A VMIMO-based cooperative routing algorithm for maximizing network lifetime

Energy efficiency is an important criterion for routing algorithms in the wireless sensor network. Cooperative routing can reduce energy consumption effectively stemming from its diversity gain advantage. To solve the energy consumption problem and maximize the network lifetime, this paper proposes a Virtual Multiple Input Multiple Output based Cooperative Routing algorithm (VMIMOCR). VMIMOCR chooses cooperative relay nodes based on Virtual Multiple Input Multiple Output Model, and balances energy consumption by reasonable power allocation among transmitters, and decides the forwarding path finally. The experimental results show that VMIMOCR can improve network lifetime from 37% to 348% in the medium node density, compared with existing routing algorithms.

Optimal and Near-Optimal Cooperative Routing and Power Allocation for Collision Minimization in Wireless Sensor Networks

Cooperative communication has gained much interest due to its ability to exploit the broadcast nature of the wireless medium to mitigate multipath fading. There has been considerable research on how cooperative transmission can improve the performance of the physical layer. Recently, researchers have started to consider cooperative transmission in routing, and there has been a growing interest in developing cooperative routing protocols. Most of the existing cooperative routing algorithms are designed to reduce the energy consumption; however, packet collision minimization using cooperative routing has not yet been addressed. This paper presents an optimization framework to minimize collision probability using cooperative routing in wireless sensor networks. We develop a mathematical model and formulate the problem as a large-scale mixed integer non-linear programming problem. We also propose a solution based on the branch-and-bound algorithm augmented with reducing the search space. The proposed strategy builds up the optimal routes from each source to the sink node by providing the best set of hops in each route, the best set of relays, and the optimal power allocation for the cooperative transmission links. To reduce the computational complexity, we propose a near-optimal cooperative routing algorithm, in which we solve the problem by decoupling the power allocation problem and the route selection problem. Therefore, the problem is formulated by an integer non-linear programming, which is solved using the branch-and-bound space reduced method. The simulation results reveal that the presented algorithms can significantly reduce the collision probability compared with the existing schemes.

Cooperative ARQ-Based Energy-Efficient Routing in Multihop Wireless Networks

In this paper, we design an integrated protocol that jointly optimizes the performance of the physical, medium access control (MAC), and network layers. Our goal is to minimize total network energy consumption while delivering a minimum required signal-to-noise ratio (SNR) at each intended receiver within the network. At the MAC layer, we develop a cooperative automatic repeat request (ARQ) system, in which the relay nodes assist the source with its retransmission attempts. A complete analytic framework for the cooperative system is developed. Using this framework, we find the optimum transmission energy at the physical layer. To demonstrate the effectiveness of the proposed scheme in minimizing energy consumption, we propose two cooperative routing algorithms at the network layer. The proposed algorithms utilize the derived cooperative link cost as a basic building block. Through analysis and simulations, it is shown that over a single hop, cooperative transmission can achieve energy savings of up to 73%, as compared with noncooperative transmission. The simulation results also demonstrate that the proposed routing algorithms can achieve significant energy savings while using fewer hops, as compared with the baseline cooperative and noncooperative routing algorithms.

Joint Cooperative Routing and Power Allocation for Collision Minimization in Wireless Sensor Networks With Multiple Flows

In this letter, a cross-layer cooperative routing algorithm is proposed for minimizing the collision probability subject to an end-to-end outage probability constraint. We develop a collision minimization algorithm by combining cooperative transmission, optimal power allocation, and route selection. The proposed cooperative routing algorithm, called minimum collision cooperative routing (MCCR), selects the route that causes minimum collision probability to other nodes in the network. Results show that MCCR can significantly reduce the collision probability compared with existing cooperative routing schemes.

Energy-aware virtual multi-input-multi-output-based routing for wireless ad hoc networks

Virtual multi-input-multi-output vMIMO technology is becoming a promising way to improve the energy efficiency of wireless networks. Previous research always builds up the vMIMO-based routing on the fixed structure such as clusters, and the MIMO mode is omitted in most cases. So, they cannot fully explore the advantage of vMIMO in routing. In this paper, we study a general routing scheme in which no fixed structure is required, and any communication mode of vMIMO is allowed for sake of the energy efficiency. We define two vMIMO-based routing problems aiming to energy-minimization and lifetime-optimization. The first problem can be solved by our distributed energy-minimum vMIMO-based algorithm. The algorithm constructs the virtual cooperative graph, and applies the shortest path method on the virtual cooperative graph to solve this problem. The second problem is non-deterministic polynomial-time hard, and we design the distributed lifetime-oriented vMIMO-based algorithm, which is based on the modified Bellman-Ford method. It can reach approximation ratio of four. The simulations show that our algorithms can work well in many situations. For example, distributed lifetime-oriented vMIMO-based algorithm can prolong the lifetime about 20.2% in dense topologies compared with the cooperative routing algorithm on average. Copyright © 2015 John Wiley & Sons, Ltd.