Flooding-Based Geocasting Protocol for Mobile Ad Hoc Network YOUNG-BAE KO NITIN H. VAIDYA.

Slides:



Advertisements
Similar presentations
Ranveer Chandra Ramasubramanian Venugopalan Ken Birman
Advertisements

Dynamic Source Routing (DSR) algorithm is simple and best suited for high mobility nodes in wireless ad hoc networks. Due to high mobility in ad-hoc network,
ECE /24/2005 A Survey on Position-Based Routing in Mobile Ad-Hoc Networks Alok Sabherwal.
Multicasting in Mobile Ad hoc Networks By XIE Jiawei.
Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
Weight based Multicast Routing Protocol for Ad hoc Wireless Networks 學生:陳信皇 教授:陳仁暉.
指導教授:許子衡 教授 報告學生:馬敏修 2010/8/ Introduction 2. Geocast Routing Protocols  2.1 GAMER Overview 3. GAMER Details  3.1 Building the Mesh  3.2 Adaptation.
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.
“Location-Aided Routing (LAR) in Mobile Ad Hoc Network” by Young-bae ko Nitin H. Validya presented by Mark Miyashita.
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
E-ODMRP: Enhanced ODMRP with Motion Adaptive Refresh Soon Y. Oh, Joon-Sang Park, Mario Gerla Computer Science Dept. UCLA.
Di Wu 03/03/2011 Geographic Routing in Clustered Multi-layer Vehicular Ad Hoc Networks for Load Balancing Purposes.
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks Ranveer Chandra (joint work with Venugopalan Ramasubramanian and Ken Birman)
Delivery, Forwarding, and Routing
MULTICASTING Network Security.
A Preferred Link Based Multicast Protocol for Wireless Mobile Ad hoc Networks R. S. Sisodia, Karthigeyan. I, B. S. Manoj, and C. Siva Ram Murthy ICC 2003.
A Distance Routing Effect Algorithm for Mobility (DREAM)* Stefano Basagni Irnrich Chlamtac Violet R. Syrotiuk Barry A. Woodward.
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
Routing Two papers: Location-Aided Routing (LAR) in mobile ad hoc networks (2000) Ad-hoc On-Demand Distance Vector Routing (1999)
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.
Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.
Mobile Routing protocols MANET
Scalable Routing Protocols for Mobile Ad Hoc Networks Xiaoyan Hong, Kaixin Xu, and Mario Gerla at UCLA.
Power-Balance Broadcast in Wireless Mobile Ad Hoc Networks Jang-Ping Sheu, Yu-Chia Chang, and Hsiu- Ping Tsai National Central University, Chung-Li, 32054,Taiwan.
Multicast Routing in Mobile Ad Hoc Networks (MANETs)
Presented by Fei Huang Virginia Tech April 4, 2007.
Ad-Hoc Networks. References r Elizabeth Royer and Chai-Keong Toh, " A Review of Current Routing Protocols for Ad Hoc Wireless Mobile Networks, " IEE Personal.
Higashino Lab. Maximizing User Gain in Multi-flow Multicast Streaming on Overlay Networks Y.Nakamura, H.Yamaguchi and T.Higashino Graduate School of Information.
Presented by Chaitanya Nemallapudi Understanding and Exploiting the Trade-Offs between Broadcasting and Multicasting in Mobile Ad Hoc Networks Lap Kong.
Chapter 22 Network Layer: Delivery, Forwarding, and Routing Part 5 Multicasting protocol.
ODMRP (On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks ) Sung-Ju Lee William Su Mario Gerla Presented By: Meenakshi Bangad.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
A Survey of Geocast Routing Protocols 指導教授:許子衡 教授 報告學生:馬敏修 指導教授:許子衡 教授 報告學生:馬敏修.
On Reducing Broadcast Redundancy in Wireless Ad Hoc Network Author: Wei Lou, Student Member, IEEE, and Jie Wu, Senior Member, IEEE From IEEE transactions.
1 Shape Segmentation and Applications in Sensor Networks Xianjin Xhu, Rik Sarkar, Jie Gao Department of CS, Stony Brook University INFOCOM 2007.
Location-Aware Routing Protocols in a Mobile Ad Hoc Network
Dynamic Routing in Mobile Ad Hoc Network 報告者:呂佐鴻 指導教授:李鴻璋.
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.
K-Anycast Routing Schemes for Mobile Ad Hoc Networks 指導老師 : 黃鈴玲 教授 學生 : 李京釜.
A Scalable Routing Protocol for Ad Hoc Networks Eric Arnaud Id:
Multicast routing issues in ad hoc networks Katia Obraczka Gene Tsudik.
Weight-Based Clustering Multicast Routing Protocol for Mobile Ad Hoc Networks Chun-Chieh Huang, Ruay-shiung Chang and Ming-Huang Guo National Dong-Hwa.
Ad Hoc Multicast Routing
SGPS A Hybrid of Topology and Location Based Protocol for Ad hoc Networks Jingyi Yu Computer Graphics Group.
A Framework for Reliable Routing in Mobile Ad Hoc Networks Zhenqiang Ye Srikanth V. Krishnamurthy Satish K. Tripathi.
SHORT: Self-Healing and Optimizing Routing Techniques for Mobile Ad Hoc Networks Presenter: Sheng-Shih Wang October 30, 2003 Chao Gui and Prasant Mohapatra.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
GEOCASTING IN MOBILE AD HOC NETWORKS LOCATION- BASED MULTICAST ALGORITHMS 指導教授:許子衡 教授 學生:翁偉傑 1 Young-Bae Ko and Nitin H. Vaidya Department of Computer.
2010 IEEE Fifth International Conference on networking, Architecture and Storage (NAS), pp , 2010 作者: Filip Cuckov and Min Song 指導教授:許子衡 教授 報告學生:馬敏修.
Geometry-driven Scheme for Geocast Routing in Mobile Ad Hoc Networks Sung-Hee Lee, Young-Bae Ko College of Information and Communication, Ajou University,
2010 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), pp , 作者: Yoh Shiraishi, Ryo Miki 指導教授:許子衡 教授.
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
VORONOI DIAGRAM AND CONVEX HULL BASED GEOCASTING AND ROUTING IN WIRELESS NETWORKS 指導教授:許子衡 報告學生:翁偉傑 1 Copyright # 2006 John Wiley & Sons, Ltd. Wirel. Commun.
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
Location-aware routing protocol with dynamic adaptation of request zone for mobile ad hoc networks Tzay-Farn Shih Department of Computer Science and Information.
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.
GeoTORA: A Protocol for Geocasting in Mobile Ad Hoc Networks
Mesh-based Geocast Routing Protocols in an Ad Hoc Network
MZR: A Multicast Protocol based on Zone Routing
ODMRP Enhancement.
GeoTORA: A Protocol for Geocasting in Mobile Ad Hoc Networks
Overview of Unicast Routing Protocols for Multihop Wireless Networks
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Wireless Ad Hoc Multicast and ODMRP CS 218 Fall 2017
by Saltanat Mashirova & Afshin Mahini
Effective Replica Allocation
On Constructing k-Connected k-Dominating Set in Wireless Networks
Presentation transcript:

