Download Now Free registration required
In this paper, the authors analyze the complexity of local broadcasting in the physical interference model. They present two distributed randomized algorithms: one that assumes that each node knows how many nodes there are in its geographical proximity, and another, which makes no assumptions about topology knowledge. They show that, if the transmission probability of each node meets certain characteristics, the analysis can be decoupled from the global nature of the physical interference model, and each node performs a successful local broadcast in time proportional to the number of neighbors in its physical proximity.
- Format: PDF
- Size: 199.1 KB