基于拓扑控制的无线传感器网络节点负载均衡策略

无线传感器网络已成为当今的一个研究热点,由于无线传感器网络是一个能量受限网络,需要采取措施延长网络的正常使用寿命,负载均衡策略正是延长网络生命期的重要手段.本文介绍无线传感器网络中的节点负载问题,提出了一种基于拓扑控制的无线传感器网络节点负载均衡策略,有助于延长无线传感器网络的使用寿命.     

仿血管路径的无线传感器网络故障容错路由算法

为提高无线传感器网络故障容错性和传输稳定性,实现网络负载均衡,提出了一种仿血管路径的无线传感器网络故障容错路由算法.研究了人体血管路径特性及属性关联,对网络节点分区域等级标定并以不同概率值进行静态分簇,运用改进的蚁群算法BWAS(最优最差蚂蚁系统)生成节点路径,以路径信息素值作为传输路径的选择概率建立仿血管拓扑结构路由...     

基于仿人体血管路径WSN故障容错路由算法研究

为提高无线传感器网络(WSN)故障容错性和传输稳定性,实现网络负载均衡,提出了一种仿人体血管路径的WSN故障容错路由算法.通过研究人体血管路径特性,将其引入到WSN故障容错路由设计中,在对网络节点分区域进行等级标定的基础上实行能耗均衡的静态分簇;运用改进的蚁群算法生成节点路径并计算各路径信息素值,以确定传输路径选择概率并建立仿血管拓扑结构路由.理论与仿真结果表明,此算法具有良好的性能.     

基于遗传聚类的无线传感器负载均衡路由算法

通常的无线传感器分簇网络存在节点负载不均衡的问题。为均衡各节点能量消耗,延长网络生存周期,将K均值算法与遗传算法相结合,提出一种负载均衡的无线传感器网络路由算法,算法利用遗传算法的全局寻优能力以克服传统K均值算法的局部性和对初始中心的敏感性,实现了传感器网络节点自适应成簇与各节点负载均衡。仿真实验表明,该算法显著延长了网络寿命,相对于其他分簇路由算法,其网络生存时间延长了约43%。     

基于遗传聚类的无线传感器负载均衡路由算法

通常的无线传感器分簇网络存在节点负载不均衡的问题。为均衡各节点能量消耗,延长网络生存周期,将K均值算法与遗传算法相结合,提出一种负载均衡的无线传感器网络路由算法,算法利用遗传算法的全局寻优能力以克服传统K均值算法的局部性和对初始中心的敏感性,实现了传感器网络节点自适应成簇与各节点负载均衡。仿真实验表明,该算法显著延长了网络寿命,相对于其他分簇路由算法,其网络生存时间延长了约43%。     

一种非对称耦合无线传感器网络同步控制模型

无线传感器网络作为一种复杂网络,具有节点众多、拓扑时变等特点。研究传感器网络中的同步问题对于利用节点众多这一特点,实现MIMO协作信息传输、混沌保密通信等应用有着重要的意义。现有对于网络同步的研究大都集中于研究规则网络模型。然而对于无线传感器网络来说,由于无线信道的固有时变特性以及无线传感器网络节点易失效等原因造成了网络拓扑动态变化,从而给传感器网络同步问题的数学建模和分析造成了很大的困难。本文工作受到Belkh[1]工作的启发,提出一种非对称耦合传感器网络同步控制模型。该模型避开了讨论研究具体的网络拓扑结构下的网络同步问题,代之以从控制的角度研究如何改善网络同步性能。理论分析和实验结果表明该模型能够显著提高网络同步化性能。      

基于自适应遗传算法的无线激光通信网络负载均衡成簇算法

由于无线激光通信网络吞吐量低、节点传输延时高和存在分组丢失率多等问题，提出基于自适应遗传算法的无线激光通信网络负载均衡成簇算法。利用AGCH算法对无线激光通信网络节点进行分组和成簇，从中取得簇头节点，构建资源调度模型，利用该模型对簇头节点中的资源进行分配调度，采用自适应遗传算法对建立的模型进行求解，以此提升无线激光通信网络负载均衡效果，实现无线激光通信网络负载均衡。实验结果表明，通过对该算法进行网络吞吐量测试、节点传输延时测试和分组丢失率测试，验证了该算法的有效性强、实用性高。     

无线传感器网络中敏感数据分布密度控制方法研究

