Abstract

One of the remarkable challenges about Wireless Sensor Networks (WSN) is how to transfer the collected data efficiently due to energy limitation of sensor nodes. Network coding will increase network throughput of WSN dramatically due to the broadcast nature of WSN. However, the network coding usually propagates a single original error over the whole network. Due to the special property of error propagation in network coding, most of error correction methods cannot correct more than C/2 corrupted errors where C is the max flow min cut of the network. To maximize the effectiveness of network coding applied in WSN, a new error-correcting mechanism to confront the propagated error is urgently needed. Based on the social network characteristic inherent in WSN and L1 optimization, we propose a novel scheme which successfully corrects more than C/2 corrupted errors. What is more, even if the error occurs on all the links of the network, our scheme also can correct errors successfully. With introducing a secret channel and a specially designed matrix which can trap some errors, we improve John and Yi’s model so that it can correct the propagated errors in network coding which usually pollute exactly 100% of the received messages. Taking advantage of the social characteristic inherent in WSN, we propose a new distributed approach that establishes reputation-based trust among sensor nodes in order to identify the informative upstream sensor nodes. With referred theory of social networks, the informative relay nodes are selected and marked with high trust value. The two methods of L1 optimization and utilizing social characteristic coordinate with each other, and can correct the propagated error whose fraction is even exactly 100% in WSN where network coding is performed. The effectiveness of the error correction scheme is validated through simulation experiments.

Highlights

  • Wireless Sensor Networks (WSN) suffer many constraints such as limited battery energy, low transmission rate and poor-quality links [1]

  • The reputation-based trust value will reflect the social characteristic for a node, and we can use the concepts of social networks to research the “all-or-nothing” problem of network coding in WSN

  • We propose a new framework of the network error correction for random network coding in WSN

Read more

Summary

Introduction

Wireless Sensor Networks (WSN) suffer many constraints such as limited battery energy, low transmission rate and poor-quality links [1]. With the two novel methods, John and Yi’s L1 optimization model successfully solves the error propagation problem in network coding. If a relay node in network coding, identifies which upstream nodes that can bring more “informative” packets in advance, the received packets by the sink will have more opportunities to be full rank. We use a secret channel to transmit a small amount messages in advance which will indirectly bring down the fraction of propagated errors slightly below 100% We propose a new distributed approach that establishes reputation-based trust among sensor nodes in order to identify the informative upstream sensor nodes This will help L1 optimization have more opportunities to decode successfully and it will result in short delays and high throughputs.

Network Coding and Its Fundamental Concepts
Network
Error-Correcting Model in John and Yi’s Model
The Variant of John and Yi’s Model
The Organization of Data for L1 Optimization
The Transfer Model in Non-Coherent Network
Formal Algorithm
The Notes on Algorithm 1
An Example about Algorithm 1
Compressed Header Overhead
Stastical Trust Based on the Rank of Packets in the Downstream Nodes in WSN
Collecting
Network Coding Based on Reputation-Based Trust
Experimental Section
Experiments about L1 Optimization with MATLAB
The Effect of L1 Optimization in Network Random Coding
10. Error correction
Findings
Conclusions
Full Text
Paper version not known

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.