期刊文献+

无线传感器网络中的查询合并算法 被引量:1

Query Aggregation Algorithm in WSN
下载PDF
导出
摘要 根据无线传感器网络资源有限的特点,提出一种针对类SQL语言的查询简化与合并算法。算法根据基站上保存的属性历史数据,预测查询合并前后的能量消耗,如果合并后能耗减少,则将查询合并为一个新查询。仿真实验结果表明,合并可以减少网络中查询的数目,避免发送大量冗余数据,达到降低能量消耗的目的。 Aiming at queries with SQL-like language,this paper proposes a queries aggregation algorithm in order to adapt the limitation of Wireless Sensor Network(WSN) resource.According to the attribute historic data stored on the base station,it calculates the energy cost of queries before and after the aggregation.If the cost falls off after the aggregation,the queries will be aggregated into a new one.Simulation results show that the algorithm can reduce the number of queries in WSN,avoid large amount of redundant data transmission and effectively save the energy consumption.
出处 《计算机工程》 CAS CSCD 北大核心 2011年第9期121-123,共3页 Computer Engineering
基金 天津市信息化基金资助项目(082044012)
关键词 无线传感器网络 类SQL语言 查询合并算法 能量消耗 Wireless Sensor Network(WSN) SQL-like language query aggregation algorithm energy cost
  • 相关文献

参考文献4

二级参考文献54

  • 1Edgar H C. Wireless sensor networks: architecture and protocol [M]. New York: Auerbach Publications, 2004.
  • 2Shen Chien Chung, Srisathapornphat C, Jaikaeo C. Sensor informarion network architecture and applications [ J ]. IEEE Personal Communication, 2001,8 (4) :52-59.
  • 3Crepe A, Estrin D. ASCENT: adaptive self-configuration sensor network topologies[ C]. INFOCOM 2002. New York, June 2002, 3 : 1278-1287.
  • 4Akyildiz I F, Su W,Sankamsubmmaniam Y,et al. Wireless sensor networks: a urvey, computer [M]. New York: Auerbach Publications, March 2002,9-15.
  • 5Cerpa A, Elson J, Estrin D. Habitat monitoring: application driver for wireless communications technology [ C ]. 2001 ACM SIGCOMM Workshop on Data Communications in Latin America and the Caribbean, Costa Rica, April 2001,92-98.
  • 6Estrin D, Govindan R, Heidemann J,et al. Next century challenges: scalable coordination in sensor networks [ C ]. Proc. of ACM MobiCom'99, Washington, August 1999,68-72.
  • 7Kahn J, Katz R, Pister K. Next century challenges: mobile networking for smart dust [ C ]. Proc. of ACM MobiCom' 99, August 1999,12-16.
  • 8Hwang F,Richards D, Winter P. The steiner tree problem. No. 53 in annals of discrete mathematics[ M]. New York: North-HoUand, 1992.62-67.
  • 9Karp R. Reducibility among combinatorial problems, in complexity of computer computations [M]. New York: Plenum Press, 1972.
  • 10Kompella V P, Pasquals J C, Polyzos G C. Multicast routing for multimedia communication [ J]. IEEE/ACM Trans. Networking, June 1993,1:286-292.

共引文献14

同被引文献35

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部