- Geometric Ad-Hoc Routing: Of Theory and Practice Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Zollinger
- Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space
- Persistent Homology and Applications CSE-658 / Prof. Jie Gao
- Covering Space for In-Network Sensor Data Storage Xianfeng David Gu
- 174 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 23, NO. 1, JANUARY 2005 Geometric Spanners for Routing in Mobile Networks
- Beyond Average: Toward Sophisticated Sensing with Joseph M. Hellerstein
- S4: Small State and Small Stretch Routing Protocol for Large Wireless Sensor Networks
- Geometric Spanner for Routing in Mobile Networks Jie Gao Leonidas J. Guibas John Hershberger y Li Zhang z An Zhu
- Localization and Routing in Sensor Networks by Local Angle Information
- Ubiquitous Access to Distributed Data in Large-Scale Sensor Networks through Decentralized Erasure Codes
- Collaborative Location Certification for Sensor JIE GAO, RADU SION, SOL LEDERER
- Fractionally Cascaded Information in a Sensor Network Leonidas J. Guibas
- Staying in the Middle: Exact and Approximate Medians in R1 Moving Points
- Analysis of Aloha and Slotted Aloha September 25, 2009
- Load Balanced Short Path Routing in Wireless Networks
- Network Routing Acknowledgement: Slides borrowed from Richard Y. Yang @ Yale
- Maintaining Approximate Minimum Steiner Tree and k-center for Mobile Agents in a Sensor Network
- Testing Planarity of Partially Embedded Graphs Patrizio Angelini
- Ethics in Information Technology, Second Edition
- Geodesic Delaunay Triangulations in Bounded Planar Domains
- Exploration of Path Space using Sensor Network Geometry Ruirui Jiang, Xiaomeng
- Rumor Routing Algorithm For Sensor Networks David Braginsky
- WellSeparated Pair Decomposition for the UnitDisk Graph Metric and its Applications
- Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem Michael Langberg
- Link Layer Services encapsulate bits into frame, adding header
- Distance-Sensitive Routing and Information Brokerage in Sensor Networks
- Mobile Networks and Applications 11, 187200, 2006 C 2006 Springer Science + Business Media, LLC. Manufactured in The Netherlands.
- Sensor Selection for Minimizing Worst-Case Prediction Error Abhimanyu Das
- Connectivity-based Sensor Network Localization using
- Timing-sync Protocol for Sensor Networks Saurabh Ganeriwal Ram Kumar Mani B. Srivastava
- The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition
- Transport Layer vs. Network Layer Provide logical communication
- JOURNAL OF COMPUTATIONAL PHYSICS 137, 346365 (1997) ARTICLE NO. CP975809
- Data Preservation Under Spatial Failures in Sensor Networks
- Double Rulings for Information Brokerage in Sensor Rik Sarkar, Xianjin Zhu, Jie Gao
- Light-weight Contour Tracking in Wireless Sensor Networks Xianjin Zhu Rik Sarkar Jie Gao Joseph S. B. Mitchell
- HIERARCHICAL DATA STRUCTURES FOR MOBILE NETWORKS
- cse590 Information Processing in Sensor Networks Lecture 0 How to Do Scribe Notes
- Staying in the Middle: Exact and Approximate Medians in R1 for Moving Points
- On the Pitfalls of Geographic Face Routing Young-Jin Kim Ramesh Govindan Brad Karp Scott Shenker
- Tradeoffs between Stretch Factor and Load Balancing Ratio in Routing on Growth Restricted Graphs
- Greedy Routing with Guaranteed Delivery Using Ricci Flow
- Compact routing schemes Mikkel Thorup
- TCP in Wireless Mobile Introduction to transport layer
- Semidefinite Programming for Ad Hoc Wireless Sensor Network Localization
- Sparse Data Aggregation in Sensor Networks Computer Science
- Weighted Bloom Filter Jehoshua Bruck Jie Gao Anxiao (Andrew) Jiang
- Local Connectivity Tests to Identify Wormholes in Wireless Networks
- Ethics in Information Technology, Second Edition
- TDMA (Time Division Multiple Access) assign the fixed sending frequency to a transmission
- Convolutional coding and one decoding algorithm, the Viterbi Algorithm, are currently used in about one billion cellphones, which is probably the largest number in any
- GHT: A Geographic Hash Table for Data-Centric Storage Sylvia Ratnasamy and Brad Karp
- Network Layer; Location Management;
- 0018-9162/04/$20.00 2004 IEEE August 2004 41 G U E S T E D I T O R S ' I N T R O D U C T I O N
- Distributed Proximity Maintenance in Ad Hoc Mobile , Leonidas J. Guibas2
- Wireless Networks 0 (2001) ?? 1 Routing with Guaranteed Delivery
- Landmark-Based Information Storage and Retrieval in Sensor Networks
- Geographic Routing Routing in ad hoc networks
- DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks
- THE PLATFORMS ENABLING WIRELESS
- Embracing Wireless Interference: Analog Network Coding Sachin Katti, Shyamnath Gollakota, and Dina Katabi
- Boundary Recognition in Sensor Networks by Topological Methods
- Hierarchical Spatial Gossip for Multi-Resolution Representations in Sensor Networks
- Theory of Semidefinite Programming for Sensor Network Localization
- Explicit Notification Explicit Notification
- Algorithm Reading Group Script: Partitioning and Stabilizing Social Networks
- Wireless ad hoc networks Acknowledgement: Slides borrowed from Richard Y. Yang @ Yale
- Localization and Routing in Sensor Networks by Local Angle Information
- Medians and Beyond: New Aggregation Techniques for Sensor Networks
- Near-optimal Sensor Placements: Maximizing Information while Minimizing Communication Cost
- Next Century Challenges: Scalable Coordination in Sensor Networks Deborah Estrin
- Differential Forms for Target Tracking and Aggregate Queries in Distributed Networks
- CSE590 Wireless and Mobile Networks ACK: Slides borrowed from Richard Y. Yang.
- Extreme Opportunistic Routing (ExOR) Basic idea: avoid duplicates by scheduling
- 1 Location Management in Cellular JINGYUAN ZHANG
- MSP: Multi-Sequence Positioning of Wireless Sensor Nodes Ziguo Zhong
- Shape Segmentation and Applications in Sensor Xianjin Zhu Rik Sarkar Jie Gao
- The running time of the algorithm is clearly O(mn) since there are two nested loops with m and n iterations, respectively. The algorithm also uses O(mn) space.
- Moving Beyond End-to-End Path Information to Optimize CDN Performance
- Computational Geometry 35 (2006) 219 www.elsevier.com/locate/comgeo
- Reed Solomon Code February 19, 2007
- Seminar on Topological Methods inSeminar on Topological Methods in Wireless NetworkingWireless Networking
- Localization of Mobile Users Using Trajectory Matching HyungJune Lee, Martin Wicke, Branislav Kusy, and Leonidas Guibas
- ZigZag Decoding: Combating Hidden Terminals in Wireless Shyamnath Gollakota and Dina Katabi
- An open problem on greetings CSE 642 -Algorithms reading group
- CSE370 Spring 2010 Wireless and mobile networking April 19, 2010
- Balancing Traffic Load in Wireless Networks with Curveball Routing
- In-Network Coding for Resilient Sensor Data Storage and Efficient Data Mule Collection
- Some Results on Greedy Embeddings in Metric Spaces Tom Leighton
- 802.11 standard Acknowledgement: Slides borrowed from Richard Y. Yang @ Yale
- Connectivity-based Sensor Network Localization with Incremental Delaunay Refinement Method
- Location Service Location service
- Topological Data Processing for Distributed Sensor Networks with Morse-Smale Decomposition
- Greedy Routing with Guaranteed Delivery Using Ricci Flows
- Randomized Shellsort: A Simple Oblivious Sorting Algorithm Michael T. Goodrich
- Kinetic Medians and kdTrees Pankaj K. Agarwal 1 , Jie Gao 2 , and Leonidas J. Guibas 2
- Discrete Mobile Centers Jie Gao Leonidas J. Guibas John Hershberger y
- Detecting Cuts in Sensor Networks Nisheeth Shrivastava Subhash Suri
- Clustering Lines in High Dimensional Space: Classification of Incomplete Data
- Catching Elephants with Mice: Sparse Sampling for Monitoring Sensor Networks
- Research Statement My research is on applied computational geometry and distributed algorithm design with applications in wireless
- Spherical Representation and Polyhedron Routing for Load Balancing in Wireless Sensor Networks
- Wireless Netw DOI 10.1007/s11276-006-9857-z
- Spatial Distribution in Routing Table Design for Sensor Networks Rik Sarkar Xianjin Zhu Jie Gao
- Load Balanced Short Path Routing in Wireless Networks Jie Gao, IEEE member, Li Zhang
- Trade-offs between Stretch Factor and Load Balancing Ratio in Routing on Growth Restricted
- Distributed Localization Using Noisy Distance and Angle Information
- Connectivity-based Localization of Large Scale Sensor Networks with Complex Shape
- Double Rulings for Information Brokerage in Sensor Networks Rik Sarkar Xianjin Zhu Jie Gao
- Hierarchical Spatial Gossip for Multi-Resolution Representations in Sensor Networks
- Network Metric Approximation and Mobile Agent Coordination in
- Locating and Bypassing Routing Holes in Sensor Networks
- Segmenting A Sensor Field: Algorithms and Applications in Network Design
- Iso-Contour Queries and Gradient Descent with Guaranteed Delivery in Sensor Networks
- Contour Tracking and InformationContour Tracking and Information--guidedguided NavigationNavigation
- Navigation in Real-World Complex Networks through Embedding in Latent Spaces Xiaomeng Ban
- DOI: 10.1007/s00454-003-2925-6 Discrete Comput Geom 30:4563 (2003) Discrete & Computational
- Deformable Spanners and Applications Jie Gao Leonidas J. Guibas An Nguyen
- SIAM J. COMPUT. c 2005 Society for Industrial and Applied Mathematics Vol. 35, No. 1, pp. 151169
- Unit-Disk Graphs, 2003; Gao, Zhang Jie Gao, Stony Brook University. Li Zhang, Hewlett-Packard Labs.
- Distributed Proximity Maintenance in Ad Hoc Mobile Networks Leonidas J. Guibas
- The Emergence of Sparse Spanner and Greedy Well-Separated Pair
- Discrete Comput Geom (2008) 40: 537560 DOI 10.1007/s00454-008-9107-5
- Connectivity-based Localization of Large Scale Sensor Networks with Complex Shape
- Geometric Spanners for Routing in Mobile Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu
- On Delivery Guarantees of Face and Combined Greedy-Face Routing in Ad Hoc and Sensor Networks
- CountTorrent: Ubiquitous Access to Query Aggregates in Dynamic and Mobile Sensor Networks
- Geometric range searching Jir Matousek
- CSE 642 Algorithms Seminar Chopping a String Jan 27, 2010 1 Problem Description
- How far can you reach? Ciprian Borcea 1
- Signal Propagation Signal are generated as physical representations of data
- Acknowledgement: Slides borrowed from Richard Yang @ Yale. Modulation
- CDMA with Direct Sequence Spread Spectrum February 13, 2007
- Aloha and slotted aloha Slotted aloha: transmissions are synchronized
- 802.11 standard Acknowledgement: Slides borrowed from Richard Y. Yang @ Yale
- Network Layer; Location Management;
- Slides borrowed from Richard Y. Yang @ Yale Motivations
- Geographical routing Routing in ad hoc networks
- Wireless LAN Security April 24, 2007
- Security in Wireless and Mobile Introduction
- Wireless Channels Overview of Wireless Transmissions
- Preview: Challenges and Techniques of Wireless Performance
- Link Layer Services encapsulate bits into frame, adding header
- DSSS, Viterbi Algorithm, MAC Acknowledgement: Slides borrowed from Richard Yang @ Yale.
- Wireless ad hoc networks Acknowledgement: Slides borrowed from Richard Y. Yang @ Yale
- Network Routing II Slides borrowed from Richard Y. Yang @ Yale
- Network Localization and Rigidity TheoryRigidity Theory
- GLS: Grid Location Service Last lecture: location update/query for
- Professional Ethics for Computer Science Lecture 1: Motivation and Basics
- Professional Ethics for Computer Science Lecture 2: Computer and Internet Crime
- Professional Ethics for Computer Science Chapter 4: Privacy
- Geometric Algorithms for Sensor Networks Leonidas Guibas
- Routing in Outer Space: Fair Traffic Load in Multi-Hop Wireless Networks
- Algorithms Reading Group Scribes for September 03, 2010
- A Scalable Location Service for Geographic Ad Hoc Routing
- An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
- Symbol-level Network Coding for Wireless Mesh Networks Sachin Katti, Dina Katabi, Hari Balakrishnan, and Muriel Medard
- Acknowledgement: Slides borrowed from Richard Yang @ Yale. Modulation
- Opportunistic Processing and Query of Motion Trajectories in Wireless Sensor Networks
- Distributed Resource Management and Matching in Sensor Networks
- Network Routing Acknowledgement: Slides borrowed from Richard Y. Yang @ Yale
- Algorithms Seminar: The Twitter Problem Notes by Sam McCauley
- Resilient and Low Stretch Routing Through Embedding into Tree Metrics
- The first part of Problem discussion containing Introduction, detailed description of problem, solution approaches can be found at http://www.cs.sunysb.edu/~jgao/CSE642/Alg9-2-11.pdf
- Introduction and Asymptotic Notation 1.2.1 Secondary goals
- Research Statement My research is on applied computational geometry and distributed algorithm design with applications in wireless
