Advanced CSMA algorithm for throughput and utility maximization in wireless networks
2
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
In multihop wireless networks, laying out scattered Scheduling calculations to achieve the maximal throughput is a trying issue in light of the puzzling obstruction limitations among different associations. Standard maximal-weight scheduling (MWS), regardless of the way that throughput-ideal, is difficult to execute in dispersed frameworks. On the other hand, a conveyed voracious convention like IEEE 802.11 does not guarantee the maximal throughput. In this paper, we exhibit an adaptable carrier sense multiple access (CSMA) booking algorithm that can finish the maximal throughput distributively. A bit of the critical good conditions of the count are that it applies to an incredibly wide impedance show and that it is straightforward, disseminated, and offbeat. In addition, the figuring is joined with blockage control to achieve the perfect utility and sensibility of fighting streams. Entertainments check the ampleness of the estimation. Furthermore, the adaptable CSMA arranging is a particular MAC-layer figuring that can be combined with various traditions in the vehicle layer and framework layer. Finally, the paper examines some execution issues in the setting of 802.11 systems.
Abstract
In multihop wireless networks, laying out scattered Scheduling calculations to achieve the maximal throughput is a trying issue in light of the puzzling obstruction limitations among different associations. Standard maximal-weight scheduling (MWS), regardless of the way that throughput-ideal, is difficult to execute in dispersed frameworks. On the other hand, a conveyed voracious convention like IEEE 802.11 does not guarantee the maximal throughput. In this paper, we exhibit an adaptable carrier sense multiple access (CSMA) booking algorithm that can finish the maximal throughput distributively. A bit of the critical good conditions of the count are that it applies to an incredibly wide impedance show and that it is straightforward, disseminated, and offbeat. In addition, the figuring is joined with blockage control to achieve the perfect utility and sensibility of fighting streams. Entertainments check the ampleness of the estimation. Furthermore, the adaptable CSMA arranging is a particular MAC-layer figuring that can be combined with various traditions in the vehicle layer and framework layer. Finally, the paper examines some execution issues in the setting of 802.11 systems.
참고문헌 (19)
- X. Lin, "A Tutorial on Cross-Layer Optimization in Wireless Networks", IEEE Journal on Selected Areas in Communications, 24(8), pp.1452~1463 (2006)
- L. Tassiulas, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks", IEEE Transactions on Automatic Control, 37(12), pp.1936~1948 (1992)
- N. McKeown, "Achieving 100% throughput in an input-queued switch", IEEE Transactions on Communications, 47(8), pp.1260~1267 (1999)
- A. Dimakis, "Sufficient conditions for stability of longest-queue-first scheduling : second-order properties using fluid limits", Advances in Applied Probability, 38(2), pp.505~521 (2006)
- G. Zussman, "Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks", IEEE INFOCOM 2008 (2008)
- Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks, "M. Leconte", ACMMOBIHOC, ~ (2009)
- C. Joo, "Understanding the capacity region of the greedy maximal scheduling algorithm in multi-hop wireless networks", IEEE INFOCOM 2008 (2008)
- X. Lin, "The impact of imperfect scheduling on cross layer rate control in multihop wireless networks", IEEE INFOCOM2005 (2005)
- A. Proutiere, "Throughput of Random Access without Message Passing", Conference on Information Sciences and Systems (2008)
- B. Hajek, "Cooling schedules for optimal annealing", Mathematics of Operations Research, 13(2), pp.311~329 (1988)
- "Convergence and Tradeoff of Utility-Optimal CSMA" (1996)[URL]
- R. R. Boorstyn, "Throughput analysis in multihop CSMA packet radio networks", IEEE Transactions on Communications, 35(3), pp.267~274 (1987)
- P. Marbach, "Achievable Rate Region of CSMA Schedulers in Wireless Networks with Primary Interference Constraints", IEEE Conference on Decision and Control (2007)
- S. Rajagopalan, "Distributed Algorithm and Reversible Network", Conference on Information Sciences and Systems (2008)
- Y. Xi, "Throughput Optimal Distributed Control of Stochastic Wireless Networks", International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) (2006)
- M. J. Neely, "Fairness and Optimal Stochastic Control for Heterogeneous Networks", IEEE, 2008, pp.16(2), 396~409
- 이성운, "지능형 컨테이너를 위한 익명성과 추적 기능을 제공하는 인증 및 키교환 프로토콜", 보안공학연구논문지, 13(1), pp.1~10 (2016), 보안공학연구지원센터[DOI]
- 엄정호, "국방 사이버 위협정보 공유 및 협력체계 구축 방안", 보안공학연구논문지, 13(5), pp.341~352 (2016), 보안공학연구지원센터[DOI]
- 박준성, "페어링 연산이 없는 무인증서 기반의 인증 키 일치 프로토콜", 보안공학연구논문지, 13(6), pp.451~466 (2016), 보안공학연구지원센터[DOI]