Dynamic Control Policy for Delay Guarantees in Multi-hop Wireless Networks

Wireless Personal Communications

Volumn 80, Issue 2, 2015, Pages 647-670

  Huynh, Thong ^a   Pham, Ngoc Thai ^a,b   Lee, Suk Hwan ^c   Hwang, Won Joo ^a  

^a Inje University   (South Korea)

^b SAMSUNG Electronics   (South Korea)

^c Tongmyong University   (South Korea)

Author keywords

Delay guarantee; Flow control; Multi hop network; Optimal control; Scheduling; Stochastic network optimization

Indexed keywords

FLOW CONTROL; SCHEDULING; STOCHASTIC SYSTEMS;

DELAY GUARANTEE; DYNAMIC CONTROL POLICY; MULTIHOP NETWORKS; MULTIHOP WIRELESS NETWORK; NETWORK UTILITY MAXIMIZATION; OPTIMAL CONTROLS; STOCHASTIC NETWORK OPTIMIZATIONS; STOCHASTIC NETWORKS;

WIRELESS NETWORKS;

EID: 85027920091     PISSN: 09296212     EISSN: 1572834X     Source Type: Journal    
DOI: 10.1007/s11277-014-2033-3     Document Type: Article

References (35)

1. Bobarshad, H., van der Schaar, M., Aghvami, A., Dilmaghani, R., & Shikh-Bahaei, M. (2012). Analytical modeling for delay-sensitive video over wlan. IEEE Transactions on Multimedia, 14(2), 401–414.
2. Georgiadis, L., Neely, M. J., & Tassiulas, L. (2006). Resource allocation and cross-layer control in wireless networks. Foundations and Trends in Networking, 1(1), 1–144.
3. Eryilmaz, A. (2005). Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control. In: Proceedings of IEEE INFOCOM ’05, pp. 1794–1803.
4. Stolyar, A. L. (2005). Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm. Queueing Systems: Theory and Applications, 50(4), 401–457.
5. Tassiulas, L., & Ephremides, A. (1992). Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transaction on Automatic Control, 37(12), 1936–1948.
6. Pham, N. T., Enkhbat, R., & Hwang, W. J. (2011). Delay-guaranteed scheduling and flow control for new generation mobile networks. IEICE Transactions on Communication, 94–B(6), 1556–1564.
7. Ostovari, P., Khreishah, A., & Wu, J. (2013). Broadcasting with hard deadlines in wireless multihop networks using network coding. Wireless Communications and Mobile Computing.
8. El-Gendy, M., Bose, A., Wang, H., & Shin, K. G. (2003). Statistical characterization for per-hop QoS. In Proceedings of the 11th international conference on quality of service.
9. Joseph, V., & Chapman, B. (2009). Deploying QoS for Cisco IP and next generation networks: The definitive guide. Los Altos, CA: Morgan Kaufmann.
10. Kelly, F., Maulloo, A., & Tan, D. (1998). Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49, 237–252.
11. Chiang, M. (2005). Balancing transport and physical layers in wireless multihop networks: Jointly optimal congestion control and power control. IEEE Journal on Selected Areas in Communications, 23(1), 104–116.
12. Chiang, M., Low, S., Calderbank, A., & Doyle, J. (2007). Layering as optimization decomposition: A mathematical theory of network architectures. Proceedings of the IEEE, 95(1), 255–312.
13. Shah, D., Tse, D., & Tsitsiklis, J. (2011). Hardness of low delay network scheduling. IEEE Transactions on Information Theory, 57(12), 7810–7817.
14. Gopalan, A., Caramanis, C., & Shakkottai, S. (2012). Low-delay wireless scheduling with partial channel-state information. In Proceedings IEEE INFOCOM, pp. 1071–1079.
15. Neely, M. (2011). Opportunistic scheduling with worst case delay guarantees in single and multi-hop networks. In: INFOCOM, 2011 Proceedings IEEE, pp. 1728–1736.
16. Neely, M. (2006). Energy optimal control for time-varying wireless networks. IEEE Transactions on Information Theory, 52(7), 2915–2934.
17. Le, L. B., Modiano, E., & Shroff, N. (2012). Optimal control of wireless networks with finite buffers. IEEE/ACM Transactions on Networking, 20(4), 1316–1329.
18. Giaccone, P., Leonardi, E., & Shah, D. (2007). Throughput region of finite-buffered networks. IEEE Transaction of Parallel Distributed System, 18(2), 251–263.
19. Khodaian, A., & Khalaj, B. (2010). Delay-constrained utility maximisation in multi-hop random access networks. IET Communications, 4(16), 1908–1918.
20. Li, Y., Chiang, M., Calderbank, A., & Diggavi, S. (2007). Optimal rate-reliability-delay tradeoff in networks with composite links. Proceedings of IEEE INFOCOM, 07, 526–534.
21. Wang, Y., Vuran, M. C., & Goddard, S. (2012). Cross-layer analysis of the end-to-end delay distribution in wireless sensor networks. IEEE/ACM Transactions on Networking, 20(1), 305–318.
22. Xue, D., & Ekici, E. (2012). Delay-guaranteed cross-layer scheduling in multihop wireless networks. IEEE/ACM Transactions on Networking, 21(6), 1696–1707.
23. Huang, P.-K., Lin, X., & Wang, C.-C. (2011). A low-complexity congestion control and scheduling algorithm for multihop wireless networks with order-optimal per-flow delay. Proceedings IEEE INFOCOM, pp. 2588–2596.
24. Kar, K., Luo, X., & Sarkar, S. (2009). Delay guarantees for throughput-optimal wireless link scheduling. In: Proceedings of IEEE INFOCOM ’09, pp. 2331–2339.
25. Wang, Y., & Boyd, S. (2009). Performance bounds for linear stochastic control. Systems & Control Letters, 58(3), 178–182.
26. Zhang, Zhi, Moola, Sudhir, & Edwin K.P., Chong. (2010). Opportunistic fair scheduling in wireless networks: An approximate dynamic programming approach. Mobile Networks and Applications, 155, 710–728.
27. Warren B., Powell. (2007). Approximate dynamic programming: Solving the curses of dimensionality (Wiley series in probability and statistics). New York: Wiley-Interscience.
28. Low, S., & Lapsley, D. (1999). Optimization flow control. I. Basic algorithm and convergence. IEEE/ACM Transactions on Networking, 7(6), 861–874.
29. Mo, J., & Walrand, J. (2000). Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking, 8(5), 556–567.
30. Modiano, E., Shah, D., & Zussman, G. (2006). Maximizing throughput in wireless networks via gossiping. SIGMETRICS Performance Evaluation Review, 34, 27–38.
31. Eryilmaz, A., Asuman, O., & Modiano, E. (2007). Polynomial complexity algorithms for full utilization of multi-hop wireless networks. Proceedings of INFOCOM, 2007, 499–507.
32. Sanghavi, S., Bui, L., & Srikant, R. (2007). Distributed link scheduling with constant overhead. SIGMETRICS Performance Evaluation Review, 35, 313–324.
33. Jung, K., & Shah, D. (2007). Low delay scheduling in wireless network. IEEE International Symposium on Information Theory, 2007, 1396–1400.
34. Chaporkar, P., Kar, K., Luo, X., & Sarkar, S. (2008). Throughput and fairness guarantees through maximal scheduling in wireless networks. IEEE Transactions on Information Theory, 54(2), 572–594.
35. Liu, J., Stolyar, A., Chiang, M., & Poor, H. (2009). Queue back-pressure random access in multihop wireless networks: Optimality and stability. IEEE Transactions on Information Theory, 55(9), 4087–4098.