无线传感器网络的分布式竞争路由算法

在WSNs体系结构中,路由算法是网络层的关键,分簇技术在路由算法中可提高WSNs的扩展性。提出一种竞争簇头,非均匀分簇和多跳路由相结合的WSNs 分布式竞争路由算法(DSA)．它的核心是构建一个高效的非均匀分簇算法,通过竞争的方式候选簇头,靠近基站的簇头为簇间的数据转发预留能量,根据节点的剩余能量、簇内和簇间通信代价,每个簇头在邻居簇头集中用贪心法确定中继节点,仿真表明,DSA算法能有效平衡了簇头的能耗、均衡了网络能耗、显著延长网络生存周期。     

一种基于可变扇区的非均匀分簇算法

针对LEACH协议中簇首分布不均匀,网络能耗不均衡的问题,提出一种基于可变扇区的非均匀分簇的算法（UCBVS）。首先,利用可变扇区和同心圆将网络合理的动态划分,使得距离基站近的区域分区较小;其次,选取簇内权值大的节点作为簇头,根据权值的大小判断是否进行簇头轮换;最后采用单跳和多跳相结合的方式进行网络通信。仿真结果表明,改进算法能够保证簇头节点能耗均匀,延长了网络生命周期。     

基于移动agent的WSN低能耗数据融合策略设计

为了解决无线传感器网络中LEACH协议中传感器节点需要耗费大量能量,导致节点过早死亡,在LEACH协议的基础上,将移动agent引入到数据融合策略中,提出了一种基于移动agent和LEACH协议的数据融合策略;首先,改进簇头选举机制,考虑剩余能量和与基站的距离等因素;其次,为了避免访问冗余节点而耗费能量,确定了访问节点集合,并通过改进的遗传算法来获得访问节点序列;最后,通过仿真实验并与LEACH协议、AF-LEACH协议进行比较,文中方法节点死亡时间在470s才出现,延迟了节点死亡时间,从而延长了网络的生命周期。     

一种针对无线传感器网络能量洞的节点分布策略

在无线传感器网络中,sink节点周围出现的能量空洞问题直接影响着网络的生存寿命。从延长网络生命周期的角度,对网络部署时距离和节点密度等因素进行了研究,设计了一种节点初始能量不同的能量均衡机制,通过合理地部署节点数量和相对位置,使得整个末端网络总能耗尽可能少;对于多跳过程中的单个节点,提出了一种基于剩余能量与距离的比重的方法,选择适当的转发节点。通过推导仿真,这种节点分布策略能够有效提高末端网络总体效能,对物联网末端网络不间断工作具有良好效果。     

基于质心理念的无线传感网络路由协议的研究与改进*

在无线传感器网络中存在诸如节点能量损耗以及数据传输时所存在的时延等问题,因此在深入研究PEGASIS以及相关改进算法的基础上,并结合力学中质心的概念而提出一种基于质心理念的链式算法CMC-PEGASIS(Center of mass concept-PEGASIS)。该算法将整个传感器区域分成等宽的五个子区域,通过计算每个子区域内节点至基站的距离并按照距离与基站的远近来成链。其次引入质心的概念找到每个区域节点的能量中心,同时结合节点自身的能耗以及每个节点与基站的距离关系,得到每个子区域中的最佳的簇头节点,最后每个区域的簇头节点直接与基站完成信息的传输。经过理论分析和仿真结果得知：CMC-PEGASIS算法降低了全局能耗、减少了信息延迟率同时延长了网络的生命周期。     

基于LEACH路由协议的多跳节能路由算法

当无线传感器网络部设在不同环境中时,需要提出新的算法以适应特殊环境,减少节点能量消耗;算法针对LEACH路由算法的局限性,提出了一种适用网络覆盖范围较大,节点间距离较远,需要远距离传输的路由算法;本算法利用节点到基站的距离因素,修改簇头阈值信息;并利用簇头竞争重新设定簇头,使剩余能量较高的节点成为簇头;同时,运用多跳的方式传输数据,这样可以适应远距离传输;仿真结果表明,相对LEACH算法,算法将节点死亡时间推后了300~400轮,网络存活周期延长了400轮左右,很明显的减少了网络的能量消耗,延长了网络的生存周期和稳定性。     

