Booth, Lorna

Bruck, Jehoshua

Cook, Matthew

Franceschetti, Massimo

Meester, Ronald

English

Models of wireless ad-hoc and sensor networks are often based on the geometric disc abstraction: transmission is assumed to be isotropic, and reliable communication channels are assumed to exist (apart from interference) between nodes closer than a given distance. In reality communication channels are unreliable and communication range is generally not rotationally symmetric. In this paper we examine how these issues affect network connectivity. We compare networks of geometric discs to other simple shapes and/or probabilistic connections, and we find that when transmission range and node density are normalized across experiments so as to preserve the expected number of connections (ENC) enjoyed by each node, discs are the “hardest ” shape to connect together. In other words, anisotropic radiation patterns and spotty coverage allow an unbounded connected component to appear at lower ENC levels than perfect circular coverage allows. This indicates that connectivity claims made in the literature using the geometric disc abstraction in general hold also for the more irregular shapes found in practice

Massimo Franceschetti

Lorna Booth

Matthew Cook

Ronald Meester

Jehoshua Bruck

CiteSeerX

Percolation in multi-hop wireless networks

Caltech Authors - Main

Percolation in Multi-hop Wireless Networks

A deterministic approach to throughput scaling in wireless networks.

Collective dynamics of small world networks.

Continuum percolation threshold for interpenetrating squares and cubes.

Continuum percolation.

Covering algorithms, continuum percolation, and the geometry of wireless networks.

Critical intensities of Boolean models with di®erent underlying convex shapes.

Critical intensities of Boolean models with different underlying convex shapes.

Critical power for asymptotic connectivity in wireless networks.

Critical power for asymptotic connectivity in wireless networks. Stochastic Analysis, Control, Optimization and Applications: A Volume in 14Honor of

Designing a Contact Process. The PiecewiseHomogeneous Process on a Finite Set with Applications. Annals of Applied Probability, submitted for publication.

E±cient measurement of the percolation threshold for fully penetrable discs.

Efficient measurement of the percolation threshold for fully penetrable discs.

Impact of interferences on connectivity in ad-hoc networks.

Mobility increases the capacity of ad hoc wireless networks.

Nearest Neighbour and Hard Sphere Models in Continuum Percolation.

On the spread-out limit for bond and continuum percolation.

Optimization of shape in continuum percolation.

Random plane networks.

The capacity of wireless networks.

The random connection model in high dimensions.

https://authors.library.caltech.edu/26086/1/etr055.pdf

Percolation in Multi-hop Wireless Networks

Abstract

Similar works

Full text

Available Versions

CiteSeerX

Caltech Authors - Main