On the Complexity of Distributed Self-Configuration in Wireless Networks
✍ Scribed by Bhaskar Krishnamachari; Stephen Wicker; Ramón Béjar; Cèsar Fernàndez
- Book ID
- 110437186
- Publisher
- Springer US
- Year
- 2003
- Tongue
- English
- Weight
- 483 KB
- Volume
- 22
- Category
- Article
- ISSN
- 1018-4864
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper, we improve the bounds for computing a network decomposition Ž ⑀ Ž n. ⑀ Ž n. . distributively and deterministically. Our algorithm computes an n , n - ## Ž . decomposition in n time, where ⑀ n s 1r log n . As a corollary we obtain ' improved deterministic bounds for distributively c
Standard analyses of wireless random access protocols that are available in the literature assume negligible propagation delay between any two nodes. This assumption holds good in reasonably short-range terrestrial RF (radio frequency) wireless networks. On the contrary, in wireless communications i