混合传感器网络中基于向量代数的覆盖补偿算法

针对混合传感器网络中,能量耗尽造成的覆盖空洞与休眠冗余节点能量剩余可能并存的矛盾现象,提出一种基于向量代数的移动节点覆盖补偿方法.算法包含所有可能参与补偿的冗余节点对各自位移量的计算方法,空洞边缘节点在平衡节点剩余能量的基础上,对最佳冗余节点的选择启用策略,保证网络能充分利用遗留能量资源的同时实现完全覆盖补偿.实验分析表明,本算法在平均移动距离、能量开销等方面均优于COA算法.     

Adaptive directed evolved NSGA2 based node placement optimization for wireless sensor networks

Wireless sensor network (WSN) is a wireless network composed of a large number of static or mobile sensors in a self-organizing and multi-hop manner. In WSN research, node placement is one of the basic problems. In view of the coverage, energy consumption and the distance of node movement, an improved multi-objective optimization algorithm based on NSGA2 is proposed in this paper. The proposed algorithm is used to optimize the node placement of WSN. The proposed algorithm can optimize both the node coverage and lifetime of WSN while also considering the moving distance of nodes, so as to optimize the node placement of WSN. The experiments show that the improved NSGA2 has improvements in both searching performance and convergence speed when solving the node placement problem.

     

Prolonging lifetime for wireless rechargeable sensor networks through sleeping and charging scheduling

Prolonging network lifetime is a fundamental requirement in wireless sensor network (WSN). Existing charging scheduling algorithms suffer from high node redundancy and energy consumption issues. In this paper, we study WSN charging problem from the perspectives of energy conservation combined with energy replenishment scheduling. Firstly, we detect the redundant nodes whose energy is wasted in the network functionality and develop a K‐covering redundant nodes sleeping scheduling algorithm (KRSS) for reducing energy. Secondly, we employed multiple wireless charging vehicles (WCVs) for energy replenishment and optimize the charging scheduling algorithm to prevent any exhaustion of nodes, and we proposed a distance and energy–oriented charging scheduling algorithm (DECS) with multiple WCVs. Simulation experiments are conducted to show the advantages of the proposed KRSS+DECS, confirming that our scheme is capable of removing redundant nodes, lowering node failures, and prolonging network lifetime.     

传感器网络簇间通信自适应节能路由优化算法

提出了一种用于无线传感器网络簇间通信的自适应节能路由优化算法。网络中以总体通信能耗最小为首要原则建立端到端之间的路由,并对簇间通信提出了一种优化算法,使得簇首之间相互通信时,可以在直接、中继以及协作3种不同方式中自适应地选择最节能的通信方式。所提出的路由算法可确保源节点与基站通信过程中选择到最优或次优的节能路由,并可降低由于通信覆盖盲区造成的通信中断的概率。仿真结果表明,与其他传感器网络路由算法相比,所提出的路由算法在相同吞吐量和误码率前提下每一轮都消耗更少的能量,并且在不同的节点密度下都可有效地延长网络的生命周期和工作时间。     

一种基于无交集节点分组的无线传感器网络覆盖算法

无线传感器网络是一种无线自组织网络,它由大量能量有限的传感器节点组成.能量消耗和网络覆盖是无线传感器网络的两个核心问题,网络覆盖决定了无线传感器网络对物理世界的监测能力,能量消耗则决定了无线传感器网络的生存时间.本文研究了一种改进的基于无交集节点分组算法,针对随机选取节点实现无交集节点分组方式获得的分组个数少且节点通信...     

基于覆盖率和冗余技术的功率控制算法

无线传感器网络中的节点因体积小而携带的能量有限,并且不能更换电池,因此必须在保证网络功能的前提下,尽可能地节省能量来延长网络生存时间。文中针对现有的平面型功率控制算法中没有考虑剩余能量这一缺点进行了改进,提出了一种能控制节点发射功率的,且基于覆盖率的冗余算法。通过仿真表明,该改进算法实现了延长网络生存时间的目标,同时网络的覆盖率也更为稳定。     

无线传感器网络覆盖优化控制技术分析

覆盖控制问题是无线传感器组网的一个基本问题，本文对传感节点的组成、定位方法，网络的拓扑结构等进行了简要的介绍。分析了无线传感器网络覆盖问题的背景，并针对覆盖冗余检测的主要方法和数学模型，讨论了无线传感器网络能量高效覆盖优化与网络连通性的关系。重点阐述了覆盖控制的技术手段，最后对无线传感器网络的覆盖控制关键技术进行了展望。     

基于ERPMT改进启发式方法的WSN寿命最大化算法

针对传感器节点的电池容量限制导致无线传感网络寿命低的问题,基于容量最大化(CMAX)、线上最大化寿命(OML)两种启发式方法以及高效路由能量管理技术(ERPMT),提出了基于ERPMT改进启发式方法的无线传感网络寿命最大化算法。首先,通过启发式方法初始化每个传感器节点,将节点能量划分为传感器节点起源数据和其它节点数据延迟;然后利用加入的一种优先度量延迟一跳节点的能量消耗;最后,根据路径平均能量为每个路由分配一个优先级,并通过ERPMT实现最终的无线传感网络优化。针对不同分布类型网络寿命的实验验证了本文算法的有效性及可靠性,实验结果表明,相比较为先进的启发式方法CMAX及OML,本文算法明显增大了无线传感网络的覆盖范围,并且大大地延长了网络的寿命。     

