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 pushpull 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-DcsCn1(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.

No abstract

No abstract

Abstract. The geographic routing technology is good for the self-organizing and large-scale Wireless Sensor Networks(WSNs), and the energy-limited sensor nodes require the energy used for routing to be minimum. In this paper a new energy-efficient geographic routing algorithm is proposed and it is distributed and based on the geographic routing, the topology characteristics of the network and the wireless communication energy model. The algorithm is based on the planarized graph (GG) of the network, it deals with the routing void by saving more face neighbors in every node, and selects the most energyefficient nexthop node by using the energy-saving technologies including the Minimum Energy One-hop Neighbor Path Selection and the Optimal Faceneighbor Selection. The theoretical analysis and simulations show that the algorithm is feasible and more energy-efficient than many existed geographic routing algorithms. In the end , the means of face information maintenance are proposed.

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). 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 pushpull strategies of the two algorithms, two new data dissemination algorithms are proposed based on the hybrid structured and unstructured data push-pull strategies for the ALL-type queries in the different application situation in WSNs. The two new algorithms are Hybrid-Dcs-Cn1 (HDC1) and Hybrid-Dcs-Cn2 (HDC2). The theoretical analyses and simulations show that they resolve the problems of the high load of the hotspot and the large number of the event data replicas and the low performance of the query on the premise that ensuring the balance between the push and pull. The total system communication cost of the two new algorithms are close to or better than the existing algorithms, so the two algorithms are more appropriate for the WSNs , especially when there are a large volume of data to be dealt with, and they are two energy-efficient data dissemination algorithms.