On k-connectivity for a geometric random graph
Random Structures & Algorithms
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Combinatorics, Probability and Computing
Interference in Large Wireless Networks
Foundations and Trends® in Networking
The capacity of wireless networks
IEEE Transactions on Information Theory
Modeling and connectivity analysis in obstructed wireless ad hoc networks
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Hi-index | 0.00 |
In this work, we analyze an alternative model for obstructed wireless networks. The model is based on a grid structure of one-dimensional street segments and two-dimensional street intersections. This structure provides a realistic representation of a variety of network scenarios with obstacles and, at the same time, allows a simple enough analysis, which is partly based on percolation theory and partly based on geometric properties. We propose three different ways of modeling the geometric part of the network and derive analytical bounds for the connectivity probability and the critical transmission range for connectivity in the network. Finally, we present extensive simulations that demonstrate that our analytical results provide good approximations, especially for high density scenarios.