Multi-satellite load balancing algorithm based on attractor selection algorithm in low earth orbit satellite internet of things scenario

被引：0
|
作者：
Cheng Y. [1 ]
Hong T. [1 ]
Ding X. [2 ]
Zhang G. [1 ]
机构：
[1] School of Communication and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing
[2] School of Internet of Things, Nanjing University of Posts and Telecommunications, Nanjing
来源：
Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics | 2022年 / 44卷 / 04期
关键词：
Attractor selection; Internet of things; Load balancing; Low earth orbit (LEO) satellite; Satellite internet of things business model;
D O I：
10.12305/j.issn.1001-506X.2022.04.34
中图分类号：
学科分类号：
摘要：
In low earth orbit(LEO) satellite internet of things system, due to the high-speed movement of LEO satellite, the node business model within the coverage of satellite beam presents non-uniformity and time variability in space and time. In view of this feature, a space-time two-dimensional satellite internet of things business model is proposed. In the spatial dimension, the grid division method is used to determine the node density and coordinate position in different geographical environments, and the beta distribution is used for modeling in the time dimension, so as to realize the space-time two-dimensional modeling of LEO satellite internet of things business model. On this basis, aiming at the scenario of multi satellite coverage of LEO satellite constellation in the future, a multi satellite load balancing algorithm based on attractor model is proposed. The satellite side estimates the activity of each satellite through the load estimation algorithm, and the node side uses multi-attribute decision-making algorithm to estimate the equipment satisfaction of different satellites to the node in combination with the pitch angle and other parameters of different satellites, In the high dynamic environment of LEO satellites, the network activity of satellites is kept in a dynamic balance. Simulation results show that compared with the traditional access strategy based on the highest priority, the proposed algorithm has significantly improved the peak to average ratio of single satellite service, system resource utilization, random access performance and so on. © 2022, Editorial Office of Systems Engineering and Electronics. All right reserved.
引用
收藏
页码：1354 / 1363
页数：9
相关论文
共 30 条
  • [21] LI Y, HOU R, ZHANG G X., Thoughts on the development of China's low-orbit satellite communication constellation system, International Space, 4, pp. 62-65, (2018)
  • [22] XING Q., Construction of low-orbit giant constellation and its impact analysis, China Aerospace Science and Technology, 12, pp. 43-47, (2019)
  • [23] CHEN D, PEI S W, HUANG H, Et al., Development, characteristics and thinking of global communication network of giant low-orbit constellations, International Space, 4, pp. 42-47, (2020)
  • [24] QU Z C, ZHANG G X, HONG T, Et al., Architecture and network model of time-space uninterrupted space information network, IEEE Access, 7, pp. 27677-27688, (2019)
  • [25] AKIKO K, ITARU U, KUNIHIKO K, Et al., Adaptive response of a gene network to environmental changes by fitness-induced attractor selection, PLoS ONE, 1, 1, pp. e49-e59, (2006)
  • [26] WU H Q, LU Z M, LI Z X, Et al., Mobile data offloading under attractor selection in heterogeneous networks, Proc.of the International Symposium on Wireless Communication Systems, pp. 164-169, (2017)
  • [27] WANG T C, LEE H S D., Developing a fuzzy TOPSIS approach based on subjective weights and objective weights, Expert Systems with Applications, 36, 5, pp. 8980-8985, (2009)
  • [28] 3GPP Standard TR 37.868-2011. RAN improvements for machinetype communications, (2011)
  • [29] LEE K D, SANG K, YI B., Throughput comparison of random access methods for M2M service over LTE networks, Proc.of the IEEE GLOBECOM Workshops, pp. 373-377, (2011)
  • [30] CHENG Y F, QU Z C, ZHANG G X., Low orbit satellite constellation Iot traffic modeling, Journal of Electronics and Information Technology, 43, 4, pp. 1050-1056, (2021)
123