GeoTORA: A Protocol for Geocasting in Mobile Ad Hoc Networks

Slides:



Advertisements
Similar presentations
Weight based Multicast Routing Protocol for Ad hoc Wireless Networks 學生:陳信皇 教授:陳仁暉.
Advertisements

指導教授:許子衡 教授 報告學生:馬敏修 2010/8/ Introduction 2. Geocast Routing Protocols  2.1 GAMER Overview 3. GAMER Details  3.1 Building the Mesh  3.2 Adaptation.
Overview of Ad Hoc Routing Protocols. Overview 1.
“Location-Aided Routing (LAR) in Mobile Ad Hoc Network” by Young-bae ko Nitin H. Validya presented by Mark Miyashita.
TORA! TORA! TORA! By Jansen Cohoon. Developing TORA TORA was funded by the Army Research Laboratory. TORA is presently being transitioned into the commercial.
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks Temporally-Ordered Routing Algorithm (TORA) IEEE INFOCOM 112/4/20031Authors.
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
Fastest-Vehicle Multi-hop Routing in Vehicular Ad hoc Networks 指導教授:許子衡 教授 報告學生:董藝興 學生 作者: Bilal, M. ; Chan, P.M.L. ; Pillai, P. ; 出處: Computer and Information.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.
Performance Comparison of Existing Leader Election Algorithms for Dynamic Networks Mobile Ad Hoc (Dynamic) Networks: Collection of potentially mobile computing.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Scalable and Distributed GPS free Positioning for Sensor Networks Rajagopal Iyengar and Biplab Sikdar Department of ECSE, Rensselaer Polytechnic Institute.
TORA : Temporally Ordered Routing Algorithm Invented by Vincent Park and M.Scott Corson from University of Maryland. TORA is an on-demand routing protocol.
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
Ad Hoc Wireless Routing COS 461: Computer Networks
Location-Aided Routing (LAR) in Mobile Ad Hoc Networks Young-Bae Ko and Nitin H. Vaidya Recipient of the MOBICOM'98 Best Student Paper Award.
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks Research Paper By V. D. Park and M. S. Corson.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
Flooding-Based Geocasting Protocol for Mobile Ad Hoc Network YOUNG-BAE KO NITIN H. VAIDYA.
SHARP: A Hybrid Adaptive Routing Protocol for Mobile Ad Hoc Networks Venugopalan Ramasubramanian, Zygmunt J. Haas, and Emin Gun sirer ACM MobiHoc 2003.
Mobile Routing protocols MANET
Leader Election Algorithms for Mobile Ad Hoc Networks Presented by: Joseph Gunawan.
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
ROUTING ALGORITHMS IN AD HOC NETWORKS
指導教授:許子衡 教授 報告學生:馬敏修 2010/5/ Introduction 2.Multi-Channel MAC Protocol 3.CMMP(Clustering-Based Multi-Channel MAC Protocol ) 4.Evaluation and Analysis.
Presented by Chaitanya Nemallapudi Understanding and Exploiting the Trade-Offs between Broadcasting and Multicasting in Mobile Ad Hoc Networks Lap Kong.
Dynamic Source Routing in ad hoc wireless networks Alexander Stojanovic IST Lisabon 1.
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
A Survey of Geocast Routing Protocols 指導教授:許子衡 教授 報告學生:馬敏修 指導教授:許子衡 教授 報告學生:馬敏修.
Hop State Prediction Method using Distance Differential of RSSI on VANET 指導教授:許子衡 教授 學 生:董藝興 學生 1.
1 A Practical Routing Protocol for Vehicle-formed Mobile Ad Hoc Networks on the Roads 指導教授:許子衡 教授 報告學生:董藝興 學生 作者: Wang, S.Y.; Lin, C.C.; Hwang, Y.W.; Tao,
This paper appears in: Computer Communications and Networks, ICCCN Proceedings.15th International Conference on 指導教授 : 許子衡 報告者 : 黃群凱 1.
Dynamic Routing in Mobile Ad Hoc Network 報告者:呂佐鴻 指導教授:李鴻璋.
K-Anycast Routing Schemes for Mobile Ad Hoc Networks 指導老師 : 黃鈴玲 教授 學生 : 李京釜.
A Scalable Routing Protocol for Ad Hoc Networks Eric Arnaud Id:
An Efficient Wireless Mesh Network A New Architecture 指導教授:許子衡 教授 學生:王志嘉.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
GEOCASTING IN MOBILE AD HOC NETWORKS LOCATION- BASED MULTICAST ALGORITHMS 指導教授:許子衡 教授 學生:翁偉傑 1 Young-Bae Ko and Nitin H. Vaidya Department of Computer.
Adaptive Routing Protocol for VANETs in City Environments using Real-Time Traffic Information 指導教授:許子衡 教授 報告學生:董藝興 學生 作者: Arzil, S.A. ; Aghdam,.H. ; Jamali,
指導教授:許子衡 教授 報告學生:馬敏修 2010/11/ Introduction 2. Proposed system  System assumptions  Dissemination strategies  Overcoming fragmentation  Updating.
FERMA: An Efficient Geocasting Protocol for Wireless Sensor Networks with Multiple Target Regions Young-Mi Song, Sung-Hee Lee and Young- Bae Ko Ajou University.
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.
2010 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), pp , 作者: Yoh Shiraishi, Ryo Miki 指導教授:許子衡 教授.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
TreeCast: A Stateless Addressing and Routing Architecture for Sensor Networks Santashil PalChaudhuri, Shu Du, Ami K. Saha, and David B. Johnson Department.
指導教授:許子衡 教授 學 生:黃群凱 2016/2/251 Proceedings of the 2008 IEEE International Conference on Vehicular Electronics and Safety Columbus, OH, USA. September 22-24,
VORONOI DIAGRAM AND CONVEX HULL BASED GEOCASTING AND ROUTING IN WIRELESS NETWORKS 指導教授:許子衡 報告學生:翁偉傑 1 Copyright # 2006 John Wiley & Sons, Ltd. Wirel. Commun.
Time-stable geocast for ad hoc networks and its application with virtual warning signs Volume 27, Issue 11, 1 July 2004, Pages Applications and.
A New Recovery Method for Greedy Routing Protocols in High Mobile Vehicular Communications 指導教授:許子衡 教授 學 生:董藝興.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Asstt. Professor Adeel Akram. Other Novel Routing Approaches Link reversal Aimed for highly dynamic networks Goal: to identify some path, as opposed.
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Mesh-based Geocast Routing Protocols in an Ad Hoc Network
MZR: A Multicast Protocol based on Zone Routing
Internet Networking recitation #4
Sensor Network Routing
GeoTORA: A Protocol for Geocasting in Mobile Ad Hoc Networks
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Temporally-Ordered Routing Algorithm (TORA)
Mobile and Wireless Networking
Subject Name: Computer Networks - II Subject Code: 10CS64
Effective Replica Allocation
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
A Routing Protocol for WLAN Mesh
Routing protocols in Mobile Ad Hoc Network
Presentation transcript:

