Welcome to the InfoSci Platform
Diameter-Aggregation Delay Tradeoff for Data Gathering Trees in Wireless Sensor Networks

Diameter-Aggregation Delay Tradeoff for Data Gathering Trees in Wireless Sensor Networks

Natarajan Meghanathan
Copyright: © 2017 |Pages: 17
ISBN13: 9781522505013|ISBN10: 1522505016|EISBN13: 9781522505020
DOI: 10.4018/978-1-5225-0501-3.ch010
Cite Chapter Cite Chapter

MLA

Meghanathan, Natarajan. "Diameter-Aggregation Delay Tradeoff for Data Gathering Trees in Wireless Sensor Networks." Handbook of Research on Wireless Sensor Network Trends, Technologies, and Applications, edited by Narendra Kumar Kamila, IGI Global, 2017, pp. 237-253. https://doi.org/10.4018/978-1-5225-0501-3.ch010

APA

Meghanathan, N. (2017). Diameter-Aggregation Delay Tradeoff for Data Gathering Trees in Wireless Sensor Networks. In N. Kamila (Ed.), Handbook of Research on Wireless Sensor Network Trends, Technologies, and Applications (pp. 237-253). IGI Global. https://doi.org/10.4018/978-1-5225-0501-3.ch010

Chicago

Meghanathan, Natarajan. "Diameter-Aggregation Delay Tradeoff for Data Gathering Trees in Wireless Sensor Networks." In Handbook of Research on Wireless Sensor Network Trends, Technologies, and Applications, edited by Narendra Kumar Kamila, 237-253. Hershey, PA: IGI Global, 2017. https://doi.org/10.4018/978-1-5225-0501-3.ch010

Export Reference

Mendeley
Favorite

Abstract

We define the aggregation delay as the minimum number of time slots it takes for the data to be aggregated in a Data Gathering tree (DG tree) spanning all the nodes of the sensor network; the diameter of a DG tree is the maximum distance (number of hops) from a leaf node to the root node of the tree. We assume that intermediate nodes at the same level or different levels of a DG tree could simultaneously aggregate data from their respective child nodes using different CDMA (Code Division Multiple Access) codes; but, an intermediate node has to schedule non-overlapping time slots (one for each of its child nodes) to aggregate data from its own child nodes. We employ an algorithm to determine the minimum aggregation delay at every intermediate node of the Bottleneck Node Weight (BNW) and Bottleneck Link Weight (BLW)-based DG trees. We observe the BNW-DG trees to incur a smaller tree diameter, but a significantly larger aggregation delay; on the other hand, the BLW-DG trees incur a larger tree diameter and a relatively lower aggregation delay, especially with increase in node density.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.