English
Related papers

Related papers: The Energy Complexity of BFS in Radio Networks

200 papers

Energy is often the most constrained resource in networks of battery-powered devices, and as devices become smaller, they spend a larger fraction of their energy on communication (transceiver usage) not computation. As an imperfect proxy…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-10-06 Yi-Jun Chang , Varsha Dani , Thomas P. Hayes , Qizheng He , Wenzheng Li , Seth Pettie

In wireless networks, consisting of battery-powered devices, energy is a costly resource and most of it is spent on transmitting and receiving messages. Broadcast is a problem where a message needs to be transmitted from one node to all…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-05-15 Marek Klonowski , Dominik Pająk

This paper investigates the energy complexity of distributed graph problems in multi-hop radio networks, where the energy cost of an algorithm is measured by the maximum number of awake rounds of a vertex. Recent works revealed that some…

Data Structures and Algorithms · Computer Science 2023-04-11 Yi-Jun Chang

Recent work has shown that it is sometimes feasible to significantly reduce the energy usage of some radio-network algorithms by adaptively powering down the radio receiver when it is not needed. Although past work has focused on modifying…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-05-26 Varsha Dani , Thomas P. Hayes

We consider networks of small, autonomous devices that communicate with each other wirelessly. Minimizing energy usage is an important consideration in designing algorithms for such networks, as battery life is a crucial and limited…

Data Structures and Algorithms · Computer Science 2022-04-19 Varsha Dani , Aayush Gupta , Thomas P. Hayes , Seth Pettie

We study multi-hop broadcast in wireless networks with one source node and multiple receiving nodes. The message flow from the source to the receivers can be modeled as a tree-graph, called broadcast-tree. The problem of finding the…

Computer Science and Game Theory · Computer Science 2020-01-20 Mahdi Mousavi , Hussein Al-Shatri , Anja Klein

A single-hop beeping network is a distributed communication model in which all stations can communicate with one another by transmitting only one-bit messages, called beeps. This paper focuses on resolving the distributed computing area's…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-04-21 Ny Aina Andriambolamalala , Vlady Ravelomanana

Broadcasting in wireless networks is vulnerable to adversarial jamming. To thwart such behavior, \emph{resource competitive analysis} is proposed. In this framework, sending, listening, or jamming on one channel for one time slot costs one…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-10-22 Haimin Chen , Chaodong Zheng

The maximal independent set (MIS) is one of the most fundamental problems in distributed computing, and it has been studied intensively for over four decades. This paper focuses on the MIS problem in the Radio Network model, a standard…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-10-10 Dominick Banasik , Varsha Dani , Fabien Dufoulon , Aayush Gupta , Thomas P. Hayes , Gopal Pandurangan

In this paper, the problem of energy efficiency in cellular heterogeneous networks (HetNets) is investigated using radio resource and power management combined with the base station (BS) ON/OFF switching. The objective is to minimize the…

Networking and Internet Architecture · Computer Science 2019-12-03 Hakim Ghazzai , Muhammad Junaid Farooq , Ahmad Alsharoa , Elias Yaacoub , Abdullah Kadri , Mohamed-Slim Alouini

We introduce collision free layerings as a powerful way to structure radio networks. These layerings can replace hard-to-compute BFS-trees in many contexts while having an efficient randomized distributed construction. We demonstrate their…

Networking and Internet Architecture · Computer Science 2014-04-10 Mohsen Ghaffari , Bernhard Haeupler

Consider a single-hop, multi-channel, synchronous radio network in which a source node needs to disseminate a message to all other $n-1$ nodes. An adversary called Eve, which captures environmental noise and potentially malicious…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-04-15 Haimin Chen , Chaodong Zheng

We consider the energy complexity of the leader election problem in the single-hop radio network model, where each device has a unique identifier in $\{1, 2, \ldots, N\}$. Energy is a scarce resource for small battery-powered devices. For…

Data Structures and Algorithms · Computer Science 2021-11-15 Yi-Jun Chang , Ran Duan , Shunhua Jiang

Small cell networks have recently been proposed as an important evolution path for the next-generation cellular networks. However, with more and more irregularly deployed base stations (BSs), it is becoming increasingly difficult to…

Information Theory · Computer Science 2013-06-27 C. Li , J. Zhang , K. B. Letaief

This paper proposes computationally efficient algorithms to maximize the energy efficiency in multi-carrier wireless interference networks, by a suitable allocation of the system radio resources, namely the transmit powers and subcarrier…

Networking and Internet Architecture · Computer Science 2018-03-02 Salvatore D'Oro , Alessio Zappone , Sergio Palazzo , Marco Lops

In this paper, a framework for the analysis of the transmission-computation-energy tradeoff in wireless and fixed networks is introduced. The analysis of this tradeoff considers both the transmission energy as well as the energy consumed at…

Information Theory · Computer Science 2010-08-27 P. Rost , G. Fettweis

This paper studies the problem of user association, scheduling and channel allocation in dense cellular networks with energy harvesting base stations (EBSs). In this problem, the EBSs are powered solely by renewable energy and each user has…

Information Theory · Computer Science 2022-01-28 Zoubeir Mlika , Elmahdi Driouch , Wessam Ajib

In this paper, we consider the energy-bandwidth allocation for a network with multiple broadcast channels, where the transmitters access the network orthogonally on the assigned frequency band and each transmitter communicates with multiple…

Information Theory · Computer Science 2014-10-13 Zhe Wang , Vaneet Aggarwal , Xiaodong Wang

We address the problem of minimizing power consumption when performing reliable broadcast on a radio network under the following popular model. Each node in the network is located on a point in a two dimensional grid, and whenever a node…

Data Structures and Algorithms · Computer Science 2007-10-15 Valerie King , Cynthia Phillips , Jared Saia , Maxwell Young

In this work, we are concerned with maximizing the lifetime of a cluster of sensors engaged in single-hop communication with a base-station. In a data-gathering network, the spatio-temporal correlation in sensor data induces…

Information Theory · Computer Science 2007-07-16 Samar Agnihotri , Pavan Nuggehalli
‹ Prev 1 2 3 10 Next ›