Location Updates For Efficient Routing In Ad Hoc Networks Adviser: Ho-Ting Wu & Kai-Wei Ke Presenter: Chih-Hao Tseng Presenter: Chih-Hao Tseng.

Slides:



Advertisements
Similar presentations
ECE /24/2005 A Survey on Position-Based Routing in Mobile Ad-Hoc Networks Alok Sabherwal.
Advertisements

Communications Research Centre (CRC) Defence R&D Canada – Ottawa 1 Properties of Mobile Tactical Radio Networks on VHF Bands Li Li & Phil Vigneron Communications.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
Network Layer Routing Issues (I). Infrastructure vs. multi-hop Infrastructure networks: Infrastructure networks: ◦ One or several Access-Points (AP) connected.
1 Location-Aided Routing (LAR) in Mobile Ad Hoc Networks Young-Bae Ko and Nitin H. Vaidya Yu-Ta Chen 2006 Advanced Wireless Network.
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Effects of Applying Mobility Localization on Source Routing Algorithms for Mobile Ad Hoc Network Hridesh Rajan presented by Metin Tekkalmaz.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
NCKU CSIE CIAL1 Principles and Protocols for Power Control in Wireless Ad Hoc Networks Authors: Vikas Kawadia and P. R. Kumar Publisher: IEEE JOURNAL ON.
Challenges of Routing in Ad-hoc Networks Chandra D Yarlagadda.
ITIS 6010/8010 Wireless Network Security Dr. Weichao Wang.
CS541 Advanced Networking 1 Mobile Ad Hoc Networks (MANETs) Neil Tang 02/02/2009.
1 A Novel Mechanism for Flooding Based Route Discovery in Ad hoc Networks Jian Li and Prasant Mohapatra Networks Lab, UC Davis.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Geographic Routing Without Location Information A. Rao, C. Papadimitriou, S. Shenker, and I. Stoica In Proceedings of the 9th Annual international Conference.
Energy Aware Directed Diffusion for Wireless Sensor Networks Jisul Choe, 2Keecheon Kim Konkuk University, Seoul, Korea
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Ad Hoc Wireless Routing COS 461: Computer Networks
ENHANCING AND EVALUATION OF AD-HOC ROUTING PROTOCOLS IN VANET.
Mobile IP Performance Issues in Practice. Introduction What is Mobile IP? –Mobile IP is a technology that allows a "mobile node" (MN) to change its point.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
EAIT, February 2006 A Pragmatic Approach towards the Improvement of Performance of Ad Hoc Routing ProtocolsOptimizations To Multipath Routing Protocols.
Scalable Routing Protocols for Mobile Ad Hoc Networks Xiaoyan Hong, Kaixin Xu, and Mario Gerla at UCLA.
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
Mobile Adhoc Network: Routing Protocol:AODV
Multicast Routing in Mobile Ad Hoc Networks (MANETs)
Wireless Sensor Networks COE 499 Energy Aware Routing
The Destination Sequenced Distance Vector (DSDV) protocol
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
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.
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
Dynamic Routing in Mobile Ad Hoc Network 報告者:呂佐鴻 指導教授:李鴻璋.
SRL: A Bidirectional Abstraction for Unidirectional Ad Hoc Networks. Venugopalan Ramasubramanian Ranveer Chandra Daniel Mosse.
Stefan Rührup 1 HEINZ NIXDORF INSTITUTE University of Paderborn, Germany Algorithms and Complexity Competitive Time and Traffic Analysis of Position-based.
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
MANET: Introduction Reference: “Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations”; S. Corson and J.
1 Computer Communication & Networks Lecture 21 Network Layer: Delivery, Forwarding, Routing Waleed.
A Scalable Routing Protocol for Ad Hoc Networks Eric Arnaud Id:
1 Efficient Backbone Synthesis Algorithm for Multi-Radio Wireless Mesh Networks Huei-jiun Ju and Izhak Rubin Electrical Engineering Department University.
Ching-Ju Lin Institute of Networking and Multimedia NTU
Ad Hoc Multicast Routing
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
Self-stabilizing energy-efficient multicast for MANETs.
Routing Metrics and Protocols for Wireless Mesh Networks Speaker : 吳靖緯 MA0G0101.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
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.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
VORONOI DIAGRAM AND CONVEX HULL BASED GEOCASTING AND ROUTING IN WIRELESS NETWORKS 指導教授:許子衡 報告學生:翁偉傑 1 Copyright # 2006 John Wiley & Sons, Ltd. Wirel. Commun.
Fundamentals of Computer Networks ECE 478/578
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
Nov. 29, 2006GLOBECOM /17 A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks Stephen S. Yau, Wei Gao, and Dazhi.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Advisor: Prof. Han-Chieh Chao Student: Joe Chen Date: 2011/06/07.
Mobile Ad Hoc Networks. What is a MANET (Mobile Ad Hoc Networks)? Formed by wireless hosts which may be mobile No pre-existing infrastructure Routes between.
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Mesh-based Geocast Routing Protocols in an Ad Hoc Network
Sensor Network Routing
Overview of Unicast Routing Protocols for Multihop Wireless Networks
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
by Saltanat Mashirova & Afshin Mahini
DSDV Destination-Sequenced Distance-Vector Routing Protocol
Presentation transcript:

