New energy-efficient permutation routing protocol for single-hop radio networks

Abstract

A radio network (RN) is a distributed system where each node is a small hand-held commodity device called a station, running on batteries. In a single-hop RN, every station is within the transmission range of every other station. Each station spends power while transmitting or receiving a message, even when it receives a message that is not destined for it. Since it is not possible to recharge batteries when the stations are on a mission, it is extremely important that the stations spend power only when it is necessary. In this paper, we are interested in designing an energy-efficient protocol for permutation routing which is one of the most fundamental problems in any distributed system. An instance of the permutation routing problem involves p stations of an RN, each storing n/p items. Each item has a unique destination address which is the identity of the destination station to which the item should be sent. The goal is to route all the items to their destinations while spending as little energy as possible. We show that the permutation routing problem of n packets on an RN(p, k) can be solved in (Formula presented) slots and each station needs to be awake for at most (Formula presented) slots. When k ≪ p ≫ n, our protocol is more efficient both in terms of total number of slots and the number of slots each station is awake compared to the protocol by Nakano et al. [8].