A Combination Scheme of Topology Control and Channel Assignment in Wireless Ad Hoc Networks

Topology control and channel assignment are two important methods to improve the performance of wireless ad hoc networks. In this paper, we investigate such a combination scheme composed of a k -Neighbor topology control algorithm and a greedy channel assignment (GCA) algorithm. Based on this combination scheme, we discuss the impact of some parameters on the performance of networks in terms of the path loss factor, node density, maximum node degree, etc. Simulation results will show that such a combination 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 2 k + 1.