Connectivity model of wireless networks via dependency links random graphs

Authors:
Ke Zuo;Huaimin Wang;Quanyuan Wu;Dongmin Hu
Affiliations:
Institution of Computer Science, University of Defense Technology, Changsha, P.R. China;Institution of Computer Science, University of Defense Technology, Changsha, P.R. China;Institution of Computer Science, University of Defense Technology, Changsha, P.R. China;Institution of Computer Science, University of Defense Technology, Changsha, P.R. China
Venue:
The Journal of Supercomputing
Year:
2011

Citing 6
Cited 0

A new approach to the design and analysis of peer-to-peer mobile networks

Wireless Networks
Scalable analysis and design of ad hoc networks via random graph theory

DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Proem: a middleware platform for mobile peer-to-peer computing

ACM SIGMOBILE Mobile Computing and Communications Review
An Evaluation of Connectivity in Mobile Wireless Ad Hoc Networks

DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
Connectivity in wireless ad-hoc networks with a log-normal radio model

Mobile Networks and Applications
Mobile Peer-to-Peer Computing for Next Generation Distributed Environments: Advancing Conceptual and Algorithmic Applications

Mobile Peer-to-Peer Computing for Next Generation Distributed Environments: Advancing Conceptual and Algorithmic Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.