Using self-organizing wireless sensor networks for object tracking requires ordering events with regard to time and location. In labyrinth-shaped topologies, one-dimensional ordering suffices within the different parts of the network. We present an algorithm to derive this ordering without the use of location information. Local order knowledge in the nodes can then be additionally used to detect junctions.
|Number of pages||2|
|Publication status||Published - 01.06.2006|
|Event||4th international conference on Mobile systems, applications and services - Uppsala, Sweden|
Duration: 19.06.2006 → 22.06.2006
|Conference||4th international conference on Mobile systems, applications and services|
|Period||19.06.06 → 22.06.06|