Virtual Topology for LEO Satellite Networks Based on Earth-Fixed Footprint Mode

Lü, Yong; Sun, Fuchun; Zhao, Youjian

doi:10.1109/lcomm.2013.011113.122635

Cited by 79 publications

(50 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…How to promote the use efficiency of satellite resources is a hot topic because of the high costs of space communication. Some of outcomes are shown in [6,7] to solve the problem from the perspective of network topology. In recent years, many routing schemes using game theory and optimization theory have appeared in the literatures [8][9][10].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Queuing Game Theory Based Optimal Routing Scheme for Heterogeneous Users over Space Information Networks

Guo

Gong

et al. 2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

An optimal routing scheme in space information networks was presented to balance network loads for heterogeneous users. According to the competition among the nodes, the model was built based on queuing game theory. The virtual routing platform was in charge of resources allocation and route selection. It got user's gain to decide which node the user joined in. Owning to the existing of heterogeneous users, an optimal admission fee needed to be obtained to avoid congestion. In our model, firstly, the whole welfare of the system was formulated. Then the optimal admission fee was calculated through maximizing the whole welfare. Meanwhile, the average maximum queue length was generated to set the buffer space of the node. At last, a routing factor was introduced into the route algorithm in order that the optimal routing could be selected by heterogeneous users. As a result, the system welfare reaches the maximum.

show abstract

Section: Related Workmentioning

confidence: 99%

“…In [7], a virtual topology model was clarified based on Virtual Node method for low earth orbit satellite networks. It formalized the definition and designed routing protocol to reduce the requisite snapshots, optimize the snapshot length, and prevent path stretch and contraction.…”

Section: Related Workmentioning

confidence: 99%

Queuing Game Theory Based Optimal Routing Scheme for Heterogeneous Users over Space Information Networks

Guo

Gong

et al. 2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Based on the Earth-fixed footprint and extraordinary synchronization of the LSN, the footprint-based virtual topology (FVT) [22] is an effective model to reduce the topological dynamics of LSNs as many as possible. In order to eliminate the changes of the virtual topology in FVT, the virtual links between the footprint affected by the latitude threshold and its neighbors of different planes are not defined in [22], even though the Interplane ISL between them might last for a moment.…”

Section: Network Modelmentioning

confidence: 99%

“…In order to eliminate the changes of the virtual topology in FVT, the virtual links between the footprint affected by the latitude threshold and its neighbors of different planes are not defined in [22], even though the Interplane ISL between them might last for a moment. The disadvantage of the above method is that the affected footprint part where actual Interplane ISL exists can't enjoy the communication.…”

Section: Network Modelmentioning

confidence: 99%

“…Based on the Earth-fixed handover [20,21] of the satellite antenna systems, we put forward the virtual topology model FVT [22] in the previous research. This model not only generates few snapshots and well-proportioned snapshot length, but also can overcome the main limitation of conventional Satellite Group and Group Manager method in the two-layered LEO/MEO satellite networks.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Low-Load Survivable Routing Protocol for LEO Satellite Networks

Lü¹,

Zhao

Sun

et al. 2015

Int J Wireless Inf Networks

View full text Add to dashboard Cite

In this paper, we put forward the methods of footprint shift and separation for the virtual topology model of LEO satellite networks, which can reduce the effects of the Polar Regions and cross-seam inter-satellite-links (ISLs) on the virtual topology and improve the utilization of ISLs. Furthermore, a low-load survivable routing protocol called Virtual Snapshot Routing Protocol is proposed for LEO satellite networks. The proposed protocol not only reduces the routing computation and storage overheads, but also provides good routing survivability under random satellite failure. The experimental results confirm our conclusions.

show abstract

Fast and upper bounded Fano decoding algorithm: queuing analysis

Darabkh

2015

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

In computer networking, having limited buffer size is one of the vital causes of splitting the messages into smaller frames to be then transmitted over the network. Increasing the buffer size will not improve the case much but rather it is likely to degrade the performance of the system if it is not investigated properly. On the other hand, frames' retransmissions, as a result of frames being corrupted or dropped, need to be avoided as much as possible because of possible network congestion. To investigate the problem of undesired retransmissions, this paper addresses the use of convolutional codes utilising variable complexity decoding algorithms, such as the Fano algorithm, which mainly aim to mitigate frames' retransmissions caused by frames' corruption. It is noteworthy to mention that the rapid growth of wireless technologies has attracted everybody's attention. As wireless technology evolves, new decoding algorithms are emerging to demonstrate designs with variable power consumptions. Hence, in this paper, we propose a novel queuing model that describes not only frame arriving and departing processes after getting decoded according to how worse the channel condition is or what is the remaining system power but also a decoder with a double speed compared with what is best scrutinised in the literature. Moreover, in our buffering model, we can reduce the number of frames being dropped because of insufficient buffer size, and unwanted retransmissions owing to long frame waiting time, by virtue of bestowing larger buffer size, through our derived closed-form expression that represents the expected number of awaiting frames in the buffers of Fano decoders parameterised by channel status, decoding threshold and frame arriving probability. As far as the system occupancy is concerned and over what have been previously proposed, our analytical results show impressive improvements. As such, through our proposed queuing model, the required decoder's buffer is substantially smaller of what that obtained by a prior model, considering the same networking parameters, which prompts decreasing the average frame waiting time. Copyright

show abstract

Virtual Topology for LEO Satellite Networks Based on Earth-Fixed Footprint Mode

Cited by 79 publications

References 11 publications

Queuing Game Theory Based Optimal Routing Scheme for Heterogeneous Users over Space Information Networks

Queuing Game Theory Based Optimal Routing Scheme for Heterogeneous Users over Space Information Networks

Low-Load Survivable Routing Protocol for LEO Satellite Networks

Fast and upper bounded Fano decoding algorithm: queuing analysis

Contact Info

Product

Resources

About