Brief Announcement: Energy-Efficient Maximal Independent Sets in Radio Networks

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 networks model, a standard model widely used to model wireless networks, particularly ad hoc wireless and sensor networks. Energy is a premium resource in these networks, which are typically battery-powered. Hence, designing distributed algorithms that use as little energy as possible is crucial. We use the well-established energy model where a node can be sleeping or awake in a round, and only the awake rounds (when it can send or listen) determine the energy complexity of the algorithm.

Authors

Institutions

Publication Details

Published
2025-06-13
DOI
https://doi.org/10.1145/3732772.3733560
Primary Topic
Mobile Ad Hoc Networks
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Brief Announcement: Energy-Efficient Maximal Independent Sets in Radio Networks

Thomas P. Hayes, Varsha Dani, Fabien Dufoulon, Gopal Pandurangan et al.
Mobile Ad Hoc Networks
article

Brief Announcement: Energy-Efficient Maximal Independent Sets in Radio Networks

Thomas P. Hayes, Varsha Dani, Fabien Dufoulon, Gopal Pandurangan, Aayush Gupta, Dominick Banasik
article en

Abstract

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 networks model, a standard model widely used to model wireless networks, particularly ad hoc wireless and sensor networks. Energy is a premium resource in these networks, which are typically battery-powered. Hence, designing distributed algorithms that use as little energy as possible is crucial. We use the well-established energy model where a node can be sleeping or awake in a round, and only the awake rounds (when it can send or listen) determine the energy complexity of the algorithm.

Rochester Institute of Technology (US), University of Houston (US), University at Buffalo, State University of New York (US), Lancaster University (GB)
National Science Foundation, Army Research Office
Affordable and clean energy
Openalex Percentile: Top 86%
Mobile Ad Hoc Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Brief Announcement: Energy-Efficient Maximal Independent Sets in Radio Networks — Thomas P. Hayes, Varsha Dani, et al. · (2025) | TGRS Research Map | TGRS