Research on contact graph routing in distributed satellite swarm networks
FANG Weiwei
YAO Xuening
WANG Wenrui
AN Yuan
LI Jing
Abstract：With the development of satellite and communication technology,constellation networks are gradually replaced by distributed self-organized swarm networks,which accordingly leads to the revolution in satellite networks from full-functional large satellites to a large number of micro satellites.This new architecture of satellite network brings new challenges on self-organization and self-adaptation to inter satellite communication and packet routing.From the perspective of delay tolerant network,this paper proposes to utilize the periodic motion of satellites to construct the network topology,and establish contact graphs among satellite nodes to compute and choose routing paths.To cope with exceptional situations,the passively discovering and rerouting mechanism is designed to reconstruct the network topology,and two types of messages (Full/Empty) are employed to avoid congestion and control traffic.The performance of proposed routing algorithm is evaluated and compared with existing work by using the OPNET network simulator.The experiment results show that this new algorithm is more capable of resisting disruptions,and decreases average end-to-end delay from 2 377 s to 16 s,increases average throughput from 1 696 bit/s to 2 895 bit/s,compared to the Flood,Spray-and-wait and Random algorithms.
Keywords：distributed cluster networkscontact graph routingnode failurecongestion avoidance
Publication Date：2017-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：7( 17-23 )