Location Updates For Efficient Routing In Ad Hoc Networks Adviser: Ho-Ting Wu & Kai-Wei Ke Presenter: Chih-Hao Tseng Presenter: Chih-Hao Tseng

Outline Introduction Classification of Routing Algorithms Location updates between neighboring nodes Location-based Routing Protocols Performance Evaluation issues Reference

Introduction (1/2) In MANET node mobility, activity, and availability of methods to determine absolute or relative coordinates of each node. Various approaches in literature are classified according to some criteria. Mobility is apparently a very difficult problem to handle in ad hoc networks. proposed solutions have significant drawbacks. progress has been made on the routing with known destination location, location updates issue to enable efficient routing requires further investigation.

Introduction(2/2) Qualitative PropertiesQuantitative Metrics ★ Distributed Operation. ★ Loop-Freedom. ★ Demand-based Operation. ★ Sleep Period Operation. ★ Hop counts ★ End-to-end data delay. ★ Average number of data bits transmitted per data bits delivered.

Outline Introduction Classification of Routing Algorithms Location updates between neighboring nodes Location-based Routing Protocols Performance Evaluation issues Reference

Demand-based operation Proactive -Maintain routing table when nodes move. -Unacceptable overhead. -Memorized. Reactive -Designing routes when they are needed -Source-initiated on-demand routing strategy. - Not memorized

Distributed operation Localized -Forward the message based solely -Neighboring nodes may update each other location when ever an edge is broken or created -Do not memorize past traffic at any node Non-Localized -Shortest weighted path algorithm -Each node only knows node connectivity with its own zone -significant overhead when use broadcast to find destination

Location information Using Routing Table To minimized energy required per routing task To maximize the number of routing tasks that a network can perform

Single-path vs. multi- path strategies Single-path -Full message -Lack of guaranteed delivery Multi-path -Short message -Consisting of several single-paths -Be regarded as flooding

Loop-freedom The proofs are based on the observation that distances of nodes toward destination are decreasing. S D

Memorization of past traffic To memorize previous best path for providing future path to the same destination Using Routing Table Significant overhead Needed to escape loops in directional based methods

Outline Introduction Classification of Routing Algorithms Location updates between neighboring nodes Location-based Routing Protocols Performance Evaluation issues Reference

Location updates between neighboring nodes Distance-based Update Movement-based Update

A B A’A’ B’B’ R R A ’ =A+at B ’ =B+bt The time t when the connection will be lost can be estimated by solving quadratic equation R=|A ’ B ’ |=|B-A+(b-a)t| a b

Location Update

Outline Introduction Classification of Routing Algorithms Location updates between neighboring nodes Location-based Routing Protocols Performance Evaluation Issues Reference

Location-based Routing Algorithm Original MFR GEDIR DIR LAR DREAM GREEDY GRID SP FZ GREEDY DFS Extended LAR1 、 LAR2 CH-MFR Alternate MFR Disjoint MFR R-DIR Alternate DIR Disjoint DIR f-DEDIR 2-f-GEDIR Alternate GEDIR Disjoint GEDIR VD-GREEDY f-GEDIR DGRP DGRP_DL DGRP_SDL

Request Zone Routing Distance Routing Effect Algorithm for Mobility (DREAM) Location-Aided Routing scheme 1 (LAR-1) Location-Aided Routing scheme 2 (LAR-2)

DREAM(1/3) Proactive Distribute, loop free, Multipath routing Routing table Distance effect Mobility rate S->D select one-hop neighbor Data-header: qualified to receive and forward ACK for D->S in the similar way backward

DREAM(2/3)

Advantage: -Location table -loop-free Disadvantage -Overhead increase when network grows.Often use in smaller MANET DREAM(3/3)

LAR-1

LAR-2

Doubling Circles routing Each node updates its location to all nodes located within circle of radii 2 t P, t=1,2,3 … A similar algorithm (ex: DIR method) Using squares instead of circles Additional sophisticated techniques

Directional Method (DIR) S

Quorum based Strategies To form quorums of size approximately n 1/2. Each column serves as a quorum Virtual Backbone is initiated and maintained.

Home-agent Based Strategy This is router with additional functionality Located on home network of mobile node (MN) Forwards packets to appropriate network when MN is away

When MN is at home

When MN moves to a foreign network Registration Request Registration Reply

Location Update Home agent circle

Outline Introduction Classification of Routing Algorithms Location updates between neighboring nodes Location-based Routing Protocols Performance Evaluation Issues Reference

Performance Evaluation Issues Delivery rate End-to-end data delay Communication overhead Performance on static networks MAC layer considerations Comparison with the shortest path algorithm Generating sparse and dense graphs Node mobility Simulator

Outline Introduction Classification of Routing Algorithms Location updates between neighboring nodes Location-based Routing Protocols Performance Evaluation Issues Reference

I. Stojmenovic, “ Location Updates for Efficient Routing in Ad Hoc Networks, Handbook of Wireless Networks and Mobile Computing, Wiley, 2002, uottawa.ca/~ivan, pp. 451 – /papers/21.ppt. Irene Hsu, PART 1. Introduction, 03. Wireless Internet, Irene Hsu, PART 3. Introduction, 07. Routing Protocol with MANETs (part 2), hsu.idv.tw/NTUT