Efficient Initialization Algorithms on Single-Hop Radio Networks

Naoki INABA  Koichi WADA  

IEICE TRANSACTIONS on Information and Systems   Vol.E90-D   No.6   pp.915-922
Publication Date: 2007/06/01
Online ISSN: 1745-1361
DOI: 10.1093/ietisy/e90-d.6.915
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Networks
radio network,  single-hop,  initialization,  

Full Text: PDF>>
Buy this Article

We consider an initialization problem in single-hop radio networks. The initialization is the task of assigning distinct ID numbers to nodes in a network. We have greatly improved the previous results [10] for the initialization in an n-node network. We propose randomized initialization algorithms in two cases. The first case is that n is known to all the nodes and the second case is that n is unknown to all the nodes. The algorithm for the first case completes in en+ln n+O (1) expected time slots, and the algorithm for the second case completes in en+O() expected slots. The main idea of the algorithm for the case that n is unknown is presumption of the number of nodes. In the algorithm, each node presumes the number of nodes efficiently and is assigned ID by using the algorithm for the case that n is known with the presumption value.