20,910 research outputs found
Full Connectivity: Corners, edges and faces
We develop a cluster expansion for the probability of full connectivity of
high density random networks in confined geometries. In contrast to percolation
phenomena at lower densities, boundary effects, which have previously been
largely neglected, are not only relevant but dominant. We derive general
analytical formulas that show a persistence of universality in a different form
to percolation theory, and provide numerical confirmation. We also demonstrate
the simplicity of our approach in three simple but instructive examples and
discuss the practical benefits of its application to different models.Comment: 28 pages, 8 figure
Extremal Properties of Three Dimensional Sensor Networks with Applications
In this paper, we analyze various critical transmitting/sensing ranges for
connectivity and coverage in three-dimensional sensor networks. As in other
large-scale complex systems, many global parameters of sensor networks undergo
phase transitions: For a given property of the network, there is a critical
threshold, corresponding to the minimum amount of the communication effort or
power expenditure by individual nodes, above (resp. below) which the property
exists with high (resp. a low) probability. For sensor networks, properties of
interest include simple and multiple degrees of connectivity/coverage. First,
we investigate the network topology according to the region of deployment, the
number of deployed sensors and their transmitting/sensing ranges. More
specifically, we consider the following problems: Assume that nodes, each
capable of sensing events within a radius of , are randomly and uniformly
distributed in a 3-dimensional region of volume , how large
must the sensing range be to ensure a given degree of coverage of the region to
monitor? For a given transmission range, what is the minimum (resp. maximum)
degree of the network? What is then the typical hop-diameter of the underlying
network? Next, we show how these results affect algorithmic aspects of the
network by designing specific distributed protocols for sensor networks
Impact of boundaries on fully connected random geometric networks
Many complex networks exhibit a percolation transition involving a
macroscopic connected component, with universal features largely independent of
the microscopic model and the macroscopic domain geometry. In contrast, we show
that the transition to full connectivity is strongly influenced by details of
the boundary, but observe an alternative form of universality. Our approach
correctly distinguishes connectivity properties of networks in domains with
equal bulk contributions. It also facilitates system design to promote or avoid
full connectivity for diverse geometries in arbitrary dimension.Comment: 6 pages, 3 figure
Recommended from our members
Technical Review of Residential Programmable Communicating Thermostat Implementation for Title 24-2008
Connectivity-guaranteed and obstacle-adaptive deployment schemes for mobile sensor networks
Mobile sensors can relocate and self-deploy into a network. While focusing on the problems of coverage, existing deployment schemes largely over-simplify the conditions for network connectivity: they either assume that the communication range is large enough for sensors in geometric neighborhoods to obtain location information through local communication, or they assume a dense network that remains connected. In addition, an obstacle-free field or full knowledge of the field layout is often assumed. We present new schemes that are not governed by these assumptions, and thus adapt to a wider range of application scenarios. The schemes are designed to maximize sensing coverage and also guarantee connectivity for a network with arbitrary sensor communication/sensing ranges or node densities, at the cost of a small moving distance. The schemes do not need any knowledge of the field layout, which can be irregular and have obstacles/holes of arbitrary shape. Our first scheme is an enhanced form of the traditional virtual-force-based method, which we term the Connectivity-Preserved Virtual Force (CPVF) scheme. We show that the localized communication, which is the very reason for its simplicity, results in poor coverage in certain cases. We then describe a Floor-based scheme which overcomes the difficulties of CPVF and, as a result, significantly outperforms it and other state-of-the-art approaches. Throughout the paper our conclusions are corroborated by the results from extensive simulations
A Holistic Investigation on Terahertz Propagation and Channel Modeling Toward Vertical Heterogeneous Networks
User-centric and low latency communications can be enabled not only by small
cells but also through ubiquitous connectivity. Recently, the vertical
heterogeneous network (V-HetNet) architecture is proposed to backhaul/fronthaul
a large number of small cells. Like an orchestra, the V-HetNet is a polyphony
of different communication ensembles, including geostationary orbit (GEO), and
low-earth orbit (LEO) satellites (e.g., CubeSats), and networked flying
platforms (NFPs) along with terrestrial communication links. In this study, we
propose the Terahertz (THz) communications to enable the elements of V-HetNets
to function in harmony. As THz links offer a large bandwidth, leading to
ultra-high data rates, it is suitable for backhauling and fronthauling small
cells. Furthermore, THz communications can support numerous applications from
inter-satellite links to in-vivo nanonetworks. However, to savor this harmony,
we need accurate channel models. In this paper, the insights obtained through
our measurement campaigns are highlighted, to reveal the true potential of THz
communications in V-HetNets.Comment: It has been accepted for the publication in IEEE Communications
Magazin
- …