STAG-Based QoS Support Routing Strategy for Multiple Missions Over the Satellite Networks

As the typical delay tolerant networks, the satellite networks possess the intermittent connections, the large-scale time delays and the time-varying topologies. Obviously, such features seriously affect the delivery of mission data with certain requirements on the traffic or latency. To decrease the delivery time, existing relay-based contact graph routing (CGR) method selects the earliest reachable path to forward mission data. However, this method cannot guarantee the transmission of a large amount data and wastes the rare contact opportunities. Therefore, in this paper, we focus on the transmission QoS problem of multiple missions over the satellite networks, and design a QoS support routing strategy to achieve multiple flow-maximizing paths with acceptable delivery delays. Especially, with the storage time aggregated graph (STAG), we construct an on-demand mission model to depict both the network dynamic characteristics and the different mission requirements, and then reduce the QoS support problem as a graph-based maximum flow problem. To solve this problem, one STAG-based multiple flow-maximizing routing scheme is proposed to ensure the mission QoS and match the rare network resources, which has low computation complexity. Finally, compared with CGR, simulation results demonstrate the proposed scheme can achieve a higher mission completion rate and resource utilization rate.

[1]  Jing Feng,et al.  A Scheme for Software Defined ORS Satellite Networking , 2014, 2014 IEEE Fourth International Conference on Big Data and Cloud Computing.

[2]  Nacer-Eddine Zergainoh,et al.  Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations , 2017, J. Comput. Networks Commun..

[3]  D. R. Fulkerson,et al.  Constructing Maximal Dynamic Flows from Static Flows , 1958 .

[4]  Xiaohua Jia,et al.  Delay-bounded and minimal transmission broadcast in LEO satellite networks , 2016, 2016 IEEE International Conference on Communications (ICC).

[5]  Markus Werner,et al.  A Dynamic Routing Concept for ATM-Based Satellite Personal Communication Networks , 1997, IEEE J. Sel. Areas Commun..

[6]  Fulong Chen,et al.  An overview of satellite synthetic aperture radar remote sensing in archaeology: From site detection to monitoring , 2017 .

[7]  Scott Burleigh Contact Graph Routing , 2010 .

[8]  Igor Bisio,et al.  Contact graph routing in DTN space networks: overview, enhancements and performance , 2015, IEEE Communications Magazine.

[9]  Marco Fiore,et al.  Temporal connectivity of vehicular networks: The power of store-carry-and-forward , 2015, 2015 IEEE Vehicular Networking Conference (VNC).

[10]  Lei Chen,et al.  Space-based visible observation strategy for beyond-LEO objects based on an equatorial LEO satellite with multi-sensors , 2017 .

[11]  Wei-Ping Zhu,et al.  Secure Transmission in Cognitive Satellite Terrestrial Networks , 2016, IEEE Journal on Selected Areas in Communications.

[12]  Igor Bisio,et al.  Multimedia Content Delivery for Emerging 5G-Satellite Networks , 2016, IEEE Transactions on Broadcasting.

[13]  Peng Yuan,et al.  An event-driven graph-based min-cost delivery algorithm in earth observation DTN networks , 2015, 2015 International Conference on Wireless Communications & Signal Processing (WCSP).

[14]  Jean-Loup Guillaume,et al.  Temporal reachability graphs , 2012, Mobicom '12.

[15]  Marwan Younis,et al.  Tandem-L: A Highly Innovative Bistatic SAR Mission for Global Observation of Dynamic Processes on the Earth's Surface , 2015, IEEE Geoscience and Remote Sensing Magazine.

[16]  Baokang Zhao,et al.  Improving the snapshot routing performance through reassigning the inter-satellite links , 2015, 2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[17]  Jiandong Li,et al.  A Dynamic Combined Flow Algorithm for the Two-Commodity Max-Flow Problem Over Delay-Tolerant Networks , 2018, IEEE Transactions on Wireless Communications.

[18]  Tao Zhang,et al.  A maximum flow algorithm based on storage time aggregated graph for delay-tolerant networks , 2017, Ad Hoc Networks.

[19]  Jari Saramäki,et al.  Temporal Networks , 2011, Encyclopedia of Social Network Analysis and Mining.

[20]  Tao Zhang,et al.  A Storage-Time-Aggregated Graph-Based QoS Support Routing Strategy for Satellite Networks , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[21]  H. K. Ramapriyan,et al.  The Role and Evolution of NASA's Earth Science Data Systems , 2015 .

[22]  Shashi Shekhar,et al.  Time-Aggregated Graphs for Modeling Spatio-temporal Networks , 2006, J. Data Semant..

[23]  Haitham S. Cruickshank,et al.  Delay- and Disruption-Tolerant Networking (DTN): An Alternative Solution for Future Satellite Networking Applications , 2011, Proceedings of the IEEE.

[24]  Ramón Martínez Rodríguez-Osorio,et al.  Survey of Inter-Satellite Communication for Small Satellite Systems: Physical Layer to Network Layer View , 2016, IEEE Communications Surveys & Tutorials.

[25]  Carlo Caini,et al.  Application of Contact Graph Routing to LEO satellite DTN communications , 2012, 2012 IEEE International Conference on Communications (ICC).

[26]  Byrav Ramamurthy,et al.  EAODR: A novel routing algorithm based on the Modified Temporal Graph network model for DTN-based Interplanetary Networks , 2017, Comput. Networks.

[27]  Haifeng Li,et al.  Distributed contact plan design for multi-layer satellite-terrestrial network , 2018, China Communications.

[28]  Hejiao Huang,et al.  Collaborative Data Downloading by Using Inter-Satellite Links in LEO Satellite Networks , 2017, IEEE Transactions on Wireless Communications.

[29]  Juan A. Fraire,et al.  Design challenges in contact plans for disruption-tolerant satellite networks , 2015, IEEE Communications Magazine.