A Distributed Link Assignment (Reconstitution) Algorithm for Space-Based SDI Networks

Cain, J. Bibb; Adams, S. L.; Noakes, Michael D.; Knoke, Peter J.; Althouse, Edwin L.

doi:10.1109/milcom.1987.4795270

Cited by 15 publications

(4 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Noakes et al 9 presented an adaptive link assignment algorithm for distributed optimization of dynamical changing network to emphasize robustness in stressed environments. Cain et al 10 examined the link assignment problem for a mid-course, space-based spatial data infrastructure (SDI) architecture and proposed a link assignment algorithm designed to recover from predictable link outages. Ito et al 11 discussed the time slot scheduling problem for a satellite switched/timedivision multiple access system.…”

Section: Related Workmentioning

confidence: 99%

Topology-adapting routing strategy for global navigation satellite system

Zhao¹,

Yi²,

Hou³

2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In order to implement global precision navigation, the global navigation satellite system must rely on information exchange with the ground station to achieve system time synchronization and inter-satellite ranging. For the limitations of ground stations located in territory and actual communication requirements, it is essential to study the routing problem of navigation satellite network, which indicates that traditional routing technology cannot meet the requirements of global navigation satellite system. Aiming to control the dynamic topology of global navigation satellite system and satisfy communication constraints, we investigate the topology-adapting strategy for inter-satellite link constructing and routing. First, we propose the design method of the inter-satellite link scheme based on fixed topology to satisfy the requirements for delay and relay hops. Then, we build the constraint programming model of the global navigation satellite system routing problem. In further, we design the routing calculation framework and optimization strategies to enhance the routing performance of the transmission scheme. Through the simulation and numerical results, we demonstrate that the fixed topology scheme can meet the navigation requirements, and the proposed strategy can effectively improve the routing performance.

show abstract

Section: Related Workmentioning

confidence: 99%

Topology-adapting routing strategy for global navigation satellite system

Zhao¹,

Yi²,

Hou³

2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…Harathi et al [14] provided an autonomous linking assignment algorithm based on the Line-Of-Sight (LOS) visibility of the satellites in constellation. Literatures [15,16] also proposed some link assignment and routing algorithms with object of network robustness. Moreover, by using the theory of Finite State Automation (FSA), the link assignment problem in LEO satellite networks can be treated as a set of link assignment problems in fixed topology networks [17].…”

Section: D Topology Matrix Based Isl Routing Problemmentioning

confidence: 99%

“…The illustrations of topological matrixes are not provided here for conciseness. Figures 14,15,16,17,18,and 19 show the simulation results of using just 2 agile scanning ISL beams in each satellite. The dashed blue lines in Figure 17 denote the path searching process relying on the visible satellites from ground station.…”

Section: Simulation With Isl Antenna Configuration Constraintmentioning

confidence: 99%

A Simple Three-Dimensional Matrix Method for Global Constellation Intrasatellite Link Topological Design

Wang

Meng

et al. 2014

International Journal of Navigation and Observation

View full text Add to dashboard Cite

A three-dimensional matrix method is proposed in this paper for Global Navigation Satellite System (GNSS) constellation Intrasatellite Link (ISL) topological design. The rows and columns of proposed matrix contain the information of both constellation orbit planes and satellites in each orbit plane. The third dimension of proposed matrix represents the time sequences during constellation movement. The proposed method has virtues of better advantage of conceptual clarity and computational efficiency, meanwhile, some properties of ISLs in the constellation can be proved easily. At the second part of this paper, a link assignment and optimal routing problem is proposed using three-dimensional topology matrixes, which aimed to minimize the relay hops during the process of data uploading to whole constellation network. Moreover, some practical constrains as antenna beam coverage and relative velocity are considered and analyzed in detail. Finally, some numerical simulations are provided, and the results demonstrated the promising performance of proposed topological method in reduction of computation burden, clear ISL conception, and so forth; the efficiency of provided optimal ISL routing problem is also proved.

show abstract

“…A key question needs to be answered is how to accommodate the requirements of both navigation and communication in link assignment procedures. Though link assignment algorithms have been studied previously, for example a distribute algorithm maximizing network connectivity [4], [5]and another algorithm taking traffic requirement and maximizing the overall network performance [6], there are no research results published yet about the algorithm applicable for both crosslink ranging and communication needs. This paper focuses on the link assignment problem and proposes an algorithm suitable for both crosslink ranging and communication needs.…”

Section: Introductionmentioning

confidence: 99%

A link assignment algorithm for GNSS with crosslink ranging

Shi

Xiang

Tang

2011

2011 International Conference on Localization and GNSS (ICL-GNSS)

View full text Add to dashboard Cite

In satellite navigation system using spot beam to build inter-satellite link (ISL) for Autonomous Navigation, each satellite has less number of transceivers than its visible satellites, which poses the natural problem of how to assign these transceivers to point other satellites effectively in order to meet the both crosslink ranging and data exchange requirements of Autonomous Navigation. This paper provides a topology model applicable for both requirements. Based the topology model, this paper presents a link assignment algorithm which is designed to maximize the quantity of crosslink ranging information periodically and to improve the communication performance of inter-satellite network simultaneously. Although some communication performance loss is inevitable to perform link assignment for crosslink ranging, the simulation results show that the algorithm gives better communication performance than mesh-link link assignment which is adopted in Iridium system in up to 80 percent of each satellite period.

show abstract

A Distributed Link Assignment (Reconstitution) Algorithm for Space-Based SDI Networks

Cited by 15 publications

References 0 publications

Topology-adapting routing strategy for global navigation satellite system

Topology-adapting routing strategy for global navigation satellite system

A Simple Three-Dimensional Matrix Method for Global Constellation Intrasatellite Link Topological Design

A link assignment algorithm for GNSS with crosslink ranging

Contact Info

Product

Resources

About