Computer Science – Data Structures and Algorithms
Scientific paper
2004-05-17
Computer Science
Data Structures and Algorithms
14 pages, 6 figures, Latex, to appear in Workshop on Algorithms Aspects of Sensor Networks (ALGOSENSORS 2004)
Scientific paper
We consider a crucial aspect of self-organization of a sensor network consisting of a large set of simple sensor nodes with no location hardware and only very limited communication range. After having been distributed randomly in a given two-dimensional region, the nodes are required to develop a sense for the environment, based on a limited amount of local communication. We describe algorithmic approaches for determining the structure of boundary nodes of the region, and the topology of the region. We also develop methods for determining the outside boundary, the distance to the closest boundary for each point, the Voronoi diagram of the different boundaries, and the geometric thickness of the network. Our methods rely on a number of natural assumptions that are present in densely distributed sets of nodes, and make use of a combination of stochastics, topology, and geometry. Evaluation requires only a limited number of simple local computations.
Buschmann Carsten
Fekete Sandor P.
Fischer Stefan
Kroeller Alexander
Pfisterer Dennis
No associations
LandOfFree
Neighborhood-Based Topology Recognition in Sensor 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 Neighborhood-Based Topology Recognition in Sensor Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Neighborhood-Based Topology Recognition in Sensor Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-284781