Information and Communications Magazine (정보와 통신)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

최적의 CSMA 접속 기법 연구에 관하여

  • Published : 2012.08.31
Download PDF
⟨ Previous Next ⟩

Abstract

Carrier Sensing Multiple Access (CSMA)로 불리는 임의 접근 방식은 무선 통신 시스템에서 흔하게 사용되는 프로토콜이다. 이 CSMA 프로토콜은 데이터 전송에 앞서 자신의 링크 상황을 먼저 파악 한 후에 전송이 가능한 경우에 전송을 시도하는 방식이다. 매우 간단하며 분산적으로 동작이 진행되기 때문에 쉽게 실제 시스템에 적용되어 사용되고 있다. 이와 같은 간단하고 분산적인 CSMA 알고리즘이 최적 전송효율을 달성 할 수 있다는 사실이 최근에 밝혀졌다. 이러한 발견을 바탕으로 많은 연구들이 다양한 조건에서 전송효율을 극대화 시키는 방법에 대해 다뤘다. 본고에서는 최근의 이러한 연구 동향을 정리하고, 앞으로 해결해야 할 문제를 정리하였다.

Keywords

References

  1. Chen, W., Wang, Y., Chen, M. & Liew, S. C. 2011. "On the performance of tcp over throughput-optimal CSMA." In Proceedings of IWQoS.
  2. Hegde, N. & Proutiere, A. 2012. "Simulation-based optimization algorithms with applications to dynamic spectrum access." In Proceedings of CISS.
  3. Jiang, L., Leconte, M., Ni, J., Srikant, R. & Walrand, J. 2011. "Fast mixing of parallel Glauber dynamics and low-delay CSMA scheduling." In Proceedings of Infocom
  4. Jiang, L., Shah, D., Shin, J. & Walrand, J. 2010. "Distributed random access algorithm: scheduling and congestion control." IEEE Transactions on Information Theory, 56 (12), 6182-6207. https://doi.org/10.1109/TIT.2010.2081490
  5. Jiang, L. & Walrand, J. 2010. "A distributed CSMA algorithm for throughput and utility maximization in wireless networks." IEEE/ACM Transactions on Networking, 18 (3), 960-972. https://doi.org/10.1109/TNET.2009.2035046
  6. Jiang, L. & Walrand, J. 2011. "Approaching throughput-optimality in distributed csma scheduling algorithms with collisions." IEEE/ACM Transactions on Networking, 19 (3), 816-829 https://doi.org/10.1109/TNET.2010.2089804
  7. Kim, T. H., Ni, J., Srikant, R. & Vaidya, N. 2011. "On the achievable throughput of csma under imperfect carrier sensing." In Proceedings of Infocom pp. 1674-1682,.
  8. Lee, C.-H., Eun, D. Y., Yun, S.-Y. & Yi, Y. 2012. "From Glauber dynamics to Metropolis algorithm: smaller delay in optimal CSMA." In Proceedings of ISIT.
  9. Lee, J., Lee, H.-W., Yi, Y. & Chong, S. "Improving TCP performance over optimal CSMA in wireless multi-hop networks." To appear in IEEE Communication Letters, 2012.
  10. Lee, J., Lee, J., Yi, Y., Chong, S., Proutiere, A. & Chiang, M. 2009. "Implementing utility-optimal CSMA." In Proceedings of Allerton.
  11. Lee, J., Yi, Y., Chong, S., Nardelli, B., Knightly, E. & Chiang, M. 2012. "Making 802.11 DCF Optimal: Design, Implementation, and Evaluation." ArXiv e-prints, .
  12. Liu, J., Yi, Y., Proutiere, A., Chiang, M. & Poor, H. V. 2009. "Maximizing utility via random access without message passing." Technical report Microsoft Research Labs, UK.
  13. Liu, J., Yi, Y., Proutiere, A., Chiang, M. & Poor, H. V. 2010. "Towards utility-optimal random access without message passing." Wiley Journal of Wireless Communications and Mobile Computing, 10 (1), 115-128 https://doi.org/10.1002/wcm.897
  14. Eryilmaz, 2012] Li, B. & Eryilmaz, A. 2012. "A Fast-CSMA Algorithm for Deadline-Constrained Scheduling over Wireless Fading Channels." ArXiv e-prints, .
  15. Lotfinezhad, M. & Marbach, P. 2011. "Throughput-optimal random access with order-optimal delay." In Proceedings of Infocom.
  16. Nardelli, B., Lee, J., Lee, K., Yi, Y., Chong, S., Knightly, E. & Chiang, M. 2011. "Experimental evaluation of optimal CSMA." In Proceedings of Infocom.
  17. Ni, J., Tan, B. & Srikant, R. 2010. "Q-csma: queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks." In Proceedings of Infocom.
  18. Proutiere, A., Yi, Y., Lan, T. & Chiang, M. 2010. "Resource allocation over network dynamics without timescale separation." In Proceedings of Infocom.
  19. Qian, D., Zheng, D., Zhang, J. & Shroff, N. 2010. "CSMA-based distributed scheduling in multi-hop MIMO networks under SINR model." In Proceedings of Infocom.
  20. Rajagopalan, S., Shah, D. & Shin, J. 2009. "Network adiabatic theorem: an efficient randomized protocol for contention resolution." In Proceedings of ACM Sigmetrics, Seattle, WA.
  21. Shah, D., Shin, J. & Tetali, P. 2011. "Medium access using queues." In Proceedings of Foundations of Computer Science (FOCS) pp. 698-707, IEEE.
  22. Shah, D. & Shin, J. 2010. "Delay optimal queue-based CSMA." In Proceedings of ACM Sigmetrics.
  23. Shah, D. & Shin, J. 2012. "Randomized scheduling algorithm for queueing networks." Annals of Applied Probability, 22, 128-171. https://doi.org/10.1214/11-AAP763
  24. Shah, D., Tse, D. N. C. & Tsitsiklis, J. N. 2009. "Hardness of low delay network scheduling." IEEE Transactions on Information Theory, . submitted.
  25. Subramanian, V. & Alanyali, M. 2011. "Delay performance of CSMA in networks with bounded degree conflict graphs." In Proceedings of ISIT pp. 2373-2377,.
  26. Tassiulas, L. & Ephremides, A. 1992. "Stability properties of constrained queueing systems and scheduling for maximum throughput in multihop radio networks." IEEE Transactions on Automatic Control, 37 (12), 1936-1949
  27. Yi, Y. & Chiang, M. 2011. "Next-Generation Internet Architectures and Protocols." Cambridge University Press. Chapter 9: Stochastic network utility maximization and wireless scheduling.
  28. Yun, S.-Y., Shin, J. & Yi, Y. 2012. "Medium access over time-varying channels with limited sensing cost." ArXiv e-prints, .