Periphery deployment for wireless sensor systems with guaranteed coverage percentage

With the availability of tiny wireless sensors, it is now possible to track moving objects by placing such sensors on the targets, collecting needed data, and transmitting sensed data back to the sink for storage and analysis. For applications such as vessel clearance surveillance, landslide detection, conveyer monitoring, and body gesture tracking, the motions of the targets are often confined to a certain region, such as the water way or the mountain slope. To collect the data from the wireless sensors, base stations are usually needed, which are deployed at fixed positions around the monitored region. Unfortunately, due to issues such as potential interference, high packaging and deployment cost, and low reliability, many such applications could only deploy the base stations on the periphery of the monitored region. The question is how to deploy the base stations on the periphery so that they can cover the most area inside the monitored area. We formulate the periphery deployment problem and analyze the performance bound in terms of coverage percentage under both ideal and practical deployment conditions. Then, we describe a deployment procedure to solve the periphery deployment problem in polynomial time. The proposed algorithms are evaluated through extensive simulations drawn from a watercourse monitoring system. The results show that the proposed algorithms can reduce the size of the deployment set by 17% compared to the traditional area-coverage algorithms, and the coverage percentage is improved by 1.18 times.     

A survey on coverage and connectivity issues in wireless sensor networks

A wireless sensor network (WSN) is composed of a group of small power-constrained nodes with functions of sensing and communication, which can be scattered over a vast region for the purpose of detecting or monitoring some special events. The first challenge encountered in WSNs is how to cover a monitoring region perfectly. Coverage and connectivity are two of the most fundamental issues in WSNs, which have a great impact on the performance of WSNs. Optimized deployment strategy, sleep scheduling mechanism, and coverage radius cannot only reduce cost, but also extend the network lifetime. In this paper, we classify the coverage problem from different angles, describe the evaluation metrics of coverage control algorithms, analyze the relationship between coverage and connectivity, compare typical simulation tools, and discuss research challenges and existing problems in this area.     

无线传感器网络部分覆盖算法及连通性研究

研究了无线传感器网络在部分覆盖下的节点配置及网络连通性问题。首先,基于最优正六边形拓扑架构,给出了节点密集分布条件下的覆盖率与相邻工作节点间距的解析关系,并在已有的最优完全覆盖算法OGDC的基础上进行了扩展和改进,从而得到了一种新的网络节点配置算法EGDC（Extended OGDC Algorithm）。该算法可以有效地选择出合适的工作节点以达到任意给定覆盖率下的部分覆盖。此外,还给出了一种检验和评价网络连通性的方法,通过该方法可以对网络的连通性进行量化分析,并给出了一项评价网络连通性的指标。仿真表明,EGDC可以有效地实现任意期望覆盖率下的网络配置并保持网络的连通。     

无线传感器网络节点自调度冗余覆盖算法

对于能量受限的无线传感器网络,延长网络存活的时间很关键。针对这个问题,提出了一种基于能量均衡的传感器节点自调度冗余覆盖协议（SRCP）,通过仿真实验对该算法的有关性能进行了评价,性能评价表明：这种算法能有效使用节点能力,延长网络存活时间。     

一种新型无线传感器网络节能覆盖方案

针对一种实际地理环境下的生态监测问题,把拓扑控制中的功率控制思想引入到节能覆盖的研究中,建立感知半径之和最小的数学模型,并用遗传算法求解该模型,得到最优覆盖解。最后,对该方案进行能耗分析和仿真实验,结果表明该算法不仅节能,而且可以获得较高覆盖率,降低信道通讯干扰并提高网络的抗毁性。     

多宿点无线传感器网络时分多址时隙优化分配算法

针对单宿点无线传感器网络的时延大、容易出现传输瓶颈等问题,提出了多宿点无线传感器网络模型以及该模型的基于遗传算法(GA)的时分多址(TDMA)时隙分配算法。该算法根据宿点的数量以及位置将整个传感器网络划分成多个小传感器网络,并采用遗传算法对时隙分配结果进行优化。仿真结果表明,基于遗传算法的多宿点无线传感器网络TDMA时隙分配算法得到的时隙分配结果在时隙分配帧长度、数据包平均时延以及节点平均能耗方面均要优于图着色算法。     

A proportional fairness scheduling for wireless sensor networks

This paper describes a packet scheduling algorithm for wireless sensor networks (WSNs) that meets the proportional fairness principle. Based on the weighted round-robin strategy, the proposed scheduling algorithm allocates a different service quota to different traffic according to the average packet arrival rate. This guarantees proportional fairness in terms of the average packet delivery delay and the average packet loss ratio. Since the scheduling algorithm does not perform high-load operations such as time stamping and sorting, it can be implemented easily and is suitable for resource-limited WSNs. The proposed scheduling algorithm is tested in a WSN and is found to guarantee the proportional fairness of the average packet delivery delay when this is used as the performance metric, and to realize proportional fairness in the average packet loss ratio when all the queues are overflowing and the average packet loss ratio is used as the performance metric.     

Quantifying connectivity in wireless sensor networks with grid-based deployments

