论文信息 - A backlog-based CSMA mechanism to achieve fairness and throughput-optimality in multihop wireless networks

A backlog-based CSMA mechanism to achieve fairness and throughput-optimality in multihop wireless networks

We propose and analyze a distributed backlog-based CSMA policy to achieve fairness and throughput-optimality in wireless multihop networks. The analysis is based on a CSMA fixed point approximation that is accurate for large networks with many small flows and a small sensing period.

A. Eryilmaz | P. Marbach | P. Marbach | A. Eryilmaz

[1] Peter Marbach,et al. Price-based rate control in random access networks , 2005, IEEE/ACM Transactions on Networking.

[2] Leandros Tassiulas,et al. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[3] R. Srikant,et al. Regulated Maximal Matching: A Distributed Scheduling Algorithm for Multi-Hop Wireless Networks With Node-Exclusive Spectrum Sharing , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[4] Dimitri P. Bertsekas,et al. Data Networks , 1986 .

[5] Steven H. Low,et al. REM: active queue management , 2001, IEEE Netw..

[6] A. Ozdaglar,et al. On the Throughput-Optimality of CSMA Policies in Multihop Wireless Networks , 2008 .

[7] Dimitri P. Bertsekas,et al. Data networks (2nd ed.) , 1992 .

[8] Neil Genzlinger. A. and Q , 2006 .

[9] Jean C. Walrand,et al. A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks , 2010, IEEE/ACM Transactions on Networking.