Alex Ladas, Deepak GC and Christos Politis christospolitis.com

Slides:



Advertisements
Similar presentations
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Advertisements

Design and Implementation of the OLSR Protocol in an Ad Hoc Framework Juan Gutiérrez Plaza Supervisor: Raimo Kantola Instructor: José Costa Requena Networking.
6LoWPAN Ad Hoc On-Demand Distance Vector Routing (LOAD) Ki-Hyung Kim, S. Daniel Park, G. Montenegro, S. Yoo, and N. Kushalnagar IETF 6LoWPAN WG 66th, Montreal,
1 Routing Techniques in Wireless Sensor networks: A Survey.
MPAC 2004Rae Harbird 1 RUBI Adaptive Resource Discovery for Ubiquitous Computing Rae Harbird Stephen Hailes
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Multicasting in Mobile Ad-Hoc Networks (MANET)
1 CWCCWC Oulu Determining the Optimal Configuration for the Zone Routing Protocol By M. R. Pearlman and Z. J. Haas Presentation by Martti Huttunen
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”,
Effects of Applying Mobility Localization on Source Routing Algorithms for Mobile Ad Hoc Network Hridesh Rajan presented by Metin Tekkalmaz.
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
HARP-Hybrid Ad Hoc Routing Protocol Navid NIKAEIN Christian BONNET Neda NIKAEIN © 2001 Navid Nikaein Eurecom Institute.
ENHANCING AND EVALUATION OF AD-HOC ROUTING PROTOCOLS IN VANET.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
Profiles and Multi-Topology Routing in Highly Heterogeneous Ad Hoc Networks Audun Fosselie Hansen Tarik Cicic Paal Engelstad Audun Fosselie Hansen – Poster,
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
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.
OLSR for InternetCAR system Keio University, Japan Ryuji Kouji
An OLSR implementation, experience, and future design issues.
Doc.: IEEE /1047r0 Submission Month 2000August 2004 Avinash Joshi, Vann Hasty, Michael Bahr.Slide 1 Routing Protocols for MANET Avinash Joshi,
S& EDG: Scalable and Efficient Data Gathering Routing Protocol for Underwater Wireless Sensor Networks 1 Prepared by: Naveed Ilyas MS(EE), CIIT, Islamabad,
An internet is a combination of networks connected by routers. When a datagram goes from a source to a destination, it will probably pass through many.
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.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
Self-stabilizing energy-efficient multicast for MANETs.
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
Strawman Recharter Nov 12, Basic Problem “The purpose of this working group is to standardize IP routing protocol functionality suitable for wireless.
Abstract 1/2 Wireless Sensor Networks (WSNs) having limited power resource report sensed data to the Base Station (BS) that requires high energy usage.
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
National Taiwan University Department of Computer Science and Information Engineering Vinod Namboodiri and Lixin Gao University of Massachusetts Amherst.
Advisor: Prof. Han-Chieh Chao Student: Joe Chen Date: 2011/06/07.
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.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Routing Metrics for Wireless Mesh Networks
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Lec4: Introduction to Dynamic Routing Protocol
Analysis the performance of vehicles ad hoc network simulation based
IMPROVEMENT OF NETWORK LIFETIME BY IMPROVING ROUTE DISCOVERY PHASE IN MULTI-PATH DSR USING HYBRID ANT COLONY OPTIMIZATION.
Routing Metrics for Wireless Mesh Networks
AODV-OLSR Scalable Ad hoc Routing
Lecture 28 Mobile Ad hoc Network Dr. Ghalib A. Shah
802.11s Proposal - Joint SEE-Mesh/Wi-Mesh Proposal to TGs
Routing design goals, challenges,
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
Outline Introduction Routing in Mobile Ad Hoc Networks
Wireless Sensor Network Architectures
Source: Department of Motor Traffic Sri Lanka statistics
Sensor Network Routing
Lei Chen and Wendi B. Heinzelman , University of Rochester
Networks and Communication Systems Department
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Introduction to Dynamic Routing Protocol
Ad hoc Routing Protocols
Introduction to Dynamic Routing Protocol
Routing Metrics for Wireless Mesh Networks
A New Multipath Routing Protocol for Ad Hoc Wireless Networks
Abhinandan Ramaprasath, Anand Srinivasan,
Privacy Preservation and Protection Scheme over ALARM on Geographical routing B. Muthusenthil, S. Murugavalli Results The PPS is geographical routing protocol,
A survey on Bio inspired Routing in MANETs
Study of performance of regular TCP in MANETs (using simulator).
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)
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Presentation transcript:

Multipath ChaMeLeon (M-CML): A multipath hybrid routing protocol for MANETs Alex Ladas, Deepak GC and Christos Politis c.politis@kingston.ac.uk christospolitis.com Kingston University, London, UK Wireless Multimedia and Networking Research Group

