Minimum Average Routing Path Clustering Problem in Multi-hop 2-D Underwater Sensor Networks

1. Minimum Average Routing Path Clustering Problem in Multi-hop 2-D Underwater Sensor Networks Presented By Donghyun KimData Communication and Data Management Laboratory University of Texas at Dallas DIMACS/DyDAn Workshop: Approximation Algorithms in Wireless Ad Hoc and Sensor NetworksDIMACS Center - Rutgers April 22 - 24, 2009 

2. Introduction • Preliminaries • Minimum Average Routing Path Clustering Problem (MARPCP) • - approximation scheme • Faster 30 - approximation scheme Agenda Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

3. Applications • Oceanographic data collection • Pollution monitoring • Offshore exploration • Disaster prevention • Assisted navigation • Tactical surveillance Underwater Sensor Networks (USNs) Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

4. Variable number of sensors and vehicles • Static sensors for traditional data collection • Unmanned Underwater Vehicles (UUV) • Deployed to perform collaborative monitoring tasks over a given area • Connecting underwater instruments by means of wireless links based on acoustic communication Underwater Sensor Networks (USNs) – cont’ Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

5. Multiple underwater sinks for relaying data to onshore or surface stations • Involve in a lot of data transmission • Spend more energy to transmit data to offshore or surface sinks • Expensive Underwater Sinks Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

6. Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

7. Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

8. Introduction • Preliminaries • Minimum Average Routing Path Clustering Problem (MARPCP) • - approximation scheme • Faster 30 - approximation scheme Agenda Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

9. Direct routing • Simple • Not cost and energy efficient • Multi-hop routing • Evade energy exhausting long range direct communication • Increases the complexity of the routing • In multi-hop routing, the energy consumption for transmitting a message increases as the number of hops grows Routing Schemes in Wireless Networks Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

10. USNs have decent mobility • In dynamic wireless networks, clustering ensures basic level system performance (i.e. throughput and delay) • Multi-level hierarchies for scalable ad-hoc routing (E.M. Belding-Royer, Wireless Networks, 2003) Clustering for USNs Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

11. UW-Sinks Normal Nodes Clustering-based Routing in Wireless Networks Clusterheads Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

12. UW-Sinks Normal Nodes Clustering-based Routing in Wireless Networks – cont’ Clusterheads Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

13. It is around 10-12 Normal Nodes Data Fusion in Wireless Sensor Networks Clusterheads Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

14. Introduction • Preliminaries • Minimum Average Routing Path Clustering Problem (MARPCP) • - approximation scheme • Faster 30 - approximation scheme Agenda Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

15. Finding an energy efficient clustering scheme for USNs using clustering-based routing scheme and limited data fusion (or requiring some level of data precision). GOAL Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

16. USNs are homogeneous • Each clusterhead is used as a local data aggregation point • Clustering-based shortest path routing is used as a routing scheme Assumptions Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

17. s The number of hops in total routing path d Problem Formulation Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

18. Minimum Average Routing Path Clustering Problem (MARPCP) • Given a set of sensor nodes and UW-Sinks on the Euclidean plane, MARPCP is find a set of clusterheads such that each sensor node is adjacent to at least one clusterhead, and the average 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 April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

19. 3 4 1 2 3 3 1 2 2 1 1 3 1 A relaxation from MARPCP to Minimum Weight Dominating Set Problem (MWDSP) 1 Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

20. Introduction • Preliminaries • Minimum Average Routing Path Clustering Problem (MARPCP) • - approximation scheme • Faster 30 - approximation scheme Agenda Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

21. Lemma 1 • For any clusterhead and a UW-Wink , . Algorithm 1 Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

22. Corollary 1 • Let A and B be a MARPCP and its corresponding (relaxed) MWDSP instances, respectively. Denote the cost function of feasible solutions for MARPCP 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 April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

23. Theorem 1 • A -approximation algorithm for MWDSP is a 3 -approximation algorithm for MARPCP. • Proof 1 UW-Sinks Algorithm 1 – cont’ Normal Nodes Clusterheads Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

24. 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 April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

25. 2 A Faster Heuristic Algorithm for MARPCP with A Constant Performance Ratio Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

26. Introduction • Preliminaries • Minimum Average Routing Path Clustering Problem (MARPCP) • - approximation scheme • Faster 30 - approximation scheme Agenda Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

27. Lemma 2 • Let is an MIS included in of a node . Then, . Algorithm 2 Analysis Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

28. Theorem 2 • Algorithm 2 is a 30-approximation algorithm for MARPCP. • Proof of Theorem 2 • : all node in Level in tree Algorithm 2 Analysis – cont’ Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

29. Consider • All nodes in is dominated by • Let be the subset of dominated by . Then, • As is dominated by , from lemma 2, we have Algorithm 2 Analysis – cont’ Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

30. By Algorithm 1, each must lie in either level of its corresponding shortest path tree. Thus,since . If follows that • Summing up for and we obtain Algorithm 2 Analysis – cont’ Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS

31. Design a quick approximation algorithm • Ratio should be better than 30. • Design a generalized distributed approximation algorithm • Support trade-off between data accuracy and energy-efficiency • How to cluster USNs to deal with the unique properties and challenges • How to incorporate an energy model? Future Work Presented by Donghyun Kim on April 22, 2009Data Communication and Data Management Laboratory at The University of Texas at Dallas DIMACS