Quantitative analysis of multi-hop wireless networks using a novel paradigm

Authors:
Chang Wu Yu
Affiliations:
Department of Computer Science and Information Engineering, Chung Hua University, Taiwan, R. O.C
Venue:
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Year:
2007

Citing 11
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
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
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

Opportunistic relaying vs. selective cooperation: analyzing the occurrence-conditioned outage capacity

Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Computing subgraph probability of random geometric graphs with applications in quantitative analysis of ad hoc networks

IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks

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 multi-hop wireless networks consisting of n mobile devices with transmission radius r unit length that are independently and uniformly distributed randomly in an area. This work presents a novel paradigm to compute the subgraph probability in RGGs. In contrast to previous asymptotic bounds or approximation, the closed-form formulas we derived herein are fairly accurate and of practical value. The proposed paradigm can be used to make quantitative analyzes on the fundamental properties of multi-hop wireless networks.