基于改进蚁群算法的LEACH协议研究

针对LEACH协议在数据传输阶段,簇首与汇聚节点之间采用单跳模式传输数据使得能量消耗快并且不均衡的问题,提出一种基于改进蚁群算法的新型路由协议。该协议利用了能耗因子对蚁群转移概率以及信息素更新进行改进,充分考虑了节点的剩余能量和节点间距离,通过信息素的建立和更新,寻找簇首节点和基站之间的最优传输路径,进行多跳传输模式,从而均衡簇首节点能量消耗。仿真实验结果表明,改进后的ACO-BEC协议较之于LEACH协议,能够有效降低了整个网络能量消耗,延长了网络寿命。     

基于DS证据理论和压缩感知的WSN数据融合策略设计

为了降低WSN数据量和延长网络生命周期,设计了一种基于DS证据理论和压缩感知的WSN混合数据融合策略;首先,在分簇协议的基础上引入了基于DS证据理论和压缩感知的混合模型,然后,采用改进的DS对所有簇成员节点的基本信度分配函数进行加权处理,在簇头处采用加权和归一化的信度分配函数计算证据对各命题的支持程度,将支持程度较大的若干命题作为DS融合结果,在此基础上采用压缩感知方法通过构造测量矩阵对融合结果进行稀疏化表示,并在基站处对稀疏信号进行重构;仿真实验表明,文中方法能有效地实现数据融合,且和其他方法相比,具有重构误差较小和网络生命周期较长的优点,具有较大的优越性。     

基于DIJKSTRA的无线传感器网络分簇路由算法

为加快无线传感器网络最优路径搜索速度、减少路径寻优能量消耗和延长网络寿命,提出了基于改进的DIJKSTRA算法的无线传感器网络分簇路由算法;运用DIJKSTRA算法在无线传感器网络内以多跳接力的方式来搜寻从源节点到目的节点的最短路径;结合能耗优化策略,避免网络能耗热点问题,实现网络能耗均衡;通过与基于蚁群算法的路由算法对比分析,基于Dijkstra的网络分簇路由算法能优化网络分簇并建立较优传输路径,其快速收敛性能减缓了网络中簇头节点的能耗,延长了网络寿命,提高了网络鲁棒性。     

一种无线传感器网络多级异构分簇路由协议

JP+1]研究了无线传感器网络,提出了一种适合大规模应用的无线传感器网络体系结构,并提出了一种新的路由协议——多级异构分簇路由协议;该协议将无线传感器网络节点分成4种类型,根据簇头间平均跳数、簇头能耗等因素选举出第一级簇头节点;利用通信能耗、节点能耗以及跳数3个方面作为启发因子,寻找第一级簇头到第二级簇头间的最佳路径;基于NS2平台对该路由协议进行了仿真实验,并与LEACH协议进行比较;仿真结果表明:在大规模的应用中,该路由协议能有效地降低节点的平均能耗、延长网络生存时间。     

Adaptive multimode transmission in wireless sensor networks with energy harvesting

Limited energy has always been an important factor restricting the development of wireless sensor networks. The unbalanced energy consumption of nodes will accelerate the death of some nodes. To solve the above problems, an adaptive routing algorithm for energy collection sensor networks based on distributed energy saving clustering (DEEC) is proposed. In each hop of data transmission, the optimal mode is adaptively selected from four transmission modes: single-hop cooperative, multi-hop cooperative, single-hop non-cooperative and multi-hop non-cooperative, so as to reduce and balance the energy consumption of nodes. The performance of the proposed adaptive multi-mode transmission method and several benchmark schemes are evaluated and compared by computer simulation, where a few performance metrics such as the network lifetime and throughput are adopted. The results show that, the proposed method can effectively reduce the energy consumption of the network and prolong the network lifetime; it is superior to various benchmark schemes.     

A local-world heterogeneous model of wireless sensor networks with node and link diversity

In this paper, we present a novel local-world model of wireless sensor networks (WSN) with two kinds of nodes: sensor nodes and sink nodes, which is different from other models with identical nodes and links. The model balances energy consumption by limiting the connectivity of sink nodes to prolong the life of the network. How the proportion of sink nodes, different energy distribution and the local-world scale would affect the topological structure and network performance are investigated. We find that, using mean-field theory, the degree distribution is obtained as an integral with respect to the proportion of sink nodes and energy distribution. We also show that, the model exhibits a mixed connectivity correlation which is greatly distinct from general networks. Moreover, from the perspective of the efficiency and the average hops for data processing, we find some suitable range of the proportion p of sink nodes would make the network model have optimal performance for data processing.     

