Contact Plan Design With Directional Space-Time Graph in Two-Layer Space Communication Networks

被引:16
作者
Dai, Cui-Qin [1 ]
Guo, Linfeng [1 ]
Fu, Shu [2 ]
Chen, Qianbin [3 ]
机构
[1] Chongqing Univ Posts & Telecommun, Sch Commun & Informat Engn, Chongqing 400065, Peoples R China
[2] Chongqing Univ, Coll Microelect & Commun Engn, Chongqing 400044, Peoples R China
[3] Chongqing Univ Posts & Telecommun, Chongqing Key Lab Mobile Commun Technol, Chongqing 400065, Peoples R China
来源
IEEE INTERNET OF THINGS JOURNAL | 2019年 / 6卷 / 06期
关键词
Contact cost; contact plan design (CPD); contact reliability; invalid probability cost (IPC); space communication network (SCN); TOLERANT NETWORKING; CHALLENGES; DISRUPTION; DELAY; FRAMEWORK; PROTOCOL; DTN;
D O I
10.1109/JIOT.2019.2942345
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the two-layer space communication network (TLSCN), communications can be performed to obtain higher throughput and lower latency by introducing various types of spatial nodes. However, the mobility of spatial nodes and the connectivity of spatial links result in the time-varying network topology, and intermittent link connection. This further leads to the lack of continuous contact, unreliable transmission, and high transmission cost. In this article, contact plan design (CPD) is employed to address the above problems by increasing the contact reliability while decreasing the contact cost. First, a directional space-time graph (DSTG) is constructed by considering the motion trajectory of spatial nodes and the time evolution nature of TLSCN. Afterwards, based on DSTG, we propose three CPD methods with greedy algorithm by considering the limited computing power of nodes. The three methods can optimize the objective functions of the total contact reliability, total contact cost, and invalid probability cost, respectively. The simulation results show that the proposed CPD methods can effectively improve the contact reliability, reduce the contact cost of TLSCN, and perform well with the increase of network density.
引用
收藏
页码:10862 / 10874
页数:13
相关论文
共 33 条
  • [1] Contact Graph Routing in DTN Space Networks: Overview, Enhancements and Performance
    Araniti, Giuseppe
    Bezirgiannidis, Nikolaos
    Birrane, Edward
    Bisio, Igor
    Burleigh, Scott
    Caini, Carlo
    Feldmann, Marius
    Marchese, Mario
    Segui, John
    Suzuki, Kiyohisa
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2015, 53 (03) : 38 - 46
  • [2] Bisu A. A., 2018, IEEE INT C COMM ICC, P1
  • [3] Delay-tolerant networking: An approach to interplanetary Internet
    Burleigh, S
    Hooke, A
    Torgerson, L
    Fall, K
    Cerf, V
    Durst, B
    Scott, K
    Weiss, H
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2003, 41 (06) : 128 - 136
  • [4] Burleigh S., 2010, CONTACT GRAPH ROUTIN, P53
  • [5] Delay- and Disruption-Tolerant Networking (DTN): An Alternative Solution for Future Satellite Networking Applications
    Caini, Carlo
    Cruickshank, Haitham
    Farrell, Stephen
    Marchese, Mario
    [J]. PROCEEDINGS OF THE IEEE, 2011, 99 (11) : 1980 - 1997
  • [6] Chang HS, 1995, GLOB TELECOMM CONF, P529, DOI 10.1109/GLOCOM.1995.501983
  • [7] Understanding Path Reconstruction Algorithms in Multihop Wireless Networks
    Dong, Wei
    Cao, Chenhong
    Zhang, Xiaoyu
    Gao, Yi
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2019, 27 (01) : 1 - 14
  • [8] Fraillon J, 2013, International computer and information literacy study assessment framework, P1
  • [9] Routing-aware fair contact plan design for predictable delay tolerant networks
    Fraire, J.
    Finochietto, J. M.
    [J]. AD HOC NETWORKS, 2015, 25 : 303 - 313
  • [10] Introducing Contact Plan Designer: A Planning Tool for DTN-Based Space-Terrestrial Networks
    Fraire, Juan A.
    [J]. 2017 6TH IEEE INTERNATIONAL CONFERENCE ON SPACE MISSION CHALLENGES FOR INFORMATION TECHNOLOGY (SMC-IT), 2017, : 124 - 127