期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

Minimum-Time Aggregation Scheduling in Duty-Cycled Wireless Sensor Networks 被引量：2

Minimum-Time Aggregation Scheduling in Duty-Cycled Wireless Sensor Networks
原文传递
导出
摘要 Aggregation is an important and commonplace operation in wireless sensor networks. Due to wireless interferences aggregation in wireless sensor networks often suffers from packet collisions. In order to solve the collision problem aggregation scheduling is extensively researched in recent years. In many sensor network applications such as real-time monitoring, aggregation time is the most concerned performance. This paper considers the minimum-time aggregation scheduling problem in duty-cycled wireless sensor networks for the first time. We show that this problem is NP-hard and present an approximation algorithm based on connected dominating set. The theoretical analysis shows that the proposed algorithm is a nearly-constant approximation. Simulation shows that the scheduling algorithm has a good performance. Aggregation is an important and commonplace operation in wireless sensor networks. Due to wireless interferences aggregation in wireless sensor networks often suffers from packet collisions. In order to solve the collision problem aggregation scheduling is extensively researched in recent years. In many sensor network applications such as real-time monitoring, aggregation time is the most concerned performance. This paper considers the minimum-time aggregation scheduling problem in duty-cycled wireless sensor networks for the first time. We show that this problem is NP-hard and present an approximation algorithm based on connected dominating set. The theoretical analysis shows that the proposed algorithm is a nearly-constant approximation. Simulation shows that the scheduling algorithm has a good performance.
作者 于博 李建中
机构地区 CCF School of Computer Science and Technology
出处 《Journal of Computer Science & Technology》 SCIE EI CSCD 2011年第6期962-970,共9页 计算机科学技术学报（英文版）
基金 supported by the Key Project of National Natural Science Foundation of China under Grant No.61033015 the National Natural Science Foundation of China/Research Grants Council of Hong Kong Joint Research Scheme under Grant No.60831160525,and the National Natural Science Foundation of China under Grant No.60933001
关键词 AGGREGATION duty-cycle SCHEDULING sensor network aggregation, duty-cycle, scheduling, sensor network
分类号 TN929.5 [电子电信—通信与信息系统] TP212.9 [自动化与计算机技术—检测技术与自动化装置]
  • 相关文献

参考文献31

  • 1Mainwaring A, Culler D, Polastre J, Szewczyk R, Ander- son J. Wireless sensor networks for habitat monitoring. In Proc. the 1st A CM International Workshop on Wireless Sen- sot Networks and Applications (WSNA 2002), Atlanta, USA, Sept. 28, 2002, pp.88-97.
  • 2Szewczyk R, Osterweil E, Polastre J, Hamilton M, Mainwar- ing A, Estrin D. Habitat monitoring with sensor networks. Communications of the ACM - Wireless Sensor Networks, 2004, 47(6): 34-40.
  • 3Szewczyk R, Mainwaring A, Folastre J, Anderson J, Culler D. An analysis of a large scale habitat monitoring application. In Proe. the 2nd A CM Conference on Embedded Networked Sen- sor Systems (Sensys 2004), Baltimore, USA, Nov. 3-5, 2004, pp.214-226.
  • 4Shrivastava N, Mudumbai R, Madhow U, Suri S. Target track- ing with binary proximity sensors. ACM Transactions on Sensor Networks, 2009, 5(4): 251-264.
  • 5Jeong J, Hwang T, He T, Du D. MCTA: Target tracking algo- rithm based on minimal contour in wireless sensor networks. In Proe. the 26th Annual IEEE Conference on Computer Communications (INFOCOM 2007), Anchorage, USA, May 6-12, 2007, pp.2371-2375.
  • 6Madden S, Franklin M J, Hellerstein J M, Hong W. TAG: A tiny aggregation service for ad-hoc sensor networks. In Proc. the 5th Symp. Operating Systems Design and Implementa- tion (OSDI 2002), Boston, USA, Dec. 9-11, 2002, pp.131-146.
  • 7Shrivastava N, Buragohain C, Agrawal D, Suri S. Medians and beyond: New aggregation techniques for sensor networks. In Proc. the 2nd A CM Conference on Embedded Networked Sen- sor Systems (Sensys 2005), Baltimore, USA, Nov. 3-5, 2004, pp.239-249.
  • 8Chu D, Deshpande A, Hellerstein J, Hong W. Approximate data collection in sensor networks using probabilistic models. In Proc. the 22nd International Conference on Data Engi- neering (ICDE 2006), Atlanta, USA, Apr. 3-8, 2006, p.48.
  • 9Huang S C H, Wan P J, Vu C T, Li Y, Yao F. Nearly constant approximation for data aggregation scheduling in wireless sen- sor networks. In Proc. the 26~h Annual IEEE Conference on Computer ComTnunications (INFOCOM 2007), Anchorage, USA, May 6-12, 2007, pp.366-372.
  • 10Wan P J, Huang S C H, Wang L, Wan Z, Jia X. Minimum- latency aggregation scheduling in multihop wireless networks. In Proc. the lOth ACM International Symposium on MobileAd Hoc Networking and Computing (MobiHoc 2009), New Orleans, USA, May 18-21, 2009, pp.185-193.

引证文献2

二级引证文献3

Journal of Computer Science & Technology
2011年 第6期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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