An aggregation point determination scheme for wireless sensor networks with multiple sinks

被引：0

作者：

Son, Jeongho ^{[1
]}

Pak, Jinsuk ^{[1
]}

Lee, Hoseung ^{[1
]}

Han, Kijun ^{[1
]}

机构：

[1] Kyungpook Natl Univ, Dept Comp Engn, Taegu 702701, South Korea

来源：

RECENT PROGRESS IN COMPUTATIONAL SCIENCES AND ENGINEERING, VOLS 7A AND 7B | 2006年 / 7A-B卷

关键词：

aggregation; in-network processing; sensor networks;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Recently, several aggregation methods have been proposed to save energy by reducing the number of transmissions from source to the sink. They assumed a single sink for aggregation of data. In this paper, we propose the way to find art aggregation point for wireless sensor networks with multiple sinks and multiple sources. It is very difficult to find an optimal aggregation point to conserve the node energy in real networks. In our scheme, each node caches the gradient information collected from its local neighbors to determine the aggregation point for merging data to be delivered to multiple sinks. Another word, we find a cross point on the multiple paths. The experimental results show that our scheme can reduce the number of transmissions and thus save the energy than other Greedy Incremental Tree and the shortest path schemes.

引用

页码：515 / 518

页数：4