Introduction The multipath ChaMeLeon (M-CML) is the multipath version of ChaMeLeon version 2 (CMLv2) routing protocol. A multi-path, hybrid and adaptive routing protocol for MANETs that operates within a defined area denoted as the Critical Area The autonomous nature of MANETs is very suitable for a variety of scenarios - changes in e.g. node density, delay profile, energy consumption - multiple disjoint paths exist 08/11/2018 IETF 103, Bangkok, Thailand

M-CML Aim: To increase overall efficiency (throughput, delay and energy efficiency) of pure approaches based on the network state. Nature: hybrid and adaptive according to network scenarios. Application: Primarily designed for emergency MANETs but could be used for general purpose MANETs. Functionality: 4 phases of operation (P-phase, M-phase, R-phase and O-phase). A phase is a routing or data analysis state including the added interaction with the M-CML Adaptive Module. CML messages: Change Phase (CP), Hop Count Request (HCReq) and Hop Count Reply (HCRep) Message. 08/11/2018 IETF 103, Bangkok, Thailand

M-CML Overview (1) Adapt its routing behavior (or phases) on-the-fly according to the changes in MANET network behavior Mobility, node density, energy consumption, QoS MANET implementation  default is proactive routing (P-phase)  multi-path OLSR v2 Monitoring phase (M-phase) is triggered when HCreq is received by MANET nodes, i.e., M-phase runs within the P-phase Reactive phase (R-phase) is triggered when network scenario favours reactive routing  AODV v2 Oscillation (O-phase) is the transition phase (P to R, R to P) to generate and maintain new routing protocol table 08/11/2018 IETF 103, Bangkok, Thailand

M-CML Overview (2) Pre-requisite: It has to create a set of network scenarios that is fit for particular routing protocols Four scenarios created by varying: Node density, node mobility, energy consumption, QoS requirements Through a series of simulation results, best routing protocols is identified for network scenarios Adaptive Module inside the node analyse the network scenario data and triggers the appropriate phase The M-phase runs within regular intervals so that it can track the dynamic nature of MANET 08/11/2018 IETF 103, Bangkok, Thailand

M-CML Overview (3) MANET Deployment P-phase HCReq P-phase Network Scenarios 1 2 3 4 M-phase P-phase Adaptive Module R-phase O-phase 08/11/2018 IETF 103, Bangkok, Thailand

Adapt (Phase flag, context, call) Algorithm M-phase If Network receives HCReq, this phase is triggered. Measures Nsize, Mob, EE. P-phase Receive Routing Packets Execute MP-OLSR v2 Receive Data Packets Contact Adaptive Module R-phase Receive Routing Packets Execute AODV v2 Receive Data Packets Contact Adaptive Module Adaptive Module Monitor (Phase flag) If Network Size Threshold (NST), or mobility exceeded, Call Adapt function Else return to stable phase (2(a) or 2(b)) Adapt (Phase flag, context, call) Initialise O-phase 1a 1b 2b 2a 5a 5b 3 4 O-phase Continue current stable phase of operation Check Oscillation Timer : If valid go back to phase (4)(2(a) or 2(b)) Check (context, phase flag, call) values: If (Nsize, Mob, p-phase, monitor), check node count validity; If (Nsize, r-phase, monitor), check hop count validity ; If (Nsize, *, CML_CP), check CP packet validity ; If validity check fails, go back to stable phase (4)->(2(a) or 2(b))) Switch to R-phase or P-phase if checks are successful (5(a) or 5(b)) Send CP packets to alert neighbours of phase change. Reset Oscillation Timer. 08/11/2018 IETF 103, Bangkok, Thailand

Features Balance point between p-phase and r-phase: Considering Network Size Threshold (NST) as an example. P-phase; If (MANETsize > NST) { switch to O-phase} O-phase; if (Oscillation == false) {switch to (nxt_phase)} else return (current_phase) R-phase; If (MANETsize <= NST) { switch to O-phase} Max. Hop count = Function (sqrt (Nt)) - Monitor Function: Network Parameter Estimation - Adapt Function: call the O-phase with the necessary flags O-phase avoids group and periodic oscillations. 08/11/2018 IETF 103, Bangkok, Thailand

Future Directions In M-CMLv2, multipath version of the AODV. i.e., AOMDV, will be considered to make it fully multipath More Network scenario will be considered for routing protocols MP-OLSR and AOMDV to make it accurate transition The O-phase optimization will be taken into consideration to minimize the control packets during O-phase M-CMLv2 will be implemented with new link metrics . Contribute more by aligning our future work more closely to MANET WG charter. 08/11/2018 IETF 103, Bangkok, Thailand