English
Related papers

Related papers: Throughput-Optimal Broadcast in Wireless Networks …

200 papers

A dynamic routing policy, referred to as Heat-Diffusion (HD), is developed for multihop uniclass wireless networks subject to random traffic, time-varying topology and inter-channel interference.The policy uses only current condition of…

Networking and Internet Architecture · Computer Science 2019-02-18 Reza Banirazi , Edmond Jonckheere , Bhaskar Krishnamachari

Consider a multihop wireless network serving multiple flows in which wireless link interference constraints are described by a link interference graph. For such a network, we design routing-scheduling policies that maximize the end-to-end…

Networking and Internet Architecture · Computer Science 2017-09-13 Rahul Singh , P. R. Kumar , Eytan Modiano

Caching and multicasting at base stations are two promising approaches to support massive content delivery over wireless networks. However, existing scheduling designs do not make full use of the advantages of the two approaches. In this…

Information Theory · Computer Science 2016-02-25 Bo Zhou , Ying Cui , Meixia Tao

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…

Systems and Control · Electrical Eng. & Systems 2020-02-11 Muhammad Shahid Iqbal , Yalcin Sadi , Sinem Coleri

Scheduling is a critical and challenging resource allocation mechanism for multihop wireless networks. It is well known that scheduling schemes that favor links with larger queue length can achieve high throughput performance. However,…

Networking and Internet Architecture · Computer Science 2016-11-17 Bo Ji , Changhee Joo , Ness B. Shroff

We analyze the problem of scheduling in wireless networks to meet end-to-end service guarantees, defined by instantaneous throughput and hard packet deadlines. Using a network slicing model to decouple the queueing dynamics between flows,…

Networking and Internet Architecture · Computer Science 2026-04-21 Nicholas Jones , Eytan Modiano

This work considers the design of online transmission policy in a wireless-powered communication system with a given energy budget. The system design objective is to maximize the long-term throughput of the system exploiting the energy…

Information Theory · Computer Science 2019-02-26 Xian Li , Xiangyun Zhou , Derrick Wing Kwan Ng , Changyin Sun

This paper studies the newly emerging wireless powered communication network (WPCN) in which one hybrid access point (H-AP) with constant power supply coordinates the wireless energy/information transmissions to/from distributed users that…

Information Theory · Computer Science 2014-07-22 Hyunsgsik Ju , Rui Zhang

The present paper focuses on the problem of broadcasting information in the most efficient manner in a large two-dimensional ad hoc wireless network at low SNR and under line-of-sight propagation. A new communication scheme is proposed,…

Information Theory · Computer Science 2016-11-18 Serj Haddad , Olivier Leveque

This paper investigates a wireless powered communication network (WPCN) under the protocol of harvest-then-transmit,where a hybrid access point with constant power supply replenishes the passive user nodes by wireless power transfer in the…

Information Theory · Computer Science 2014-03-17 Qian Sun , Gang Zhu , Chao Shen , Xuan Li , Zhangdui Zhong

By allowing a large number of links to be simultaneously transmitted, directional antenna arrays with beamforming have been envisioned as a promising candidate to reach unprecedented levels of spatial isolation. To achieve the high…

Information Theory · Computer Science 2019-01-16 Yilin Li , Jian Luo , Richard A. Stirling-Gallacher , Giuseppe Caire

In this paper, we study how to determine concurrent transmissions and the transmission power level of each link to maximize spectrum efficiency and minimize energy consumption in a wireless ad hoc network. The optimal joint transmission…

Networking and Internet Architecture · Computer Science 2017-06-20 Kamal Rahimi Malekshan , Weihua Zhuang

We address the problem of efficient data gathering in a wireless network through multi-hop communication. We focus on the objective of minimizing the maximum flow time of a data packet. We prove that no polynomial time algorithm for this…

Data Structures and Algorithms · Computer Science 2019-07-01 Vincenzo Bonifaci , Peter Korteweg , Alberto Marchetti-Spaccamela , Leen Stougie

We consider unreliable multi-hop networks serving multiple flows in which packets not delivered to their destination nodes by their deadlines are dropped. We address the design of policies for routing and scheduling packets that optimize…

Networking and Internet Architecture · Computer Science 2021-04-27 Rahul Singh , P. R. Kumar

This article investigates the problem of dynamic spectrum access for canonical wireless networks, in which the channel states are time-varying. In the most existing work, the commonly used optimization objective is to maximize the…

Information Theory · Computer Science 2017-07-31 Yuhua Xu , Jinlong Wang , Qihui Wu , Jianchao Zheng , Liang Shen , Alagan Anpalagan

We analyze the problem of scheduling in wireless networks to meet end-to-end service guarantees. Using network slicing to decouple the queueing dynamics between flows, we show that the network's ability to meet hard throughput and deadline…

Networking and Internet Architecture · Computer Science 2024-09-17 Nicholas Jones , Eytan Modiano

In the advent of large-scale multi-hop wireless technologies, such as MANET, VANET, iThings, it is of utmost importance to devise efficient distributed protocols to maintain network architecture and provide basic communication tools. One of…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-02-19 Tomasz Jurdzinski , Dariusz R. Kowalski , Tomasz Maciejewski , Grzegorz Stachowiak

In this paper, we propose a cross-layer scheduling algorithm that achieves a throughput "epsilon-close" to the optimal throughput in multi-hop wireless networks with a tradeoff of O(1/epsilon) in delay guarantees. The algorithm aims to…

Information Theory · Computer Science 2011-01-26 Dongyue Xue , Eylem Ekici

As energy harvesting communication systems emerge, there is a need for transmission schemes that dynamically adapt to the energy harvesting process. In this paper, after exhibiting a finite-horizon online throughput-maximizing scheduling…

Information Theory · Computer Science 2013-05-21 Baran Tan Bacinoglu , Elif Uysal-Biyikoglu

A wireless network in which packets are broadcast to a group of receivers through use of a random access protocol is considered in this work. The relation to previous work on networks of interacting queues is discussed and subsequently, the…

Information Theory · Computer Science 2007-11-05 Brooke Shrader , Anthony Ephremides