Scoping Contact Graph-Routing Scalability Investigating the System's Usability in Space-Vehicle Communication Networks

被引：23

作者：

Wang, Guosheng ^{[1
]}

Burleigh, Scott C. ^{[2
]}

Wang, Ruhai ^{[1
,3
,4
]}

Shi, Leilei ^{[1
]}

Qian, Yi ^{[5
,6
]}

机构：

[1] Soochow Univ, Sch Elect & Informat Engn, Suzhou, Peoples R China

[2] CALTECH, Jet Prop Lab, Pasadena, CA USA

[3] Lamar Univ, Dept Elect Engn, Beaumont, TX 77710 USA

[4] Nanjing Univ, Nanjing, Jiangsu, Peoples R China

[5] Univ Nebraska Lincoln, Dept Elect & Comp Engn, Omaha, NE USA

[6] IEEE Vehicular Technol Soc, Omaha, NE USA

来源：

IEEE VEHICULAR TECHNOLOGY MAGAZINE | 2016年 / 11卷 / 04期

基金：

中国国家自然科学基金;

关键词：

D O I：

10.1109/MVT.2016.2594796

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Delay-tolerant networking (DTN) is considered one of the most suitable technologies to handle challenging spacevehicle communications. Routing is critical in the DTN architecture. Contact graph routing (CGR) is a dynamic system that computes routes through a time-varying topology of scheduled communication contacts in the DTN architecture. There is an urgent need to study the scalability of CGR to very large networks. Following a discussion of CGR's operation, we present a performance evaluation of CGR over time-varying topologies of a range of sizes. The intent is to have an understanding of its usability in a space-vehicle communication network with a large number of nodes. © 2005-2012 IEEE.

引用

页码：46 / 52

页数：7