English
Related papers

Related papers: Half-Duplex Routing is NP-hard

200 papers

Single path routing that is currently used in the internet routers,is easy to implement as it simplifies the routing tables and packet flow paths. However it is not optimal and has shortcomings in utilizing the network resources optimally,…

Networking and Internet Architecture · Computer Science 2016-01-07 Rashmi Singh , Yatindra Nath Singh , Anita Yadav

Energy harvesting (EH) has recently emerged as a promising technique for green communications. To realize its potential, communication protocols need to be redesigned to combat the randomness of the harvested energy. In this paper, we…

Information Theory · Computer Science 2016-11-17 Yaming Luo , Jun Zhang , Khaled B. Letaief

Full-duplex (FD) systems have emerged as an es- sential enabling technology to further increase the data rate of wireless communication systems. The key idea of FD is to serve multiple users over the same bandwidth with a base station (BS)…

Information Theory · Computer Science 2017-02-07 Van-Dinh Nguyen , Hieu V. Nguyen , Chuyen T. Nguyen , Oh-Soon Shin

This paper investigates the simplification problem in Gaussian Half-Duplex (HD) diamond networks. The goal is to answer the following question: what is the minimum (worst-case) fraction of the total HD capacity that one can always achieve…

Information Theory · Computer Science 2018-10-16 Martina Cardone , Christina Fragouli , Daniela Tuninetti

We consider a novel routing protocol suitable for ad-hoc networks with dynamically changing topologies, such as DECT 2020 NR (NR+) systems, which often lead to missing links between the nodes and thus, incomplete or inefficient routes. A…

Networking and Internet Architecture · Computer Science 2025-03-20 Niclas Führling , Ivan Alexander Morales Sandoval , Giuseppe Thadeu Freitas de Abreu

We consider optimal route planning when the objective function is a general nonlinear and non-monotonic function. Such an objective models user behavior more accurately, for example, when a user is risk-averse, or the utility function needs…

Data Structures and Algorithms · Computer Science 2015-11-24 Ger Yang , Evdokia Nikolova

We consider two capacity problems in P2P networks. In the first one, the nodes have an infinite amount of data to send and the goal is to optimally allocate their uplink bandwidths such that the demands of every peer in terms of receiving…

Data Structures and Algorithms · Computer Science 2009-09-18 Jacob Chakareski , Pascal Frossard , Hervé Kerivin , Jimmy Leblet , Gwendal Simon

Mobile ad-hoc network (MANET) is a dynamic collection of mobile computers without the need for any existing infrastructure. Nodes in a MANET act as hosts and routers. Designing of robust routing algorithms for MANETs is a challenging task.…

Neural and Evolutionary Computing · Computer Science 2017-12-20 Mansour Sheikhan , Ehsan Hemmati

We investigate the problem of scheduling the maintenance of edges in a network, motivated by the goal of minimizing outages in transportation or telecommunication networks. We focus on maintaining connectivity between two nodes over time;…

Data Structures and Algorithms · Computer Science 2017-02-01 Fidaa Abed , Lin Chen , Yann Disser , Martin Groß , Nicole Megow , Julie Meißner , Alexander T. Richter , Roman Rischke

Maximizing the minimum rate for a full-duplex multiple-input multiple-output (MIMO) wireless network encompassing two sources and a two-way (TW) relay operating in a two hop manner is investigated. To improve the overall performance, using…

Signal Processing · Electrical Eng. & Systems 2020-04-06 Erfan Khordad , Ata Khalili , Soroush Akhlaghi

The support of a flow $x$ in a network is the subdigraph induced by the arcs $uv$ for which $x(uv)>0$. We discuss a number of results on flows in networks where we put certain restrictions on structure of the support of the flow. Many of…

Discrete Mathematics · Computer Science 2024-05-16 Stéphane Bessy , Jørgen Bang-Jensen , Lucas Picasarri-Arrieta

We develop distributed algorithms to allocate resources in multi-hop wireless networks with the aim of minimizing total cost. In order to observe the fundamental duplexing constraint that co-located transmitters and receivers cannot operate…

Networking and Internet Architecture · Computer Science 2016-11-15 Yufang Xi , Edmund M. Yeh

Routing in multi-hop wireless networks is a complex problem, especially in heterogeneous networks where multiple wireless communication technologies coexist. Reinforcement learning (RL) methods, such as Q-learning, have been introduced for…

Signal Processing · Electrical Eng. & Systems 2025-08-21 Brian Kim , Justin H. Kong , Terrence J. Moore , Fikadu T. Dagefu

In this paper different optimization of Ad-hoc routing algorithm is surveyed and a new method using training based optimization algorithm for reducing the complexity of routing algorithms is suggested. A binary matrix is assigned to each…

Networking and Internet Architecture · Computer Science 2012-06-11 Sarvesh Kumar Sharma

Several high-throughput distributed data-processing applications require multi-hop processing of streams of data. These applications include continual processing on data streams originating from a network of sensors, composing a multimedia…

Distributed, Parallel, and Cluster Computing · Computer Science 2009-03-26 Shah Asaduzzaman , Muthucumaru Maheswaran

We consider "virtual" full-duplex relaying by means of half-duplex relays. In this configuration, each relay stage in a multi-hop relaying network is formed by at least two relays, used alternatively in transmit and receive modes, such that…

Information Theory · Computer Science 2013-11-26 Song-Nam Hong , Giuseppe Caire

In this paper, we investigate resource allocation algorithm design for full-duplex (FD) cognitive radio systems. The secondary network employs a FD base station for serving multiple half-duplex downlink and uplink users simultaneously. We…

Information Theory · Computer Science 2016-02-23 Yan Sun , Derrick Wing Kwan Ng , Nikola Zlatanov , Robert Schober

In this paper, we present a new routing paradigm that generalizes opportunistic routing in wireless mesh networks. In multirate anypath routing, each node uses both a set of next hops and a selected transmission rate to reach a destination.…

Networking and Internet Architecture · Computer Science 2010-11-01 Rafael Laufer , Leonard Kleinrock

Radio frequency (RF) energy harvesting is key in attaining perpetual lifetime for time-critical wireless powered communication networks due to full control on energy transfer, far field region, small and low-cost circuitry. In this paper,…

Signal Processing · Electrical Eng. & Systems 2020-06-23 Muhammad Shahid Iqbal , Yalcin Sadi , Sinem Coleri

We suggest a method for routing when the source does not posses full information about the shortest path to the destination. The method is particularly useful for scale-free networks, and exploits its unique characteristics. By assigning…

Networking and Internet Architecture · Computer Science 2007-05-23 Shai Carmi , Reuven Cohen , Danny Dolev