A network is k-connected if it remains connected after the removal of any k–1 of its nodes.
Assume that n sensors, modeled here as (omni) directional antennas, are dropped randomly …

Connectivity in wireless sensor networks may be established using either omnidirectional or
directional antennae. The former radiate power uniformly in all directions while the latter …

We investigate the problem of converting sets of sensors into strongly connected networks of
sensors using multiple directional antennae. Consider a set S of n points in the plane …

We consider the problem of providing full coverage of a planar region with sensors.
Likewise, we consider the connectivity of the sensor network of directional antennas formed …

Given a set S of n sensors in the plane we consider the problem of establishing an ad hoc
network from these sensors using directional antennae. We prove that for each given integer …

We consider a wireless network of N nodes equipped with omnidirectional antennas, and
we extend the capacity results of some previous works by finding bounds on the maximum …

In this paper, we study, via simple discrete mathematical models, the problems of data
distribution and data collection in wireless sensor networks. The work that follows continues …

Uniformly random or Poisson distributions are widely accepted models for the location of the
nodes in wireless sensor networks if nodes are deployed in large quantities and there is little …

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 …

We study the problem of maintaining connectivity in a wireless network where the network
nodes are equipped with directional antennas. Nodes correspond to points on the plane and …