Robust MANET Design John P. Mullen, Ph.D. Timothy I. Matis, Ph.D. Smriti Rangan Karl Adams Center for Stochastic Modeling New Mexico State University May.

Slides:



Advertisements
Similar presentations
1 A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks By Lei Chen.
Advertisements

Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
DSR The Dynamic Source Routing Protocol Students: Mirko Gilioli Mohammed El Allali.
“Location-Aided Routing (LAR) in Mobile Ad Hoc Network” by Young-bae ko Nitin H. Validya presented by Mark Miyashita.
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
Ad-Hoc Networking Course Instructor: Carlos Pomalaza-Ráez A Paper Presentation of ”Multihop Sensor Network Design for Wide-Band Communications” Proceedings.
June 3, A New Multipath Routing Protocol for Ad Hoc Wireless Networks Amit Gupta and Amit Vyas.
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols By Josh Broch, David A. Maltz, David B. Johnson, Yih- Chun Hu, Jorjeta.
Progress Report Wireless Routing By Edward Mulimba.
Performance Comparison of Routing Protocols for Ad Hoc Networks PATTERN ENDIF Ferrara.
Routing in Mobile Ad Hoc Networks Marc Heissenbüttel University of Berne Bern,
CS541 Advanced Networking 1 Mobile Ad Hoc Networks (MANETs) Neil Tang 02/02/2009.
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.
17/10/2003TCP performance over ad-hoc mobile networks. 1 LCCN – summer 2003 Uri Silbershtein Roi Dayagi Nir Hasson.
1 A Novel Mechanism for Flooding Based Route Discovery in Ad hoc Networks Jian Li and Prasant Mohapatra Networks Lab, UC Davis.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
Maximizing Path Durations in Mobile Ad- Hoc Networks Yijie Han and Richard J. La Department of ECE & ISR University of Maryland, College Park CISS, Princeton.
Computer Networks: Wireless Networks Ivan Marsic Rutgers University Chapter 6 – Wireless Networks.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
Ad Hoc Wireless Routing COS 461: Computer Networks
ENHANCING AND EVALUATION OF AD-HOC ROUTING PROTOCOLS IN VANET.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
1 Seminar Algorithms for ad hoc networking: Patrik Floréen Seminar Introduction.
Mobile Ad-Hoc Networking By Jared Roberts. Overview What is a MANET? What is a MANET? Problems with routing in a MANET Problems with routing in a MANET.
A Simple and Effective Cross Layer Networking System for Mobile Ad Hoc Networks Wing Ho Yuen, Heung-no Lee and Timothy Andersen.
Mobile Adhoc Network: Routing Protocol:AODV
Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.
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.
Enhancing Link Duration and Path Stability of Routing Protocols in VANETs Presented by: Sanjay Kumar, Haresh Kumar and Zahid Yousuf Supervised by: Dr.
Routing Protocols of On- Demand Dynamic Source Routing (DSR) Ad-Hoc On-Demand Distance Vector (AODV)
Dilshad Haleem CST593 summer 2007 Routing In Wireless Mesh Networks CST593 Final Project by Dilshad Haleem Division of Computing Studies, ASU Polytechnic.
Effects of Multi-Rate in Ad Hoc Wireless Networks
Routing Protocols for Mobile Ad-Hoc Networks By : Neha Durwas For: Professor U.T. Nguyen COSC 6590.
Dynamic Source Routing (DSR) Sandeep Gupta M.Tech - WCC.
A Distributed Relay-Assignment Algorithm for Cooperative Communications in Wireless Networks ICC 2006 Ahmed K. Sadek, Zhu Han, and K. J. Ray Liu Department.
SRL: A Bidirectional Abstraction for Unidirectional Ad Hoc Networks. Venugopalan Ramasubramanian Ranveer Chandra Daniel Mosse.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
Ch 4. Routing in WMNs Myungchul Kim
Designing Reliable Delivery for Mobile Ad-hoc Networks in Robots BJ Tiemessen Advisor: Dr. Dan Massey Department of Computer Science Colorado State University.
Primary Author: J.P. Mullen, Presented by: T.I. Matis, 10/26/2004 Stochastic Characterization of Mobile Ad-hoc Networks John P. Mullen and Timothy I. Matis.
Intro DSR AODV OLSR TRBPF Comp Concl 4/12/03 Jon KolstadAndreas Lundin CS Ad-Hoc Routing in Wireless Mobile Networks DSR AODV OLSR TBRPF.
Session 15 Mobile Adhoc Networks Prof. Sridhar Iyer IIT Bombay
CSR: Cooperative Source Routing Using Virtual MISO in Wireless Ad hoc Networks IEEE WCNC 2011 Yang Guan, Yao Xiao, Chien-Chung Shen and Leonard Cimini.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
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.
Mobile Ad Hoc Network (MANET)
Energy Efficiency Energy consumption is the most important factor to determine the life of sensor network. since sensors networks has low power resources,
Mobile Ad Hoc Networking By Shaena Price. What is it? Autonomous system of routers and hosts connected by wireless links Can work flawlessly in a standalone.
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Analysis the performance of vehicles ad hoc network simulation based
AODV-OLSR Scalable Ad hoc Routing
Lecture 28 Mobile Ad hoc Network Dr. Ghalib A. Shah
DSDV Highly Dynamic Destination-Sequenced Distance-Vector Routing
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
Sensor Network Routing
Ad Hoc Networks - Performance
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Ad hoc Routing Protocols
by Saltanat Mashirova & Afshin Mahini
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Proactive vs. Reactive Routing
Routing in Mobile Ad-hoc Networks
Vinay Singh Graduate school of Software Dongseo University
Routing protocols in Mobile Ad Hoc Network
Routing in Mobile Wireless Networks Neil Tang 11/14/2008
A Talk on Mobile Ad hoc Networks (Manets)
Presentation transcript:

