access icon free Differential back-pressure routing for single-queue time-varying wireless networks

© The Institution of Engineering and Technology
Received 06/04/2019, Accepted 22/08/2019, Revised 03/08/2019, Published 29/08/2019

Dynamic resource control and routing are important for realising the intelligent control of data transmission in wireless multi-hop networks. It is well known that back-pressure routing based on a max-weight policy maximises network throughput and optimises resource allocation in multi-hop wireless networks with time-varying channels. Due to the slow routing convergence and complex control of data queues, however, back-pressure routing also results in large end-to-end delays and a waste of network resources, particularly when the network loads are light or moderate. In this study, a differential back-pressure routing scheme with single-queue management is proposed to improve the packet delay performance and simplify the management of data queues. Unlike in traditional back-pressure routing, the authors use the differences in the rates of change in data queue length to calculate data pressure. Compared with the method of data backlog calculation based on queue length differences, this method achieves faster routing convergence. They also consider the ceiling problem for a single queue and enhance the effect of the queue cap on the routing metric by means of dynamic weighting. Simulation results show that the proposed routing algorithm achieves a 20% decrease in end-to-end delay in grid and random networks.

Inspec keywords: queueing theory; telecommunication network routing; radio networks; telecommunication traffic; routing protocols; optimisation; wireless channels; resource allocation; delays; time-varying channels

Other keywords: network resources; data transmission; wireless multihop networks; multihop wireless networks; routing metric; data queues; differential back-pressure; single-queue management; network throughput; single-queue time-varying wireless networks; complex control; network loads; queue length differences; time-varying channels; slow routing convergence; single queue; optimises resource allocation; end-to-end delay; data backlog calculation; traditional back-pressure routing; routing algorithm; intelligent control; random networks; queue cap; data pressure

Subjects: Protocols; Radio links and equipment; Communication network design, planning and routing; Computer communications

