【作者】 汪学清；

【导师】 杨永田；

【作者基本信息】 哈尔滨工程大学 ， 计算机应用技术， 2006， 博士

【摘要】 20世纪90年代以来，随着无线通信、嵌入式计算和传感器及微机电系统(MEMS)等技术的快速发展，具有感知能力、计算能力和无线网络通信能力的微型传感器以及由其构成的无线传感器网络(WSN)引起了人们的极大关注。本文主要研究了WSN的连通、覆盖以及节点布置问题。 传感器节点的数量直接关系到整个WSN的成本及性能，如鲁棒性、容错性等，这也是WSN设计时首先要考虑的问题。本文通过对WSN覆盖问题的分析，提出了节点的有效覆盖面积和有效覆盖面积率的概念，并通过数学建模、理论分析和公式推导，从理论上证明了在WSN中，满足完全无缝覆盖条件的节点最大有效覆盖面积及其最大有效覆盖面积率，节点的净最大有效覆盖面积及其净最大有效覆盖面积率。最后，得出了在一个给定探测区域内，实现完全无缝覆盖至少需要多少个节点的解析式。 在WSN中，为了便于对网络的分级管理、节约能量以及便于实现可扩展性，把整个WSN网络进行分簇已经被证明是一个行之有效的方法。本文通过把复杂的连通问题逐步化简，并利用理论分析、数学建模和几何证明，采用几何学和数学归纳法的思想，给出了传感器区域连通问题的一种网格划分方法，从理论上给出了在一个实现完全无缝连通的传感器区域内最少需要多少簇首的解析式。进而本文又把无线传感器网络的连通问题和覆盖问题进行综合考虑，建立了统一的数学模型，提出了传感器区域连通与覆盖问题的一种网格划分方法。通过对传感器区域进行网格划分，得出了无线传感器网络至少需要划分成多少个簇和至少需要多少个节点才能实现完全无缝连通和完全无缝覆盖的解析式。在此基础上，研究了无线传感器网络的节点布置算法，并将影响通信协议的设计。 传感器节点的布置方法很大程度上将影响WSN的性能和效率。为节省能量，只选择一部分节点工作而另一部分节点休眠。此问题可被描述为图的连通支配集(CDS)，而且对于任意图的最小连通支配集(MCDS)是一个NP难问题。传感器的布置方式有两种即确定性的和自组织的。通过分析两种布置方更多还原

【Abstract】 Since 1990s, along with technique development of wireless communication, embedded computation, sensor and MEMS (Micro-ElectroMechanical Systems) et al, people have paid more attention to micro sensor with the capability of sensing, computing and wireless network communication, and WSN(Wireless Sensor Networks) that is made up of such sensors. This thesis researches on the problems of connectivity, coverage and sensor deployment in the WSN.In wireless sensor networks, the number of sensor nodes has direct relation to WSN’s cost and performance, such as robustness, fault-tolerance. And furthermore, it is considered at first as WSN is designed. Analyzing the coverage problem of WSN, the thesis proposes the concepts of efficient coverage area and efficient coverage area ratio. It is theoretically proved through math modeling, theoretical analysis and formula deducting that how much the maximum of efficient coverage area, the maximum of efficient coverage area ratio, the maximum of net efficient coverage area and the maximum of net efficient coverage area ratio of sensor node is if full and seamless coverage is met in WSN. At last, the analysis formula is given that minimum number of sensor nodes is demanded in a given sensor field if the field is covered fully and seamlessly.In order to conveniently manage a network by different levels, save energy and implement scalability, WSN forms into clusters in wireless sensor networks and it is proved that clustering WSN is an effective method. The thesis simplifies complex connectivity problem step by step. By means of theoretical analysis, math modeling and geometry proving, and making use of geometry and the method of mathematics induction, the method of grid partition of sensor field is proposed from the viewpoints of topology. In the end, the analysis formula of minimum number of cluster heads is theoretically educed under circumstances of full and seamless connectivity in wireless sensor networks. Still further, the thesis synthetically considers the problem of connectivity and coverage in wireless更多还原