一种新的无线可充电传感器网络分簇算法

为了弥补现有无线可充电传感器网络充电效率低下和节点能量冗余并存的问题,提出了一种基于节点信息的分簇算法。首先,根据传感器节点的剩余能量状态,选择候选簇首。其次,计算候选簇首集合中节点之间的距离,并与基于节点密度的距离阈值比较,最终筛选出合适的簇首。其他节点根据就近原则选择簇首,形成对应的簇。该算法由于同时考虑节点剩余能量和簇首之间的距离,可以使得具有较多剩余能量的节点成为簇首,且簇首均匀分布整个网络中。仿真结果表明,提出的算法可以提高充电效率,减少节点的能量冗余或节点能量消耗过快而死亡的现象,从而有效延长整个网络的寿命。     

可充电传感器网络能量管理策略研究

随着电子技术的快速发展,传感器技术逐渐得到了广泛的应用,无线传感器网络具有成本低、功耗低以及可分布计算等特点,因此被应用的较为广泛,随着无线传感器网络的深入研究,逐渐出现了可充电传感器网络,它是指利用能量收集技术将提供能量的传感器节点构成的无线传感器网络。     

面向区块链的可充电无线传感器网络路由算法

区块链技术凭借去中心化属性逐渐成为电力物联网建设的重要手段,但电力物联网无线接入层中现有传感器终端尚不能满足该技术对终端性能的较高需求,为此面向区块链应用可充电无线传感器网络路由算法被提出,各节点根据分布式路由将数据上传至附近的同步节点,同步节点之间彼此通过洪泛实现区块链应用,此外采用移动补能设备基于异序补能算法为网络...     

无线可充电传感器网络中的充电桩部署

在传统的无线传感器网络中,由于自身能量存储的限制,电池供电的传感器节点缩短了整个网络的使用寿命,严重影响了网络性能。针对充电桩部署位置固定、位置不固定且不受限以及位置不固定且受限的3种情况,利用整数规划分别给出了具体的部署算法,使得整个传感器网络区域的充电效用最大化。最后利用Matlab进行仿真分析,与传统的全覆盖部署相比,使用该算法可以显著地减少所需要的充电桩数量。     

能量异构无线传感器网络容错拓扑研究

该文针对能量异构无线传感器网络中的节点失效问题,提出度分布可调的容错拓扑结构(ADD),并给出了拓扑的度分布表达式,进而通过解析度分布属性对拓扑容错性的影响,得出在能量耗尽与环境损毁综合节点失效情况下可较长时间维持监测任务的网络拓扑。仿真实验结果表明,新的容错拓扑结构获得了更长的生存时间,具有更好的容错性能。     

无线传感器网络路由专利申请分析

无线传感器网络路由技术中,由于硬件和能量条件的限制,提高数据传输可靠性、均衡网络能耗等研究一直是其研究热点,也是制约无线传感器网络产业应用的关键技术。本文针对目前无线传感器网络路由技术的几类研究方向出发,梳理了路由技术在专利申请方面的研究进展。     

基于拓扑控制的无线传感器节能路由优化方法

由于当前的无线传感器网络能量均衡路由方法未能考虑最优发射功率问题,导致无线传感器网络能量消耗较多、网络使用寿命较低以及网络节点能量不均衡,因此提出基于拓扑控制的无线传感器节能路由优化方法。将无线传感器节点的功率控制抽象为一个多人的非合作博弈问题,利用节点之间的博弈进行拓扑控制,从而获取最佳发射功率,并将蚁群算法应用于无线传感器网络的路径选择,通过蚁群的动态适应和寻优能力平衡网络最短路径和能量均衡消耗,以达到无线传感器网络能量均衡路由优化的目的。仿真结果表明,所提方法能够有效降低能量消耗,提升网络使用寿命,使无线传感器网络能量达到均衡。     

无线传感器网络路由问题探讨

无线传感器网络（WSN）具有与传统网络显著不同的特点，导致应用于传统网络的路由协议并不适用于无线传感器网络，因此有必要研究新的路由协议为之服务。文中在介绍WSN的特点后，将着重讨论其路由过程并把整个过程分为路由建立和路由更新两个阶段，通过对当前应用较多的路由协议分析，对每个阶段进行阐述；文章最后对WSN路由协议未来的研究策略与发展趋势提出了一些具体研究意见。     

