Reduce Network Energy Consumption Research Articles

Design and Analysis of Virtual MIMO-Based Low-Power Control Algorithm for WSN

In order to fully reduce network energy consumption, an improved virtual MIMO technique applied to small and medium scale isomorphism WSN is proposed. The life of WSN is prolonged by combining the energy- efficient virtual MIMO communication technology with the method that cluster heads are selected randomly and cyclically and the network energy load is balanced. Influencing factors on the virtual MIMO WSN energy-saving performance are analyzed carefully in this study, including the network size, node density and path loss factor. And the longest life of the network is used as optimization objective, the ratio of cluster head (the ratio of the number of cluster head required and the total number of nodes) which is a key parameter of WSN are optimized by genetic algorithm. Simulation results show that compared with LEACH this novel algorithm is more efficient to save energy of consumption and prolong the living time of the whole network when the parameters of network structure are properly selected.

On the eNB-based energy-saving cooperation techniques for LTE access networks

Energy efficiency is one of the top priorities for future cellular networks, which could be accomplished by implementing cooperative mechanisms. In this paper, we propose three evolved node B eNB-centric energy-saving cooperation techniques for long-term evolution LTE systems. These techniques, named as intra-network, inter-network, and joint cooperation, involve traffic-aware intelligent cooperation among eNBs belonging to the same or different networks. Our proposed techniques dynamically reconfigure LTE access networks in real time utilizing less number of active eNBs and thus, achieve energy savings. In addition, these techniques are distributed and self-organizing in nature. Analytical models for evaluating switching dynamics of eNBs under these cooperation mechanisms are also formulated. We thoroughly investigate the proposed system under different numbers of cooperating networks, traffic scenarios, eNB power profiles, and their switching thresholds. Optimal energy savings while maintaining quality of service is also evaluated. Results indicate a significant reduction in network energy consumption. System performance in terms of network capacity utilization, switching statistics, additional transmit power, and eNB sleeping patterns is also investigated. Finally, a comprehensive comparison with other works is provided for further validation. Copyright © 2013 John Wiley & Sons, Ltd.

Power controlled routing in wireless ad hoc networks using cross layer approach

This paper presents a new power control routing which is applied to wireless ad hoc networks, because applying power control into routing protocols has become a hot research issue. This work not only reduces network energy consumption and also improve network throughput, Packet Delivery Ratio and other performance of ad hoc networks. We proposed an on-demand routing algorithm based on power control termed as Power Control Ad hoc On-Demand Distance Vector (PC-AODV). This algorithm builds different routing entries according to the node power levels on demand, and selects the minimum power level routing for data delivery. This PC-AODV uses different power control policies to transmit data packets, as well as control packets of network layer and MAC layer. Simulation results show that our algorithm not only reduce the average communication energy consumption, thus prolong the network life time, but also improve average end-to-end delay and packet delivery ratio.

A Game Theory-Based Obstacle Avoidance Routing Protocol for Wireless Sensor Networks

The obstacle avoidance problem in geographic forwarding is an important issue for location-based routing in wireless sensor networks. The presence of an obstacle leads to several geographic routing problems such as excessive energy consumption and data congestion. Obstacles are hard to avoid in realistic environments. To bypass obstacles, most routing protocols tend to forward packets along the obstacle boundaries. This leads to a situation where the nodes at the boundaries exhaust their energy rapidly and the obstacle area is diffused. In this paper, we introduce a novel routing algorithm to solve the obstacle problem in wireless sensor networks based on a game-theory model. Our algorithm forms a concave region that cannot forward packets to achieve the aim of improving the transmission success rate and decreasing packet transmission delays. We consider the residual energy, out-degree and forwarding angle to determine the forwarding probability and payoff function of forwarding candidates. This achieves the aim of load balance and reduces network energy consumption. Simulation results show that based on the average delivery delay, energy consumption and packet delivery ratio performances our protocol is superior to other traditional schemes.

Energy Efficient Coverage Conserving Protocol for Wireless Sensor Networks

