Computer Science – Networking and Internet Architecture
Scientific paper
2010-09-22
Computer Science
Networking and Internet Architecture
Scientific paper
By combining the features of CSMA and TDMA, fully decentralised WLAN MAC schemes have recently been proposed that converge to collision-free schedules. In this paper we describe a MAC with optimal long-run throughput that is almost decentralised. We then design two \changed{schemes} that are practically realisable, decentralised approximations of this optimal scheme and operate with different amounts of sensing information. We achieve this by (1) introducing learning algorithms that can substantially speed up convergence to collision free operation; (2) developing a decentralised schedule length adaptation scheme that provides long-run fair (uniform) access to the medium while maintaining collision-free access for arbitrary numbers of stations.
Duffy Ken R.
Fang Minyu
Leith Douglas J.
Malone David
No associations
LandOfFree
Decentralised Learning MACs for Collision-free Access in WLANs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Decentralised Learning MACs for Collision-free Access in WLANs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decentralised Learning MACs for Collision-free Access in WLANs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-638079