Computing subgraph probability of random geometric graphs with applications in quantitative analysis of ad hoc networks

Authors:
Chang Wu Yu
Affiliations:
Department of Computer Science and Information Engineering, Chung Hua University, HsinChu, Taiwan, R.O.C.
Venue:
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Year:
2009

Citing 15
Cited 2

Graphical evolution: an introduction to the theory of random graphs

Graphical evolution: an introduction to the theory of random graphs
On k-connectivity for a geometric random graph

Random Structures & Algorithms
Approximating layout problems on random geometric graphs

Journal of Algorithms
On the minimum node degree and connectivity of a wireless multihop network

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks

IEEE Transactions on Mobile Computing
Effect of Hidden Terminals on the Performance of IEEE 802.11 MAC Protocol

LCN '98 Proceedings of the 23rd Annual IEEE Conference on Local Computer Networks
Performance Evaluation of Distributed Co-Ordination Function for IEEE 802.11 Wireless LAN Protocol in Presence of Mobile and Hidden Terminals

MASCOTS '99 Proceedings of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Domination and Its Applications in Ad Hoc Wireless Networks with Unidirectional Links

ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs

Combinatorics, Probability and Computing
The number of neighbors needed for connectivity of wireless networks

Wireless Networks
Graph Theory With Applications

Graph Theory With Applications
A low overhead dynamic route repairing mechanism for mobile ad hoc networks

Computer Communications
An ad hoc routing protocol providing short backup routes

ICCS '02 Proceedings of the The 8th International Conference on Communication Systems - Volume 02
Computing subgraph probability of random geometric graphs: quantitative analyses of wireless ad hoc networks

FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Quantitative analysis of multi-hop wireless networks using a novel paradigm

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Fast track article: Predicting missing contacts in mobile social networks

Pervasive and Mobile Computing
A Localized Computing Approach for Connectivity Improvement Analysis in Wireless Personal Networks

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Random geometric graphs (RGG) contain vertices whose points are uniformly distributed in a given plane and an edge between two distinct nodes exists when their distance is less than a given positive value. RGGs are appropriate for modeling ad hoc networks consisting of n mobile devices that are independently and uniformly distributed randomly in an area. To the best of our knowledge, this work presents the first paradigm to compute the subgraph probability of RGGs in a systematical way. In contrast to previous asymptotic bounds or approximation, which always assume that the number of nodes in the network tends to infinity, the closed-form formulas we derived herein are fairly accurate and of practical value. Moreover, computing exact subgraph probability in RGGs is shown to be a useful tool for counting the number of induced subgraphs, which explores fairly accurate quantitative property on topology of ad hoc networks.