Profiles and Multi-Topology Routing in Highly Heterogeneous Ad Hoc Networks Audun Fosselie Hansen Tarik Cicic Paal Engelstad Audun Fosselie Hansen – Poster,

Slides:



Advertisements
Similar presentations
Dynamic Source Routing (DSR) algorithm is simple and best suited for high mobility nodes in wireless ad hoc networks. Due to high mobility in ad-hoc network,
Advertisements

1 A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks By Lei Chen.
Security in Mobile Ad Hoc Networks
MMT (Multi Meshed Tree) Protocols for Cognitive Airborne Networks Nirmala Shenoy Lab for Wireless Networking and Security Rochester Institute of Technology.
Design and Implementation of the OLSR Protocol in an Ad Hoc Framework Juan Gutiérrez Plaza Supervisor: Raimo Kantola Instructor: José Costa Requena Networking.
802.11a/b/g Networks Herbert Rubens Some slides taken from UIUC Wireless Networking Group.
MPAC 2004Rae Harbird 1 RUBI Adaptive Resource Discovery for Ubiquitous Computing Rae Harbird Stephen Hailes
Multicasting in Mobile Ad-Hoc Networks (MANET)
Arsitektur Jaringan Terkini
Progress Report Wireless Routing By Edward Mulimba.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #4 Mobile Ad-Hoc Networks AODV Routing.
Security of wireless ad-hoc networks. Outline Properties of Ad-Hoc network Security Challenges MANET vs. Traditional Routing Why traditional routing protocols.
Security Risks for Ad Hoc Networks and how they can be alleviated By: Jones Olaiya Ogunduyilemi Supervisor: Jens Christian Godskesen © Dec
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #5 Mobile Ad-Hoc Networks TBRPF.
1 Internet Networking Spring 2006 Tutorial 3 Ad-hoc networks TBRPF (based on IETF tutorials on TBRPF)
March 13, 2003 Routing Functional Components Steven D. Jones (JHU/APL) Chunyue Liu (CCNY) Tarek Saadawi (CCNY) I-Jeng Wang (JHU/APL)
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
August 6, Mobile Computing COE 446 Network Planning Tarek Sheltami KFUPM CCSE COE Principles of.
Ad Hoc Wireless Routing COS 461: Computer Networks
Wireless internet routing Philippe Jacquet. Internet and networking Internet –User plurality connected to –Sources plurality.
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.
Ad Hoc Networking via Named Data Michael Meisel, Vasileios Pappas, and Lixia Zhang UCLA, IBM Research MobiArch’10, September 24, Shinhaeng.
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #3 Mobile Ad-Hoc Networks AODV Routing.
Mobile Adhoc Network: Routing Protocol:AODV
CSE 6590 Fall 2010 Routing Metrics for Wireless Mesh Networks 1 4 October, 2015.
IDRM: Inter-Domain Routing Protocol for Mobile Ad Hoc Networks C.-K. Chau, J. Crowcroft, K.-W. Lee, S. H.Y. Wong.
ROUTING ALGORITHMS IN AD HOC NETWORKS
1 Heterogeneity in Multi-Hop Wireless Networks Nitin H. Vaidya University of Illinois at Urbana-Champaign © 2003 Vaidya.
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.
Doc.: IEEE /1047r0 Submission Month 2000August 2004 Avinash Joshi, Vann Hasty, Michael Bahr.Slide 1 Routing Protocols for MANET Avinash Joshi,
IP fast reroute s olutions and challenges Amund Kvalbein.
Outline Introduction Existing solutions for ad hoc
Security in Mobile Ad Hoc Networks: Challenges and Solutions (IEEE Wireless Communications 2004) Hao Yang, et al. October 10 th, 2006 Jinkyu Lee.
A Scalable Routing Protocol for Ad Hoc Networks Eric Arnaud Id:
Fast recovery in IP networks using Multiple Routing Configurations Amund Kvalbein Simula Research Laboratory.
Routing Security in Wireless Ad Hoc Networks Chris Zingraf, Charisse Scott, Eileen Hindmon.
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.
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.
Ordering in Time: A New Routing Approach for Wireless Networks Stephen Dabideen and J.J. Garcia-Luna-Aceves Department of Computer Engineering University.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Jim Parker CMSC691t Spring 2000 “Ad-hoc On-Demand Distance Vector Routing” A dynamic routing algorithm for mobile ad-hoc networks.
MPLS Introduction How MPLS Works ?? MPLS - The Motivation MPLS Application MPLS Advantages Conclusion.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
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.
Survey of Ad Hoc Network Routing Protocols Team Adhocracy Presentation 1 – April 5, 2007 Jason Winnebeck Benjamin Willis Travis Thomas.
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.
Author:Zarei.M.;Faez.K. ;Nya.J.M.
IMPROVING OF WIRELESS MESH NETWORKS.
Amund Kvalbein, Audun F. Hansen,
AODV-OLSR Scalable Ad hoc Routing
Lecture 28 Mobile Ad hoc Network Dr. Ghalib A. Shah
Routing design goals, challenges,
Outline Introduction Routing in Mobile Ad Hoc Networks
Internet Networking recitation #4
Sideseadmed (IRT0040) 2.5 AP Avo LOENG 5.
Sensor Network Routing
CSE 4340/5349 Mobile Systems Engineering
Routing In Wireless Mesh Networks
Ad-hoc On-demand Distance Vector
Ad hoc Routing Protocols
by Saltanat Mashirova & Afshin Mahini
Adhoc and Wireless Sensor Networks
Routing in Mobile Ad-hoc Networks
Vinay Singh Graduate school of Software Dongseo University
Routing protocols in Mobile Ad Hoc Network
Presentation transcript:

