Loading...
Please wait, while we are loading the content...
Similar Documents
An \Omega\Gamma D log(N=D)) Lower Bound for Broadcast in Radio Networks (1993)
| Content Provider | CiteSeerX |
|---|---|
| Author | Kushilevitz, Eyal Mansour, Yishay |
| Description | We show that for any randomized broadcast protocol for radio networks, there exists a network in which the expected time to broadcast a message is \Omega\Gamma D log(N=D)), where D is the diameter of the network and N is the number of nodes. This implies a tight upper bound of \Omega\Gamma D log N) for any D N , where " ? 0 is any constant. |
| File Format | |
| Language | English |
| Publisher Date | 1993-01-01 |
| Publisher Institution | 12th ACM Symp. on Principles of Distributed Computing |
| Access Restriction | Open |
| Subject Keyword | Radio Network Randomized Broadcast Protocol Expected Time Tight Upper Bound Omega Gamma Log |
| Content Type | Text |
| Resource Type | Article |
