Connectivity of Random 1-Dimensional Networks

Details Connectivity of Random 1-Dimensional Networks Connectivity of Random 1-Dimensional Networks

2007-10-04

arxiv.org/abs/0710.1001v2

Computer Science

Information Theory

12 pages, 10 figures

Scientific paper

An important problem in wireless sensor networks is to find the minimal number of randomly deployed sensors making a network connected with a given probability. In practice sensors are often deployed one by one along a trajectory of a vehicle, so it is natural to assume that arbitrary probability density functions of distances between successive sensors in a segment are given. The paper computes the probability of connectivity and coverage of 1-dimensional networks and gives estimates for a minimal number of sensors for important distributions.

Affiliated with

Also associated with

No associations

Rating

Connectivity of Random 1-Dimensional Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Connectivity of Random 1-Dimensional Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Connectivity of Random 1-Dimensional Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-563315