Profiles and Multi-Topology Routing in Highly Heterogeneous Ad Hoc Networks Audun Fosselie Hansen Tarik Cicic Paal Engelstad Audun Fosselie Hansen – Poster, Infocom

2 Improving Network Provider’s Business Case Ad hoc networks should be regarded as an opportunity rather than a threat to current business All network infrastructures should be available for the customers Customers should also cooperate making their private infrastructure available for fellow customers  Improving service and Internet availability Audun Fosselie Hansen – Poster, Infocom

3 Rethinking Research Challenges Scalability –Has been the traditional research focus [1,2] –Tailored mechanisms for the ”weakest links” only Heterogeneity –Devices and wireless media technologies will provide a wide heterogeneity with respect to capabilities and properties [3] –Some schemes focus on heterogeneity, but on one parameter only [4,5]  We argue for a more holistic approach that covers not only scalability, but also heterogeneity in terms of many different aspects, simultaneously

4 Profiling the Routing in Ad Hoc Networks Device profiles for management of heterogeneous ad hoc networking systems –device type, power supply, energy level, wireless interface, offered data rate, supported and desired routing approach, mobility pattern, etc. “DiffServ-like” property classes –to reduce the attribute space. Configuring the device profile –by the user, operator or automatically based on current context Capability profiling may improve scalability, –by ensuring that the low-capacity components are not used for data forwarding.

5 Using Multiple Topology Routing (MTR) Utilizes independent logical topologies to compute different paths for different types of traffic –i.e., a router/device maintains different routing tables for different purposes. Explore the benefits of using MTR in ad hoc networks –Using multiple topologies for resilient routing as described in [6] –Profile-adjusted topologies Different routing processes Different traffic Audun Fosselie Hansen – Poster, Infocom

6 Research Goals and Plans Explore the benefits of using profiles and multi-topology routing in ad hoc networks Develop a framework for profile specification and dissemination. –Profile granularity –Trade-offs with routing complexity –Device heterogeneity –Scalability, e.g. in terms of the dissemination of profile information Algorithms and mechanisms for building and maintaining consistent special- purpose topologies should be developed. –Avoiding routing loops is a goal in itself. As a first step: Use MT routing to improve the resilience of ad hoc networks using multi-topology routing as described in [6].

