Related papers: Centralized Versus Distributed Routing for Large-S…
Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are even greater when nodes perform mutual information…
We analyze different strategies aimed at optimizing routing policies in the Internet. We first show that for a simple deterministic algorithm the local properties of the network deeply influence the time needed for packet delivery between…
Since the packet is transmitted to a set of relaying nodes in opportunistic routing strategy, so the transmission delay and the duplication transmission are serious. For reducing the transmission delay and the duplicate transmission, in…
In this paper, we introduce a delay-aware largesmall model collaboration scheme for low Earth orbit (LEO) satellite networks, which can balance the computational load among satellites and the communication load across inter-satellite links.…
We consider multi-hop wireless networks serving multiple flows in which only packets that meet hard end-to-end deadline constraints are useful, i.e., if a packet is not delivered to its destination node by its deadline, it is dropped from…
In this study, we explore the integration of satellites with ground-based communication networks. Specifically, we analyze downlink data transmission from a constellation of satellites to terrestrial users and address the issue of delayed…
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 distributed algorithm for controlling traffic signals. Our algorithm is adapted from backpressure routing, which has been mainly applied to communication and power networks. We formally prove that our algorithm ensures global…
This article introduces a novel family of decentralised caching policies, applicable to wireless networks with finite storage at the edge-nodes (stations). These policies, that are based on the Least-Recently-Used replacement principle, are…
This paper presents a novel storage aware routing (STAR) protocol designed to provide a general networking solution over a broad range of wired and wireless usage scenarios. STAR enables routing policies which adapt seamlessly from a…
The advancements of remote sensing (RS) pose increasingly high demands on computation and transmission resources. Conventional ground-offloading techniques, which transmit large amounts of raw data to the ground, suffer from poor…
This dissertation is a study on the design and analysis of novel, optimal routing and rate control algorithms in wireless, mobile communication networks. Congestion control and routing algorithms upto now have been designed and optimized…
This paper presents a distributed resource selection mechanism for diverse cloud-edge environments, enabling dynamic and context-aware allocation of resources to meet the demands of complex distributed applications. By distributing the…
This paper addresses the limitations of current satellite payload architectures, which are predominantly hardware-driven and lack the flexibility to adapt to increasing data demands and uneven traffic. To overcome these challenges, we…
We study online graph queries that retrieve nearby nodes of a query node from a large network. To answer such queries with high throughput and low latency, we partition the graph and process the data in parallel across a cluster of servers.…
Quantum repeater networks distribute entanglement over lossy links while many users share a limited pool of entangled pairs. Most existing routing schemes either always use a single best path or rely on global optimizations that are hard to…
In capsule networks, the routing algorithm connects capsules in consecutive layers, enabling the upper-level capsules to learn higher-level concepts by combining the concepts of the lower-level capsules. Capsule networks are known to have a…
This article investigates and evaluate a handover exchange scheme between two secondary users (SUs) moving in different directions across the handover region of neighbouring cell in a cognitive radio network. More specifically, this…
We study a distributed framework for stochastic optimization which is inspired by models of collective motion found in nature (e.g., swarming) with mild communication requirements. Specifically, we analyze a scheme in which each one of $N >…
The performance of centralized and distributed massive MIMO deployments are analyzed for indoor office scenarios. The distributed deployments use one of the following precoding methods: (1) local precoding with local channel state…