English
Related papers

Related papers: Wireless Aggregation at Nearly Constant Rate

200 papers

A fundamental problem for wireless ad hoc networks is the assignment of suitable transmission powers to the wireless devices such that the resulting communication graph is connected. The goal is to minimize the total transmit power in order…

Data Structures and Algorithms · Computer Science 2014-03-25 Maurits de Graaf , Bodo Manthey

We study the problem of building a maximum lifetime data collection tree for periodic convergecast applications in wireless sensor networks. We experimentally observe that if two nodes transmit same number of data packets, the amount of…

Networking and Internet Architecture · Computer Science 2020-06-11 Jobish John , Gaurav S Kasbekar , Maryam Shojaei Baghini

To cope with the ever increasing demand for bandwidth, future wireless networks will be designed with reuse distance equal to one. This scenario requires the implementation of techniques able to manage the strong multiple access…

Information Theory · Computer Science 2013-10-18 Ying Yang , Marco Moretti , Wenxiang Dong , Weidong Wang

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

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

We study the stability of wireless networks under stochastic arrival processes of packets, and design efficient, distributed algorithms that achieve stability in the SINR (Signal to Interference and Noise Ratio) interference model.…

Networking and Internet Architecture · Computer Science 2012-10-18 Eyjolfur I. Asgeirsson , Magnus M. Halldorsson , Pradipta Mitra

We consider a wireless network in which a single source node located at the center of a unit area having $m$ antennas transmits messages to $n$ randomly located destination nodes in the same area having a single antenna each. To achieve the…

Information Theory · Computer Science 2013-10-29 Sang-Woon Jeon , Sae-Young Chung

We consider the problem of clock synchronization in a wireless setting where processors must power-down their radios in order to save energy. Energy efficiency is a central goal in wireless networks, especially if energy resources are…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-03-17 Leonid Barenboim , Shlomi Dolev , Rafail Ostrovsky

Wireless Sensor networks are dense networks of small, low-cost sensors, which collect and disseminate environmental data and thus facilitate monitoring and controlling of physical environment from remote locations with better accuracy. The…

Networking and Internet Architecture · Computer Science 2012-04-13 Deepali Virmani , Tanuj Singhal , Ghanshyam , Khyati Ahlawat , Noble

The two biggest problems with wireless sensor networks are security and energy usage. In sensing devices, malicious nodes could be found in large numbers. The researchers have proposed several methods to find these rogue nodes. To prevent…

Cryptography and Security · Computer Science 2023-05-01 B. Murugeshwari , S. Aminta Sabatini , Lovelit Jose , S. Padmapriya

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

We show optimal lower bounds for spanning forest computation in two different models: * One wants a data structure for fully dynamic spanning forest in which updates can insert or delete edges amongst a base set of $n$ vertices. The sole…

Data Structures and Algorithms · Computer Science 2019-11-27 Jelani Nelson , Huacheng Yu

We consider the problem of scheduling wireless links in the physical model, where we seek an assignment of power levels and a partition of the given set of links into the minimum number of subsets satisfying the…

Networking and Internet Architecture · Computer Science 2015-02-19 Magnus M. Halldorsson , Tigran Tonoyan

The purpose of a wireless sensor network (WSN) is to provide the users with access to the information of interest from data gathered by spatially distributed sensors. Generally the users require only certain aggregate functions of this…

Cryptography and Security · Computer Science 2011-01-18 Jaydip Sen

We consider a block fading additive white Gaussian noise (AWGN) channel with perfect channel state information (CSI) at the transmitter and the receiver. First, for a given codeword length and non-vanishing average probability of error, we…

Information Theory · Computer Science 2019-04-10 Deekshith P K , K Gautam Shenoy , Vinod Sharma

In this paper, we consider a wireless powered mobile edge computing (MEC) network, where the distributed energy-harvesting wireless devices (WDs) are powered by means of radio frequency (RF) wireless power transfer (WPT). In particular, the…

Information Theory · Computer Science 2018-02-13 Suzhi Bi , Ying-Jun Angela Zhang

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

The purpose of a wireless sensor network (WSN) is to provide the users with access to the information of interest from data gathered by spatially distributed sensors. Generally the users require only certain aggregate functions of this…

Cryptography and Security · Computer Science 2021-09-14 Jaydip Sen

We consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied -- dense random…

Information Theory · Computer Science 2009-05-26 Aman Jain , Sanjeev R. Kulkarni , Sergio Verdu

We present a unified analytical framework within which power control, rate allocation, routing, and congestion control for wireless networks can be optimized in a coherent and integrated manner. We consider a multi-commodity flow model with…

Networking and Internet Architecture · Computer Science 2007-09-18 Yufang Xi , Edmund M. Yeh