Impact of Network Density on Data Aggregation in Wireless Sensor Networks

Chalermek Intanagonwiwat, Deborah Estrin, Ramesh Govindan, and John Heidemann
USC/Information Sciences Institute

Abstract

In-network data aggregation is essential for wireless sensor networks where resources (e.g., bandwidth, energy) are limited. In a previously proposed data dissemination scheme, data is opportunistically aggregated at the intermediate nodes on a low-latency tree which may not necessarily be energy efficient. A more energy-efficient tree is a greedy tree which can be incrementally constructed by connecting each source to the closest point of the existing tree. In this paper, we propose a greedy approach for constructing a greedy aggregation tree to improve path sharing. We evaluated the performance of this greedy approach by comparing it to the prior opportunistic approach. Our preliminary result suggests that although the greedy aggregation and the opportunistic aggregation are roughly equivalent at low-density networks, the greedy aggregation can achieve signficant energy savings at higher densities. In one experiment we found that the greedy aggregation can achieve up to 45% energy savings over the opportunistic aggregation without an adverse impact on latency or robustness.

Availability

This paper is available in several formats: abstract web page with pointers and cites, PDF, paper copies can be obtained by mail to the authors. Copyright terms for this paper appear below.

Reference

Intanagonwiwat01b
Chalermek Intanagonwiwat, Deborah Estrin, Ramesh Govindan, and John Heidemann. Impact of Network Density on Data Aggregation in Wireless Sensor Networks. Technical Report 01-750, University of Southern California Computer Science Department, November, 2001. <http://www.isi.edu/~johnh/PAPERS/Intanagonwiwat01b.html>.
@techreport{Intanagonwiwat01b,
	author = "Chalermek Intanagonwiwat and Deborah Estrin
 and Ramesh Govindan and John Heidemann",
	title = "Impact of Network Density on Data Aggregation in Wireless Sensor Networks",
	institution = "University of Southern California Computer Science Department",
	year = "2001",
	number = "01-750",
	month = "November",
	keywords = "diffusion, greedy vs. opportunistic aggregation",
	otherurl = "ftp://ftp.usc.edu/pub/csinfo/tech-reports/papers/01-750.pdf",
	url = "http://www.isi.edu/~johnh/PAPERS/Intanagonwiwat01b.html",
	pdfurl = "http://www.isi.edu/~johnh/PAPERS/Intanagonwiwat01b.pdf",
}

Copyright

This paper is copyright © 2001 by its authors. Permission to make digital or hard copies of part or all of this work for personal use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that new copies bear this notice and the full citation on the first page. Abstracting with credit is permitted.

To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission of the authors.