Wake Up and Join Me! An Energy-Efficient Algorithm for Maximal Matching in Radio Networks

by   Varsha Dani, et al.

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 resource. Working in a model where both sending and listening for messages deplete energy, we consider the problem of finding a maximal matching of the nodes in a radio network of arbitrary and unknown topology. We present a distributed randomized algorithm that produces, with high probability, a maximal matching. The maximum energy cost per node is O(log^2 n), where n is the size of the network. The total latency of our algorithm is O(n log n) time steps. We observe that there exist families of network topologies for which both of these bounds are simultaneously optimal up to polylog factors, so any significant improvement will require additional assumptions about the network topology. We also consider the related problem of assigning, for each node in the network, a neighbor to back up its data in case of node failure. Here, a key goal is to minimize the maximum load, defined as the number of nodes assigned to a single node. We present a decentralized low-energy algorithm that finds a neighbor assignment whose maximum load is at most a polylog(n) factor bigger that the optimum.


page 1

page 2

page 3

page 4


Broadcast in radio networks: time vs. energy tradeoffs

In wireless networks, consisting of battery-powered devices, energy is a...

Distributed Maximum Matching Verification in CONGEST

We study the maximum cardinality matching problem in a standard distribu...

Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels

We consider the fundamental problems of size discovery and topology reco...

Local Computation of Maximal Independent Set

We present a randomized Local Computation Algorithm (LCA) with query com...

How to Wake Up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks

Recent work has shown that it is sometimes feasible to significantly red...

The Energy Complexity of BFS in Radio Networks

We consider a model of energy complexity in Radio Networks in which tran...

Distributed K-Backup Placement and Applications to Virtual Memory in Real-World Wireless Networks

The Backup Placement problem in networks in the CONGEST distributed sett...

Please sign up or login with your details

Forgot password? Click here to reset