CoChat
Sign Up
Cited by 60Satellite Communication SystemsOpportunistic and Delay-Tolerant NetworksSpace Satellite Systems and Control

The DOI matches its Crossref record.

Distributed Routing Strategy Based on Machine Learning for LEO Satellite Network

Open access
Na, Zhenyu, Pan, Zheng, Liu, Xin, Deng, Zhian, Gao, Zihe, Guo, Qing·2018·Wireless Communications and Mobile Computing
DOI 10.1155/2018/3026405
Open this paper in CoChat — free accountOpen PDF

Abstract

As the indispensable supplement of terrestrial communications, Low Earth Orbit (LEO) satellite network is the crucial part in future space‐terrestrial integrated networks because of its unique advantages. However, the effective and reliable routing for LEO satellite network is an intractable task due to time‐varying topology, frequent link handover, and imbalanced communication load. An Extreme Learning Machine (ELM) based distributed routing (ELMDR) strategy was put forward in this paper. Considering the traffic distribution density on the surface of the earth, ELMDR strategy makes routing decision based on traffic prediction. For traffic prediction, ELM, which is a fast and efficient machine learning algorithm, is adopted to forecast the traffic at satellite node. For the routing decision, mobile agents (MAs) are introduced to simultaneously and independently search for LEO satellite network and determine routing information. Simulation results demonstrate that, in comparison to the conventional Ant Colony Optimization (ACO) algorithm, ELMDR not only sufficiently uses underutilized link, but also reduces delay.

Overview

Integrity signals

Registry

Crossref · 10.1155/2018/3026405

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

No references could be resolved yet.

Research works printed but not linked: 34

  1. 10.1109/TVT.2016.2572079 · DOI
  2. 10.1109/MWC.2017.1600251 · DOI
  3. 10.1109/TAP.2014.2366784 · DOI
  4. 10.1109/MWC.2016.1500108WC · DOI
  5. 10.1109/ACCESS.2018.2803742 · DOI
  6. 10.1109/TWC.2014.041014.130040 · DOI
  7. 10.1109/JSAC.2016.2611860 · DOI
  8. 10.1023/A:1019133429805 · DOI
  9. 10.1109/49.634801 · DOI
  10. 10.1109/25.704858 · DOI
  11. 10.1109/MWC.2008.4492977 · DOI
  12. EkiciE. AkyildizI. andBenderM. Datagram routing algorithm for LEO satellite networks 2 Proceedings of the IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies Tel Aviv Israel 500–508 https://doi.org/10.1109/INFCOM.2000.832223. · DOI
  13. De Sanctis M., 2005, Improved algorithms for Internet routing in low earth orbit satellite networks, Space Communications, 20, 171
  14. 10.1049/iet-com.2017.0325 · DOI
  15. TalebT. FadlullahZ. M. TakahashiT. WangR. NemotoY. andKatoN. Tailoring ELB for multi-layered satellite networks Proceedings of the 2009 IEEE International Conference on Communications ICC 2009 June 2009 https://doi.org/10.1109/ICC.2009.5199508 2-s2.0-70449491143. · DOI
  16. 10.1109/CC.2013.6650318 · DOI
  17. YanD.andWangL. TPDR: traffic prediction based dynamic routing for LEO&GEO satellite networks Proceedings of the 5th IEEE International Conference on Electronics Information and Emergency Communication ICEIEC 2015 May 2015 104–107 https://doi.org/10.1109/ICEIEC.2015.7284498 2-s2.0-84958593208. · DOI
  18. 10.1109/JPROC.2011.2157885 · DOI
  19. JankowskaA. SchutM. C. andFerreira-SchutN. A wireless actuator-sensor neural network for evacuation routing Proceedings of the 2009 3rd International Conference on Sensor Technologies and Applications SENSORCOMM 2009 June 2009 139–144 https://doi.org/10.1109/SENSORCOMM.2009.30 2-s2.0-70449483895. · DOI
  20. HuangS.-Z.andHuangL.-Y. The optimal routing algorithm of communication networks based on neural network 3 Proceedings of the 2010 International Conference on Intelligent Computation Technology and Automation ICICTA 2010 May 2010 866–869 https://doi.org/10.1109/icicta.2010.168 2-s2.0-77955749010. · DOI
  21. 10.1016/j.cor.2008.11.003 · DOI
  22. ZhangX. DingL. andRaoY. QoS routing by genetic algorithm for LEO satellite networks 1 Proceedings of the 2009 Second International Symposium on Computational Intelligence and Design 2009 341 344. · DOI
  23. 10.1504/IJMIC.2011.037826 · DOI
  24. Wang X.-M., 2010, An energy and location aware ACO based routing algorithm for wireless sensor networks, Tien Tzu Hsueh Pao/Acta Electronica Sinica, 38, 1763
  25. 10.3923/itj.2011.285.292 · DOI
  26. 10.1109/MWC.2016.1500356WC · DOI · Paper page
  27. 10.1109/MIS.2017.40 · DOI
  28. HuangG. B. ZhuQ. Y. andSiewC. K. Extreme learning machine: a new learning scheme of feedforward neural networks 2 Proceedings of the IEEE International Joint Conference on Neural Networks July 2004 985–990 https://doi.org/10.1109/IJCNN.2004.1380068 2-s2.0-10944272650. · DOI
  29. 10.1109/TCYB.2015.2512852 · DOI
  30. 10.1109/TNN.2006.875977 · DOI
  31. GaoZ. GuoQ. andNaZ. A novel routing algorithm combined with multi-agent system for LEO satellite IP networks Proceedings of the 2009 International Conference on Wireless Communications and Signal Processing WCSP 2009 November 2009 https://doi.org/10.1109/WCSP.2009.5371688 2-s2.0-77749324284. · DOI
  32. 10.1109/90.803379 · DOI
  33. ZhouB. HeD. andSunZ. Traffic predictability based on ARIMA/GARCH model Proceedings of the 2006 2nd Conference on Next Generation Internet Design and Engineering NGI 2006 April 2006 Spain 200–207 2-s2.0-34250222076 https://doi.org/10.1109/NGI.2006.1678242. · DOI
  34. 10.1109/SURV.2013.062613.00014 · DOI