Optimized mobile sink based grid coverage-aware sensor deployment and link quality based routing in wireless sensor networks

Mobile sink (MS) has been used in wireless sensor networks (WSN) to increase the network lifetime by changing the location over time. The major quality of service given by WSN is coverage energy consumption (EC) and network lifetime. There are many methods implemented for enhance the coverage hole restoration and reduce the EC. We propose a novel MSCOLER (MS based Coverage Optimization and Link-stability Estimation Routing) protocol for Optimal Coverage restoration and Link stability Estimation. An optimization algorithm is used to optimize the coverage hole and move the redundant node besides the hole. During the routing process, link quality based routing is used to discover the relay nodes with the estimation of link stability to enhance the entire network lifetime and practically make the perfect transmission distance for energy saving. Experimental results demonstrate that proposed protocol can solve the coverage restoration problem, decrease the EC and reduce the network lifetime. The performance is evaluated regarding Average of residual energy (ARE), Receiving packets ratio (RPR), Moving energy consumption (MEC), Network lifetime (NL), Percentage of coverage (%C) and Average Energy Consumption (AEC).     

Wireless Sensor Network Path Optimization Using Sensor Node Coverage Area Calculation Approach

The proposed work is based on the path optimization approach for wireless sensor network (WSN). Path optimization is achieved by using the NSG 2.1 Tool, TCL Script file and NS2 simulator to improve the quality of service (QoS). Path optimization approach finds best suitable path between sensor nodes of WSN. The routing approach is not only the solution to improve the quality but also improves the WSN performance. The node cardinally is taken under consideration using the ad-hoc on demand distance vector routing protocol mechanism. Ad hoc approach emphasize on sensor nodes coverage area performance along with simulation time. NSG 2.1 Tool calculates the sensor node packet data delivery speed which can facilitate inter-node communication successfully. An experimental result verified that the proposed design is the best possible method which can escape from slow network response while covering maximum sensor nodes. It achieves coverage support in sensor node deployment. The result outcomes show best path for transferring packet from one sensor node to another node. The coverage area of sensor node gives the percentage of average coverage ratio of each node with respect to the simulation time.

     

A Greedy Approach for Coverage Hole Detection and Restoration in Wireless Sensor Networks

Wireless sensor network contains several small sensor nodes that are designed to work autonomously. Coverage preservation is an underlying requirement to efficiently deliver certain services in WSNs. During network operation, some sensor nodes die because of several reasons like energy exhaustion, link failure, node failure etc. We refer it as coverage hole problem of WSNs. In this paper, a new decentralized, node based, localized algorithm called Coverage Hole Detection and Restoration is proposed for detection as well as restoration of coverage holes. Our proposed algorithm is expected to outperform existing algorithms on the parameters of energy and time consumption for convex and non-convex holes.     

Enhancing Coverage Using Weight Based Clustering in Wireless Sensor Networks

Energy conservation in wireless sensor networks (WSNs) is a fundamental issue. For certain surveillance applications in WSN, coverage lifetime is an important issue and this is related to energy consumption significantly. In order to handle these two interlinked aspects in WSN, a new scheme named Weight based Coverage Enhancing Protocol (WCEP) has been introduced. The WCEP aims to obtain longer full coverage and better network life time. The WCEP is based on assigning different weight values to certain governing parameters which are residual energy, overlapping degree, node density and degree of sensor node. These governing parameters affect the energy and coverage aspects predominantly. Further, these four different parameters are prime elements in cluster formation process and node scheduling mechanisms. The weight values help in selection of an optimal group of Cluster Heads and Cluster Members, which result in enhancement of complete coverage lifetime. The simulation results indicate that WCEP performs better in terms of energy consumption also. The enhancement of value 24% in full coverage lifetime has been obtained as compared to established existing techniques.

     

无线传感器网络节点节能管理方式的研究

无线传感器网络节点数量众多、自身携带的能量十分有限。为了延长网络的生命周期,需采用有效的策略降低能耗。在研究无线传感器网络节点组成结构、能量消耗以及节点间传播方式的基础上,提出一种为有效地达到节能目的所采用的节点管理方式。该方案采用动态选择簇头节点的自组织、多跳路由、层次式拓扑组织结构的路由协议、快速的数据融合技术,并在实现硬件的低功耗设计的条件下进行动态功耗管理。     

Efficient deployment quality analysis for intrusion detection in wireless sensor networks