PDF HTML阅读 XML下载 导出引用 引用提醒 高效节能的无线传感器网络覆盖保持协议 DOI: 作者: 作者单位: 作者简介: 通讯作者: 中图分类号: 基金项目: Supported by the Shaanxi Provincial Natural Science Foundation of China under Grant No.SJ08ZT15-4 (陕西省自然科学基金) Energy Efficient Coverage Conserving Protocol for Wireless Sensor Networks Author: Affiliation: Fund Project: 摘要 | 图/表 | 访问统计 | 参考文献 | 相似文献 | 引证文献 | 资源附件 | 文章评论 摘要:分析了实际环境中随机部署传感器网络的感知特性,给出了节点感知半径服从正态分布的无须地理位置信息的节点冗余度计算模型,以及保证网络覆盖质量所需要的最少工作节点数的计算模型.在此模型的基础上,提出了高效节能的无线传感器网络覆盖保持协议(energy efficient coverage conserving protocol,简称EECCP),实现了均衡节点能量消耗的分布式协作调度.该协议保留最少的工作节点以保证要求的覆盖质量,从而达到节约网络能量的目的.仿真实验结果表明,EECCP不仅能够保证要求的覆盖质量,而且能够减少网络能量消耗,有效地延长了网络的有效寿命. Abstract:In this paper, the sensing characteristics of randomly deployed sensor networks in the real environment are analyzed. The calculation model of the degree of redundancy of the sensors whose sensing ranges satisfy the normal distribution without location information is proposed, and the calculation model of the minimum number of working nodes, which can provide the desired quality of coverage (QoC), is also proposed. Based on the models, an Energy Efficient Coverage Conserving Protocol for Wireless Sensor Networks (EECCP) is presented, which enables the collaborative scheduling of distributed nodes and balances the energy consumption of each node. The purpose of energy conservation of the networks is achieved since the EECCP maintains the least number of nodes, as working nodes to provide the desired QoC. Simulation results show that the EECCP not only provides the desired QoC, but also reduces network energy consumption and prolongs network useful lifetime effectively. 参考文献 相似文献 引证文献

Link weight assignment and loop-free routing table update for link state routing protocols in energy-aware internet

In order to lessen the greenhouse effects and diminish environmental pollution, reducing energy usage is important in designing next generation networks. Shutting down the network devices that carry light load and redirecting their traffic flows to other routes is the most common way to reduce network energy consumption. Since traffic demands among node pairs vary in different time periods, an energy efficient network has to dynamically determine the optimal active links to adapt itself to network traffic changes. However, in current IP networks, shutting down and/or turning on links would trigger link state routing protocols to reconverge to a new topology. Since the convergence time would take tens of seconds, routing table inconsistencies among routers would result in network disconnection and even worse, generating traffic loops during the convergence interval. Removing routing images inconsistent among routers to prevent loops is a critical issue in energy efficient network and this issue is still not considered in the green network design yet. The contribution of the paper is presented in two parts. First, we propose a comprehensive approach to determine a network topology and a link metric for each time period. Traffic engineering is considered in our design such that flows going on the energy-aware network are within a predetermined percentage of the link capacity such that no congestion occurs in a statistical manner. Second, to avoid transient loops during time period changes, we propose a Distributed Loop-free Routing Update (DLRU) scheme to determine the correct sequence for updating the routing table. A scrupulous proof was also presented to ensure the loop-free property of the DLRU. In this paper, we formulate an integer linear programming to determine this multi-topology and link weight assignment problem. Due to its NP-hard property, we propose an efficient algorithm, termed Lagrangian Relaxation and Harmonic Series (LR&HS) heuristic. Numerical results demonstrate that the proposed LRHS approach outperforms the other approaches on several benchmark networks and random networks by providing up to 35%–50% additional energy saving in our experimental cases.

Green Optical Communications—Part II: Energy Limitations in Networks

