Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2005-10-17
Computer Science
Distributed, Parallel, and Cluster Computing
10 pages, 9 figures, Latex, to appear in Symposium on Discrete Algorithms (SODA 2006)
Scientific paper
We present a new framework for the crucial challenge of self-organization of a large sensor network. The basic scenario can be described as follows: Given a large swarm of immobile sensor nodes that have been scattered in a polygonal region, such as a street network. Nodes have no knowledge of size or shape of the environment or the position of other nodes. Moreover, they have no way of measuring coordinates, geometric distances to other nodes, or their direction. Their only way of interacting with other nodes is to send or to receive messages from any node that is within communication range. The objective is to develop algorithms and protocols that allow self-organization of the swarm into large-scale structures that reflect the structure of the street network, setting the stage for global routing, tracking and guiding algorithms.
Fekete Sandor P.
Fischer Stefan
Kroeller Alexander
Pfisterer Dennis
No associations
LandOfFree
Deterministic boundary recognition and topology extraction for large 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 Deterministic boundary recognition and topology extraction for large sensor networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deterministic boundary recognition and topology extraction for large sensor networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-228731