基于中继增强的无线传感器网络生命周期延长
Relay Augmentation for Lifetime Extension of Wireless Sensor Networks
摘要：
我们提出了一种新的中继增强策略，以延长某类无线传感器网络的生命周期。在这类传感器位于固定和预定的位置和所有的通信发生在一个固定的路由树植根于基站通过多跳路径。假设沿着通信路径不发生数据累积，并且对附加中继器可以位于何处没有限制。在这些假设下，网络生命周期的最佳延长建模为欧几里德$k$瓶颈Steiner树问题。只有两个近似算法，这个NP难问题存在于文献中：最小生成树启发式（MSTH）的性能比2，和概率3-正则超图启发式（3RHH）的性能比$\sqrt{3}+ε$。我们提出了一个新的迭代启发式，结合MSTH和模拟表明，我们的算法比MSTH在延长生命周期，并优于3RHH的效率。
英文摘要：
We propose a novel relay augmentation strategy for extending the lifetime of a certain class of wireless sensor networks. In this class sensors are located at fixed and pre-determined positions and all communication takes place via multi-hop paths in a fixed routing tree rooted at the base station. It is assumed that no accumulation of data takes place along the communication paths and that there is no restriction on where additional relays may be located. Under these assumptions the optimal extension of network lifetime is modelled as the Euclidean $k$-bottleneck Steiner tree problem. Only two approximation algorithms for this NP-hard problem exist in the literature: a minimum spanning tree heuristic (MSTH) with performance ratio 2, and a probabilistic 3-regular hypergraph heuristic (3RHH) with performance ratio $\sqrt{3}+ε$. We present a new iterative heuristic that incorporates MSTH and show via simulation that our algorithm performs better than MSTH in extending lifetime, and outperforms 3RHH in terms of efficiency.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
