By Topic

Broadcast scheduling algorithms for radio networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Huson, M.L. ; Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA ; Sen, A.

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 nonuniform 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

Published in:

Military Communications Conference, 1995. MILCOM '95, Conference Record, IEEE  (Volume:2 )

Date of Conference:

7 Nov 1995