By Topic

Fair and efficient transmission scheduling in multihop packet 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)
Hung, K.-W. ; Dept. of Comput., Hong Kong Polytech., Kowloon, Hong Kong ; Yum, T.-S.

A scheduling algorithm for packet transmission is designed for multihop packet radio networks. The design objective is to have a schedule with minimum cycle length, maximum network throughput and fair allocation of transmission capacities among all stations. For comparison with other scheduling algorithms in the literature the following performance measures for scheduling algorithms are derived: (1) the cycle length, (2) the scheduling delay, (3) the minimum transmission capacity and (4) the normalized network capacity. The new algorithm is found to give schedules that have (1) the shortest cycle length, (2) the smallest scheduling delay, (3) the largest minimum transmission capacity and (4) the same normalized network capacity as two of the best scheduling algorithms in the literature

Published in:

Global Telecommunications Conference, 1992. Conference Record., GLOBECOM '92. Communication for Global Users., IEEE

Date of Conference:

6-9 Dec 1992