基于传感器网络的信息广播系统关键技术研究
|
摘要
无线传感器网络是目前一个热门的研究领域,它涉及微电子制造、传感器技术、无线通信技术、嵌入式技术和分布式信息处理等学科。若要尽量发挥无线传感器网络的环境感知与数据采集能力,并充分利用各种监测数据,就必须跳出无线传感器网络的局限,与其他领域的理论与技术进行融合,以便对无线传感器网络进行更好的调度与控制。在这些领域中,分布式的信息广播系统无疑是与无线传感器网络结合最为紧密的一项。无线传感器网络所采集的监测数据可成为信息广播系统的数据基础,而信息广播系统则通过其内的各个组件对这些数据进行管理、决策、协调与控制。本论文即围绕以无线传感器网络为核心的信息广播系统展开工作,探讨并研究了其中的一系列核心问题。
本文探讨了无线传感器网络中的数据获取和保存问题、大规模信息广播系统中层次服务器间的数据传播与更新问题,以及数据广播调度问题。通过这些研究,给出了从生产者到消费者的实时数据获取、存储与传递算法,以尽量降低节点能量消耗、增加数据的可用率,并减少消费者的等待时间。
本文提出了一种使用内容发布／订阅的信息传播、处理架构EventX。在无线传感器网络层,从复杂事件订阅出发,提出了订阅分解与合成机制。将复杂的时间、类型等相关的复合主题事件分解为简单的监测、查询事件,并排除其中冗余的部分,以形成若干个彼此独立的子订阅,从而避免数据的重复采集与传输。同时,引入订阅以及子订阅权重机制及相关的调度算法,保证在资源有限的情况下优先处理重要的订阅,以提高系统应对多个订阅的服务质量。仿真结果表明,订阅分解与合成机制能够在保证数据采集效率的前提下,有效减轻网络负载,延长系统生存时间。
通过分析无线传感器网络的特性及其应用特点,针对节点存储能力有限,无法将网内大量数据信息存储在若干个存储节点上的情况,本文提出了一种新型的传感器网络数据网内存储框架REALSTORE,以便在节约节点能量和内存开销的前提下提高数据的可靠性。给出了REALSTORE的设计目标和体系结构,提出了数据存储协作域、管理节点等基本概念,给出了协作域的建立机制和管理节点的选取算法,然后提出了两种在协作域内进行数据存储与提取的算法与流程。通过仿真测试,证明其能够在较低的资源开销下提高信息的可靠性。
在接收监测数据的服务器层,本文提出了一种事件匹配算法SGEM,以订阅的统计分布为基础,根据订阅中的谓词对订阅进行分组,以便快捷、灵活并实时地响应消费者的查询请求。仿真实验证明,SGEM事件匹配算法能够有效地对事件进行处理,其性能优于其他现有算法,可降低匹配过程中的开销,能减小内容传递的延时,对系统性能的改善显著。
本文深入探讨了层次化的信息广播系统中通过数据广播在一级服务器内进行高速数据更新,以及在二级服务器上进行大量数据查询请求处理的问题。主要的目标是降低消费者收到超时数据的百分比,并减少数据请求的平均等待时间。针对以上需求提出了具有广播判定功能的RU、RU+ESI和PF数据更新广播算法。这三种算法将数据更新与数据广播调度进行结合,改善了主服务上数据高速更新与二级服务器上高频率数据请求所带来的冲突问题,从而达到降低数据超时,减少消费者的等待时间的目的。此外,在二级服务器上还实现了两种广播判定准则——LWF与RxW,使得这三种算法能够适应不同的应用环境。仿真结果说明,RU、RU+ESI和PF数据更新广播算法都优于简单的基准调度算法,在不同的更新速率和消费者请求频率下,这三种算法都处于稳定状态,能够正常工作。
针对多项查询的广播调度算法中的两种选择方法——查询选择方法和数据项选择方法,本文提出了一种采用数据项选择方法的新型的数据调度算法MLWF,以适应动态变化的查询列表。在MLWF中,引入了一种权重机制,根据数据项在未完成查询中出现的频率、所在查询的总体等待时间长度、广播该数据项能否使得尽可能多的查询进入完成状态等因素入手,综合考虑数据调度问题。MLWF算法能够选中使得大量查询状态变为完全应答的数据项,并进行广播。仿真实验将MLWF与LWF、Round Robin和FSO等传统调度算法进行了比较。结果显示,在消费者等待时间方面,MLWF的性能优于LWF、FSO和Round Robin算法。
论文最后对所研究的内容进行总结,总结了本文内容与创新点,并提出了后续研究工作的前进方向。
Wireless sensor network has becoming a hot research topic recently. It combines research areas like the microelectronic manufacture, sensing technology, theories of wireless communication, and embed technologies. In order to make full use of the power from monitoring and collection of WSN, and take advantages of the monitoring data, the WSN should be integrated with other theories and technologies. Among the related areas, distributed information broadcast system is one of those techniques which are closely connected with WSN. The monitoring data collected by WSN will be the basis of information broadcast system that manages, makes policy and controls the whole WSN and its data. This dissertation carries out the research work in the design of WSN-based information broadcast system and focuses on the related core theories and algorithms.
This dissertation discusses the following problems:data collection&restoration in WSN, data propagation, and data update&schedule in large-scale hierarchical information broadcast system.
Also, this dissertation proposes the event-triggered based subscription model, and then proposes a novel message oriented publish/subscribe broadcast system named EventX to cater to the features of sensor networks and its applications. According to type and time interval, EventX implements an algorithm to analyze and decompose compound subscription. After that, another weight information based greed algorithm is introduced for the low-energy state of nodes. Simulation results show that the EventX is suitable to reduce communication overhead and prolong the lifetime of sensor networks.
Considering the continuing advances in sensor networks and application design, it's important to improve information availability in a class of delay-tolerant sensor network applications according to the scarce resources and sensor energy. This dissertation points out the design objective and introduces the system architecture of RealStore—a framework for providing in-network storage service in sensor environments, and defines the information storing cooperation zone as well as its zone manager in RealStore. RealStore implements an algorithm to store and extract information based on network 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 the versatility of the proposed algorithms. The experimental results show that the proposed algorithms are stable under various update arrival rates as well as consumers' request rates.
Considering the challenges of scheduling items for broadcast by data servers in response to data consumers' multiple-item queries. This dissertation introduces the item selection approach, MLWF—a new data scheduling algorithm that adapts dynamic changes in the queue of pending queries. MLWF schedules a data item to meet the following conditions for broadcast:the item has a high frequency of occurrence among the pending queries, the total wait time of the queries in which the item occurs is large, and the broadcast of the item will cause a large number of queries to be completely satisfied. MLWF uses a normalized weight factor to give a higher priority to the broadcast of a data item that will cause the largest number of pending queries to be fully (or almost fully) answered. MLWF is compared with a generalization of LWF, Round Robin and FSO, All the experiment results show that MLWF performs better than LWF, FSO, and Round Robin in terms of consumers' average wait time.
In the last section, a summary has been given for all the proposed research contents. The innovative points are summarized. Also, the further work has been discussed.
本文探讨了无线传感器网络中的数据获取和保存问题、大规模信息广播系统中层次服务器间的数据传播与更新问题,以及数据广播调度问题。通过这些研究,给出了从生产者到消费者的实时数据获取、存储与传递算法,以尽量降低节点能量消耗、增加数据的可用率,并减少消费者的等待时间。
本文提出了一种使用内容发布／订阅的信息传播、处理架构EventX。在无线传感器网络层,从复杂事件订阅出发,提出了订阅分解与合成机制。将复杂的时间、类型等相关的复合主题事件分解为简单的监测、查询事件,并排除其中冗余的部分,以形成若干个彼此独立的子订阅,从而避免数据的重复采集与传输。同时,引入订阅以及子订阅权重机制及相关的调度算法,保证在资源有限的情况下优先处理重要的订阅,以提高系统应对多个订阅的服务质量。仿真结果表明,订阅分解与合成机制能够在保证数据采集效率的前提下,有效减轻网络负载,延长系统生存时间。
通过分析无线传感器网络的特性及其应用特点,针对节点存储能力有限,无法将网内大量数据信息存储在若干个存储节点上的情况,本文提出了一种新型的传感器网络数据网内存储框架REALSTORE,以便在节约节点能量和内存开销的前提下提高数据的可靠性。给出了REALSTORE的设计目标和体系结构,提出了数据存储协作域、管理节点等基本概念,给出了协作域的建立机制和管理节点的选取算法,然后提出了两种在协作域内进行数据存储与提取的算法与流程。通过仿真测试,证明其能够在较低的资源开销下提高信息的可靠性。
在接收监测数据的服务器层,本文提出了一种事件匹配算法SGEM,以订阅的统计分布为基础,根据订阅中的谓词对订阅进行分组,以便快捷、灵活并实时地响应消费者的查询请求。仿真实验证明,SGEM事件匹配算法能够有效地对事件进行处理,其性能优于其他现有算法,可降低匹配过程中的开销,能减小内容传递的延时,对系统性能的改善显著。
本文深入探讨了层次化的信息广播系统中通过数据广播在一级服务器内进行高速数据更新,以及在二级服务器上进行大量数据查询请求处理的问题。主要的目标是降低消费者收到超时数据的百分比,并减少数据请求的平均等待时间。针对以上需求提出了具有广播判定功能的RU、RU+ESI和PF数据更新广播算法。这三种算法将数据更新与数据广播调度进行结合,改善了主服务上数据高速更新与二级服务器上高频率数据请求所带来的冲突问题,从而达到降低数据超时,减少消费者的等待时间的目的。此外,在二级服务器上还实现了两种广播判定准则——LWF与RxW,使得这三种算法能够适应不同的应用环境。仿真结果说明,RU、RU+ESI和PF数据更新广播算法都优于简单的基准调度算法,在不同的更新速率和消费者请求频率下,这三种算法都处于稳定状态,能够正常工作。
针对多项查询的广播调度算法中的两种选择方法——查询选择方法和数据项选择方法,本文提出了一种采用数据项选择方法的新型的数据调度算法MLWF,以适应动态变化的查询列表。在MLWF中,引入了一种权重机制,根据数据项在未完成查询中出现的频率、所在查询的总体等待时间长度、广播该数据项能否使得尽可能多的查询进入完成状态等因素入手,综合考虑数据调度问题。MLWF算法能够选中使得大量查询状态变为完全应答的数据项,并进行广播。仿真实验将MLWF与LWF、Round Robin和FSO等传统调度算法进行了比较。结果显示,在消费者等待时间方面,MLWF的性能优于LWF、FSO和Round Robin算法。
论文最后对所研究的内容进行总结,总结了本文内容与创新点,并提出了后续研究工作的前进方向。
Wireless sensor network has becoming a hot research topic recently. It combines research areas like the microelectronic manufacture, sensing technology, theories of wireless communication, and embed technologies. In order to make full use of the power from monitoring and collection of WSN, and take advantages of the monitoring data, the WSN should be integrated with other theories and technologies. Among the related areas, distributed information broadcast system is one of those techniques which are closely connected with WSN. The monitoring data collected by WSN will be the basis of information broadcast system that manages, makes policy and controls the whole WSN and its data. This dissertation carries out the research work in the design of WSN-based information broadcast system and focuses on the related core theories and algorithms.
This dissertation discusses the following problems:data collection&restoration in WSN, data propagation, and data update&schedule in large-scale hierarchical information broadcast system.
Also, this dissertation proposes the event-triggered based subscription model, and then proposes a novel message oriented publish/subscribe broadcast system named EventX to cater to the features of sensor networks and its applications. According to type and time interval, EventX implements an algorithm to analyze and decompose compound subscription. After that, another weight information based greed algorithm is introduced for the low-energy state of nodes. Simulation results show that the EventX is suitable to reduce communication overhead and prolong the lifetime of sensor networks.
Considering the continuing advances in sensor networks and application design, it's important to improve information availability in a class of delay-tolerant sensor network applications according to the scarce resources and sensor energy. This dissertation points out the design objective and introduces the system architecture of RealStore—a framework for providing in-network storage service in sensor environments, and defines the information storing cooperation zone as well as its zone manager in RealStore. RealStore implements an algorithm to store and extract information based on network 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 the versatility of the proposed algorithms. The experimental results show that the proposed algorithms are stable under various update arrival rates as well as consumers' request rates.
Considering the challenges of scheduling items for broadcast by data servers in response to data consumers' multiple-item queries. This dissertation introduces the item selection approach, MLWF—a new data scheduling algorithm that adapts dynamic changes in the queue of pending queries. MLWF schedules a data item to meet the following conditions for broadcast:the item has a high frequency of occurrence among the pending queries, the total wait time of the queries in which the item occurs is large, and the broadcast of the item will cause a large number of queries to be completely satisfied. MLWF uses a normalized weight factor to give a higher priority to the broadcast of a data item that will cause the largest number of pending queries to be fully (or almost fully) answered. MLWF is compared with a generalization of LWF, Round Robin and FSO, All the experiment results show that MLWF performs better than LWF, FSO, and Round Robin in terms of consumers' average wait time.
In the last section, a summary has been given for all the proposed research contents. The innovative points are summarized. Also, the further work has been discussed.
引文
[1]Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E. Wireless sensor networks:a survey. Computer Networks,2002,38(4):393-422
[2]任丰原,林闯.无线传感器网络.软件学报,2003,14(7)：1282-1291
[3]Warneke B., Last M., Liebowitz B., et al. Smart dust:Communicating with a cubic-millimeter computer. IEEE Computer Magazine,2001,34(1):44-51
[4]21 Ideas for the 21st Century. Business Week,1999:78-167
[5]10 Emerging Technologies That will Change the World. MIT Technology Review, 2003,106(1):33-49
[6]孙利民,李建中,陈渝等.无线传感器网络.北京：清华大学出版社,2005
[7]Arici T., Altunbasak Y.. Adaptive sensing for environment monitoring using wireless sensor networks. In:Proc. of The IEEE Wireless Communications and Networking Conference (WCNC), Atlanta, GA,2004,4:2347-2352
[8]Mainwaring A., Culler D., Polastre J., et al. Wireless Sensor Networks for Habitat Monitoring. In:Proc. of ACM WSNA'02,2002:88-97
[9]邱天爽,唐洪,李婷等.无线传感器网络协议与体系结构.北京：电子工业出版社,2007
[10]Delin K. A., Jackson S. P. The sensor web:a new instrument concept. In:Proc. of the Int'l Society for Optical Engineering Symposium on Integrated Optics, San Jose, CA,2001:1-9
[11]Meyer S., Rakotonirainy A.. A survey of research on context-aware homes. In:Proc. of Workshop on Wearable, Invisible, Context-Aware, Ambient, Pervasive and Ubiquitous Computing, Adelaide, Australia,2003:159-168
[12]Brenna S. M., Mielke A. M., Torney D. C.. Radiation detection with distributed sensor networks. Computer,2004,37(8):57-59
[13]Loren Schwiebert, Sandeep K. S. Gupta, Jennifer Weinmann. Research challenges in wireless networks of biomedical sensors. In:Proc. of the 7 th annual international conference on Mobile computing and networking, Rome, Italy,2001:151-165
[14]Hedley M., Hoschk, N. Johnson M., et al. Sensor Network for Structural Health Monitoring. In:Proc. of 4th International Conference on Intelligent Sensors, Sensor Networks and Information Processing,2004:361-366
[15]于海斌,曾鹏梁.智能无线传感器网络系统.北京：科学出版社,2006
[16]Lim HB, Teo YM, Mukherjee P, et al. Sensor Grid:integration of wireless sensor networks and the grid. In:Proc. of the 30th IEEE conference on local computer networks,2005(1):91-99
[17]Rao I, Imran N, Huh E-N, et al. Adaptive and reconfigurable resource management for wireless sensors using grid technology. In:Proc. of 2nd IEEE international conference on communication systems, software and middleware (COMSWARE), India,2007(1):1-5
[18]H. Dykeman, M. Ammar, J. Wong. Scheduling algorithms for videotex systems under broadcast delivery. In:Proc. of the IEEE International Conference on Communications, volume 3,1986:1847-1851
[19]Edgar H.C. Wireless Sensor Networks:Architectures and Protocols. Boca Raton, Florida:CRC Press LLC,2004:1-40
[20]Asada G, Dong M., Lin TS, et al. Wireless integrated network sensors (WINS) for tactical information systems. In:Proc. of the 1998 European Solid State Circuits Conference. New York:ACM Press,1998:15-20
[21]Pottie G. J., Kaiser W. J.. Wireless Integrated Network Sensors. Communications of the ACM,2000,43(5):51-58
[22]DSN Team. Multilateration Poster, SensIT Workshop. St. Petersburg, FL, April 2001
[23]EYES Project. http://www.eyes.eu.org/
[24]深联科技.http://www. wsn.net. cn
[25]张伟,何斌,赵霞等.开放的无线传感器网络平台OpenWSN.计算机研究与发展,2008,45(1)：97-103
[26]F. Salim, S. Loke, A. Rakotonirainy, et al. U&I Aware:A framework using data mining and collision detection to increase awareness for intersection users. In:Proc. of the 21st International Conference on Advanced Information Networking and Applications Workshops,2007:530-535
[27]P. Juang, H. Oki, Y. Wang, et al. Energy efficient computing for wildlife tracking: Design tradeoff and early experiences with zebranet. In:Proc. of the 10th International Conference on Architectural support for Programming Languages and Operating Systems,2002:96-107
[28]Hunter, N. El-Sheimy, and G. Stenhouse. Up close and grizzly:GPS/camera collar captures bear doings. http://www.gpsworld.com/gpsworld/article/articleDetail.jsp? id=146689, February 2005
[29]G. Werner-Allen, J. Johnson, M. Ruiz, et al. Monitoring volcanic eruptions with a wireless sensor network. In:Proc. of the Second European Workshop on Wireless Sensor Networks, February 2005:108-120
[30]R. Szewczyk, E. Osterweil, J. Polastre, et al. Habitat monitoring with sensor networks. Communications of the ACM, June 2004,47(6):34-40
[31]Santi R. Topology control in wireless adhoc and sensor networks. ACM Computing Surveys,2005,37(2):164-194
[32]Narayanaswamy S, Kawadia V, Sreenivas RS, et al. Power control in ad-hoc neworks:Theory, architecture, algorithm and implementation of the COMPOW Protocol. In:Proc. of the European Wireless Conf. Florenee,2002,156-162
[33]Chen B, Jamieson K, Morris R, et al. SRAN:An energy efficient coordination algorithm for topology maintenanc in adhoc wireless networks. ACM Wireless Networks,2002,8(5):481-494
[34]S. Acharya, M. Franklin, S. Zdonik. Dissemination-based data delivery using broadcast disks. IEEE Personal Communications, December 1995,2(6):50-60
[35]M. Franklin, S. Zdonik. "Data in your face":Push technology in perspective. ACM SIGMOD Record, June 1998,27(2):516-519
[36]D. Aksoy and M. Franklin. RxW:A scheduling approach for large-scale on-demand data broadcast. IEEE/ACM Transactions on Networking, December 1999, 7(6):846-860
[37]Dalal, S. Jordan. Optimal scheduling in a queue with differentiated impatient users. Performance Evaluation, January 2005,59(1):73-84
[38]L. Gruenwald, M. Javed, M. Gu. Energy-efficient data broadcasting in mobile ad-hoc networks. In:Proc. of the International Database Engineering and Applications Symposium3, July 2002:64-7
[39]J. Hung, Seifert. An efficient data broadcasting scheduler for energy-constraint broadcast servers. Journal of Computer Systems Science and Engineering, May 2005,20(3):88-100
[40]J. Hwang, S. Cho, and C. Hwang. Optimized scheduling on broadcast disks. In:Proc. of the 2nd International Conference on Mobile Data Management, January 2001:91-104
[41]N. Prabhu and V. Kumar. Data scheduling for multi-item and transactional requests in on-demand broadcast. In:Proc. of the 6th International Conference on Mobile Data Management, May 2005:48-56
[42]J. Wong. Broadcast delivery. In:Proc. of IEEE, December 1988,76(12):1566-1577
[43]G. Wu. An efficient data placement for query-set-based broadcasting in mobile environments. Computer Communications, March 2007,30(5):1075-1081
[44]D. Aksoy and M. Leung. Pull vs push:A quantitative comparison for data broadcast. In:Proc. of IEEE GLOBECOM, December 2004(3):1464-1468
[45]B. Kalyanasundaram, K. Pruhs, and M. Velauthapillai. Scheduling broadcasts in wireless networks. In:Proc. of the 8th Annual European Symposium on Algorithms, September 2000:290-301
[46]M. Sharaf and P. Chrysanthis. On-demand broadcast:New challenges and scheduling algorithms. In:Proc. of the 1st Hellenic Conference on the Management of Data, July 2002:1-20
[47]C. Su and L. Tassiulas. Broadcast scheduling for information distribution. In:Proc. of IEEE INFOCOM, April 1997(1):109-117
[48]X. Wu and V. Lee. Preemptive maximum stretch optimization scheduling for wireless on-demand data broadcast. In:Proc. of the International Database Engineering and Applications Symposium, July 2004:413-418
[49]X. Wu, V. Lee, and J. Ng. A preemptive scheduling algorithm for wireless real-time on-demand data broadcast. In:Proc. of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, August 2005:17-22
[50]Y. Wu and G. Cao. Stretch-optimal scheduling for on-demand data broadcasts. In: Proc. of the 10th International Conference on Computer Communications and Networks, October 2001:500-504
[51]J. Fernandez and K. Ramamritham. Adaptive dissemination of data in time-critical asymmetric communication environments. Mobile Networks and Applications, October 2004,9(5):491-505
[52]J. Hu, K. Yeung, G. Feng, et al. A novel push-and-pull hybrid data broadcast scheme for wireless information networks. In:Proc. of IEEE International Conference on Communications, June 2000:1778-1782
[53]T. Imielinski and S. Viswanathan. Adaptive wireless information systems. In:Proc. of the Special Interest Group in DataBase Systems (SIGDBS) Conference, October 2004:1778-1782
[54]S. Acharya, M. Franklin, and S. Zdonik. Balancing push and pull for data broadcast. In:Proc. of the ACM SIGMOD Conference, May 2005:183-194
[55]K. Datta, A. Celik, J. Kim, et al. Adaptive broadcast protocols to support power conservant retrieval by mobile users. In:Proc. of the International Conference on Data Engineering, April 2007:124-133
[56]K. Stathatos, N. Roussopoulos, and J. Baras. Adaptive data broadcast in hybrid networks. In:Proc. of the 23rd International Conference on Very Large Data Bases, August 2007:326-335
[57]J. Fernandez and K. Ramamritham. Adaptive dissemination of data in time-critical asymmetric communication environments. Mobile Networks and Applications, October 2004,9(5):491-505
[58]D. Aksoy, M. Franklin, and S. Zdonik. Data staging for on-demand broadcast. In: Proc. of the 27th International Conference on Very Large Data Bases, September 2001:571-580
[59]H. Hu, J. Xu, and D. Lee. Adaptive power-aware prefetching schemes for mobile broadcast environments. In:Proc. of the 4th International Conference on Mobile Data Management, January 2003:374-380
[60]Y. Saygin O. Ulusoy. Exploiting data mining techniques for broadcasting data in mobile computing environments. Transactions on Knowledge and Data Engineering, November/December 2002,14(6):1387-1399
[61]Y. Bartal and S. Muthukrishnan. Minimizing maximum response time in scheduling broadcasts. In:Proc. of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, January 2000:558-559
[62]Y. Chung and M. Kim. Effective data placement for wireless broadcast. Distributed and Parallel Databases, March 2001,9(2):133-150
[63]Y. Chang and W. Hsieh. An efficient scheduling method for query-set-based broadcasting in mobile environments. In:Proc. of the 24th International Conference on Distributed Computing Systems Workshops, March 2004:478-483
[64]G. Lee and S. Lo. Broadcast data allocation for efficient access of multiple data items in mobile environments. Mobile Networks and Applications, August 2003, 8(4):365-375
[65]L. Breslau, P. Cao, L. Fan, G Phillips, and S. Shenker. Web caching and Zipf-like distributions:Evidence and implications. In:Proc. of IEEE INFOCOM Conference, March 2007:126-134
[66]D. Knuth. The Art of Computer Programming, volume 2:Seminumerical Algorithms, Addison-Wesley,3rd edition, November 1998:781-784
[67]Aekaterinidis and P. Triantafillou. Publish-Subscribe information delivery with substring predicates. IEEE Internet Computing, July 2007,11 (4):16-23
[68]P. Costa, G Picco, and S. Rossetto. Publish-Subscribe on sensor networks:A semi-probabilistic approach. In:Proc. of the 2nd IEEE International Conference on Mobile Ad-hoc and Sensor Systems, November 2005:323-332
[69]P. Eugster, P. Felber, R. Guerraoui, et al. The many faces of publish/subscribe. ACM Computing Surveys, June 2003,35(2):114-131
[70]H. Liu and H. Jacobsen. A-ToPSS:A publish/subscribe system supporting imperfect information processing. In:Proc. of the 30th International Conference on Very Large Data Bases, August 2004:1281-1284
[71]Microsoft Corporation. TIBCO rendezvous concepts. http://msdn.microsoft.com/ en-us/library/aa559569.aspx
[72]G Cugola, E. Nitto, and A. Fuggetta. The JEDI event-based infrastructure and its application to the development of the OPSS WFMS. IEEE Transactions on Software Engineering, September 2001,27(9):70-82
[73]L. Fiege, F. Gartner, O. Kasten, et al. Supporting mobility in content-based publish/subscribe middleware. In:Proc. of ACM/IFIP/USENIX International Middleware Conference, June 2003:103-134
[74]P. Eugster. Type-based publish/subscribe:Concepts and experiences. ACM Transactions on Programming Languages and Systems, January 2007,29(1):35-46
[75]Davey S, Dialani V, Fehling R, et al. Information dissemination in the grid environment base specifications. https://forge.gridforum.org/sf/docman/do/listDocu-ments/projects.infod-wg/docman.root.current_drafts
[76]Handy MJ, Haase M, Timmermann D. Low energy adaptive clustering hierarchy with deterministic cluster-head selection. In:Proc. of the 4th IEEE Conf. on Mobile and Wireless Communications Networks. New York, IEEE Press,2002:368-372
[77]Manjeshwar A, Agrawal DP. APTEEN:A hybrid protocol for efficient routing and comprehensive information retrieval in wireless sensor networks. In:Proc. of the 2nd Int'l Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing. Florida,IEEE Press,2002:195-202
[78]Laura M F, Martin N. Investigating t he energy consumption of a wireless network interface in an Ad Hoc networking environment. In:Proc. of IEEE INFOCOM 2001, Anchorage, Alaska, IEEE Press,2001:1548-1557
[79]米志超,周建江.一种能量均衡的无线传感网络生命期优化算法.系统工程与电子技术,2008,30(12)：2477-2480
[80]Xian Xiaodong, Shi Weiren, Huang He. Comparison of OMNET++ and other simulator for WSN simulation. In:Proc. of Industrial Electronics and Applications. Singapore, IEEE Press,2008:1439-1443
[81]崔莉,鞠海玲,苗勇,等.无线传感器网络研究进展.计算机研究与发展,2005,42(1)：163-174
[82]R.Sarkar, X.Zhu and J.Gao. Double rulings for information brokerage in sensor networks. In:Proc. of the12thAnnual International Conferene on Mobile Computing and Networking (MobiCom'06). Los Angeles, California, USA, September 2006:286-297
[83]郭龙江,李建中,李贵林.无线传感器网络环境下时-空查询处理方法.软件学报,2006,1 7(4)：794-805
[84]P. Bonnet, J.Gehrke, P. Seshadri. Querying the Physical world. IEEE Personal Communieations, Spcial Issue on Smart Spaces and Environments,2000,7(5):10-15
[85]D.Ganesan, B.Greenstein, D.Estrin, et al. Multiresolution storage and search in sensor networks. ACM Transaetions on Storage (TOS),2005,1(3):277-315
[86]J.Gehrke and S.Madden. Query Proeessing in sensor networks. Pervasive Computer. 2004,3(1):46-55
[87]S.Shenker, S.Ratnasamy, B.Karp, et al. Data-centric storage in sensornets. ACM SIGCOMM Computer Communications Review,2003,33(1):137-142
[88]D.Braginsky and D.Estrin. Rumor routing algorithm for sensor networks. In:Proc. of the 1st Workshop on Sensor Networks and Applications (WSNA), Atlanta, Georgia, USA, October 2002:22-31
[89]Q.Fang, J.Gao, L.J. Guibas. Landmark-based information storage and retrieval sensor networks. In:Proc. of the 25th Annual IEEE Conference on Computer Commuications (INFOCOM'06). Barcelona, Catalunya, SPAIN, April 2006:1-12
[90]B. Greenstein, D. Estrin, R.Govindan, et al. DIFS:a distributed index for features in sensor networks. In:Proc. of the 1st IEEE Intemational Workshop on Sensor Network Protocols and Applications (SNPA'03). Anchorage, Alaska, USA, May 2003:163-173
[91]D. Ganesan, B. Greenstein, D. Perelyubskiy, et al. An evaluation of multiresolution storage for sensor networks. In:Proc. of the 1st ACM Conference on Embedded Networked Sensor Systems (Sensys'03). Los Angeles, California, USA, November 2003:89-102
[92]T.M. Gil and S. Madden. Scoop:an adaptive indexing seheme for stored data in sensor networks. In:Proc. of the 23rd International Conference on Data Engineering (ICDE'07). Istanbul, Turkey, April 2007:89-102
[93]X. Liu,Q. Huang and Y. Zhang. Combs, needles, haystacks:balancing Push and Pull for Discovery in large scale sensor networks. In:Proc. of the 2nd ACM Conference on Embedded Networked Sensor Systems (Sensys'04). Baltimore, MD, USA, November 2004:122-133
[94]R. Sarkar, X. Zhu and J. Gao. Double rulings for information brokerage in sensor networks. In:Proc. of the 12th Annual International Conference on Mobile Computing and Networking (MobiCom'06). Los Angeles, California, USA, September 2006:286-297
[95]S. Ratnasamy, B. Karp, L. Yin, et al.Ght:A geographic hash table for data-centric storage. In:Proc. of the 1st ACM Intl workshop on Wireless Sensor Networks and Applications (WSNA'02). Atlanta, Georgia, USA, August 2002:56-67
[96]P. Juang, H. Oki, Y. Wang, et al, Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with ZebraNet. In:Proc. of ASPLOS-X, October 2002
[97]M.R. Garey, D. Johnson. Computers and intractability:a guide to the theory of NP-Competeness. Freeman, San Francisco, CA,1979
[98]V. P. A. Dimakis and K. Ramchandran. Decentralized erasure codes for distributed networked storage. IEEE Transactions on Information Theory,2006(9):22-36
[99]R. Ahlswede, N. Cai, S. Li, et al. Network information flow. IEEE Transactions on Information Theory, July 2000,46(4):1204-1216
[100]D. Aksoy and M. Franklin. Scheduling for large-scale on-demand data broadcasting. In:Proc. of IEEE INFOCOM Conference, pages 651-659, March 1998
[101]Edge Sides Includes. http://www.w3.org/TR/esi-lang
[102]J. Basch, L. Guibas, and J. Hershberger. Data structures for mobile data. In:Proc. of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, January 1997:747-756
[103]H. Kaplan, R. Tarjan, and K. Tsioutsiouliklis. Faster kinetic heaps and their use in broadcast scheduling. In:Proc. of ACM-SIAM Symposium on Discrete Algorithms, January 2001:836-844
[104]C. Su and L. Tassiulas. Broadcast scheduling for information distribution. In:Proc. of IEEE INFOCOM, April 1997(1):109-117
[105]World Wide Web Consortium (W3C). http://www.w3.org/TR/esi-lang
[106]M. Sharaf and P. Chrysanthis. Facilitating mobile decision making. In:Proc. of the ACM Workshop on Mobile Commerce, September 2002:45-53
[107]C. Brownell, S. Wolfe. Akamai achieves network deployment milestone. http://www.akamai.com/html/about/press/releases/2001/press101901 a.html
[108]P. Hearty. Carriage of digital video and other services by cable in North America. Proceedings of the IEEE, January 2006,94(1):148-157
[109]Digital Library Federation. Proposal for a digital preservation collaboration between the Yale University Library and Elsevier Science. http://www. diglib.org/preserve/yaleprop.htm, October 2000
[110]D. Knuth. The Art of Computer Programming, volume 3:Sorting and Searching. Addison-Wesley,2nd edition, May 1998
[111]V. Liberatore. Multicast scheduling for list requests. In:Proc. of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies, June 2002(2):1129-1137
[112]J. Yuen, E. Chan, and K. Lam. Adaptive data broadcast strategy for transactions with multiple data requests in mobile computing environments. In:Proc. of the 6th International Conference on Real-Time Computing Systems and Applications, December 1999:37-44
[113]S. Acharya, R. Alonso, M. Franklin, et al. Broadcast disks:Data management for asymmetric communication environments. In:Proc. of the ACM SIGMOD Conference, May 2001:199-210
[114]Y. Liu and J. Wong. Deadline-based scheduling in support of real-time data delivery. Computer Networks, February 2008,52(3):514-530
[115]G Lee, M. Yeh, S. Lo, et al. A strategy for efficient access of multiple data items in mobile environments.In:Proc. of the 3rd International Conference on Mobile Data Management, January 2002:71-78
[116]M. Ammar and J. Wong. The design of teletext broadcast cycles. Performormance Evaluation, December 2003,5(4):235-242
[117]J. Edmonds and K. Pruhs. A maiden analysis of Longest Wait First. ACM Transactions on Algorithms, July 2005, 1(1):14-32
[118]N. Vaidya and S. Hameed. Data broadcast in asymmetric wireless environments. In: Proc. of the International Workshop on Satellite-based Information Services, November 2003:1-15
[119]G. Zipf. Relative frequency as a determinant of phonetic change. Reprint from the Harvard Studies in Classical Philiology,1929(40):1-95
[2]任丰原,林闯.无线传感器网络.软件学报,2003,14(7)：1282-1291
[3]Warneke B., Last M., Liebowitz B., et al. Smart dust:Communicating with a cubic-millimeter computer. IEEE Computer Magazine,2001,34(1):44-51
[4]21 Ideas for the 21st Century. Business Week,1999:78-167
[5]10 Emerging Technologies That will Change the World. MIT Technology Review, 2003,106(1):33-49
[6]孙利民,李建中,陈渝等.无线传感器网络.北京：清华大学出版社,2005
[7]Arici T., Altunbasak Y.. Adaptive sensing for environment monitoring using wireless sensor networks. In:Proc. of The IEEE Wireless Communications and Networking Conference (WCNC), Atlanta, GA,2004,4:2347-2352
[8]Mainwaring A., Culler D., Polastre J., et al. Wireless Sensor Networks for Habitat Monitoring. In:Proc. of ACM WSNA'02,2002:88-97
[9]邱天爽,唐洪,李婷等.无线传感器网络协议与体系结构.北京：电子工业出版社,2007
[10]Delin K. A., Jackson S. P. The sensor web:a new instrument concept. In:Proc. of the Int'l Society for Optical Engineering Symposium on Integrated Optics, San Jose, CA,2001:1-9
[11]Meyer S., Rakotonirainy A.. A survey of research on context-aware homes. In:Proc. of Workshop on Wearable, Invisible, Context-Aware, Ambient, Pervasive and Ubiquitous Computing, Adelaide, Australia,2003:159-168
[12]Brenna S. M., Mielke A. M., Torney D. C.. Radiation detection with distributed sensor networks. Computer,2004,37(8):57-59
[13]Loren Schwiebert, Sandeep K. S. Gupta, Jennifer Weinmann. Research challenges in wireless networks of biomedical sensors. In:Proc. of the 7 th annual international conference on Mobile computing and networking, Rome, Italy,2001:151-165
[14]Hedley M., Hoschk, N. Johnson M., et al. Sensor Network for Structural Health Monitoring. In:Proc. of 4th International Conference on Intelligent Sensors, Sensor Networks and Information Processing,2004:361-366
[15]于海斌,曾鹏梁.智能无线传感器网络系统.北京：科学出版社,2006
[16]Lim HB, Teo YM, Mukherjee P, et al. Sensor Grid:integration of wireless sensor networks and the grid. In:Proc. of the 30th IEEE conference on local computer networks,2005(1):91-99
[17]Rao I, Imran N, Huh E-N, et al. Adaptive and reconfigurable resource management for wireless sensors using grid technology. In:Proc. of 2nd IEEE international conference on communication systems, software and middleware (COMSWARE), India,2007(1):1-5
[18]H. Dykeman, M. Ammar, J. Wong. Scheduling algorithms for videotex systems under broadcast delivery. In:Proc. of the IEEE International Conference on Communications, volume 3,1986:1847-1851
[19]Edgar H.C. Wireless Sensor Networks:Architectures and Protocols. Boca Raton, Florida:CRC Press LLC,2004:1-40
[20]Asada G, Dong M., Lin TS, et al. Wireless integrated network sensors (WINS) for tactical information systems. In:Proc. of the 1998 European Solid State Circuits Conference. New York:ACM Press,1998:15-20
[21]Pottie G. J., Kaiser W. J.. Wireless Integrated Network Sensors. Communications of the ACM,2000,43(5):51-58
[22]DSN Team. Multilateration Poster, SensIT Workshop. St. Petersburg, FL, April 2001
[23]EYES Project. http://www.eyes.eu.org/
[24]深联科技.http://www. wsn.net. cn
[25]张伟,何斌,赵霞等.开放的无线传感器网络平台OpenWSN.计算机研究与发展,2008,45(1)：97-103
[26]F. Salim, S. Loke, A. Rakotonirainy, et al. U&I Aware:A framework using data mining and collision detection to increase awareness for intersection users. In:Proc. of the 21st International Conference on Advanced Information Networking and Applications Workshops,2007:530-535
[27]P. Juang, H. Oki, Y. Wang, et al. Energy efficient computing for wildlife tracking: Design tradeoff and early experiences with zebranet. In:Proc. of the 10th International Conference on Architectural support for Programming Languages and Operating Systems,2002:96-107
[28]Hunter, N. El-Sheimy, and G. Stenhouse. Up close and grizzly:GPS/camera collar captures bear doings. http://www.gpsworld.com/gpsworld/article/articleDetail.jsp? id=146689, February 2005
[29]G. Werner-Allen, J. Johnson, M. Ruiz, et al. Monitoring volcanic eruptions with a wireless sensor network. In:Proc. of the Second European Workshop on Wireless Sensor Networks, February 2005:108-120
[30]R. Szewczyk, E. Osterweil, J. Polastre, et al. Habitat monitoring with sensor networks. Communications of the ACM, June 2004,47(6):34-40
[31]Santi R. Topology control in wireless adhoc and sensor networks. ACM Computing Surveys,2005,37(2):164-194
[32]Narayanaswamy S, Kawadia V, Sreenivas RS, et al. Power control in ad-hoc neworks:Theory, architecture, algorithm and implementation of the COMPOW Protocol. In:Proc. of the European Wireless Conf. Florenee,2002,156-162
[33]Chen B, Jamieson K, Morris R, et al. SRAN:An energy efficient coordination algorithm for topology maintenanc in adhoc wireless networks. ACM Wireless Networks,2002,8(5):481-494
[34]S. Acharya, M. Franklin, S. Zdonik. Dissemination-based data delivery using broadcast disks. IEEE Personal Communications, December 1995,2(6):50-60
[35]M. Franklin, S. Zdonik. "Data in your face":Push technology in perspective. ACM SIGMOD Record, June 1998,27(2):516-519
[36]D. Aksoy and M. Franklin. RxW:A scheduling approach for large-scale on-demand data broadcast. IEEE/ACM Transactions on Networking, December 1999, 7(6):846-860
[37]Dalal, S. Jordan. Optimal scheduling in a queue with differentiated impatient users. Performance Evaluation, January 2005,59(1):73-84
[38]L. Gruenwald, M. Javed, M. Gu. Energy-efficient data broadcasting in mobile ad-hoc networks. In:Proc. of the International Database Engineering and Applications Symposium3, July 2002:64-7
[39]J. Hung, Seifert. An efficient data broadcasting scheduler for energy-constraint broadcast servers. Journal of Computer Systems Science and Engineering, May 2005,20(3):88-100
[40]J. Hwang, S. Cho, and C. Hwang. Optimized scheduling on broadcast disks. In:Proc. of the 2nd International Conference on Mobile Data Management, January 2001:91-104
[41]N. Prabhu and V. Kumar. Data scheduling for multi-item and transactional requests in on-demand broadcast. In:Proc. of the 6th International Conference on Mobile Data Management, May 2005:48-56
[42]J. Wong. Broadcast delivery. In:Proc. of IEEE, December 1988,76(12):1566-1577
[43]G. Wu. An efficient data placement for query-set-based broadcasting in mobile environments. Computer Communications, March 2007,30(5):1075-1081
[44]D. Aksoy and M. Leung. Pull vs push:A quantitative comparison for data broadcast. In:Proc. of IEEE GLOBECOM, December 2004(3):1464-1468
[45]B. Kalyanasundaram, K. Pruhs, and M. Velauthapillai. Scheduling broadcasts in wireless networks. In:Proc. of the 8th Annual European Symposium on Algorithms, September 2000:290-301
[46]M. Sharaf and P. Chrysanthis. On-demand broadcast:New challenges and scheduling algorithms. In:Proc. of the 1st Hellenic Conference on the Management of Data, July 2002:1-20
[47]C. Su and L. Tassiulas. Broadcast scheduling for information distribution. In:Proc. of IEEE INFOCOM, April 1997(1):109-117
[48]X. Wu and V. Lee. Preemptive maximum stretch optimization scheduling for wireless on-demand data broadcast. In:Proc. of the International Database Engineering and Applications Symposium, July 2004:413-418
[49]X. Wu, V. Lee, and J. Ng. A preemptive scheduling algorithm for wireless real-time on-demand data broadcast. In:Proc. of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, August 2005:17-22
[50]Y. Wu and G. Cao. Stretch-optimal scheduling for on-demand data broadcasts. In: Proc. of the 10th International Conference on Computer Communications and Networks, October 2001:500-504
[51]J. Fernandez and K. Ramamritham. Adaptive dissemination of data in time-critical asymmetric communication environments. Mobile Networks and Applications, October 2004,9(5):491-505
[52]J. Hu, K. Yeung, G. Feng, et al. A novel push-and-pull hybrid data broadcast scheme for wireless information networks. In:Proc. of IEEE International Conference on Communications, June 2000:1778-1782
[53]T. Imielinski and S. Viswanathan. Adaptive wireless information systems. In:Proc. of the Special Interest Group in DataBase Systems (SIGDBS) Conference, October 2004:1778-1782
[54]S. Acharya, M. Franklin, and S. Zdonik. Balancing push and pull for data broadcast. In:Proc. of the ACM SIGMOD Conference, May 2005:183-194
[55]K. Datta, A. Celik, J. Kim, et al. Adaptive broadcast protocols to support power conservant retrieval by mobile users. In:Proc. of the International Conference on Data Engineering, April 2007:124-133
[56]K. Stathatos, N. Roussopoulos, and J. Baras. Adaptive data broadcast in hybrid networks. In:Proc. of the 23rd International Conference on Very Large Data Bases, August 2007:326-335
[57]J. Fernandez and K. Ramamritham. Adaptive dissemination of data in time-critical asymmetric communication environments. Mobile Networks and Applications, October 2004,9(5):491-505
[58]D. Aksoy, M. Franklin, and S. Zdonik. Data staging for on-demand broadcast. In: Proc. of the 27th International Conference on Very Large Data Bases, September 2001:571-580
[59]H. Hu, J. Xu, and D. Lee. Adaptive power-aware prefetching schemes for mobile broadcast environments. In:Proc. of the 4th International Conference on Mobile Data Management, January 2003:374-380
[60]Y. Saygin O. Ulusoy. Exploiting data mining techniques for broadcasting data in mobile computing environments. Transactions on Knowledge and Data Engineering, November/December 2002,14(6):1387-1399
[61]Y. Bartal and S. Muthukrishnan. Minimizing maximum response time in scheduling broadcasts. In:Proc. of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, January 2000:558-559
[62]Y. Chung and M. Kim. Effective data placement for wireless broadcast. Distributed and Parallel Databases, March 2001,9(2):133-150
[63]Y. Chang and W. Hsieh. An efficient scheduling method for query-set-based broadcasting in mobile environments. In:Proc. of the 24th International Conference on Distributed Computing Systems Workshops, March 2004:478-483
[64]G. Lee and S. Lo. Broadcast data allocation for efficient access of multiple data items in mobile environments. Mobile Networks and Applications, August 2003, 8(4):365-375
[65]L. Breslau, P. Cao, L. Fan, G Phillips, and S. Shenker. Web caching and Zipf-like distributions:Evidence and implications. In:Proc. of IEEE INFOCOM Conference, March 2007:126-134
[66]D. Knuth. The Art of Computer Programming, volume 2:Seminumerical Algorithms, Addison-Wesley,3rd edition, November 1998:781-784
[67]Aekaterinidis and P. Triantafillou. Publish-Subscribe information delivery with substring predicates. IEEE Internet Computing, July 2007,11 (4):16-23
[68]P. Costa, G Picco, and S. Rossetto. Publish-Subscribe on sensor networks:A semi-probabilistic approach. In:Proc. of the 2nd IEEE International Conference on Mobile Ad-hoc and Sensor Systems, November 2005:323-332
[69]P. Eugster, P. Felber, R. Guerraoui, et al. The many faces of publish/subscribe. ACM Computing Surveys, June 2003,35(2):114-131
[70]H. Liu and H. Jacobsen. A-ToPSS:A publish/subscribe system supporting imperfect information processing. In:Proc. of the 30th International Conference on Very Large Data Bases, August 2004:1281-1284
[71]Microsoft Corporation. TIBCO rendezvous concepts. http://msdn.microsoft.com/ en-us/library/aa559569.aspx
[72]G Cugola, E. Nitto, and A. Fuggetta. The JEDI event-based infrastructure and its application to the development of the OPSS WFMS. IEEE Transactions on Software Engineering, September 2001,27(9):70-82
[73]L. Fiege, F. Gartner, O. Kasten, et al. Supporting mobility in content-based publish/subscribe middleware. In:Proc. of ACM/IFIP/USENIX International Middleware Conference, June 2003:103-134
[74]P. Eugster. Type-based publish/subscribe:Concepts and experiences. ACM Transactions on Programming Languages and Systems, January 2007,29(1):35-46
[75]Davey S, Dialani V, Fehling R, et al. Information dissemination in the grid environment base specifications. https://forge.gridforum.org/sf/docman/do/listDocu-ments/projects.infod-wg/docman.root.current_drafts
[76]Handy MJ, Haase M, Timmermann D. Low energy adaptive clustering hierarchy with deterministic cluster-head selection. In:Proc. of the 4th IEEE Conf. on Mobile and Wireless Communications Networks. New York, IEEE Press,2002:368-372
[77]Manjeshwar A, Agrawal DP. APTEEN:A hybrid protocol for efficient routing and comprehensive information retrieval in wireless sensor networks. In:Proc. of the 2nd Int'l Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing. Florida,IEEE Press,2002:195-202
[78]Laura M F, Martin N. Investigating t he energy consumption of a wireless network interface in an Ad Hoc networking environment. In:Proc. of IEEE INFOCOM 2001, Anchorage, Alaska, IEEE Press,2001:1548-1557
[79]米志超,周建江.一种能量均衡的无线传感网络生命期优化算法.系统工程与电子技术,2008,30(12)：2477-2480
[80]Xian Xiaodong, Shi Weiren, Huang He. Comparison of OMNET++ and other simulator for WSN simulation. In:Proc. of Industrial Electronics and Applications. Singapore, IEEE Press,2008:1439-1443
[81]崔莉,鞠海玲,苗勇,等.无线传感器网络研究进展.计算机研究与发展,2005,42(1)：163-174
[82]R.Sarkar, X.Zhu and J.Gao. Double rulings for information brokerage in sensor networks. In:Proc. of the12thAnnual International Conferene on Mobile Computing and Networking (MobiCom'06). Los Angeles, California, USA, September 2006:286-297
[83]郭龙江,李建中,李贵林.无线传感器网络环境下时-空查询处理方法.软件学报,2006,1 7(4)：794-805
[84]P. Bonnet, J.Gehrke, P. Seshadri. Querying the Physical world. IEEE Personal Communieations, Spcial Issue on Smart Spaces and Environments,2000,7(5):10-15
[85]D.Ganesan, B.Greenstein, D.Estrin, et al. Multiresolution storage and search in sensor networks. ACM Transaetions on Storage (TOS),2005,1(3):277-315
[86]J.Gehrke and S.Madden. Query Proeessing in sensor networks. Pervasive Computer. 2004,3(1):46-55
[87]S.Shenker, S.Ratnasamy, B.Karp, et al. Data-centric storage in sensornets. ACM SIGCOMM Computer Communications Review,2003,33(1):137-142
[88]D.Braginsky and D.Estrin. Rumor routing algorithm for sensor networks. In:Proc. of the 1st Workshop on Sensor Networks and Applications (WSNA), Atlanta, Georgia, USA, October 2002:22-31
[89]Q.Fang, J.Gao, L.J. Guibas. Landmark-based information storage and retrieval sensor networks. In:Proc. of the 25th Annual IEEE Conference on Computer Commuications (INFOCOM'06). Barcelona, Catalunya, SPAIN, April 2006:1-12
[90]B. Greenstein, D. Estrin, R.Govindan, et al. DIFS:a distributed index for features in sensor networks. In:Proc. of the 1st IEEE Intemational Workshop on Sensor Network Protocols and Applications (SNPA'03). Anchorage, Alaska, USA, May 2003:163-173
[91]D. Ganesan, B. Greenstein, D. Perelyubskiy, et al. An evaluation of multiresolution storage for sensor networks. In:Proc. of the 1st ACM Conference on Embedded Networked Sensor Systems (Sensys'03). Los Angeles, California, USA, November 2003:89-102
[92]T.M. Gil and S. Madden. Scoop:an adaptive indexing seheme for stored data in sensor networks. In:Proc. of the 23rd International Conference on Data Engineering (ICDE'07). Istanbul, Turkey, April 2007:89-102
[93]X. Liu,Q. Huang and Y. Zhang. Combs, needles, haystacks:balancing Push and Pull for Discovery in large scale sensor networks. In:Proc. of the 2nd ACM Conference on Embedded Networked Sensor Systems (Sensys'04). Baltimore, MD, USA, November 2004:122-133
[94]R. Sarkar, X. Zhu and J. Gao. Double rulings for information brokerage in sensor networks. In:Proc. of the 12th Annual International Conference on Mobile Computing and Networking (MobiCom'06). Los Angeles, California, USA, September 2006:286-297
[95]S. Ratnasamy, B. Karp, L. Yin, et al.Ght:A geographic hash table for data-centric storage. In:Proc. of the 1st ACM Intl workshop on Wireless Sensor Networks and Applications (WSNA'02). Atlanta, Georgia, USA, August 2002:56-67
[96]P. Juang, H. Oki, Y. Wang, et al, Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with ZebraNet. In:Proc. of ASPLOS-X, October 2002
[97]M.R. Garey, D. Johnson. Computers and intractability:a guide to the theory of NP-Competeness. Freeman, San Francisco, CA,1979
[98]V. P. A. Dimakis and K. Ramchandran. Decentralized erasure codes for distributed networked storage. IEEE Transactions on Information Theory,2006(9):22-36
[99]R. Ahlswede, N. Cai, S. Li, et al. Network information flow. IEEE Transactions on Information Theory, July 2000,46(4):1204-1216
[100]D. Aksoy and M. Franklin. Scheduling for large-scale on-demand data broadcasting. In:Proc. of IEEE INFOCOM Conference, pages 651-659, March 1998
[101]Edge Sides Includes. http://www.w3.org/TR/esi-lang
[102]J. Basch, L. Guibas, and J. Hershberger. Data structures for mobile data. In:Proc. of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, January 1997:747-756
[103]H. Kaplan, R. Tarjan, and K. Tsioutsiouliklis. Faster kinetic heaps and their use in broadcast scheduling. In:Proc. of ACM-SIAM Symposium on Discrete Algorithms, January 2001:836-844
[104]C. Su and L. Tassiulas. Broadcast scheduling for information distribution. In:Proc. of IEEE INFOCOM, April 1997(1):109-117
[105]World Wide Web Consortium (W3C). http://www.w3.org/TR/esi-lang
[106]M. Sharaf and P. Chrysanthis. Facilitating mobile decision making. In:Proc. of the ACM Workshop on Mobile Commerce, September 2002:45-53
[107]C. Brownell, S. Wolfe. Akamai achieves network deployment milestone. http://www.akamai.com/html/about/press/releases/2001/press101901 a.html
[108]P. Hearty. Carriage of digital video and other services by cable in North America. Proceedings of the IEEE, January 2006,94(1):148-157
[109]Digital Library Federation. Proposal for a digital preservation collaboration between the Yale University Library and Elsevier Science. http://www. diglib.org/preserve/yaleprop.htm, October 2000
[110]D. Knuth. The Art of Computer Programming, volume 3:Sorting and Searching. Addison-Wesley,2nd edition, May 1998
[111]V. Liberatore. Multicast scheduling for list requests. In:Proc. of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies, June 2002(2):1129-1137
[112]J. Yuen, E. Chan, and K. Lam. Adaptive data broadcast strategy for transactions with multiple data requests in mobile computing environments. In:Proc. of the 6th International Conference on Real-Time Computing Systems and Applications, December 1999:37-44
[113]S. Acharya, R. Alonso, M. Franklin, et al. Broadcast disks:Data management for asymmetric communication environments. In:Proc. of the ACM SIGMOD Conference, May 2001:199-210
[114]Y. Liu and J. Wong. Deadline-based scheduling in support of real-time data delivery. Computer Networks, February 2008,52(3):514-530
[115]G Lee, M. Yeh, S. Lo, et al. A strategy for efficient access of multiple data items in mobile environments.In:Proc. of the 3rd International Conference on Mobile Data Management, January 2002:71-78
[116]M. Ammar and J. Wong. The design of teletext broadcast cycles. Performormance Evaluation, December 2003,5(4):235-242
[117]J. Edmonds and K. Pruhs. A maiden analysis of Longest Wait First. ACM Transactions on Algorithms, July 2005, 1(1):14-32
[118]N. Vaidya and S. Hameed. Data broadcast in asymmetric wireless environments. In: Proc. of the International Workshop on Satellite-based Information Services, November 2003:1-15
[119]G. Zipf. Relative frequency as a determinant of phonetic change. Reprint from the Harvard Studies in Classical Philiology,1929(40):1-95