IMPROVED ALGORITHM FOR MINIMUM DATA AGGREGATION TIME PROBLEM IN WIRELESS SENSOR NETWORKS
Jianming ZHU (1), Xiaodong HU (2)
作者信息+
(1)Graduate school of AMSS(2)AMSS,CAS
{{custom_zuoZheDiZhi}}
{{custom_authorNodes}}
{{custom_bio.content}}
{{custom_bio.content}}
{{custom_authorNodes}}
折叠
IMPROVED ALGORITHM FOR MINIMUM DATA AGGREGATION TIME PROBLEM IN WIRELESS SENSOR NETWORKS
Jianming ZHU (1), Xiaodong HU (2)
Author information+
(1)Graduate school of AMSS(2)AMSS,CAS
{{custom_zuoZheDiZhi}}
{{custom_authorNodes}}
{{custom_bio.content}}
{{custom_bio.content}}
{{custom_authorNodes}}
Collapse
文章历史+
收稿日期
修回日期
出版日期
2008-03-10
2008-09-08
2008-12-20
发布日期
2008-12-20
摘要
Wireless sensor networks promise a new paradigm for gathering data via collaboration among sensors spreading over a large geometrical region. Many applications impose delay requirements for data gathering and ask for time-efficient schedules for aggregating sensed data and sending to the data sink. In this paper, the authors study the minimum data aggregation time problem under collision-free transmission model. In each time round, data sent by a sensor reaches all sensors within its transmission range, but a sensor can receive data only when it is the only data that reaches the sensor. The goal is to find the method that schedules data transmission and aggregation at sensors so that the time for all requested data to be sent to the data sink is minimal. The authors propose a new approximation algorithm for this NP-hard problem with guaranteed performance ratio , which significantly reduces the current best ratio of , where is the set of sensors containing source data, is the maximal number of sensors within the transmission range of any sensor, and is a constant. The authors also conduct extensive simulation, the obtained results justify the improvement of proposed algorithm over the existing one.
Abstract
Wireless sensor networks promise a new paradigm for gathering data via collaboration among sensors spreading over a large geometrical region. Many applications impose delay requirements for data gathering and ask for time-efficient schedules for aggregating sensed data and sending to the data sink. In this paper, the authors study the minimum data aggregation time problem under collision-free transmission model. In each time round, data sent by a sensor reaches all sensors within its transmission range, but a sensor can receive data only when it is the only data that reaches the sensor. The goal is to find the method that schedules data transmission and aggregation at sensors so that the time for all requested data to be sent to the data sink is minimal. The authors propose a new approximation algorithm for this NP-hard problem with guaranteed performance ratio , which significantly reduces the current best ratio of , where is the set of sensors containing source data, is the maximal number of sensors within the transmission range of any sensor, and is a constant. The authors also conduct extensive simulation, the obtained results justify the improvement of proposed algorithm over the existing one.
Jianming ZHU
, Xiaodong HU . , {{custom_author.name_cn}}.
IMPROVED ALGORITHM FOR MINIMUM DATA AGGREGATION TIME PROBLEM IN WIRELESS SENSOR NETWORKS. 系统科学与复杂性(英文), 2008, 21(4): 626-636
Jianming ZHU
, Xiaodong HU . , {{custom_author.name_en}}.
IMPROVED ALGORITHM FOR MINIMUM DATA AGGREGATION TIME PROBLEM IN WIRELESS SENSOR NETWORKS. Journal of Systems Science and Complexity, 2008, 21(4): 626-636