GeoLANMAR Routing: Asymptotic Analysis in Large and Dense Networks Broadnets 2005 Boston, Oct 5, 2005 Mario Gerla, Biao Zhou (UCLA) F. de Rango, S. Marano.

Slides:



Advertisements
Similar presentations
Geographic Routing Without Location Information AP, Sylvia, Ion, Scott and Christos.
Advertisements

Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
Communications Research Centre (CRC) Defence R&D Canada – Ottawa 1 Properties of Mobile Tactical Radio Networks on VHF Bands Li Li & Phil Vigneron Communications.
Proposed ad hoc Routing Approaches Conventional wired-type schemes (global routing, proactive): –Distance Vector; Link State Proactive ad hoc routing:
Network Layer Routing Issues (I). Infrastructure vs. multi-hop Infrastructure networks: Infrastructure networks: ◦ One or several Access-Points (AP) connected.
Geo – Routing in ad hoc nets References: Brad Karp and H.T. Kung “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks”, Mobicom 2000 M. Zorzi,
CSLI 5350G - Pervasive and Mobile Computing Week 3 - Paper Presentation “RPB-MD: Providing robust message dissemination for vehicular ad hoc networks”
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
Scalable Team Multicast in Wireless Ad hoc networks Exploiting Coordinated Motion Mario Gerla University of California, Los Angeles.
Real Time Flow Handoff in Ad Hoc Wireless Networks using Mobility Prediction William Su Mario Gerla Comp Science Dept, UCLA.
Multicast-Enabled Landmark (M-LANMAR) : Implementation and scalability YunJung Yi, Mario Gerla, JS Park, Yeng Lee, SW Lee Computer Science Dept University.
Random Access MAC for Efficient Broadcast Support in Ad Hoc Networks Ken Tang, Mario Gerla Computer Science Department University of California, Los Angeles.
Exploiting the Unicast Functionality of the On- Demand Multicast Routing Protocol Sung-Ju Lee, William Su, and Mario Gerla
Efficient Hop ID based Routing for Sparse Ad Hoc Networks Yao Zhao 1, Bo Li 2, Qian Zhang 2, Yan Chen 1, Wenwu Zhu 3 1 Lab for Internet & Security Technology,
E-ODMRP: Enhanced ODMRP with Motion Adaptive Refresh Soon Y. Oh, Joon-Sang Park, Mario Gerla Computer Science Dept. UCLA.
Georouting in ad hoc nets References: Brad Karp and H.T. Kung “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks”, Mobicom 2000 M. Zorzi,
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols Josh Broch David A. Maltz David B. Johnson Yih-Chun Hu Jorjeta Jetcheva.
Ad Hoc Networks Routing
Landmark Routing for Large Ad Hoc Wireless Networks Globecom 2000 San Francisco, Nov 30, 2000 Mario Gerla, Xiaoyan Hong and Gary Pei Computer Science Department.
Di Wu 03/03/2011 Geographic Routing in Clustered Multi-layer Vehicular Ad Hoc Networks for Load Balancing Purposes.
Milano, 4-5 Ottobre 2004 IS-MANET The Virtual Routing Protocol for Ad Hoc Networks ISTI – CNR S. Chessa.
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.
Dynamic Team Formation on Team-Oriented Multicast Yiguo Wu and Siavosh Bahrami Tutor: Yunjung Yi Prof. Mario Gerla CS 218 Advanced Computer Networks 12/05/2003.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
Beacon Vector Routing: Scalable Point-to-Point Routing in Wireless Sensornets.
Mario Gerla Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN N ETWORKING 1 Nextworking.
Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.
ENHANCING AND EVALUATION OF AD-HOC ROUTING PROTOCOLS IN VANET.
Stochastic sleep scheduling (SSS) for large scale wireless sensor networks Yaxiong Zhao Jie Wu Computer and Information Sciences Temple University.
Scalable Routing Protocols for Mobile Ad Hoc Networks Xiaoyan Hong, Kaixin Xu, and Mario Gerla at UCLA.
Routing Protocol Evaluation David Holmer
CSE 6590 Fall 2010 Routing Metrics for Wireless Mesh Networks 1 4 October, 2015.
Enhancing Link Duration and Path Stability of Routing Protocols in VANETs Presented by: Sanjay Kumar, Haresh Kumar and Zahid Yousuf Supervised by: Dr.
Scalable Ad Hoc Routing the Case for Dynamic Addressing.
Designing Routing Protocol For Mobile Ad Hoc Networks Navid NIKAEIN Christian BONNET EURECOM Institute Sophia-Antipolis France.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
Multicast ad hoc networks Multicast in ad hoc nets Multicast in ad hoc nets Review of Multicasting in wired networks Review of Multicasting in wired networks.
Proposed ad hoc Routing Approaches Conventional wired-type schemes (global routing, proactive): –Distance Vector; Link State Proactive ad hoc routing:
SRI International 1 A Simulation Comparison of TBRPF, OLSR, and AODV Richard Ogier SRI International July 2002.
A Light-Weight Distributed Scheme for Detecting IP Prefix Hijacks in Real-Time Lusheng Ji†, Joint work with Changxi Zheng‡, Dan Pei†, Jia Wang†, Paul Francis‡
Proposed ad hoc Routing Approaches Conventional wired-type schemes (global routing, proactive): –Distance Vector; Link State Proactive ad hoc routing:
Wireless Ad hoc networks – Routing. Proposed ad hoc Routing Approaches Conventional wired-type schemes (global routing, proactive): –Distance Vector;
Geo Location Service CS218 Fall 2008 Yinzhe Yu, et al : Enhancing Location Service Scalability With HIGH-GRADE Yinzhe Yu, et al : Enhancing Location Service.
A Scalable Routing Protocol for Ad Hoc Networks Eric Arnaud Id:
Scalable Routing Protocols for
UCLA ENGINEERING Computer Science RobustGeo: a Disruption-Tolerant Geo-routing Protocol Ruolin Fan, Yu-Ting Yu *, Mario Gerla UCLA, Los Angeles, CA, USA.
Forwarding Group Multicast Protocol (FGMP) for Multihop, Mobile Wireless Networks Speaker : Wilson Lai Date : Ching-Chuan Chiang, Mario Gerla.
Proposed ad hoc Routing Approaches
Multipath TCP in a Lossy ad hoc Wireless Network Medhocnet 2004 Bodrum, June 2004 Jiwei Chen, Kaixin Xu, Mario Gerla UCLA.
Lecture 6: Wireless Ad-Hoc Networks. Wireless Ad-hoc Networks Network without infrastructure – Use components of participants for networking Examples.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
Using Ant Agents to Combine Reactive and Proactive strategies for Routing in Mobile Ad Hoc Networks Fredrick Ducatelle, Gianni di caro, and Luca Maria.
指導教授:許子衡 教授 學 生:黃群凱 2016/2/251 Proceedings of the 2008 IEEE International Conference on Vehicular Electronics and Safety Columbus, OH, USA. September 22-24,
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
HoWL: An Efficient Route Discovery Scheme Using Routing History in Mobile Ad Hoc Networks Faculty of Environmental Information Mika Minematsu
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov, Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
Routing Metrics for Wireless Mesh Networks
Analysis the performance of vehicles ad hoc network simulation based
AODV-OLSR Scalable Ad hoc Routing
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks
Ad hoc Routing Protocols
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
MPR-Aware Performance Improvement for Inter-Domain Routing in MANETs
Scalable Network and Transport Protocols AINS Project review, Aug 4, 2004 PI: Mario Gerla Students: Yeng Lee, JS Park, Guang Yang, Kelvin Zhang, Alok.
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Routing in Mobile Ad-hoc Networks
A Talk on Mobile Ad hoc Networks (Manets)
Presentation transcript:

