An SPT-based topology control algorithm for wireless ad hoc networks

  • Wang S
  • Wei D
  • Kuo S
  • 7


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


In this paper, we present a localized Shortest-Path-Tree (SPT) based algorithm that copes with the topology control problem in wireless ad hoc networks. Each mobile node determines its own transmission power based only on its local information. The proposed algorithm first constructs local SPTs from the initial graph, after which the total power consumption is further reduced by allowing each mobile node to search the replaceable links individually. The constructed topology ensures network connectivity, and possesses the following desirable energy-efficient features: (i) the power stretch factor is bounded and can be predetermined, (ii) the power consumption is evenly distributed among the mobile nodes, and (iii) the total power consumption is lower than that obtained by the best known algorithms. The performance improvements of the proposed algorithm are demonstrated through extensive simulations. We conclude our work with a discussion of future research directions toward more integrated mobile network architectures.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Szu-Chi Wang

  • David S.L. Wei

  • Sy-Yen Kuo

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free