北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2020, Vol. 43 ›› Issue (3): 72-76.doi: 10.13190/j.jbupt.2019-121

• 论文 • 上一篇    下一篇

稀疏移动网络中时延软约束的低能耗路由算法

许蒙蒙, 朱海, 崔娅杰, 徐恒舟   

  1. 周口师范学院 网络工程学院, 周口 466001
  • 收稿日期:2019-06-26 出版日期:2020-06-28 发布日期:2020-06-24
  • 作者简介:许蒙蒙(1987-),男,讲师,E-mail:568062616@qq.com.
  • 基金资助:
    国家自然科学基金项目(61801527,61702071);河南省科技发展计划项目(182102310867,192102210279);河南省教育厅科学技术研究重点项目(20A510017).

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

中图分类号: