English
Related papers

Related papers: On the Throughput Maximization in Dencentralized W…

200 papers

To account for the randomness of propagation channels and interference levels in hierarchical spectrum sharing, a novel approach to multihop routing is introduced for cognitive random access networks, whereby packets are randomly routed…

Optimization and Control · Mathematics 2012-07-05 Emiliano Dall'Anese , Georgios B. Giannakis

We consider wireless sensor networks secured by the heterogeneous random key predistribution scheme under an on/off channel model. The heterogeneous random key predistribution scheme considers the case when the network includes sensor nodes…

Networking and Internet Architecture · Computer Science 2017-01-05 Rashad Eletreby , Osman Yağan

This paper develops and evaluates an accumulate-then-transmit framework for multi-user scheduling in a full-duplex (FD) wireless-powered Internet-of-Things system, consisting of multiple energy harvesting (EH) IoT devices (IoDs) and one FD…

Information Theory · Computer Science 2018-03-07 Di Zhai , He Chen , Zihuai Lin , Yonghui Li , Branka Vucetic

New generation networks, based on Cognitive Radio technology, allow dynamic allocation of the spectrum, alleviating spectrum scarcity. These networks also have a resilient potential for dynamic operation for energy saving. In this paper, we…

Networking and Internet Architecture · Computer Science 2024-05-07 Rodney Martinez Alonso , David Plets , Margot Deruyck , Luc Martens , Glauco Guillen Nieto , Wout Joseph

We consider distributed estimation of a random source in a hierarchical power constrained wireless sensor network. Sensors within each cluster send their measurements to a cluster head (CH). CHs optimally fuse the received signals and…

Signal Processing · Electrical Eng. & Systems 2020-05-01 Mojtaba Shirazi , Azadeh Vosoughi

We consider the capacity problem (or, the single slot scheduling problem) in wireless networks. Our goal is to maximize the number of successful connections in arbitrary wireless networks where a transmission is successful only if the…

Data Structures and Algorithms · Computer Science 2010-11-23 Eyjólfur Ingi Ásgeirsson , Pradipta Mitra

In this paper, we consider a wireless powered communication system, where an energy harvesting (EH) node harvests energy from a radio frequency (RF) signal broadcasted by an access point (AP) in the downlink (DL). The node stores the…

Information Theory · Computer Science 2017-10-12 Rania Morsi , Diomidis S. Michalopoulos , Robert Schober

We consider the problem of scheduling in multihop wireless networks subject to interference constraints. We consider a graph based representation of wireless networks, where scheduled links adhere to the K-hop link interference model. We…

Networking and Internet Architecture · Computer Science 2010-06-28 Albert Sunny , Joy Kuri

Optimizing network utility in device-to-device networks is typically formulated as a non-convex optimization problem. This paper addresses the scenario where the optimization variables are from a bounded but continuous set, allowing each…

Information Theory · Computer Science 2024-10-22 Jan Christian Hauffen , Peter Jung , Giuseppe Caire

The capacity of a wireless network is the maximum possible amount of simultaneous communication, taking interference into account. Formally, we treat the following problem. Given is a set of links, each a sender-receiver pair located in a…

Data Structures and Algorithms · Computer Science 2012-03-15 Magnús Már Halldórsson , Pradipta Mitra

Coverage is one of the main quality of service of a wirelessnetwork. $k$-coverage, that is to be covered simultaneously by $k$network nodes, is synonym of reliability and numerous applicationssuch as multiple site MIMO features, or…

Networking and Internet Architecture · Computer Science 2019-01-03 Anaïs Vergne , Laurent Decreusefond , Philippe Martins

In this second part of our multi-part papers, the information flow in degraded interference networks is studied. A full characterization of the sum-rate capacity for the degraded networks with any possible configuration is established. It…

Information Theory · Computer Science 2013-02-18 Reza K. Farsani

Control of wireless multihop networks, while simultaneously meeting end-to-end mean delay requirements of different flows is a challenging problem. Additionally, distributed computation of control parameters adds to the complexity. Using…

Networking and Internet Architecture · Computer Science 2017-11-06 Ashok Krishnan K. S. , Vinod Sharma

The problem of network-constrained averaging is to compute the average of a set of values distributed throughout a graph G using an algorithm that can pass messages only along graph edges. We study this problem in the noisy setting, in…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-06-15 Nima Noorshams , Martin Wainwright

The maximum traffic arrival rate at the network for a given delay guarantee (delay constrained throughput) has been well studied for wired channels. However, few results are available for wireless channels, especially when multiple antennas…

Networking and Internet Architecture · Computer Science 2011-03-22 Kashif Mahmood , Mikko Vehkaperä , Yuming Jiang

This paper focuses on the design of an optimal resource allocation scheme to maximize the energy efficiency (EE) in a simultaneous wireless information and power transfer (SWIPT) enabled two-way decode-and-forward (DF) relay network under a…

Information Theory · Computer Science 2019-03-20 Liqin Shi , Yinghui Ye , Rose Qingyang Hu , Hailin Zhang

This paper studies an intelligent reflecting surface (IRS)-aided multiple-input-multiple-output (MIMO) full-duplex (FD) wireless-powered communication network (WPCN), where a hybrid access point (HAP) operating in FD broadcasts energy…

Information Theory · Computer Science 2022-09-14 Meng Hua , Qingqing Wu

This paper investigates resource allocation for simultaneous wireless information and power transfer (SWIPT) downlink systems based on a non-linear energy harvesting model. The resource allocation algorithm design is formulated as a…

Information Theory · Computer Science 2016-11-17 Elena Boshkovska , Alexander Koelpin , Derrick Wing Kwan Ng , Nikola Zlatanov , Robert Schober

This paper is motivated by the observation that the average queueing delay can be decreased by sacrificing power efficiency in wireless communications. In this sense, we naturally wonder what is the minimum queueing delay when the available…

Information Theory · Computer Science 2018-07-27 Meng Wang , Juan Liu , Wei Chen , Anthony Ephremides

In this paper, we consider delay-optimal power and subcarrier allocation design for OFDMA systems with $N_F$ subcarriers, $K$ mobiles and one base station. There are $K$ queues at the base station for the downlink traffic to the $K$ mobiles…

Machine Learning · Computer Science 2009-12-08 Vincent K. N. Lau , Ying Cui