GeoLANMAR Routing: Asymptotic Analysis in Large and Dense Networks Broadnets 2005 Boston, Oct 5, 2005 Mario Gerla, Biao Zhou (UCLA) F. de Rango, S. Marano (University of Calabria, Italy)

Outline Scenario, Motivation, and Goals Scalable ad hoc routing protocols Geo-LANMAR routing Asymptotic Analysis Simulation Results Conclusions

The scenario Large ad hoc network –Civilian search/rescue (tsunami, hurricane, jungle,etc) –Tactical battlefield (Iraq, Afganistan, etc) Only ground ad hoc communications (uniform radio range) Node population: in the thousands Motion pattern: –Static nodes (say 50%) –Moving teams (say 40%) –Isolated roaming nodes (say 10%) Communications requirements –Unicast (data + real time) –multicast (geo-cast, team-cast) –Local broadcast

Goal of this study Develop a robust routing scheme that: –provides reasonably low latency –leads to efficient network utilization –scales up to 10,000 nodes

Option1: Geo Routing (GPSR) Town 2 Town 3 Town 0Town 1 F1 F3 F2F4 F5 S D P1. G1 P2 Problem: “Holes” ; heavy O/H to overcome them with GPSR Existing solutions: Fixed anchors and detours Source routing trajectories (Not effective if nodes move) A second problem: need Geo Location Service to learn Destination Coordinates

