无线传感器网络路由中的能量预测及算法实现

基于无线传感器网络中路由协议高效合理利用能量的要求,提出一种基于剩余能量预测的地理位置路由(EPGR,energy prediction and geographical routing)算法。算法通过建立传感器网络节点运作模型,及相邻节点剩余能量预测机制,优化路由选择。仿真和分析表明,EPGR算法能够有效地优化数据传输路径,均衡传感器网络节点的能量消耗,延长网络寿命。     

基于休眠和扇区的传感器网络拓扑控制算法

拓扑控制算法对节省无线传感器网络节点能量、延长网络寿命具有重要意义。无线传感器网络节省节点能量有两种方法：层次型拓扑结构控制和功率控制；但目前还没有算法将以上两种方法相结合。丈中是结合周期性休眠和拓扑控制的一种新型拓扑控制策略：基于休眠和扇区的无线传感器网络拓扑控制算法，将拓扑控制算法和节点的休眠结合起来。仿真结果表明：算法在不降低网络吞吐量条件下节省了网络能量消耗，有效延长网络寿命。     

一种主动均衡节点能耗的无线传感器网络拓扑控制算法

无线传感器网络中网络拓扑的动态调整对于提高路由协议和MAC协议的效率,延长网络的生存期,提高网络通信效率等方面具有重要的作用.本文在分析了一些拓扑控制算法的基础上,提出了一种新的层次型拓扑生成算法,该算法引入了时间门限值和节点剩余能量两个参数,在解决能耗不均衡问题上采取相对主动的方法.能够有效地均衡网络节点的能耗并延长网络的生存周期.     

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

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

具有能量和位置意识基于ACO的WSN路由算法

通过融合传感器节点的剩余能量和地理位置信息,设计一种具有传感器节点能量和地理位置意识的基于蚁群优化方法的无线传感器网络路由算法(ELACO);针对路由空洞现象,提出一种路由回退机制,提高了路由搜索成功率.仿真结果表明,ELACO算法具有很高的路由查寻成功率,能够更好地均衡传感器节点能量消耗,从而延长网络使用寿命.     

无线传感器网络LEACH协议的改进与仿真

LEACH路由协议是无线传感器网络中经典的层次型拓扑组织算法。对LEACH协议进行研究和分析,指出LEACH协议在簇的区域分布和簇头负载不均衡等方面问题。文章通过节点剩余能量和与基站的距离对簇头选择、构造分簇以及非簇节点选择簇头进行改进。并利用MATLAB对改进后的算法进行仿真,表明改进后的算法有效地均衡节点能量消耗,并延长网络生存时间。     

无线传感器网络LEACH协议的改进与仿真

LEACH路由协议是无线传感器网络中经典的层次型拓扑组织算法。对LEACH协议进行研究和分析,指出LEACH协议在簇的区域分布和簇头负载不均衡等方面问题。文章通过节点剩余能量和与基站的距离对簇头选择、构造分簇以及非簇节点选择簇头进行改进。并利用MATLAB对改进后的算法进行仿真,表明改进后的算法有效地均衡节点能量消耗,并延长网络生存时间。     

WSNs中基于能量代价的最小权和支配集拓扑控制算法

该文针对无线传感器网络中最小连通支配集拓扑并非网络耗能最小拓扑的问题,定义由节点剩余能量,邻居个数和通信代价构建的能量代价函数综合反映支配节点的能量效率以及对降低网络整体能耗的贡献,进而以其作为拓扑权值,提出一种基于能量代价的最小权和连通支配集拓扑控制算法。算法选取局部最小权值节点担负支配任务,搭建整体权和最小的支配集,最小化网络整体能耗。实验结果表明,算法不仅具有节能的特点,还确保了通信链路的可靠性,有效延长了网络生命周期。     

一种无线传感器网络分簇路由算法研究

在分析LEACH协议的基础上提出一种基于能量和距离的多跳路由算法（CAED）。由基站依据节点剩余能量和簇头与基站的距离分别选出二层簇头,簇内节点利用单跳和多跳模式与簇头进行通信。仿真实验表明,新算法有效地平衡了节点的能量消耗,并显著地延长了网络的生命周期。     

基于AODV的能量有效路由协议

通过对AODV路由协议进行改进，提出了基于AODV的能量有效的路由协议（EE—AODV）。新协议考虑了节点的剩余能量，根据节点的剩余能量调节RREQ延迟来平衡节点的能量消耗，利用节点最近一次传递过数据分组的时间作为约束条件来优化RREQ的洪泛广播，降低网络的能量消耗。仿真结果表明．和AODV路由协议相比，新协议降低了网络的能量消耗并减少了耗尽能量的节点数，延长了网络的生存时间。     