具有能量供给的无线传感器网络路由算法研究

针对现有具有能量供给的无线传感器网络由算法出现的簇头分布不均匀、簇头无法连任的问题,本文提出了一种新的路由算法一CAEH（clustering algorithm for energy harvesting）,该算法通过对簇头选举机制阈值进行改进,均衡了全网簇头节点的分布,同时簇头能够连续担任不再重复选举,从而充分保存与利用供给能量。理论和仿真实验表明：与另一种对比算法相比较,CAEH算法能够提高节点平均剩余能量以及存活节点的数量。     

Demand‐based charging strategy for wireless rechargeable sensor networks

A wireless power transfer technique can solve the power capacity problem in wireless rechargeable sensor networks (WRSNs). The charging strategy is a widespread research problem. In this paper, we propose a demand‐based charging strategy (DBCS) for WRSNs. We improved the charging programming in four ways: clustering method, selecting to‐be‐charged nodes, charging path, and charging schedule. First, we proposed a multipoint improved K‐means (MIKmeans) clustering algorithm to balance the energy consumption, which can group nodes based on location, residual energy, and historical contribution. Second, the dynamic selection algorithm for charging nodes (DSACN) was proposed to select on‐demand charging nodes. Third, we designed simulated annealing based on performance and efficiency (SABPE) to optimize the charging path for a mobile charging vehicle (MCV) and reduce the charging time. Last, we proposed the DBCS to enhance the efficiency of the MCV. Simulations reveal that the strategy can achieve better performance in terms of reducing the charging path, thus increasing communication effectiveness and residual energy utility.     

Genetic algorithm-based partial charging schedule of rechargeable sensor networks

The use of rechargeable sensors is a promising solution for wireless sensor networks. On this type of network, mobile charging vehicles (MC) are used for charging sensors using wireless energy transfer (WET) technology. In on-demand charging, a sensor transmits a charging request to the service station, and the MC visits the sensor to transfer energy. The key disadvantages of utilizing MC-based WET are its high energy expenditure rate due to mobility, long service time, and slow charging rate. Because of these reasons, sensors deplete their energy and become dead before the MC reaches the requesting nodes to recharge. We have adapted a genetic algorithm-based partial charging scheme to serve the charging requests. Our objective is to improve the survival ratio of the network. Using comprehensive simulations, we analyze the performance of our proposed method and compare it to two other existing approaches. The simulation results demonstrate that our proposed algorithm improves the survival ratio by up to 20 % by developing a dynamic energy threshold function for transmitting charging requests from the sensors and a partial charging schedule using a genetic algorithm.     

基于拓扑重构的水下移动无线传感器网络拓扑优化

针对水下移动无线传感器网络（MUWSN, mobile underwater wireless sensor networks）拓扑随洋流动态演化对其网络性能会产生很大影响,提出了一种基于拓扑重构的水下移动无线传感器网络拓扑优化方法,首先通过模拟鱼群行为对传感器节点位置进行调整,优化网络覆盖度;其次,利用冗余节点修复网络中不连通位置,消除关键节点,优化网络连通性,最后,通过仿真对比实验验证了该方法的合理性和有效性。实验结果表明,所提算法能在较低能耗下,保证网络覆盖度长期维持在97%左右,连通率达到89%以上。     

Dynamic power management in new architecture of wireless sensor networks

