无线传感器网络基于参数可调增强型覆盖控制算法

覆盖问题是无线传感器网络领域的一个基本问题,也是无线传感器网络特性当中的一个重点问题.如何通过某种算法达到以最少传感器节点对监测区域的有效覆盖已成为目前研究的一项重要课题.因此,提出一种增强型覆盖控制算法(Enhanced Coverage Control Algorithm, ECCA).该算法通过概率理论知识可以有效地求解出对监测区域进行有效覆盖下的最少节点,给出了传感器节点概率的期望值计算方法以及目标节点首次被传感器节点覆盖和多次覆盖后的期望值求解过程,验证随机变量相互之间不独立时的比例函数关系.仿真结果表明,ECCA算法可以使用较少的传感器节点数量完成对监测区域的有效覆盖,提高了对监测区域的覆盖质量.     

基于概率模型的无线传感器网络优化覆盖算法

为了更好地解决无线传感器网络在覆盖过程中出现大量冗余信息及节点能量消耗不均衡等现象,提出了一种节点能量均衡的最优覆盖算法。该算法利用监测区域内传感器节点与目标节点的从属关系建立网络模型,给出传感器节点与目标节点之间的从属关系;通过从属关系和概率理论,求解传感器节点对目标节点的覆盖期望值,然后计算出覆盖监测区域所需最少传感器节点数量。实验结果表明,该算法不仅可以使用最少传感器节点完成对监测区域的有效覆盖,而且抵制了冗余信息数据的产生,提高了网络生存周期。     

无线传感器网络分布式概率覆盖保持协议

覆盖配置能有效缓解无线传感器网络中节点能量受限的问题,但现有的研究多是基于物理覆盖,这与实际的信号传播特点不符.针对这一问题,提出了分布式传感器网络概率覆盖保持协议(DPCCP),该协议基于概率探测模型,利用Voronoi划分在节点本地执行概率覆盖判断算法.仿真实验中,将DPCCP嵌入LEACH路由协议,形成LEACHE协议,验证算法效率.仿真结果表明,DPCCP在保持网络覆盖度的同时,可关闭大量冗余节点,有效地延长了网络寿命.     

基于联合感知模型的无线传感器网络连通性覆盖协议

本文研究在没有节点位置信息的情况下,如何有效地保证节点采用联合感知模型且节点通信范围多级可调的无线传感器网络的覆盖质量和连通性.给出了在节点随机部署方式下,网络覆盖质量和网络连通性与工作节点个数、监测区域面积和节点性能参数的关系;设计了一个选取最少工作节点保证网络覆盖质量和网络连通性的调度控制算法(SCA),该算法力求...     

无线传感器网络中的鲁棒区域定位算法

大多数传统的方法并不能处理一些影响定位算法性能的因素,如各向相异的投放环境,不精确的锚节点位置以及带误差的距离测量。该文提出一种鲁棒的区域定位算法,通过建立一个全局约束集来处理如上所述的影响因素。使用可行解区域投影方法计算每个节点的可行地理区域,将传感器节点的真实位置限定于该区域中,同时利用非凸约束计算其存在的内部空洞。此外为了提高该方法的实用性,提出了一种基于分簇的分布式迭代算法。仿真结果表明算法受地理环境,测量误差等因素的影响较小,能适用于传感器网络应用。     

无线传感器网络节点的设计

无线传感器网络是一种以无中心节点的全分布系统。通过随机投放的方式,众多传感器节点被密集部署于监控区域。这些传感器节点集成有传感器、数据处理单元和通信模块,它们通过无线信道相连,自组织地构成网络系统。传感器节点借助于其内置的形式多样的传感器,测量所在周边环境中的相关信号,传感器节点间具有良好的协作能力,通过局部的数据交换来完成全局任务。     

基于干涉效应的无线传感器节点定位方法

针对无线传感器网络中节点定位的需求,提出了一种基于干涉效应的传感器节点定位算法。该方法仅需要利用节点的硬件设备,不需要增加额外的测量设备,各个节点独立进行自身位置估计,实现分布式定位。首先在传感器网络中设置若干个位置已知的网关锚节点和参考接收节点,不同位置两个网关锚节点在某个时隙内发射单音信号,就会在整个定位区域内形成一个干涉效应场。而各个待定位节点通过测量接收的到的干涉信号振动周期数就可以得到自身与各个网关节点距离差。通过多组锚节点分时隙发射单音信号,并配合参考接收节点,通过双曲线定位算法得到自身的坐标。通过对算法进行仿真分析,验证了算法的可行性。     