Virtual Game-Based Energy Balanced Topology Control Algorithm for Wireless Sensor Networks

In topology control (TC), game theory is an efficient approach to analyze the conflicting objectives of nodes to enable the topology with certain global properties in the presence of selfish nodes. But in many existing game-based TC algorithms, every node has to make others aware of its changes by transmitting the control information repeatedly, which results in much unnecessary energy waste and network lifetime reduction. To solve the problem, the concept of virtual game is introduced, which virtualizes the game process to avoid the repeated information exchange in the game process. In addition, considering that unbalanced distribution of energy consumption also restricts the network lifetime, a distributed Virtual Game-based Energy Balanced TC algorithm (VGEB) with incomplete information is proposed, which is mathematically analyzed. The analysis results show that the TC virtual game is a potential game and the virtual game algorithm can converge to the state of Nash Equilibrium, which is Pareto Optimal. Moreover, VGEB can easily construct the topology with a low information complexity of O(n) and the induced topology can maintain the network connectivity, where n is the number of nodes in network. Simulation results demonstrate that VGEB can effectively balance the nodes’ energy consumption, greatly reduce the energy waste in the game process and has many other attractive topological features.     

A Game Theoretical Approach for Topology Control in Wireless Ad Hoc Networks with Selfish Nodes

In ad hoc networks, a significant amount of energy available to devices is utilized in network management operations. Since devices have limited energy resources, therefore, they drop data packets of other nodes to reduce their energy consumption. This selfish behaviour increases number of retransmissions over the link which increases energy consumption of the source node, introduces time delays, and degrades throughput of the network. Although conventional distributed topology control solutions minimize energy utilization of the nodes by adjustment of transmission power, however, selfish behaviour by devices introduce additional complexity in design which make topology control a challenging task. In this paper, we proposed Energy Efficient Topology Control Algorithm (EETCA) using game theoretical approach, in which, utility of the node depends on selfishness of the neighbors, link traffic rate, and link length. In decision-making step, nodes remove the links with other nodes that have high drop rate under the condition that network remains connected. We show that Nash Equilibrium point of the proposed game results in Pareto optimal network topology. We compare results of EETCA with Optimum (OPT) and Minimum Least Power Path Tree (MLPT) algorithms presented in literature. We carried our simulations under multiple sources scenario which show that EETCA outperforms previous approaches when number of nodes in the network increases. Furthermore, we simulate the performance of Ad-hoc On-demand Distance Vector (AODV) routing protocol under EETCA topology and compare it with MLPT and OPT topologies. The results show that the ad hoc network constructed using proposed solution substantially improves throughput of AODV routing protocol as compared to MLPT and OPT topology control algorithms.     

Routing protocol over lossy links for ISA100.11a industrial wireless networks

This paper proposes novel routing and topology control algorithms for industrial wireless sensor networks (IWSNs) based on the ISA100.11a standard. The proposed algorithms not only reduces energy consumption at the node level but also reduces packet latency at the network level. Using the residual energy and packet reception rate of neighbor nodes, the source node can estimate the highest election weight. Hence, packets are conveyed by a multi-hop forwarding scheme from source nodes to the sink by the optimal path. Furthermore, energy consumption and network latency are minimized using integer linear programming. Simulation results show that the proposed algorithms are fully effective in terms of energy conservation and network latency for IWSNs.     

Joint scheduling and routing with power control for centralized wireless sensor networks

We consider a TDMA-based multi-hop wireless sensor network, where nodes send data to a sink, which is aware of received powers at all receivers; the sink is responsible for creating the network topology and assigning time slots to links. Under this centralized approach, we propose two algorithms that jointly define the tree topology connecting nodes to the sink, and assign time slots, avoiding any packet loss. In contrast with previous works, the proposed algorithms accurately account for interference effects; when evaluating the signal-to-interference ratio to establish the tree and schedule transmissions, we consider the sum of all actual interfering signals, a fact of relevance for networks with increasing number of nodes. Optimal selection of transmit powers, minimizing energy consumption, is also applied. Our algorithms are compared to a benchmark solution and other proposals from the literature; it is shown that they bring to better radio resource utilization, higher throughput and lower energy consumption, while keeping the average delay limited.

     