Dynamic power management (DPM) technology has been widely used in sensor networks. Though many specific technical challenges remain and deserve much further study, the primary factor currently limiting progress in sensor networks is not these challenges but is instead the lack of an overall sensor network architecture. In this paper, we first develop a new architecture of sensor networks. Then we modify the sleep state policy developed by Sinha and Chandrakasan in (IEEE Design Test Comput. 2001; 18 (2):62–74) and deduce that a new threshold satisfies the sleep‐state transition policy. Under this new architecture, nodes in deeper sleep states consume lower energy while asleep, but require longer delays and higher latency costs to awaken. Implementing DPM with considering the battery status and probability of event generation will reduce the energy consumption and prolong the whole lifetime of the sensor networks. We also propose a new energy‐efficient DPM, which is a modified sleep state policy and combined with optimal geographical density control (OGDC) (Wireless Ad Hoc Sensor Networks 2005; 1 (1–2):89–123) to keep a minimal number of sensor nodes in the active mode in wireless sensor networks. Implementing dynamic power management with considering the battery status, probability of event generation and OGDC will reduce the energy consumption and prolong the whole lifetime of the sensor networks. Copyright © 2008 John Wiley & Sons, Ltd.     

Efficient location‐based topology control algorithms for wireless ad hoc and sensor networks

Topology control is an efficient strategy for improving the performance of wireless ad hoc and sensor networks by building network topologies with desirable features. In this process, location information of nodes can be used to improve the performance of a topology control algorithm and also ease its operations. Many location‐based topology control algorithms have been proposed. In this paper, we propose two location‐assisted grid‐based topology control (GBP) algorithms. The design objective of our algorithm is to effectively reduce the number of active nodes required to keep global network connectivity. In grid‐based topology control, a network is divided into equally spaced squares (called grids). We accordingly design cross‐sectional topology control algorithm and diagonal topology control algorithm based on different network parameter settings. The key idea is to build near‐minimal connected dominating set for the network at the grid level. Analytical and simulation results demonstrate that our designed algorithms outperform existing work. Furthermore, the diagonal algorithm outperforms the cross‐sectional algorithm. Copyright © 2016 John Wiley & Sons, Ltd.     

无线传感器网络时变充电和动态数据路由算法研究

利用无线充电设备周期地为无线传感器节点进行充电,可使传感器节点持续工作,解决无线传感器网络能量问题,但需设计合适的节点充电方案和网络路由方案。以无线充电设备驻站比最大化为优化目标,依次提出了充电及网络路由方案的连续时变模型、离散N+1阶段非线性模型及可解的离散N+1阶段线性模型,在证明模型合理性后最终求解。结论给出了具体网络的最优充电和路由策略。     

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).     

无线传感器网络的分区异构分簇协议研究

针对无线传感器网络能量受限和路由协议中节点能量消耗不均衡的问题,提出一种新的无线传感器网络的分区异构分簇协议(PHC协议).该协议的核心是将3种不同能量等级的节点根据能量的不同分别部署在不同区域,能量较高的高级节点和中间节点使用聚类技术通过簇头直接传输数据到汇聚点,能量较低的普通节点则直接传输数据到汇聚点.仿真结果表明,该协议通过对节点合理的分配部署,使簇头分布均匀,更好地均衡了节点的能量消耗,延长了网络的稳定期,提高了网络的吞吐量,增强了网络的整体性能.     

基于分簇的无线传感器网络安全路由协议研究

无线传感器网络（Wireless Sensor Networks,简称WSNs）作为一种新的获取信息的方式和处理模式,已成为通信领域的研究重点。而路由协议则是无线传感器网络当前的热点研究之一。目前,针对较为典型的分簇式路由协议LEACH路由协议的研究,是无线传感器网络目前研究的一个热点。介绍了无线传感器网络路由协议常见的攻击类型,并从路由安全的角度建议性的提出了一种对LEACH路由协议针对安全性的改进方案,并应用NS2仿真平台,对改进协议做了仿真并进行了性能分析。     

无线传感网规则拓扑结构的部署与设计综述

在无线传感网应用中部署规则拓扑结构能实现感知区域的完全覆盖和采集点的精确定位,以较小的部署代价提供更好的网络性能,为无线传感网的优化设计提供参照依据,对规则拓扑结构的相关研究进行综述。基于节点有效面积这个指标,探讨了完全覆盖、k-覆盖、l-连通情况下的拓扑部署方式与效能,并从连通性、能耗、传输性能、路由方案和MAC协议等方面总结了典型规则拓扑结构的性能、变化规律和适用范围。指出了各结构的最佳适用条件,并提出了若干有待进一步研究的方向。