移动混合传感网中节点自主部署算法

针对节点感知半径不均衡的移动传感网络节点的部署问题,论文提出一种基于VL(Voronoi Laguerre)图分割的节点自主部署算法(Autonomous Deployment Algorithm, ADA)。ADA先对目标区域做VL图划分,将目标区域的覆盖任务在各个传感器节点之间进行分配。分配到覆盖子区间任务的节点通过构造VL受控多边形来确定下一轮候选目标位置。未分配到覆盖子区间的节点则根据自身与邻居节点感知圆及目标区域边界的几何位置关系计算所受虚拟力,最终确定下一轮目标点坐标。网络各个节点通过逐轮更新自身位置,从而提高网络覆盖。仿真结果表明,ADA算法在网络覆盖率、节点部署速度和节点分布均匀性等方面具有明显的优势。     

基于室内无线传感器网络射频信号的老年人跌倒检测研究

利用无线信号的自然衰减,在不显著增加通信开销的基础上,提出了一种新的老年人跌倒行为的检测方法.给出阶段相关性这一概念并用以区分体域传感器网络节点与室内传感器网络节点信号在人运动与静止条件下的统计相关性.给出了最小通信决策集合的概念,通过对比最小通信决策集合的内容,提出了老年人位置估计方法和跌倒行为检测算法;利用仿真工具...     

一种面向三维感知的无线多媒体传感器网络覆盖增强算法

 覆盖作为无线传感器网络中的基础问题直接反映了网络感知服务质量.本文在分析现有无线多媒体传感器网络覆盖增强算法的基础上,构建节点三维感知模型,提出面向三维感知的多媒体传感器网络覆盖增强算法(Three-Dimensional Perception Based Coverage-Enhancing Algorithm,TDPCA).该算法将节点主感知方向划分为仰俯角和偏向角,并根据节点自身位置及监测区域计算并调整各节点最佳仰俯角,在此基础上基于粒子群优化调整节点偏向角,从而有效减少节点感知重叠区及感知盲区,最终实现监测场景的区域覆盖增强.仿真实验表明:对比已有的覆盖增强算法,TDPCA可有效降低除节点感知重叠区和盲区,最终实现网络的高效覆盖.     

Communication Coverage in Wireless Passive Sensor Networks

System lifetime of wireless sensor networks (WSN) is inversely proportional to the energy consumed by critically energy-constrained sensor nodes during RF transmission. In that regard, modulated backscattering (MB) is a promising design choice, in which sensor nodes send their data just by switching their antenna impedance and reflecting the incident signal coming from an RF source. Hence, wireless passive sensor networks (WPSN) designed to operate using MB do not have the lifetime constraints of conventional WSN. However, the communication performance of WPSN is directly related to the RF coverage provided over the field the passive sensor nodes are deployed. In this letter, RF communication coverage in WPSN is analytically investigated. The required number of RF sources to obtain interference-free communication connectivity with the WPSN nodes is determined and analyzed in terms of output power and the transmission frequency of RF sources, network size, RF source and WPSN node characteristics.     

移动传感器网络非均匀事件区域节点部署优化

针对移动传感器网络中热点事件监测场景,研究传感器节点的快速优化部署策略.首先假定事件随机产生,针对事件优先模型及节点感知误差函数推导基于Voronoi剖分时感知误差最小,然后定义节点有效覆盖权值,证明了当所有节点有效覆盖权值一致时,整个网络覆盖效能将达到最大.结合虚拟力及节点有效覆盖权提出一种分布式优化部署算法SDOA(Sparse Deployment Optimization Algorithm),其在保证覆盖能效最大化时保证网络连通性.最后仿真比较了本文提出部署策略能够快速有效实现对热点区域部署,并保证较高的覆盖效能.     

Effective sensor deployment based on field information coverage in precision agriculture

