TY - JOUR
T1 - On the performance of distributed polling service-based medium access control
AU - Li, Yihan
AU - Mao, Shiwen
AU - Panwar, Shivendra S.
AU - Midkiff, Scott F.
N1 - Funding Information:
Manuscript received June 19, 2007; revised November 25, 2007; accepted January 15, 2008. The associated editor coordinating the review of this paper and approving it for publication was Prof. W. Liao. This work has been supported in part by the National Science Foundation under Grants CNS-0520054, CNS-0435303, CNS-0435228, ECCS-0802113, and IIP-0738088, and by the New York State Office of Science, Technology and Academic Research (NYSTAR) through the Center for Advanced Technology in Telecommunications (CATT) at Polytechnic University.
PY - 2008/11
Y1 - 2008/11
N2 - It has been shown in the literature that many MAC protocols for wireless networks have a considerable control overhead, which limits their achievable throughput and delay performance. In this paper, we study the problem of improving the efficiency of MAC protocols. We first analyze the popular p-Persistent CSMA scheme and show that it does not achieve 100% throughput. Motivated by insights from polling system theory, we then present three polling service-based MAC schemes, termed PSMACs, for improved performance. The main idea is to serve multiple data frames after a successful contention resolution, thus amortizing the high control overhead and making the protocols more efficient. We present analysis and simulation studies of the proposed schemes. Our results show that PSMAC can effectively improve the throughput and delay performance of p-Persistent CSMA, as well as providing energy savings. We also observe that PSMAC is more efficient for handling the more general and challenging bursty traffic and outperforms p-Persistent CSMA with respect to fairness.
AB - It has been shown in the literature that many MAC protocols for wireless networks have a considerable control overhead, which limits their achievable throughput and delay performance. In this paper, we study the problem of improving the efficiency of MAC protocols. We first analyze the popular p-Persistent CSMA scheme and show that it does not achieve 100% throughput. Motivated by insights from polling system theory, we then present three polling service-based MAC schemes, termed PSMACs, for improved performance. The main idea is to serve multiple data frames after a successful contention resolution, thus amortizing the high control overhead and making the protocols more efficient. We present analysis and simulation studies of the proposed schemes. Our results show that PSMAC can effectively improve the throughput and delay performance of p-Persistent CSMA, as well as providing energy savings. We also observe that PSMAC is more efficient for handling the more general and challenging bursty traffic and outperforms p-Persistent CSMA with respect to fairness.
KW - Media access control
KW - Multi-hop wireless networks
KW - Polling service
KW - Wireless local area networks
UR - http://www.scopus.com/inward/record.url?scp=57149121924&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=57149121924&partnerID=8YFLogxK
U2 - 10.1109/T-WC.2008.070666
DO - 10.1109/T-WC.2008.070666
M3 - Article
AN - SCOPUS:57149121924
SN - 1536-1276
VL - 7
SP - 4635
EP - 4645
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 11
M1 - 4686845
ER -