Distributed topology control algorithm based on one- and two-hop neighbors' information for ad hoc networks

  • Authors:
  • Mehdi Kadivar;M. E. Shiri;Mehdi Dehghan

  • Affiliations:
  • Department of Mathematics and Computer Science, Amirkabir University of Technology, No. 424, Hafez Ave., Tehran, Iran;Department of Mathematics and Computer Science, Amirkabir University of Technology, No. 424, Hafez Ave., Tehran, Iran;Department of Computer Engineering and Information Technology, Amirkabir University of Technology, No. 424, Hafez Ave., Tehran, Iran

  • Venue:
  • Computer Communications
  • Year:
  • 2009

Quantified Score

Hi-index 0.24

Visualization

Abstract

In this paper, we present a topology control algorithm for ad hoc networks. By considering the weight of the links, each node orders its one-hop neighbors in an ordered list and then the ordered lists are exchanged between the neighbors. This information enables the nodes to compute their transmission radius on the basis of its one- and two-hop neighbors' information. We demonstrate that compared to the best known algorithms, the degree and transmission radius of the nodes in the topology produced by the proposed algorithm are smaller. In addition to Euclidean graphs, the algorithm works correctly on general weighted graphs. Also an extension of our algorithm is proposed which adapts its topology to network changes. Finally, we use the four metrics, node degree, transmission radius, the power stretch factor and, packet loss ratio to measure the performance improvements of the presented algorithms through simulations.