By Topic

Broadcast scheduling in packet radio networks using mixed tabu-greedy algorithm

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 $31
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

3 Author(s)
Peng, Y. ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore ; Soong, B.H. ; Wang, L.

A two-step algorithm to solve the broadcast scheduling problem is presented. The first step employs finding a solution that has a transmission time slot for each station, while the second step attempts to maximise the throughput. Numerical examples that demonstrate the algorithm outperforms existing ones in terms of channel utilisation and packet delay are presented.

Published in:

Electronics Letters  (Volume:40 ,  Issue: 6 )