• Save
Energy-Efficient Protocol for Deterministic and Probabilistic Coverage In Sensor Networks
Upcoming SlideShare
Loading in...5
×
 

Like this? Share it with your network

Share

Energy-Efficient Protocol for Deterministic and Probabilistic Coverage In Sensor Networks

on

  • 311 views

Energy-Efficient Protocol for Deterministic and Probabilistic Coverage

Energy-Efficient Protocol for Deterministic and Probabilistic Coverage
In Sensor Networks

Statistics

Views

Total Views
311
Views on SlideShare
311
Embed Views
0

Actions

Likes
0
Downloads
0
Comments
0

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via as Microsoft Word

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

Energy-Efficient Protocol for Deterministic and Probabilistic Coverage In Sensor Networks Document Transcript

  • 1. Energy-Efficient Protocol for Deterministic and Probabilistic Coverage In Sensor NetworksScope: To analyze coverage protocols in Wireless Sensor NetworksAbstract: Various sensor types, e.g., temperature, humidity, and acoustic, sense physicalphenomena in different ways, and thus, are expected to have different sensing models.Even for the same sensor type, the sensing model may need to be changed in differentenvironments. Designing and testing a different coverage protocol for each sensing modelis indeed a costly task. To address this challenging task, we propose a new probabilisticcoverage protocol (denoted by PCP) that could employ different sensing models. Weshow that PCP works with the common disk sensing model as well as probabilisticsensing models, with minimal changes. We analyze the complexity of PCP and prove itscorrectness. In addition, we conduct an extensive simulation study of large-scale sensornetworks to rigorously evaluate PCP and compare it against other deterministic andprobabilistic protocols in the literature. Our simulation demonstrates that PCP is robust,and it can function correctly in presence of random node failures, inaccuracies in nodelocations, and imperfect time synchronization of nodes. Our comparisons with otherprotocols indicate that PCP outperforms them in several aspects, including number ofactivated sensors, total energy consumed, and network lifetime. Ambit lick Solutions Mail Id : Ambitlick@gmail.com , Ambitlicksolutions@gmail.Com
  • 2. Existing System: Designing and testing a different coverage protocol for each sensing model isindeed a costly task.Problem Definition: • Not too realistic - Wastes sensor capacity: signals don’t fall abruptly • chance to detect events after coverage - Activates more sensors 􀃎 more interference, shorter • network lifetime - Protocols my not function in real environmentsProposed System: • A new probabilistic coverage protocol (denoted by PCP) that could employ different sensing models • large-scale sensor networks • Simple, energy efficient • Robust against clock drifts, failures, location inaccuracy Ambit lick Solutions Mail Id : Ambitlick@gmail.com , Ambitlicksolutions@gmail.Com
  • 3. • One model does not fit all sensor types • PCP is designed with limited dependence on sensing model can be used with various sensor types • PCP can use disk sensing model as wellSYSTEM REQUIREMENTS:Hardware Requirements: Processor : Intel Dual Core 1.6 GHz Ram : 512 MB HDD : 80 GB S (10 GB *) Monitor : View sonic 17” Tft Network Card : On Board Mother Board : Intel 945g Original Mother BoardSoftware Requirements: Operating System : Win2000/XP / Linux 9.0 Programming Package : JAVA, C++, Tcl scripting Tools : Eclipse, VM ware Workstation Ambit lick Solutions Mail Id : Ambitlick@gmail.com , Ambitlicksolutions@gmail.Com
  • 4. PCP Architecture diagram: Exponential Sensor Sensing Least Active node Covered sensors Model Sensor PCP Selectio n Activation AODV Protocol message to (1-hop) neighbor node Wait state Coverage time Save Energy Ambit lick Solutions Mail Id : Ambitlick@gmail.com , Ambitlicksolutions@gmail.Com
  • 5. REFERENCES[1] I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless SensorNetworks: A Survey,” Computer Networks, vol. 38, no. 4, pp. 393-422, Mar. 2002.[2] G. Xing, X. Wang, Y. Zhang, C. Lu, R. Pless, and C. Gill, “Integrated Coverage andConnectivity Configuration for Energy Conservation in Sensor Networks,” ACM Trans.Sensor Networks, vol. 1, no. 1, pp. 36-72, Aug. 2005.[3] Z. Zhou, S. Das, and H. Gupta, “Connected K-Coverage Problem in SensorNetworks,” Proc. Int’l Conf. Computer Comm. And Networks (ICCCN ’04), pp. 373-378, Oct. 2004.[4] H. Zhang and J. Hou, “Maintaining Sensing Coverage and Connectivity in LargeSensor Networks,” Ad Hoc and Sensor Wireless Networks: An Int’l J., vol. 1, nos. 1/2,pp. 89-123, Jan. 2005.[5] S. Shakkottai, R. Srikant, and N. Shroff, “Unreliable Sensor Grids: Coverage,Connectivity, and Diameter,” Ad Hoc Networks, vol. 3, no. 6, pp. 702-716, Nov. 2005. Ambit lick Solutions Mail Id : Ambitlick@gmail.com , Ambitlicksolutions@gmail.Com