LTRT: An efficient and reliable topology control algorithm for ad-hoc networks

Kenji Miyao, Hidehisa Nakayama, Nirwan Ansari, Nei Kato

研究成果: Article査読

73 被引用数 (Scopus)

抄録

Broadcasting, in the context of ad-hoc networks, is a costly operation, and thus topology control has been proposed to achieve efficient broadcasting with low interference and low energy consumption. By topology control, each node optimizes its transmission power by maintaining network connectivity in a localized manner. Local Minimum Spanning Tree (LMST) is the state-of-the-art topology control algorithm, which has been proven to provide satisfactory performance. However, LMST almost always results in a 1-connected network, without redundancy to tolerate external factors. In this paper, we propose Local Tree-based Reliable Topology (LTRT), which is mathematically proven to guarantee κ-edge connectivity while preserving the features of LMST. LTRT can be easily constructed with a low computational complexity of O(κ(m + n log n)), where κ is theconnectivity of the resulting topology, n is the number of neighboring nodes, and m is the number of edges. Simulation results have demonstrated the efficiency of LTRT and its superiority over other localized algorithms.

本文言語English
論文番号5351723
ページ(範囲)6050-6058
ページ数9
ジャーナルIEEE Transactions on Wireless Communications
8
12
DOI
出版ステータスPublished - 2009 12

ASJC Scopus subject areas

  • コンピュータ サイエンスの応用
  • 電子工学および電気工学
  • 応用数学

フィンガープリント

「LTRT: An efficient and reliable topology control algorithm for ad-hoc networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル