An effective data collection algorithm for wireless sensor network

被引:0
作者
Yu Lasheng
Li Jie
Liu Renjie
机构
[1] Central South University,School of Information Science and Engineering
[2] University of Tsukuba,Department of Computer Science, Graduate School of Systems and Information Engineering
来源
Computing | 2013年 / 95卷
关键词
Energy efficiency; Wireless sensor network; Data collection tree; Merging algorithm; 68;
D O I
暂无
中图分类号
学科分类号
摘要
This paper proposes an effective subtree merging based data collection algorithm for wireless sensor networks (WSNs), named as SMDC algorithm, which can be applied in a new kind of applications in WSNs, i.e., area query application. The SMDC algorithm can prevent unnecessary energy consumption in ancestor nodes for routing through the union of disjoint sets for different subtrees in the network. The SMDC algorithm includes four phases. Firstly the cluster trees are constructed respectively in the target area. Then the disjoint node sets for each subtrees will be found; thirdly the disjoint subtrees are connected via the closest node between two subtrees; and the last phase is to disconnect the subtrees which have been connected to a new tree branch from their previous tree structure. This paper also presents the simulation to compare the SMDC algorithm with some related works including conventional minimum spanning tree algorithm. Simulation results show that the SMDC algorithm can reduce the redundant energy consumption and the number of hops which results in the reduction of total energy consumption. Especially, it is more efficient as the number of sensor nodes in a target area increases.
引用
收藏
页码:723 / 738
页数:15
相关论文
共 27 条
  • [1] Yick J(2008)Wireless sensor network survey Comp Netw 52 2292-2330
  • [2] Mukherjee B(2006)A survey of energy-efficient scheduling mechanisms in sensor networks Mobile Netw Appl 11 723-740
  • [3] Ghosal D(2006)In-network aggregation trade-offs for data collection in wireless sensor networks Int J Sens Netw 1 200-212
  • [4] Wang L(2004)Balancing energy efficiency and quality of aggregate data in sensor networks Int J Very Large Data Bases 13 384-403
  • [5] Xiao Y(2002)The Cougar approach to in-network query processing in sensor networks SIGMOD Record 31 9-18
  • [6] Solis I(2003)The cougar project: a work-in-progress report SIGMOD Record 32 53-59
  • [7] Obraczka K(2005)TinyDB: an acquisitional query processing system for sensor networks ACM TODS 30 127-173
  • [8] Sharaf ALPKCMA(2009)Distributed algorithms for constructing approximate minimum spanning trees in wireless sensor networks IEEE Trans Parallel Distrib Syst 20 124-139
  • [9] Beaver J(2011)EECDA: energy efficient clustering and data aggregation protocol for heterogeneous wireless sensor networks Int J Comp Commun Control 6 113-124
  • [10] Yao Y(2010)Maximizing the lifetime of wireless sensor networks with mobile sink in delay-tolerant applications IEEE Trans Mobile Comput 9 1308-1318