Directional Routing for Wireless Mesh Networks: A Performance Evaluation Bow-Nan Cheng Murat Yuksel Shivkumar Kalyanaraman.

Slides:



Advertisements
Similar presentations
1 Using Directionality in Mobile Routing Bow-Nan Cheng (MIT LL) Murat Yuksel (Univ Nevada - Reno) Shivkumar Kalyanaraman (IBM IRL) (Work done at Rensselaer.
Advertisements

1 GPSR: Greedy Perimeter Stateless Routing for Wireless Networks B. Karp, H. T. Kung Borrowed slides from Richard Yang.
SEEKER: An Adaptive and Scalable Location Service for Mobile Ad Hoc Networks Jehn-Ruey Jiang and Wei-Jiun Ling Presented by Jehn-Ruey Jiang National Central.
VDR: Proactive element Conclusions VDR reaches 3.5% more nodes than VDR-R and 9% more nodes than our modified random walk routing strategy (RWR) VDR shows.
Rendezvous-Based Directional Routing: A Performance Analysis Bow-Nan Cheng (RPI) Murat Yuksel (UNR) Shivkumar Kalyanaraman (RPI)
Highly-Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks Computer Science Department, UCLA International Computer Science Institute,
Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin Presented By Tu Tran 1.
Self-Organizing Hierarchical Routing for Scalable Ad Hoc Networking David B. Johnson Department of Computer Science Rice University Monarch.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
NGMAST- WMS workshop17/09/2008, Cardiff, Wales, UK A Simulation Analysis of Routing Misbehaviour in Mobile Ad hoc Networks 2 nd International Conference.
Multicasting in Mobile Ad-Hoc Networks (MANET)
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.
Ad-Hoc Networking Course Instructor: Carlos Pomalaza-Ráez D. D. Perkins, H. D. Hughes, and C. B. Owen: ”Factors Affecting the Performance of Ad Hoc Networks”,
An Implementation Framework for Trajectory-Based Routing in Ad Hoc Networks Murat Yuksel, Ritesh Pradhan, Shivkumar Kalyanaraman Electrical, Computer,
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks Bow-Nan Cheng Murat Yuksel Shivkumar Kalyanaraman.
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,
1 GPSR: Greedy Perimeter Stateless Routing for Wireless Networks B. Karp, H. T. Kung Borrowed some Richard Yang‘s slides.
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.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Impact of Directional Antennas on Ad Hoc Routing Romit Roy Choudhury Nitin H. Vaidya.
Network Coding vs. Erasure Coding: Reliable Multicast in MANETs Atsushi Fujimura*, Soon Y. Oh, and Mario Gerla *NEC Corporation University of California,
Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.
1 Virtual Direction Routing for Overlay Networks Bow-Nan Cheng Murat Yuksel Shivkumar Kalyanaraman.
1 Using Directionality in Wireless Routing Bow-Nan Cheng Advisors: Dr. Shivkumar Kalyanaraman Dr. Partha Dutta.
Ad Hoc Networking via Named Data Michael Meisel, Vasileios Pappas, and Lixia Zhang UCLA, IBM Research MobiArch’10, September 24, Shinhaeng.
MobiQuitous 2004Kimaya Sanzgiri Leveraging Mobility to Improve Quality of Service in Mobile Networks Kimaya Sanzgiri and Elizabeth Belding-Royer Department.
Mobile Routing protocols MANET
Routing Protocol Evaluation David Holmer
Wireless Access Research Congestion Avoidance in Source Routed Ad-Hoc Networks Bryan Hogan, Michael Barry, Ronan Skehill, Sean McGrath
1 Core-PC: A Class of Correlative Power Control Algorithms for Single Channel Mobile Ad Hoc Networks Jun Zhang and Brahim Bensaou The Hong Kong University.
Rendezvous-Based Directional Routing: A Performance Analysis Bow-Nan Cheng (RPI) Murat Yuksel (UNR) Shivkumar Kalyanaraman (RPI)
Efficient HopID Based Routing for Sparse Ad Hoc Networks Yan Chen Lab for Internet & Security Technology (LIST) Northwestern University
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
Small-Scale and Large-Scale Routing in Vehicular Ad Hoc Networks Wenjing Wang 1, Fei Xie 2 and Mainak Chatterjee 1 1 School of Electrical Engineering and.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
SRI International 1 A Simulation Comparison of TBRPF, OLSR, and AODV Richard Ogier SRI International July 2002.
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
DRP: An Efficient Directional Routing Protocol for Mobile Ad Hoc Networks Hrishikesh Gossain Mesh Networks Product Group, Motorola Tarun Joshi, Dharma.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
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:
DHT-based unicast for mobile ad hoc networks Thomas Zahn, Jochen Schiller Institute of Computer Science Freie Universitat Berlin 報告 : 羅世豪.
Minimizing Recovery State In Geographic Ad-Hoc Routing Noa Arad School of Electrical Engineering Tel Aviv University Yuval Shavitt School of Electrical.
Mitigating Routing Misbehavior in Mobile Ad Hoc Networks Sergio Marti, T.J. Giuli, Kevin.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
1 Using Directionality in Mobile Routing Bow-Nan Cheng (MIT LL) Murat Yuksel (Univ Nevada - Reno) Shivkumar Kalyanaraman (IBM IRL) (Work done at Rensselaer.
Network and Systems Laboratory nslab.ee.ntu.edu.tw R. Vedantham, S. Kakumanu, S. Lakshmanan and R. Sivakumar Georgia Institute of Technology Appear in.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
Video Streaming Transmission Over Multi-channel Multi-path Wireless Mesh Networks Speaker : 吳靖緯 MA0G WiCOM '08. 4th International.
Directional Routing for Wireless Mesh Networks: A Performance Evaluation Bow-Nan Cheng Murat Yuksel Shivkumar Kalyanaraman.
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
Copyright © 2002 OPNET Technologies, Inc. 1 Random Waypoint Mobility Model Empirical Analysis of the Mobility Factor for the Random Waypoint Model 1542.
A New Class of Mobility Models for Ad Hoc Wireless Networks Rahul Amin Advisor: Dr. Carl Baum Clemson University SURE 2006.
Nov. 29, 2006GLOBECOM /17 A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks Stephen S. Yau, Wei Gao, and Dazhi.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
HoWL: An Efficient Route Discovery Scheme Using Routing History in Mobile Ad Hoc Networks Faculty of Environmental Information Mika Minematsu
Virtual Direction Routing
A Location-Based Routing Method for Mobile Ad Hoc Networks
AODV-OLSR Scalable Ad hoc Routing
Murat Yuksel, Ritesh Pradhan, Shivkumar Kalyanaraman
GPSR Greedy Perimeter Stateless Routing
A comparison of Ad-Hoc Routing Protocols
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Improving Routing & Network Performances using Quality of Nodes
Presentation transcript:

Directional Routing for Wireless Mesh Networks: A Performance Evaluation Bow-Nan Cheng Murat Yuksel Shivkumar Kalyanaraman

By removing position information, can we still efficiently route packets? Motivation L3: Geographic Routing using Node IDs (eg. GPSR, TBF etc.) L2: ID to Location Mapping (eg. DHT, GLS etc.) L1: Node Localization ORRP N/A Issues in Position-based Schemes S N WE (0,4) (4,6) (5,1) (8,5) (12,3) (15,5)S D D(X,Y)? ?

Motivation – Multi-directional Transmission Methods Multi-directional AntennasTessellated FSO Transceivers Directional communications Model needed for ORRP 45 o 22.5 o

Introduction Up to 69% A 98% Metrics:  Reach Probability  Path Stretch / Average Path Length  Total States Maintained  Throughput Scenarios Evaluated:  Various Topologies  Network Voids  Network Mobility Path Stretch: ~1.2 1x4 ~ 3.24 B 57%

ORRP Basic Illustration Node C Fwd Table DestNextCostDir AB2120 o DD1230 o Node B Fwd Table DestNextCostDir AA190 o A B C D 1.ORRP Announcements (Proactive) – Generates Rendezvous node-to-destination paths ORRP Route REQuest (RREQ) Packets (Reactive) ORRP Route REPly (RREP) Packets (Reactive) 4. Data path after route generation 4 4

Reachability Numerical Analysis P{unreachable} = P{intersections not in rectangle} 4 Possible Intersection Points Reach Probability vs. Number of Lines – Numerical Analysis 1 Line (180 o )2 Lines (90 o )3 Lines (60 o ) Circle (Radius 10m)58.33%99.75%100% Square (10mx10m)56.51%98.30%99.99% Rectangle (25mx4m)34.55%57%67.61% Probability of reach does not increased dramatically with addition of lines above “2” (No angle correction)

Path Stretch Analysis Path Stretch vs. Number of Lines – Numerical Analysis 1 Line (180 o )2 Lines (90 o )3 Lines (60 o ) Circle (Radius 10m) Square (10mx10m) Rectangle (25mx4m) Grid (No Bounds) Path stretch decreases with addition of lines but not as dramatically as between 1 and 2 lines (No angle correction)

NS2 Sim Parameters/Specifications  Reach Probability Measurements Send only 2 CBR packets (to make sure no network flooding) from all nodes to all nodes and measure received packets  Average Path Length Measurements Number of hops from source to destination. If no path is found, APL is not recorded  Total State Measurements Number of entries in routing table snapshot  Throughput Scenarios 100 Random CBR Source-Destination connections per simulation run CBR Packet Size: 512 KB CBR Duration: 10s at Rate 2Kbps  Mobility Scenarios Random Waypoint Mobility Model Max node velocities: 2.5m/s, 5m/s, 7.5m/s Connectivity Sampling Frequency: Every 20s Simulation Time: 100s Number of Interfaces: 12  All Simulations Run 30 Times, averaged, and standard deviations recorded

Effect of Number of Lines on Various Topologies and Network Densities Sparse - 90% - 99% Medium – 95.5% - 99% Dense - 98% - 99% Medium - 66% - 93% Sparse - 63% - 82% Reach Probability increases with addition of lines but not as dramatically as between 1 and 2 lines Average Path Length decreases with addition of lines under similar conditions. APL increases in rectangular case because of higher reach of longer paths

Effect of Number of Lines on Various Topologies and Network Densities Reach Probability (Num Analysis w/o MAM vs. Sims w/ Avg. Density) 1 Line (180 o )2 Lines (90 o )3 Lines (60 o ) Topology Boundaries AnalysisSimsAnalysisSimsAnalysisSims Square 56.51%95.3%98.30%99.5%99.99%99.8% Rectangle 34.55%66.7%57%84.5%67.61%91.1% Total States Maintained increases with addition of lines (as expected) Angle Correction with MAM increases reach dramatically!

Effect of Number of Lines on Networks with Voids Reach Probability increases with addition of lines but not as dramatically as between 1 and 2 lines. Void structure yielded higher reach for sparser network Total States Maintained increases with addition of lines. Denser network needs to maintain more states (because of more nodes) Average Path Length remains fairly constant with addition of lines due to fewer paths options to navigate around voids  Observations/Discussions Reach probability increases with addition of lines but only dramatically from 1-2 lines. Void structure yielded higher reach for sparse network (odd) Average Path Length remains fairly constant (higher APL with denser network) with addition of lines due to fewer path options (there’s generally only 1 way around the perimeter of a void)

Effect of Number of Lines on Network Throughput Packet Delivery Success increases with addition of lines but not as dramatically as between 1 and 2 lines. Constant data streams are very bad (66% delivery success) for 1 line Average Path Length decreases with addition of lines due to better paths found Throughput increases with addition of lines due to higher data delivery and decreased path length (lower latency)  Observations/Discussions Reach probability increases with addition of lines but only dramatically from 1-2 lines. Constant data streams are not very good with 1 line Average Path Length decreases with addition of lines (better paths found) Throughput increases with additional lines (higher data delivery + decreased path length and lower packet delivery latency)

Effect of Number of Lines on Varying Network Mobility Reach Probability increases with addition of lines but decreases with increased max velocity. More lines has no “additional” affect on reach in varying mobility. Average Path Length decreases with addition of lines and decreases with max increased max velocity. More lines has little “additional” affect on APL in varying mobility  Observations/Discussions Reach probability increases with addition of lines but decreases with increased max velocity Average Path Length decreases with addition of lines (better paths found) More lines yields little to no “additional” affect on reach and average path length in varying mobile environments

Summary  Using Multiplier Angle Method (MAM) heuristic, even only 1 line provides a high degree of connectivity in symmetric topologies  Addition of lines yields significantly diminishing returns from a connectivity-state maintenance perspective after 1 line  Addition of lines yields better paths from source to destination and increases throughput  When mobility is added into the picture, addition of lines yields only marginal better delivery success and average paths chosen

Future Work  Mobile ORRP (MORRP)  Hybrid Direction and Omni-directional nodes  Exploring additional heuristics to maintain straight-line paths Thanks! Questions or Comments: