Multi-level Proximity Routing and its applications for Networking Tomer Tankel Dept. of Electrical Eng. – Systems.

Slides:



Advertisements
Similar presentations
Scalable Routing In Delay Tolerant Networks
Advertisements

Sequoia: Virtual-Tree Models for Internet Path Metrics Rama Microsoft Research Also:Ittai Abraham (Hebrew Univ.) Mahesh Balakrishnan (Cornell) Archit Gupta.
1 Routing Protocols I. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
A Hierarchical Multiple Target Tracking Algorithm for Sensor Networks Songhwai Oh and Shankar Sastry EECS, Berkeley Nest Retreat, Jan
Intel Research Internet Coordinate Systems - 03/03/2004 Internet Coordinate Systems Marcelo Pias Intel Research Cambridge
Quality Aware Privacy Protection for Location-based Services Zhen Xiao, Xiaofeng Meng Renmin University of China Jianliang Xu Hong Kong Baptist University.
1 The Network Layer Chapter 5. 2 Network Layer Design Isues Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation.
Algorithms in sensor networks By: Raghavendra kyatham.
CLUSTERING IN WIRELESS SENSOR NETWORKS B Y K ALYAN S ASIDHAR.
A Survey on Tracking Methods for a Wireless Sensor Network Taylor Flagg, Beau Hollis & Francisco J. Garcia-Ascanio.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
Power-Aware Routing in Mobile Ad Hoc Networks. Introduction 5 power aware metrics for shortest-cost routing will be presented Compared to the traditional.
Using Overlay Networks for Proximity-based Discovery Steven Czerwinski Anthony Joseph Sahara Winter Retreat January 13, 2004.
Interference Considerations for QoS in MANETs Rajarshi Gupta, John Musacchio, Jean Walrand {guptar, musacchj, University of California,
1 ENERGY: THE ROOT OF ALL PERVASIVENESS Anthony Ephremides University of Maryland April 29, 2004.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada ISP-Friendly Peer Matching without ISP Collaboration Mohamed Hefeeda (Joint.
SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy,
Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.
3D Position Determination Hasti AhleHagh Professor. W.R. Michalson.
Cougar (Mica Mote) A platform for testing query processing techniques over ad-hoc sensor networks Three tier system: – Running TinyOS, an embedded operating.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
ASWP – Ad-hoc Routing with Interference Consideration June 28, 2005.
ASWP – Ad-hoc Routing with Interference Consideration Zhanfeng Jia, Rajarshi Gupta, Jean Walrand, Pravin Varaiya Department of EECS University of California,
The Fourth WIM Meeting 1 Active Nearest Neighbor Queries for Moving Objects Jan Kolar, Igor Timko.
ICNP'061 Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta and Samir Das Computer Science Department Stony Brook University.
ICNP'061 Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta and Samir Das Department of Computer Science Stony Brook University.
Overlay Networks EECS 122: Lecture 18 Department of Electrical Engineering and Computer Sciences University of California Berkeley.
Speaker: Li-Sheng Chen 1 Jan 2, 2012 EOBDBR: an Efficient Optimum Branching-Based Distributed Broadcast Routing Protocol for Wireless Ad Hoc Networks.
Tracking Moving Objects in Anonymized Trajectories Nikolay Vyahhi 1, Spiridon Bakiras 2, Panos Kalnis 3, and Gabriel Ghinita 3 1 St. Petersburg State University.
T. S. Eugene Ng Mellon University1 Global Network Positioning: A New Approach to Network Distance Prediction Tze Sing Eugene.
A Topology Discovery Algorithm for Sensor Networks Go Suzuki CS691, SSNS Spring 2003.
Abstract Shortest distance query is a fundamental operation in large-scale networks. Many existing methods in the literature take a landmark embedding.
Mario Čagalj supervised by prof. Jean-Pierre Hubaux (EPFL-DSC-ICA) and prof. Christian Enz (EPFL-DE-LEG, CSEM) Wireless Sensor Networks:
TrafficView: A Driver Assistant Device for Traffic Monitoring based on Car-to-Car Communication Sasan Dashtinezhad, Tamer Nadeem Department of CS, University.
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
SOS: A Safe, Ordered, and Speedy Emergency Navigation Algorithm in Wireless Sensor Networks Andong Zhan ∗ †, Fan Wu ∗, Guihai Chen ∗ ∗ Shanghai Key Laboratory.
Hongyu Gong, Lutian Zhao, Kainan Wang, Weijie Wu, Xinbing Wang
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
IDMaps: A Global Internet Host Distance Estimation Service P. Francis, S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt, L. Zhang Presenter: Zhenying Liu.
A Distributed Clustering Framework for MANETS Mohit Garg, IIT Bombay RK Shyamasundar School of Tech. & Computer Science Tata Institute of Fundamental Research.
Wireless Sensor Network Protocols Dr. Monir Hossen ECE, KUET Department of Electronics and Communication Engineering, KUET.
Minimum Average Routing Path Clustering Problem in Multi-hop 2-D Underwater Sensor Networks Presented By Donghyun Kim Data Communication and Data Management.
A Novel Mechanism for Flooding Based Route Discovery in Ad Hoc Networks Jian Li and Prasant Mohapatra GlobeCom’03 Speaker ︰ CHUN-WEI.
Energy-Efficient Shortest Path Self-Stabilizing Multicast Protocol for Mobile Ad Hoc Networks Ganesh Sridharan
#1 EETS 8316/NTU CC725-N/TC/ Routing - Circuit Switching  Telephone switching was hierarchical with only one route possible —Added redundant routes.
A Membership Management Protocol for Mobile P2P Networks Mohamed Karim SBAI, Emna SALHI, Chadi BARAKAT.
A Method for Distributed Computation of Semi-Optimal Multicast Tree in MANET Eiichi Takashima, Yoshihiro Murata, Naoki Shibata*, Keiichi Yasumoto, and.
Maximizing the lifetime of WSN using VBS Yaxiong Zhao and Jie Wu Computer and Information Sciences Temple University.
SR: A Cross-Layer Routing in Wireless Ad Hoc Sensor Networks Zhen Jiang Department of Computer Science West Chester University West Chester, PA 19335,
University “Ss. Cyril and Methodus” SKOPJE Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks Ass. Biljana Stojkoska.
PRIN WOMEN PROJECT Research Unit: University of Naples Federico II G. Ferraiuolo
Computer Science 1 Using Clustering Information for Sensor Network Localization Haowen Chan, Mark Luk, and Adrian Perrig Carnegie Mellon University
Topologically-Aware Overlay Construction and Sever Selection Sylvia Ratnasamy, Mark Handley, Richard Karp, Scott Shenker.
ICIIS Peradeniya, Sri Lanka1 An Enhanced Top-Down Cluster and Cluster Tree Formation Algorithm for Wireless Sensor Networks H. M. N. Dilum Bandara,
Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.
Urban Traffic Simulated From A Dual Perspective Hu Mao-Bin University of Science and Technology of China Hefei, P.R. China
MDDV: A Mobility-Centric Data Dissemination Algorithm for Vehicular Networks H. Wu, R. Fujimoto, R. Guensler and M. Hunter (gatech) VANET 2004: First ACM.
Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!
OLSRp: Predicting Control Information to Achieve Scalability in OLSR Ad Hoc Networks Esunly Medina ф Roc Meseguer ф Carlos Molina λ Dolors Royo ф Santander.
ProgessFace: An Algorithm to Improve Routing Efficiency of GPSR-like Routing Protocols in Wireless Ad Hoc Networks Chia-Hung Lin, Shiao-An Yuan, Shih-Wei.
Construction of Optimal Data Aggregation Trees for Wireless Sensor Networks Deying Li, Jiannong Cao, Ming Liu, and Yuan Zheng Computer Communications and.
Hop Optimization and Relay Node Selection in Multi-hop Wireless Ad- hoc Networks Xiaohua (Edward) Li Department of Electrical and Computer Engineering.
Jim Parker CMSC691t Spring 2000 “Ad-hoc On-Demand Distance Vector Routing” A dynamic routing algorithm for mobile ad-hoc networks.
1 Along & across algorithm for routing events and queries in wireless sensor networks Tat Wing Chim Department of Electrical and Electronic Engineering.
A MapReduced Based Hybrid Genetic Algorithm Using Island Approach for Solving Large Scale Time Dependent Vehicle Routing Problem Rohit Kondekar BT08CSE053.
Nuno Salta Supervisor: Manuel Ricardo Supervisor: Ricardo Morla
Mesh-based Geocast Routing Protocols in an Ad Hoc Network
Peer-to-Peer Information Systems Week 6: Performance
Generating and Solving Very Large-Scale Vehicle Routing Problems
Presentation transcript:

Multi-level Proximity Routing and its applications for Networking Tomer Tankel Dept. of Electrical Eng. – Systems

Problem and Applications Problems:  Using Measurement for distance estimation  Routing in fixed and Ad Hoc networks  Navigation in Traffic Networks Applications:  Closest mirror selection  Given a set of servers, s i 1≤i≤K, and a client, c, find a server s j, s.t.,  i 1≤i≤K d(s j,c)≤ αd(s i,c)+β  Content Distribution in P2P networks  Real-Time Vehicle Routing Server

Outline Basic-MPR Aggregation and Query Hierarchical Maps, Exp. Query Accuracy Applications –DIMES IP hop and delay graphs. –Europe Road Network –Simulated Ad Hoc Network

Distance Estimation/Routing Issues Scalability –Complexity (Memory, CPU) –Measurement  Approximated Input –Dissemination Need Accurate & Fast Query Algorithm!

Multi-level Proximity Routing (MPR) Limited routing scope (2-neighborhood) Neglect a node if its neighbors selected. Neglect longer paths between nodes.

Multi-level Proximity Routing Sibling Edge

Each cluster head i which is not selected iteratively select neighbors j 1,j 2 …j k with maximum select score until Here <1 is the aggregation factor. Increasing it yields more optimal but denser MPR, with larger memory and run time complexities. Select Stage

l-level parents path types where p 1,2 are parents of child u 1,2. Remove edge i→j if not shorter than Interpolate Stage

Aggregation Step Complexity

MPR Experiments GraphNodesArcs/ Edges Basic MPR CPU* Build sec Query ms DIMES IP Delay w16/ ( directed ) DIMACS 9’th Euro- Road ( directed ) Simulate Ad-Hoc ( undirected )

DIMES IP Delay

Euro-Road Network

Simulated Ad-Hoc

Conclusion MPR is a scalable approach to –Routing –Location –Distance Estimation –Sensor and Ad Hoc networks –Multicast Multi-level for high complexity graph problems –Qos Routing –Embedding