Sensing and acting with predefined trajectories

We consider applications of mobile wireless sensor actor networks(MWSAN) that require periodic readings and/or actions. In such a context, a single integrated sensor-actor can be used to monitor different regions of the target area if it is able to move from one region to another within some expected time limit. In this paper, we propose a mobility strategy that consists in making nodes follow a space-filling curve with good locality properties (i.e., regions close on the curve are also close on the area). This strategy has a number of advantages, such as higher possibility for merging readings when these latter present high spatial correlation (as in the examples listed above). We also propose that nodes use opportunistic contacts to reduce the delivery delay performed by the sensing module. Through a number of numerical analysis, we show that with a proper dimensioning of the system, we can achieve full area coverage and guarantee bounded delivery delays with a limited number of sensor-actor nodes.

[1]  Serge Fdida,et al.  Twins: A Dual Addressing Space Representation for Self-Organizing Networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[2]  Ivan Stojmenovic,et al.  Localized sensor area coverage with low communication overhead , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications (PERCOM'06).

[3]  Martin Haenggi,et al.  Mobile sensor-actuator networks: opportunities and challenges , 2002, Proceedings of the 2002 7th IEEE International Workshop on Cellular Neural Networks and Their Applications.

[4]  H. V. Jagadish,et al.  Linear clustering of objects with multiple attributes , 1990, SIGMOD '90.

[5]  Jonathan K. Lawder.  The application of space-filling curves to the storage and retrieval of multi-dimensional data , 2000 .

[6]  Desh Ranjan,et al.  Space-Filling Curves and Their Use in the Design of Geometric Data Structures , 1997, Theor. Comput. Sci..

[7]  Christos Faloutsos,et al.  Analysis of the Clustering Properties of the Hilbert Space-Filling Curve , 2001, IEEE Trans. Knowl. Data Eng..

[8]  D. Hilbert.  Ueber die stetige Abbildung einer Line auf ein Flächenstück , 1891 .

[9]  Thomas F. La Porta,et al.  Movement-assisted sensor deployment , 2004, IEEE INFOCOM 2004.

[10]  Ye-In Chang,et al.  Neighbor-finding based on space-filling curves , 2005, Inf. Syst..

[11]  Baback Moghaddam,et al.  Space-filling curves for image compression , 1991, Defense, Security, and Sensing.

[12]  Ian F. Akyildiz,et al.  Wireless sensor and actor networks: research challenges , 2004, Ad Hoc Networks.

[13]  Donald F. Towsley,et al.  Mobility improves coverage of sensor networks , 2005, MobiHoc '05.

[14]  Ioannis Chatzigiannakis,et al.  Sink mobility protocols for data collection in wireless sensor networks , 2006, MobiWac '06.

[15]  Magnus Karlsson,et al.  Turning heterogeneity into an advantage in overlay routing , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).