Abstract
The routing capabilities of an interconnection network are strictly related to its bandwidth and latency characteristics, which are in turn quantifiable through the graph-theoretic concepts of expansion and diameter. This paper studies expansion and diameter of a family of subgraphs of the random geometric graph, which closely model the topology induced by the device discovery phase of Bluetooth-based ad hoc networks. The main feature modeled by any such graph, denoted as BTr(n),c(n), is the small number c(n) of links that each of the n devices (vertices) may establish with those located within its communication range r(n). First, tight bounds are proved on the expansion of BTr(n),c(n) for the whole set of functions r(n) and c(n) for which connectivity has been established in previous works. Then, by leveraging on the expansion result, tight (up to a logarithmic additive term) upper and lower bounds on the diameter of BTr(n),c(n) are derived.
Support for the authors was provided in part by the European Union under the FP6-IST/IP Project AEOLUS.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Whitaker, R., Hodge, L., Chlamtac, I.: Bluetooth scatternet formation: a survey. Ad Hoc Networks 3, 403–450 (2005)
Stojmenovic, I., Zaguia, N.: Bluetooth scatternet formation in ad hoc wireless networks. In: Misic, J., Misic, V. (eds.) Performance Modeling and Analysis of Bluetooth Networks, pp. 147–171. Auerbach Publications (2006)
Basagni, S., Bruno, R., Mambrini, G., Petrioli, C.: Comparative performance evaluation of scatternet formation protocols for networks of Bluetooth devices. Wireless Networks 10(2), 197–213 (2004)
Ferraguto, F., Mambrini, G., Panconesi, A., Petrioli, C.: A new approach to device discovery and scatternet formation in Bluetooth networks. In: Proc. of the 18th Int. Parallel and Distributed Processing Symposium (2004)
Crescenzi, P., Nocentini, C., Pietracaprina, A., Pucci, G.: On the connectivity of Bluetooth-based ad hoc networks. Concurrency and Computation: Practice and Experience 21(7), 875–887 (2009)
Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)
Panconesi, A., Radhakrishnan, J.: Expansion properties of (secure) wireless networks. In: Proc. of the 16th ACM Symp. on Parallelism in Algorithms and Architectures, pp. 281–285 (2004)
Dubhashi, D., Johansson, C., Häggström, O., Panconesi, A., Sozio, M.: Irrigating ad hoc networks in constant time. In: Proc. of the 17th ACM Symp. on Parallelism in Algorithms and Architectures, pp. 106–115 (2005)
Ellis, R., Jia, X., Yan, C.: On random points in the unit disk. Random Structures and Algorithms 29(1), 14–25 (2005)
Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6), 787–832 (1999)
Pettarin, A., Pietracaprina, A., Pucci, G.: On the expansion and diameter of Bluetooth-like topologies. Technical report, http://www.dei.unipd.it/~pettarin/pubb/manu/PettarinPP09.pdf
Bilardi, G., Preparata, F.P.: Area-time lower-bound techniques with applications to sorting. Algorithmica 1(1), 65–91 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pettarin, A., Pietracaprina, A., Pucci, G. (2009). On the Expansion and Diameter of Bluetooth-Like Topologies. In: Fiat, A., Sanders, P. (eds) Algorithms - ESA 2009. ESA 2009. Lecture Notes in Computer Science, vol 5757. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04128-0_47
Download citation
DOI: https://doi.org/10.1007/978-3-642-04128-0_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04127-3
Online ISBN: 978-3-642-04128-0
eBook Packages: Computer ScienceComputer Science (R0)