Joint Flow Control, Routing and Medium Access Control in Random Access Multi-Hop Wireless Networks with Time Varying Link Capacities
Article Sidebar
Main Article Content
Abstract
This work extends the existing static framework for joint flow control, routing and medium access control (MAC) in random access multi-hop wireless networks to a dynamic framework where link capacities vary over time. The overall problem is formulated as a long term network utility maximization (NUM) problem (instead of the existing static NUM problem) that accounts for link capacity variation. This dynamic formulation is more realistic than the static one, and is one step closer to practical networks. Under the stationary and ergodic assumptions on the link capacity variation, the problem is decomposed to form a distributed algorithm. The algorithm samples current link capacities while it is iteratively and locally updating flow rates and link transmission probabilities. Simulation results demonstrate the ability of the algorithm to sustain the optimal average data rates despite the link capacity variation.
Article Details
This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge.
- Creative Commons Copyright License
The journal allows readers to download and share all published articles as long as they properly cite such articles; however, they cannot change them or use them commercially. This is classified as CC BY-NC-ND for the creative commons license.
- Retention of Copyright and Publishing Rights
The journal allows the authors of the published articles to hold copyrights and publishing rights without restrictions.
References
[2] J. Li, C. Blake, D. S. D. Couto, H. I. Lee, and R. Morris, "Capacity of ad hoc wireless networks," in MobiCom. ACM, 2001.
[3] Z. Fang and B. Bensaou, "Fair bandwidth sharing algorithms based on game theory frameworks for wireless ad-hoc networks," IEEE INFOCOM, 2004.
[4] B. Yang, G. Feng, and X. Guan, "Random access in wireless ad hoc networks for throughput maximization," International Conference on Control, Automation, Robotics and Vision, 2006.
[5] X. Wang and K. Kar, "Distributed algorithms for max-min fair rate allocation in aloha networks," in Allerton Conference, 2004.
[6] J.-W. Lee, M. Chiang, and A. R. Calderbank, "Utility-optimal medium access control: Reverse and forward engineering," IEEE INFOCOM, 2006.
[7] M. Chiang, S. Low, A. Calderbank, and J. Doyle, "Layering as optimization decomposition: A mathematical theory of network architectures," Proceedings of the IEEE, 2007.
[8] X.Wang and K. Kar, "Cross-layer rate optimization for proportional fairness in multihop wireless networks with random access," IEEE J. Sel. Areas Commun., 2006.
[9] F. Kelly, A. Maulloo, and D. Tan, "Rate control in communication networks: shadow prices, proportional fairness and stability," Journal of the Operational Research Society, 1998.
[10] S. Supittayapornpong and P. Saengudomlert, "Joint flow control, routing and medium access control in random access multi-hop wireless networks," IEEE ICC, 2009.
[11] J. M. Mendel and K. S. Fu, Adaptive, learning, and pattern recognition systems; theory and apapplications, edited by J. M. Mendel and K. S. Fu. Academic Press, New York, 1970.
[12] D. P. Bertsekas and R. G. Gallager, Data Networks, 2nd ed. Prentice-Hall, 1992.
[13] D. ONeill, A. Goldsmith, and S. Boyd, "Crosslayer design with adaptive modulation delay, rate, and energy tradeo®s," IEEE GLOBECOM, 2008.
[14] D. P. Bertsekas, Nonlinear Programming. Athena Scientific, 1995.
[15] S. Supittayapornpong, "Joint flow control, routing and medium access control in random access multi-hop wireless networks," Masters thesis, Asian Institute of Technology, 2008.
[16] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2004.