Prioritized Repeated Eliminations Multiple Access: A Novel Protocol for Wireless Networks

A new and simple MAC protocol is proposed. Each node transmits a burst with length sampled from a geometric distribution with parameter q followed by a carrier sense slot. A node repeats the previous operations until it senses a busy slot. A node will access the channel and transmit its payload when...

Full description

Saved in:
Bibliographic Details
Main Authors: Wikstrand, G., Nilsson, T., Dougherty, M.S.
Format: Book Chapter
Language:English
Subjects:
Access protocols
Communications Society
Computational modeling
Computer networks
Computer science
Media Access Protocol
Multiaccess communication
Peer to peer computing
Wireless application protocol
Wireless networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A new and simple MAC protocol is proposed. Each node transmits a burst with length sampled from a geometric distribution with parameter q followed by a carrier sense slot. A node repeats the previous operations until it senses a busy slot. A node will access the channel and transmit its payload when it has sensed h idle slots. The parameter q can be adjusted for each node to achieve desired levels of relative priority with little impact on channel utilization and without a need for explicit knowledge about other traffic. Comparison to existing tree-splitting, carrier sensing and bursting protocols through analysis and simulations shows that our algorithm scales very well to the number of nodes. It has very high success probability, channel utilization and fairness. Extensions are provided for hidden terminal scenarios and are shown in simulations to provide adequate performance.
ISSN:0743-166X
2641-9874
DOI:10.1109/INFOCOM.2008.216