| Brief announcement: (more) efficient pruning of ad-hoc wireless networks |
| Full text |
Pdf
(368 KB)
|
Source
|
Annual ACM Symposium on Principles of Distributed Computing
archive
Proceedings of the 28th ACM symposium on Principles of distributed computing
table of contents
Calgary, AB, Canada
Pages 320-321
Year of Publication: 2009
ISBN:978-1-60558-396-9
|
|
Author
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 6, Downloads (12 Months): 37, Citation Count: 0
|
|
|
ABSTRACT
To what extent can one "prune" the links in a wireless network while retaining (almost) the same connectivity achieved when each node is connected to all nodes within its communication radius? In a nutshell, if each node explores a portion of its neighborhood sufficient to reach ≈ log(1/ε) other nodes in expectation, w.h.p. all but a fraction ε of the network joins the same connected component. Each node can then "locally" choose to maintain (at most) 4 links, and the network still retains w.h.p. essentially the same level of connectivity.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
P. Crescenzi, C. Nocentini, A. Pietracaprina, G. Pucci, and C. Sandri. On the connectivity of bluetooth-based ad hoc networks. In Proc. of Euro-Par, pp. 960--969, 2007.
|
 |
3
|
D. Dubhashi , C. Johansson , O. Häggström , A. Panconesi , M. Sozio, Irrigating ad hoc networks in constant time, Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, July 18-20, 2005, Las Vegas, Nevada, USA
[doi> 10.1145/1073970.1073986]
|
| |
4
|
M. Penrose. Random geometric graphs. Oxford Un. Press, 2003.
|
 |
5
|
|
| |
6
|
E.D. Santis, F. Grandoni, and A. Panconesi. Fast low degree connectivity of ad-hoc networks via percolation. In Proc. of ESA, pp. 206--217, 2007.
|
| |
7
|
E. Vergetis, R. Guerin, S. Sarkar, and J. Rank. Can Bluetooth succeed as a large-scale ad hoc networking technology? IEEE J. on Sel. Areas in Commun., 23(3), pp. 644--656, 2005.
|
|