A game theoretic approach to balancing energy consumption in heterogeneous wireless sensor networks

Energy balancing is an effective technique in enhancing the lifetime of a wireless sensor network (WSN). Specifically, balancing the energy consumption among sensors can prevent losing some critical sensors prematurely due to energy exhaustion so that the WSN's coverage can be maintained. However, the heterogeneous hostile operating conditions—different transmission distances, varying fading environments, and distinct residual energy levels—have made energy balancing a highly challenging task. A key issue in energy balancing is to maintain a certain level of energy fairness in the whole WSN. To achieve energy fairness, the transmission load should be allocated among sensors such that, regardless of a sensor's working conditions, no sensor node should be unfairly overburdened. In this paper, we model the transmission load assignment in WSN as a game. With our novel utility function that can capture realistic sensors’ behaviors, we have derived the Nash equilibrium (NE) of the energy balancing game. Most importantly, under the NE, while each sensor can maximize its own payoff, the global objective of energy balancing can also be achieved. Moreover, by incorporating a penalty mechanism, the delivery rate and delay constraints imposed by the WSN application can be satisfied. Through extensive simulations, our game theoretic approach is shown to be effective in that adequate energy balancing is achieved and, consequently, network lifetime is significantly enhanced. Copyright © 2012 John Wiley & Sons, Ltd.     

Increasing network lifetime by balancing node energy consumption in heterogeneous sensor networks

Sensor nodes are powered by battery and have severe energy constraints. The typical many‐to‐one traffic pattern causes uneven energy consumption among sensor nodes, that is, sensor nodes near the base station or a cluster head have much heavier traffic burden and run out of power much faster than other nodes. The uneven node energy dissipation dramatically reduces sensor network lifetime. In a previous work, we presented the chessboard clustering scheme to increase network lifetime by balancing node energy consumption. To achieve good performance and scalability, we propose to form a heterogeneous sensor network by deploying a few powerful high‐end sensors in addition to a large number of low‐end sensors. In this paper, we design an efficient routing protocol based on the chessboard clustering scheme, and we compute the minimum node density for satisfying a given lifetime constraint. Simulation experiments show that the chessboard clustering‐based routing protocol balances node energy consumption very well and dramatically increases network lifetime, and it performs much better than two other clustering‐based schemes. Copyright © 2006 John Wiley & Sons, Ltd.     

无线传感器网络能量均衡分簇路由协议

针对LEACH协议存在的3大问题:簇头选举时未考虑节点剩余能量、频繁成簇造成了大量额外能耗以及欠缺对簇间能耗均衡的考虑,提出了能量有效分簇路由协议(LEACH-improved).该协议中,首轮成簇后网络中簇的分布和数量将保持不变,以后每轮各簇的簇头由上一轮簇头结合节点的能量水平来指定,借鉴泛洪算法的思想,在簇间建立多...     

具有路径能耗优化特性的WSN无标度容错拓扑控制算法

针对数据传输型的大规模无线传感网络中路径能量损耗问题,建立在多跳模式下的网络路径能耗优化模型,得出可以使网络通信能耗最小的节点度取值规律。依据节点度的最优取值,通过控制网络平均节点度的适应度模型来构建网络拓扑,提出一种具有路径能耗优化特性的无标度容错拓扑控制算法EETA(energy efficiency topology algorithm)。动态性能分析表明,由该算法生成的网络拓扑,其节点的度分布服从幂律,具有无标度拓扑的强容错能力。仿真实验结果显示,该算法同时也降低了网络路径能量消耗,具有路径节能性。     

一种基于链路质量的自维护拓扑控制博弈算法

针对无线传感器网络拓扑性能优化单一的问题,本文首先定义了表征双向通信质量的指标.其后将链路质量,节点干扰,剩余能量均衡性等参数融入收益函数,设计了一种基于链路质量的自维护拓扑控制博弈算法SMGLQ.理论证明该算法能保证各节点收敛到帕累托最优.仿真实验表明它能为网络选择通信质量较好的链路,并降低能耗.     

Joint optimization of energy allocation and routing problems in wireless sensor networks

Energy allocation problems and routing problems are both important research issues in the wireless sensor network (WSN) field. The former usually aims at considering how to allocate a certain number of sensor devices in a sensing region to form a WSN so that the objective function value (e.g., the network connectivity or the network lifetime) of the constructed network is optimized. For the message routing problem in WSNs, researchers tend to consider how to find an energy conservable message transmission routing scheme for notifying the supervisor of the WSN when an event occurs. Till now, many solutions have been proposed for the above two categories of optimization problems. However, unifying the above two network optimization problems to maximize the network lifetime, to the best of our knowledge, still lacks related research. This paper considers a joint optimization problem for energy allocation and energy‐aware routing called the joint optimization of energy allocation and routing problem (JOEARP) for a hierarchical cluster‐based WSN. We propose an exact algorithm to provide the optimum solution for the JOEARP. The simulation results show that this solution performed better in prolonging the network lifetime of a WSN in a real situation, compared to other compositions of conventional energy allocation schemes with some known routing algorithms. Copyright © 2009 John Wiley & Sons, Ltd.     

