Routing in Mobile Ad-Hoc Networks An M.Tech. Project by Srinath Perur Guide: Prof. Sridhar Iyer.

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

Mitigating Routing Misbehavior in Mobile Ad-Hoc Networks Reference: Mitigating Routing Misbehavior in Mobile Ad Hoc Networks, Sergio Marti, T.J. Giuli,
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
MMT (Multi Meshed Tree) Protocols for Cognitive Airborne Networks Nirmala Shenoy Lab for Wireless Networking and Security Rochester Institute of Technology.
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.
DSR The Dynamic Source Routing Protocol Students: Mirko Gilioli Mohammed El Allali.
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
Improving TCP Performance over MANETs by Exploiting Cross-Layer Information Awareness Xin Yu NYU Presented by: David Choffnes.
Multicasting in Mobile Ad-Hoc Networks (MANET)
4/16/2017 A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols Josh Broch, David Maltz, David Johnson, Yih-Chun Hu and Jorjeta.
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.
Network Simulator 2 Tejas Vasavada.
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.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #4 Mobile Ad-Hoc Networks AODV Routing.
A Performance Comparison of Multi-hop Wireless Ad Hoc Network Routing Protocols Presented by Angel Pagan Xiang Li Josh Broch, David A. Maltz, David B.
CS541 Advanced Networking 1 Mobile Ad Hoc Networks (MANETs) Neil Tang 02/02/2009.
Di Wu 03/03/2011 Geographic Routing in Clustered Multi-layer Vehicular Ad Hoc Networks for Load Balancing Purposes.
Milano, 4-5 Ottobre 2004 IS-MANET The Virtual Routing Protocol for Ad Hoc Networks ISTI – CNR S. Chessa.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
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)
Ns Simulation of IEEE SC546 Project (Fall 2002) SOO IL KIM JISUN YOON
Introduction to Network Simulator NS-2 Part II
Impact of Directional Antennas on Ad Hoc Routing Romit Roy Choudhury Nitin H. Vaidya.
Ad Hoc Wireless Routing COS 461: Computer Networks
Routing Two papers: Location-Aided Routing (LAR) in mobile ad hoc networks (2000) Ad-hoc On-Demand Distance Vector Routing (1999)
ENHANCING AND EVALUATION OF AD-HOC ROUTING PROTOCOLS IN VANET.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #3 Mobile Ad-Hoc Networks AODV Routing.
Mobile Routing protocols MANET
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
NS2 - Wireless Network Ming-Feng Yang. 2 2 Outline Basic wireless model Extensions wireless model Example - Ad hoc network Example – WLAN Example – Mobile.
Mobile Adhoc Network: Routing Protocol:AODV
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
Define options(1/2) #channel type set val(chan) Channel/WirelessChannel # radio-propagation model set val(prop) Propagation/TwoRayGround # network interface.
ROUTING ALGORITHMS IN AD HOC NETWORKS
Routing Protocols of On- Demand Dynamic Source Routing (DSR) Ad-Hoc On-Demand Distance Vector (AODV)
Dynamic Source Routing in ad hoc wireless networks Alexander Stojanovic IST Lisabon 1.
Routing Protocols for Mobile Ad-Hoc Networks By : Neha Durwas For: Professor U.T. Nguyen COSC 6590.
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols MOBICOM 1998 Dallas, Texas Josh Broch, David Maltz, David Johnson, Yih-Chun.
Dynamic Source Routing (DSR) Sandeep Gupta M.Tech - WCC.
Routing in Mobile Ad Hoc Networks (from Ad Hoc Networking by Charles Perkins) Thanks to Prof. Yu at Cleveland State Univ.
Chapter 15 The Addressing Structure in NS. The Default Address Format 32 lower bits for port-id, 1 higher bit for mcast and the rest 32 higher bits for.
WIRELESS AD-HOC NETWORKS Dr. Razi Iqbal Lecture 6.
SRL: A Bidirectional Abstraction for Unidirectional Ad Hoc Networks. Venugopalan Ramasubramanian Ranveer Chandra Daniel Mosse.
Group Management in Mobile Ad Hoc Networks Revathi Ranganathan Preeti Venkateswaran.
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
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
PERFORMANCE EVALUATION OF COMMON POWER ROUTING FOR AD-HOC NETWORK Zhan Liang Supervisor: Prof. Sven-Gustav Häggman Instructor: Researcher Boris Makarevitch.
Ad hoc Routing for Multilevel Power Saving Protocols Matthew J. Miller, Nitin H. Vaidya Ad Hoc Networks 2008 January University of Illinois at Urbana-Champaign,
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
DETECTION AND IGNORING BLACK HOLE ATTACK IN VANET NETWORKS BASED LATENCY TIME CH. BENSAID S.BOUKLI HACENE M.K.FAROUAN 1.
Fundamentals of Computer Networks ECE 478/578
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.
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.
AODV-OLSR Scalable Ad hoc Routing
Lecture 28 Mobile Ad hoc Network Dr. Ghalib A. Shah
Chapter 16 Mobile Networking in ns
UNIT-V Transport Layer protocols for Ad Hoc Wireless Networks
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
A comparison of Ad-Hoc Routing Protocols
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
by Saltanat Mashirova & Afshin Mahini
Routing.
Vinay Singh Graduate school of Software Dongseo University
Other Routing Protocols
Computer Networks: Wireless Networks
Presentation transcript:

