基于传感器网络的信息广播系统关键技术分析-analysis of key technologies of information broadcasting system based on sensor network.docx

优秀毕业论文 精品参考文献资料 coding theory in cooperation zone. Simulation test results show that the RealStore is capable to improve information availability efficiently. In the data server layer, existing event-matching algorithms are not very efficient, especially for interval range predicates and overlapping predicates in subscriptions. So this dissertation discusses the above challenge and proposes a dynamic and fast event matching algorithm called SGEM. SGEM algorithm can well support range predicates or overlapping predicates and provides single and composite event matching. It groups the subscriptions by the predicates and dynamically identifies appropriate number of groups considering different statistical distributions of subscriptions at run time. Also, we present an experimental evaluation and compare its performance with existing algorithms. The experiment results show that SGEM can significantly reduce the evaluation cost and guarantees the scalability with respect to the number of subscriptions as well as the number of predicates and events. This dissertation research updates propagation using broadcast delivery method in hierarchical data broadcast systems with a high rate of updates at the primary server and a high rate of data requests at the secondary servers. Updates are propagated from hierarchical data servers to single-item on-demand data requests from a population of data consumers. Three algorithms that combine update propagation with data broadcast scheduling in hierarchical data broadcast systems with a high rate of updates at the primary server and a high rate of data requests at the secondary servers are proposed named: RU, RU+ESI and PF algorithm. The proposed algorithms are functions of the rates of consumer requests and of data updates to increase data freshness and decrease consumers wait time. At the secondary servers, two implementations of the decision maker component of the proposed algorithms (i.e., LWF and RxW) are provided to demonstrate