Rendezvous-Based Directional Routing: A Performance Analysis Bow-Nan Cheng (RPI) Murat Yuksel (UNR) Shivkumar Kalyanaraman (RPI)

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

Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
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.
802.11a/b/g Networks Herbert Rubens Some slides taken from UIUC Wireless Networking Group.
Network Layer Routing Issues (I). Infrastructure vs. multi-hop Infrastructure networks: Infrastructure networks: ◦ One or several Access-Points (AP) connected.
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.
Fault Tolerant Routing in Tri-Sector Wireless Cellular Mesh Networks Yasir Drabu and Hassan Peyravi Kent State University Kent, OH
Self-Organizing Hierarchical Routing for Scalable Ad Hoc Networking David B. Johnson Department of Computer Science Rice University Monarch.
Directional Routing for Wireless Mesh Networks: A Performance Evaluation Bow-Nan Cheng Murat Yuksel Shivkumar Kalyanaraman.
Multicasting in Mobile Ad-Hoc Networks (MANET)
Arsitektur Jaringan Terkini
Progress Report Wireless Routing By Edward Mulimba.
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”,
Optimal Communication Coverage for Free-Space-Optical MANET Building Blocks Murat Yuksel, Jayasri Akella, Shivkumar Kalyanaraman, Partha Dutta Electrical,
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,
Wireless Ad Hoc Network Routing Protocols CSE Maya Rodrig.
CS541 Advanced Networking 1 Mobile Ad Hoc Networks (MANETs) Neil Tang 02/02/2009.
Security of wireless ad-hoc networks. Outline Properties of Ad-Hoc network Security Challenges MANET vs. Traditional Routing Why traditional routing protocols.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
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.
ENHANCING AND EVALUATION OF AD-HOC ROUTING PROTOCOLS IN VANET.
1 Using Directionality in Wireless Routing Bow-Nan Cheng Advisors: Dr. Shivkumar Kalyanaraman Dr. Partha Dutta.
Capacity of Wireless Mesh Networks: Comparing Single- Radio, Dual-Radio, and Multi- Radio Networks By: Alan Applegate.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
Routing Security in Wireless Ad Hoc Networks Chris Zingraf, Charisse Scott, Eileen Hindmon.
Capacity Scaling with Multiple Radios and Multiple Channels in Wireless Mesh Networks Oguz GOKER.
CSE 6590 Fall 2010 Routing Metrics for Wireless Mesh Networks 1 4 October, 2015.
PERFORMANCE ANALYSIS OF AODV, OLSR, DSR AND GRP ROUTING PROTOCOL OF MOBILE ADHOC NETWORK – A REVIEW IJCSMC, Vol. 2, Issue. 6, June 2013, pg.359 – 362 Suchita.
Improving QoS Support in Mobile Ad Hoc Networks Agenda Motivations Proposed Framework Packet-level FEC Multipath Routing Simulation Results Conclusions.
Content-Based Routing in Mobile Ad Hoc Networks Milenko Petrovic, Vinod Muthusamy, Hans-Arno Jacobsen University of Toronto July 18, 2005 MobiQuitous 2005.
Enhancing Link Duration and Path Stability of Routing Protocols in VANETs Presented by: Sanjay Kumar, Haresh Kumar and Zahid Yousuf Supervised by: Dr.
Rendezvous-Based Directional Routing: A Performance Analysis Bow-Nan Cheng (RPI) Murat Yuksel (UNR) Shivkumar Kalyanaraman (RPI)
Scalable Ad Hoc Routing the Case for Dynamic Addressing.
Designing Routing Protocol For Mobile Ad Hoc Networks Navid NIKAEIN Christian BONNET EURECOM Institute Sophia-Antipolis France.
WIRELESS AD-HOC NETWORKS Dr. Razi Iqbal Lecture 6.
AD-HOC NETWORK SUBMITTED BY:- MIHIR GARG A B.TECH(E&T)/SEC-A.
CSE 6590 Fall 2009 Routing Metrics for Wireless Mesh Networks 1 12 November, 2015.
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.
MANET: Introduction Reference: “Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations”; S. Corson and J.
1 Using Directionality in Mobile Routing Bow-Nan Cheng (MIT LL) Murat Yuksel (Univ Nevada - Reno) Shivkumar Kalyanaraman (IBM IRL) (Work done at Rensselaer.
Communication in heterogeneous ad hoc grid Shan Natarajan.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
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.
Intro Wireless vs. wire-based communication –Costs –Mobility Wireless multi hop networks Ad Hoc networking Agenda: –Technology background –Applications.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
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.
12.Nov.2007 Capacity of Ad Hoc Wireless Networks Jinyang Li Charles Blake Douglas S. J. De Coutu Hu Imm Lee Robert Morris Paper presentation by Tonio Gsell.
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.
Puzzle You have 2 glass marbles Building with 100 floors
Routing Metrics for Wireless Mesh Networks
Virtual Direction Routing
Routing Metrics for Wireless Mesh Networks
AODV-OLSR Scalable Ad hoc Routing
Murat Yuksel, Ritesh Pradhan, Shivkumar Kalyanaraman
Lecture 28 Mobile Ad hoc Network Dr. Ghalib A. Shah
MOBILE AD-HOC NETWORKS
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
Trajectory Based Forwarding
A comparison of Ad-Hoc Routing Protocols
Sensor Network Routing
Ad hoc Routing Protocols
Routing Metrics for Wireless Mesh Networks
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Routing in Mobile Ad-hoc Networks
Presentation transcript:

Rendezvous-Based Directional Routing: A Performance Analysis Bow-Nan Cheng (RPI) Murat Yuksel (UNR) Shivkumar Kalyanaraman (RPI)

Motivation Main Issue: Scalability Infrastructure / Wireless Mesh Networks Characteristics: Fixed, unlimited energy, virtually unlimited processing power Dynamism – Link Quality Optimize – High throughput, low latency, balanced load Mobile Adhoc Networks (MANET) Characteristics: Mobile, limited energy Dynamism – Node mobility + Link Quality Optimize – Reachability Sensor Networks Characteristics: Data-Centric, extreme limited energy Dynamism – Node State/Status (on/off) Optimize – Power consumption

Scaling Networks: Trends in Layer 3 Flood-basedHierarchy/StructuredUnstructured/Flat Scalable Mobile Ad hoc / Wireless Infrastructure Networks DSR, AODV, TORA, DSDV OLSR, HSLS, LGF Hierarchical Routing, VRR, GPSR+GLS Peer to Peer / Overlay Networks Wired Networks Gnutella Kazaa, DHT Approaches: CHORD, CAN Ethernet Routers (between AS) WSR SEIZE

Trends: Directional Antennas  Directional Antennas – Capacity Benefits Theoretical Capacity Improvements - factor of 4 2 /sqrt() where  and  are the spreads of the sending and receiving transceiver ~ 50x capacity with 8 Interfaces (Yi et al., 2005) Sector Antennas in Cell Base Stations – Even only 3 sectors increases capacity by (Rappaport, 2006) Directional Antennas – Simulations show 2-3X more capacity (Choudhury et al., 2003)

Trends: Hybrid FSO/RF MANETs  Current RF-based Ad Hoc Networks: 802.1x with omni-directional RF antennas High-power – typically the most power consuming parts of laptops Low bandwidth – typically the bottleneck link in the chain Error-prone, high losses Free-Space-Optical (FSO) Communications Mobile Ad Hoc Networking High bandwidth Low power Dense spatial reuse License-free band of operation Mobile communication Auto-configuration Free-Space-Optical Ad Hoc Networks Spatial reuse and angular diversity in nodes Low power and secure Electronic auto-alignment Optical auto-configuration (switching, routing) Interdisciplinary, cross-layer design

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

Motivation A 98% Metrics:  Reach Probability  Path Stretch / Average Path Length  Total States Maintained  Goodput  End-to-End Latency Scenarios Evaluated:  Various Topologies  Various Densities  Various Number of Interfaces  Various Number of Connections  Transmission Rates  Comparison vs. AODV, DSR 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 Goodput End-to-End Latency Number of Control Packets

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

Effect of Network Density Average Path Length decreases for increased number of lines in ORRP but still longer than shortest path protocols Total end to end Latency decreases for increased number of lines in ORRP. This is significantly better than DSR and AODV Average Path Length EvalTotal Packet Latency Eval

Effect of Number of Connections and CBR Rate Delivery Success increases for increased number of lines but remains constant with number of CBR connections Aggregate Network Goodput increases for increased number of lines. It is about 20-30X more network goodput than DSR and AODV Packet Delivery SuccessAggregate Network Goodput

Additional Simulation Results  Network Voids Average path length fairly constant (Reach and State not different)  Number of Interfaces Increasing # of interfaces per node yields better results for reach, average path length, and average goodput to a certain point determined by network density.  Number of Continuous Flows Average path length remains fairly constant with increased flows but increases with less lines. The average is still higher than AODV and DSR path lengths.  Control Packets Control packets sent by ORRP with multiple lines are significantly more than with AODV and DSR because ORRP is hybrid proactive and reactive so CP increase with time. But because medium is used more efficiently, goodput remains high.

Summary  Addition of lines yields significantly diminishing returns from a connectivity-state maintenance/control packets perspective after 1 line  Addition of lines yields better paths from source to destination and increases goodput  Using Multiplier Angle Method (MAM) heuristic, even only 1 line provides a high degree of connectivity in symmetric topologies  Addition of lines yields better aggregate godoput overall and about 20x more goodput than DSR and AODV  Increasing the number of interfaces per node yields better results for reachability, average path length, and average goodput up to a certain point that is determined by network density  As number of continuous flows increase, ORRP with increased lines delivers more packets successfully.

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