Brief Announcement

Abstract

In wireless networks, consisting of battery-powered devices, energy is a costly resource and most of it is spent on transmitting messages. Broadcast is a problem where a message needs to be transmitted from one node to all other nodes of the network. We study algorithms that can work under limited energy measured as the maximum number of transmissions among all the stations. The goal of the paper is to study tradeoffs between time and energy complexity of broadcast problem in unknown multi-hop radio networks with no collision detection. We propose and analyse two new randomized energy-efficient algorithms. Our first algorithm works in time O((D+φ)n^1/φ . φ) with high probability and uses O(φ) energy per station for any φ ≤ log n/(2loglog n) for any graph with n nodes and diameter D. Our second algorithm works in time O((D+log n)log n) with high probability and uses O(log n/loglog n) energy. We prove that our algorithms are almost time-optimal for given energy limits for graphs with constant diameters by constructing lower bound on time of Ω(n^1/φ . φ). The lower bound shows also that any algorithm working in polylogaritmic time in n for all graphs needs energy Ω(log n/loglog n).