无线传感器监测网络环境不确定性数据处理研究
|
摘要
集成了传感器技术、微机电系统技术、无线通信技术和分布式信息处理技术的无线传感器网络是一种全新的计算模式,是继因特网之后将对21世纪人类生活方式产生重大影响的IT热点技术。因特网改变了人与人之间交流、沟通的方式,而无线传感器网络将逻辑上的信息世界与物理世界融合在一起,将改变人与自然交互的方式。无线传感器网络是高度应用相关的,无线传感器网络的应用大多具有监测性质,因此对无线传感器监测网络的研究具有重要意义。在无线传感器监测网络应用中,测量误差、网络传输错误等因素的客观存在,数据采集和传输受到资源的限制而只能以离散的方式进行与外界物理量(如温度和压力值)的连续变化之间的矛盾不可避免,因此通过无线传感器监测网络获得的数据本质上是不确定性数据。不确定性数据对数据库领域传统的数据处理方法提出了新的挑战。
无线传感器监测网络节点的主要特点是电能、带宽、计算和存储能力等高度受限,尤其是其电源的不可替换性导致在保证对监测目标完全监测的同时延长系统工作寿命成为无线传感器监测网络应用的一个中心问题。针对该问题,提出无线传感器监测网络的扩展工作寿命的定义,并在此基础上提出一种延长无线传感器监测网络工作寿命的分布式节点调度策略,在各节点簇内对节点进行调度以实现有差别监测服务并延长系统的工作寿命。
不确定性数据查询与更新是不确定性数据处理技术的基础。概率性查询基于不确定性数据的概率不确定性数据模型,根据数据的不确定性区间及其概率分布(不确定性概率分布函数)为查询结果提供置信度信息。在深入分析各类不确定性数据的概率性查询及其计算方法的基础上,对概率性最近邻居查询ENNQ的计算方法进行改进。基于信息熵的概念,提出概率性范围查询ERQ查询质量度量方法,并在此基础上提出一种基于信息熵的不确定性数据更新策略,目的是以较小的能耗代价实现查询质量的提高。
在无线传感器监测网络环境下,可能存在大量用户需要访问传感数据,因此数据的有效分发是不确定性数据处理的另一个核心问题。在移动计算环境中,数据广播是一种有效的数据访问方式。在深入分析不确定性数据特点的基础上提出数据平均不确定率的概念,并创造性地将Push-based在线广播方法应用于不确定性数据的分发,提出一种不确定性数据在线广播调度策略,在进行数据广播调度时综合考虑数据的访问率和不确定性,并考虑网络传输错误和多信道对数据广播的影响。
无线传感器监测网络应用中往往伴随着海量的数据,研究从这些海量数据中挖掘出有用的知识意义重大。无线传感器监测网络环境中数据的不确定性会对数据挖掘结果的正确性产生显著影响,对传统数据挖掘方法提出了严峻的挑战。在对当前不确定性数据聚类的主要研究成果的深入分析并结合不确定性数据的特点的基础上提出基于密度的不确定性数据概率聚类算法,根据数据不确定性区间的概率分布信息提高算法的准确性并通过R树索引和概率阈值索引PTI提高算法的效率。
Wireless Sensor Network (WSN), which integrates the technologies of sensor, micro-electro-mechanism system (MEMS), wireless communication and distributed computing, is a novel mode of computing and a hotspot of information technology after Internet. It will have a profound influence on many areas in 21st century. Internet changes the way people communicate and exchange, while WSN connects the physical world to the logical information world, and will bring on the revolution of the interacting way between human and nature. WSN is application specific. Most of the applications of WSN have the character of surveillance, so the research of Wireless Sensor Surveillance Network (WSSN) is very significant. Measure errors and network transmission errors cannot be avoided entirety in the applications of WSSN. Furthermore, extreme limited system resources like network bandwidth and battery power in WSSN can only afford sampling data in a discrete manner, while the values of the entities being monitored (e.g. temperature, pressure) is changing constantly. The intrinsic inconsistency or uncertainty of data related in WSSN makes such data uncertain data in nature. Uncertain data offer a new challenge for traditional data processing methods.
In WSSN composed of a large number of low-power, short-lived, unreliable sensors, one of the most important design challenges is to obtain long system lifetime, as well as maintain sufficient surveillance to targets. The definition of the general lifetime of system is proposed and a round-based decentralized nodes scheduling scheme is presented, which schedule nodes in each cluster independently, therefore extend the general lifetime of system in differentiated surveillance. Fault-tolerance can be achieved with our scheme by taking nodes status and residual energy into account.
The query and update of uncertain data are the foundations of the processing technology of uncertain data. Probabilistic query on uncertain data, which is based on the probabilistic uncertainty model, places confidence to query answers based on the uncertainty intervals and their probability distributions (uncertainty pdfs). By analysing the classification of probabilistic queries and related evaluation methods, an improved evaluation method for Entity-based Nearest Neighbor Query (ENNQ) is proposed. Metrics used to measure the qualities of the results returned by Entity-based Range Queries (ERQ) are proposed based on the notion of information entropy. An entropy-based updating scheme for uncertain data is presented, so as to improve the qualities of queries by the minimum energy overhead.
There may be a large amount of clients who need to access sensing data on WSSN environment. Dissemination of uncertain data is another important issue in the processing of uncertain data. Data broadcasting is an effective means for data dissemination method on mobile computing environment. Definition of the mean uncertainty ratio of data is presented and a broadcasting scheme is proposed for uncertain data dissemination, based on the push-based online data broadcast. The demand probability and the uncertainty of data are considered in the process of broadcast scheduling. The effect of transmission errors and multiple broadcast channels are also taken into account in the scheme.
The applications of WSSN usually involve a large amount of data. It is significant for the research on data mining on such large volume data. The uncertainty of data on WSSN environment affects the correctness of data mining remarkably, which offers new challenges for traditional data mining methods. The issue of clustering of uncertain data is focused on and a probabilistic density-based clustering algorithm for uncertain data is proposed based on the probability distribution of uncertainty. Effectiveness is improved by taking the probability distribution information in the uncertainty intervals of data into consideration, efficiency is achieved with R-tree and Probability Threshold Index (PTI).
无线传感器监测网络节点的主要特点是电能、带宽、计算和存储能力等高度受限,尤其是其电源的不可替换性导致在保证对监测目标完全监测的同时延长系统工作寿命成为无线传感器监测网络应用的一个中心问题。针对该问题,提出无线传感器监测网络的扩展工作寿命的定义,并在此基础上提出一种延长无线传感器监测网络工作寿命的分布式节点调度策略,在各节点簇内对节点进行调度以实现有差别监测服务并延长系统的工作寿命。
不确定性数据查询与更新是不确定性数据处理技术的基础。概率性查询基于不确定性数据的概率不确定性数据模型,根据数据的不确定性区间及其概率分布(不确定性概率分布函数)为查询结果提供置信度信息。在深入分析各类不确定性数据的概率性查询及其计算方法的基础上,对概率性最近邻居查询ENNQ的计算方法进行改进。基于信息熵的概念,提出概率性范围查询ERQ查询质量度量方法,并在此基础上提出一种基于信息熵的不确定性数据更新策略,目的是以较小的能耗代价实现查询质量的提高。
在无线传感器监测网络环境下,可能存在大量用户需要访问传感数据,因此数据的有效分发是不确定性数据处理的另一个核心问题。在移动计算环境中,数据广播是一种有效的数据访问方式。在深入分析不确定性数据特点的基础上提出数据平均不确定率的概念,并创造性地将Push-based在线广播方法应用于不确定性数据的分发,提出一种不确定性数据在线广播调度策略,在进行数据广播调度时综合考虑数据的访问率和不确定性,并考虑网络传输错误和多信道对数据广播的影响。
无线传感器监测网络应用中往往伴随着海量的数据,研究从这些海量数据中挖掘出有用的知识意义重大。无线传感器监测网络环境中数据的不确定性会对数据挖掘结果的正确性产生显著影响,对传统数据挖掘方法提出了严峻的挑战。在对当前不确定性数据聚类的主要研究成果的深入分析并结合不确定性数据的特点的基础上提出基于密度的不确定性数据概率聚类算法,根据数据不确定性区间的概率分布信息提高算法的准确性并通过R树索引和概率阈值索引PTI提高算法的效率。
Wireless Sensor Network (WSN), which integrates the technologies of sensor, micro-electro-mechanism system (MEMS), wireless communication and distributed computing, is a novel mode of computing and a hotspot of information technology after Internet. It will have a profound influence on many areas in 21st century. Internet changes the way people communicate and exchange, while WSN connects the physical world to the logical information world, and will bring on the revolution of the interacting way between human and nature. WSN is application specific. Most of the applications of WSN have the character of surveillance, so the research of Wireless Sensor Surveillance Network (WSSN) is very significant. Measure errors and network transmission errors cannot be avoided entirety in the applications of WSSN. Furthermore, extreme limited system resources like network bandwidth and battery power in WSSN can only afford sampling data in a discrete manner, while the values of the entities being monitored (e.g. temperature, pressure) is changing constantly. The intrinsic inconsistency or uncertainty of data related in WSSN makes such data uncertain data in nature. Uncertain data offer a new challenge for traditional data processing methods.
In WSSN composed of a large number of low-power, short-lived, unreliable sensors, one of the most important design challenges is to obtain long system lifetime, as well as maintain sufficient surveillance to targets. The definition of the general lifetime of system is proposed and a round-based decentralized nodes scheduling scheme is presented, which schedule nodes in each cluster independently, therefore extend the general lifetime of system in differentiated surveillance. Fault-tolerance can be achieved with our scheme by taking nodes status and residual energy into account.
The query and update of uncertain data are the foundations of the processing technology of uncertain data. Probabilistic query on uncertain data, which is based on the probabilistic uncertainty model, places confidence to query answers based on the uncertainty intervals and their probability distributions (uncertainty pdfs). By analysing the classification of probabilistic queries and related evaluation methods, an improved evaluation method for Entity-based Nearest Neighbor Query (ENNQ) is proposed. Metrics used to measure the qualities of the results returned by Entity-based Range Queries (ERQ) are proposed based on the notion of information entropy. An entropy-based updating scheme for uncertain data is presented, so as to improve the qualities of queries by the minimum energy overhead.
There may be a large amount of clients who need to access sensing data on WSSN environment. Dissemination of uncertain data is another important issue in the processing of uncertain data. Data broadcasting is an effective means for data dissemination method on mobile computing environment. Definition of the mean uncertainty ratio of data is presented and a broadcasting scheme is proposed for uncertain data dissemination, based on the push-based online data broadcast. The demand probability and the uncertainty of data are considered in the process of broadcast scheduling. The effect of transmission errors and multiple broadcast channels are also taken into account in the scheme.
The applications of WSSN usually involve a large amount of data. It is significant for the research on data mining on such large volume data. The uncertainty of data on WSSN environment affects the correctness of data mining remarkably, which offers new challenges for traditional data mining methods. The issue of clustering of uncertain data is focused on and a probabilistic density-based clustering algorithm for uncertain data is proposed based on the probability distribution of uncertainty. Effectiveness is improved by taking the probability distribution information in the uncertainty intervals of data into consideration, efficiency is achieved with R-tree and Probability Threshold Index (PTI).
引文
[1]曾光宇,张志伟,张存林.光电检测技术.北京:清华大学出版社,2005.3-5
[2]Akyildiz I F,Su W,Sankarasubramaniam Y,et al.Wireless Sensor Networks:A Survey.Computer Networks,2002,38(4):393-422
[3]崔莉,鞠海玲,苗勇等.无线传感器网络研究进展.计算机研究与发展,2005,42(1):163-174
[4]任丰原,黄海宁,林闯.无线传感器网络.软件学报,2003,14(07):1282-1291
[5]李建中,李金宝,石胜飞.传感器网络及其数据管理的概念、问题与进展.软件学报,2003,14(10):1716-1727
[6]Mark Weiser.The computer of the 21st century.Scientific American,1991,265(3):94-104
[7]徐光佑,史元春,谢伟凯.普适计算.计算机学报,2003,26(9):1042-1052
[8]Mark Weiser.Some Computer Science Issues in Ubiquitous Computing.Communications of the ACM,1993,36(7):75-84
[9]Peter C.,Neil G.21 Ideas for the 21st Century.Business Week,1999,30(8):78-167
[10]Terry J.10 Emerging Technologies that Will Change the World.MIT Enterprise Technology Review,2003,106(1):33-49
[11]Robert D.The Future of Technology.Business Week,2003,25(8):1-50
[12]Pottie G,Kaiser W.Wireless Integrated Network Sensors.Communications of ACM,2000,43(5):51-58
[13]Wameke B,Last M,Liebowitz B,et al.Smart dust:Communicating with a cubic-millimeter computer.IEEE Computer Magazine,2001,34(1):44-51
[14]MIT uAMPS project,u-Adaptive Multi-domain Power Aware Sensors.http://www.mtl.mit.edu/researchgroups/icsystems/uamps/
[15]Information Processing Technology Office.Sensor Information Technology.http://www.sainc.com/sensit/
[16]Akyildiz I F,Pompili D,Melodia T.Challenges for Efficient Communication in Underwater Acoustic Sensor Networks.ACM Special Interest Group on Embedded Systems Review,2004,1(2):3-8
[17]吴微威,王卫东,卫国.基于超宽带技术的无线传感器网络.中兴通讯技术,2005,11(4):28-31
[18]Sensor Network Consortium.http://www.bu.edu/systems/industry/consortium/index.html
[19]于海斌,曾鹏,梁斡.智能无线传感器网络系统.北京:科学出版社,2006.13-17
[20]孙利民,李建中,陈渝等.无线传感器网络.北京:清华大学出版社,2005
[21]O.Benjelloun,A.Salma,A.Halevy,et al.ULDBs:Databases with uncertainty and lineage.In:Proceedings of the 32nd international conference on Very large data bases.Seoul:VLDB Endowment,2006.953-964
[22]N.Dalvi,D.Suciu.Efficient query evaluation on probabilistic databases."In:Proceedings of the 30th international conference on Very large data bases.Toronto:VLDB Endowment,2004.864-875
[23]N.Fuhr.A probabilistic framework for vague queries and imprecise informationin databases.In:Proceedings of the 16th International Conference on Very Large Data Bases.San Francisco:Morgan Kaufmann,1990.696-707
[24]L.Lakshmanan,N.Leone,R.Ross,et al.Probview:A flexible probabilistic database system.ACM Transacrions on Database Sysrems,1997,22(3):419-469
[25]R.Cheng.D.V.Kalashnikov,S.Prabhakar.Evaluating probabilistic queries over imprecise data.In:Proceedings of the 2003 ACM SIGMOD international conference on Management of data.San Diego:ACM Press,2003.551-562
[26]S.V.Vrbsky,J.W.S.Liu.Producing approximate answers to set- and single-valued queries.The Journal of Systems and Software,1994,27(3):243-251
[27]V.Poosala,V.Ganti.Fast approximate query answering using precomputed statistics.In:Proceedings of the 15th International Conference on Data Engineering.Sydney:IEEE Computer Society,1999.252
[28]P.Gibbons,Y.Matias.New sampling-based summary statistics for improving approximate query answers.In:Proceedings of the 1998 ACM SIGMOD international conference on Management of data.Seattle:ACM Press,1998.331-342
[29]S.Acharya,P.Gibbons,V.Poosala,et al.Join synopses for approximate query answering. In: Proceedings of the 1999 ACM SIGMOD international conference on Management of data. Philadelphia: ACM Press, 1999. 275-286
[30] C. Olston, J. Widom. Offering a precision-performance tradeoff for aggregation queries over replicated data. In: Proceedings of the 26th international conference on Very large data bases. San Francisco: Morgan Kaufmann, 2000. 144-155
[31] C. Olston, Boon Thau Loo, J. Widom. Adaptive precision setting for cached approximate values. In: Proceedings of the 2001 ACM SIGMOD international conference on Management of data. Santa Barbara: ACM Press, 2001. 355-366
[32] C. Olston, J. Widom. Best-effort cache synchronization with source cooperation. In:Proceedings of the 2002 ACM SIGMOD international conference on Management of data. Santa Barbara: ACM Press, 2002. 73-84
[33] P. A. Sistla, O. Wolfson, S. Chamberlain, et al. Querying the uncertain position of moving objects. Temporal Databases: Research and Practice, 1998, LNCS 1399/1998:310-337
[34] Goce Trajcevski, Ouri Wolfson, Fengli Zhang, et al. The geometry of uncertainty in moving object databases. In: Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology. London:Springer-Verlag, 2002. 233-250
[35] O. Wolfson, P. Sistla, S. Chamberlain, et al. Updating and querying databases that track mobile units. Distributed and Parallel Databases, 1999, 7(3): 257-387
[36] D. Pfoser, C. Jensen. Capturing the uncertainty of moving-objects representations. In: Proceedings of International Conference on Scientific and Statistical Database Management (SSDBM), 1999. 123-132
[37] H. Gunadhi, A. Segev. Query processing algorithms for temporal intersection joins. In:Proceedings of the 7th International Conference on Data Engineering. Washington:IEEE Computer Society, 1991. 336-344
[38] D. Pfoser, C. Jensen. Incremental join of time-oriented data. In: Proceedings of the 11th International Conference on Scientific on Scientific and Statistical Database Management. Washington: IEEE Computer Society, 1999. 232-243
[39] M. Soo, R. Snodgrass, C. Jensen. Efficient evaluation of the valid-time natural join. In:Proceedings of the 10th International Conference on Data Engineering. Washington:IEEE Computer Society, 1994. 282-292
[40] D. Zhang, V. Tsotras, B. Seeger. Efficient temporal join processing using indices. In:Proceedings of the 18th International Conference on Data Engineering. Washington:IEEE Computer Society, 2002. 103-113
[41] M. Chau, Reynold Cheng, B. Kao, et al. Uncertain Data Mining: An Example in Clustering Location Data. In: Proceedings of the 10th Pacific-Asia Conference on Knowledge Discovery and Data Mining. Singapore:Springer, 2006. 199-204
[42] H.-P. Kriegel, M. Pfeifle. Density-based clustering of uncertain data. In: Proceedings of the 11th ACM SIGKDD international conference on Knowledge discovery in data mining. Chicago: ACM Press, 2005. 672-677
[43] J. Widom. Trio: A system for integrated management of data, accuracy, and lineage. In:Proceedings of the 2nd Biennial Conference on Innovative Data Systems Research.Pacific Grove: ACM Press, 2005. 262-276
[44] P. Agrawal, O. Benjelloun, A. Das Sarma, et al. Trio: A System for Data, Uncertainty,and Lineage. In: Proceedings of the 32nd international conference on Very large data bases. Seoul: VLDB Endowment, 2006. 1151-1154
[45] Reynold Cheng, Sarvjeet Singh, Sunil Prabhakar. U-DBMS: A Database System for Managing Constantly-Evolving Data. In: Proceedings of the 31st international conference on Very large data bases. Trondheim: VLDB Endowment, 2005.1271-1274
[46] 沈理.普适计算.计算机工程与科学. 2005,27(7):77-82
[47] Ng J W P. Ubiquitous healthcare localisation schemes. Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331,2005, 21(3):156-161
[48] Akyildiz LF, Su WL, Sankarasubramaniam Y, et al. A survey on sensor networks.IEEE Communications Magazine, 2002, 40(8): 102-114
[49] D.Estrin, L.Girod, G Pottie, et al. Instrument the world with wireless sensor networks.In: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing. Salt Lake City, 2001. 2033-2036
[50] Zhao F., Guibas L. Wireless Sensor Networks: An Information Processing Approach.Boston:Elsevier-Morgan Kaufmann, 2004
[51] Warneke B, Last M, Liebowitz B, et al. Smart dust: Communicating with a cubic-millimeter computer. IEEE Computer Magazine, 2001, 34(1):44-51
[52] G.Werner-Allen, J. Johnson, M. Ruiz, et al. Monitoring Volcanic Eruptions with a Wireless Sensor NetWork. In: Proceedings of the Second European Workshop on Wireless Sensor Networks. Istanbul, Turkey, 2005. 108-120
[53] Philo Juang, Hidekazu Oki, Yong Wang. Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet. ACM SIGPLAN Notices, 37(10):96-107
[54] Alan Mainwaring, Joseph Polastre, Robert Szewczyk, et al. Wireless sensor networks for habitat monitoring. In: Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications. Atlanta: ACM Press, 2002. 88-97
[55] Noury N, Herve T, Rialle V, et al. Monitoring behavior in home using a smart fall sensor. In: Proeeedings of the EEE-EMBS Special Topic Conference on Micro Technologies in Medieine and Biology. Lyon:IEEE Computer Society, 2000.607-610
[56] Sensor Webs: http://sensorwebs.jpl.nasa.gov/
[57] W.R. Heinzelman, A.P.Chandrakasan, H.Balakrishnan. An application-specific protocol architecture for wlreless microsensor networks. IEEE Transactions on Wireless Communications, 2002,1(4):660-670
[58] R. Ramanathan, R. Rosales. Topology control of multihop wireless networks using transmit power adjustment. In: Proceedings of the 19th IEEE International Conference on Computer Communications. Tel Aviv: IEEE Computer Society, 2000.404-413
[59] A. Woo, D. Culler. A transmission control scheme for media access in sensor networks. In: Proceedings of the 7th annual international conference on Mobile computing and networking. Rome: ACM Press, 2001. 221-235
[60] W. Ye, J. Heidemann, D.Estrin. An energy-efficient MAC protocol for wireless sensor network. Proceedings of the 21st IEEE International Conference on Computer Communications. San Francisco: IEEE Computer Society, 2002. 1567-1576
[61] R. Shah, J. Rabaey. Energy aware routing for low energy ad hoc sensor networks. In:Proceedings of the IEEE Wireless Communications and Networking Conference.Orlando: IEEE Communications Society, 2002. 350-355
[62] C. Intanagonwiwat, R. Govindan, D.Estrin, et al. Directed diffusion for wireless sensor networking. IEEE/ACM Transactions on Networking, 2003, 11(1):2-16
[63] Y. Yu, D. Estrin, R.Govindan. Geographical and energy-aware routing: a recursive data dissemination Protocol for wireless sensor networks, UCLA Computer Science Department Technical Report, UCLA-CSD TR-01-0023, 2001
[64] A. Manjeshwar, D.P. Agrawal. TEEN: A protocol for enhanced efficiency in wireless sensor networks. In: Proceedings of the 15th International Parallel and Distributed Processing Symposium. San Francisco: IEEE Computer Society, 2001. 2009-2015
[65] D. Ganesan, R. Govindan, S. Shenker, et al. Highly resilient, energy efficient multipath routing in wireless sensor networks. Mobile Computing and Communications Review, 2002, 1(2): 134-146
[66] S. Meguerdichian, F. Koushanfar, M. Potkonjak, et al. Coverage problems in wireless ad-hoc sensor networks. In: Proceedings of the 20th IEEE International Conference on Computer Communications. Anchorage:IEEE Computer Society, 2001. 1380-1387
[67] Bang Wang. A survey on coverage problems in wireless sensor networks. Technical Report, ECE Department, National University of Singapore, 2006
[68] D. Tian, N.D. Georganas. A node scheduling scheme for energy conservation in large wireless sensor networks. Wireless Communications and Mobile Computing, 2003,3(2):271-290
[69] Kui Wu, Yong Gao, Fulu Li, et al. Lightweight deployment-aware scheduling for wireless sensor networks. Mobile Networks and Applications, 2005, 10(6):837-852
[70] J. Elson, K. Romer. Wireless sensor networks: A new regime for time synchronization.In: Proceedings of the 1st Workshop on Hot Topics in Networks (HotNets-I),Princeton, NJ, 2002
[71] J. Elson, L. Griod, D. Esrein. Fine-grained network time synchronization using reference broadcasts. In: Proceedings of the 5th symposium on operating systems design and implementation. New York: ACM Press, 2002. 147-163
[72] M.L. Sichitiu, C. Veerarittiphan. Simple accurate time synchronization for wireless sensor networks. In: Proceedings of IEEE Wireless Communication and Networking Conference. New Orleans: IEEE Press, 2003. 1266-1273
[73] S. Ganeriwal, R. Kumar, M.B. Srivastava. Timing-sync protocol for sensor networks.In: Proceedings of the 1st international conference on embedded networked sensor systems. Los Angeles: ACM Press, 2003. 138-149
[74] He T., Huang C, Blum B. m., et al. Range-free location schemes for large scale sensor networks. In: Proceedings of the 9th Annual ACM/IEEE International Conference on Mobile Computing and Network, San Diego: ACM Press, 2003. 81-95
[75] L. Girod, D. Estrin. Robust range estimation using acoustic and multimodal sensing.In: Proceedings of the 2001 IEEE International Conference on Intelligent Robots and Systems. Maui: IEEE Computer Society, 2001. 1312-1320
[76] A. Savvides, C.C. Han, M.B. Srivastava. Dynamic fine-grained localization in ad-hoc networks of sensors. In: Proceedings of the 7th annual international conference on Mobile computing and networking. Rome: ACM Press, 2001. 166-179
[77] D. Nieulescu, B. Nath. Ad hoc positioning system (APS) using AOA. In: Proceedings of the 22nd IEEE International Conference on Computer Communications. Anchorage:IEEE Computer Society, 2003. 1734-1743
[78] S. Madden, M.J. Franklin, J.M. Hellerstein, et al. TAG: A tiny aggregation service for ad-hoc sensor networks. In: Proceedings of the 5th symposium on operating systems design and implementation. New York: ACM Press, 2002.131-146
[79] T. He, B.M. Blum, J.A.Stankovic, et al. AIDA: Adaptive application in dependent data aggregation in wireless sensor networks. ACM Transactions on Embedded Computing System, 2004, 3(2):426-457
[80] A.D. Wood, J.A. Stankovic. Denial of service in sensor networks. IEEE Computer,2002, 35(10):54-62
[81] A. Perrig, R. Szewezyk, et al. SPINS: Security Protocols for sensor networks.Wireless Networks, 2002, 8(5):521-534
[82] Yao Y, Gehrke J. The cougar approach to in-network query processing in sensor networks. SIGMOD Record, 2002, 31(3):9-18
[83] Madden SR, Franklin MJ, Hellerstein JM, et al. The design of an acquisitional query processor for sensor networks. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. New York: ACM Press, 2003. 491-502
[84] Jason Hill, Robert Szewczyk, Alec Woo, et al. System architecture directions for networked sensors. In: Proceedings of the 9th international conference on Architectural support for programming languages and operating systems. Cambridge:ACM Press, 2000. 93-104
[85] GJ. Pottie, W.J. Kaise. Wireless integrated network sensors. Communications of the ACM, 2000,43(5):551-558
[86] Jane W.S. Liu, Kwei-Jay Lin, Wei-Kuan Shih, et al. Algorithms for Scheduling Imprecise Computations. Computer, 1991, 24(5):58-68
[87] A. Deshpande, C. Guestrin, S. Madden, et al. Model-driven data acquisition in sensor networks. In: Proceedings of the 30th international conference on Very large data bases. Toronto: VLDB Endowment, 2004. 588-599
[88] A. Deshpande, C. Guestrin, S. Madden. Using probabilistic models for data management in acquisitional environments. In: Proceedings of the 2nd Biennial Conference on Innovative Data Systems Research. Asilomar, 2005. 317-328
[89] D. Barbara, H. Garcia-Molina, D. Porter. The management of probabilistic data. IEEE Transactions on Knowledge and Data Engineering (TKDE), 1992,4(5): 487-502
[90] L. Lakshmanan, N. Leone, R. Ross, V. Subrahmanian. Probview: A flexible probabilistic database system. ACM Transactions on Database System (TODS), 1997,22(3):419-469
[91] A. Nierman, H. V. Jagadish. ProTDB: Probabilistic data in XML. In: Proceedings of the 28th international conference on Very large data bases. Hong Kong: VLDB Endowment, 2002. 646-657
[92] V. Poosala, V. Ganti. Fast approximate query answering using precomputed statistics.In: Proceedings of the 15th International Conference on Data Engineering. Sydney:IEEE Computer Society, 1999. 252
[93] P. Gibbons, Y. Matias. New sampling-based summary statistics for improving approximate query answers. In: Proceedings of the 1998 ACM SIGMOD international conference on Management of data. Seattle: ACM Press, 1998. 331-342
[94] Paris C. Kanellakis, Sridhar Ramaswamy, Darren Erik Vengroff, et al. Indexing for data models with constraints and classes. Journal of Computer Systems Science and Engineering, 1996, 52(3):589-612
[95] L. Arge, J. S. Vitter. Optimal dynamic interval management in external memory (extended abstract). In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science. Washington: IEEE Computer Society, 1996. 560-569
[96] Y. Manolopoulos, Y. Theodoridis, V.J. Tsotras. Advanced Database Indexing (Chapter 4: Access methods for intervals). Kluwer, 2000
[97] H. Kriegel, M. Potke, T. Seidl. Managing intervals efficiently in object-relational databases. In: Proceedings of the 26th International Conference on Very Large Data Bases. Cairo: VLDB Endowment, 2000. 407-418
[98] R. Cheng, Y. Xia, S. Prabhakar, et al. Efficient indexing methods for probabilistic threshold queries over uncertain data. In: Proceedings of the 30th international conference on Very large data bases. Toronto: VLDB Endowment, 2004. 876-887
[99] R. Cheng, Y. Xia, S. Prabhakar, et al. Efficient join processing over uncertain-valued attributes. In: Proceedings of the 15th ACM international conference on Information and knowledge management. Arlington: ACM Press, 2006. 738 -747
[100]C.F. Huang, Y.C. Tseng. A Survey of Solutions to the Coverage Problems in Wireless Sensor Networks. Journal of Internet Technology, 2005,6(1): 1-8
[101]C. F. Huang, Y. C. Tseng. The coverage problem in a wireless sensor network. In:Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications. San Diego: ACM Press, 2003. 115-121
[102]S. Slijepcevic, M. Potkonjak. Power efficient organization of wireless sensor networks. In: Proceedings of IEEE International Conference on Communications (ICC), 2001. 472-476
[103]Linnyer B. R, Luiz F. M, Marcos A. M, et al. Scheduling Nodes in Wireless Sensor Networks: a Voronoi Approach. In: Proceedings of 28th IEEE Conference on Local Computer Networks (LCN2003), 2003. 423-429
[104]T. Yan, T. He, J. A. Stankovic. Differentiated surveillance for sensor networks. In:Proceedings of the ACM International Conference on Embedded Networked Sensor Systems (SenSys), Los Angeles: ACM Press, 2003. 51-62
[105]Liu H, Wan PJ, Yi CW, et al. Maximal lifetime scheduling in sensor surveillance networks. In: Proceedings of the 24th IEEE International Conference on Computer Communications. Miami: IEEE Computer Society, 2005. 2482-2491
[106]Huajie Xu, Guohui Li, Jizheng Xu. A Decentralized Nodes Scheduling Scheme for Prolonging the Lifetime of Wireless Sensor Surveillance Network, In: Proceedings of the 2nd International Conference on Sensor Networks and Applications (SNA06).Beijing: IEEE Computer Society, 2006. 95-100
[107]C. E. Shannon. The mathematical theory of communication. Bell System Technology Journal, 1948,27:279-428
[108]C. E. Shannon. The mathematical theory of communication. University of Illinois Press, 1949
[109]S.Han,E.Chan,R.Cheng,et al.A Statistics-Based Sensor Selection Scheme for Continuous Probabilistic Queries in Sensor Network.Real Time Systems Journal (RTS),2007(35):33-58
[110]Jinchuan Chen,Reynold Cheng.Quality-Aware Probing of Uncertain Data with Resource Constraints.In:Proceedings of the 20th Intemational Conference on Scientific and Statistical Database Management.Hong Kong:EEE Computer Society,2008.491-508
[111]Long Beach Dataset:http://www.census.gov/geo/www/tiger/
[112]G.Diubin.The average behaviour of greedy algorithms for the knapsack problem:general distributions.Mathematical Methods of Operations Research,2003,57(3)
[113]S.Acharya,R.Alonso,M.Franklin,et al.Broadcast disks:Data management for asymmetric communication environments.In:Proceedings of the 1995 ACM SIGMOD international conference on Management of data.San Jose:ACM Press,1995.199-210
[114]N.H.Vaidya,S.Hameed.Data broadcast in asymmetric wireless environments.In:Workshop on Satellite Based Information Services(WOSBIS),Rye,NY,1996
[115]S.Acharya,S.Muthukrishnan.Scheduling on-demand broadcasts:New metrics and algorithms.In:Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking.Dallas:ACM Press,1998.43-54
[116]S.Acharya,M.Franklin,S.Zdonik.Balancing push and pull for data broadcast.In:Proceedings of the 1997 ACM SIGMOD intemational conference on Management of data.Tucson:ACM Press,1997.183-194
[117]Huajie Xu,Guohui Li.On-line Scheduling for Constantly-evolving Data Broadcasting in Asymmetric Communication Network.In:Proceedings of the 4th IEEE International Conference on Wireless Communications,Networking and Mobile Computing(WiCOM2008),IEEE Computer Society,2008
[118]Govindan R,Hellerstein J,Hong W,et al.The sensor network as a database.Technical Report,02-771,Computer Science Department,University of Southern California,2002
[119]许华杰,李国徽.移动计算环境中易变数据的在线广播调度.计算机科学,2009,36(1)
[120]M. Ester, H.-P. Kriegel, J. Sander, et al. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise, In: Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining. Portland: AAAI Press, 1996.226-231
[121]Huajie Xu, Guohui Li. Density-Based Probabilistic Clustering of Uncertain Data. In:Proceedings of International Conference on Computer Science and Software Engineering (CSSE2008), IEEE Computer Society, 2008
[122]Michael Stonebraker, Jim Frew, Kenn Gardels, et al. The SEQUOIA 2000 Storage Benchmark. In: Proceedings of the 1993 ACM SIGMOD international conference on Management of data. Washington: ACM Press, 1993. 2-11
[123]K. Yeung, W. Ruzzo. An Empirical Study on Principal Component Analysis for Clustering Gene Expression Data. Bioinformatics, 2001,17(9):763-774
[2]Akyildiz I F,Su W,Sankarasubramaniam Y,et al.Wireless Sensor Networks:A Survey.Computer Networks,2002,38(4):393-422
[3]崔莉,鞠海玲,苗勇等.无线传感器网络研究进展.计算机研究与发展,2005,42(1):163-174
[4]任丰原,黄海宁,林闯.无线传感器网络.软件学报,2003,14(07):1282-1291
[5]李建中,李金宝,石胜飞.传感器网络及其数据管理的概念、问题与进展.软件学报,2003,14(10):1716-1727
[6]Mark Weiser.The computer of the 21st century.Scientific American,1991,265(3):94-104
[7]徐光佑,史元春,谢伟凯.普适计算.计算机学报,2003,26(9):1042-1052
[8]Mark Weiser.Some Computer Science Issues in Ubiquitous Computing.Communications of the ACM,1993,36(7):75-84
[9]Peter C.,Neil G.21 Ideas for the 21st Century.Business Week,1999,30(8):78-167
[10]Terry J.10 Emerging Technologies that Will Change the World.MIT Enterprise Technology Review,2003,106(1):33-49
[11]Robert D.The Future of Technology.Business Week,2003,25(8):1-50
[12]Pottie G,Kaiser W.Wireless Integrated Network Sensors.Communications of ACM,2000,43(5):51-58
[13]Wameke B,Last M,Liebowitz B,et al.Smart dust:Communicating with a cubic-millimeter computer.IEEE Computer Magazine,2001,34(1):44-51
[14]MIT uAMPS project,u-Adaptive Multi-domain Power Aware Sensors.http://www.mtl.mit.edu/researchgroups/icsystems/uamps/
[15]Information Processing Technology Office.Sensor Information Technology.http://www.sainc.com/sensit/
[16]Akyildiz I F,Pompili D,Melodia T.Challenges for Efficient Communication in Underwater Acoustic Sensor Networks.ACM Special Interest Group on Embedded Systems Review,2004,1(2):3-8
[17]吴微威,王卫东,卫国.基于超宽带技术的无线传感器网络.中兴通讯技术,2005,11(4):28-31
[18]Sensor Network Consortium.http://www.bu.edu/systems/industry/consortium/index.html
[19]于海斌,曾鹏,梁斡.智能无线传感器网络系统.北京:科学出版社,2006.13-17
[20]孙利民,李建中,陈渝等.无线传感器网络.北京:清华大学出版社,2005
[21]O.Benjelloun,A.Salma,A.Halevy,et al.ULDBs:Databases with uncertainty and lineage.In:Proceedings of the 32nd international conference on Very large data bases.Seoul:VLDB Endowment,2006.953-964
[22]N.Dalvi,D.Suciu.Efficient query evaluation on probabilistic databases."In:Proceedings of the 30th international conference on Very large data bases.Toronto:VLDB Endowment,2004.864-875
[23]N.Fuhr.A probabilistic framework for vague queries and imprecise informationin databases.In:Proceedings of the 16th International Conference on Very Large Data Bases.San Francisco:Morgan Kaufmann,1990.696-707
[24]L.Lakshmanan,N.Leone,R.Ross,et al.Probview:A flexible probabilistic database system.ACM Transacrions on Database Sysrems,1997,22(3):419-469
[25]R.Cheng.D.V.Kalashnikov,S.Prabhakar.Evaluating probabilistic queries over imprecise data.In:Proceedings of the 2003 ACM SIGMOD international conference on Management of data.San Diego:ACM Press,2003.551-562
[26]S.V.Vrbsky,J.W.S.Liu.Producing approximate answers to set- and single-valued queries.The Journal of Systems and Software,1994,27(3):243-251
[27]V.Poosala,V.Ganti.Fast approximate query answering using precomputed statistics.In:Proceedings of the 15th International Conference on Data Engineering.Sydney:IEEE Computer Society,1999.252
[28]P.Gibbons,Y.Matias.New sampling-based summary statistics for improving approximate query answers.In:Proceedings of the 1998 ACM SIGMOD international conference on Management of data.Seattle:ACM Press,1998.331-342
[29]S.Acharya,P.Gibbons,V.Poosala,et al.Join synopses for approximate query answering. In: Proceedings of the 1999 ACM SIGMOD international conference on Management of data. Philadelphia: ACM Press, 1999. 275-286
[30] C. Olston, J. Widom. Offering a precision-performance tradeoff for aggregation queries over replicated data. In: Proceedings of the 26th international conference on Very large data bases. San Francisco: Morgan Kaufmann, 2000. 144-155
[31] C. Olston, Boon Thau Loo, J. Widom. Adaptive precision setting for cached approximate values. In: Proceedings of the 2001 ACM SIGMOD international conference on Management of data. Santa Barbara: ACM Press, 2001. 355-366
[32] C. Olston, J. Widom. Best-effort cache synchronization with source cooperation. In:Proceedings of the 2002 ACM SIGMOD international conference on Management of data. Santa Barbara: ACM Press, 2002. 73-84
[33] P. A. Sistla, O. Wolfson, S. Chamberlain, et al. Querying the uncertain position of moving objects. Temporal Databases: Research and Practice, 1998, LNCS 1399/1998:310-337
[34] Goce Trajcevski, Ouri Wolfson, Fengli Zhang, et al. The geometry of uncertainty in moving object databases. In: Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology. London:Springer-Verlag, 2002. 233-250
[35] O. Wolfson, P. Sistla, S. Chamberlain, et al. Updating and querying databases that track mobile units. Distributed and Parallel Databases, 1999, 7(3): 257-387
[36] D. Pfoser, C. Jensen. Capturing the uncertainty of moving-objects representations. In: Proceedings of International Conference on Scientific and Statistical Database Management (SSDBM), 1999. 123-132
[37] H. Gunadhi, A. Segev. Query processing algorithms for temporal intersection joins. In:Proceedings of the 7th International Conference on Data Engineering. Washington:IEEE Computer Society, 1991. 336-344
[38] D. Pfoser, C. Jensen. Incremental join of time-oriented data. In: Proceedings of the 11th International Conference on Scientific on Scientific and Statistical Database Management. Washington: IEEE Computer Society, 1999. 232-243
[39] M. Soo, R. Snodgrass, C. Jensen. Efficient evaluation of the valid-time natural join. In:Proceedings of the 10th International Conference on Data Engineering. Washington:IEEE Computer Society, 1994. 282-292
[40] D. Zhang, V. Tsotras, B. Seeger. Efficient temporal join processing using indices. In:Proceedings of the 18th International Conference on Data Engineering. Washington:IEEE Computer Society, 2002. 103-113
[41] M. Chau, Reynold Cheng, B. Kao, et al. Uncertain Data Mining: An Example in Clustering Location Data. In: Proceedings of the 10th Pacific-Asia Conference on Knowledge Discovery and Data Mining. Singapore:Springer, 2006. 199-204
[42] H.-P. Kriegel, M. Pfeifle. Density-based clustering of uncertain data. In: Proceedings of the 11th ACM SIGKDD international conference on Knowledge discovery in data mining. Chicago: ACM Press, 2005. 672-677
[43] J. Widom. Trio: A system for integrated management of data, accuracy, and lineage. In:Proceedings of the 2nd Biennial Conference on Innovative Data Systems Research.Pacific Grove: ACM Press, 2005. 262-276
[44] P. Agrawal, O. Benjelloun, A. Das Sarma, et al. Trio: A System for Data, Uncertainty,and Lineage. In: Proceedings of the 32nd international conference on Very large data bases. Seoul: VLDB Endowment, 2006. 1151-1154
[45] Reynold Cheng, Sarvjeet Singh, Sunil Prabhakar. U-DBMS: A Database System for Managing Constantly-Evolving Data. In: Proceedings of the 31st international conference on Very large data bases. Trondheim: VLDB Endowment, 2005.1271-1274
[46] 沈理.普适计算.计算机工程与科学. 2005,27(7):77-82
[47] Ng J W P. Ubiquitous healthcare localisation schemes. Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331,2005, 21(3):156-161
[48] Akyildiz LF, Su WL, Sankarasubramaniam Y, et al. A survey on sensor networks.IEEE Communications Magazine, 2002, 40(8): 102-114
[49] D.Estrin, L.Girod, G Pottie, et al. Instrument the world with wireless sensor networks.In: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing. Salt Lake City, 2001. 2033-2036
[50] Zhao F., Guibas L. Wireless Sensor Networks: An Information Processing Approach.Boston:Elsevier-Morgan Kaufmann, 2004
[51] Warneke B, Last M, Liebowitz B, et al. Smart dust: Communicating with a cubic-millimeter computer. IEEE Computer Magazine, 2001, 34(1):44-51
[52] G.Werner-Allen, J. Johnson, M. Ruiz, et al. Monitoring Volcanic Eruptions with a Wireless Sensor NetWork. In: Proceedings of the Second European Workshop on Wireless Sensor Networks. Istanbul, Turkey, 2005. 108-120
[53] Philo Juang, Hidekazu Oki, Yong Wang. Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet. ACM SIGPLAN Notices, 37(10):96-107
[54] Alan Mainwaring, Joseph Polastre, Robert Szewczyk, et al. Wireless sensor networks for habitat monitoring. In: Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications. Atlanta: ACM Press, 2002. 88-97
[55] Noury N, Herve T, Rialle V, et al. Monitoring behavior in home using a smart fall sensor. In: Proeeedings of the EEE-EMBS Special Topic Conference on Micro Technologies in Medieine and Biology. Lyon:IEEE Computer Society, 2000.607-610
[56] Sensor Webs: http://sensorwebs.jpl.nasa.gov/
[57] W.R. Heinzelman, A.P.Chandrakasan, H.Balakrishnan. An application-specific protocol architecture for wlreless microsensor networks. IEEE Transactions on Wireless Communications, 2002,1(4):660-670
[58] R. Ramanathan, R. Rosales. Topology control of multihop wireless networks using transmit power adjustment. In: Proceedings of the 19th IEEE International Conference on Computer Communications. Tel Aviv: IEEE Computer Society, 2000.404-413
[59] A. Woo, D. Culler. A transmission control scheme for media access in sensor networks. In: Proceedings of the 7th annual international conference on Mobile computing and networking. Rome: ACM Press, 2001. 221-235
[60] W. Ye, J. Heidemann, D.Estrin. An energy-efficient MAC protocol for wireless sensor network. Proceedings of the 21st IEEE International Conference on Computer Communications. San Francisco: IEEE Computer Society, 2002. 1567-1576
[61] R. Shah, J. Rabaey. Energy aware routing for low energy ad hoc sensor networks. In:Proceedings of the IEEE Wireless Communications and Networking Conference.Orlando: IEEE Communications Society, 2002. 350-355
[62] C. Intanagonwiwat, R. Govindan, D.Estrin, et al. Directed diffusion for wireless sensor networking. IEEE/ACM Transactions on Networking, 2003, 11(1):2-16
[63] Y. Yu, D. Estrin, R.Govindan. Geographical and energy-aware routing: a recursive data dissemination Protocol for wireless sensor networks, UCLA Computer Science Department Technical Report, UCLA-CSD TR-01-0023, 2001
[64] A. Manjeshwar, D.P. Agrawal. TEEN: A protocol for enhanced efficiency in wireless sensor networks. In: Proceedings of the 15th International Parallel and Distributed Processing Symposium. San Francisco: IEEE Computer Society, 2001. 2009-2015
[65] D. Ganesan, R. Govindan, S. Shenker, et al. Highly resilient, energy efficient multipath routing in wireless sensor networks. Mobile Computing and Communications Review, 2002, 1(2): 134-146
[66] S. Meguerdichian, F. Koushanfar, M. Potkonjak, et al. Coverage problems in wireless ad-hoc sensor networks. In: Proceedings of the 20th IEEE International Conference on Computer Communications. Anchorage:IEEE Computer Society, 2001. 1380-1387
[67] Bang Wang. A survey on coverage problems in wireless sensor networks. Technical Report, ECE Department, National University of Singapore, 2006
[68] D. Tian, N.D. Georganas. A node scheduling scheme for energy conservation in large wireless sensor networks. Wireless Communications and Mobile Computing, 2003,3(2):271-290
[69] Kui Wu, Yong Gao, Fulu Li, et al. Lightweight deployment-aware scheduling for wireless sensor networks. Mobile Networks and Applications, 2005, 10(6):837-852
[70] J. Elson, K. Romer. Wireless sensor networks: A new regime for time synchronization.In: Proceedings of the 1st Workshop on Hot Topics in Networks (HotNets-I),Princeton, NJ, 2002
[71] J. Elson, L. Griod, D. Esrein. Fine-grained network time synchronization using reference broadcasts. In: Proceedings of the 5th symposium on operating systems design and implementation. New York: ACM Press, 2002. 147-163
[72] M.L. Sichitiu, C. Veerarittiphan. Simple accurate time synchronization for wireless sensor networks. In: Proceedings of IEEE Wireless Communication and Networking Conference. New Orleans: IEEE Press, 2003. 1266-1273
[73] S. Ganeriwal, R. Kumar, M.B. Srivastava. Timing-sync protocol for sensor networks.In: Proceedings of the 1st international conference on embedded networked sensor systems. Los Angeles: ACM Press, 2003. 138-149
[74] He T., Huang C, Blum B. m., et al. Range-free location schemes for large scale sensor networks. In: Proceedings of the 9th Annual ACM/IEEE International Conference on Mobile Computing and Network, San Diego: ACM Press, 2003. 81-95
[75] L. Girod, D. Estrin. Robust range estimation using acoustic and multimodal sensing.In: Proceedings of the 2001 IEEE International Conference on Intelligent Robots and Systems. Maui: IEEE Computer Society, 2001. 1312-1320
[76] A. Savvides, C.C. Han, M.B. Srivastava. Dynamic fine-grained localization in ad-hoc networks of sensors. In: Proceedings of the 7th annual international conference on Mobile computing and networking. Rome: ACM Press, 2001. 166-179
[77] D. Nieulescu, B. Nath. Ad hoc positioning system (APS) using AOA. In: Proceedings of the 22nd IEEE International Conference on Computer Communications. Anchorage:IEEE Computer Society, 2003. 1734-1743
[78] S. Madden, M.J. Franklin, J.M. Hellerstein, et al. TAG: A tiny aggregation service for ad-hoc sensor networks. In: Proceedings of the 5th symposium on operating systems design and implementation. New York: ACM Press, 2002.131-146
[79] T. He, B.M. Blum, J.A.Stankovic, et al. AIDA: Adaptive application in dependent data aggregation in wireless sensor networks. ACM Transactions on Embedded Computing System, 2004, 3(2):426-457
[80] A.D. Wood, J.A. Stankovic. Denial of service in sensor networks. IEEE Computer,2002, 35(10):54-62
[81] A. Perrig, R. Szewezyk, et al. SPINS: Security Protocols for sensor networks.Wireless Networks, 2002, 8(5):521-534
[82] Yao Y, Gehrke J. The cougar approach to in-network query processing in sensor networks. SIGMOD Record, 2002, 31(3):9-18
[83] Madden SR, Franklin MJ, Hellerstein JM, et al. The design of an acquisitional query processor for sensor networks. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. New York: ACM Press, 2003. 491-502
[84] Jason Hill, Robert Szewczyk, Alec Woo, et al. System architecture directions for networked sensors. In: Proceedings of the 9th international conference on Architectural support for programming languages and operating systems. Cambridge:ACM Press, 2000. 93-104
[85] GJ. Pottie, W.J. Kaise. Wireless integrated network sensors. Communications of the ACM, 2000,43(5):551-558
[86] Jane W.S. Liu, Kwei-Jay Lin, Wei-Kuan Shih, et al. Algorithms for Scheduling Imprecise Computations. Computer, 1991, 24(5):58-68
[87] A. Deshpande, C. Guestrin, S. Madden, et al. Model-driven data acquisition in sensor networks. In: Proceedings of the 30th international conference on Very large data bases. Toronto: VLDB Endowment, 2004. 588-599
[88] A. Deshpande, C. Guestrin, S. Madden. Using probabilistic models for data management in acquisitional environments. In: Proceedings of the 2nd Biennial Conference on Innovative Data Systems Research. Asilomar, 2005. 317-328
[89] D. Barbara, H. Garcia-Molina, D. Porter. The management of probabilistic data. IEEE Transactions on Knowledge and Data Engineering (TKDE), 1992,4(5): 487-502
[90] L. Lakshmanan, N. Leone, R. Ross, V. Subrahmanian. Probview: A flexible probabilistic database system. ACM Transactions on Database System (TODS), 1997,22(3):419-469
[91] A. Nierman, H. V. Jagadish. ProTDB: Probabilistic data in XML. In: Proceedings of the 28th international conference on Very large data bases. Hong Kong: VLDB Endowment, 2002. 646-657
[92] V. Poosala, V. Ganti. Fast approximate query answering using precomputed statistics.In: Proceedings of the 15th International Conference on Data Engineering. Sydney:IEEE Computer Society, 1999. 252
[93] P. Gibbons, Y. Matias. New sampling-based summary statistics for improving approximate query answers. In: Proceedings of the 1998 ACM SIGMOD international conference on Management of data. Seattle: ACM Press, 1998. 331-342
[94] Paris C. Kanellakis, Sridhar Ramaswamy, Darren Erik Vengroff, et al. Indexing for data models with constraints and classes. Journal of Computer Systems Science and Engineering, 1996, 52(3):589-612
[95] L. Arge, J. S. Vitter. Optimal dynamic interval management in external memory (extended abstract). In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science. Washington: IEEE Computer Society, 1996. 560-569
[96] Y. Manolopoulos, Y. Theodoridis, V.J. Tsotras. Advanced Database Indexing (Chapter 4: Access methods for intervals). Kluwer, 2000
[97] H. Kriegel, M. Potke, T. Seidl. Managing intervals efficiently in object-relational databases. In: Proceedings of the 26th International Conference on Very Large Data Bases. Cairo: VLDB Endowment, 2000. 407-418
[98] R. Cheng, Y. Xia, S. Prabhakar, et al. Efficient indexing methods for probabilistic threshold queries over uncertain data. In: Proceedings of the 30th international conference on Very large data bases. Toronto: VLDB Endowment, 2004. 876-887
[99] R. Cheng, Y. Xia, S. Prabhakar, et al. Efficient join processing over uncertain-valued attributes. In: Proceedings of the 15th ACM international conference on Information and knowledge management. Arlington: ACM Press, 2006. 738 -747
[100]C.F. Huang, Y.C. Tseng. A Survey of Solutions to the Coverage Problems in Wireless Sensor Networks. Journal of Internet Technology, 2005,6(1): 1-8
[101]C. F. Huang, Y. C. Tseng. The coverage problem in a wireless sensor network. In:Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications. San Diego: ACM Press, 2003. 115-121
[102]S. Slijepcevic, M. Potkonjak. Power efficient organization of wireless sensor networks. In: Proceedings of IEEE International Conference on Communications (ICC), 2001. 472-476
[103]Linnyer B. R, Luiz F. M, Marcos A. M, et al. Scheduling Nodes in Wireless Sensor Networks: a Voronoi Approach. In: Proceedings of 28th IEEE Conference on Local Computer Networks (LCN2003), 2003. 423-429
[104]T. Yan, T. He, J. A. Stankovic. Differentiated surveillance for sensor networks. In:Proceedings of the ACM International Conference on Embedded Networked Sensor Systems (SenSys), Los Angeles: ACM Press, 2003. 51-62
[105]Liu H, Wan PJ, Yi CW, et al. Maximal lifetime scheduling in sensor surveillance networks. In: Proceedings of the 24th IEEE International Conference on Computer Communications. Miami: IEEE Computer Society, 2005. 2482-2491
[106]Huajie Xu, Guohui Li, Jizheng Xu. A Decentralized Nodes Scheduling Scheme for Prolonging the Lifetime of Wireless Sensor Surveillance Network, In: Proceedings of the 2nd International Conference on Sensor Networks and Applications (SNA06).Beijing: IEEE Computer Society, 2006. 95-100
[107]C. E. Shannon. The mathematical theory of communication. Bell System Technology Journal, 1948,27:279-428
[108]C. E. Shannon. The mathematical theory of communication. University of Illinois Press, 1949
[109]S.Han,E.Chan,R.Cheng,et al.A Statistics-Based Sensor Selection Scheme for Continuous Probabilistic Queries in Sensor Network.Real Time Systems Journal (RTS),2007(35):33-58
[110]Jinchuan Chen,Reynold Cheng.Quality-Aware Probing of Uncertain Data with Resource Constraints.In:Proceedings of the 20th Intemational Conference on Scientific and Statistical Database Management.Hong Kong:EEE Computer Society,2008.491-508
[111]Long Beach Dataset:http://www.census.gov/geo/www/tiger/
[112]G.Diubin.The average behaviour of greedy algorithms for the knapsack problem:general distributions.Mathematical Methods of Operations Research,2003,57(3)
[113]S.Acharya,R.Alonso,M.Franklin,et al.Broadcast disks:Data management for asymmetric communication environments.In:Proceedings of the 1995 ACM SIGMOD international conference on Management of data.San Jose:ACM Press,1995.199-210
[114]N.H.Vaidya,S.Hameed.Data broadcast in asymmetric wireless environments.In:Workshop on Satellite Based Information Services(WOSBIS),Rye,NY,1996
[115]S.Acharya,S.Muthukrishnan.Scheduling on-demand broadcasts:New metrics and algorithms.In:Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking.Dallas:ACM Press,1998.43-54
[116]S.Acharya,M.Franklin,S.Zdonik.Balancing push and pull for data broadcast.In:Proceedings of the 1997 ACM SIGMOD intemational conference on Management of data.Tucson:ACM Press,1997.183-194
[117]Huajie Xu,Guohui Li.On-line Scheduling for Constantly-evolving Data Broadcasting in Asymmetric Communication Network.In:Proceedings of the 4th IEEE International Conference on Wireless Communications,Networking and Mobile Computing(WiCOM2008),IEEE Computer Society,2008
[118]Govindan R,Hellerstein J,Hong W,et al.The sensor network as a database.Technical Report,02-771,Computer Science Department,University of Southern California,2002
[119]许华杰,李国徽.移动计算环境中易变数据的在线广播调度.计算机科学,2009,36(1)
[120]M. Ester, H.-P. Kriegel, J. Sander, et al. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise, In: Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining. Portland: AAAI Press, 1996.226-231
[121]Huajie Xu, Guohui Li. Density-Based Probabilistic Clustering of Uncertain Data. In:Proceedings of International Conference on Computer Science and Software Engineering (CSSE2008), IEEE Computer Society, 2008
[122]Michael Stonebraker, Jim Frew, Kenn Gardels, et al. The SEQUOIA 2000 Storage Benchmark. In: Proceedings of the 1993 ACM SIGMOD international conference on Management of data. Washington: ACM Press, 1993. 2-11
[123]K. Yeung, W. Ruzzo. An Empirical Study on Principal Component Analysis for Clustering Gene Expression Data. Bioinformatics, 2001,17(9):763-774