IMPROVED ALGORITHM FOR MINIMUM DATA AGGREGATION TIME PROBLEM IN WIRELESS SENSOR NETWORKS

查看全文 作　　者：Jianming [1]ZHU;Xiaodong [2]HU

机构地区：[1]Graduate School of Chinese Academy of Sciences, Beijing 100049, China.;[2]Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100190, China.

出　　处：《Journal of Systems Science & Complexity》索引2008年第21卷第4期,共11页

基　　金：This work was supported in part by the National Natural Science Foundation of China under Grant No.70221001,10531070,10771209,10721101;Chinese Academy of Sciences under Grant No.kjex-yw-s7 摘　　要：Wireless sensor networks promise a new paradigm for gathering data via collaborationamong sensors spreading over a large geometrical region.Many applications impose delay requirementsfor data gathering and ask for time-efficient schedules for aggregating sensed data and sending tothe data sink.In this paper,the authors study the minimum data aggregation time problem undercollision-free transmission model.In each time round,data sent by a sensor reaches all sensors withinits transmission range,but a sensor can receive data only when it is the only data that reaches thesensor.The goal is to find the method that schedules data transmission and aggregation at sensorsso that the time for all requested data to be sent to the data sink is minimal.The authors propose anew approximation algorithm for this NP-hard problem with guaranteed performance ratio (7Δ)/(Iog_2|S|)+c,which significantly reduces the current best ratio of Δ-1,where S is the set of sensors containingsource data,Δ is the maximal number of sensors within the transmission range of any sensor,and c is aconstant.The authors also conduct extensive simulation,the obtained results justify the improvementof proposed algorithm over the existing one. 关键词：逼近算法数据聚集无线传感网络数据采集

相关文献

参考文献（9）
引证文献（2）
耦合文献（0）

参考文献(9)

引证文献(2)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

IMPROVED ALGORITHM FOR MINIMUM DATA AGGREGATION TIME PROBLEM IN WIRELESS SENSOR NETWORKS

参考文献(9)

引证文献(2)

用户提示