Communication and energy efficient routing protocols for single-hop radio networks

Authors:
Sanguthevar Rajasekaran;Lance Fiondella;Dolly Sharma;Reda Ammar;Nicholas Lownes
Affiliations:
Department of Computer Science and Engineering, University of Connecticut, Storrs, CT, 06269, United States;Department of Computer Science and Engineering, University of Connecticut, Storrs, CT, 06269, United States;Department of Computer Science and Engineering, University of Connecticut, Storrs, CT, 06269, United States;Department of Computer Science and Engineering, University of Connecticut, Storrs, CT, 06269, United States;Department of Civil and Environmental Engineering, University of Connecticut, Storrs, CT, 06269, United States
Venue:
Journal of Parallel and Distributed Computing
Year:
2012

Citing 15
Cited 0

A logarithmic time sort for linear size networks

Journal of the ACM (JACM)
General purpose parallel architectures

Handbook of theoretical computer science (vol. A)
Efficient optical communication in parallel computers

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A doubly logarithmic communication algorithm for the completely connected optical communication parallel computer

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Randomized selection on the hypercube

Journal of Parallel and Distributed Computing
Multicluster, mobile, multimedia radio network

Wireless Networks
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting

Journal of the ACM (JACM)
Broadcast-Efficient Protocols for Mobile Radio Networks

IEEE Transactions on Parallel and Distributed Systems
Randomized Initialization Protocols for Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems
Expected time bounds for selection

Communications of the ACM
Energy-Efficient Permutation Routing in Radio Networks

IEEE Transactions on Parallel and Distributed Systems
Finding an extremum in a network

ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
Universal schemes for parallel communication

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
An Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks

IEEE Transactions on Parallel and Distributed Systems
Adaptive clustering for mobile wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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 where 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 best known prior algorithm for sorting takes 4nk+o(nk) broadcast rounds on a RN(p,k). In this paper, we present a randomized algorithm that takes only 3nk+o(nk) broadcast rounds with high probability. For the selection problem, we present a randomized selection algorithm that takes O(pk) rounds on a RN(p,k) with high probability. The best known prior algorithms for the n/p-relations routing problem take nearly 2n/k time slots (i.e., broadcast rounds). 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 rounds on the average. We also present a deterministic algorithm that takes nearly n/k rounds. These routing algorithms are also shown to be energy efficient.