472 research outputs found
Connectivity in Dense Networks Confined within Right Prisms
We consider the probability that a dense wireless network confined within a
given convex geometry is fully connected. We exploit a recently reported theory
to develop a systematic methodology for analytically characterizing the
connectivity probability when the network resides within a convex right prism,
a polyhedron that accurately models many geometries that can be found in
practice. To maximize practicality and applicability, we adopt a general
point-to-point link model based on outage probability, and present example
analytical and numerical results for a network employing
multiple-input multiple-output (MIMO) maximum ratio combining (MRC) link level
transmission confined within particular bounding geometries. Furthermore, we
provide suggestions for extending the approach detailed herein to more general
convex geometries.Comment: 8 pages, 6 figures. arXiv admin note: text overlap with
arXiv:1201.401
Research on Wireless Multi-hop Networks: Current State and Challenges
Wireless multi-hop networks, in various forms and under various names, are
being increasingly used in military and civilian applications. Studying
connectivity and capacity of these networks is an important problem. The
scaling behavior of connectivity and capacity when the network becomes
sufficiently large is of particular interest. In this position paper, we
briefly overview recent development and discuss research challenges and
opportunities in the area, with a focus on the network connectivity.Comment: invited position paper to International Conference on Computing,
Networking and Communications, Hawaii, USA, 201
A Unifying Framework for Local Throughput in Wireless Networks
With the increased competition for the electromagnetic spectrum, it is
important to characterize the impact of interference in the performance of a
wireless network, which is traditionally measured by its throughput. This paper
presents a unifying framework for characterizing the local throughput in
wireless networks. We first analyze the throughput of a probe link from a
connectivity perspective, in which a packet is successfully received if it does
not collide with other packets from nodes within its reach (called the audible
interferers). We then characterize the throughput from a
signal-to-interference-plus-noise ratio (SINR) perspective, in which a packet
is successfully received if the SINR exceeds some threshold, considering the
interference from all emitting nodes in the network. Our main contribution is
to generalize and unify various results scattered throughout the literature. In
particular, the proposed framework encompasses arbitrary wireless propagation
effects (e.g, Nakagami-m fading, Rician fading, or log-normal shadowing), as
well as arbitrary traffic patterns (e.g., slotted-synchronous,
slotted-asynchronous, or exponential-interarrivals traffic), allowing us to
draw more general conclusions about network performance than previously
available in the literature.Comment: Submitted for journal publicatio
An Analytical Expression for k-connectivity of Wireless Ad Hoc Networks
Over the last few years coverage and connectivity of wireless ad hoc networks have fascinated considerable attention. The presented paper analyses and investigates the issues of k-connectivity probability and its robustness in wireless ad hoc-network while considering fading techniques like lognormal fading, Rayleigh fading, and nakagami fading in the ad hoc communication environment, by means of shadowing and fading phenomenon. In case of k-connected wireless sensor network (WSNs), this technique permits the routing of data packets or messages via individual (one or more) of minimum k node disjoint communication paths, but the other remaining paths can also be used. The major contribution of the paper is mathematical expressions for k-connectivity probability
A sum-of-sinusoids based simulation model for the joint shadowing process in urban peer-to-peer radio channels
This document is made available in accordance with publisher policies. Please cite only the published version using the reference above. Full terms of use are available
- …