Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks

@article{Huang2007NearlyCA,
  title={Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks},
  author={Scott C.-H. Huang and Pengjun Wan and Chinh T. Vu and Yingshu Li and F. Frances Yao},
  journal={IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications},
  year={2007},
  pages={366-372}
}
  • S. Huang, P. Wan, F. F. Yao
  • Published 1 May 2007
  • Computer Science
  • IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications
Data aggregation is a fundamental yet time-consuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation algorithm of least latency [1] has a latency bound of (Delta - 1)R, where Delta is the maximum degree and R is the network radius. Since both Delta and R could be of the same order of the network size, this algorithm can still have a rather high latency. In this paper, we designed an algorithm based on maximal independent sets… 
View on IEEE
cs.iit.edu
215 Citations
Highly Influential Citations
33
Background Citations
108
Methods Citations
73
Results Citations
4

Figures from this paper

215 Citations

Citation Type

Citation Type

A New Scheduling Algorithm for Reducing Data Aggregation Latency in Wireless Sensor Networks
TLDR
The simulation results show that the improved algorithm presented has much better performance in practice than previous works and has a latency bound of 16R + Δ – 11, where Δ is the maximum degree and R is the network radius.
Near optimal scheduling of data aggregation in wireless sensor networks
Approaching the Optimal Schedule for Data Aggregation in Wireless Sensor Networks
TLDR
This study designs a scheduling algorithm, Peony-tree-based Data Aggregation (PDA), which has a latency bound of 15R + Δ - 15, where R is the network radius (measured in hops) and Δ is the maximum node degree.
Fast Aggregation Scheduling in Wireless Sensor Networks
TLDR
It is proved that the latency of FAST under the protocol interference model is upper-bounded by 12R + Δ - 2, where R is the network radius and Δ is the maximum node degree in the communication graph of the original network.
Efficient Time Latency of Data Aggregation Based on Neighboring Dominators in WSNs
TLDR
This paper proposes a new scheduling strategy, based on Neighboring Dominators, to minimize the time latency in data aggregation, and mathematically proves that the upper bound of delay time in Data Aggregation is at most 12R+A-11.
Distributed Data Aggregation Scheduling in Wireless Sensor Networks
TLDR
To the best of the knowledge, the proposed algorithm is the first distributed algorithm for data aggregation scheduling, and an adaptive strategy for updating the schedule when nodes fail or new nodes join in a network is proposed.
An improved approximation algorithm for data aggregation in multi-hop wireless sensor networks
TLDR
An efficient distributed method that produces a collision-free schedule for data aggregation in WSNs and proves that the latency of the aggregation schedule generated by the algorithm is at most 16<i>R</i>+Δ--14 time-slots, where R is the network radius and Δ is the maximum node degree in the communication graph of the original network.
Improved minimum latency aggregation scheduling in wireless sensor networks under the SINR model
TLDR
This paper proposes a centralised algorithm to aggregate data from all sources in Olog²n time slots where n is the total number of nodes and uses round scheduling, topology construction and non-linear power assignment as the main techniques.
Efficient Data Aggregation in Multi-Hop WSNs
TLDR
This paper considers a single one-off query which requires a subset of source nodes V to send data to a distinguished sink node, and proposes a delay-efficient algorithm that produces a collision-free schedule and theoretically proves that the delay achieved by the algorithm is nearly a small constant factor of the optimum.
Efficient scheduling for minimum latency aggregation in wireless sensor networks
  • J. Gagnon, L. Narayanan
  • Computer Science
    2015 IEEE Wireless Communications and Networking Conference (WCNC)
  • 2015
TLDR
The results show that both the new scheduling algorithms when combined with the new tree-building algorithm obtain significantly lower latencies than that of the previous best algorithm.
...
...

References

SHOWING 1-10 OF 27 REFERENCES
The impact of data aggregation in wireless sensor networks
TLDR
This paper model data-centric routing and compare its performance with traditional end-to-end routing schemes, and examines the complexity of optimal data aggregation, showing that although it is an NP-hard problem in general, there exist useful polynomial-time special cases.
Impact of network density on data aggregation in wireless sensor networks
TLDR
The preliminary results suggest that, under investigated scenarios, greedy aggregation can achieve up to 45% energy savings over opportunistic aggregation in high-density networks without adversely impacting latency or robustness.
Energy-latency tradeoffs for data gathering in wireless sensor networks
TLDR
An on-line distributed protocol that relies only on the local information available at each sensor node within the aggregation tree, and a pseudo-polynomial time approximation algorithm based on dynamic programming are developed.
Minimum Data Aggregation Time Problem in Wireless Sensor Networks
TLDR
This paper designs a (Δ–1)-approximation algorithm for MDAT problem, where Δ equals the maximum number of sensors within the transmission range of any sensor, and proves that this problem is NP-hard even when all sensors are deployed a grid.
Minimizing broadcast latency and redundancy in ad hoc networks
TLDR
It is shown that minimum latency broadcasting is NP-complete for ad hoc networks and a simple distributed collision-free broadcasting algorithm for broadcasting a message is presented.
Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks
  • A. Kesselman, D. Kowalski
  • Computer Science
    Second Annual Conference on Wireless On-demand Network Systems and Services
  • 2005
A low-latency and energy-efficient algorithm for convergecast in wireless sensor networks
TLDR
This paper proposes a heuristic solution for the problem of minimum energy convergecast which also works toward minimizing data latency and results show that this algorithms performance for broadcasting is better compared to other broadcast techniques.
Radial coordination for convergecast in wireless sensor networks
TLDR
This work investigates the problem of packet loss in the convergecast process in wireless sensor networks due to congestion and collisions near the sink, and proposes a simple yet powerful coordinated convergecast protocol for achieving high convergecast reliability.
On tree-based convergecasting in wireless sensor networks
TLDR
A heuristic algorithm is proposed (convergecasting tree construction and channel allocation algorithm (CTCCAA), which constructs a tree with schedules assigned to nodes for collision free convergecasting, and is capable of code allocation in case multiple codes are available to minimize the total duration required for convergecasting.
Reliable bursty convergecast in wireless sensor networks
TLDR
This work designs a window-less block acknowledgment scheme that guarantees continuous packet forwarding and replicates the acknowledgment for a packet, and designs mechanisms to handle varying ack-delay and to reduce delay in timer-based re-transmissions.
...
...