Initialization algorithm for single-hop wireless networks

被引：0

作者：

Shiau, SH ^{[1
]}

Yang, CB ^{[1
]}

机构：

[1] Natl Sun Yat Sen Univ, Dept Comp Sci & Engn, Kaohsiung 804, Taiwan

来源：

8TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL V, PROCEEDINGS: COMPUTER SCIENCE AND ENGINEERING | 2004年

关键词：

parallel algorithm; initialization; broadcast communication; wireless network; conflict;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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 classifications, 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.

引用

页码：519 / 524

页数：6

共 26 条

[1]

[Anonymous], P INT PAR DISTR PROC

[2]

BHUVANESWARAN RS, 2002, IEICE T FUNDAMEN FEB, P447

[3]

Carle J, 2000, PARALLEL AND DISTRIBUTED COMPUTING SYSTEMS, P159

[4] DISTRIBUTED SELECTSORT SORTING ALGORITHMS ON BROADCAST COMMUNICATION-NETWORKS [J].

HUANG, JH ;

KLEINROCK, L .

PARALLEL COMPUTING, 1990, 16 (2-3) :183-190

[5]

Levitan S. P., 1982, Proceedings of the 3rd International Conference on Distributed Computing Systems, P666

[6] Dynamic prioritized conflict resolution on multiple access broadcast networks [J].

Martel, CU ;

Moh, WM ;

Moh, TS .

IEEE TRANSACTIONS ON COMPUTERS, 1996, 45 (09) :1074-1079

[7] MAXIMUM FINDING ON A MULTIPLE-ACCESS BROADCAST NETWORK [J].

MARTEL, CU .

INFORMATION PROCESSING LETTERS, 1994, 52 (01) :7-13

[8] OPTIMAL PRIORITIZED CONFLICT-RESOLUTION ON A MULTIPLE ACCESS CHANNEL [J].

MARTEL, CU ;

MOH, WHLM .

IEEE TRANSACTIONS ON COMPUTERS, 1991, 40 (10) :1102-1108

[9] Randomized initialization protocols for ad hoc networks [J].

Nakano, K ;

Olariu, S .

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2000, 11 (07) :749-759

[10] A survey on leader election protocols for radio networks [J].

Nakano, K ;

Olariu, S .

I-SPAN'02: INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND NETWORKS, PROCEEDINGS, 2002, :71-76

← 1 2 3 →