This is Part II of a two-part paper that explores the fundamental limitations on energy consumption in optical communications. Part I covers energy consumption in optical transport. Part II explores the lower bound on energy consumption in optical switches and networks, analyzes the energy performance of a range of switching devices, and presents quantitative models of the lower bounds on energy consumption in these devices. These models are incorporated into a simple model of a global switched network and the lower bound on total network energy consumption is estimated. We compare the results of this bottom-up calculation of the lower bound on network energy with a previous top-down analysis of overall network energy consumption based on real-world data for state-of-the art equipment and “business-as-usual” forward projections. The present analysis confirms a previous finding in that in a global scale network, the energy consumption of the switching infrastructure is larger than the energy consumption of the transport infrastructure. We find that the theoretical lower bounds on transport energy identified in Part I and the switching energy in this paper are more than three orders of magnitude lower than predicted by a “business-as-usual” analysis. In this paper, we explore how the gap between the theoretical lower bounds on energy consumption and current trends in network energy efficiency can be closed. We argue that future research needs to focus on improving the energy efficiency of switching and on devising methods to reduce the quantity of switching infrastructure in the network. Further key strategies for reducing network energy consumption include developing of low-energy transport technologies, reducing the energy overheads associated with peripheral functions that are not central to the transport and switching of data, and reducing the energy consumption of the access network.

Evaluation of ONU power saving modes for gigabit-capable passive optical networks

Energy efficiency has become an increasingly important aspect of designing access networks, due to both increased concerns for global warming and increased network costs related to energy consumption. Comparing access, metro, and core, the access constitutes a substantial part of the per subscriber network energy consumption and is regarded as the bottleneck for increased network energy efficiency. One of the main opportunities for reducing network energy consumption lies in efficiency improvements of the customer premises equipment. Access networks in general are designed for low utilization while supporting high peak access rates. The combination of large contribution to overall network power consumption and low utilization implies large potential for CPE power saving modes where functionality is powered off during periods of idleness.

A Coverage-Preserving Density Control Algorithm for Directional Sensor Networks

In dense sensor networks, density control is a common way to prolong network's lifetime while providing sufficient sensing coverage. Most of the existing density control algorithms are based on isotropic sensing model. However, directional sensor networks, whose nodes meet directional sensing model, have great application chances. In this paper, we propose a Coverage-Preserving Density Control Algorithm (CPDCA) for directional sensor networks, which can effectively turn off redundant directional nodes to reduce network energy consumption and extend the network lifetime while maintaining a considerable ability of network coverage. Extensive simulations are conducted to verify the effectiveness of our solution, and we give detailed discussions on the effects of different system parameters.

Lightweight Deployment-Aware Scheduling for Wireless Sensor Networks

Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain long network lifetime as well as sufficient sensing areas. To achieve this goal, a broadly-used method is to turn off redundant sensors. In this paper, the problem of estimating redundant sensing areas among neighbouring wireless sensors is analysed. We present simple methods to estimate the degree of redundancy without the knowledge of location or directional information. We also provide tight upper and lower bounds on the probability of complete redundancy and on the average partial redundancy. With random sensor deployment, our analysis shows that partial redundancy is more realistic for real applications, as complete redundancy is expensive, requiring up to 11 neighbouring sensors to provide a 90 percent chance of complete redundancy. Based on the analysis, we propose a scalable Lightweight Deployment-Aware Scheduling (LDAS) algorithm, which turns off redundant sensors without using accurate location information. Simulation study demonstrates that the LDAS algorithm can reduce network energy consumption and provide desired QoS requirement effectively.

Low energy houses

SYNOPSIS Domestic buildings absorb about 1/4 to 1/3 of the UK's primary energy. New houses can be designed which use half, or even considerably less than half of the energy consumed by their contemporaries. Typical examples are the Danish Zero Energy House and the Saskatchewan House. Unfortunately the U.K. building industry and its clients generally ignore long-run costs, in favour of lower initial capital investment. Such a position favours insulation and passive solar techniques, as opposed to more complex methods, for reducing network energy consumption in buildings.