DMCA
Merging and Merge-Sort in a Single Hop Radio Network (2006)
by
Marcin Kik
| Venue: | In 32nd conference on current trends in theory and practice of computer science (SOFSEM |
| Citations: | 6 - 2 self |
BibTeX
@INPROCEEDINGS{Kik06mergingand,
author = {Marcin Kik},
title = {Merging and Merge-Sort in a Single Hop Radio Network},
booktitle = {In 32nd conference on current trends in theory and practice of computer science (SOFSEM},
year = {2006},
pages = {341}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. We present two merging algorithms on a single-channel single-hop radio network without collision detection. The simpler of these algorithms merges two sorted sequences of length n in time 4n with energetic cost for each station lg n. The energetic cost of broadcasting is constant. This yields the merge-sort for n elements in time 2n lg n, where the energetic cost for each station is
