Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

Journal of Beijing University of Posts and Telecommunications ›› 2020, Vol. 43 ›› Issue (3): 72-76.doi: 10.13190/j.jbupt.2019-121

• Papers • Previous Articles     Next Articles

Energy-Efficient Routing with Delay Soft-Constraint in Sparse Mobile Networks

XU Meng-meng, ZHU Hai, CUI Ya-jie, XU Heng-zhou   

  1. School of Network Engineering, Zhoukou Normal University, Zhoukou 466001, China
  • Received:2019-06-26 Online:2020-06-28 Published:2020-06-24
  • Supported by:
     

Abstract: In order to achieve the energy-efficient data transmission in sparse mobile wireless networks, a routing algorithm with delay soft-constraint is proposed. A sequence of network topologies in a number of time-slots is modeled as a virtual spatial-temporal graph, which includes both the connectivity information in each time-slot and the link change information due to mobility. A new routing problem in the spatial-temporal graph is defined to find an energy-efficient spatial-temporal path under a given delay soft-constraint. Also, an energy-efficient routing algorithm is developed, which could meets the soft-constraint of the transmission delay. Simulations validate that the proposed algorithm achieves the tradeoff between energy consumption and transmission delay.

Key words: sparse mobile networks, energy-efficient routing, delay soft-constraint, spatial-temporal graph

CLC Number: