1 / 17

Jae Weon Choi Graduate School of Convergence IT

CRT Based Forwarding A Novel Reliable and Energy-Saving Forwarding Technique for Wireless Sensor Networks. Jae Weon Choi Graduate School of Convergence IT. Multi Path Routing. Reliable Information Fowarding using Multiple Paths in Sensor Networks (LCN 2003)

tuvya
Download Presentation

Jae Weon Choi Graduate School of Convergence IT

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CRT Based ForwardingA Novel Reliable and Energy-Saving Forwarding Technique for Wireless Sensor Networks Jae Weon Choi Graduate School of Convergence IT

  2. Multi Path Routing • Reliable Information Fowarding using Multiple Paths in Sensor Networks (LCN 2003) • Trade-Off between Traffic Overhead and Reliability in Multipath Routing for Wireless Sensor Networks(WCNC 2003) • On the Use of Chinese Remainder Theorem for Energy Saving in Wireless Sensor Networks(IEEE 2008) • A Novel Reliable and Energy-Saving Forwarding Technique for Wireless Sensor Networks (MobiHoc 2009)

  3. Motivation • Limited Battery supply • Duty Cycling (Sleep/Wake) • In-Network Aggregation • Aimed at Reducing Number of Transmission • Multi-Path Algorithm is Used to improve Reliability • However, Multi-Path Algorithm Consume more Energy • Technique proposed aims to reduce this Energy Consumption

  4. Multi Path Protocols • ReInForM (Reliable Information Forwarding using Multiple Paths in Sensor Networks) • Sending Multiple copy of a same Packet along multiple paths • Problems: • Extremely Costly in terms of Energy • Disjoint Multipath Routing • Splitting Data according to number of Multipath • Problems: • Route discovery mechanism is needed • Number of splits are limited (disjoint paths are limited)

  5. Chinese Remainder Theorem (CRT) • For given Number (N) Primes Pi, which is greater than 1, • And when i is ∈ {1...N} • For any set of given integers {m1,m2, ...,mN} • There Exists Unique Interger m, which is smaller than M (product of Pis) • And m has simultaneous congruencies m = mi (mod pi) • (mod M) • And ci = Qiqi, where Qi = M / Pi and qi solves qiQi = 1 (mod pi)

  6. CRT Example • http://www.youtube.com/watch?v=3PkxN_r9up8 • M = 792 • Q1 = 99, Q2 = 88, Q3 = 72 • q1 = 3, q2 = -5, q3 = 2 • c1 = 297, c2 = -176, c3 = 144 • 891 + (-440) + 576 = 1027 • m = 1027 - 792 = 235 • mi: 4 bit, m: 8bit

  7. CRT Example • M = 105 • Q1 = 35, Q2 = 21, Q3 = 15 • q1 = 2, q2 = 1, q3 = 1 • c1 = 70, c2 = 21, c3 = 15 • 70 + 84 + 15 = 169 • m = 169 - 105 = 64 • mi: 3 bit, m: 7bit

  8. Metrics for Energy Efficiency • MERF (Maximum Energy Reduction Factor) • MERF = w − wCRTmax / w • ERF (Expected Energy Reduction Factor) • ERF = ESP − ECRT / ESP = 1 − (ncwcrt / npw) • ncand np are mean number of Forwarded packet • W = number of bits per whole packet • wcrt = mean number of bits representing CRT Component

  9. Choice of Prime Numbers • As long as pi is greater than 1 and less than N, and • As long as m is less than M, the pi can be anything • But for the sake of energy Saving smallest possible set of Prime number is used • This set is called Minimum Primes Set (MPS) • For Example, • If N = 4 and M > 2W, where w = 40 • MPS will be {1019, 1021, 1031, 1033}

  10. Choice of Prime Numbers (Cont.) • Primes Sets with Admissible Failure • There may be a case when one or more CRT Component fails to reach Sink • In order to prevent this Proposed Forwarding Algorithm implement Admissible Failure • primes set {10313, 10321, 10331, 10333} is a MPS that will successfully combined even if one component did not arrive. • This is called MPS-1, like wise MPS can be adjusted to have more Admissible Failure (MPS-f, where f is number of Admissible Failure)

  11. Fowarding Algorithm • Two Phases • Initialization Phase • Forwarding Phase

  12. Topological Change • In case a node dies out, or a new node is added

  13. Performance Evaluation • MATLAB Simulator • GridSize = [300m x 300m] • Node density p = 0.03 • Less mean disconnect, greater produced almost same result as p = 0.03 • Each nod has unique address assigned during Initiation phase • Transmission rage = 60 m • Event happens randomly at CLID (TX) => 5 • Every node within 20 m radius of event send message • Simulation neglect the effect of collision and Retransmission at MAC layer

  14. Performance Evaluation(1) • Number of CRT Component per size of Original Packet

  15. Performance Evaluation(2) • Impact of number of Admissible Failure (f)

  16. Performance Evaluation(3) • Comparison of Number of Bits forwarded by CLID = 2 nods

  17. Conclusion • Splitting of the original messages in several packets, so that the network will only forward smaller packet • Since energy consumption of nods is proportional to bit received and forwarded, energy consumption can be significantly reduced, and • Consequently increase life time of network

More Related