Routing in Mobile Ad-Hoc Networks An M.Tech. Project by Srinath Perur Guide: Prof. Sridhar Iyer

Organization Introduction to Mobile Ad hoc networks (MANETs) Routing in MANETs Virtual Backbone Routing Kelpi: Algorithm and implementation Conclusions

Towards MANETs Networking wireless hosts: Cellular Networks Infrastructure dependent High setup costs Large setup time Reliable

Towards MANETs Some motivating applications: Casual conferencing low set-up time, cost preferred Battlefield operations/disaster relief infrastructure unavailable Personal area networking devices around the home/office Cellular networks are not preferred.

Mobile Ad hoc Networks mobile hosts multi-hop routes between nodes may not use infrastructure Source: it644 course material Prof. Sridhar Iyer

Characteristics of MANETs Dynamic topology –links formed and broken with mobility Possibly uni-directional links Constrained resources –battery power –wireless transmitter range Network partitions A B A B Source: it644 course material Prof. Sridhar Iyer

Routing in MANETs To find and maintain routes between nodes in a dynamic topology with possibly uni-directional links, using minimum resources.

Dynamic Source Routing (DSR) Routing is through source routing –complete path with each packet Route discovery –flooding RREQ till a node replies Route maintainance –explicit link breakage notification Mobility of a node can break routes passing through it.

Destination Sequenced Distance Vector (DSDV) Modified Distance Vector protocol –periodic DV updates High frequency of DV updates –topology is dynamic Does not scale well –size of DV updates increase –high routing overheads

Observations –Most ad hoc routing protocols are combinations/variations of DSR/DSDV –Mobility in DSR causes short-lived routes –DSDV is not scalable

The Dynamic Virtual Backbone The dynamic virtual backbone is a concept wherein a set of relatively stable routes are formed despite nodes being mobile. –a possible way is to abstract mobility through aggregation a dynamic group of nodes by preventing some information from moving out of the group, keeps mobility transparent to the rest of the network.

Node Router S D (x 0, y 0 ) (x l, y l ) Cell Operational Area Virtual Backbone in Kelpi

Kelpi –Kelpi: a MANET routing algorithm based on the concept of Virtual Backbone Routing (VBR). –Assumptions: nodes equipped with positioning system, say a GPS receiver nodes capable of multi-level transmission mobility scenario –upto vehicular speeds of mobility –area of a few kilometres –fairly dense network –typical battlefield/disaster relief scenario

Routing in Kelpi –Area of operation divided into square geographical cells –In each cell one node is a router –Inter-cell communication is through routers Routers transmit at a higher transmission power –Nodes communicate through their cell routers

Node Router S D (x 0, y 0 ) (x l, y l ) Cell Operational Area Routing in Kelpi

VBR in Kelpi –Nodes aggregated by position geographically defined cells –Each group has a router any node can be a router router responds to a Cell Router Address (CRA) before moving cells a router hands off routing information

CRA(1)CRA(2) 012 Use of Cell Router Address and cells to implement VBR in Kelpi

1.Area of operation is known 2..Initialization parameters: bounding co-ordinates and maxTxPower. (x 0, y 0 ) (x l, y l ) Initialization:Node comes on: 1.Node calculates grid Node sends HI 3. Does not receive reply and declares itself router of cell 21 Another node comes on: 1.Node sends HI 2 Receives reply from router

Kelpi: Router –Data structures at router: node_list, routing_table, forwarding_pointers –The new router sends a RH (Router Here) message prevents multiple routers in a cell –starts listening on the CRA –starts sending/receiving DV updates to/from neighbouring routers –receives HI messages and enters sending node into node_list

Kelpi: Route Discovery –node S wants to send to node D S must know D’s cell –S discovers D’s cell by sending a FIND_CELL packet to its router –Routers flood FIND_CELL among themselves –A router with the node in its node_list replies directly to S

Node Router S D (x 0, y 0 ) (x l, y l ) Cell Operational Area Routing in Kelpi

Kelpi: Handling node mobility –Node detects it is in a new cell sends BYE to previous cell’s router sends HI to new cell’s router sends MOVED_CELL to nodes communicating with it –Router detects it is approaching a new cell initiates router handoff –appoints new router –messages: RTR_MOVE, RTR_MOVE_ACK, RTR_HANDOFF –sends routing_table, sequence numbers, node_list to new router becomes a node

