In the broadcast schedule construction problem in a radio network, a frame of minimum length provides every transceiver an opportunity for transmission after least amount delay. However, such a frame does not necessarily maximize the network throughput. The network throughput can be increased by choosing a frame of suboptimal length, although in this situation the throughput of some of the individual transceivers might decrease. We present a schedule construction scheme that takes into account the interests of the network as well as the individual transceivers and finds a balance between the two conflicting interests. The objective of this scheme is to maximize the network throughput without a significant adverse impact on the performance of individual transceivers. This scheme guarantees a network throughput that is at least as large as in the traditional scheduling schemes using the minimum length frame.
[1]
Subramanian Ramanathan,et al.
Scheduling algorithms for multi-hop radio networks
,
1992,
SIGCOMM 1992.
[2]
Arunabha Sen,et al.
A new model for scheduling packet radio networks
,
1997,
Wirel. Networks.
[3]
Subramanian Ramanathan,et al.
Scheduling algorithms for multihop radio networks
,
1993,
TNET.
[4]
Bruce E. Hajek,et al.
Link scheduling in polynomial time
,
1988,
IEEE Trans. Inf. Theory.
[5]
Arunabha Sen,et al.
A new model for scheduling packet radio networks
,
1996,
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.