By Topic

Prioritized Repeated Eliminations Multiple Access: A Novel Protocol for Wireless 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

3 Author(s)
Wikstrand, G. ; YAHM Sweden AB, Lund ; Nilsson, T. ; Dougherty, M.S.

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.

Published in:

INFOCOM 2008. The 27th Conference on Computer Communications. IEEE

Date of Conference:

13-18 April 2008