Fair spatial TDMA channel access protocols for multihop radio networks

1 January 1991

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

Vol. com 29, 1064-1073 vol.3
https://doi.org/10.1109/infcom.1991.147622

Abstract

The issues of fairness are considered in designing time division multiple access (TDMA) channel access protocols for multihop radio networks. It is shown that there is a limitation as to how fair one can design a channel access protocol for a static multihop radio network. Several fairness measures which are functions of the channel access protocol and the network topology are proposed. It is shown that to find the optimal protocol with respect to any defined fairness measure is NP-hard. Criteria for designing a fair protocol which are independent of the network topology are introduced and their properties are proved. A lower upper bound of one of the measures is found. Two heuristic protocols are developed based on these criteria. Performance comparisons with existing protocols are given.

Keywords

This publication has 11 references indexed in Scilit:

Tree-Based Broadcasting in Multihop Radio Networks
IEEE Transactions on Computers, 1987
Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network
IEEE Transactions on Computers, 1987
On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
IEEE Transactions on Communications, 1985
Spatial TDMA: A Collision-Free Multihop Channel Access Protocol
IEEE Transactions on Communications, 1985
Some complexity results about packet radio networks (Corresp.)
IEEE Transactions on Information Theory, 1984
On the np-completeness of certain network testing problems
Networks, 1984
Radio Local Distribution System for High-Speed Digital Communications
IEEE Journal on Selected Areas in Communications, 1983
Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology
IEEE Transactions on Communications, 1981
Packet Switching in Radio Channels: New Conflict-Free Multiple Access Schemes
IEEE Transactions on Communications, 1980
Graph Theory with Applications
Published by Springer Nature ,1976