For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Fast Initialization Algorithm for Single-Hop Wireless Networks
IEICE TRANSACTIONS on Communications
Publication Date: 2005/11/01
Print ISSN: 0916-8516
Type of Manuscript: PAPER
parallel algorithm, initialization, broadcast, communication, wireless network, conflict,
Full Text: PDF(329.8KB)>>
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.