1 / 25

RID: Radio Interference Detection in Wireless Sensor Networks

RID: Radio Interference Detection in Wireless Sensor Networks. Gang Zhou, Tian He, John A. Stankovic, Tarek F. Abdelzaher Computer Science Department, University of Virginia March 2005. Outline. Motivation, State of the Art, and Contributions Radio Interference Detection Protocols

chavi
Télécharger la présentation

RID: Radio Interference Detection in Wireless Sensor Networks

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. RID: Radio Interference Detection in Wireless Sensor Networks Gang Zhou, Tian He, John A. Stankovic, Tarek F. Abdelzaher Computer Science Department, University of Virginia March 2005

  2. Outline • Motivation, State of the Art, and Contributions • Radio Interference Detection Protocols • RID protocol • RID-B protocol • Using Radio Interference Detection in TDMA Designs • Conclusions and Future Work

  3. A’s Comm. Range A C B D A D B C Case B: Not Bandwidth Efficient Case A: Not Collision Free Motivation • Use Communication Topology as the Basis of TDMA Designs • One popular example: • Assume collision free by allowing one node, within two communication hops, to transmit packets at a time. • Using Communication Topology is Misleading How about K hops communication topology? We Need to Detect Radio Interference! K needs to be > 2 ! K needs to be < 2 !

  4. State of the Art • Communication Topology is Widely used as the Design Basis of TDMA Protocols • In MANET: NAMA protocol [Bao and Garcia-Luna-aceves 2001] • In WSN: TRAMA protocol [Rajendran et al. 2003] • Pervasive Existence and Complexity of Radio Interference are Reflected in Recent WSN Experiments: • Shadowing Phenomena [Woo et al. 2004] • Radio irregularity [Zhou et al. 2004] • Packet delivery performance [Zhao and Govindan 2003] • Reliable multihop routing [Woo et al. 2003] • Connectivity assessment tool [Cerpa et al. 2003]

  5. Contributions • To the best of our knowledge, our protocols, RID and RID-B, are the first to detect radio interference topology in runtime systems • Apply radio interference detection in TDMA design (take NAMA as a case study) • NAMA-RID-B keeps 100% packet delivery ratio • In heavy load, NAMA can have packet loss up to 60% • Analyze the application of radio interference detection in backoff algorithms. • (See paper for detail) • Study the relationship between communication range and interference range in MICA2 devices, in both strong link case and weak link case. • (See paper for detail)

  6. Range 1 Range 2 ND HD C A HD ND B • RID Phases: • HD-ND Detection • Information Sharing • Interference Calculation RID Protocol Range 1: A’s High Sending Power Communication Range Range 2: A’s Normal Sending Power Interference Range

  7. RID Protocol • System wide solution: • Random back off

  8. RID Protocol • System wide solution: • Random back off • Add-on rule Condition A: Stable power level during T1 Condition B: Stable low power level (background noise power) during T2

  9. RID Protocol • System wide solution: • Random back off • Add-on rule Condition A: Stable power level during T1 Condition B: Stable low power level (background noise power) during T2

  10. RID Protocol • System wide solution: • Random back off • Add-on rule Condition A: Stable power level during T1 Condition B: Stable low power level (background noise power) during T2

  11. RID Protocol • System wide solution: • Random back off • Add-on rule • Multi-round Detections

  12. RID Phases: • HD-ND Detection • Information Sharing • Interference Calculation Interference_In Table Interference_Out Table Interference_HTP Table This Phase generates two more tables Record: Who can interfere with one of my neighbors and how much it is Record: Who can interfere with me and how much it is Record: Who I can interfere with and how much it is

  13. (1) (2) • RID Phases: • HD-ND Detection • Information Sharing • Interference Calculation • Goal: Figure out All Collision Cases by Local Calculation • Basic Step: • Calculate possible interference cases at receiver D, when there are only two simultaneous transmitters • (1) Node i1’s signal can be disturbed by node i2’s signal • (2) Without interference, node i1’s signal is able to be received by node D

  14. (1) (2) (3) Interference Calculation --- Extension Step • Extension: How about k simultaneous transmitters? • (1)Node i1’ signal can be disturbed by the sum of node set {i2, ……, ik} • (2)Without interference, node i1’s signal is able to be received by node D • (3) Any proper subset of node set {i2, ……, ik}can not generate enough interference

  15. Interference Calculation --- Properties • Two interesting properties of : Has no Redundancy Is complete

  16. G E D J R F C RID-B Protocol • Motivation of RID-B • Future traffic information is needed to take full use of Nk(D) in RID. • Very expensive, especially in WSN • RID-B’s concern: Detect nodes that can interrupt the receiver’s reception of the weakest packet from nodes within its communication neighborhood.

  17. G E D J R F C RID-B Calculation • How to achieve that? • The same way to build Interference_In table • Reorganize the Interference_In table • Replace entry (transmitter ID, power level) with entry (transmitter ID) if the following condition is met • Entry is removed, if the condition is not met Weakest signal power level from R’s communication neighbors (C here)

  18. Using RID-B in NAMA Protocol • NAMA Protocol • Scheduling is based on 2 hops communication topology. • Each node makes local decision whether it can have the current time slot, based on IDs in two communication hops. • Without communication, there comes a consensus. Only one node wins the time slot. • NAMA-RID-B Protocol • Scheduling is based on 2 hops of interference topology. • Each node makes local decision whether it can have the current time slot, based on IDs in two interference hops. • Without communication, there comes a consensus. Only one node wins the time slot.

  19. Simulation Configuration

  20. Performance Evaluation Performance with Different System Load

  21. Overhead Performance with Different System Load

  22. Performance with Different ICR and SNR (b) Performance with Different SNR Threshold (a) Performance with Different ICR (ICR=RI/Rc)

  23. Conclusions • To the best of our knowledge, our protocols, RID and RID-B, are the first to detect radio interferencetopology in runtime systems • Apply radio interference detection in TDMA design. It improves NAMA’s packet delivery ratio from 40% to 100%, in heavy load. • Analyze the application of radio interference detection in backoff algorithms. • Study the relationship between communication range and interference range in MICA2 devices, in both strong link case and weak link case.

  24. Future Work • Predict future traffic information, and combine it with RID to design more bandwidth efficient TDMA • Explore the use of RID-B in backoff algorithms in detail • Analyze the combination of RID with topology control protocols • Implement and evaluate radio interference detection in a large-scale sensor network system • Explore the interaction between radio interference and radio irregularity

  25. Thanks to anonymous reviewers for their valuable comments! The End!

More Related