loading...
RRAND: A New Requirement Aware RAND based Flexible Slot Allocation Mechanism Optimized For Spatial Reuse Of Slots
Dublin, Ireland October 15-October 18
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LCN.2007.9532nd IEEE Conference on Local Compute ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Yuvraj Krishna Rana, University of New South Wales, Australia
Sanjay Jha, University of New South Wales, Australia
Schedule based MAC schemes do not perform well for dynamic network and traffic conditions. Their inflexibility makes them unsuitable for most real life applications. This inflexibility is due to the nature of schedule based approach. However, it depends mainly on the re-scheduling and slot allocation strategies employed.

A flexible schedule based scheme should allow for the nodes to access the medium with different periodicity. The periodicity should be based on their traffic requirements which may result in improved channel utilization. However, traditionally used slot allocation protocols, e.g. RAND[1], do not consider the required medium access periodicity while allocating slot to the node. Thus, resulting schemes are not flexible to dynamic traffic conditions. This results in bandwidth wastage. In this paper, we propose a new flexible requirement aware RAND (RRAND) mechanism to allocate slots efficiently. Through simulations we show that our mechanism improves channel utilization on an average by about 60%. The fairness characteristics are also improved significantly.

Citation:
Yuvraj Krishna Rana, Sanjay Jha, "RRAND: A New Requirement Aware RAND based Flexible Slot Allocation Mechanism Optimized For Spatial Reuse Of Slots," lcn, pp.3-9, 32nd IEEE Conference on Local Computer Networks (LCN 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.