| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 374.01 KB | Adobe PDF |
Advisor(s)
Abstract(s)
We propose an efficient algorithm to estimate the number
of live computer nodes in a network. This algorithm is fully distributed,
and has a time-complexity which is independent of the number of computer
nodes. The algorithm is designed to take advantage of a medium
access control (MAC) protocol which is prioritized; that is, if two or more
messages on different nodes contend for the medium, then the node contending
with the highest priority will win, and all nodes will know the
priority of the winner.