Data aggregation scheduling algorithm based on twice maximum independent set
academic paper|更新时间:2024-06-05
|
Data aggregation scheduling algorithm based on twice maximum independent set
Journal on CommunicationsVol. 35, Issue 1, Pages: 62-71(2014)
作者机构:
1. 南京邮电大学 宽带无线通信与传感网技术教育部重点实验室,江苏 南京 210003
2. 南京邮电大学 计算机学院,江苏 南京 210003
3. 金陵科技学院 信息技术学院,江苏 南京 211169
作者简介:
基金信息:
The National Basic Research Program of China (973 Program)(2011CB302903);The National Natural Science Foundation of China(60873231);The Natural Science Foundation of Jiangsu Province(BK2009426);The Natural Science Foundation of Jiangsu Province(BK2011754);The Natural Science Foundation of Jiangsu Province(BK20130096));The Research Fund for the Doctoral Program of Higher Education of China(20113223110003);The Research Fund for the Doctoral Program of Higher Education of China(20093223120001);The Innovation Project for Postgraduate Cultivation of Jiangsu Province(CXLX11_0416);The Innovation Project for Postgraduate Cultivation of Jiangsu Province(CXLX11_0415);The Innovation Project for Postgraduate Cultivation of Jiangsu Province(CXZZ11_0402);The Innovation Project for Postgraduate Cultivation of Jiangsu Province(CX10B_195Z)
Jian XU, Geng YANG, Zheng-yu CHEN, et al. Data aggregation scheduling algorithm based on twice maximum independent set[J]. Journal on Communications, 2014, 35(1): 62-71.
DOI:
Jian XU, Geng YANG, Zheng-yu CHEN, et al. Data aggregation scheduling algorithm based on twice maximum independent set[J]. Journal on Communications, 2014, 35(1): 62-71. DOI: 10.3969/j.issn.1000-436x.2014.01.008.
Data aggregation scheduling algorithm based on twice maximum independent set