Abstract
This chapter provides an overview of the fundamental concepts, models, tools, and methodologies used for connectivity studies. We start with an introduction to the major connection models used to describe the establishment of communication links between devices or nodes. These include the Erdős–Rényi connection model, the unit disk connection model, the log-normal connection model, the random connection model, and the SINR connection model. The relationship of these models and their impact on connectivity studies are discussed. Next, we cover the network models that have been widely used to capture the spatial distribution of nodes. Particularly, the dense network model, the extended network model, and the infinite network model are discussed. Finally, we briefly introduce the main tools and methodologies used for connectivity studies, including Continuum percolation theory, branching process, and algebraic graph theory, and present the main results, established using these tools, on network connectivity.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Bibliography
Bettstetter, C., Hartmann, C.: Connectivity of wireless multihop networks in a shadow fading environment. Wirel. Netw. 11 (5), 571–579 (2005)
Biggs, N.L.: Algebraic Graph Theory. Cambridge University Press, Cambridge (1974)
Bollobas, B.: Modern Graph Theory, 2nd edn. Springer, New York (2002)
Corless, R.M., Gonnet, G.H., Hare, D.E.G., Jeffrey, D.J., Knuth, D.E.: On the lambert w function. Adv. Comput. Math. 5 (1), 329–359 (1996)
Dousse, O., Baccelli, F., Thiran, P.: Impact of interferences on connectivity in ad hoc networks. IEEE/ACM Trans. Netw. 13 (2), 425–436 (2005)
Franceschetti, M., Meester, R.: Random Networks for Communication. Cambridge University Press, Cambridge (2007)
Godsil, C., Royle, G.F.: Algebraic Graph Theory. Springer, New York (2001)
Gross, J.L., Yellen, J.: Handbook of Graph Theory, 1st edn. CRC Press (2004)
Gupta, P., Kumar, P.: The capacity of wireless networks. IEEE Trans. Inf. Theory 46 (2), 388–404 (2000)
Haenggi, M., Andrews, J.G., Baccelli, F., Dousse, O., Franceschetti, M.: Stochastic geometry and random graphs for the analysis and design of wireless networks. IEEE J. Sel. Areas Commun. 27 (7), 1029–1046 (2009)
Harris, T.E.: The Theory of Branching Processes. Dover Books on Advanced Mathematics. Dover (1989)
Hogben, L.: Handbook of Linear Algebra, 1st edn. Discrete Mathematics and Its Applications. Chapman and Hall/CRC, Boca Raton (2007)
Janson, S., Luczak, T., Ruciski, A.: Random Graphs. Wiley, New York (2000)
Mao, G., Anderson, B.D.O., Fidan, B.: Path loss exponent estimation for wireless sensor network localization. Comput. Netw. 51 (10), 2467–2483 (2007)
Meester, R., Roy, R.: Continuum Percolation. Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge (1996)
Mukherjee, S., Avidor, D.: Connectivity and transmit-energy considerations between any pair of nodes in a wireless ad hoc network subject to fading. IEEE Trans. Veh. Technol. 57 (2), 1226–1242 (2008)
Patwari, N., Hero A.O., I., Perkins, M., Correal, N., O’Dea, R.: Relative location estimation in wireless sensor networks. IEEE Trans. Signal Process. 51 (8), 2137–2148 (2003)
Penrose, M.D.: Random Geometric Graphs. Oxford Studies in Probability. Oxford University Press, Oxford (2003)
Rappaport, T.S.: Wireless Communications: Principles and Practice. Prentice Hall Communications Engineering and Emerging Technologies Series. Prentice Hall, Englewood Cliffs (2002)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Mao, G. (2017). Introduction. In: Connectivity of Communication Networks. Springer, Cham. https://doi.org/10.1007/978-3-319-52989-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-52989-9_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-52988-2
Online ISBN: 978-3-319-52989-9
eBook Packages: EngineeringEngineering (R0)