一种基于K-means的WSN移动汇聚路由算法

无线传感网络(Wireless Sensor Network,WSN)作为一种资源受限的网络,网络中节点的能耗直接影响了网络的性能。因此,均衡网络中的能耗,延长网络的生命周期,成为设计WSN路由算法的重要目标。于是,在LEACH-C协议的基础上提出了一种移动汇聚路由算法。分簇阶段由Sink节点计算最优簇首个数,通过K-means聚类将网络中的节点划分至不同的集群,选择通信成本最低的节点作为各集群的簇首。稳定传输阶段通过移动Sink进行数据采集,针对不同的延迟分别规划Sink节点的移动轨迹。MATLAB仿真结果表明,与LEACH和LEAHC-C算法相比簇首的分布更合理,结合Sink节点的移动策略能有效均衡网络能耗,延长网络的寿命。     

基于拓扑划分的片上网络快速映射算法

该文针对片上网络建立了以能耗和流量均衡为优化目标的映射模型,提出一种基于拓扑划分的快速映射算法(TPBMAP)。该算法不仅考虑芯片的布局特性从而产生规整的拓扑,还采用虚拟IP核技术修正通信核图以完成IP核和网络节点数不等的映射;通过引入以流量均衡为目标的优化模型同时将通信量大的IP核映射到拓扑边缘区域,有效地降低了网络中心的流量;采用迭代的拓扑划分方法以及将通信量大的IP核映射到网络相邻位置,可快速完成低能耗映射。仿真结果表明,相比现有算法,该文提出的算法在映射速度、全网能耗以及网络中心流量等方面有较大优势。     

Transmit Power Distribution of Wireless Ad-hoc Networks with Topology Control

Topology control and routing protocols are used by designers of wireless packet data networks to lower the node degree, simplify routing and lower the nodes' energy consumption, while preserving strong connectivity. We assume a popular fading channel model and study the impact of several topology control schemes on the transmit power of nodes randomly distributed over a large area according to a Poisson point process, where each node controls the pattern of its one-hop neighbors by independently adjusting its transmit power. We provide the distribution of the transmit power of individual nodes under several different topology control algorithms, allowing designers to estimate the life time of battery energized devices, and the implications of choosing the nodes' peak transmit power. We also allow easy comparisons between several different topology control algorithms with respect to the nodes' power consumption.     

Topology control in ad hoc wireless networks using cooperative communication

In this paper, we address the Topology control with Cooperative Communication (TCC) problem in ad hoc wireless networks. Cooperative communication is a novel model introduced recently that allows combining partial messages to decode a complete message. The objective of the TCC problem is to obtain a strongly-connected topology with minimum total energy consumption. We show that the TCC problem is NIP-complete and design two distributed and localized algorithms to be used by the nodes to set up their communication ranges. Both algorithms can be applied on top of any symmetric, strongly-connected topology to reduce total power consumption. The first algorithm uses a distributed decision process at each node that makes use of only 2-hop neighborhood information. The second algorithm sets up the transmission ranges of nodes iteratively, over a maximum of six steps, using only 1-hop neighborhood information. We analyze the performance of our approaches through extensive simulation.     

无线传感器网络中基于概率的能量平衡算法

各传感器节点的能耗不平衡严重地影响了无线传感器网络的生命周期。该文提出了基于传输概率的能量平衡算法。首先把圆形区域网络模型划分成若干圆环,每一圆环中的传感器节点以混合传输的方式传输数据。其次,为使每个传感器节点能耗均衡,提出了一种混合传输概率求解算法,获得一组传输概率决定节点传输数据的方式,从而更好地平衡网络能耗。然后对圆环宽度进行了分析和优化。仿真结果证明这些算法可以有效地降低网络能耗,延长网络生命周期。     

基于能量均衡的无线传感器网络压缩感知算法

无线传感器网络在探测目标源时会碰到处理能力不足和能量缺乏的问题。为了克服这些问题,该文提出了基于能量均衡的自适应压缩感知算法。与传统自适应压缩感知算法不同,所提出的算法在选择观测向量时不仅考虑了重构性能,还考虑了节点的能量均衡,防止某些节点过快消耗能量而导致整体网络结构的破坏。同时为了适应不同应用场景的需求,将自适应压缩感知算法和能量均衡压缩感知算法相结合,通过门限值的选择达到灵活配置的目的。仿真实验的结果表明,该文所提出的算法能够有效延长网络生存时间,同时能够实现能耗和收敛性的兼顾。