A random walk evolution model of wireless sensor networks and virus spreading

In this paper, considering both cluster heads and sensor nodes, we propose a novel evolving a network model based on a random walk to study the fault tolerance decrease of wireless sensor networks (WSNs) due to node failure, and discuss the spreading dynamic behavior of viruses in the evolution model. A theoretical analysis shows that the WSN generated by such an evolution model not only has a strong fault tolerance, but also can dynamically balance the energy loss of the entire network. It is also found that although the increase of the density of cluster heads in the network reduces the network efficiency, it can effectively inhibit the spread of viruses. In addition, the heterogeneity of the network improves the network efficiency and enhances the virus prevalence. We confirm all the theoretical results with sufficient numerical simulations.     

Energy-Efficient Clustering Mechanism of Routing Protocol for Heterogeneous Wireless Sensor Network Based on Bamboo Forest Growth Optimizer

In wireless sensor networks (WSN), most sensor nodes are powered by batteries with limited power, meaning the quality of the network may deteriorate at any time. Therefore, to reduce the energy consumption of sensor nodes and extend the lifetime of the network, this study proposes a novel energy-efficient clustering mechanism of a routing protocol. First, a novel metaheuristic algorithm is proposed, based on differential equations of bamboo growth and the Gaussian mixture model, called the bamboo growth optimizer (BFGO). Second, based on the BFGO algorithm, a clustering mechanism of a routing protocol (BFGO-C) is proposed, in which the encoding method and fitness function are redesigned. It can maximize the energy efficiency and minimize the transmission distance. In addition, heterogeneous nodes are added to the WSN to distinguish tasks among nodes and extend the lifetime of the network. Finally, this paper compares the proposed BFGO-C with three classic clustering protocols. The results show that the protocol based on the BFGO-C can be successfully applied to the clustering routing protocol and can effectively reduce energy consumption and enhance network performance.     

Mobile sink-based data collection in event-driven wireless sensor networks using a modified ant colony optimization

The hotspot problem is one of the primary challenges in the wireless sensor networks (WSNs) because it isolates the sink node from the remaining part of the WSN. A mobile sink (MS)-based data acquisition strategy mitigates the hotspot problem, but the traditional MS-based data gathering approaches do not resolve the issue. However, the conventional techniques follow a fixed order of visits and static traversal of the MS. In this context, this paper uses a modified version of the ant colony optimization strategy for the data collected through a MS to mitigate the hotspot problem in the WSNs while improving the energy efficiency, network lifetime, throughput by reducing the packet loss and delay. In our work, we initially construct a forwarded load spanning tree to estimate the freight of each node in the WSN. Further, we choose RPs and their path simultaneously using the modified ACO algorithm by considering the forward loads, remaining energy, distance, etc. The proposed work also adopts the virtual RP selection strategy void unnecessary data exchanges between the nodes and RPs. Hence, it reduces the burden on relay nodes and optimize the energy usage among the nodes. We compare our approach with the recent ACO-based algorithms, and our approach outperforms them.     

面向结构洞的复杂网络关键节点排序

复杂网络中的结构洞节点对于信息传播具有重要作用, 现有关键节点排序方法多数没有兼顾结构洞节点和其他类型的关键节点进行排序. 本文根据结构洞理论与关键节点排序相关研究选取了网络约束系数、介数中心性、等级度、效率、网络规模、PageRank值以及聚类系数7个度量指标, 将基于ListNet的排序学习方法引入到复杂网络的关键节点排序问题中, 融合7个度量指标, 构建了一个能够综合评价面向结构洞节点的关键节点排序方法. 采用模拟网络和实际复杂网络进行了大量实验, 人工标准试验结果表明本文排序方法能够综合考虑结构洞节点和核心节点, 关键节点排序与人工排序结果具有较高的一致性. SIR传播模型评估实验结果表明由本文选择TOP-K节点发起的传播能够在较短的传播时间内达到最大的传播范围.