References

    1. 1)
      • 2. Haus, M., Waqas, M., Ding, A.Y., et al: ‘Security and privacy in device-to-device (D2D) communication: a review’, IEEE Commun. Surv. Tutor., 2017, 19, (2), pp. 1054–1079.
    2. 2)
      • 3. Hai, L., Gao, Q., Wang, J., et al: ‘Delay-optimal back-pressure routing algorithm for multihop wireless networks’, IEEE Trans. Veh. Technol., 2018, 67, (3), pp. 2617–2630.
    3. 3)
      • 22. Alresaini, M., Wright, K.L., Krishnamachari, B., et al: ‘Backpressure delay enhancement for encounter-based mobile networks while sustaining throughput optimality’, IEEE/ACM Trans. Netw., 2016, 24, (2), pp. 1196–1208.
    4. 4)
      • 17. Baker, T., García-Campos, J.M., Reina, D.G., et al: ‘GreeAODV: an energy efficient routing protocol for vehicular ad hoc networks’. ICIC 2018 Intelligent Computing Methodologies, Wuhan, China, 2018, pp. 670–681.
    5. 5)
      • 15. Ji, B., Joo, C., Shroff, N.B.: ‘Delay-based back-pressure scheduling in multihop wireless networks’, IEEE/ACM Trans. Netw., 2013, 21, (5), pp. 1539–1552.
    6. 6)
      • 7. Rai, A., Li, C.P., Paschos, G., et al: ‘Loop-free backpressure routing using link-reversal algorithms’, IEEE/ACM Trans. Netw., 2017, 25, (5), pp. 2988–3002.
    7. 7)
      • 11. McKeown, N., Mekkittikul, A., Anantharam, V., et al: ‘Achieving 100% throughput in an input-queued switch’, IEEE Trans. Commun., 1999, 47, (8), pp. 1260–1267.
    8. 8)
      • 24. Cui, Y., Yeh, E.M., Liu, R.: ‘Enhancing the delay performance of dynamic backpressure algorithms’, IEEE/ACM Trans. Netw., 2016, 24, (2), pp. 954–967.
    9. 9)
      • 6. Neely, M.J., Modiano, E., Rohrs, C.E.: ‘Dynamic power allocation and routing for time-varying wireless networks’, IEEE J. Sel. Areas Commun., 2005, 23, (1), pp. 89–103.
    10. 10)
      • 8. Dvir, A., Vasilakos, A.V.: ‘Backpressure-based routing protocol for DTNs’, SIGCOMM Comput. Commun. Rev., 2011, 41, (4), pp. 405–406.
    11. 11)
      • 25. Abate, J., Whitt, W.: ‘Transient behavior of the M/M/l queue: starting at the origin’, Queueing Syst., 1987, 2, (1), pp. 41–65.
    12. 12)
      • 18. Jiao, Z., Tian, R., Zhang, B., et al: ‘A gradient-assisted energy-efficient backpressure scheduling algorithm for wireless sensor networks’, Int. J. Distrib. Sens. Netw., 2015, 2015, (3), pp. 1–9.
    13. 13)
      • 5. Ying, L., Shakkottai, S., Reddy, A., et al: ‘On combining shortest-path and back-pressure routing over multihop wireless networks’, IEEE/ACM Trans. Netw., 2011, 19, (3), pp. 841–854.
    14. 14)
      • 4. Merlin, C.J., Ma, L.P., Lauer, G., et al: ‘Latency-aware forwarding for IRON: Latency support for back-pressure forwarding’. 2018 IEEE Military Communications Conf. (MILCOM 2018), Los Angeles, CA, USA, 2018, pp. 1–6.
    15. 15)
      • 20. Jiao, Z., Tian, R., Zhang, B., et al: ‘A gradient-assisted energy-efficient backpressure scheduling algorithm for wireless sensor networks’. Int. Conf. on Internet Computing in Science and Engineering, Harbin, 2008, pp. 181–186.
    16. 16)
      • 16. Baker, T., Al-Dawsari, B., Tawfik, H., et al: ‘GreeDi: an energy efficient routing algorithm for big data on cloud’, Ad Hoc Netw., 2015, 35, pp. 83–96.
    17. 17)
      • 21. Ji, Z., Wang, Y., Lu, J.: ‘Distributed delay-aware resource control and scheduling in multihop wireless networks’. 2015 IEEE 82nd Vehicular Technology Conf. (VTC2015-Fall), Boston, MA, USA, September 2015, pp. 1–5.
    18. 18)
      • 13. Neely, M.J.: ‘Delay-based network utility maximization’, IEEE/ACM Trans. Netw., 2013, 21, (1), pp. 41–54.
    19. 19)
      • 1. Muirhead, D., Imran, M.A., Arshad, K.: ‘A survey of the challenges, opportunities and use of multiple antennas in current and future 5G small cell base stations’, IEEE Access, 2016, 4, pp. 2952–2964.
    20. 20)
      • 19. Yin, G., Yang, G., Yang, W., et al: ‘An energy-efficient routing algorithm for wireless sensor networks’. 2013 Sixth Int. Conf. on Developments in eSystems Engineering, Abu Dhabi, December 2013, pp. 198–203.
    21. 21)
      • 9. Jiao, Z., Yao, Z., Zhang, B., et al: ‘A distributed gradient-assisted anycast-based backpressure framework for wireless sensor networks’. 2014 IEEE Int. Conf. on Communications (ICC), Sydney, NSW, Australia, June 2014, pp. 2809–2814.
    22. 22)
      • 10. Mckeown, N., Mekkittikul, A., Anantharam, V., et al: ‘Achieving 100% throughput in an input-queued switch’. IEEE Transactions on Communications, 1999, 47, (8), pp. 1260–1267.
    23. 23)
      • 23. Jiao, Z., Zhang, B., Gong, W., et al: ‘A virtual queue-based back-pressure scheduling algorithm for wireless sensor networks’, EURASIP J. Wirel. Commun. Netw., 2015, 2015, (1), p. 35.
    24. 24)
      • 14. Chen, Y., Wang, X., Cai, L.: ‘HOL delay based scheduling in wireless networks with flow-level dynamics’. 2014 IEEE Global Communications Conf., Austin, TX, USA, December 2014, pp. 4898–4903.
    25. 25)
      • 12. Bhorkar, A.A., Javidi, T., Snoeren, A.C.: ‘Achieving congestion diversity in multi-hop wireless mesh networks’, IEEE Trans. Mob. Comput., 2015, 14, (3), pp. 473–483.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2019.0371
Loading

Related content

content/journals/10.1049/iet-com.2019.0371
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading