A distributed queueing random access protocol for a broadcast channel
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Floor acquisition multiple access with collision resolution
MobiCom '96 Proceedings of the 2nd annual international conference on Mobile computing and networking
Collision avoidance and resolution multiple access (CARMA)
Cluster Computing
A review of contention resolution algorithms for IEEE 802.14 networks
IEEE Communications Surveys & Tutorials
On IEEE 802.14 medium access control protocol
IEEE Communications Surveys & Tutorials
Medium access control protocols performance in satellite communications
IEEE Communications Magazine
IEEE/ACM Transactions on Networking (TON)
Flexible access for a space communications network with IP functionality
Computer Networks and ISDN Systems - Interplanetary internet
Predictive Multicast Polling for Wireless Networks with Multipacket Reception and Queuing
IEEE Transactions on Mobile Computing
Counter-intuitive throughput behaviors in networks under end-to-end control
IEEE/ACM Transactions on Networking (TON)
Unifying view on min-max fairness, max-min fairness, and utility optimization incellular networks
EURASIP Journal on Wireless Communications and Networking
To be fair or efficient or a bit of both
Computers and Operations Research
Flexible access for a space communications network with IP functionality
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multiresource allocation: fairness-efficiency tradeoffs in a unifying framework
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |
Channel access has been an active research area for the past two decades. Several protocols have been proposed in literature to efficiently utilize the channel bandwidth. Some of the recently proposed protocols achieve a near-ideal channel utilization. However, the efficiency in utilization comes at the expense of certain unfairness in delay characteristics. In this paper, a new channel-access protocol, called access mechanism for efficient sharing in broadcast medium networks (AMES-BM), is developed based on a deterministic binary tree-splitting technique to achieve efficient sharing of bandwidth. In AMES-BM, the stations are dynamically mapped to leaf nodes of a binary tree. The stations are then divided into smaller groups that mimic the behavior of an ideal transmission queue. Collisions are allowed to occur within these groups and are resolved using a variation of the conventional binary tree-splitting technique.The performance of AMES-BM is similar to that of a collisionbased protocol under low loads and to that of a collision-free protocol under high loads. Besides achieving a near-optimal channel utilization, the proposed protocol also guarantees fairness with respect to delay for messages of varying lengths. The deterministic nature of the protocol makes it more attractive for real-time applications.