Space Filling Curve And Its Applications In 3D Wireless Sensor Networks

Several schemes to cover the wireless sensor networks(WSNs) by a single path(i.e., to linearize a sensor network) have been proposed for many applications such as efficient routing, path planning, data fusion, etc. The design of 3D linearization is more difficult compared to its 2D counterpart because of more complicated geometric characteristics. In this paper, we present a scalable, distributed and connectivity-based algorithm to construct a space filling curve for a 3D WSN, that is, to construct a path traversing all the sensor nodes in the network. The main idea of proposed scheme is to decompose the given 3D network into layers, and the nodes are traversed layer by layer, incrementally from the innermost to the outermost, yielding a path covering each node and visiting as fewer additional hops as possible. The simulation results show that the average number of node’s covered times in the proposed algorithm is less than two and fast covering speed is achieved.On the other hand, in energy-constrained WSN, energy problem has been a fundamental challenge. To solve this, charging using mobile vehicles has been a viable research topic, and we try to apply the space filling curve mentioned above to the path planning and mobile chargers scheduling. We raise an optimization problem aiming to maximize charging efficiency and propose space filling curve based collaborative mobile charging schemes, in which multiple mobile chargers work together to accomplish the charging task. In order to further reduce the charging delay, we propose an optimizing scheme which takes more topological features into consideration. We analyze performance of the schemes and extensive evaluations confirm the efficiency of our schemes.