Coverage is an importance issue in wireless sensor networks. In this work, we first propose a novel notion of information coverage, which refers to the coverage efficiency of field information covered by deployed sensor nodes. On the basis of information coverage, we consider an optimization problem of how to partition the given field into multiple parcels and to deploy sensor nodes in some selected parcels such that the field information covered by the deployed sensor nodes meets the requirement. First, we develop two effective polynomial‐time algorithms to determine the deployed locations of source nodes for information 1‐coverage and q‐coverage of the field, respectively, without consideration of communication, where information q‐coverage implies that the field information in terms of information point is covered by at least q source nodes. Also, we prove the upper bound in the theoretical for the approximate solution derived by our proposed method. Second, another polynomial‐time algorithm is presented for deriving the deployed locations of relay nodes. In the theoretical, this proposed algorithm can achieve the minimized number of relay nodes. Further, the related information 1‐coverage algorithms are applied in our wireless sensor network‐based automatic irrigation project in precision agriculture. Experimental results show the major trade‐offs of impact factors in sensor deployment and significant performance improvements achieved by our proposed method. Copyright © 2013 John Wiley & Sons, Ltd.     

Impact of Interference on Coverage in Wireless Sensor Networks

The quality of surveillance is dependent on the sensing coverage of a wireless sensor network. In the present paper, we examine how interference affects the coverage of a wireless sensor network. The coverage fraction and required number of sensors for randomly deployed and well-planned deployed wireless sensor networks in the presence of interferers are computed. The required number of sensors to achieve higher level of coverage increases drastically for randomly distributed sensor nodes where the interference effect is high. In the case of well-planned distributed sensor network, required sensors increases linearly as interference effects become more pronounced. Algorithms for computing the required number of sensors to obtain the desired level of coverage in the presence of non-uniform interference is presented. The simulation results suggest that the coverage per subregion and coverage per sensor approaches towards, the improvement achieved is constant. The sensor saving ratio is independent of the level of the desired coverage provided the coverage per subregion is larger than or equal to the coverage per sensor.     

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.     

传感器网络中基于数据融合的栅栏覆盖控制研究

该文采用概率性感知模型,并利用数据融合技术构造虚拟节点来增加节点覆盖区域。在此基础上,提出一种栅栏覆盖控制算法。算法借助分治法构造栅栏,以减少节点间通信开销;并调度传感器使冗余节点睡眠,达到减少能耗和延长网络寿命的目的。分析和实验结果表明,针对所提问题设计的模型和算法可有效增加节点覆盖范围及节点间最大间隔距离,且在栅栏数、网络寿命等性能上均优于基于节点监测数据未融合的栅栏覆盖控制算法。     

基于网络编码的延迟容忍移动传感器网络低时延广播传输机制

针对延迟容忍移动传感器网络(Delay Tolerant Mobile Sensor Networks, DTMSN)提出一种基于网络编码的广播传输机制 (Netcoding-based Broadcast Transmission scheme, NBT)。NBT中,基站(Base Station, BS)将原始数据分批进行传输,每个批次包含的原始数据包的数量一定;BS将同一批次数据包以单播方式传输给不同传感器节点时采用的编码向量互不相关,传感器节点之间采用泛洪的机制交换彼此缺少的编码数据包。由于BS对原始数据包进行了编码,因此传感器节点具有相同编码数据包的可能性大大降低,从而减小了节点间的数据相关度,有效降低了广播时延。在随机路点移动模型(Random WayPoint, RWP)下的仿真结果表明,与目前广播时延最小的泛洪机制相比,NBT能够在通信开销基本相同的情况下有效降低广播传输时延。     

基于冗余节点休眠和分阶段唤醒策略的传感器网络三维覆盖控制方法

该文针对无线传感器网络中节点能量有限且密集布点时存在大量冗余节点的情况,提出了基于冗余节点休眠和分阶段唤醒策略的无线传感器网络3维覆盖控制方法。在3维待监测区域中随机配置大量传感器节点,达到高密度分布,使冗余节点处于休眠状态,等待活跃节点能量耗尽之后,分阶段唤醒休眠节点,直至整个传感器网络中所有节点的能量都耗尽为止。仿真结果表明,该方法提高了传感器网络的网络性能,且对相同的传感器节点数,分阶段唤醒策略优于不分阶段的唤醒策略,先使冗余节点休眠之后再唤醒方法的网络性能高于直接唤醒方法的网络性能。     

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.