Link scheduling directed graphs using undirected edge colours
Communication in a wireless network is typically modeled as either a directed or an undirected communication graph. Link scheduling is the problem of assigning time slots to each edge so that communication on every edge at its assigned time may occur without interference. Interference is also modele...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
University of British Columbia
2012
|
| Online Access: | http://hdl.handle.net/2429/42329 |