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

Kenji Miyao, Hidehisa Nakayama, Nirwan Ansari, Nei Kato

Research output: Contribution to journalArticlepeer-review

78 Scopus citations


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.

Original languageEnglish (US)
Article number5351723
Pages (from-to)6050-6058
Number of pages9
JournalIEEE Transactions on Wireless Communications
Issue number12
StatePublished - Dec 2009

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics


  • Ad-hoc networks, topology control, reliability, minimum spanning tree, κ-edge connectivity


Dive into the research topics of 'LTRT: An efficient and reliable topology control algorithm for ad-hoc networks'. Together they form a unique fingerprint.

Cite this