为了解决传统基于参数可变遗传方法对无线传感网络敏感数据分布密度控制不健全,导致敏感数据分布密度失衡,且能量消耗过高的问题。提出基于改进差分蜂群算法的无线传感器网络节点分布密度控制方法,其综合考虑节点信息感知和信息传递的能耗,对圆形区域和带状区域的节点能耗进行分析,从理论上分别给出适用于这两种场景的节点非均匀分布方法,在此基础上采用改进差分蜂群算法,通过以网络覆盖率为目标函数对覆盖区域的节点进行分布密度优化控制,实现节点中敏感数据分布密度的均衡控制。实验结果说明,所提方法可实现节点中敏感数据分布密度的均衡控制,降低能量消耗。     

基于节点密度的混合式多信道分配算法

为了减小无线传感器网络中的同频干扰和避免网络堵塞问题,文章提出了一种基于节点密度的混合式多信道分配算法。该算法通过考虑链路干扰以及节点密度等因素,来解决局部严重同频干扰问题,实现各信道负载均衡,减少网络阻塞。仿真实验结果分析表明,该算法能有效地解决网络中同频干扰问题,较好地均衡各信道的网络负载,在数据业务较重的情况下,网络性能仍比较良好。     

体育场馆中的无线地下传感器网络研究

构建体育场馆的无线地下传感器网络,保障智能控制场馆的温度和光电,实现构建智慧体育场馆,提出基于层级和位置的体育场馆无线地下传感器网络地理路由决策机制。首先构建无线地下传感器网络的拓扑结构模型,采用基于层级的定向泛洪机制进行路由协议构建;然后根据节点的层级、密度和剩余能量进行无线地下传感器网络的节点优化部署,根据网络的层级和地下地理位置实现路由探测设计;最后通过仿真实验进行性能测试。实验结果表明,该体育场馆无线地下传感器网络具有较好的能耗均衡性,网络节点端到端的时延较低,数据包的准确传输率较高。     

3G无线传感器网络在智能配电网的应用研究

本文提出一种基于3G通信的无线传感器网络(简称3G无线传感器网络)在智能配电网中的应用模型,介绍了3G无线传感器网络的概念与应用特点,在分析配电网络结构的基础上给出了3G无线传感器网络的拓扑结构,提出了带冗余的混合路由模式,最后给出了配电网中3G传感器节点的设计.     

移动Sink传感网中基于IEEE 802.15.4的拓扑控制与路由

针对查询驱动的移动Sink无线传感器网络,基于IEEE 802.15.4标准,提出了一个联合簇树组网和移动路由的跨层协议设计方案。以能耗、网络连通度、负载均衡和子树深度等指标为评价因子,在多目标优化模型下定义了一个拓扑综合评价函数,构建稳定的最优簇树网络结构;改进了IEEE 802.15.4 MAC中基于信标帧调度的分布式睡眠同步算法,维护较低占空比下的网络同步与拓扑修正;利用拓扑形成过程中依"最早信标帧"、"最好链路"、"最小层次"3种准则确立的父子关系,建立移动Sink与N-Hop范围内节点的双向路由路径。最终将上述MAC层的拓扑控制方案与网络层的查询路由方法完整实现于TinyOS协议栈中。实验结果表明,评价函数能够有效地反映组网质量,N-Hop后验式路由结合睡眠同步机制,在"最好链路"拓扑下表现出较高的能量效率。     

Optimal load balanced clustering in homogeneous wireless sensor networks

Balancing the load among sensor nodes is a major challenge for the long run operation of wireless sensor networks. When a sensor node becomes overloaded, the likelihood of higher latency, energy loss, and congestion becomes high. In this paper, we propose an optimal load balanced clustering for hierarchical cluster‐based wireless sensor networks. We formulate the network design problem as mixed‐integer linear programming. Our contribution is 3‐fold: First, we propose an energy aware cluster head selection model for optimal cluster head selection. Then we propose a delay and energy‐aware routing model for optimal inter‐cluster communication. Finally, we propose an equal traffic for energy efficient clustering for optimal load balanced clustering. We consider the worst case scenario, where all nodes have the same capability and where there are no ways to use mobile sinks or add some powerful nodes as gateways. Thus, our models perform load balancing and maximize network lifetime with no need for special node capabilities such as mobility or heterogeneity or pre‐deployment, which would greatly simplify the problem. We show that the proposed models not only increase network lifetime but also minimize latency between sensor nodes. Numerical results show that energy consumption can be effectively balanced among sensor nodes, and stability period can be greatly extended using our models.     

Distributed potential field based routing and autonomous load balancing for wireless mesh networks

Congested hot spots and node failures severely degrade the performance of wireless mesh networks. However, conventional routing schemes are inefficient in mitigation of the problems. Considering analogy to physics, we propose a novel distributed potential-field-based routing scheme for anycast wireless mesh networks, which is robust to sudden traffic and network perturbations, effectively balancing load among multiple gateways and mesh nodes with little control overhead. Simulation results exhibit autonomous load balancing and failure-tolerant performance in wireless mesh networking.     

基于无线传感网络的小世界演化研究

提高无线传感网络的传输效率、节约整个网络的能量消耗是我们研究无线传感网络的重要内容。通常都是通过改变网络的拓扑结构来实现效率的提高,本文给出了一种新的思路去节约能耗。本文讨论了权重与与无线传感网传输效率的关系,将有权的无线传感网络链路上的权值进行随机的分配,我们发现将权重随机分配后网络的传输效率得到了提高并且随着权重分布概率的增大网络的传输效率不断增大。这为我们研究权重对无线传感网络的影响提供了基础。     

Utility‐driven construction of balanced data routing trees in wireless sensor networks

In wireless sensor networks, achieving load balancing in an energy‐efficient manner to improve the network lifetime as much as possible is still a challenging problem because in such networks, the only energy resource for sensor nodes is their battery supplies. This paper proposes a game theoretical‐based solution in the form of a distributed algorithm for constructing load‐balanced routing trees in wireless sensor networks. In our algorithm, load balancing is realized by adjusting the number of children among parents as much as possible, where child adjustment is considered as a game between the parents and child nodes; parents are considered as cooperative players, and children are considered as selfish players. The gained utility by each node is determined by means of some utility functions defined per role, which themselves determine the behavior of nodes in each role. When the game is over, each node gains the maximum benefit on the basis of its utility function, and the balanced tree is constructed. The proposed method provides additional benefits when in‐network aggregation is applied. Analytical and simulation results are provided, demonstrating that our proposed algorithm outperform two recently proposed benchmarking algorithms [1, 2], in terms of time complexity and communication overhead required for constructing the load‐balanced routing trees. Copyright © 2012 John Wiley & Sons, Ltd.     

负载均衡的异构WMSN节点布局方法

Multiple hop transmission in wireless sensor networks(WSN)would bring the energy hole problem near the sink.It proved that the energy hole problem would appear in any position in heterogeneous wireless multimedia sensor networks and propose a method of the node distribution based on load balancing to solve the problem.The energy consumption was analyzed on the basis of considering the data compression ratio and the energy consumed for data transmission and processing.It proved that in heterogeneous WMSN the energy consumption of data processing would affect the node distribution and define a word that profit of data processing.The simulation results show that the energy utilization rate and the survival time of the network can be effectively improved by using the method proposed.     

Communication-efficient implementation of join in sensor networks

A sensor network is a multi-hop wireless network of sensor nodes cooperatively solving a sensing task. Each sensor node generates data items that are readings obtained from one or more sensors on the node. This makes a sensor network similar to a distributed database system. While this view is somewhat traditional, efficient execution of database (SQL) queries in sensor network remains a challenge, due to the unique characteristics of such networks such as limited memory and battery energy on individual nodes, multi-hop communication, unreliable infrastructure, and dynamic topology. Since the nodes are battery powered, the sensor network relies on energy-efficiency (and hence, communication efficiency) for a longer lifetime of the network.In this article, we have addressed the problem of communication-efficient implementation of the SQL “join” operator in sensor networks. In particular, we design an optimal algorithm for implementation of a join operation in dense sensor networks that provably incurs minimum communication cost under some reasonable assumptions. Based on the optimal algorithm, we design a suboptimal heuristic that empirically delivers a near-optimal join implementation strategy and runs much faster than the optimal algorithm. Through extensive simulations on randomly generated sensor networks, we show that our techniques achieve significant energy savings compared to other simple approaches.     

Reliable and energy aware query-driven routing protocol for wireless sensor networks

Wireless sensor networks become very attractive in the research community, due to their applications in diverse fields such as military tracking, civilian applications and medical research, and more generally in systems of systems. Routing is an important issue in wireless sensor networks due to the use of computationally and resource limited sensor nodes. Any routing protocol designed for use in wireless sensor networks should be energy efficient and should increase the network lifetime. In this paper, we propose an efficient and highly reliable query-driven routing protocol for wireless sensor networks. Our protocol provides the best theoretical energy aware routes to reach any node in the network and routes the request and reply packets with a lightweight overhead. We perform an overall evaluation of our protocol through simulations with comparison to other routing protocols. The results demonstrate the efficiency of our protocol in terms of energy consumption, load balancing of routes, and network lifetime.