Robust MANET Design John P. Mullen, Ph.D. Timothy I. Matis, Ph.D. Smriti Rangan Karl Adams Center for Stochastic Modeling New Mexico State University May 16, 2004

11/20/20032 What Are MANETS ? A MANET is a mobile ad-hoc wireless communication network that is capable of autonomous operation Each node is capable of transmitting, receiving, and routing packets of information. The network has no fixed backbone (such as with the Internet and cellular phones) The nodes are able to enter, leave, and move around the network independently and randomly

11/20/20033 Mobile Ad Hoc Path Search Y X A B I G E F C D H

11/20/20034 Same MANET After a While Y X A B I G E F C D H H X I G F E D B A C Y

11/20/20035 Types of Packets Control Packets – –RREQ’ s and RREP’s – Used to establish communication links between the source and destination nodes. There are numerous protocols that have been proposed for their “optimal” use in finding reliable links at minimal bandwidth –ACK’s – Used to ascertain the quality of a link and ensure successful communication. The destination node sends an acknowledgement (ack) packet back to the source after each successful data packet transmission. Data Packets –Contain the actual information that is to be communicated broken up into “packets” of uniform size –Data packets are much larger than control packets

11/20/20036 Protocol Taxonomy Single channel protocols uniform Destination based reactive proactive topology-based reactive proactive Non-uniform partitioning Neighbor selection AODV TORA ABR DSDV WRP DSR GSR CEDAR CBRP ZRP OLSR

11/20/20037 MANET Models Current MANET Models –Received power is a deterministic function of distance –Node communication (p received  p min ) is flawless within a nominal range, r 0, and is not possible (p received  p min ) beyond this range In actuality, the received power process is highly stochastic due primarily to shadowing and fading

11/20/20038 Current Assumption: Rec. Power is a deterministic function of distance p(r) Current vs. Observed Field Measurements: From Neskovic 2002 – Fig. 2

11/20/20039 Evaluating Protocols The deterministic power assumption is the default of most simulation software (OpNet, NS2, NAB) used to evaluate protocol performance The stochastic problem is typically viewed as a minor (and unimportant) nuisance by the CS and EE communities that design these protocols

11/20/ Rayleigh Fading The instantaneous received voltage in an inefficient, low power, and complex RF environment often follows a Rayleigh distribution As a result, it follows that received power is exponentially distributed Further, we assume power exponentially decays with distance

11/20/ PDF of Received Power

11/20/ Initial Test Scenario

11/20/ Rec Power –Current Model

11/20/ Current vs Proposed Model

11/20/ Real Vs. Memorex

11/20/ Impact on Link Throughput

11/20/ Findings Not all packets within nominal range are transmitted successfully Not all packets outside the range are unsuccessful

11/20/ Scenario Two – DSR Protocol Source Relay Dest.

11/20/ RF Propagation Distances Source Relay Dest.

11/20/ Throughput

11/20/ End-to-End Delay Delay = sec In no-fading model

11/20/ Route Discovery Time One Route discovery In no-fading model

11/20/ Transmit Buffer Size Buffer size is 2.0 In no-fading model

11/20/ Hops per Route 1.5 hops average A-B: 1 hop A-C: 2 hops In no-fading model

11/20/ The Basic Problem Source Relay Dest.

11/20/ Ping - Pong 2-hop 1-hop ABC ABC p 2 = 2p 1 p 2 = 50p 1

11/20/ Throughput vs. Tries

11/20/ Delay vs. Tries

11/20/ Buffer Size vs. Tries

11/20/ Findings Only through accurate stochastic simulations can 1.The true performance of existing protocols be evaluated 2.The parameters of these protocols be optimized for robust performance 3.New robust protocols be developed Parameters not significant in deterministic models (such as packet retry) are important in stochastic models

11/20/ Robust MANET Design RSM may be used to optimize the performance of established protocols for the controllable parameters (F, number of TX tries, etc.) over the uncontrollable parameters (c, TX rate, etc.) As an example, consider optimizing the number of TX tries (1,2,3,4) over 2 levels of TX rate (71.5,143 in packets/sec) using throughput as a measure of performance

11/20/ Throughput (packets/sec)

11/20/ Throughput (High/Low Data Rates)

11/20/ Relative Throughput

11/20/ Relative Throughput (High/Low)

11/20/ Mean Delay

11/20/ Mean Delay (High/Low)

11/20/ Mean Transmit Buffer Size

11/20/ Mean Total Bits Per Second

11/20/ Mean Routing Bits per Second

11/20/ Mean Non-Routing Bits

11/20/ Questions ? John Mullen Tim Matis Center for Stochastic Modelling