Related papers: Half-Duplex Routing is NP-hard
The Internet can be made more efficient and robust with hop-by-hop multipath routing: Each router on the path can split packets between multiple nexthops in order to 1) avoid failed links and 2) reduce traffic on congested links. Before…
Maximum throughput requires path diversity enabled by bifurcating traffic at different network nodes. In this work, we consider a network where traffic bifurcation is allowed only at a subset of nodes called \emph{routers}, while the rest…
We consider a diamond-shaped dual-hop communication system consisting a source, two parallel half-duplex relays and a destination. In a single antenna configuration, it has been previously shown that a two-phase node-scheduling algorithm,…
This paper considers max-min fair rate allocation and routing in energy harvesting networks where fairness is required among both the nodes and the time slots. Unlike most previous work on fairness, we focus on multihop topologies and…
We consider the following fundamental routing problem. An adversary inputs packets arbitrarily at sources, each packet with an arbitrary destination. Traffic is constrained by link capacities and buffer sizes, and packets may be dropped at…
A weakness of next-hop routing is that following a link or router failure there may be no routes between some source-destination pairs, or packets may get stuck in a routing loop as the protocol operates to establish new routes. In this…
In this paper, we investigate the resource allocation algorithm design for full-duplex simultaneous wireless information and power transfer (FD-SWIPT) systems. The considered system comprises a FD radio base station, multiple single-antenna…
Full-duplex (FD) transmission in a point-to-point (P2P) link, wherein bidirectional traffic flows simultaneously share the same spectrum, has the capability of doubling the link rate by completely removing self-interferences. However, the…
This paper describes an approach for half-duplex cooperative transmission in a classical three-node relay channel. Assuming availability of channel state information at nodes, the approach makes use of this information to optimize distinct…
This paper presents a dual method of closed-form analysis and lightweight simulation that enables an evaluation of the performance of mobile ad hoc networks that is more realistic, efficient, and accurate than those found in existing…
Packet routing is one of the fundamental problems in computer networks in which a router determines the next-hop of each packet in the queue to get it as quickly as possible to its destination. Reinforcement learning (RL) has been…
This paper considers a two-hop network consisting of a source, two parallel half-duplex relay nodes, and two destinations. While the destinations have an adequate power supply, the source and relay nodes rely on harvested energy for data…
This paper reviews the overview of the dynamic shortest path routing problem and the various neural networks to solve it. Different shortest path optimization problems can be solved by using various neural networks algorithms. The routing…
The problem of user scheduling and power allocation in full-duplex (FD) cellular networks is considered, where a FD base station communicates simultaneously with one half-duplex (HD) user on each downlink and uplink channel. First, we…
We study a problem of fundamental importance to ICNs, namely, minimizing routing costs by jointly optimizing caching and routing decisions over an arbitrary network topology. We consider both source routing and hop-by-hop routing settings.…
We formulate and study the thinnest path problem in wireless ad hoc networks. The objective is to find a path from a source to its destination that results in the minimum number of nodes overhearing the message by a judicious choice of…
Relay networks having $n$ source-to-destination pairs and $m$ half-duplex relays, all operating in the same frequency band in the presence of block fading, are analyzed. This setup has attracted significant attention and several relaying…
In this paper, we consider a full duplex wireless powered communication network where multiple users with radio frequency energy harvesting capability communicate to an energy broadcasting hybrid access point. We investigate the minimum…
In Delay Tolerant Networks (DTNs), two-hop routing compromises energy versus delay more conveniently than epidemic routing. Literature provides comprehensive results on optimal routing policies for mobile nodes with homogeneous mobility,…
While routing in wireless networks has been studied extensively, existing protocols are typically designed for a specific set of network conditions and so cannot accommodate any drastic changes in those conditions. For instance, protocols…