一种能耗均衡的无线传感器网络路由算法

为了延长采用电池供电的无线传感器网络的生命周期,提出了一种综合考虑单个节点能耗和节点传输信息至汇集节点所需总能耗的路由算法.该算法首先根据网络中节点到汇集节点从小到大的距离顺序选择待规划节点,然后计算各对应候选节点的评价参数,该参数由单节点能耗和节点传输信息至汇集节点所需总能耗加权得到,最后选择评价参数最小的候选节点作为待规划节点的中继节点.仿真结果表明,该算法的生命周期明显长于LEACH(Low Energy Adaptive Clustering Hier-archy)算法.     

An optimized forwarding protocol for lifetime extension of wireless sensor networks

Optimized routing (from source to sink) in wireless sensor networks (WSN) constitutes one of the key design issues in prolonging the lifetime of battery‐limited sensor nodes. In this paper, we explore this optimization problem by considering different cost functions such as distance, remaining battery power, and link usage in selecting the next hop node among multiple candidates. Optimized selection is carried out through fuzzy inference system (FIS). Two differing algorithms are presented, namely optimized forwarding by fuzzy inference systems (OFFIS), and two‐layer OFFIS (2L‐OFFIS), that have been developed for flat and hierarchical networks, respectively. The proposed algorithms are compared with popular routing protocols that are considered as the closest counterparts such as minimum transmit energy (MTE) and low energy adaptive clustering hierarchy (LEACH). Simulation results demonstrate the superiority of the proposed algorithms in extending the WSN lifetime. Copyright © 2008 John Wiley & Sons, Ltd.     

一种基于博弈论的无线传感器网络拓扑控制算法

无线传感器网络对节能有着很高的要求,拓扑控制能够优化网络拓扑,提高无线信道的空间复用率,是提高无线传感器网络能量效率的有效方法.文中提出了-种基于博弈论的无线传感器网络拓扑控制算法,设计了-个与节点度和发射功率有关的收益函数,使拓扑控制博弈存在纳什均衡,网络总收益函数最大,网络的能量效率最高.     

Relocation routing for energy balancing in mobile sensor networks

Wireless sensor networks (WSNs) have been widely investigated in the past decades because of its applicability in various extreme environments. As sensors use battery, most works on WSNs focus on energy efficiency issues (e.g., local energy balancing problems) in statically deployed WSNs. Few works have paid attention to the global energy balancing problem for the scenario that mobile sensor nodes can move freely. In this paper, we propose a new routing protocol called global energy balancing routing protocol (GEBRP) based on an active network framework and node relocation in mobile sensor networks. This protocol achieves global energy efficiency by repairing coverage holes and replacing invalid nodes dynamically. Simulation and experiment results demonstrate that the proposed GEBRP achieves superior performance over the existing scheme. In addition, we analyze the delay performance of GEBRP and study how the delay performance is affected by various system parameters.Copyright © 2013 John Wiley & Sons, Ltd.     

能量采集型无线传感器网络的高能效路由算法

在能量采集型无线传感器网络中,虽然有能量吸收,但是因能量依然非常珍贵,如何优化路由协议,提高能量利用率,延长网络寿命仍然是值得研究的问题.为求解高能效的路由,提出了一种采用遗传算法的高能效路由算法,建立考虑节点的吸收能量、剩余能量、消耗能量和浪费能量的适应函数,用遗传算法寻找全局最优路径.将该适应函数与3种其他适应函数作对比,其他3种适应函数分别为只考虑路径能耗最小的适应函数,考虑路径能耗与路径上节点的吸收能量、剩余能量的适应函数以及考虑路径能耗与网络中所有节点的浪费能量的适应函数.采用遗传算法解出4种路由,通过仿真分析可知,所提出的路由算法能量利用效率最高.     

无线传感器网络能量高效混合MAC算法

针对无线传感器网络MAC协议中存在的能耗问题,提出了能量高效的无线传感器网络混合MAC(EEH-MAC)算法,采用基于TDMA机制的时槽系数动态调整簇内节点的时槽大小来降低数据的传输时延;同时,对部分不需要数据传输的节点不分配时槽来减少能耗;按簇内节点剩余能量系数形成时槽分配顺序来减少状态转换的能耗;在簇头之间采用CSMA/CA机制的随机分配策略进行通信.仿真结果表明,EEH-MAC协议能有效减少能耗并延长网络生命周期.     

NHRPA: a novel hierarchical routing protocol algorithm for wireless sensor networks

Considering severe resources constraints and security threat hierarchical routing protocol algorithm. The proposed routing of wireless sensor networks （WSN）, the article proposed a novel protocol algorithm can adopt suitable routing technology for the nodes according to the distance of nodes to the base station, density of nodes distribution, and residual energy of nodes. Comparing the proposed routing protocol algorithm with simple direction diffusion routing technology, cluster-based routing mechanisms, and simple hierarchical routing protocol algorithm through comprehensive analysis and simulation in terms of the energy usage, packet latency, and security in the presence of node protocol algorithm is more efficient for wireless sensor networks. compromise attacks, the results show that the proposed routing     

