PPT-Greedy Routing

with Guaranteed Delivery Using Ricci Flow Jie Gao Stony Brook University Rik Sarkar Xiaotian Yin Feng Luo Xianfeng David Gu Greedy Routing Assign coordinates. Carmine . Cerrone. , . Raffaele. . Cerulli. , Bruce Golden. GO IX. Sirmione. , Italy. July 2014. 1. Outline. Motivation. The Minimum Label Spanning Tree (MLST) problem. Experimental justification. Introduction to Carousel . Xiaokang. Yu. 1. , . Xiaotian. Yin. 2. , Wei Han. 2. , . Jie Gao. 3. , Xianfeng David Gu. 3. 1. Shandong University, PRC. 2. Harvard University. 3. Stony Brook University. 1. Routing in a high genus 3D network. . Outline. Background. Classification of Routing Protocols. Data Centric Protocols. Flooding and Gossiping. SPIN. Directed Diffusion. Rumor Routing. Background. Sensor . nodes. Small. , wireless, battery . CIS 606. Spring 2010. Greedy Algorithms. Similar to dynamic programming.. Used for optimization problems.. Idea. When we have a choice to make, make the one that looks best . right now. . Make . a locally . to . Greedy Routing Algorithms . in Ad-Hoc Networks. ○. Truong . Minh . Tien. Joint work with. Jinhee. . Chun, . Akiyoshi. . Shioura. , . and Takeshi . Tokuyama. Tohoku University. Japan. Our . Problem. Hamed Pirsiavash, Deva . Ramanan. , . Charless. . Fowlkes. Department of Computer Science, UC Irvine. 2. Estimate number of tracks and their extent. Do not initialize manually. Estimate birth and death of each track. & . Polyhedron . Routing . for. Load Balancing . in . Wireless Sensor Networks. Xiaokang Yu . Xiaomeng Ban . Wei Zeng. Rik Sarkar. Xianfeng David Gu. Jie Gao. Load Balanced Routing in Sensor Networks. The two key components. Optimal Sub-structure. You solve the problem by solving a sub-problem optimally. Greedy Property. Using the choice that seems best at the moment leads to the optimal result. This is tougher to show!. Gokarna Sharma (. LSU. ). Brett . Estrade. (. Univ. of Houston. ). Costas Busch (. LSU. ). 1. DISC 2010 - 24th International Symposium on Distributed Computing. Transactional Memory - Background. The emergence of multi-core architectures. F. an Li, Yu Wang. IEEE Vehicular Technology Magazine, June 2007. Speaker: . Le . Wang. . Outline. 1. Motivation and overview . 2. . Routing Protocols. Ad Hoc Routing. Position-Based Routing. Cluster-Based Routing. CSE 421 Greedy Algorithms / Interval Scheduling Yin Tat Lee 1 Interval Scheduling Job starts at and finishes at . Two jobs compatible if they don’t overlap. Goal: find maximum subset of mutually compatible jobs. Simon S. Lam. The University of Texas at Austin. (Based on joint work with Chen . Qian. ). Keynote, IEEE ICNP, October 31, 2012. Multi-hop DT (Simon S. . Lam. ). 2. Delaunay triangulation (DT)?. A set of point in 2D. 7. Geometric Routing. Christian Schindelhauer. Technische Fakultät. Rechnernetze und Telematik. Albert-Ludwigs-Universität Freiburg. Version 30.05.2016. 1. Literature - Surveys. Stefan Rührup: Theory and Practice of Geographic Routing. In: Hai Liu, Xiaowen Chu, and Yiu-Wing Leung (Editors), Ad Hoc and Sensor Wireless Networks: Architectures, Algorithms and Protocols, Bentham Science, 2009. and SMA*. Remark: SMA* will be covered by Group Homework Credit Group C’s presentation but not in Dr. . Eick’s. lecture in 2022. Best-first search. Idea: use an . evaluation function. . f(n) . for each node.