Joint processing of topology control and channel assignment in wireless ad hoc networks

  • Authors:
  • Wei Li;Pingyi Fan;K. B. Letaief

  • Affiliations:
  • Department of Electronic Engineering, Tsinghua University, Beijing, P.R. China;Department of Electronic Engineering, Tsinghua University, Beijing, P.R. China;Department of Electronic and Computer Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong

  • Venue:
  • Wireless Communications & Mobile Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Network topology construction and its channel assignment for each node in the constructed network topology are two main problems in the initialization of topology building. Topology control is an effective way to solve the problem of topology building. To investigate the joint effect of topology control and channel assignment, we propose a joint processing scheme composed of a k-Neighbor topology control algorithm and a greedy channel assignment (GCA) algorithm in this paper. Based on this joint processing scheme, the relationships between the energy consumption, the total required channel number and the network connectivity are discussed. We also discuss the impact of some parameters on the performance of networks in terms of the path loss factor, node density, maximum node degree, etc. Our main contributions in this paper is that we find that topology control has a good effect on improving the performance of channel assignment, and the proposed joint processing scheme can reduce the required channel number effectively, compared with its theoretical upper bound. In particular, if the node degree in a network is not more than k, various simulations indicate that the required channel number is not more than 2k + 1. Copyright © 2008 John Wiley & Sons, Ltd.