Related papers: A Geographic Multi-Copy Routing Scheme for DTNs Wi…
Graph neural networks (GNNs) have been broadly studied on dynamic graphs for their representation learning, majority of which focus on graphs with homogeneous structures in the spatial domain. However, many real-world graphs - i.e.,…
In this paper, we address the problem of optimal relay placement in a cellular network assuming network densification, with the aim of maximizing cell capacity. In our model, a fraction of radio resources is dedicated to the base-station…
We study a heterogeneous wireless sensor network (WSN) where N heterogeneous access points (APs) gather data from densely deployed sensors and transmit their sensed information to M heterogeneous fusion centers (FCs) via multi-hop wireless…
Heterogeneous cellular networks (HCN) with embedded small cells are considered, where multiple mobile users wish to download network content of different popularity. By caching data into the small-cell base stations (SBS), we will design…
We introduce a new graph neural operator-based approach for task allocation in a system of heterogeneous robots composed of Unmanned Ground Vehicles (UGVs) and Unmanned Aerial Vehicles (UAVs). The proposed model, \texttt{\method}, or…
In this paper we present distributed and adaptive algorithms for motion coordination of a group of m autonomous vehicles. The vehicles operate in a convex environment with bounded velocity and must service demands whose time of arrival,…
We consider the problem of routing packets across a multi-hop network consisting of multiple sources of traffic and wireless links while ensuring bounded expected delay. Each packet transmission can be overheard by a random subset of…
This study deals with the problem of optimizing transmit power in high density heterogeneous networks. In the communication network, effective methods of allocating transmit power, in order to reduce the total transmit power, but still…
Optimal transport is a powerful framework for the efficient allocation of resources between sources and targets. However, traditional models often struggle to scale effectively in the presence of large and heterogeneous populations. In this…
A general Continuum Approximation (CA) model is proposed for optimizing transit network designs (TND) in grid cities under spatially heterogeneous demand. While conventional studies often assume rigid geometric line configurations (e.g.,…
A number of geolocation-based Delay Tolerant Networking (DTN) routing protocols have been shown to perform well in selected simulation and mobility scenarios. However, the suitability of these mechanisms for vehicular networks utilizing…
In this paper, we study a routing problem on the Gaussian multiple relay channel, in which nodes employ a decode-and-forward coding strategy. We are interested in routes for the information flow through the relays that achieve the highest…
This study investigates the problem of communication for a network composed of two half-duplex parallel relays with additive white Gaussian noise. Two protocols, i.e., \emph{Simultaneous} and \emph{Successive} relaying, associated with two…
This article proposes a stochastic model to obtain the end-to-end delay law between two nodes of a Delay Tolerant Network (DTN). We focus on the commonly used Binary Spray and Wait (BSW) routing protocol and propose a model that can be…
We study the heterogeneous wireless sensor networks (WSNs) and propose the necessary condition of the optimal sensor deployment. Similar to that in homogeneous WSNs, the necessary condition implies that every sensor node location should…
Wireless Sensor Networks (WSNs) experiences several technical challenges such as limited energy, short transmission range, limited storage capacities, and limited computational capabilities. Moreover, the sensor nodes are deployed randomly…
This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fraction of packets must be transmitted before the end of the deadline.…
We consider the broad class of decentralized optimal resource allocation problems in wireless networks, which can be formulated as a constrained statistical learning problems with a localized information structure. We develop the use of…
We consider the problem of estimation of the node cardinality of each node type in a heterogeneous wireless network with $T$ types of nodes deployed over a large region, where $T \ge 2$ is an integer. A mobile base station (MBS), such as…
This paper proposes a distributed dual gradient tracking algorithm (DDGT) to solve resource allocation problems over an unbalanced network, where each node in the network holds a private cost function and computes the optimal resource by…