English
Related papers

Related papers: Wireless Network Information Flow: A Deterministic…

200 papers

We consider a general class of low complexity distributed scheduling algorithms in wireless networks, maximal scheduling with priorities, where a maximal set of transmitting links in each time slot are selected according to certain…

Information Theory · Computer Science 2011-12-05 Qiao Li , Rohit Negi

For wireless systems in which randomly arriving devices attempt to transmit a fixed payload to a central receiver, we develop a framework to characterize the system throughput as a function of arrival rate and per-user data rate. The…

Information Theory · Computer Science 2013-10-04 Harpreet S. Dhillon , Howard C. Huang , Harish Viswanathan , Reinaldo A. Valenzuela

This paper addresses the challenge of packet-based information routing in large-scale wireless communication networks. The problem is framed as a constrained statistical learning task, where each network node operates using only local…

Signal Processing · Electrical Eng. & Systems 2025-04-15 Sourajit Das , Kirtan Gopal Panda , Navid NaderiAlizadeh

A two-hop wireless communication link in which a source sends data to a destination with the aid of an intermediate relay node is studied. It is assumed that there is no direct link between the source and the destination, and the relay…

Information Theory · Computer Science 2011-07-22 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

An overarching issue in resource management of wireless networks is assessing their capacity: How much communication can be achieved in a network, utilizing all the tools available: power control, scheduling, routing, channel assignment and…

Networking and Internet Architecture · Computer Science 2017-05-30 Magnus M. Halldorsson , Tigran Tonoyan

We study a problem of scheduling real-time traffic with hard delay constraints in an unreliable wireless channel. Packets arrive at a constant rate to the network and have to be delivered within a fixed number of slots in a fading wireless…

Networking and Internet Architecture · Computer Science 2013-12-19 Easwar Vivek Mangipudi , Venkatesh Ramaiyan

This paper derives a lower bound to the per-node throughput achievable by a wireless network when n source-destination pairs are randomly distributed throughout a disk of radius $n^\gamma$, $ \gamma \geq 0$, propagation is modeled by…

Information Theory · Computer Science 2007-08-01 Enrique J. Duarte-Melo , Awlok Josan , Mingyan Liu , David L. Neuhoff , Sandeep Pradhan

A restricted two-way communication problem in a small fully-connected network is investigated. The network consists of three nodes, all having access to a common channel with half-duplex constraint. Two nodes want to establish a dialog…

Information Theory · Computer Science 2014-09-05 Manuel Stein

We consider arbitrary dense wireless networks, in which $n$ nodes are placed in an arbitrary (deterministic) manner on a square region of unit area and communicate with each other over Gaussian fading channels. We provide inner and outer…

Information Theory · Computer Science 2011-08-09 Urs Niesen

An overarching issue in resource management of wireless networks is assessing their capacity: How much communication can be achieved in a network, utilizing all the tools available: power control, scheduling, routing, channel assignment and…

Networking and Internet Architecture · Computer Science 2018-06-29 Magnus M. Halldorsson , Tigran Tonoyan

We consider systems in which the transmitter conveys messages to the receiver through a capacity-limited relay station. The channel between the transmitter and the relay-station is assumed to be a frequency selective additive Gaussian noise…

Information Theory · Computer Science 2018-01-08 Adi Homri , Michael Peleg , Shlomo Shamai

In this paper, we study stability and latency of routing in wireless networks where it is assumed that no collision will occur. Our approach is inspired by the adversarial queuing theory, which is amended in order to model wireless…

Networking and Internet Architecture · Computer Science 2010-06-08 Vicent Cholvi , Dariusz R. Kowalski

The problem of maximizing the average rate in a multicast network subject to a coverage constraint (minimum quality of service) is studied. Assuming the channel state information is available only at the receiver side and single antenna…

Information Theory · Computer Science 2008-05-29 Seyed Reza Mirghaderi , Alireza Bayesteh , Amir K. Khandani

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…

Information Theory · Computer Science 2010-04-15 Lawrence Ong , Mehul Motani

In this paper, a two-hop network in which information is transmitted from a source via a relay to a destination is considered. It is assumed that the channels are static fading with additive white Gaussian noise. All nodes are equipped with…

Information Theory · Computer Science 2009-05-18 Vahid Pourahmadi , Alireza Bayesteh , Amir K. Khandani

Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the nodes can harvest energy throughout the duration in which…

Information Theory · Computer Science 2011-06-09 Omur Ozel , Kaya Tutuncuoglu , Jing Yang , Sennur Ulukus , Aylin Yener

The problem of maximum rate achievable with analog network coding for a unicast communication over a layered relay network with directed links is considered. A relay node performing analog network coding scales and forwards the signals…

Information Theory · Computer Science 2012-04-24 Samar Agnihotri , Sidharth Jaggi , Minghua Chen

Real-time applications require latencies on the order of a millisecond with very high reliabilities, paralleling the requirements for high-performance industrial control. Current wireless technologies like WiFi, Bluetooth, LTE, etc. are…

Information Theory · Computer Science 2018-03-15 Vasuki Narasimha Swamy , Paul Rigge , Gireeja Ranade , Anant Sahai , Borivoje Nikolic

In this paper, the theoretical sustainable capacity of wireless networks with radio frequency (RF) energy harvesting is analytically studied. Specifically, we consider a large scale wireless network where base stations (BSs) and low power…

Networking and Internet Architecture · Computer Science 2018-06-05 Ziru Chen , Zhao Chen , Lin X. Cai , Yu Cheng , Ruoting Gong

In a bi-directional relay channel, two nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of a relay. In this paper, we derive achievable rate regions for four new half-duplex protocols and…

Information Theory · Computer Science 2009-05-16 Sang Joon Kim , Natasha Devroye , Patrick Mitran , Vahid Tarokh
‹ Prev 1 4 5 6 7 8 10 Next ›