Approximate conditional distributions of distances between nodes in a two-dimensional sensor network

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1007/978-3-642-02205-0_23

When we represent a network of sensors in Euclidean space by a graph, there are two distances between any two nodes that we may consider. One of them is the Euclidean distance. The other is the distance between the two nodes in the graph, defined to be the number of edges on a shortest path between them. In this paper, we consider a network of sensors placed uniformly at random in a two-dimensional region and study two conditional distributions related to these distances. The first is the probability distribution of distances in the graph, conditioned on Euclidean distances; the other is the probability density function associated with Euclidean distances, conditioned on distances in the graph. We study these distributions both analytically (when feasible) and by means of simulations. To the best of our knowledge, our results constitute the first of their kind and open up the possibility of discovering improved solutions to certain sensor-network problems, as for example sensor localization.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Approximate conditional distributions of distances between nodes in a two-dimensional sensor network 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 Approximate conditional distributions of distances between nodes in a two-dimensional sensor network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate conditional distributions of distances between nodes in a two-dimensional sensor network will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-94853

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.