Differentiated Data Aggregation Routing Scheme for Energy Conserving and Delay Sensitive Wireless Sensor Networks

Xujing Li, Wei Liu, Mande Xie, Anfeng Liu, Ming Zhao, Neal N. Xiong, Miao Zhao, Wan Dai

TL;DR

This paper introduces a novel "Differentiated Data Aggregation Routing" (DDAR) scheme for wireless sensor networks (WSNs) that intelligently routes data based on its delay sensitivity, aiming to balance energy efficiency and timely delivery. An improved DDAR scheme further optimizes performance by leveraging residual energy in distant nodes, leading to significant improvements in service guarantee rate, network lifetime, and energy efficiency.

What Problem Does This Paper Address?

Wireless Sensor Networks (WSNs) are increasingly vital in industrial applications, but they face a fundamental challenge: balancing energy efficiency with the need for timely data delivery. Traditional data aggregation methods often treat all data equally, leading to either excessive energy consumption to meet strict delay requirements for all data, or unacceptable delays for time-sensitive information. This is particularly problematic in industrial settings where different sensors generate data with varying Quality of Service (QoS) requirements, such as strict delay constraints for critical control systems versus more lenient requirements for environmental monitoring. The paper addresses this by proposing a differentiated approach to data aggregation routing.

Methods

The core of the proposed solution is the Differentiated Data Aggregation Routing (DDAR) scheme. DDAR operates in several phases:

  • Service Tag Configuration: Aggregators identify their "service tag" based on the most frequent service requirement of nearby sensors. This tag categorizes the aggregator based on the type of data it's best suited to handle.
  • Aggregation Parameter Configuration (N<sub>t</sub> and T<sub>t</sub>): Based on the service tag, aggregators configure their packet aggregation threshold (N<sub>t</sub>) and aggregation timer (T<sub>t</sub>). These parameters are crucial for controlling the aggregation process and are dynamically set to match the QoS requirements of the data.
  • Sensor-Aggregator Routing: Sensors choose an aggregator that best matches their data's service requirement, prioritizing those with an identical service tag. If no exact match is found, they select aggregators with better or worse service tags based on availability and proximity.
  • Aggregator-Aggregator Routing: Aggregators then select their next hop (another aggregator closer to the sink) based on matching service tags. This ensures that data flows through a path optimized for its specific delay sensitivity.
  • Service Tag Rotation: To balance energy consumption across the network, aggregators periodically rotate their service tags, ensuring that all nodes contribute to handling different types of traffic over time.

An improved DDAR scheme is also introduced. This enhancement focuses on nodes farther from the sink, which often have residual energy. By reducing the aggregation threshold (N<sub>t</sub>) and timer (T<sub>t</sub>) for these nodes, the aggregation frequency is increased, further improving energy efficiency and reducing delay without significantly impacting network lifetime.

Datasets

Not discussed in the paper. The paper relies on simulations to evaluate its proposed schemes.

Key Insights and Ideas

  • Differentiated QoS is Key: The fundamental insight is that not all data in a WSN has the same delay tolerance. Treating them differently is crucial for optimizing both energy and performance.
  • Service Tags as a Unifying Concept: Using "service tags" on aggregators provides a simple yet effective way to categorize and route data based on its QoS requirements, simplifying the complex task of differentiated service in WSNs.
  • Dynamic Parameter Tuning: The ability to dynamically adjust aggregation parameters (N<sub>t</sub>, T<sub>t</sub>) based on service requirements is a powerful mechanism for achieving differentiated QoS.
  • Leveraging Residual Energy: The improved DDAR scheme's strategy of utilizing residual energy in distant nodes by increasing aggregation frequency is a clever way to boost overall network efficiency.
  • Trade-offs are Inevitable: While the paper focuses on optimization, it implicitly highlights the inherent trade-offs between energy, delay, and network lifetime, which DDAR aims to manage more effectively.

Key Results

The paper presents simulation results demonstrating the effectiveness of DDAR and its improved version:

  • DDAR vs. CDAR (Common Data Aggregation Routing):
    • Service guarantee rate increased by an average of 25.01%.
  • Network lifetime increased by 55.45%.
  • Energy efficiency increased by 83.99%.
  • Improved DDAR:
    • Further improved service guarantee rate by 10.11%.
  • Further improved energy efficiency by 33.97%.
  • Achieved these improvements without degrading network lifetime.
  • The performance is significantly influenced by the average difference in service requirements within the network. Larger differences lead to better optimization.
  • The proportion of aggregators (η) also plays a role, with higher proportions generally leading to better optimization.

Limitations and Future Work

  • Simulation-Based: The results are based on simulations, and real-world deployment might reveal different challenges.
  • Homogeneous Aggregators: The model assumes homogeneous aggregators in terms of energy. Future work could explore heterogeneous scenarios.
  • Scalability: While the paper mentions complexity analysis, extensive testing on very large-scale networks might be beneficial.
  • Dynamic Environment Changes: The current scheme assumes relatively static service requirements. Adapting to dynamic changes in QoS needs or network topology could be a future research direction.
  • Exploration of Other QoS Metrics: While delay and energy are primary, exploring other QoS aspects like reliability and security in a differentiated manner could be valuable.

Summary updated

Abstract

Data aggregation is a widely adopted method to effectively reduce the data transmission volume and improve the lifetime of wireless sensor networks (WSNs). In the data aggregation networks, some parameters directly determine the delay of aggregation. In industrial applications, the data generated by different sensors have different requirements for delay or other QoS performance. In the previous study, a common strategy is that all kinds of data is aggregated into one frame when the condition is satisfied with a QoS requirement, which causes excessive energy consumption and severely impairs the lifetime of network. A Differentiated Data Aggregation Routing (DDAR) scheme is proposed to reduce energy consumption and guarantee that the delay could be controlled within the corresponding QoS requirement constraint. The primary contributions of the DDAR scheme are the following: (a) The DDAR scheme makes data with different QoS requirement route to the sink along the different paths. The parameters of the aggregators in each path, such as aggregation deadline ( T t ) and the aggregation threshold ( N t ), are configured according to the QoS requirements. Accordingly, energy consumption can be reduced without degrading the performance of data transmission. (b) Based on DDAR scheme, an improved DDAR scheme is proposed to further improve performance through fully utilize the residual energy in the nodes which are far from the sink. The frequency of aggregation of these nodes increases by reducing the value of T t and N t so as to further improve the energy efficiency and reduce delay. Simulation results demonstrate that compared with the previous scheme, this scheme reduces the delay by 25.01%, improves the lifetime by 55.45%, and increases energy efficiency by 83.99%. The improved DDAR scheme improves the energy efficiency by 33.97% and service guarantee rate by 10.11%.
BibTeX
@inproceedings{li2018differentiated,
  author = {Xujing Li and Wei Liu and Mande Xie and Anfeng Liu and Ming Zhao and Neal N. Xiong and Miao Zhao and Wan Dai},
  title = {{Differentiated Data Aggregation Routing Scheme for Energy Conserving and Delay Sensitive Wireless Sensor Networks}},
  booktitle = {Sensors},
  year = {2018},
  url = {https://openreview.net/forum?id=IzrTZrtViS},
}

Loading related content...

Figure