Related papers: A Fast Percolation-Dijkstra Routing Method for Meg…
The design and launch of large-scale satellite networks create an imminent demand for efficient and delay-minimising routing methods. With the rising number of satellites in such constellations, pre-computing all shortest routes between all…
We propose a percolation based M2M networking architecture and its data transmission method. The proposed network architecture can be server-free and router-free, which allows us to operate routing efficiently with percolations based on six…
In recent years, LEO satellite constellations have become envisioned as a core component of the next-generation wireless communication networks. The successive establishment of mega satellite constellations has triggered further demands for…
The implementation feasibility of control algorithms over very large-scale networks calls for hard constraints regarding communication, computational, and memory requirements. In this paper, the decentralized receding horizon control…
Mega low earth orbit (LEO) satellite constellation is promising in achieving global coverage with high capacity. However, forwarding packets in mega constellation faces long end-to-end delay caused by multi-hop routing and high-complexity…
Percolation threshold of a network is the critical value such that when nodes or edges are randomly selected with probability below the value, the network is fragmented but when the probability is above the value, a giant component…
Laser inter-satellite links (LISLs) of low Earth orbit (LEO) mega-constellations enable high-capacity backbone connectivity in non-terrestrial networks, but their management is challenged by limited laser communication terminals, mechanical…
Capsules as well as dynamic routing between them are most recently proposed structures for deep neural networks. A capsule groups data into vectors or matrices as poses rather than conventional scalars to represent specific properties of…
This work shows potentials for rapid self-organisation of sensor networks where nodes collaborate to relay messages to a common data collecting unit (sink node). The study problem is, in the sense of graph theory, to find a shortest path…
A matching algorithm for the identification of backbones in percolation problems is introduced. Using this procedure, percolation backbones are studied in two- to five-dimensional systems containing 1.7x10^7 sites, two orders of magnitude…
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper investigates how big the failure probability can be, before the…
The structure and routing architecture design is critical for achieving low latency and high capacity in future LEO space networks (SNs). Existing studies mainly focus on topologies of space networks, but there is a lack of analysis on…
Low Earth orbit (LEO) satellite mega constellations are beginning to include laser inter-satellite links (LISLs) to extend the Internet to the most remote locations on Earth. Since the process of establishing these links incurs a setup…
In this paper, the routing in massive low earth orbit (LEO) satellite networks is studied. When the satellite-to-satellite communication distance is limited, we choose different relay satellites to minimize the latency in a constellation at…
K-core percolation is a fundamental dynamical process in complex networks with applications that span numerous real-world systems. Earlier studies focus primarily on random networks without spatial constraints and reveal intriguing…
We present a rapid algorithm for identifying the current-carrying backbone in the percolation model. It applies to general two-dimensional graphs with open boundary conditions. Complemented by the modified Hoshen-Kopelman cluster labeling…
We aim to provide satellite operators and researchers with an efficient means for evaluating and mitigating collision risk during the design process of mega-constellations. We first establish a baseline for evaluating various techniques for…
Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use…
As emerging massive constellations are intended to provide seamless connectivity for remote areas using hundreds of small low Earth orbit (LEO) satellites, new methodologies have great importance to study the performance of these networks.…
We develop new algorithmic techniques for VLSI detailed routing. First, we improve the goal-oriented version of Dijkstra's algorithm to find shortest paths in huge incomplete grid graphs with edge costs depending on the direction and the…