Topological design of a K-connected communication network

  • Authors:

  • S. Latha;S. K. Srivatsa

  • Affiliations:

  • Department of Electronics Engineering, Madras Institute of Technology, Anna University, Chennai, Tamilnadu, India;Department of Electronics Engineering, Madras Institute of Technology, Anna University, Chennai, Tamilnadu, India

  • Venue:
  • EHAC'07 Proceedings of the 6th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The goal of topological design of a K-Connected wireless communication network is to achieve a specified performance at minimal cost and delay. Unfortunately, the problem is complexity intractable Steiglitz, Winner and Klietman have presented an optimal algorithm for generating a potential network topology. In this paper we present first, an optimal method for generating a K-connected network when the number of nodes is exactly equal to 2K. Secondly, the heuristic begins by numbering the nodes at random. This paper presents a systematic method for numbering the nodes when the nodes (assumed even in number), all lie on a straight line, are equispaced and the connectivity that is sought is even. Assuming that the cost of a link is proportional to its length, the method presented has been found to give the cheapest starting network. When the nodes are numbered in a systematic manner, the potential network topology requires minimum perturbation before an acceptable network is found.