## Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 2223-2233 |

Number of pages | 11 |

Journal | Theoretical Computer Science |

Volume | 410 |

Issue number | 21-23 |

DOIs | |

State | Published - 17 May 2009 |

## Keywords

- Channel assignment
- Chromatic numbers
- Clique numbers
- Inductivities
- Maximum scan statistics
- Wireless ad hoc networks