Flooding-Based Geocasting Protocol for Mobile Ad Hoc Network YOUNG-BAE KO NITIN H. VAIDYA

Agenda Introduction Related work Preliminaries Proposed geocasting protocols Performance evaluation Conclusion Future Work Future Work

Introduction Geocasting is useful for sending a message that is likely to be of interest to everyone in a specified area. Geocast group is implicitly defined as the set of nodes within the specified area To determine group membership, each node is required to know its own physical location, which may be obtained using the GPS.

Related work Using a multicast mesh structure for ad hoc multicasting protocols has also been proposed to improve reliability and to overcome the limitations of multicast trees, such as frequent tree reconfiguration and connectivity changes

Related work (cont.) Recently, arguing that conventional tree- based approaches are not appropriate for multicasting in ad hoc networks, Obraczka have suggested the use of flooding as a viable alternative. Flooding is attractive for highly dynamic ad hoc environments because it does not need to maintain as much network state as the tree-based protocols.

Preliminaries Physical location information --we assume that each host knows its current location precisely Geocast flooding --Initially, the source S broadcasts the geocast packet to all its neighbors. -- with the geocast flooding protocol, all hosts reachable from the source S will receive the geocast message.

Illustration of geocast flooding algorithm

Preliminaries (cont.) A node automatically becomes a member of the geocast group when it moves into the geocast region, and leaves the group when it moves out of the geocast region Forwarding zone -- --A source node S defines (implicitly or explicitly) a “forwarding zone” for a geocast data packet. --A node forwards the geocast packet only if it belongs to the forwarding zone (unlike the geocast flooding algorithm).

Preliminaries (cont.) Forwarding zone -- --With the use of a forwarding zone as described above, geocast packets are forwarded by a smaller set of nodes, as compared to geocast flooding. --To increase the probability that a data packet will reach all members in the geocast group, the forwarding zone may include, in addition to the geocast region itself

Preliminaries (cont.) Forwarding zone -- --it is necessary to achieve a high probability that a geocast is delivered to each geocast member --that accuracy of the protocol can be increased by increasing the size of the forwarding zone. (comparison of 3(a) 3(b)) --data delivery overhead may also increase with the size of the forwarding zone.

Geocast region and geocast group

Figure 3 Definition of forwarding zone

Figure 3 Definition of forwarding zone (cont.)

Proposed geocasting protocols With the modification that a node which is not in the forwarding zone does not forward a geocast packet to its neighbors. The three protocols proposed here differ in the way the forwarding zone is defined.

Static zone scheme In the static zone scheme, if node A forwards a geocast packet, the forwarding zone definition in the packet is not modified when the packet is forwarded --the forwarding zone remains static or unmodified

Figure 4. Static zone scheme (a) Source node outside the geocast region

Figure 4. Static zone scheme (b) Source node within the geocast region.

