Optimizing push/pull envelopes for energy-efficient cloud-sensor systems
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
| Hi-index | 0.00 |
How to get a better balance between the push and pull of the event data is the common goal of the various data dissemination algorithms in Wireless Sensor Networks (WSNs). And the characteristics of the Any-type Query in WSNs is different from the All-type query. At this basis, the load of the system hotspot should be further decreased and the number of the event data replicas should be reduced. In the paper, two well-known typical structured and unstructured data dissemination algorithms (DCS and CN) are analyzed and their advantages and disadvantages are figured out. At the same time, by combining the push-pull strategies of the two algorithms, two new data dissemination algorithms are proposed based on the sequential DCS and CN push-pull strategies for the ANY-type queries in the different application situation in WSNs. The two new algorithms are Sequential-Dcs-Cn1 (SDC1) and Sequential -Dcs-Cn2 (SDC2). They have resolved the problems of the high load of the hotspot and the large number of the event data replicas and the low energy efficiency of queries on the premise that ensuring the balance between the push and pull. The theoretical analyses and simulations show that the performance of SDC1 is much better than that of the existing algorithms, and that of SDC2 is close to DCS, but is more fit for the case of unevenly distributed events than SDC1. So they are much more appropriate for the WSNs which are large-scale and have large volume of data to be dealt with, and they are two energy-efficient data dissemination algorithms