Option 2 : LANMAR Routing L1L1 L2L2 L3L3 LDLD SD DSDV updates OLSR link state updates k-hop local scope Local Routing (within k-hop): Optimal Link State Routing (OLSR), Remote Routing: Distance Vector (DSDV) used for landmark advertising Exploits Group Motion (only the Landmarks need to advertise) Problems with LANMAR: Landmark advertising O/H increases with network size and mobility If advertised rate is too low, path to Landmark is stale and breaks

Key idea: GeoLANMAR = Geo + LANMAR 1.LANMAR advertising: traces feasible path to Landmark. piggybacks destination Landmark coordinates; 2.Georouting (instead of DSDV) is used to route packets to remote Landmarks 1.more robust to mobility than DSDV table forwarding 2.When Georouting gets stuck in a hole, it is rescued by Landmark path

GeoLANMAR in action If Euclidian distance to destination is shorter than the advertised path length (Effective Traveled Distance - ETD): presence of “void” (ie hole) is suspected packet is geo routed via next Landmark on the path

More on GeoLandmark advertising Flat advertisements (LANMAR) –Route to destination Landmark points to next node on the path –Shortest path, but.. –Vulnerable to node motion Hierarchical advertisements (Geo LANMAR) –Route to destination Landmark points to next Landmark on the path –Not always shortest path, but –More robust to motion (by virtue of Georouting)

Scalability and Robustness Scalability and Robustness is achieved through: 1.Georouting (robust to mobility) 2.LANMAR paths eliminate “perimeter routing” O/H 3.Landmark coordinates come directly from advertisements 4.Only Lanmarks advertise (not regular nodes) 5.Advertisments update frequency decreases with distance (as in Fisheye Routing or Hazy Sighted Link State Routing) 6.If GPS fails (eg, jamming, indoor ops, etc), the scheme safely falls back to LANMAR

Another example of GeoLANMAR detour

Asymptotic Analysis Goal: –Find the “local scope” K that minimizes the cost of GeoLANMAR K = cluster diameter Cost = control traffic overhead –Optimize routing parameters based on K

O/H cost vs Number of Nodes Parameter A (~ Number of Nodes) K = Cluster Size

Simulation Experiments 500 nodes (20 groups with 25 nodes each) 2500m x 2500m (grid with obstacles) Radio range 250m CBR traffic (medium load) Variable speed (up to 20m/s) Evaluate: –Delivery ratio –Delay Two options for GOAL (GeO Assisted Lanmar): –Use LANMAR advertised route only when “hole” detected –Use LANMAR advertised route using Effective Trav Distance (ETD) criterion

Grid with obstacles

Delivery ratio vs speed

Delay vs speed Note: Goal is GeoLANMAR.

Conclusions GeoLANMAR scales better than LANMAR and GPSR Robust to mobility and to GPS failure Increases data throughput at high mobility (around 10% more than LANMAR, 20% more than GPSR, 40% more than AODV). Major reduction in average end-to-end delay through a better route recovery procedure Additional costs wrt LANMAR: 1.GPS 2.ETD (Effective Travelled Distance): computation and header O/H

The End Thank You