Generalization of Sorting in Single Hop Wireless Networks(Computation and Computational Models)
スポンサーリンク
概要
- 論文の詳細を見る
The generalized sorting problem is to find the first k largest elements among n input elements and to report them in a sorted order. In this paper, we propose a fast generalized sorting algorithm under the single hop wireless networks model with collision detection (WNCD). The algorithm is based on the maximum finding algorithm and the sorting algorithm. The key point of our algorithm is to use successful broadcasts to build broadcasting layers logically and then to distribute the data elements into those logic layers properly. Thus, the number of broadcast conflicts is reduced. We prove that the average time complexity required for our generalized sorting algorithm is Θ (k+log(n-k)). When k=1, our generalized sorting algorithm does the work of finding maximum, and when k=n, it does the work of sorting. Thus, the analysis of our algorithm builds a connection between the two extremely special cases which are maximum finding and sorting.
- 社団法人電子情報通信学会の論文
- 2006-04-01
著者
-
Shiau Shyue-horng
Department Of Computer Science And Engineering National Sun Yat-sen University:department Of Compute
-
Yang Chang-biau
Department Of Computer Science And Engineering National Sun Yat-sen University
関連論文
- A Fast Initialization Algorithm for Single-Hop Wireless Networks(Network)
- Near-Optimal Block Alignments
- Generalization of Sorting in Single Hop Wireless Networks(Computation and Computational Models)
- Efficient Algorithms for Finding a Tree 3-Spanner on Permutation Graphs(Algorithms)
- Efficient Algorithms for Finding a Tree 3-Spanner on Permutation Graphs