A Clustering Scheme for Energy- Efficient Routing in Multi-hop 2-D Underwater Sensor Networks - PowerPoint PPT Presentation

a clustering scheme for energy efficient routing in multi hop 2 d underwater sensor networks n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
A Clustering Scheme for Energy- Efficient Routing in Multi-hop 2-D Underwater Sensor Networks PowerPoint Presentation
Download Presentation
A Clustering Scheme for Energy- Efficient Routing in Multi-hop 2-D Underwater Sensor Networks

Loading in 2 Seconds...

play fullscreen
1 / 20
A Clustering Scheme for Energy- Efficient Routing in Multi-hop 2-D Underwater Sensor Networks
0 Views
Download Presentation
hcolbert
Download Presentation

A Clustering Scheme for Energy- Efficient Routing in Multi-hop 2-D Underwater Sensor Networks

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

  1. A Clustering Scheme for Energy-Efficient Routing in Multi-hop 2-D Underwater Sensor Networks Donghyun Kim, Wei Wang, Ling Ding, Jihwan Lim, Weili Wu, and Heekuck Oh, A Clustering Scheme for Energy-Efficient Routing in Multi-hop 2-D Underwater Sensor Networks, to appear in Optimization Letters. Presented By Donghyun KimFebruary 19, 2009Mobile Computing and Wireless Networking Research Group at University of Texas at Dallas

  2. Architecture for 2D underwater sensor networks (Image Source: http://www.ece.gatech.edu/research/labs/bwn/UWASN/figures/2D_arch.gif ) Presented by Donghyun Kim on February 19, 2009Mobile Computing and Wireless Networking Research Group at The University of Texas at Dallas

  3. UW-Sinks BackgroundsClustering in USNs Normal Nodes Presented by Donghyun Kim on February 19, 2009Mobile Computing and Wireless Networking Research Group at The University of Texas at Dallas

  4. UW-Sinks Normal Nodes BackgroundsClustering in USNs – cont’ Clusterheads Presented by Donghyun Kim on February 19, 2009Mobile Computing and Wireless Networking Research Group at The University of Texas at Dallas

  5. It is around 10-12 Normal Nodes BackgroundsData Aggregation in Clustered USNs Clusterheads Presented by Donghyun Kim on February 19, 2009Mobile Computing and Wireless Networking Research Group at The University of Texas at Dallas

  6. UW-Sinks Normal Nodes BackgroundsComm. Model in Related Work Clusterheads Presented by Donghyun Kim on February 19, 2009Mobile Computing and Wireless Networking Research Group at The University of Texas at Dallas

  7. Motivations • Energy is a scarce resource in USNs • Clustering makes USNs energy efficient • Energy consumption increases exponentially as the transmission range grows => Multi-hop transmission preferred • Total energy consumption is closely related to the number of hops over which a message travels • Assumptions • USNs are homogeneous • Each clusterhead is used as a local data aggregation point • Clustering-based shortest path routing is used as a routing scheme • Each sensor node sends a report message to the sink regularly (i.e. every hour) Motivations and Assumptions Presented by Donghyun Kim on February 19, 2009Mobile Computing and Wireless Networking Research Group at The University of Texas at Dallas

  8. UW-Sinks Normal Nodes BackgroundsComm. Model in Our Work Clusterheads Presented by Donghyun Kim on February 19, 2009Mobile Computing and Wireless Networking Research Group at The University of Texas at Dallas

  9. d The number of hops in total routing path s Problem Formulation Presented by Donghyun Kim on February 19, 2009Mobile Computing and Wireless Networking Research Group at The University of Texas at Dallas

  10. Minimum Total Routing Path Clustering Problem (MTRPCP) • Given a set of sensor nodes and UW-Sinks on the Euclidean plane, MTRPCP is find a set of clusterheads such that each sensor node is adjacent to at least one clusterhead, and the total distances from each clusterhead to its nearest UW-Sink is minimized. In other words, we want to minimize Problem Formulation – cont’ Presented by Donghyun Kim on February 19, 2009Mobile Computing and Wireless Networking Research Group at The University of Texas at Dallas

  11. 3 4 1 2 3 3 1 2 2 1 1 3 1 A relaxation from MTRPCP to Minimum Weight Dominating Set Problem (MWDSP) 1 Presented by Donghyun Kim on February 19, 2009Mobile Computing and Wireless Networking Research Group at The University of Texas at Dallas

  12. Lemma 1 • For any clusterhead and a UW-Wink , . Algorithm 1 Presented by Donghyun Kim on February 19, 2009Mobile Computing and Wireless Networking Research Group at The University of Texas at Dallas

  13. Corollary 1 • Let A and B be a MTRPCP and its corresponding (relaxed) MWDSP instances, respectively. Denote the cost function of feasible solutions for MTRPCP and MWDSP by and , respectively. Then, for any feasible solution , . • Proof of Corollary 1 • By Lemma 1, for every , Algorithm 1 – cont’ Presented by Donghyun Kim on February 19, 2009Mobile Computing and Wireless Networking Research Group at The University of Texas at Dallas

  14. Theorem 1 • A -approximation algorithm for MWDSP is a 3 -approximation algorithm for MTRPCP. • Proof 1 Algorithm 1 – cont’ Presented by Donghyun Kim on February 19, 2009Mobile Computing and Wireless Networking Research Group at The University of Texas at Dallas

  15. Existing algorithms for MWDSP. • Slow algorithms (centralized, enumeration) • 72-approximation = 216-app. for MTRPCP • -approximation = -app. for MTRPCP • Quick Algorithm (distributed, greedy) • -approximation = -app. For MTRPCP Algorithm 1 – cont’ Presented by Donghyun Kim on February 19, 2009Mobile Computing and Wireless Networking Research Group at The University of Texas at Dallas

  16. A Faster Heuristic Algorithm for MTRPCP with A Constant Performance Ratio Presented by Donghyun Kim on February 19, 2009Mobile Computing and Wireless Networking Research Group at The University of Texas at Dallas

  17. Lemma 2 • Let is an MIS included in of a node . Then, . Algorithm 2 Analysis Presented by Donghyun Kim on February 19, 2009Mobile Computing and Wireless Networking Research Group at The University of Texas at Dallas

  18. Theorem 2 • Algorithm 2 is a 90-approximation algorithm for MTRPCP. • Proof of Theorem 2 • : all node in Level • Consider and • All nodes in is dominated by • From lemma 2, we have Algorithm 2 Analysis – cont’ Presented by Donghyun Kim on February 19, 2009Mobile Computing and Wireless Networking Research Group at The University of Texas at Dallas

  19. Proof of Lemma 2 – cont’ • We know • Thus, since • In conclusion, Algorithm 2 Analysis – cont’ Presented by Donghyun Kim on February 19, 2009Mobile Computing and Wireless Networking Research Group at The University of Texas at Dallas

  20. Design a quick approximation algorithm • Ratio should be better than 30. • Design a slow approximation algorithm • Ratio should be better than • We have => hopefully in next week • Design a generalized distributed approximation algorithm (d-hop case, in writing) Future Work Presented by Donghyun Kim on February 19, 2009Mobile Computing and Wireless Networking Research Group at The University of Texas at Dallas