Implementation ns-2 network simulator used for implementing Kelpi –open source, used widely in MANET research critical modifications to ns-2 –packet headers –physical layer code for multi-powered transmitter –introduction of new routing agent: Kelpi

void KelpiAgent::node_receives_packet(Packet* p) { struct hdr_cmn* ch = HDR_CMN(p); struct hdr_ip* iph = HDR_IP(p); int src_ip = iph->saddr(); int dst_ip = iph->daddr(); double now = Scheduler::instance().clock(); // if this node originates the packet if(src_ip == node_address && ch->num_forwards() == 0) { printf("ch size: %d ", ch->size()); ch->size() += IP_HDR_LEN; printf("%d \n", ch->size()); iph->ttl_ = 32; // change to num. cells in diagonal? }. if ((node_cache[dst_ip] != NULL) && (node_cache[dst_ip]->time_last_accessed > 0.1) && ((now - node_cache[dst_ip]->time_last_accessed) cell != current_cell) forward_to_router(p, node_cache[dst_ip]->cell); else { // send packet directly to node ch->next_hop_ = dst_ip; ch->addr_type_ = NS_AF_INET; ch->txPower = nodeTxPower; ch->src_cell = current_cell; ch->dst_cell = current_cell; Scheduler &s = Scheduler::instance(); printf (" Direct send to %d from %d at %lf\n",dst_ip,src_ip, s.clock()); target_->recv(p,(Handler*)0); } //update cache node_cache[dst_ip]->time_last_accessed = now; } else { // buffer the packet rtQ.enque(p); Excerpt from events.cc

set val(chan) Channel/WirelessChannel ;# channel type set val(prop) Propagation/TwoRayGround ;# radio-propagation model set val(ant) Antenna/OmniAntenna ;# Antenna type set val(ll) LL ;# Link layer type set val(ifq) Queue/DropTail/PriQueue ;# Interface queue type set val(ifqlen) 50 ;# max packet in ifq set val(netif) Phy/WirelessPhy ;# network interface type set val(mac) Mac/802_11 ;# MAC type set val(rp) Kelpi ;# ad-hoc routing protocol set val(nn) 3 ;# number of mobilenodes set val(txPower) 0.002w ;# txPower set ns_ [new Simulator].. # Provide initial (X,Y, for now Z=0) co-ordinates for node_(0) and node_(1) # $node_(0) set X_ 5.0 $node_(0) set Y_ 5.0 $node_(0) set Z_ # # Move $ns_ at 1.0 "$node_(0) setdest " $ns_ at 6.0 "$node_(1) setdest " # TCP connections between node_(0) and node_(1) set tcp [new Agent/TCP] #$tcp set class_ 2 set sink [new Agent/TCPSink] $ns_ attach-agent $node_(2) $sink $ns_ attach-agent $node_(1) $tcp $ns_ connect $tcp $sink set ftp [new Application/FTP] $ftp attach-agent $tcp $ns_ at 2.0 "$ftp start" $ns_ at 3.0 "$ftp stop" Excerpts from tst.tcl

s _2_ MAC tcp 1052 [a ] [2:0 1:0 32 0] [0 0] 0 0 r _1_ MAC tcp 1000 [a ] [2:0 1:0 32 0] [0 0] 1 0 s _1_ MAC MAC 38 [ ] r _1_ AGT tcp 1000 [a ] [2:0 1:0 32 0] [0 0] 1 0 s _1_ AGT ack 40 [ ] [1:0 2:0 32 0] [0 0] 0 0 r _1_ RTR ack 40 [ ] [1:0 2:0 32 0] [0 0] 0 0 s _1_ RTR message 48 [ ] [1:255 0: ] r _2_ MAC MAC 38 [ ] s _1_ MAC MAC 44 [2df 0 1 0] r _0_ MAC MAC 44 [2df 0 1 0] s _0_ MAC MAC 38 [23d 1 0 0] r _1_ MAC MAC 38 [23d 1 0 0] s _1_ MAC message 100 [a ] [1:255 0: ] r _0_ MAC message 48 [a ] [1:255 0: ] s _0_ MAC MAC 38 [ ] r _0_ RTR message 48 [a ] [1:255 0: ] s _0_ RTR message 48 [a ] [0:255 -1: ] Excerpt from wireless.tr

Kelpi: Implementation –following functionality has been successfully implemented topology related functions cell discovery destination cell caching packet buffering packet forwarding router hand-offs –these have been validated for small test cases

Kelpi vs. other algorithms –Advantages designed to provide stable routes increased throughput due to two levels of transmission reduced flooding overhead –Disadvantages positioning system required muliple levels of transmission preferred routers may be overloaded in a dense network

Future Directions Remove requirement of GPS from Kelpi Generalize concept of Virtual Backbone Routing to other existing routing algorithms