Next Article in Journal
Solving the (n2 − 1)-Puzzle with 8/3 n3 Expected Moves
Next Article in Special Issue
Robust Rank Reduction Algorithm with Iterative Parameter Optimization and Vector Perturbation
Previous Article in Journal
Multi-Objective Design Optimization of an Over-Constrained Flexure-Based Amplifier
Article Menu

Export Article

Open AccessArticle
Algorithms 2015, 8(3), 435-458; doi:10.3390/a8030435

A Benchmarking Algorithm to Determine Minimum Aggregation Delay for Data Gathering Trees and an Analysis of the Diameter-Aggregation Delay Tradeoff

Computer Science, Jackson State University, Jackson, MS 39217, USA
Academic Editor: Erchin Serpedin
Received: 5 May 2015 / Revised: 18 June 2015 / Accepted: 23 June 2015 / Published: 10 July 2015
(This article belongs to the Special Issue Algorithms for Sensor Networks)
View Full-Text   |   Download PDF [861 KB, uploaded 10 July 2015]   |  

Abstract

Aggregation delay is the minimum number of time slots required to aggregate data along the edges of a data gathering tree (DG tree) spanning all the nodes in a wireless sensor network (WSN). We propose a benchmarking algorithm to determine the minimum possible aggregation delay for DG trees in a WSN. We assume the availability of a sufficient number of unique CDMA (Code Division Multiple Access) codes for the intermediate nodes to simultaneously aggregate data from their child nodes if the latter are ready with the data. An intermediate node has to still schedule non-overlapping time slots to sequentially aggregate data from its own child nodes (one time slot per child node). We show that the minimum aggregation delay for a DG tree depends on the underlying design choices (bottleneck node-weight based or bottleneck link-weight based) behind its construction. We observe the bottleneck node-weight based DG trees incur a smaller diameter and a larger number of child nodes per intermediate node; whereas, the bottleneck link-weight based DG trees incur a larger diameter and a much lower number of child nodes per intermediate node. As a result, we observe a complex diameter-aggregation delay tradeoff for data gathering trees in WSNs. View Full-Text
Keywords: aggregation delay; data gathering tree; diameter; wireless sensor networks; tradeoff aggregation delay; data gathering tree; diameter; wireless sensor networks; tradeoff
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Meghanathan, N. A Benchmarking Algorithm to Determine Minimum Aggregation Delay for Data Gathering Trees and an Analysis of the Diameter-Aggregation Delay Tradeoff. Algorithms 2015, 8, 435-458.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top