GeoTORA: A Protocol for Geocasting in Mobile Ad Hoc Networks 2000 International Conference on network Protocols, 2000. Proceedings. pp. 240-250, 2000 作者:Young-Bae Ko, Nitin H. Vaidya 指導教授:許子衡 教授 報告學生:馬敏修 2010/7/9

Outline Introduction A Simplified Description of GeoTORA TORA 2.1 TORA Protocol 2.2 Anycasting Using Modified TORA 2.3 GeoTORA Protocol TORA Proposed GeoTORA Protocol 4.1 Route Creation and Maintenance in GeoTORA 4.2 Delivery of Geocast Packets Performance Evaluation 5.1 Simulation Model 5.2 Simulation Results Conclusion 2010/7/9

Introduction This paper proposed protocol is named GeoTORA, because it is derived from the TORA (unicast) routing protocol Flooding is also incorporated in GeoTORA, but it is limited to nodes within a small region This integration of TORA and flooding can significantly reduce the overhead of geocast delivery, while maintaining high accuracy 2010/7/9

A Simplified Description of GeoTORA(1/8) 2.1 TORA Protocol TORA (Temporally Ordered Routing Algorithm) is one of a family of link reversal algorithms for routing in ad hoc networks. For each possible destination in the ad hoc network, TORA maintains a destination-oriented directed acyclic graph (DAG). 2010/7/9

A Simplified Description of GeoTORA(2/8) TORA uses the notion of heights to determine the direction of each link Despite dynamic link failures, TORA attempts to maintain the destination-oriented DAG such that each node can reach the destination 2010/7/9

A Simplified Description of GeoTORA(3/8) 2010/7/9

A Simplified Description of GeoTORA(4/8) 2.2 Anycasting Using Modified TORA To implement GeoTORA, we first modify TORA to be able to perform anycast To perform an anycast, an anycast group is defined – anycast group consists of a subset of the nodes in the network. 2010/7/9

A Simplified Description of GeoTORA(5/8) While TORA maintains a DAG for each destination, the anycasting algorithm would maintain a single DAG for a given anycast group. When using TORA, only the intended destination node is a sink node in its destination-oriented DAG. To perform anycasting, we modify TORA to maintain a DAG structure such that all nodes belonging to the anycast group are sinks. 2010/7/9

A Simplified Description of GeoTORA(6/8) 2010/7/9

A Simplified Description of GeoTORA(7/8) 2.3 GeoTORA Protocol In GeoTORA, logical directed links are set up such that a node wishing to perform a geocast can reach any one node in the geocast group by simply forwarding the packet on any outgoing link. When any node in the geocast group receives the packet, it floods the packet such that the flooding is limited to the geocast region 2010/7/9

A Simplified Description of GeoTORA(8/8) 2010/7/9

