DocumentCode :
772740
Title :
On Adaptive Tree Polling Algorithms
Author :
Towsley, Don ; Wolf, Jack Keil
Author_Institution :
Univ. of Massachusetts, Amherst, MA, USA
Volume :
32
Issue :
12
fYear :
1984
fDate :
12/1/1984 12:00:00 AM
Firstpage :
1294
Lastpage :
1298
Abstract :
This paper proposes three different algorithms for polling a finite set of users to determine the binary state of each user. The states are assumed to be described by i.i.d. Bernoulli random variables with parameter 
. The algorithms differ in the responses offered by the users to queries and how the responses from several users are combined by the channel to produce a composite feedback signal which is received by all users. For each algorithm, the average number of transmissions required to determine the states of all users is determined as a function of the parameter .
. The algorithms differ in the responses offered by the users to queries and how the responses from several users are combined by the channel to produce a composite feedback signal which is received by all users. For each algorithm, the average number of transmissions required to determine the states of all users is determined as a function of the parameter .Keywords :
Computer networks; Binary trees; Communications Society; Data communication; Feedback; Random variables; Tree data structures;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/TCOM.1984.1096015
Filename :
1096015
Link To Document :
