Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

Successfully reported this slideshow.

Like this presentation? Why not share!

- Global Healthcare Report Q2 2019 by CB Insights 183566 views
- Be A Great Product Leader (Amplify,... by Adam Nash 52124 views
- Trillion Dollar Coach Book (Bill Ca... by Eric Schmidt 110034 views
- APIdays Paris 2019 - Innovation @ s... by APIdays 62155 views
- A few thoughts on work life-balance by Wim Vanderbauwhede 39484 views
- Is vc still a thing final by Mark Suster 97829 views

40 views

Published on

Published in:
Engineering

No Downloads

Total views

40

On SlideShare

0

From Embeds

0

Number of Embeds

0

Shares

0

Downloads

1

Comments

0

Likes

1

No embeds

No notes for slide

- 1. DELAUNAY BASED TWO-PHASE ALGORITHM FOR CONNECTED COVER IN WSNS Maryam Tahmasbi Hadi Tabatabaee Malazi Fahimeh Eltejaei
- 2. Connected cover
- 3. A connected cover Delaunay based two-phase algorithm for connected cover in WSNs
- 4. Related work Coverage Configuration Protocol (CCP) that results different degrees of coverage and also maintains the communication connectivity. • The coverage can imply connectivity only when sensors’ communication ranges are not less than twice of their sensing ranges (2Rs ≤ Rc). • The desired connectivity of boundary sensing nodes are equal to the degree of coverage. • The desired connectivity of interior nodes are twice the degree of coverage. • Shortcomings of the method is that it does not guarantee network connectivity for the case where Rc < 2Rs. Delaunay based two-phase algorithm for connected cover in WSNs
- 5. Related work • Zhang and Hou in [10] proved that if the communication range is 3 times of the sensing range, the area coverage will result network connectivity. • They proposed an algorithm where a sensor is activated if the coverage overlap of that sensor with other sensors is minimum. Delaunay based two-phase algorithm for connected cover in WSNs
- 6. Delaunay triangulation • A Delaunay triangulation for a set of n points in the plane is a triangulation such that the circumcircle of every triangle Contains no points inside it. Delaunay based two-phase algorithm for connected cover in WSNs
- 7. DBCC algorithm First phase: coverage phase: • Building a Delaunay triangulation G on sensors. • Starting from an active node (sensor), visiting all nodes using BFS algorithm, activating each sensor if it is not covered by a neighboring node. Second phase: connectivity phase. • Finding the connected components. • Selecting pairs of connected components with smallest distance in G. • Connect two components with a shortest path in G. Delaunay based two-phase algorithm for connected cover in WSNs
- 8. Delaunay based two-phase algorithm for connected cover in WSNs
- 9. Delaunay based two-phase algorithm for connected cover in WSNs
- 10. Computational Complexity • 1st Phase: • 2nd Phase: Delaunay based two-phase algorithm for connected cover in WSNs
- 11. Experimental study • Randomly placed sensors in a rectangular area of 400 x 400 m2. • Sensing range (Rs) = 50 m • Communication range (Rc) = from 40 to 100 m. • The number of sensors varies from 160 to 320 Delaunay based two-phase algorithm for connected cover in WSNs
- 12. The number of active sensors in different range ratio. Delaunay based two-phase algorithm for connectedcover in WSNs
- 13. The number of active nodes when communication range varies Rs = 50 m 50 m < tr<70 m Delaunay based two-phase algorithm for connectedcover in WSNs
- 14. The execution time with different communication range for Rs=50 m Delaunay based two-phase algorithm for connectedcover in WSNs
- 15. Comparison • We compared DBCC algorithm with CCP and OGDC. • Number of sensors: from 100 to 700 • A rectangular area of 400 x 400 m2 • Rs=50 m • Rc= 1 , 1.5 and 2 times Rs Delaunay based two-phase algorithm for connected cover in WSNs The experiments show that the number of active sensors in DBCC in average is 23% less than CCP and 45% less than OGDC.
- 16. Comparing the number of active nodes in different algorithms, when Rc = 50m Delaunay based two-phase algorithm for connectedcover in WSNs
- 17. Comparing the number of active nodes in different algorithms when Rc = 75m Delaunay based two-phase algorithm for connectedcover in WSNs when the communication range is 1.5 times of the sensing rang, the number of sensors in DBCC is 15% less than CCP and 20% less than OGDC in average.
- 18. Comparing the number of active nodes in different algorithms when Rc = 100m Delaunay based two-phase algorithm for connectedcover in WSNs
- 19. Conclusion • we developed a new two phase algorithm (DBCC) for finding connected cover in WSNs. • The main idea was to use Delaunay triangulation for navigating through the sensor field, then using BFS algorithm to select next sensor. • Simulations showed that DBCC performs better in cases when coverage does not guarantee the connectivity. Delaunay based two-phase algorithm for connected cover in WSNs
- 20. Thank you for your attention. Any Questions? Delaunay based two-phase algorithm for connectedcover in WSNs

No public clipboards found for this slide

Be the first to comment