Data Collection in Multi-Application Sharing Wireless Sensor Networks

摘要: Data sharing for data collection among multiple applications is an efficient way to reduce communication cost Wireless Sensor Networks (WSNs). This paper the first work introduce interval problem which investigate how transmit as less possible over network, and meanwhile transmitted satisfies requirements of all applications. Different from current studies where each application requires a single sampling during task, we study continuous in task. The proposed nonlinear nonconvex optimization problem. In order lower high complexity solving resource restricted WSNs, 2-factor approximation algorithm whose time $O(n^{2})$ memory $O(n)$ provided. A special instance this also analyzed. can be solved with dynamic programming polynomial time, gives optimal result complexity. Three online algorithms are provided process continually coming tasks. Both theoretical analysis simulation results demonstrate effectiveness algorithms.