7 The following figures will show How different devices announce profiles and supported routing schemes –All devices should announce this in its neighborhood How different purpose topologies could be built based on this information –Topology for proactive routing processes –Topology for reactive routing processes –Topology for High-demanding applications How Multi-topology routing can improve resilience –Example of backup topologies for the proactive nodes –Example of how a node can move packets to a topology where a ”failed” next hop is isolated Audun Fosselie Hansen – Poster, Infocom

8 OLSR, AODV, 1 Routing protocols, Profile Routing Protocols: OLSR, AODV etc. Profiles: 1,..., 8 (High capacity and stable, …, Low capacity and high mobility) Node A announces its supported routing protocol and profile in its neighborhood Audun Fosselie Hansen – Poster, Infocom A

9 AODV, 8 Audun Fosselie Hansen – Poster, Infocom B Node B announces its supported routing protocols and profile in its neighborhood Routing protocols, Profile Routing Protocols: OLSR, AODV etc. Profiles: 1,..., 8 (High capacity and stable, …, Low capacity and high mobility)

10 OLSR, 3 Audun Fosselie Hansen – Poster, Infocom Node C announces its supported routing protocols and profile in its neighborhood C Routing protocols, Profile Routing Protocols: OLSR, AODV etc. Profiles: 1,..., 8 (High capacity and stable, …, Low capacity and high mobility)

11 Resulting in: Proactive Routing Topology (e.g. OLSR) Audun Fosselie Hansen – Poster, Infocom

12 Resulting in: Reactive Routing Topology (e.g. AODV) Audun Fosselie Hansen – Poster, Infocom

13 Resulting in: Topology for high demanding applications Audun Fosselie Hansen – Poster, Infocom

14 Improving Resilience using Multi-Topology Routing Fast local rerouting in connectionless networks like IP-based MANETs is difficult due to problems with looping [7] Our approach is to build multiple logical topologies in such a way that as many nodes as possible are isolated in one of the topologies. –An isolated node will not carry transit traffic –We call these backup topologies –These will typically be represented as additional routing tables. When a node detect that the next hop for the packet is not available, it moves the packet to a topology where the next hop is isolated All nodes should have the same view of topologies A node that moves packets to another topology must mark the packets to identify the topology for other nodes in the network In [6] we have investigated this approach for fixed IP networks –Very few backup topologies are needed to isolate every component once –Path lengths for recovered traffic are acceptable Audun Fosselie Hansen – Poster, Infocom

15 Full Topology Backup Topology 1 Backup Topology 2 Backup Topology 3 Backup Topologies for the proactive nodes Audun Fosselie Hansen – Poster, Infocom

16 S D Traffic from S to D in the full Topology Audun Fosselie Hansen – Poster, Infocom

17 S D Node N detects a failure on the next hop towards D N Audun Fosselie Hansen – Poster, Infocom

18 S D N Node N moves traffic to a backup topology 2 towards node D Audun Fosselie Hansen – Poster, Infocom

19 References 1.C. E. Perkins and P. Bhagwat, “Highly dynamic destination sequenced distance-vector routing (dsdv) for mobile computers”, in Conference on Communications architectures, protocols and applications, 1994, pp. 234– D. B. Johnson, “Routing in ad hoc networks of mobile hosts,” in Workshop on Mobile Computing Systems and Applications, S. Kurkowski, T. Camp, and M. Colagrosso, “Manet simulation studies: the incredibles,” ACM SIGMOBILE Mobile Computing and Communications Review, vol. 9, no. 4, pp. 50 – 61, October C. Ma and Y. Yang, “A prioritized battery-aware routing protocol for wireless ad hoc networks,” in 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems, 2005, pp. 45 – C. E. Jones, K. M. Sivalingam, P. Agrawal, and J. C. Chen, “A survey of energy efficient network protocols for wireless networks,” Wireless Networks, vol. 7, no. 4, pp. 342–358, August A. Kvalbein, A. F. Hansen, T. Cicic, S. Gjessing, and O. Lysne, “Fast IP network recovery using multiple routing configurations,” in Proceedings of INFOCOM, Apr M. Shand and S. Bryant, ” IP Fast Reroute Framework ”, IETF Internet Draft, March 2006 Audun Fosselie Hansen – Poster, Infocom