与位置无关的无线传感器网络连通性覆盖协议

解决在没有节点位置信息的情况下,如何能量有效地保证网络连通性覆盖的问题.分析了节点覆盖与区域覆盖之间的关系,并给出了节点覆盖等于区域覆盖的充分必要条件.根据分析结果,基于构建连通支配集CDS(connected dominating set)的Rule K算法,提出了一种与节点位置无关网络连通性覆盖协议LICCP(location-independent connected coverage protocol).在LICCP协议中,每个节点根据本地节点密度选择合适的通信范围,利用Rule K算法选出的工作节点提供高质量的网络连通性覆盖.模拟实验结果表明,LICCP协议能够在较长时间内能量有效地提供高质量的网络覆盖,并保证网络的连通性.

A Location-Independent Connected Coverage Protocol for Wireless Sensor Networks

This paper solves the problem of how to energy-efficiently schedule sensor nodes and meet both constraints of the connected connectivity without accurate location information. Based on the theoretical analysis of the sensing coverage property of the minimal dominating set, the relationship between point coverage and area coverage in geometric graph is established. Based on the analytical results and Rule K algorithm which constructs the connected dominating set, a location-independent connected coverage protocol (LICCP) is proposed. Every sensor node adjusts the appropriate communication range. LICCP can provide the high quality of connected coverage using Rule K algorithm. Extensive simulation results show that the proposed connected coverage protocol can effectively maintain both high quality sensing coverage and connectivity in a long time.