Perfect match model based link assignment for optical satellite network

In optical satellite network, the possible optical inter-satellite links (OISLs) candidate for each satellite are usually more than laser communication terminals (LCTs) equipped. This poses the link assignment problem (LAP) of how to assign LCTs of each satellite to establish OISLs with the others....

Full description

Saved in:
Bibliographic Details
Main Authors: Zhe Liu, Wei Guo, Changlin Deng, Weisheng Hu, He Chen, Yanbin Zhao, Ming Xia
Format: Conference Proceeding
Language:English
Subjects:
Bipartite graph
Network topology
Optical fiber networks
Orbits
Satellite broadcasting
Satellites
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In optical satellite network, the possible optical inter-satellite links (OISLs) candidate for each satellite are usually more than laser communication terminals (LCTs) equipped. This poses the link assignment problem (LAP) of how to assign LCTs of each satellite to establish OISLs with the others. In order to make full use of huge bandwidth provided by LCT, the problem of assigning all satellite LCTs to establish OISLs is modeled as a perfect matching problem in the perfect match model, where a perfect matching is searched over a mixed complete bipartite graph. The regular, random greedy and perfect match model based link assignment schemes are considered. Simulation results show that the average node-to-node distance and LCT utilization of perfect match model based link assignment scheme are better than the regular and random greedy link assignment schemes.
ISSN:1550-3607
1938-1883
DOI:10.1109/ICC.2014.6883971