Abstract
We address large, random network topologies that are typical in ad hoc and sensor networks. In these systems we need at least two different types of scalability. First, we want that with growing network size the topology remains connected, so that communication is possible between nodes. Second, it is also necessary that the individual nodes can operate with limited energy and complexity, which requires that the number of neighbors of any node remains bounded. Unfortunately, these global vs. local scalability requirements conflict with each other, as it is known, under very general conditions, that full connectivity can only be achieved with infinitely growing node degrees. Therefore, it is important to quantify how large part of the random topology can be still expected to belong to a connected component if the nodes are confined to some bounded degree. We investigate this issue in a model that is more general than previously investigated random wireless network topology models. In our general model we derive an asymptotically optimal trade-off between node degrees and the fraction of nodes that form a connected component.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bollobás, B.: Random Graphs. Cambridge University Press, Cambridge (2001)
de Finetti, B.: Funzione Caratteristica di un Fenomeno Aleatorio. Atti della R. Academia Nazionale dei Lincei, Serie 6, Classe di Scienze Fisiche, Mathematice e Naturale 4, 251–299 (1931)
Faragó, A.: On the Fundamental Limits of Topology Control in Ad Hoc Networks. Algorithmica 49, 337–356 (2007)
Faragó, A.: Scalability of Node Degrees in Random Wireless Network Topologies. In: IEEE JSAC (in press, 2009)
Franceschetti, M., Meester, R.: Random Networks for Communication. Cambridge University Press, Cambridge (2007)
Gupta, P., Kumar, P.R.: The Capacity of Wireless Networks. IEEE Trans. Information Theory 46, 388–404 (2000)
Gupta, P., Kumar, P.R.: Critical Power for Asymptotic Connectivity in Wireless Networks. In: McEneany, W.M., Yin, G., Zhang, Q. (eds.) Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, pp. 547–566. Birkhauser, Boston (1998)
Janson, S., Luczak, T., Rucinski, A.: Random Graphs. Wiley, Chichester (2000)
Pahlavan, K., Krishnamurty, P.: Principles of Wireless Networks. Prentice-Hall, Englewood Cliffs (2002)
Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)
Stoyanov, J.M.: Counterexamples in Probability. Wiley, Chichester (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Faragó, A. (2009). Local vs. Global Scalability in Ad Hoc and Sensor Networks. In: Mueller, P., Cao, JN., Wang, CL. (eds) Scalable Information Systems. INFOSCALE 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 18. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10485-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-10485-5_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10484-8
Online ISBN: 978-3-642-10485-5
eBook Packages: Computer ScienceComputer Science (R0)