期刊文献+

Data Aggregation Scheduling with Guaranteed Lifetime and Efficient Latency in Wireless Sensor Networks 被引量:4

Data Aggregation Scheduling with Guaranteed Lifetime and Efficient Latency in Wireless Sensor Networks
下载PDF
导出
摘要 In scenarios of real-time data collection of long-term deployed Wireless Sensor Networks (WSNs), low-latency data collection with long net- work lifetime becomes a key issue. In this paper, we present a data aggregation scheduling with guaran- teed lifetime and efficient latency in WSNs. We first Construct a Guaranteed Lifetime Mininmm Ra- dius Data Aggregation Tree (GLMRDAT) which is conducive to reduce scheduling latency while pro- viding a guaranteed network lifetime, and then de-sign a Greedy Scheduling algorithM (GSM) based on finding the nmzximum independent set in conflict graph to schedule he transmission of nodes in the aggregation tree. Finally, simulations show that our proposed approach not only outperfonm the state-of-the-art solutions in terms of schedule latency, but also provides longer and guaranteed network lifetilre. In scenarios of real-time data collection of long-term deployed Wireless Sensor Networks (WSNs),low-latency data collection with long network lifetime becomes a key issue.In this paper,we present a data aggregation scheduling with guaranteed lifetime and efficient latency in WSNs.We first construct a Guaranteed Lifetime Minimum Radius Data Aggregation Tree (GLMRDAT) which is conducive to reduce scheduling latency while providing a guaranteed network lifetime,and then design a Greedy Scheduling algorithM (GSM) based on finding the maximum independent set in conflict graph to schedule the transmission of nodes in the aggregation tree.Finally,simulations show that our proposed approach not only outperforms the state-of-the-art solutions in terms of schedule latency,but also provides longer and guaranteed network lifetime.
出处 《China Communications》 SCIE CSCD 2012年第9期11-21,共11页 中国通信(英文版)
基金 This paper was supported by the National Basic Research Pro- gram of China (973 Program) under Crant No. 2011CB302903 the National Natural Science Foundation of China under Crants No. 60873231, No.61272084 the Natural Science Foundation of Jiangsu Province under Ca-ant No. BK2009426 the Innovation Project for Postgraduate Cultivation of Jiangsu Province under Crants No. CXZZ11_0402, No. CX10B195Z, No. CXLX11_0415, No. CXLXll 0416 the Natural Science Research Project of Jiangsu Education Department under Grant No. 09KJD510008 the Natural Science Foundation of the Jiangsu Higher Educa-tion Institutions of China under Grant No. 11KJA520002.
关键词 WSNs data aggregation aggregationscheduling network lifetime LATENCY 无线传感器网络 调度延迟 数据聚合 使用寿命 低延时 实时数据采集 工作寿命 数据收集
  • 相关文献

参考文献20

  • 1WAN Pengjun, HUANG S, WANG Lixin, et al. Minimum-Latency Aggregation Scheduling in Multihop Wireless Networks[C]//Proceedings of the 10th ACM International Symposium on Mobile Ad Hoc Networking and Computing May 18-21, 2009, New Orleans, LA, USA. ACM, 2009: 185- 194. 被引量:1
  • 2HUANG S, WAN Pengjun, VU C, et al. Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks [C]// Proceedings of the 26th Conference on Computer Communications: May 6-12, 2007, Anchorage. Alaska, USA. IEEE Press, 212109: 366-372. 被引量:1
  • 3YU Bo, LI Jianzhong, LI Yingshu. Distributed Data Aggregation Scheduling in Wireless Sensor Networks [C]// Proceedings of the 28th Conference on Computer Communications: April 19-25, 2009, Rio de Janeiro, Brazil. IEEE Press, 2009: 2159-2167. 被引量:1
  • 4XU Xiaohua, LI Xiangyang, MAO Xufei, et al. A Delay-Efficient Algorithm for Data Aggregation in Multi-Hop Wireless Sensor Networks[J]. IEEE Transactions on Parallel and Distributed Systems, 2011, 22(1): 163-175. 被引量:1
  • 5KALPAKIS K, DASGUPTA K, NAMJOSHI P. Efficient Algorithm: for Maximum Lifetime Data Gathering and Aggregation in Wireless Sensor Networks[J]. Computing Network, 2003, 42(6): 697-716. 被引量:1
  • 6WU Yan, MAO Zhoujia, FAHMY S, et al. Constructing Maxirrum-Lifetime Data-Gathering Forests in Sensor Networks[J]. IEEF/ACM Transactions on Networking, 2010, 18 (5): 1571-1584. 被引量:1
  • 7HUANG L, KESHAVARZIAN A. Towards Energy-Optircal and Reliable Data Collection via Collision-Free Scheduling in Wireless Sensor Networks [C]// Proceedings of the 27th Conference on Computer Communications: April 13-18, 2008, Phoenix, AZ, USA. IEEE Press, 2008: 2029-2037. 被引量:1
  • 8LUO Dijun, ZHU Xiaojun, WU Xiaobing, et al. Mawr/zing Lifetime for the Shortest Path Aggregation Tree in Wireless Sensor Networks [C]// Proceedings of the 30th Conference on Computer Communications: April 10-15, 2011, Shanghai, China. IEEE Press, 2008: 1566-1574. 被引量:1
  • 9YU Yang, KRISHNAMACHARI B, PRASANNA V. Energy-Latency Tradeoffs for Data Gathering in Wireless Sensor Networks [C]// Proceedings of the 23th Conference on Computer Communications: March 7-11, 2004, Hong Kong, China. IEEE Press, 2004: 224-235. 被引量:1
  • 10MALHOTRA B, NIKOLAIDIS I, NASCIMENTO M. Aggregation Convergecast Scheduling in Wireless Sensor Networks[J]. Wireless Networks, 2011, 17(2): 319-335. 被引量:1

同被引文献13

引证文献4

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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