Data Forwarding Based On Delaunay Triangulation In Cyber Physical Systems

Cyber-physical System (CPS) cooperates with physical processes and integrates computing, communication and control (3C) into multiple levels of cyber processing and operation management to streamline and fortify the operation of physical systems. One of the basic operations of CPS is to finish data gathering and forwarding by networking (often wireless) with intermittent network connectivity. Due to the unique characteristics, such as self-control, node mobility, and network intermittent connectivity, an algorithm for data forwarding in CPS is a considerably difficult and challenging problem and there are not any good solutions to it in the existing works. This paper proposes a data forwarding scheme based on Delaunay triangulation in CPS The scheme depicts a reasonable and effective method of sensor node deployment, data replication and updates; a route lookup algorithms, which takes into account the computational geometry based on Delaunay triangulation to form a few triangular communities according to nodes’connectivity. Data in a community are forwarded to other nodes once a node comes into this community to increase the data delivery ratio, our proposed route lookup algorithm replaces the traditional hop by hop method to find route paths.Firstly, we propose a scheme based on Delaunay triangulation for sensor node deployment. The key idea is a few triangular communities formed according to nodes’ connectivity, each community operates Delaunay triangulation by Partition algorithm.Secondly, we propose a data replication and updates algorithms. RDDC’s key idea is Transmission probability and each community’s degree. In the part of data updates, we set two parameters, version number and counter.Thirdly, we propose a Data Forwarding scheme (DFDT, Data Forwarding based on Delaunay Triangulation). In essence DFDT contains node deployment, data replication and updates, routing lookup. In the part of the routing lookup, we propose an algorithm, which replaces the traditional hop by hop method to find route paths in CPS. The key idea is a triangle as a hop.