42,039 research outputs found
Energy Complexity of Distance Computation in Multi-hop Networks
Energy efficiency is a critical issue for wireless devices operated under
stringent power constraint (e.g., battery). Following prior works, we measure
the energy cost of a device by its transceiver usage, and define the energy
complexity of an algorithm as the maximum number of time slots a device
transmits or listens, over all devices. In a recent paper of Chang et al. (PODC
2018), it was shown that broadcasting in a multi-hop network of unknown
topology can be done in energy. In this paper, we continue
this line of research, and investigate the energy complexity of other
fundamental graph problems in multi-hop networks. Our results are summarized as
follows.
1. To avoid spending energy, the broadcasting protocols of Chang
et al. (PODC 2018) do not send the message along a BFS tree, and it is open
whether BFS could be computed in energy, for sufficiently large . In
this paper we devise an algorithm that attains energy
cost.
2. We show that the framework of the round lower bound proof
for computing diameter in CONGEST of Abboud et al. (DISC 2017) can be adapted
to give an energy lower bound in the wireless network model
(with no message size constraint), and this lower bound applies to -arboricity graphs. From the upper bound side, we show that the energy
complexity of can be attained for bounded-genus graphs
(which includes planar graphs).
3. Our upper bounds for computing diameter can be extended to other graph
problems. We show that exact global minimum cut or approximate -- minimum
cut can be computed in energy for bounded-genus graphs
- …