We explore a hierarchy of techniques using realistic simulation models to address this question. We begin by considering TDMA scheduling on a single channel, ...

We investigate the tradeoff between two mutually conflicting performance objectives-throughput and delay-for fast, periodic data collection in tree-based sensor ...

This work considers how the data collection rate can be further enhanced by the use of degree-constrained routing trees and evaluates the impact of ...

We explore a hierarchy of techniques using realistic simulation models to address this question. We begin by considering TDMA scheduling on a single channel, ...

Abstract: We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree?

After that, the data collection rate no longer remains limited by interference but by the topology of the routing tree. Finally, we construct degree-constrained ...

Enhancing the Data Collection Rate of Tree-Based Aggregation in Wireless Sensor Networks. O. Durmaz, B. Krishnamachari. Research output: Chapter in Book ...

In this paper, we introduce Energy Efficient Greedy Tree based Data Aggregation (EE–GTDA) algorithm for efficient data aggregation with increased reliability ...

Using an algorithm which is able to balance the residual energy among the nodes can help the network to withstand more and consequently extend its own lifetime.

The data collection rate of the data-gathering tree produced by the proposed algorithm has been shown to be significantly higher than that of the initial tree.