Optimizing the Spatio-temporal Distribution of Cyber-Physical Systems for Environment Abstraction

Cyber-physical systems (CPS) bridge the virtual cyber world with the real physical world. For representing a physical environment in cyber, CPS devices / nodes are assigned to collect data in a region of interest. In practice, the nodes seldom fully cover the region due to the restriction of quantity and cost. Hence, the sampled data are usually inadequate to describe the holistic environment. Recent researches mainly focus on the interpolation methods to generate an approximating model from the raw data. However, in this paper, we propose to study the spatio-temporal distribution of CPS nodes in order to obtain the crucial data for optimal environment abstraction. There are two target problems. First, when the environment changes little over time, what is the optimal spatial distribution of stationary nodes based on historical data? Second, when the environment is time-varying, what is the adaptive spatio-temporal distribution of mobile nodes? We show the NP hardness of the former problem and propose an approximation algorithm. For the latter problem, we develop a cooperative movement algorithm on nodes for achieving a curvature-weighted distribution pattern. A trace driven simulation based on real data of GreenOrbs project evaluates the performance of the proposed approaches.

[1]  Matt Welsh,et al.  Fidelity and yield in a volcano monitoring sensor network , 2006, OSDI '06.

[2]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization based on virtual forces , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[4]  Reuven Bar-Yehuda,et al.  Time/space tradeoffs for polygon mesh rendering , 1996, TOGS.

[5]  Dereck S. Meek,et al.  On surface normal and Gaussian curvature approximations given data sampled from a smooth surface , 2000, Comput. Aided Geom. Des..

[6]  Sonia Martínez,et al.  Monitoring Environmental Boundaries With a Robotic Sensor Network , 2006, IEEE Transactions on Control Systems Technology.

[7]  Weijia Jia,et al.  Complete optimal deployment patterns for full-coverage and k-connectivity (k≤6) wireless sensor networks , 2008, MobiHoc '08.

[8]  Paul S. Heckbert,et al.  Survey of Polygonal Surface Simplification Algorithms , 1997 .

[9]  Keith R. Matthews,et al.  Elementary Linear Algebra , 1998 .

[10]  D. T. Lee,et al.  Two algorithms for constructing a Delaunay triangulation , 1980, International Journal of Computer & Information Sciences.

[11]  Shaojie Tang,et al.  Canopy closure estimates with GreenOrbs: sustainable sensing in the forest , 2009, SenSys '09.

[12]  M. Garland,et al.  Fast Polygonal Approximation of Terrains and Height Fields , 1998 .

[13]  Y. Charlie Hu,et al.  Deployment of mobile robots with energy and timing constraints , 2006, IEEE Transactions on Robotics.

[14]  Subhash Suri,et al.  Surface approximation and geometric partitions , 1994, SODA '94.

[15]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[16]  Huan Liu,et al.  Building a distributed robot garden , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[17]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[18]  Dan Wang,et al.  Double Mobility: Coverage of the Sea Surface with Mobile Sensor Networks , 2009, IEEE INFOCOM 2009.

[19]  Hari Balakrishnan,et al.  Cabernet: vehicular content delivery using WiFi , 2008, MobiCom '08.

[20]  Edward A. Lee.  Cyber Physical Systems: Design Challenges , 2008, 2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC).