Abstract

Similar to traditional wireless sensor networks (WSN), the nodes only have limited memory and energy in low-duty-cycle sensor networks (LDC-WSN). However, different from WSN, the nodes in LDC-WSN often sleep most of their time to preserve their energies. The sleeping feature causes serious data transmission delay. However, each source node that has sensed data needs to quickly disseminate its data to other nodes in the network for redundant storage. Otherwise, data would be lost due to its source node possibly being destroyed by outer forces in a harsh environment. The quick dissemination requirement produces a contradiction with the sleeping delay in the network. How to quickly disseminate all the source data to all the nodes with limited memory in the network for effective preservation is a challenging issue. In this paper, a low-latency and energy-efficient data preservation mechanism in LDC-WSN is proposed. The mechanism is totally distributed. The data can be disseminated to the network with low latency by using a revised probabilistic broadcasting mechanism, and then stored by the nodes with LT (Luby Transform) codes, which are a famous rateless erasure code. After the process of data dissemination and storage completes, some nodes may die due to being destroyed by outer forces. If a mobile sink enters the network at any time and from any place to collect the data, it can recover all of the source data by visiting a small portion of survived nodes in the network. Theoretical analyses and simulation results show that our mechanism outperforms existing mechanisms in the performances of data dissemination delay and energy efficiency.

Highlights

  • Wireless sensor networks (WSN) are kinds of ad hoc networks, which are always deployed in harsh environments and with large amounts of autonomous nodes to perform specified tasks, such as environment monitoring and target tracking

  • There are two challenges that exist in each round of data preservation: (1) how can a source node disseminate its message or data to all the nodes in LDC-WSN with low latency in the data production phase and the data dissemination and storage phase? and (2) how can every node with limited memory save more data in the data dissemination and storage phase so that a mobile sink can recover all the source data after visiting as few as possible survival nodes in the data collection phase?

  • Our problem is how to design a distributed, energy-efficient and fast data preservation mechanism for which all source nodes can disseminate their messages or data to all the nodes in LDC-WSN with low latency, and the data can be stored by all the nodes effectively so that a mobile sink can recover them after visiting as few as possible survival nodes

Read more

Summary

Introduction

Wireless sensor networks (WSN) are kinds of ad hoc networks, which are always deployed in harsh environments and with large amounts of autonomous nodes to perform specified tasks, such as environment monitoring and target tracking. In an LDC-WSN, the nodes keep sleeping most of the time They can effectively save their energy and work for a very long. Each source node that has sensed data always wants to disseminate its data to other nodes in the network for preservation as quickly as possible. It is a challenging issue that all of the source data can be quickly disseminated to all nodes in LDC-WSNs. it is a challenge that the data can be effectively stored at the nodes with limited memory. It considers the sleeping feature of the nodes in LDC-WSN and uses a revised probabilistic broadcasting mechanism to disseminate the data.

Related Work
Feature Projection Based Mechanisms
Network Coding Based Mechanisms
Random Linear Codes Based Mechanisms
Fountain Codes Based Mechanisms
System Model
Problem Statement
Basic Idea
Data Dissemination Mechanism
LT Codes
Algorithm Description
Time Complexity
Energy Consumption
Latency of Data Dissemination
Decoding Performance in a Small-Scale Network
Simulations
Comparison of Decoding Performance
Comparison
Findings
Conclusions

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.