Abstract
Despite intensive research in the area of network connectivity, there is an important category of problems that remain unsolved: how to characterize and measure the quality of connectivity of a wireless network which has a realistic number of nodes, not necessarily large enough to warrant the use of asymptotic analysis, and which has unreliable connections, reflecting the inherent unreliability of wireless communications? The quality of connectivity measures how easily and reliably a packet sent by a node can reach another node. It complements the use of capacity to measure the quality of a network in saturated traffic scenarios and provides an intuitive measure of the quality of (end-to-end) network connections. In this chapter, we introduce a probabilistic connectivity matrix as a tool to measure the quality of network connectivity. Some interesting properties of the probabilistic connectivity matrix and their connections to the quality of connectivity are demonstrated. We demonstrate that the largest magnitude eigenvalue of the probabilistic connectivity matrix, which is positive, can serve as a good measure of the quality of network connectivity. Furthermore, we provide a flooding algorithm whereby the nodes repeatedly flood the network with packets, and by measuring just the number of packets a given node receives, the node is able to asymptotically estimate this largest eigenvalue.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsBibliography
Anderson, B.D.O., Kraus, F., Mansour, M., Dasgupta, S.: Easily testable sufficient conditions for the robust stability of systems with multilinear parameter dependence. Automatica 31 (1), 25–40 (1995)
Berg, J.v.d., Kesten, H.: Inequalities with applications to percolation and reliability. J. Appl. Probab. 22 (3), 556–569 (1985)
Biggs, N.L.: Algebraic Graph Theory. Cambridge University Press, Cambridge (1974)
Brooks, R.R., Pillai, B., Racunas, S., Rai, S.A.R.S.: Mobile network analysis using probabilistic connectivity matrices. IEEE Trans. Syst. Man Cybern. C Appl. Rev. 37 (4), 694–702 (2007)
Chen, C.: Linear System Theory and Design, 4th edn. The Oxford Series in Electrical and Computer Engineering. Oxford University Press, Oxford (2012)
Dasgupta, S., Anderson, B.: Physically based parameterizations for designing adaptive algorithms. Automatica 23 (4), 469–477 (1987)
Dasgupta, S., Anderson, B., Kaye, R.J.: Identification of physical parameters in structured systems. Automatica 24 (2), 217–225 (1988)
Dasgupta, S., Chockalingam, C., Fu, M., Anderson, B.: Lyapunov functions for uncertain systems with applications to the stability of time varying systems. IEEE Trans. Circuits Syst. I Fundam. Theory Appl. 41 (2), 93–105 (1994)
Gantmacher, F.: The Theory of Matrices, vol. 2. Chelsea Publishing, New York (2000)
Godsil, C., Royle, G.F.: Algebraic Graph Theory. Springer, New York (2001)
Golub, G.H., Loan, C.F.V.: Matrix Computations, 3rd edn. Johns Hopkins Studies in Mathematical Sciences. Johns Hopkins University Press (1996)
Gupta, P., Kumar, P.R.: Critical Power for Asymptotic Connectivity in Wireless Networks, pp. 547–566. Systems and Control: Foundations and Applications. Birkhauser, Boston (1998)
Hartfiel, D.J.: Nonhomogeneous Matrix Products. World Scientific Publishing Company, Singapore (2002)
Hogben, L.: Handbook of Linear Algebra, 1st edn. Discrete Mathematics and Its Applications. Chapman and Hall/CRC, Boca Raton (2007)
Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985)
Meester, R., Roy, R.: Continuum Percolation. Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge (1996)
Mohar, B.: Laplace eigenvalues of graphs - a survey. J. Discrete Math. 109, 171–183 (1992)
Olfati-Saber, R., Fax, J.A., Murray, R.M.: Consensus and cooperation in networked multi-agent systems. Proc. IEEE 95 (1), 215–233 (2007)
Penrose, M.D.: Random Geometric Graphs. Oxford Studies in Probability. Oxford University Press, Oxford (2003)
Varga, R.A.: Matrix Iterative Analysis. Prentice Hall, Englewood Cliffs (1962)
Wan, P.J., Yi, C.W.: Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks. In: Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing, pp. 1–8 (2004)
Zadeh, L., Desoer, C.A.: Linear Systems Theory. McGraw Hill, New York (1963)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Mao, G. (2017). A New Measure of Wireless Network Connectivity. In: Connectivity of Communication Networks. Springer, Cham. https://doi.org/10.1007/978-3-319-52989-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-52989-9_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-52988-2
Online ISBN: 978-3-319-52989-9
eBook Packages: EngineeringEngineering (R0)