Abstract
We investigate scheduling problems associated with radio networks using models based on graphs. Scheduling in networks is typically solved using graph coloring algorithms. In many cases the coloring algorithms are based on simplifying assumptions about the network structure. We show the limitations of the current models and propose modifications. The current models do not address the non-uniform transceiver/transmitter networks and they over-restrict transceiver interconnections. We develop algorithms which are more specific to the domain of radio network scheduling. We compare the performance of the earlier algorithms to our algorithms. The results are analyzed with respect to both execution time and quality of solution for networks of various sizes and densities.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings - IEEE Military Communications Conference MILCOM |
| Place of Publication | Piscataway, NJ, United States |
| Publisher | IEEE |
| Pages | 647-651 |
| Number of pages | 5 |
| Volume | 2 |
| State | Published - 1995 |
| Event | Proceedings of the 1995 Military Communications Conference (MILCOM). Part 1 (of 3) - San Diego, CA, USA Duration: Nov 5 1995 → Nov 8 1995 |
Other
| Other | Proceedings of the 1995 Military Communications Conference (MILCOM). Part 1 (of 3) |
|---|---|
| City | San Diego, CA, USA |
| Period | 11/5/95 → 11/8/95 |
ASJC Scopus subject areas
- Civil and Structural Engineering
- Electrical and Electronic Engineering