A combination scheme of topology control and channel assignment in wireless ad hoc networks

Wei Li, Pingyi Fan, Khaled Letaief

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

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 2k +1.

Original languageEnglish
Title of host publicationIEEE GLOBECOM 2007 - 2007 IEEE Global Telecommunications Conference, Proceedings
Pages1227-1231
Number of pages5
DOIs
Publication statusPublished - 2007
Externally publishedYes
Event50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007 - Washington, DC, United States
Duration: 26 Nov 200730 Nov 2007

Other

Other50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007
CountryUnited States
CityWashington, DC
Period26/11/0730/11/07

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Li, W., Fan, P., & Letaief, K. (2007). A combination scheme of topology control and channel assignment in wireless ad hoc networks. In IEEE GLOBECOM 2007 - 2007 IEEE Global Telecommunications Conference, Proceedings (pp. 1227-1231). [4411146] https://doi.org/10.1109/GLOCOM.2007.236