期刊
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
卷 70, 期 9, 页码 953-961出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jpdc.2010.05.009
关键词
Data aggregation; Cooperative communications; Energy efficiency; Wireless sensor networks; Lifetime
资金
- National Grand Fundamental Research 973 Program of China [2006CB303-006]
- National Science Foundation of China [60803116]
- China Postdoctoral Science Foundation [200902298, 20080430103]
- Chinese Academy of Science
- Chinese Universities Scientific Fund
Recently, cooperative communication mechanism is shown to be a promising technology to improve the transmit diversity only by a single transceiver antenna. Using this communication paradigm, multiple source nodes are able to coordinate their transmissions so as to obtain energy savings. As data aggregation is one of the most important operations in wireless sensor networks, this paper studies the energy-efficient data aggregation problem through cooperative communication. We first define the cooperative data aggregation (CDA) problem, and formally prove that this problem is NP-Hard. Due to the difficult nature of this problem, we propose a heuristic algorithm MCT for cooperative data aggregation. The theoretical analysis shows that this algorithm can reach the approximate performance ratio of 2. Moreover, the distributed implementation DMCT of the algorithm is also described. We prove that both centralized and distributed algorithms can construct the same topology for cooperative data aggregation. The experimental simulations show that the proposed algorithms will decrease the power consumption by about 12.5% and 66.3% compared with PEDAP and PEGASIS algorithms respectively. Crown Copyright (C) 2010 Published by Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据