Non-interference topology scheme in wireless sensor networks

A novel topology scheme, cell with multiple mobile sinks method (CMMSM), is proposed in this article for the collection of information and for the environment monitoring in wireless sensor networks. The system consists of many static sensors, scattered in a large scale sensing field and multiple mobile sinks, cruising among the clusters. Conservation of energy and simplification of protocol are important design considerations in this scheme. The noninterference topology scheme largely simplifies the full-distributed communication protocol with the ability of collision avoidance and random routing. The total number of cluster heads in such a topology was analyzed, and then an approximate evaluation of the total energy consumption in one round was carried out. Simulation results show that CMMSM can save considerable energy and obtain higher throughput than low-energy adaptive clustering hierarchy (LEACH) and geographical adaptive fidelity (GAF).     

Energy-balance node-selection algorithm for heterogeneous wireless sensor networks

To solve the problem of unbalanced loads and the short network lifetime of heterogeneous wireless sensor networks, this paper proposes a node-selection algorithm based on energy balance and dynamic adjustment. The spacing and energy of the nodes are calculated according to the proximity to the network nodes and the characteristics of the link structure. The direction factor and the energy-adjustment factor are introduced to optimize the node-selection probability in order to realize the dynamic selection of network nodes. On this basis, the target path is selected by the relevance of the nodes, and nodes with insufficient energy values are excluded in real time by the establishment of the node-selection mechanism, which guarantees the normal operation of the network and a balanced energy consumption. Simulation results show that this algorithm can effectively extend the network lifetime, and it has better stability, higher accuracy, and an enhanced data-receiving rate in sufficient time.     

IRS: application reconfiguration scheme for wireless sensor networks

Application reconfiguration is essential to achieving flexibility and adaptability of wireless sensor networks (WSNs) used in environment monitoring. In this paper, we present an integrated reconfiguration scheme (IRS) for implementing environment adaptive application reconfiguration (EAAR) in WSNs. In our scheme, application reconfiguration is implemented with the push‐based paradigm for densely distributed nodes and the cluster‐based hybrid reconfiguration (CHR) paradigm for sparsely distributed nodes. We demonstrate the energy‐efficiency and scalability of our scheme by analyzing the energy consumption based on a randomly deployed sensor network. Moreover, we derive the density threshold of reconfiguration nodes (RNs) for determining if the nodes are densely or sparsely distributed, and choose the mode of operation for IRS. We use extensive simulation experiments to demonstrate the effectiveness of our scheme. Copyright © 2009 John Wiley & Sons, Ltd.     

异构传感器网络中基于闲时能量开销优化的密度控制算法研究

基于闲时能量开销优化目标提出了一种适用于异构传感器网络的密度控制算法(DCA),DCA能寻找到一个闲时能量开销近似最小化的连通覆盖集合,该集合最终映射为活跃节点集合.理论分析和实验数据表明,DCA所生成的拓扑能有效降低网络闲时能量开销,延长了网络的生命剧期.     

无线传感器网络中Robust Position定位算法的改进

首先深入分析了两种典型的分布式的节点定位算法，并从定位精度及能量消耗两个方面给出了定量分析结果。在此基础上提出了改进的定位算法，BB_RP算法。通过仿真试验，在定位精度和能量消耗两个方面与原有算法进行定量的分析比较。结果表明，BB_RP算法虽然在定位精度略低于原有的算法，但是在能量消耗和覆盖速度两个指标上有了较大的提高，使得无线传感器网络的生命周期延长。     

分簇无线传感器网络中的频谱感知方案

无线传感器网络中的节点众多,节点之间仅依靠频谱资源管理机制分配的频段进行数据传输会造成频谱资源紧张。针对这一问题,将认知无线电技术引入分簇的无线传感器网络,并且考虑分簇无线传感器网络节点的能量受限问题提出了一种节能的频谱感知方案。此方案首先让簇内的节点采取双门限能量检测的协作频谱感知方法,在满足目标检测概率和虚警概率的条件下,确定进行频谱感知的最少节点数,降低系统能耗。其次,通过选择合适的簇内节点进行频谱感知,使簇内节点的能耗均衡,簇的生命周期得到延长。     

Transmission power adjustment of wireless sensor networks using fuzzy control algorithm

Energy constraint is the most conspicuous characteristic in wireless sensor networks (WSN). Node deployment, dynamic topology control, and data transmission in WSN all consume a large amount of energy. Therefore, proper adjustment of transmission power (TP) contributes much energy saving. In this paper, a new TP adjustment method based on Fuzzy Control Theory, called FCTP, is proposed for the dynamic topology control. The simulation results show that this method is more robust to tolerate accidental interfere, more rapidly convergent, and more energy efficient than other TP adjustment approaches, which lead to longer network lifetime. Copyright © 2008 John Wiley & Sons, Ltd.