Browse > Article

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

Lee, Yung (KAIST)
Yun, Se-Yeong (KAIST)
Publication Information
Keywords
Citations & Related Records
연도 인용수 순위
  • Reference
1 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, .
2 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.
3 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   DOI
4 Chen, W., Wang, Y., Chen, M. & Liew, S. C. 2011. "On the performance of tcp over throughput-optimal CSMA." In Proceedings of IWQoS.
5 Hegde, N. & Proutiere, A. 2012. "Simulation-based optimization algorithms with applications to dynamic spectrum access." In Proceedings of CISS.
6 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
7 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.   DOI
8 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.   DOI
9 Jiang, L. & Walrand, J. 2011. "Approaching throughput-optimality in distributed csma scheduling algorithms with collisions." IEEE/ACM Transactions on Networking, 19 (3), 816-829   DOI
10 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,.
11 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.
12 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.
13 Lee, J., Lee, J., Yi, Y., Chong, S., Proutiere, A. & Chiang, M. 2009. "Implementing utility-optimal CSMA." In Proceedings of Allerton.
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.   DOI
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 Yun, S.-Y., Shin, J. & Yi, Y. 2012. "Medium access over time-varying channels with limited sensing cost." ArXiv e-prints, .
28 Yi, Y. & Chiang, M. 2011. "Next-Generation Internet Architectures and Protocols." Cambridge University Press. Chapter 9: Stochastic network utility maximization and wireless scheduling.