论文标题
无线临时和传感器网络中基于运动的连接恢复问题的分析
Analysis of Movement-Based Connectivity Restoration Problem in Wireless Ad-Hoc and Sensor Networks
论文作者
论文摘要
拓扑控制，包括拓扑结构和维护阶段，是任何形式的无线临时网络的重要概念，明确是无线传感器网络（WSN）。拓扑维护，后一个阶段涉及几个问题，例如优化能耗，提高数据速率，使集群和维持连接性。除其他策略外，可以使用基于运动的连接恢复（MCR）方法再次连接断开的网络，其中相应数量的节点移动（或移动）到所需的位置。但是，找到将节点移动的最佳途径可能是一个巨大的问题。事实上，本文通过使用最小的施泰纳点和有界的边缘长度减少了良好的施泰纳树问题，介绍了有关MCR问题NP问题的直接证明。
Topology control, including topology construction and maintenance phases, is a vital conception for wireless ad-hoc networks of any kind, expressly the wireless sensor networks (WSN). Topology maintenance, the latter phase, concerns several problems, such as optimizing the energy consumption, increasing the data rate, making clusters, and sustaining the connectivity. A disconnected network, among other strategies, can efficiently be connected again using a Movement-based Connectivity Restoration (MCR) method, where a commensurate number of nodes move (or are moved) to the desired positions. However, finding an optimal route for the nodes to be moved can be a formidable problem. As a matter of fact, this paper presents details regarding a direct proof of the NP-Completeness of the MCR Problem by a reduction of the well-studied Steiner Tree Problem using the minimum number of Steiner points and the bounded edge length.
