Graph Theoretic Models and Tools for the Analysis of Dynamic Wireless Multihop Networks

Wireless multihop networks are being increasingly used in military and civilian applications. Advanced applications of wireless multihop networks demand better understanding on their properties. Existing research on wireless multihop networks has largely focused on static networks, where the network topology is time-invariant; and there is comparatively a lack of understanding on the properties of dynamic networks with dynamically changing topology. In this paper, we use and extend a recently proposed graph theoretic model, i.e. evolving graphs, to capture the characteristics of such networks. We extend and develop the concepts of route matrix, connectivity matrix and probabilistic connectivity matrix as convenient tools to characterize and investigate the properties of evolving graphs and the associated dynamic networks. The properties of these matrices are established and their relevance to the properties of dynamic wireless multihop networks are introduced.

[1]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[2]  Richard R. Brooks,et al.  Mobile Network Analysis Using Probabilistic Connectivity Matrices , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[3]  Afonso Ferreira,et al.  Building a reference combinatorial model for MANETs , 2004, IEEE Network.

[4]  E. Seneta.  Non-negative Matrices and Markov Chains , 2008 .

[5]  Xavier Pérez-Giménez,et al.  On the connectivity of dynamic random geometric graphs , 2007, SODA '08.

[6]  Ramin Hekmat,et al.  Ad-hoc networks - fundamental properties and network topologies , 2006 .

[7]  Willem H. Haemers,et al.  Spectra of Graphs , 2011 .

[8]  R.A. Guerin,et al.  Channel occupancy time distribution in a cellular radio system , 1987, IEEE Transactions on Vehicular Technology.

[9]  Paolo Santi,et al.  An evaluation of connectivity in mobile wireless ad hoc networks , 2002, Proceedings International Conference on Dependable Systems and Networks.

[10]  Afonso Ferreira,et al.  Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic Networks , 2003, ADHOC-NOW.

[11]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[12]  Afonso Ferreira,et al.  Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks , 2003, Int. J. Found. Comput. Sci..

[13]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[14]  Afonso Ferreira,et al.  Performance Evaluation of Dynamic Networks using an Evolving Graph Combinatorial Model , 2006, 2006 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications.

[15]  Panganamala Ramana Kumar,et al.  Scaling Laws for Ad Hoc Wireless Networks: An Information Theoretic Approach , 2006, Found. Trends Netw..

[16]  Michael Doob,et al.  Spectra of graphs , 1980 .

[17]  Patrick Thiran,et al.  Latency of wireless sensor networks with uncoordinated power saving mechanisms , 2004, MobiHoc '04.

[18]  M. J. Appel,et al.  The connectivity of a graph on uniform points on [0,1]d , 2002 .

[19]  E. Seneta.  Non-negative Matrices and Markov Chains (Springer Series in Statistics) , 1981 .

[20]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .