An Efficient Randomized Routing Protocol for Single-Hop Radio Networks
Sanguthevar Rajasekarana b, Dolly Sharmaa b, Reda A.A. Ammara b, Nicholas Lownesc d
- aDepartment of Computer Science and Engineering, University of Connecticut, Storrs, CT, USA
- bDept. of Computer Science and Engineering, Univ. of Connecticut, Storrs, CT, USA
- cDepartment of Civil and Environmental Engineering, University of Connecticut, Storrs, CT, USA
- dDept. of Civil & Environ. Eng., Univ. of Connecticut, Storrs, CT, USA
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
In this paper we study the important problems of message routing, sorting, and selection in a radio network. A radio network consists of stations where each station is a hand-held device. We consider a single-hop radio network. In a single-hop network it is assumed that each station is within the transmission range of every other station. Let RN(p; k) stand for a single-hop network that has p stations and k communication channels. The problems of sorting and selection have been studied on RN(p; k). For these problems it is assumed that there are n/p elements to start with at each station. At the end of sorting, the least n/p elements should be in the first station, the next smallest n/p elements should be in the second station, and so on. The best known prior algorithm for sorting takes 4n/k +o(n/k) broadcast rounds on a RN(p; k). In this paper we present a randomized algorithm that takes only 3n/k +o(n/k) broadcast rounds with high probability. For the selection problem, it is known that the maximum or minimum element can be found in O(log n) rounds on a RN(n; 1), provided broadcast conflicts can be resolved in O(1) time. The problem of general selection has not been addressed. In this paper we present a randomized selection algorithm that takes O(p/k) rounds on a RN(p; k) with high probability. An important message routing problem that is considered in the literature is one where there are n/p packets originating from each station and there are n/p packets destined for each station. The best known routing algorithms take nearly 2n/k times slots. An important open question has been if there exist algorithms that take only close to n/k time slots. Note that a trivial lower bound for routing is n/k. The existence of such algorithms will be highly relevant especially in emergencies and time critical situations. In this paper we answer this question by presenting a randomized algorithm that takes nearly n/k time slots with high probability.