Marcelo G. Almiron
ABSTRACT
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.
- M. G. Almiron, O. Goussevskaia, A. C. Frery, and A. A. Loureiro. Modeling and connectivity analysis in obstructed wireless ad hoc networks. In Proceedings of the 15th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM), pages 195--202, 2012. Google Scholar
Digital Library
- B. Bollobás, S. Janson, and O. Riordan. Line-of-sight percolation. Combinatorics, Probability & Computing, 18(1--2):83--106, 2009. Google ScholarDigital Library
- O. Dousse, P. Thiran, and M. Hasler. Connectivity in ad-hoc and hybrid networks. In Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), volume 2, pages 1079--1088, 2002.Google ScholarCross Ref
- M. Franceschetti and R. Meester. Random Networks for Communication: From Statistical Physics to Information Systems. Statistical and Probabilistic Mathematics. Cambridge University Press, 2007.Google Scholar
- A. M. Frieze, J. M. Kleinberg, R. Ravi, and W. Debany. Line-of-sight networks. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 968--977, 2007. Google ScholarDigital Library
- A. Ghasemi and S. Nader-Esfahani. Exact probability of connectivity in one-dimensional ad hoc wireless networks. IEEE Communications Letters, 10(4):251--253, 2006.Google ScholarCross Ref
- O. Goussevskaia, M. M. Halldàrsson, R. Wattenhofer, and E. Welzl. Capacity of arbitrary wireless networks. In Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), pages 1872--1880, 2009.Google ScholarCross Ref
- G. Grimmett. Percolation. Springer-Verlag, second edition, 1999.Google Scholar
- P. Gupta and P. R. Kumar. Critical power for asymptotic connectivity in wireless networks. Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming, pages 547--566, 1998.Google Scholar
- P. Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, 46(2):388--404, 2000. Google ScholarDigital Library
- M. Haenggi and R. K. Ganti. Interference in large wireless networks. Foundations and Trends in Networking, 3(2):127--248, 2009. Google ScholarDigital Library
- R. Meester and R. Roy. Continuum percolation. Cambridge tracts in mathematics. Cambridge University Press, 1996.Google Scholar
- M. Nekoui and H. Pishro-Nik. A geometrical analysis of obstructed wireless networks. In Proceedings of the IEEE Information Theory Workshop (ITW), pages 589--593, 2009.Google ScholarCross Ref
- M. Penrose. Random geometric graphs. Oxford studies in probability. Oxford University Press, 2003.Google Scholar
- M. D. Penrose. On k-connectivity for a geometric random graph. Random Structures & Algorithms, 15(2):145--164, Sep 1999. Google ScholarDigital Library
- P. Santi and D. Blough. The critical transmitting range for connectivity in sparse wireless ad hoc networks. IEEE Transactions on Mobile Computing, 2(1):25--39, 2003. Google ScholarDigital Library
- S. Shakkottai, R. Srikant, and N. Shro. Unreliable sensor grids: Coverage, connectivity and diameter. In Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), volume 2, pages 1073--1083, 2003.Google ScholarCross Ref
Index Terms
- Connectivity in obstructed wireless networks: from geometry to percolation
Recommendations
Modeling and connectivity analysis in obstructed wireless ad hoc networks
MSWiM '12: Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systemsConnectivity properties of wireless networks in open space are typically modeled using geometric random graphs and have been analyzed in depth in different studies. Such scenarios, however, do not often represent situations encountered in practice, like ...
CSMA/IC: a new paradigm for medium access control in wireless LANs and ad hoc wireless networks
In this paper, we present a new Medium Access Control (MAC) protocol Carrier Sense Medium Access/ID Countdown (CSMA/IC) for multihop ad hoc wireless networks that differs from CSMA/CA. CSMA/IC can achieve virtually 100% collision-free performance by ...
On high-throughput and fair multi-hop wireless ad hoc networks with MIMO
Mobility '06: Proceedings of the 3rd international conference on Mobile technology, applications & systemsNowadays, the prevalence of multimedia applications mandates that wireless networks provide higher throughput and increased spatial efficiency. Aimed primarily at achieving this goal, the first IEEE 802.11n draft was recently approved. In the draft, ...
Comments