Adaptive zone scheme with one-hop flooding Using the proposed adaptive zone scheme, when node A forwards a geocast packet, it replaces the forwarding zone specification in the packet by a new specification before forwarding the packet --the new forwarding zone is determined by node A as the smallest rectangle containing node A and the geocast region such that the sides of the rectangle are parallel to the X and Y axes.

Figure 5. Comparison of static zone scheme and adaptive zone scheme. (a) Static zone scheme.

Figure 5. Comparison of static zone scheme and adaptive zone scheme (b) Adaptive zone scheme.

Adaptive zone scheme with one-hop flooding (cont.) With the adaptive zone scheme, only a subset of nodes receive the geocast packet It is important to note that the accuracy of an adaptive zone scheme can be poor in some cases (figure 6(a)) To improve the accuracy of geocast delivery when using the adaptive scheme, we augment it with “one-hop flooding”

Adaptive zone scheme with one-hop flooding (cont.) One-hop flooding is based on the following rules for forwarding: -- If the forwarding zone defined by any node (say node A) contains at least one immediate neighbor (say node B), then node A includes its adapted forwarding zone in the packet, and forwards the packet to its neighbors.

Adaptive zone scheme with one-hop flooding (cont.) -- --Otherwise (i.e., the forwarding zone defined by node A contains no one-hop neighbors), node A performs one-hop flooding to its neighbors by setting the adapted forwarding zone equal to the whole network so that every neighbor of node A will consider itself as a member of node A’s forwarding zone.

Figure 6. The effect of one-hop flooding in the adaptive zone scheme. (a) Unsuccessful geocast delivery when using the adaptive zone scheme.

Figure 6. The effect of one-hop flooding in the adaptive zone scheme (b) Successful geocast delivery when using the adaptive zone scheme with one-hop flooding.

Adaptive distance scheme node S initially includes three pieces of information with its geocast packet without including the forwarding zone explicitly: --The geocast region specification. --The location of the geometrical center, (Xc, Yc), of the geocast region. Distance of any node Z from (Xc, Yc) will be denoted as DISTz in the rest of this discussion. --The coordinates of source S, (XS, YS).

Adaptive distance scheme (cont.) a node I receives the geocast packet from node S, I determines if it belongs to the geocast region. If node I is in geocast region, it accepts the geocast packet. Then, node I calculates its distance from location (Xc, Yc), denoted as DISTI, and: -- If DISTS>= DISTI, then node I forwards the packet to its neighbors. Before forwarding the geocast packet, node I replaces the (XS, YS) coordinates received in the geocast packet by its own coordinates (XI, YI). -- Else DISTS < DISTI. In this case, node I sees whether or not sender S is within the geocast region. If S is in the geocast region, then node I forwards the packet to its neighbors. Otherwise, I discards the packet.

Figure 7. Comparison between static zone scheme and adaptive distance scheme. (a) Static zone scheme.

Figure 7. Comparison between static zone scheme and adaptive distance scheme. (b) Adaptive distance scheme.

Performance evaluation Accuracy of geocast delivery. --the ratio of the number of group members that actually receive the geocast packet, and the number of group members which were in the geocast region at the time when the geocast delivery was initiated.

Performance evaluation (cont.) Overhead of geocast delivery the number of geocast packets received by the nodes( the number of geocast packets received by nodes is different from number of geocast packets sent)

Figure 8. Comparison of three proposed geocasting protocols to geocast flooding with a variation of moving speed (for 30 nodes, and pause time of 0 unit). (a) Delivery accuracy versus speed

(b) delivery overhead versus speed

Figure 9. Comparison of three proposed geocasting protocols to geocast flooding with a variation of node numbers (for pause time 0, and maximum speed of 5.0 units/s). (a) Delivery accuracy versus number of nodes

(b) Delivery overhead versus number of nodes

Figure 10. Comparison of three proposed geocasting protocols to geocast flooding with a variation of pause time (for 30 nodes, and maximum speed of 5.0 units/s). (a) Delivery accuracy versus pause time

(b) delivery overhead versus pause time

Conclusion We have considered the problem of geocasting – packet delivery to nodes in a specified geographical area – in mobile ad hoc environments. As simulation results show, while reducing the message overhead significantly, using the proposed adaptive algorithms, it is possible to achieve accuracy of geocast delivery comparable with geocast flooding.

Future Work J. Boleng, Meshed-based geocast routing protocols in an ad hoc network. J. Boleng, Meshed-based geocast routing protocols in an ad hoc network. Y. Ko, GeoTORA: a protocols for geocasting in mobile ad hoc network. Y. Ko, GeoTORA: a protocols for geocasting in mobile ad hoc network. Y.Ko, Geocasting in mobile ad hoc networks: Location-based Multicast algorithms. Y.Ko, Geocasting in mobile ad hoc networks: Location-based Multicast algorithms. W. H. Liao, Geogrid: A geocasting protocol for mobile ad hoc networks based on grid. W. H. Liao, Geogrid: A geocasting protocol for mobile ad hoc networks based on grid. I. Stojmenovic. Voronoi diagram and convex hull based geocasting and routing in wireless networks I. Stojmenovic. Voronoi diagram and convex hull based geocasting and routing in wireless networks