Energy-saving Routing Algorithm Research Articles

An Energy-Saving Routing Algorithm for Opportunistic Networks Based on Asynchronous Sleep Approach

The sparse and mobility of nodes in opportunistic networks will cause network topology often fracturing, resulting that a large number of isolated nodes appear in opportunistic networks. These isolated nodes will waste much energy at idle listening stage, so this paper proposes an Efficient Routing algorithm for opportunistic networks based on Asynchronous Sleep Approach-ERASA. ERASA achieves the goal of saving energy by making the isolated nodes enter the low power consumption dormancy state. Then they will be timely awaken when there are other nodes entering into their communication range. Compared with the classical Epidemic routing algorithm, the several aspects performance of ERASA algorithm are improved such as network lifetime.

An Energy Saving Routing Algorithm Based on Dijkstra in Wireless Sensor Networks

This paper presents an Energy Saving-oriented Routing Algorithm Based on Dijkstra (ESRAD) in Wireless Sensor Networks (WSN). The ESRAD is designed to be economic to energy consumption in information transmission between any of two sensor nodes in a WSN. By modeling energy consumption of nodes in a WSN as evaluation index of hop count judgment in least-hop routing algorithm, this study first presents an improved Energy Saving-oriented Least-hop Routing Algorithm (ESLHA) to search the shortest path of energy consumption with least nodes between origin node and object node. Then, in the light that the ESLHA does not take the energy consumption in transmission process into account, the ESRAD models the evaluation index of energy consumption at each node, which is the weight of each edge in a WSN, by introducing energy consumption at both node and transmission process, and employs a Dijkstra-based routing algorithm to efficiently search the reliable shortest path with least energy consumption. The performance of the ESRAD is compared to those of the ESLHA and the Dijkstra for different WSNs. Extensive simulation tests on randomly simulated WSNs have demonstrated the potential of the proposed ESRAD for searching the shortest path with least energy consumption to transmit information between any of two nodes in WSNs.

Energy-saving Routing Algorithm Based on Cluster in WSN

This paper takes the improved threshold formula and cluster radios formulas to choose cluster-heads by considering energy-saving, based on typical clustering routing protocol and optimal cluster-head selection formula. In the forming stage of cluster, the proportionality principle is used to make the distribution of cluster even more reasonable and during the stable stage of cluster, the member nodes in cluster use TDMA to communicate with the cluster-head node, and cluster-head nodes communicate with base station BS via multi-hop interrupt communication manner. Then it proposed the realization of target tracking based on the energy- saving routing algorithm. Finally, it can be seen in the simulation results that on the behalf of the network lifetime and average energy consumption, energy-saving routing algorithm is more reasonable. DOI: http://dx.doi.org/10.11591/telkomnika.v11i2.2032

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.

A Low-Complexity Routing Algorithm with Power Control for Self-Organizing Short-Range Wireless Networks

Mobile computing has become very pervasive, where the number of electronic devices equipped with wireless capabilities has increased significantly in recent years. This poses serious demands on wireless, mobile and self-organizing networks. Despite the fact that devices are getting smaller and more powerful, advances in battery technology have not yet reached the stage where devices can autonomously operate for days. Therefore, devices for self-organizing networks will strongly rely on the efficient use of their batteries. We present a cluster-based low-complexity routing algorithm for self-organizing networks of mobile nodes. Our proposed algorithm, called Cluster-based Energy-saving Routing Algorithm (CERA), allows mobile nodes to autonomously create clusters to minimize the power consumption. CERA is implemented as two separate protocols: the intra-cluster data-dissemination protocol, and the inter-cluster routing protocol. We present an extensive analysis of the overall protocol architecture by varying the critical factors related to protocol behavior. As a result, the CERA implementation generally saves up to 25% of energy, while keeping the overhead, in terms of energy consumption, acceptably low.