Maximum scan statistics and channel assignment problems in homogeneous wireless networks

Tsi-Ui Ik*

*此作品的通信作者

    研究成果: Article同行評審

    1 引文 斯高帕斯(Scopus)

    摘要

    In wireless networks, to avoid collisions of simultaneous transmissions over the same channel, adjacent nodes are assigned distinct channels, and the least number of channels used in an assignment is called the chromatic number. The determination of the chromatic number is NP-hard. In this paper, we introduce an analytic tool called maximum scan statistics. For a finite point set V and a convex compact set C, the maximum scan statistic of V with respect to the scanning set C is the largest number of points in V covered by a copy C. Based on the study of asymptotic maximum scan statistics, we obtain the asymptotics of the maximum degree and the clique number of homogeneous wireless networks. The results imply that the chromatic number is almost surely at most four times the clique number. We further prove that the approximation ratios of some vertex-ordering-based First-Fit channel assignment algorithms are almost surely bounded by 2. In the analysis, we also learn that the chromatic number is almost surely at most twice the clique number.

    原文English
    頁(從 - 到)2223-2233
    頁數11
    期刊Theoretical Computer Science
    410
    發行號21-23
    DOIs
    出版狀態Published - 17 五月 2009

    指紋

    深入研究「Maximum scan statistics and channel assignment problems in homogeneous wireless networks」主題。共同形成了獨特的指紋。

    引用此