A Fast Initialization Algorithm for Single-Hop Wireless Networks(Network)

スポンサーリンク

概要

• 論文の詳細を見る

• Given a set of n stations, the initialization problem is to assign each station a unique identification number, from 1 to n. In the single-hop wireless Networks with collision detection, Nakano and Olariu proposed an algorithm to build a partition tree and solve the problem. In this paper, we shall classify the partition tree into four parts. By reviewing the classification, we find that three ideas can improve the algorithm. We show that it needs 2.88n time slots for solving the problem containing n stations. After applying our three ideas, the number of time slots will be improved to 2.46n.

• 社団法人電子情報通信学会の論文
• 2005-11-01

著者

• Shiau Shyue‐horng

  National Sun Yat‐sen Univ. Kaohsiung Twn

• SHIAU Shyue-Horng

  Department of Computer Science and Engineering, National Sun Yat-sen University

• YANG Chang-Biau

  Department of Computer Science and Engineering, National Sun Yat-sen University

• Shiau Shyue-horng

  Department Of Computer Science And Engineering National Sun Yat-sen University:department Of Compute

• Yang Chang‐biau

  National Sun Yat‐sen Univ. Kaohsiung Twn

• 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

スポンサーリンク