New graph model for channel assignment in ad hoc wireless networks
Citations Over Time
Abstract
The channel assignment problem in ad hoc wireless networks is investigated. The problem is to assign channels to hosts in such a way that interference among hosts is eliminated and the total number of channels is minimised. Interference is caused by direct collisions from hosts that can hear each other or indirect collisions from hosts that cannot hear each other, but simultaneously transmit to the same destination. A new class of disk graphs (FDD: interFerence Double Disk graphs) is proposed that include both kinds of interference edges. Channel assignment in wireless networks is a vertex colouring problem in FDD graphs. It is shown that vertex colouring in FDD graphs is NP-complete and the chromatic number of an FDD graph is bounded by its clique number times a constant. A polynomial time approximation algorithm is presented for channel assignment and an upper bound 14 on its performance ratio is obtained. Results from a simulation study reveal that the new graph model can provide a more accurate estimation of the number of channels required for collision avoidance than previous models.
Related Papers
- → Capacitated Reliability for Ad-hoc Networks(2007)4 cited
- → A local algorithm for dominating sets of quasi-unit disk graphs(2009)1 cited
- → CDS in Unit Disk Graph(2012)
- Axes-parallel unit disk graph recognition is NP-hard.(2018)
- → On embeddability of unit disk graphs onto straight lines(2018)