Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/36968
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | Sorting on single-channel wireless sensor networks |
Author: | Bordim, J. Nakano, K. Shen, H. |
Citation: | 2002 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '02), Manila, Philippines, pp. 133-138. |
Publisher: | IEEE |
Issue Date: | 2002 |
ISBN: | 0769515797 |
Conference Name: | International Symposium on Parallel Architectures, Algorithms and Networks (23 May 2002 : Manila, Philippines) |
Statement of Responsibility: | Jacir L. Bordim, Koji Nakano, Hong Shen |
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. |
Keywords: | wireless sensor networks, sorting, bitonic sorting, sensing devices |
Rights: | ©2002 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. |
DOI: | 10.1109/ISPAN.2002.1004275 |
Published version: | http://dx.doi.org/10.1109/ispan.2002.1004275 |
Appears in Collections: | Aurora harvest Computer Science publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
hdl_36968.pdf | 260.47 kB | Publisher's PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.