TY - JOUR
T1 - LTRT
T2 - An efficient and reliable topology control algorithm for ad-hoc networks
AU - Miyao, Kenji
AU - Nakayama, Hidehisa
AU - Ansari, Nirwan
AU - Kato, Nei
N1 - Funding Information:
This work was supported through the International Communications Research Grant (A Study on Reliable Ad hoc Networks, 2009), International Communications Foundation (ICF).
PY - 2009/12
Y1 - 2009/12
N2 - 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.
AB - 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.
KW - Ad-hoc networks, topology control, reliability, minimum spanning tree, κ-edge connectivity
UR - http://www.scopus.com/inward/record.url?scp=73049113967&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=73049113967&partnerID=8YFLogxK
U2 - 10.1109/TWC.2009.12.090073
DO - 10.1109/TWC.2009.12.090073
M3 - Article
AN - SCOPUS:73049113967
SN - 1536-1276
VL - 8
SP - 6050
EP - 6058
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 12
M1 - 5351723
ER -