Measuring network connectivity under grid-based deployment in 3D space is a challenging problem in wireless sensor networks (WSNs). Solving such a problem becomes an even more intricate task with realistic deployment factors such as placement uncertainty and hindrances to wireless communication channels. While much work has been published on optimizing connectivity, only a few papers have addressed such realistic aspects which cause severe connectivity problems in practice. In this paper, we introduce a novel grid-based deployment metric, called Average Connectivity Percentage in order to characterize the deployed network connectivity when sensor placements are subject to random errors around their corresponding grid locations. A generic approach is proposed to assess and evaluate the proposed metric. This generic approach is independent of the grid-shape, random error distributions, and different environment-based channel characteristics. We apply the generic approach in two practical deployment scenarios: the grid-based deployment with bounded uniform errors and with unbounded normal errors. In both cases, the average connectivity percentage is computed numerically and verified via extensive simulations. Based on the numerical results, quantified effects of positioning errors and grid edge length on the average connectivity percentage are outlined.     

一种无线多媒体传感器网络分区链路调度算法

链路干扰是无线多媒体传感器网络实现大容量、实时、可靠传输的主要困难。为提高多跳传输模式下无线网络性能,基于MAC层的调度算法得到了广泛关注。调度算法为每条链路分配合理的传输时槽,降低了冲突和重传次数,能显著提高网络传输性能。但随着网络规模的增大,无论是集中式还是分布式调度算法,都存在调度开销增大和性能降低的问题。针对这一问题,根据节点分布密度和承载网络流量大小,将网络划分为密集区域和稀疏区域。稀疏区域的节点传输冲突较小,直接采用CSMA的协议。密集区域的节点传输冲突大,采用基于队列长度的分布式调度。分区调度能够有效降低网络规模扩大导致的调度算法复杂性增大的问题。仿真实验表明,分区调度算法无论是在队列长度,还是在延时性能上,较传统算法有明显改善。     

一种连通性覆盖的无线传感器网络节点调度算法

研究传感器节点随机部署于监测区域内,无节点地理位置信息情况下,如何能量有效地保证网络的通信连通与感知覆盖;节点采用基于概率的联合感知模型。提出CDS-based SSCA算法,其为一种基于连通支配集构造树的节点调度机制,每个节点根据剩余能量和与父节点的距离来设置等待时间及成为候选节点优先级。模拟实验结果显示,本算法能够能量有效地满足感知覆盖和连通覆盖要求;与ASW算法相比较,工作节点个数较少,网络生命周期明显延长,降低了网络整体耗能。     

一种无线传感器网络的能量平衡调度算法

在一种位置无关且计算简单的节点调度算法的基础上,提出一种基于能量平衡的调度算法,该算法的目的在于保证整个网络中的大部分节点能量的平衡。分析和仿真结果表明,该算法在保证能量平衡的同时可以延长整个网络的寿命。     

无线传感器网络分簇拓扑的覆盖区域节点调度优化算法研究

利用区域分割的方法建立了一种覆盖区域冗余节点的优化调度机制,实现对完全覆盖区域内冗余节点的休眠调度,并将该机制引入无线传感器网络的分簇结构中,提出一种基于分簇拓扑的节点调度优化算法。算法通过控制簇内冗余节点进行休眠,减少簇首的数据通信量和簇成员中工作的冗余节点个数,降低了网络能耗。仿真结果表明,与未考虑冗余节点休眠调度的分簇算法相比,该算法有效提高了网络能量利用率,延长了网络生命期。     

无线传感器网络单基站调度算法

对于无线传感器网络(WSN)移动基站的调度问题,提出了一种基于线性规划方法的移动单基站调度算法。首先,通过对移动单基站调度问题的形式化描述,对该问题在时间域中进行了数学建模,并使用重建模技术,将问题从时间域转化到空间域以降低求解复杂度,然后基于线性规划理论建立了一个多项式时间复杂度的最优算法。模拟仿真实验验证了该算法的有效性,实验数据表明该移动基站调度算法能有效地延长无线传感器网络的网络生命周期。     

无线传感器网络中一种基于GEAR协议的节点调度策略

基于无线传感器网络地理能量感知路由(GEAR)协议,提出了一种面向查询式路由的节点调度策略GNSS.该策略针对GEAR协议中存在大量空闲节点和冗余节点的能耗问题,根据周期性路由信息,对节点进行角色分类,不同角色的节点执行不同的调度策略.通过节点调度节省了大量能量消耗,同时减少了数据传输量和通信碰撞带来的开销.仿真结果表明:与改进前的GEAR协议相比,该策略使网络生命周期提高了50%以上.     

A cross-layer transmission scheduling scheme for wireless sensor networks

In a wireless sensor network, the sensor nodes are densely deployed for detecting in many cases. One design challenge for such a network is how to devise a good data fusion algorithm for information retrieval. Noting that the channel state information (CSI) between the cluster head and the sensor nodes will influence the received bit energy noise ratio of the sensor nodes, we propose an optimal data fusion algorithm taking into account the CSI for a one-hop clustered wireless sensor network. On the basis of the fusion algorithm, we consider the redundancy of the sensor deployment and propose a cross-layer transmission scheduling scheme. By selecting proper set of sensor nodes to transmit their local information back in turn, the scheme can prolong the lifetime of the sensor network. The numerical and simulation results show that it can get a good tradeoff between the energy efficiency and the performance.     

无线传感器网络的连通性问题研究

无线传感器网络的初始配置最优可以减少传感器网络的拓扑变化和降低网络重置的能量消耗.对初始均匀随机分布的无线传感器网络的连通性进行了研究.运用覆盖理论给出了传感器节点的连通度概率分布模型,并在此模型基础上推导出传感器节点的通信半径与期望连通度概率最大之间的关系.仿真结果表明了结论的正确性.