Cited by

Sorted by citations

Metadata

Authors
Na, Z., Pan, Z., Liu, X., Deng, Z., Gao, Z., & Guo, Q.
Affiliations
  • Dalian Maritime University (CN)
  • Dalian University of Technology (CN)
  • Harbin Engineering University (CN)
  • Harbin Institute of Technology (CN)
Corresponding author
Liu, Xin
ORCID
Venue
Wireless Communications and Mobile Computing
Publisher
Wiley
Published
2018-01
Volume
2018
Issue
1
ISSN
  • 1530-8669 (ISSN-L)
  • 1530-8677
DOI
10.1155/2018/3026405
OpenAlex
W2807954440
Cited by
60
References
0
Citations by year
2026: 2 · 2025: 9 · 2024: 13 · 2023: 9 · 2022: 11 · 2021: 12 · 2020: 3 · 2019: 1
FWCI
3.25
Type
journal article
Language
en
Open access
Licence
Locations
  • Wireless Communications and Mobile Computing (publishedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
Funders
  • National Natural Science Foundation of China (61301131, 61601221)
  • Natural Science Foundation of Jiangsu Province (BK20140828)
  • China Postdoctoral Science Foundation (2015M580425)
Topics
  • Physical Sciences › Engineering › Aerospace Engineering › Satellite Communication Systems
  • Physical Sciences › Computer Science › Computer Networks and Communications › Opportunistic and Delay-Tolerant Networks
  • Physical Sciences › Engineering › Aerospace Engineering › Space Satellite Systems and Control
Keywords
LEO satellite networks, distributed routing, extreme learning machine, traffic prediction, mobile agents, time-varying topology, space-terrestrial integrated networks, ant colony optimization comparison, link utilization, delay reduction

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review