1 / 13

Coverage-aware Self-scheduling in Sensor Networks

Coverage-aware Self-scheduling in Sensor Networks. Jun Lu; Suda, T 2003 IEEE 18th Annual Workshop on 20-21 Oct. 2003 Page(s):117 - 123. Speaker : hsiwei. Outline. INTRODUCTION Self-Scheduling Algorithm Simulation CONCLUSION. INTRODUCTION.

ashby
Download Presentation

Coverage-aware Self-scheduling in 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. Coverage-aware Self-scheduling in Sensor Networks Jun Lu; Suda, T 2003 IEEE 18th Annual Workshop on20-21 Oct. 2003 Page(s):117 - 123 Speaker : hsiwei

  2. Outline • INTRODUCTION • Self-Scheduling Algorithm • Simulation • CONCLUSION

  3. INTRODUCTION • Wireless sensor networks are usually randomly deployed in large-scale. • Wireless sensors are low-cost simple devices. • A wireless sensor is prone to failure or may run out of power. • transmit these data to a base station. • 目的:在相同的電力消耗時,可達到beeter network coverage.

  4. SENSING ACCURACY MODEL : the probability of sensor j to successfully detect an event happening at point i. : the distance between sensor j and point i : 1~4

  5. SENSING ACCURACY MODEL(cont.) the probability of any sensor in the network detecting the event happening at point i . sum of network coverage over all points in the covered area.

  6. SENSING ACCURACY MODEL(cont.) j=1~(n-1) 移除sensor node n loss of network coverage at point i

  7. SENSING ACCURACY MODEL(cont.) the sum of sensor network’s sensing coverage loss over all the points within range R of the sensor j due to the absence of sensor n.

  8. Self-Scheduling Algorithm The hibernating probability of sensor i 但是若 大於 Sensor i 保持active

  9. Simulation • we use LEACH-SD and MTE-SD to represent the extended LEACH and MTE protocols. • 150-node, 200-node and 250-node.

  10. Simulation(cont.) Packets/Joule Data to Energy Ratio

  11. Simulation(cont.) Network Coverage

  12. Simulation(cont.)

  13. CONCLUSION • We demonstrate that network coverage can be improved. • Coverage improvement by reducing data redundancy among neighboring sensors. • Enhance reliability and extend life cycle

More Related