The intrusion detection in a Wireless Sensor Network is defined as a mechanism to monitor and detect any intruder in a sensing area. The sensor deployment quality is a critical issue since it reflects the cost and detection capability of a wireless sensor network. The quality of deterministic deployment can be determined sufficiently by a rigorous analysis before the deployment. However, when random deployment is required, determining the deployment quality becomes challenging. In the intrusion detection application, it is necessary to define more precise measures of sensing range, transmission range, and node density that impact overall system performance. The major question is centred around the quality of intrusion detection in WSN, how we can guarantee that each point of the sensing area is covered by at least one sensor node, and what a sufficient condition to guarantee the network connectivity? In this paper, we propose an appropriate probabilistic model which provides the coverage and connectivity in k-sensing detection of a wireless sensor network. We have proved the capability of our approach using a geometric analysis and a probabilistic model.     

无线传感器网络的动态部分覆盖算法

为了实现较好的监测质量,无线传感器网络往往全覆盖监测区域.然而,由于单个节点的带电量有限,全覆盖的无线传感器网络并不能持续工作较长时间.文中提出了一种监测应用的动态部分覆盖算法.通过算法仿真,得出网络的生命时间可以提高到无穷大,而侵入物从开始移动到被任意节点监测出的时间仅为算法周期的三分之二.     

联合最小路径和能量调配的路由算法的实现

基于最小耗能路径和路由能量信息的结合,提出了一个新型算法,在节点生命周期上做出改善,同时延长整个无线传感器网络的生存周期.对节点的能量信息划分了等级,相应的等级都匹配对应相应的信息传递概率,并且还对网络进行了分块分层划分.在节点生命周期上有了很大的改善,并且延长了整个无线传感器网络的生存周期,网络节点之间以及网关和节点间的依赖关系更加明显,最佳路径以及结合路径的能量调配得以实现,提高了整个网络效率.所以算法达到了提高网络性能的要求,并且很合理.     

An energy‐efficient hole‐healing mechanism for wireless sensor networks with obstacles

In wireless sensor networks (WSNs), coverage of the monitoring area represents the surveillance quality. Since sensor nodes are battery powered and placed outdoor, there will be failures due to energy exhaustion or environmental influence, resulting in coverage‐loss. In literature, a number of studies developed robot repairing algorithms that aim at maintaining full coverage. However, they did not consider the time constraint for network maintenance. Furthermore, they did not consider the existence of obstacles and the constraint of limited energy of the robot. This paper presents a novel tracking mechanism and robot repairing algorithm for maintaining the coverage quality of the given WSN. Without support of location information, the tracking mechanism leaves robot's footmark on sensors so that they can learn better routes for sending repairing requests to the robot. Upon receiving several repairing request messages, the robot applies the proposed repairing algorithm to establish an efficient route that passes through all failure regions with low overhead in terms of the required time and the power consumption. In addition, the proposed repairing algorithm also considers the remaining energy of the robot so that the robot can move back to home for recharging energy and overcome the unpredicted obstacles. Performance results reveal that the developed protocol can efficiently maintain the coverage quality while the required time and energy consumption are significantly reduced. Copyright © 2011 John Wiley & Sons, Ltd.     

基于改进微粒群算法的WSN节点调度

为了降低无线传感器网络监测区域节点能耗和延长网络生命周期,设计了一种基于改进微粒群算法的节点调度方法.首先,以网络覆盖率和休眠工作节点数为目标建立了系统的数学模型,然后设计了粒子的编码方式、适应度函数以及自适应动态惯性权重,并定义了使用改进的微粒群算法对传感器网络节点调度的具体算法.仿真实验表明,该方法能正确地实现无线传感器网络监测区域的节点调度,在迭代次数较少时,就能以较少的节点获得较高的网络覆盖率,且与其他方法相比,具有收敛速度快和全局寻优能力强的优点.     

An Energy Efficient Barrier Coverage Algorithm for Wireless Sensor Networks

Intrusion detection is one of the most important applications of wireless sensor networks. When mobile objects are entering into the boundary of a sensor field or are moving cross the sensor field, they should be detected by the scattered sensor nodes before they pierce through the field of sensor (barrier coverage). In this paper, we propose an energy efficient scheduling method based on learning automata, in which each node is equipped with a learning automaton, which helps the node to select best node to guarantee barrier coverage, at any given time. To apply our method, we used coverage graph of deployed networks and learning automata of each node operates based on nodes that located in adjacency of current node. Our algorithm tries to select minimum number of required nodes to monitor barriers in deployed network. To investigate the efficiency of the proposed barrier coverage algorithm several computer simulation experiments are conducted. Numerical results show the superiority of the proposed method over the existing methods in term of the network lifetime and our proposed algorithm can operate very close to optimal method.     

一种无线传感器网络全连通群的休眠调度算法

该文针对无线传感器网络的覆盖性和连通性问题,在假设传感器节点地理位置信息已知的条件下,设计了一种包含全连通群的建立和维护以及群内节点休眠调度的全新算法。该算法采用保证群内节点彼此一跳可达的全连通群分群方法,以及分布式节能的休眠调度策略,最大程度上减少传感器网络的能量消耗,延长了网络寿命。仿真结果表明:该算法能较好地保证无线传感器网络的覆盖性和连通性,且能耗较低。