基于干扰模型的无线多跳网络覆盖关键技术研究

With the rapid wireless communication technology advances, wireless multihop networks have taken the latest consideration in the current scientists. In wireless multihop networks, the efficient network sensing area coverage and topology control are the major issues. Traditionally, the obejective of coverage problems in wireless multihop networks is to find a minimum set of nodes to maintain the coverage by the capacity of their sensing range. Indeed, it constructs a minimum nodes' coverage, but lack of considering the minimum nodes' conectivity during transmission. In this project, according to the previous research on the minimum connected nodes coverage problem, we focus on the coverage problems with the consideration on the connectivity and latency scheduling. Theoretically, the project focuses on the design of satisfaction on both coverage and connectivity algorithms in wireless multihop networks. It will consider from the theoretical model to pratical model. And we try to make the break through in the minimum connected nodes coverage and minimum connected latency nodes coverage algorithm design.

随着无线通信科技的进步，无线多跳网络成为目前科学家所关注的一个核心问题。在无线多跳网络中，高效网络监测区域的覆盖和拓扑控制是无线多跳网络的关键性问题之一。 传统的无线多跳网络覆盖问题，是单一的以参考监测半径来设计最小结点覆盖为目标的。虽然创建了最小的结点覆盖结构，却忽视了构建结点的连通性问题即最小结点连通。本项目针对这一问题，基于前期对满足最小结点覆盖且满足结点传输的连通性的研究基础上，对于满足覆盖且满足无干扰的连通性、延迟调度等问题进行深入的研究。 理论上, 本项目致力于设计满足覆盖和连通等问题的无线多跳网络算法, 从理论模型向实际模型转化, 在设计满足覆盖的无干扰的结点连通性和延迟调度算法方面取得突破.

随着无线通信科技的进步，无线多跳网络成为目前科学家所关注的一个核心问题。在无线多跳网络中，高效网络监测区域的覆盖和拓扑控制是无线多跳网络的关键性问题之一。传统的无线多跳网络覆盖问题，是单一的以参考监测半径来设计最小结点覆盖为目标的。虽然创建了最小的结点覆盖结构，却忽视了构建结点的连通性问题即最小结点连通。本项目针对这一问题，主要研究了最大独立集，以及双向连通支配集的构建问题，以及无线多跳网络的不完美栅栏覆盖算法设计、无干扰的栅栏覆盖算法设计、移动传感器节点的扫描覆盖算法设计等一系列问题，在设计上力图满足覆盖的无干扰的节点能量和延迟调度算法方面取得突破.