On the Design of Efficient CSMA Algorithms for Wireless Networks

Details On the Design of Efficient CSMA Algorithms for Wireless Networks On the Design of Efficient CSMA Algorithms for Wireless Networks

2010-03-06

arxiv.org/abs/1003.1364v1

Computer Science

Networking and Internet Architecture

Scientific paper

Recently, it has been shown that CSMA algorithms which use queue length-based link weights can achieve throughput optimality in wireless networks. In particular, a key result by Rajagopalan, Shah, and Shin (2009) shows that, if the link weights are chosen to be of the form log(log(q)) (where q is the queue-length), then throughput optimality is achieved. In this paper, we tighten their result by showing that throughput optimality is preserved even with weight functions of the form log(q)/g(q), where g(q) can be a function that increases arbitrarily slowly. The significance of the result is due to the fact that weight functions of the form log(q)/g(q) seem to achieve the best delay performance in practice.

Affiliated with

Also associated with

No associations

Rating

On the Design of Efficient CSMA Algorithms for Wireless Networks 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 On the Design of Efficient CSMA Algorithms for Wireless Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Design of Efficient CSMA Algorithms for Wireless Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-269856