TORA(1/8) TORA provides loop-free, multiple routes from any source to a desired destination. Logical direction of a link between a pair of nodes is determined by assigning a height to each node. The logical links are considered to be directed from nodes with higher height towards nodes with lower height 2010/7/9

TORA(2/8) Lexicographic ordering on height is used since height is defined as a five-tuple (T, oid, r, δ, i) The height consists of two components: a reference level represented by the first three components of the five-tuple, and a delta with respect to the reference level, represented by the last two components of the five-tuple. 2010/7/9

TORA(3/8) T:T is a tag that represents the time of the link failure. oid (originator id): The oid ensures that the reference levels can be totally ordered lexicographically even if multiple nodes define reference levels simultaneously. r:Reflection indicator bit. This bit is initially set to 0. δ: Propagation ordering parameter i: Unique node identifier (ID) 2010/7/9

TORA(4/8) TORA performs three basic functions: route creation, route maintenance, and route erasure. Three control packets – query (QRY), update (UPD), and clear (CLR) Creating routes from various sources to the destination corresponds to establishing a sequence of directed links from each source to the destination. 2010/7/9

TORA(5/8) 2010/7/9

TORA(6/8) If node X has no downstream links and its route-required flag is un-set, then it just forwards the QRY to neighbors, in Figure 4(b) If node X has no downstream links, but its routere-quired flag is set, then node X simply discards the received QRY packet. 2010/7/9

TORA(7/8) If node X has at least one downstream link and its height is NULL, it modifies value of δ in its height, in Figure 4(c) Node X changes its current NULL height (-,-,-,-,X) to (T, oid, r, δ+1, X) If node X has at least one downstream link, but its height is non-NULL, in Figure 4(d) 2010/7/9

TORA(8/8) When a node, say Y, gets an UPD packet from its neighbor, node Y checks its route-required flag to see if it is set or not. If the flag is set, then it updates its height as (T, oid, r, δ+1, Y) Node Y then broadcasts an UPD containing its new height. 2010/7/9

Proposed GeoTORA Protocol(1/6) 4.1 Route Creation and Maintenance in GeoTORA 2010/7/9

Proposed GeoTORA Protocol(2/6) In GeoTORA, the DAG may need to be modified when: (a) a link failure occurs, or (b) when a node enters or leaves the geocast region. Figure 6 illustrates how the DAG is modified in GeoTORA in response to link failures, considering several link failure scenarios. 2010/7/9

Proposed GeoTORA Protocol(3/6) 2010/7/9

Proposed GeoTORA Protocol(4/6) 2010/7/9

Proposed GeoTORA Protocol(5/6) 4.2 Delivery of Geocast Packets Geocast delivery using GeoTORA consists of two phases: anycasting phase and local flooding phase Anycasting Phase: When a node wishes to send a packet to the geocast group, it forwards the packet on any of its outgoing links. 2010/7/9

Proposed GeoTORA Protocol(6/6) Local Flooding Phase: Once a packet is delivered to one node in the geocast group that node initiates local flooding of the packet. The node, say X, that initiates the flood, tags the specification of the geocast region to the packet, and broadcasts it to its neighbors. Any node, say Y, that receives the flooded packet verifies whether it is within the region whose specification is tagged to the packet. 2010/7/9

Performance Evaluation(1/10) 5.1 Simulation Model Initial locations of the nodes are obtained using a uniform distribution. Chosen to be 30 nodes, move around in a rectangular region of size 700 unit x 700 unit square Mobility model: each node chooses a direction, moving speed, and distance of move based on a predefined distribution and then computes its next position P and the time instant T of reaching that position. 2010/7/9

Performance Evaluation(2/10) Each node moves with three different maximum speeds: 5, 10 and 20 units per second We ran our simulations with movement patterns generated for several different pause times, from 0 to 1000 seconds. Total simulation time is 1000 seconds. 2010/7/9

Performance Evaluation(3/10) Transmission range is defined as 250 units for all nodes. The wireless link bandwidth is 2 Mbps. For the simulations, any data packets that cannot be delivered due to a broken route are simply dropped. The size of data payload is 512 bytes. 2010/7/9

Performance Evaluation(4/10) For the simulation, control packets are required to maintain the DAG, and the size of those packets is 32 bytes. A geocast region is defined to be a 200 unit x 200 unit square region 2010/7/9

Performance Evaluation(5/10) 5.2 Simulation Results 2010/7/9

Performance Evaluation(6/10) 2010/7/9

Performance Evaluation(7/10) 2010/7/9

Performance Evaluation(8/10) 2010/7/9

Performance Evaluation(9/10) 2010/7/9

Performance Evaluation(10/10) 2010/7/9

Conclusion We present a novel protocol called GeoTORA for geocasting in ad hoc networks. In GeoTORA, TORA routing protocol has been modified to perform anycast and local flooding has been utilized to limit flood to a small region. As simulation results show, this integration of TORA and flooding can significantly reduce the geocast message overhead as compared to pure flooding and LBM scheme, while achieving high accuracy of geocast delivery. 2010/7/9