Joint multi-QoS and energy saving routing for LEO satellite network

被引:0
|
作者
Yang G. [1 ]
Yong Z. [1 ]
Kun L. [2 ]
Yinglei T. [1 ]
Jinxiong W. [3 ]
机构
[1] School of Telecommunication Engineering, Beijing University of Posts and Telecommunications, Beijing
[2] China Academy of Railway Sciences Corporation Limited, Standards and Metrology Research Institute, Beijing
[3] Department of Information and Communication Technology, State Grid Corporation of China, Beijing
来源
Journal of China Universities of Posts and Telecommunications | 2019年 / 26卷 / 03期
基金
中国国家自然科学基金;
关键词
Energy; LEO satellite network; Multi-QoS; Routing;
D O I
10.19682/j.cnki.1005-8885.2019.0015
中图分类号
学科分类号
摘要
Low earth orbit (LEO) satellite network provides global coverage and supports a wide range of services. However, due to the rapid changes and energy-limitation of satellites, how to meet the demand of the quality of service (QoS) from ground traffic and prolong the lifetime of LEO satellite network is the research emphasis of the investigator. Hence, a routing algorithm which takes into account the multi-QoS requirements and satellite energy consumption (QER) of LEO satellite network is proposed. Firstly, the satellite intimacy degree (SID) and the path health degree (PHD) are introduced to obtain the path evaluation function according to the energy consumption and queue state of the satellite. Then, the distributed routing QER is established through the path evaluation function and the idea of genetic algorithm (GA), which enables each satellite to adjust traffic and realizes the network load balancing. Simulation results show that QER performs well in terms of end-to-end delay, delay jitter, and system throughput. © 2019, Beijing University of Posts and Telecommunications. All rights reserved.
引用
收藏
页码:25 / 34
页数:9
相关论文
共 50 条
  • [41] Agent-based Multi-Service Routing for Polar-orbit LEO broadband satellite networks
    Rao, Yuan
    Zhu, Jun
    Yuan, Chang-an
    Jiang, Zhao-hui
    Fu, Lei-yang
    Shao, Xing
    Wang, Ru-chuan
    AD HOC NETWORKS, 2014, 13 : 575 - 597
  • [42] Network Energy-Saving Adjustment Routing Under Changing Demands: Models and Algorithms
    Zhang, Mengjia
    Yang, Wenguo
    Gao, Suixiang
    Xu, Wei
    IEEE ACCESS, 2020, 8 : 90676 - 90685
  • [43] EOMR: An Energy-Efficient Optimal Multi-path Routing Protocol to Improve QoS in Wireless Sensor Network for IoT Applications
    Jaiswal, Kavita
    Anand, Veena
    WIRELESS PERSONAL COMMUNICATIONS, 2020, 111 (04) : 2493 - 2515
  • [44] EOMR: An Energy-Efficient Optimal Multi-path Routing Protocol to Improve QoS in Wireless Sensor Network for IoT Applications
    Kavita Jaiswal
    Veena Anand
    Wireless Personal Communications, 2020, 111 : 2493 - 2515
  • [45] Load-Balancing Routing for LEO Satellite Network with Distributed Hops-Based Back-Pressure Strategy
    Han, Chi
    Xiong, Wei
    Yu, Ronghuan
    An, Kang
    SENSORS, 2023, 23 (24)
  • [46] A Simple Joint Routing and Scheduling Algorithm for a Multi-hop Wireless Network
    Chakraborty, Ishita
    Hussain, Md. Anwar
    2012 INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND INDUSTRIAL INFORMATICS (ICCSII), 2012,
  • [47] Renewable energy source based quality of service (QoS)-aware routing mechanism in cloud network
    Ashok Kumar Bhoi
    Manas Ranjan Kabat
    Suvendu Chandan Nayak
    Gopinath Palai
    Wireless Networks, 2022, 28 : 1703 - 1718
  • [48] Renewable energy source based quality of service (QoS)-aware routing mechanism in cloud network
    Bhoi, Ashok Kumar
    Kabat, Manas Ranjan
    Nayak, Suvendu Chandan
    Palai, Gopinath
    WIRELESS NETWORKS, 2022, 28 (04) : 1703 - 1718
  • [49] An Efficient Multi-Dimensional Resource Allocation Mechanism for Beam-Hopping in LEO Satellite Network
    Guo, Shengjun
    Han, Kai
    Gong, Wenbin
    Li, Lu
    Tian, Feng
    Jiang, Xinglong
    SENSORS, 2022, 22 (23)
  • [50] Multi-objective routing algorithms for low-earth orbit satellite network
    Xie, Xuan
    Huang, Linyu
    Tang, Chengwen
    Ning, Qian
    INTERNATIONAL JOURNAL OF SATELLITE COMMUNICATIONS AND NETWORKING, 2023, 41 (05) : 427 - 440