Minimizing Delay and Transmission Times with Long Lifetime in Code Dissemination Scheme for High Loss Ratio and Low Duty Cycle Wireless Sensor Networks

Wei Qi, Wei Liu, Xuxun Liu, Anfeng Liu, Tian Wang, Neal N. Xiong, Zhiping Cai

TL;DR

This paper tackles the challenge of efficiently updating software on wireless sensor networks (WSNs) that suffer from unreliable communication and low power usage. They introduce three novel algorithms (IFAS, BTAS, and AAPS) that significantly reduce data dissemination delay and transmission times without sacrificing network lifetime, a crucial improvement over existing methods that often involve performance trade-offs.

What Problem Does This Paper Address?

Wireless Sensor Networks (WSNs) are becoming increasingly important for the Internet of Things (IoT), enabling data collection and processing in diverse environments. A key aspect of managing these networks is the ability to update their functionality by disseminating new "soft code" to the sensor nodes. This is particularly relevant with the rise of Software-Defined Networking (SDN), which allows for dynamic network reconfiguration. However, disseminating this code in WSNs presents significant challenges:

  • High Loss Ratio: Wireless communication is inherently unreliable, with a substantial packet loss rate, especially in hostile environments. This necessitates retransmissions, increasing delay and energy consumption.
  • Low Duty Cycle: To conserve battery life, sensor nodes operate on a duty cycle, meaning they spend most of their time in a low-power sleep mode and only wake up for short periods to transmit or receive data. This intermittent connectivity introduces significant delays, as a sender must wait for a receiver to be awake.
  • Minimizing Delay and Transmission Times: For many applications, such as real-time monitoring, a low dissemination delay is critical. Simultaneously, reducing the number of transmissions is vital for conserving energy and extending network lifetime.
  • Optimizing Multiple Performance Metrics: Existing code dissemination schemes often achieve a trade-off, improving one metric (e.g., delay) at the expense of another (e.g., transmission times or lifetime). The goal is to optimize all these metrics simultaneously.

Methods

The paper proposes three novel algorithms that build upon each other to address the aforementioned challenges:

  • If Fail Add Slot (IFAS): This is the foundational algorithm. It leverages the broadcasting nature of wireless communication by allowing nodes that fail to receive a packet to attempt reception again when their "brother" nodes (nodes with the same parent) wake up. This avoids waiting for a full cycle and reduces delay and transmission times without increasing energy consumption.
  • Before Try Add Slot (BTAS): This algorithm builds on IFAS. It specifically addresses the issue of nodes that wake up last in a cycle. BTAS intelligently adds awake slots for these nodes by utilizing the energy surplus found in nodes further from the sink. This further improves performance, especially for nodes that are last in line to receive data.
  • Add Average Place Slot (AAPS): This is the most advanced algorithm. It further optimizes performance by adding awake slots strategically, aiming to cover the entire working cycle. This significantly reduces empty delay (the time between the parent being ready and the first transmission attempt) and transmission delay. AAPS aims for simultaneous optimization of delay, transmission times, and lifetime.

The core innovation across these algorithms lies in intelligently managing node awake slots and exploiting the broadcasting capabilities of WSNs to overcome the limitations imposed by low duty cycles and high loss rates.

Datasets

Not discussed in the paper. The paper focuses on theoretical analysis and simulation-based experiments using a defined network model.

Key Insights and Ideas

  • Exploiting Broadcasting is Key: The paper strongly emphasizes that the inherent broadcasting capability of wireless communication is underutilized in traditional methods. By allowing multiple nodes to receive a broadcast simultaneously, transmission times can be drastically reduced.
  • Energy Surplus for Optimization: Nodes further from the sink often have surplus energy. This energy can be strategically used to add awake slots, improving performance without negatively impacting network lifetime.
  • Interdependence of Performance Metrics: The research highlights that delay, transmission times, and lifetime are interconnected. Optimizing one often affects the others, and the proposed algorithms aim to find a sweet spot for all.
  • The "Last Node" Problem: Nodes that wake up last in a cycle are particularly challenging to serve efficiently. BTAS directly addresses this by reallocating slots to ensure these nodes are not left behind.
  • Slot Distribution Matters: The way awake slots are distributed significantly impacts performance. AAPS aims for an optimal distribution to minimize delay.

Key Results

The paper presents significant improvements over traditional methods:

  • Delay Reduction:
    • IFAS: 20.56% reduction
    • BTAS: 31.59% reduction
    • AAPS: 55.16% reduction
  • Transmission Time Reduction:
    • IFAS: 29.53% reduction
    • BTAS: 43.93% reduction
    • AAPS: 42.04% reduction
  • Lifetime: The proposed methods do not reduce network lifetime. In some cases, especially with AAPS, energy is consumed in areas with surplus energy, potentially extending lifetime.
  • All-Round Optimization: The key achievement is the ability to optimize delay, transmission times, and lifetime simultaneously, a feat not accomplished by previous schemes that relied on trade-offs.

Limitations and Future Work

  • Idealized Network Model: The theoretical analysis and simulations are based on a specific network model (e.g., nodes evenly distributed in a circular region). Real-world WSN deployments might exhibit different topologies and node distributions, which could affect performance.
  • Energy Consumption Nuances: While the paper claims lifetime is not reduced, the exact energy consumption dynamics, especially with the added slots in AAPS, might require more detailed analysis in diverse scenarios.
  • Parameter Sensitivity: The performance of the algorithms is dependent on parameters like Ptrans (single transmission success rate) and Pth (total success rate threshold). Further investigation into the robustness of the algorithms across a wider range of these parameters would be beneficial.
  • Future Work: The authors suggest that further research could explore these algorithms in more complex network environments and with different types of sensor nodes and applications. The potential for dynamic adaptation of slot allocation based on real-time network conditions could also be a promising avenue.

Summary updated

BibTeX
@inproceedings{qi2018minimizing,
  author = {Wei Qi and Wei Liu and Xuxun Liu and Anfeng Liu and Tian Wang and Neal N. Xiong and Zhiping Cai},
  title = {{Minimizing Delay and Transmission Times with Long Lifetime in Code Dissemination Scheme for High Loss Ratio and Low Duty Cycle Wireless Sensor Networks}},
  booktitle = {Sensors},
  year = {2018},
  url = {https://openreview.net/forum?id=onF4NUpqt9ZY},
}

Loading related content...

Figure