Sorting on single-channel wireless sensor networks

Abstract

A wireless sensor network is a distributed system which consists of a base station and a number of wireless sensors nodes endowed with radio transceivers. The main contribution of this work is to present a sorting protocol for multi-hop wireless sensor networks. Our protocol sorts n elements which are initially loaded in n sensor nodes that are organized in a two-dimensional plane of size \sqrt{n} \times \sqrt{n}. The sorting protocol proposed here sorts the n elements in O(r \sqrt{n}) time slots when \sqrt{n}>r, where r is the transmission range of the sensor nodes.