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)
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,
Directional Routing for Wireless Mesh Networks: A Performance Evaluation Bow-Nan Cheng Murat Yuksel Shivkumar Kalyanaraman.
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.
Effects of Applying Mobility Localization on Source Routing Algorithms for Mobile Ad Hoc Network Hridesh Rajan presented by Metin Tekkalmaz.
When does opportunistic routing make sense? Rahul C. Shah, Jan Rabaey University of California, Berkeley Sven Wiethölter, Adam Wolisz Technical University,
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.
Trajectory-Based Forwarding Mechanisms for Ad-Hoc Sensor Networks Murat Yuksel, Ritesh Pradhan, Shivkumar Kalyanaraman Electrical, Computer, and Systems.
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.
Impact of Directional Antennas on Ad Hoc Routing Romit Roy Choudhury Nitin H. Vaidya.
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
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.
VIRTUAL ROUTER Kien A. Hua Data Systems Lab School of EECS University of Central Florida.
MobiQuitous 2004Kimaya Sanzgiri Leveraging Mobility to Improve Quality of Service in Mobile Networks Kimaya Sanzgiri and Elizabeth Belding-Royer Department.
Institut für Betriebssysteme und Rechnerverbund Technische Universität Braunschweig Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur.
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.
Improving QoS Support in Mobile Ad Hoc Networks Agenda Motivations Proposed Framework Packet-level FEC Multipath Routing Simulation Results Conclusions.
Rendezvous-Based Directional Routing: A Performance Analysis Bow-Nan Cheng (RPI) Murat Yuksel (UNR) Shivkumar Kalyanaraman (RPI)
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.
SRL: A Bidirectional Abstraction for Unidirectional Ad Hoc Networks. Venugopalan Ramasubramanian Ranveer Chandra Daniel Mosse.
DRP: An Efficient Directional Routing Protocol for Mobile Ad Hoc Networks Hrishikesh Gossain Mesh Networks Product Group, Motorola Tarun Joshi, Dharma.
Geo Location Service CS218 Fall 2008 Yinzhe Yu, et al : Enhancing Location Service Scalability With HIGH-GRADE Yinzhe Yu, et al : Enhancing Location Service.
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.
Multipath TCP in a Lossy ad hoc Wireless Network Medhocnet 2004 Bodrum, June 2004 Jiwei Chen, Kaixin Xu, Mario Gerla UCLA.
Network and Systems Laboratory nslab.ee.ntu.edu.tw R. Vedantham, S. Kakumanu, S. Lakshmanan and R. Sivakumar Georgia Institute of Technology Appear in.
Evaluating Mobility Support in ZigBee Networks
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.
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.
DETECTION AND IGNORING BLACK HOLE ATTACK IN VANET NETWORKS BASED LATENCY TIME CH. BENSAID S.BOUKLI HACENE M.K.FAROUAN 1.
A New Class of Mobility Models for Ad Hoc Wireless Networks Rahul Amin Advisor: Dr. Carl Baum Clemson University SURE 2006.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
1 Ad-hoc Transport Layer Protocol (ATCP) EECS 4215.
Virtual Direction Routing
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
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Improving Routing & Network Performances using Quality of Nodes
Routing in Mobile Wireless Networks Neil Tang 11/14/2008
Presentation transcript:

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

Motivation – Multi-directional Transmission Methods Multi-directional AntennasTessellated FSO Transceivers Can we use Directionality in Layer 3 Routing?

ORRP Big Picture Up to 69% A 98% B 180 o Orthogonal Rendezvous Routing Protocol S T ORRP Primitive - Local sense of direction leads to ability to forward packets in opposite directions Multiplier Angle Method (MAM) Heuristic to handle voids, angle deviations, and perimeter cases

Benefits of ORRP L3: Geographic Routing using Node IDs (eg. GPSR, TBF etc.) L2: ID to Location Mapping (eg. GHT, 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)? By forwarding to rendezvous nodes, ORRP is able to successfully route packets without need for Node Localization

Motivation A 98% Metrics:  Reach Probability  Path Stretch / Average Path Length  Total States Maintained  Throughput Scenarios Evaluated:  Various Topologies  Various Densities  Network Voids Path Stretch: ~1.2 1x4 ~ 3.24 B 57% By adding lines, can we decrease path stretch and increase reach probability without paying too much penalty?

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 increase 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  All Simulations Run 30 Times, averaged, and standard deviations recorded Number of Lines Amount of State Maintained Reach Probability Average Path Length Throughput

Effect of Number of Lines on Various Topologies and Network Densities Total States Maintained increases with addition of lines (as expected)

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

Numerical Analysis vs. Simulations 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% Angle Correction with MAM increases reach dramatically! Path Stretch (Num Analysis w/o MAM vs. Simulations) 1 Line (180 o )2 Lines (90 o )3 Lines (60 o ) Topology Boundaries AnalysisSimsAnalysisSimsAnalysisSims Square

Additional Simulation Results  Network Voids Average path length fairly constant (Reach and State not different)  Throughput Higher average network throughput with additional lines (better paths and higher reach)  Mobility Significantly drops in reach (ORRP never designed for mobility)

Summary  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  Using Multiplier Angle Method (MAM) heuristic, even only 1 line provides a high degree of connectivity in symmetric topologies  When mobility is added into the picture, addition of lines yields only marginally 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:

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

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 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