4.7 Article

Data aggregation and routing in Wireless Sensor Networks: Optimal and heuristic algorithms

期刊

COMPUTER NETWORKS
卷 53, 期 7, 页码 945-960

出版社

ELSEVIER
DOI: 10.1016/j.comnet.2008.12.001

关键词

Wireless Sensor Networks; Data aggregation and routing; Exact and heuristic solutions; Hierarchical; Clustering

资金

  1. National Science Foundation [CNS-0626822, ECS-0601570]
  2. Iowa State University

向作者/读者索取更多资源

A fundamental challenge in the design of Wireless Sensor Networks (WSNs) is to maximize their lifetimes especially when they have a limited and non-replenishable energy supply. To extend the network lifetime, power management and energy-efficient communication techniques at all layers become necessary. In this paper, we present solutions for the data gathering and routing problem with in-network aggregation in WSNs. Our objective is to maximize the network lifetime by utilizing data aggregation and in-network processing techniques. We particularly focus on the joint problem of optimal data routing with data aggregation en route such that the above mentioned objective is achieved. We present Grid-based Routing and Aggregator Selection Scheme (GRASS), a scheme for WSNs that can achieve low energy dissipation and low latency without sacrificing quality. GRASS embodies optimal (exact) as well as heuristic approaches to find the minimum number of aggregation points while routing data to the Base-Station (BS) such that the network lifetime is maximized. Our results show that, when compared to other schemes, GRASS improves system lifetime with acceptable levels of latency in data aggregation and without sacrificing data quality. (C) 2008 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据