Name
Abstract | ||
|---|---|---|
Connectivity 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 urban environments or indoor spaces, which are deeply affected by obstacles. In this work, we present a model for obstructed wireless ad hoc networks consisting of a set of n nodes, deployed at random in a lattice square of size g×g, with a common transmission range r. For positioning the nodes in the field, all segments are considered as one-dimensional, but for communication purposes, we add a parameter µ to model the segments' width. Our model can be used to study the structure of obstructed networks analytically, as well as to simulate and evaluate a variety of node deployment strategies and the resulting network topologies. We derive analytical forms for the probability of existing crossing links between parallel and perpendicular segments sharing an intersection, toward a first topological characterization of our model. Moreover, we compute a lower bound for the probability of connectivity at intersections between segments, and apply percolation theory to derivate the Critical Transmission Range for connectivity in the overall network, i.e., the minimum transmission range that generates communication graphs that are connected with high probability. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1145/2387238.2387273 | MSWiM |
Keywords | Field | DocType |
communication graph,overall network,wireless network,common transmission range,high probability,resulting network topology,connectivity analysis,minimum transmission range,networks analytically,communication purpose,geometric random graph,percolation theory | Wireless network,Random graph,Lattice (order),Upper and lower bounds,Computer science,Percolation theory,Computer network,Network topology,Wireless ad hoc network,Stochastic geometry models of wireless networks,Distributed computing | Conference |
Citations | PageRank | References |
1 | 0.38 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marcelo G. Almiron | 1 | 19 | 2.45 |
| Olga Goussevskaia | 2 | 397 | 25.40 |
| Alejandro C. Frery | 3 | 368 | 38.29 |
| Antonio Loureiro | 4 | 2406 | 197.77 |