Connectivity model of wireless networks via dependency links random graphs
- 53 Downloads
We lay down the foundations of a new approach for finding the network connectivity in wireless networks, with special regard to the properties of dependencies between links of geometrically collocated nodes. The proposed methodology is rooted in the theory of random graphs, but we significantly extend the conventional random graph model, as in its original definition it would be too sterile to capture realistic wireless networks. A closed form expression for the network connectivity was derived by an equilateral hexagon topology introduced from the minimum set covering problem. We also analyzed the effect of boundary nodes on the connectivity of an infinitely and a finitely large network. Through a combination of mathematical proof and simulations, we have shown that our result provides a robust performance in wireless networks.
KeywordsRandom graphs theory Dependency edges Connectivity Minimum set covering
Unable to display preview. Download preview PDF.
- 5.Hekmat R, Van Mieghem P (2003) Degree distribution and hop-count in wireless ad-hoc networks. In: Proc. of the ICON pp 603–609 Google Scholar
- 6.Erdös P, Rényi A (1960) On the evolution of random graphs. In: Proc of Hungarian academy of sciences, pp 17–61 Google Scholar
- 9.Newman MEJ (2005) Random graphs as models of networks. In: Handbook of graphs and networks. Wiley-Interscience, New York, pp 35–68 Google Scholar
- 10.Santi P, Blough DM (2002) An evaluation of connectivity in mobile wireless ad hoc networks. In: Proc of ICDSN. IEEE Computer Society, Los Alamitos, pp 89–102 Google Scholar
- 11.Virtanen S. (2003) Properties of non-uniform random graph models. Dissertation, Helsinki University of Technology Google Scholar
- 14.Niu X-Z (2008) Several key techniques for mobile peer-to-peer networks. Dissertation, University of Electronic Science and Technology of China Google Scholar