Related papers: MPAR: A Movement Pattern-Aware Optimal Routing for…
Optimal delay-throughput trade-offs for two-dimensional i.i.d mobility models have been established in [23], where we showed that the optimal trade-offs can be achieved using rate-less codes when the required delay guarantees are sufficient…
The design of multitarget rendezvous missions requires a method to quickly and accurately approximate the optimal transfer between any two rendezvous targets. In this paper, a deep neural network (DNN)-based method is proposed for quickly…
Delay-tolerant networks (DTNs) are characterized by a possible absence of end-to-end communication routes at any instant. Still, connectivity can generally be established over time and space. The optimality of a temporal path (journey) in…
To model time series accurately is important within a wide range of fields. As the world is generally too complex to be modelled exactly, it is often meaningful to assess the probability of a dynamical system to be in a specific state. This…
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…
We compare the long-term, steady-state performance of a variant of the standard Dynamic Alternative Routing (DAR) technique commonly used in telephone and ATM networks, to the performance of a path-selection algorithm based on the…
In this paper, the problem of vertical handover in software-defined network (SDN) based heterogeneous networks (HetNets) is studied. In the studied model, HetNets are required to offer diverse services for mobile users. Using an SDN…
In this work, we propose buffer-aided distributed space-time coding (DSTC) schemes and relay selection algorithms for cooperative direct-sequence code-division multiple access (DS-CDMA) systems. We first devise a relay pair selection…
To cope with fast-fluctuating distributed energy resources (DERs) and uncontrolled loads, this paper formulates a time-varying optimization problem for distribution grids with DERs and develops a novel non-iterative algorithm to track the…
Control and communication are often tightly coupled in motion planning of networked mobile robots, due to the fact that robotic motions will affect the overall communication quality, and the quality of service (QoS) of the communication…
In cognitive radio networks (CRNs), establishing a communication link between a pair of secondary users (SUs) requires them to rendezvous on a common channel which is not occupied by primary users (PUs). Under time-varying PU traffic,…
Modern multi-access 5G+ networks provide mobile terminals with additional capacity, improving network stability and performance. However, in highly mobile environments such as vehicular networks, supporting multi-access connectivity remains…
Millimeter wave (\texttt{mmWave}) channels in device to device (\texttt{D2D}) communication are susceptible to blockages in spite of using directional beams from multi-input multi-output (\texttt{MIMO}) antennas to compensate for high…
This paper studies distributed resource allocation problem in multi-agent systems, where all the agents cooperatively minimize the sum of their cost functions with global resource constraints over stochastic communication networks. This…
Despite of the importance of access to computers and to the Internet for the development of people and their inclusion in society, there are people that still suffer with digital divide and social exclusion. Delay/Disruption-Tolerant…
Tensor parallelism is an essential technique for distributed training of large neural networks. However, automatically determining an optimal tensor parallel strategy is challenging due to the gigantic search space, which grows…
We study the problem of planning Pareto-optimal journeys in public transit networks. Most existing algorithms and speed-up techniques work by computing subjourneys to intermediary stops until the destination is reached. In contrast, the…
To support reliable and low-latency communication, Time-Sensitive Networking introduced protocols and interfaces for resource allocation in Ethernet. However, the implementation of these allocation algorithms has not yet been covered by the…
Following the tracking-by-attention paradigm, this paper introduces an object-centric, transformer-based framework for tracking in 3D. Traditional model-based tracking approaches incorporate the geometric effect of object- and ego motion…
In this article, we propose a novel formulation for the resource allocation problem of a sliced and disaggregated Radio Access Network (RAN) and its transport network. Our proposal assures an end-to-end delay bound for the Ultra-Reliable…