Wireless Networking & Mobile Computing

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "Wireless Networking & Mobile Computing"

Transcription

1 Wireless Networking & Mobile Computing CS 752/852 - Spring 2012 Network Layer: Ad Hoc Routing Tamer Nadeem Dept. of Computer Science

2 The OSI Communication Model Page 2 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

3 The OSI Communication Model Page 3 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

4 MANET Mobile Ad Hoc Networks Collection of mobile nodes connected by wireless links, forming an autonomous network Nodes run on batteries power consumption is an issue Thus routing is multi-hop each node also acts as a router Scalability is an issue A B H S C I E G F K J D M Page 4 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

5 MANET vs Cellular MANET Cellular Communications No infrastructure, lack of centralized control Fixed, pre-located base stations Frequent topology changes due to node mobility All communications over wireless medium Static backbone network topology Reliable backbone links; only last link is wireless Page 5 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

6 Applications Civilian environments meeting rooms smart homes multimedia classrooms Emergency operations disaster relief search and rescue law enforcement Military applications Page 6 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

7 Challenges Limited wireless transmission range Broadcast nature of the wireless medium Packet losses due to transmission errors Mobility-induced route changes Mobility-induced packet losses Battery constraints Potentially frequent network partitions Ease of snooping on wireless transmissions (security hazard) 7 Page 7 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

8 Topology Challenges Network connectivity defined by node proximity and wireless medium characteristics Due to mobility the network topology undergoes rapid changes Page 8 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

9 MAC Challenges Hidden terminal problem Unreliable physical layer multi-path fading high Bit Error Rate (BER) other impairments Mobility Page 9 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

10 Routing Schemes Broadcast Unicast Geocast Multicast Anycast Page 10 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

11 Unicast Routing in Mobile Ad Hoc Networks Page 11 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

12 Routing in MANET Why is routing in MANET challenging? Without (necessarily) using a pre-existing infrastructure Main culprit: mobility network topology is changing rapidly (link failure/repair) Rate of link failure/repair may be high when nodes move fast Main challenge: maintain and distribute up-to-date routing information without saturating the network Page 12 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

13 Routing in MANET Numerous protocols have been proposed Flavors: adapted from protocols previously proposed for wired networks invented specifically for MANET Major approaches Proactive: routing information is maintained proactively regardless of communication requests e.g. traditional link-state and distance-vector routing protocols are proactive Reactive: a route to a destination is found and maintained only when the route is needed Page 13 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

14 Proactive vs Reactive Latency of route discovery proactive protocols may have lower latency since routes are maintained at all times reactive protocols may have higher latency because a route from X to Y will be found only when X attempts to send to Y Overhead of route discovery/maintenance reactive protocols may have lower overhead since routes are determined only if needed proactive protocols can (but not necessarily) result in higher overhead due to continuous route updating Which approach is better depends on traffic and mobility patterns Page 14 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

15 Sample Routing Protocols Pure flooding DSR AODV LAR Page 15 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

16 Flooding (1/5) Sender S broadcasts data packet P to all its neighbors Each node receiving P forwards P to its neighbors Sequence numbers are used to avoid forwarding the same packet more than once The destination D does not forward the packet Page 16 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

17 Flooding (2/5) Broadcast transmission Y Z A B H S C I E G F K J D M N L Represents a node that receives packet P for the first time Represents transmission of packet P Page 17 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

18 Flooding (3/5) Y Z A B H S C I E G F K J D M N L Node H receives packet P from two neighbors: potential for collision Page 18 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

19 Flooding (4/5) Y Z A B H S C I E G F K J D M N L Node C receives packet P from G and H, but does not forward it again, because node C has already forwarded packet P Page 19 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

20 Flooding (5/5) Y Z A B H S C I E G F K J D M N L Flooding completed Nodes unreachable from S do not receive packet P (e.g., node Z) Nodes for which all paths from S go through the destination D also do not receive packet P (example: node N) Page 20 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

21 Flooding: Summary Advantage: simplicity Potentially, very high overhead data packets may be delivered to too many nodes who do not need to receive them Potentially lower reliability of data delivery flooding uses MAC broadcasting -- hard to implement reliable broadcast delivery without significantly increasing overhead Broadcasting in IEEE MAC is unreliable Need end-to-end reliability Page 21 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

22 Flooding Control Packets Many protocols perform limited flooding of control packets, instead of data packets Control packets are used to discover routes or to send linkstate updates Discovered routes are subsequently used to send data packet(s) Overhead of control packet flooding is amortized over data packets transmitted between consecutive control packet floods Page 22 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

23 Dynamic Source Routing (DSR) [Johnson96] When source S wants to send a packet to node D, but does not know a route to D, it initiates a route discovery Source node S floods a Route Request (RREQ) Each node appends own identifier when forwarding the RREQ Page 23 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

24 DSR: Route Discovery (1/3) Broadcast transmission Y A B H S [S] C I E G F K J D M Z N L Represents transmission of RREQ [X,Y] Represents list of identifiers appended to RREQ Page 24 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

25 DSR: Route Discovery (2/3) Y A B H S E C [S,C] I [S,E] G F K J D M Z N L Page 25 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

26 DSR: Route Discovery (3/3) Y Z A B H S C I E G F [S,E,F,J] M J D K [S,C,G,K] N L Nodes J and K both broadcast RREQ to node D Since nodes J and K are hidden from each other, their transmissions may collide Page 26 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

27 DSR: Route Reply (1/2) Destination D upon receiving the first RREQ, sends back to S a Route Reply (RREP) RREP is sent on the route obtained by reversing the route appended to the received RREQ RREP includes the route from S to D on which RREQ was received by node D Page 27 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

28 DSR: Route Reply (2/2) Y A B H S C I E RREP [S,E,F,J,D] F J G K D M Z N L Represents RREP control message Page 28 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

29 DSR: Data Delivery (1/2) S upon receiving RREP, caches the route included in the RREP When S sends a data packet to D, the entire route is included in the packet header hence the name source routing Intermediate nodes use the source route included in a packet to determine to whom the packet should be forwarded Page 29 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

30 DSR: Data Delivery (2/2) Y A B H S DATA [S,E,F,J,D] E F C G K I J D M Z N L Packet header size grows with route length Page 30 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

31 DSR Optimization: Route Caching Each node caches a new route it learns by some means When S finds route [S,E,F,J,D] to node D, S also learns route [S,E,F] to node F When node K receives the Route Request [S,C,G], K learns route [K,G,C,S] to S When node F forwards Route Reply RREP [S,E,F,J,D], F learns route [F,J,D] to D When node E forwards Data [S,E,F,J,D], it learns route [E,F,J,D] to node D A node may also learn a route when it overhears data packets Page 31 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

32 DSR: Route Caching (1/3) Advantages: can speed up route discovery can reduce propagation of route requests (RREQ) Page 32 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

33 DSR: Route Caching (2/3) [S,E,F,J,D] [E,F,J,D] Y A B H S C [C,S] I E [G,C,S] G F [K,G,C,S] [F,J,D],[F,E,S] RREQ [J,F,E,S] M J D K Z RREP N L Route Reply (RREP) from node K limits flooding of RREQ In general, the reduction may be less dramatic Page 33 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

34 DSR: Route Caching (3/3) Stale caches can adversely affect performance With passage of time and host mobility, cached routes may become invalid In some cases, a sender may try several stale routes (obtained from its local cache, or from cache of some other node), before finding a good route Page 34 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

35 DSR: Route Maintenance - Route Error (RERR) Y A B H S C I E RERR [J-D] F G K J D M Z N L When J s attempt to forward a data packet (with route S-E-F-J-D) on link (J-D) fails, J sends a route error (RERR) to S along route J-F-E-S Nodes hearing RERR update their route cache to remove link (J-D) When node S receives the RERR, it initiates a new RREQ Page 35 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

36 Summary of DSR Routes maintained only between nodes who need to communicate Route caching can further reduce route discovery overhead A single route discovery may yield many routes to the destination, due to intermediate nodes replying from local caches Complicated Cache Management mechanisms Packet header size grows with route length due to source routing Page 36 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

37 Ad-hoc On-Demand Distance Vector Routing (AODV) Route Requests (RREQ) are forwarded in a manner similar to DSR When a node re-broadcasts a Route Request, it sets up a reverse path pointing towards the source When the intended destination receives a Route Request, it replies by sending a Route Reply Route Reply travels along the reverse path set-up when Route Request is forwarded Page 37 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

38 AODV: Route Request (1/5) Broadcast transmission Y Z A B H S C I E G F K J D M N L Represents transmission of RREQ Page 38 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

39 AODV: Route Request (2/5) Y Z A B H S C I E G F K J D M N L Represents links on Reverse Path Page 39 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

40 AODV: Route Request (3/5) Y Z A B H S C I E G F K J D M N L Represents links on Reverse Path F sets up a reverse path entry in its routing table: reverse path entry Destination S Next Hop E Page 40 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

41 AODV: Route Request (4/5) Y Z A B H S C I E G F K J D M N L Page 41 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

42 AODV: Route Request (5/5) Y Z A B H S C I E G F K J D M N L D does not forward RREQ, because it is the intended target of the RREQ Page 42 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

43 AODV: Route Reply (1/2) Y Z A B H S C I E G F K J D M N L Represents links on path taken by RREP Page 43 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

44 AODV: Route Reply (1/2) An intermediate node may also send a Route Reply (RREP) provided that it knows a more recent path than the one previously known to sender S To determine whether the path known to an intermediate node is more recent, destination sequence numbers are used Forward links are set up when RREP travels along the reverse path Page 44 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

45 AODV: Forward Path Setup Y Z A B H S C I E G F K J D M N L F adds a forward path entry in its routing table: forward path entry Destination Next Hop S E Page 45 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing D J

46 AODV: Data Delivery Y A B H S DATA E C I G F K J D M Z N L Represents a link on the forward path Routing table entries used to forward data packet Route is not included in packet header Page 46 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

47 AODV: Route Maintenance - Route Error (RERR) When node X is unable to forward packet P (from node S to node D) on link (X,Y), it generates a RERR message Node X increments the destination sequence number for D cached at node X The incremented sequence number N is included in the RERR When node S receives the RERR, it initiates a new route discovery for D using destination sequence number at least as large as N Page 47 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

48 Information Freshness Assured Each originating node maintains a monotonically increasing sequence number. Used by other nodes to determine the freshness of the information. Every nodes routing table contains the latest information available about the sequence number for the IP address of the destination node for which the routing information is maintained. Updated whenever a node receives new information about the sequence number from RREQ, RREP, or RERR messages received related to that destination. Page 48 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

49 Information Freshness Assured AODV depends on each node in the network to own and maintain its destination sequence number. A destination node increments its own sequence number immediately before it originates a route discovery A destination node increments its own sequence number immediately before it originates a RREP in response to a RREQ The node treats its sequence number as an unsigned number when incrementing accomplishing sequence number rollover. Destination information is assured by comparing the sequence number of the incoming AODV message with its sequence number for that destination. Page 49 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

50 ADOV: Summary Nodes maintain routing tables containing entries only for routes that are in active use Routes are not included in packet headers At most one next-hop per destination is maintained at each node DSR may maintain several routes for a single destination Page 50 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

51 Flooding of Control Packets How to reduce the scope of the route request flood? LAR [Ko98Mobicom] Query localization [Castaneda99Mobicom] How to reduce redundant broadcasts? The Broadcast Storm Problem [Ni99Mobicom] Page 51 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

52 Location-Aided Routing (LAR) [Ko98Mobicom] Exploits location information to limit scope of route request flood Location information may be obtained using GPS Expected Zone is determined as a region that is expected to hold the current location of the destination Expected region determined based on potentially old location information, and knowledge of the destination s speed Route requests limited to a Request Zone that contains the Expected Zone and location of the sender node Page 52 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

53 Expected Zone in LAR X = last known location of node D, at time t0 Y = location of node D at current time t1, unknown to node S r = (t1 - t0) * estimate of D s speed r X Y Expected Zone Page 53 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

54 Request Zone in LAR Network Space Request Zone A B r X Y S Page 54 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

55 LAR Only nodes within the request zone forward route requests Node A does not forward RREQ, but node B does (see previous slide) Request zone explicitly specified in the route request Each node must know its physical location to determine whether it is within the request zone If route discovery using the smaller request zone fails to find a route, the sender initiates another route discovery (after a timeout) using a larger request zone the larger request zone may be the entire network Page 55 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

56 LAR Variations: Adaptive Request Zone Each node may modify the request zone included in the forwarded request Modified request zone may be determined using more recent/accurate information, and may be smaller than the original request zone B S Request zone adapted by B Request zone defined by sender S Page 56 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

57 Location Aided Routing (LAR) Advantages reduces the scope of route request flood reduces overhead of route discovery Disadvantages Nodes need to know their physical locations Does not take into account possible existence of obstructions for radio transmissions 57 Page 57 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

58 Other Routing Protocols Plenty of other routing protocols Geographic Distance Routing (GEDIR) Energy-aware routing QoS routing Routing with Guaranteed Delivery Page 58 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

59 MANET Routing: Issues How to compare these protocols fairly? Message overhead Routing delays Throughput Energy Consumption Comparisons are based mainly on empirical results Lack of analytical results Interaction with MAC protocols Scalability: >200 nodes is already a problem A possible solution for scalability: hierarchical organization of ad hoc networks Page 59 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

60 MANET Routing: Many Variations Fully Symmetric Environment all nodes have identical capabilities and responsibilities Asymmetric Capabilities transmission ranges and radios may differ battery life at different nodes may differ processing capacity may be different at different nodes speed of movement Asymmetric Responsibilities only some nodes may route packets some nodes may act as leaders of nearby nodes (e.g., cluster head) Page 60 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

61 MANET Routing: Many Variations Traffic characteristics may differ in different ad hoc networks bit rate timeliness constraints reliability requirements unicast / multicast / geocast host-based addressing / content-based addressing / capability-based addressing May co-exist (and co-operate) with an infrastructure-based network Page 61 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

62 MANET Routing: Many Variations Mobility patterns may be different people sitting at an airport lounge New York taxi cabs kids playing military movements personal area network Mobility characteristics speed predictability direction of movement pattern of movement uniformity (or lack thereof) of mobility characteristics among different nodes Page 62 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

63 Research on Mobile Ad Hoc Networks Variations in capabilities & responsibilities X Variations in traffic characteristics, mobility models, etc. X Performance criteria (e.g., optimize throughput, reduce energy consumption) = Significant research activity Page 63 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

64 Questions Page 64 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

65 More on IEEE DCF Collision Avoidance Mechanism CSMA + RTS/CTS (physical/virtual carrier sensing) Collision Resolution Mechanism Binary Exponential Backoff (BEB) Does IEEE DCF work well in multi-hop networks? Answer: No! (has known fairness problems) Page 65 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

66 What is Fairness? What does fairness mean in a multi-hop environment? Max-min fairness an allocation is max-min fair if there is no way to give more bandwidth to a flow without decreasing the allocation of a flow of lesser or equal bandwidth Practical approach ensure that each flow gets a minimum share of the bandwidth allow those flows that are not interfering with the current transmitting flows to send simultaneously Page 66 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

67 Unfairness in IEEE DCF f0 f1 f2 f3 f4 A B C D E F Throughput of each flow: f0: 1298 f1: 684 f2: 47 f3: 1173 f4: 1913 Page 67 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

68 The Flow Contention Graph f0 f1 f2 f3 f4 A B C D E F Nodes represent flows Two flows connected by an edge means they conflict with each other f1 f3 f0 f2 f4 Page 68 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

69 An example of scheduling f1 f3 f0 f2 f4 Flow Contention Graph Scheduling: Slot 1: f0 + f3/f4 Slot 2: f1 + f4 Slot 3: f2 Slot 4: f3 + f0 Slot 5: f4 +f0/f1 Slot 6: f0 + f3/f4 Slot 7: f1 + f4 Slot 8: f2 Slot 9: f3 + f0 Slot 10: f4 +f0/f1 Each flow is guaranteed to be scheduled once in every 5 slots! Page 69 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

70 One can do better f1 f3 f0 f2 f4 Flow Contention Graph Improved schedule: Slot 1: f0 + f3 Slot 2: f1 + f4 Slot 3: f2 Slot 4: f0+f3 Slot 5: f1+f4 Slot 6: f2 Each flow is guaranteed to be scheduled once in every 3 slots! Page 70 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

71 Challenges Which scheduling is better? Trade-off between fairness and overall throughput How to implement a fair scheduler in a fully distributed way? Page 71 Spring 2012 CS 752/852 - Wireless Networking and Mobile Computing

UCS-805 MOBILE COMPUTING Jan-May,2011 TOPIC 8. ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala.

UCS-805 MOBILE COMPUTING Jan-May,2011 TOPIC 8. ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala. Mobile Ad Hoc Networks: Routing TOPIC 8 UCS-805 MOBILE COMPUTING Jan-May,2011 ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala Email-alakroy.nerist@gmail.com Mobile Ad Hoc Networks (MANET) Introduction

More information

Mobile Ad Hoc Networks: Routing, MAC and Transport Issues

Mobile Ad Hoc Networks: Routing, MAC and Transport Issues Mobile Ad Hoc Networks: Routing, MAC and Transport Issues Nitin H. Vaidya University of Illinois at Urbana-Champaign nhv@uiuc.edu http://www.crhc.uiuc.edu/~nhv 2004 Nitin Vaidya 1 Notes Names in brackets,

More information

CMPE 257: Wireless and Mobile Networking

CMPE 257: Wireless and Mobile Networking CMPE 257: Wireless and Mobile Networking Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 6 CMPE 257 Winter'11 1 Announcements Project proposals. Student presentations. 10 students so

More information

Politecnico di Milano Facoltà di Ingegneria dell Informazione. WI-7 Ad hoc networks. Wireless Internet Prof. Antonio Capone

Politecnico di Milano Facoltà di Ingegneria dell Informazione. WI-7 Ad hoc networks. Wireless Internet Prof. Antonio Capone Politecnico di Milano Facoltà di Ingegneria dell Informazione WI-7 Ad hoc networks Wireless Internet Prof. Antonio Capone Acknowlegments o This class notes are mostly based on the teaching material of:

More information

Mobile Ad-Hoc Networks & Routing Algorithms

Mobile Ad-Hoc Networks & Routing Algorithms Mobile Ad-Hoc Networks & Routing Algorithms EMMANOUIL G. SPANAKIS, PhD. spanakis@csd.uoc.gr COLLABORATING RESEARCHER, COMPUTATIONAL BIOMEDICINE LABORATORY, FORTH-ICS VISITING LECTURER, COMPUTER SCIENCE

More information

ECS-087: Mobile Computing

ECS-087: Mobile Computing ECS-087: Mobile Computing Mobile Adhoc Networks and Routing in MANETS (most of the slides borrowed from Prof. Sridhar Iyer) Diwakar Yagyasen 1 Index Mobile Ad Hoc Networks (MANET) MAC in MANET MANET routing

More information

CMPE 257: Wireless and Mobile Networking

CMPE 257: Wireless and Mobile Networking CMPE 257: Wireless and Mobile Networking Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 5 CMPE 257 Winter'11 1 Announcements Project proposals. Student presentations. 10 students so

More information

Unicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks

Unicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks Unicast Routing in Mobile Ad Hoc Networks 1 Routing problem 2 Responsibility of a routing protocol Determining an optimal way to find optimal routes Determining a feasible path to a destination based on

More information

Wireless Mul*hop Ad Hoc Networks

Wireless Mul*hop Ad Hoc Networks Wireless Mul*hop Guevara Noubir noubir@ccs.neu.edu Some slides are from Nitin Vaidya s tutorial. Infrastructure vs. Ad Hoc Wireless Networks Infrastructure networks: One or several Access- Points (AP)

More information

Lecture 4: Mobile Ad Hoc and Sensor Networks (I)

Lecture 4: Mobile Ad Hoc and Sensor Networks (I) Lecture 4: Mobile Ad Hoc and Sensor Networks (I) Ing-Ray Chen CS 6204 Mobile Computing Virginia Tech Courtesy of G.G. Richard III for providing some of the slides Mobile Ad Hoc Networks May need to traverse

More information

Part I. Wireless Communication

Part I. Wireless Communication 1 Part I. Wireless Communication 1.5 Topologies of cellular and ad-hoc networks 2 Introduction Cellular telephony has forever changed the way people communicate with one another. Cellular networks enable

More information

Content. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5.

Content. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5. Rahem Abri Content 1. Introduction 2. The Ad-hoc On-Demand Distance Vector Algorithm Path Discovery Reverse Path Setup Forward Path Setup Route Table Management Path Management Local Connectivity Management

More information

Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14

Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14 Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14 Routing Algorithms Link- State algorithm Each node maintains a view of the whole network topology Find the shortest path

More information

Outline. CS5984 Mobile Computing. Taxonomy of Routing Protocols AODV 1/2. Dr. Ayman Abdel-Hamid. Routing Protocols in MANETs Part I

Outline. CS5984 Mobile Computing. Taxonomy of Routing Protocols AODV 1/2. Dr. Ayman Abdel-Hamid. Routing Protocols in MANETs Part I CS5984 Mobile Computing Dr. Ayman Abdel-Hamid Computer Science Department Virginia Tech Part I Outline Routing Protocols for Ad hoc Networks Example of a reactive routing protocol AODV: Ad hoc On-demand

More information

Mobile Ad Hoc Networks

Mobile Ad Hoc Networks Mobile Ad Hoc Networks Tutorial at CIT 2000 Bhubaneshwar, Dec 20 23 Sridhar Iyer IIT Bombay http://www.it.iitb.ernet.in.in/~sri sri@it.iitb.ernet.in Acknowledgements Many figures, slides and reference

More information

Kapitel 5: Mobile Ad Hoc Networks. Characteristics. Applications of Ad Hoc Networks. Wireless Communication. Wireless communication networks types

Kapitel 5: Mobile Ad Hoc Networks. Characteristics. Applications of Ad Hoc Networks. Wireless Communication. Wireless communication networks types Kapitel 5: Mobile Ad Hoc Networks Mobilkommunikation 2 WS 08/09 Wireless Communication Wireless communication networks types Infrastructure-based networks Infrastructureless networks Ad hoc networks Prof.

More information

Ad Hoc Routing Protocols and Issues

Ad Hoc Routing Protocols and Issues Ad Hoc Routing Protocols and Issues Stefano Basagni ECE Dept Northeastern University Boston, Jan 2003 Ad hoc (AD-HAHK or AD-HOKE)-Adjective a) Concerned with a particular end or purpose, and b) formed

More information

Redes Inalámbricas Tema 4. Mobile Ad Hoc Networks

Redes Inalámbricas Tema 4. Mobile Ad Hoc Networks Redes Inalámbricas Tema 4. Mobile Ad Hoc Networks A. Specific properties B. Flooding as a basic mechanism C. Basic routing protocols DSR AODV y DYMO OLSR y OLSRv2 D. Advanced protocols and techniques Acknowledgments

More information

Performance Evaluation of MANET through NS2 Simulation

Performance Evaluation of MANET through NS2 Simulation International Journal of Electronic and Electrical Engineering. ISSN 0974-2174, Volume 7, Number 1 (2014), pp. 25-30 International Research Publication House http://www.irphouse.com Performance Evaluation

More information

AD HOC NETWORKS. RAJINI M 2 ND SEM M.Tech DECS PESIT

AD HOC NETWORKS. RAJINI M 2 ND SEM M.Tech DECS PESIT AD HOC NETWORKS RAJINI M 2 ND SEM M.Tech DECS PESIT OUTLINE Introduction Features of Ad hoc network Types of ad hoc network MANETs Network architecture MAC protocols Routing protocols Denial of service

More information

Routing protocols in Mobile Ad Hoc Network

Routing protocols in Mobile Ad Hoc Network Routing protocols in Mobile Ad Hoc Network Presented By :- Nitesh Jain Date:-26/10/2005 SCHOOL OF INFORMATION TECHNOLOGY INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR KHARAGPUR Types of Wireless Networks Infrastructure

More information

A REVERSE AND ENHANCED AODV ROUTING PROTOCOL FOR MANETS

A REVERSE AND ENHANCED AODV ROUTING PROTOCOL FOR MANETS A REVERSE AND ENHANCED AODV ROUTING PROTOCOL FOR MANETS M. Sanabani 1, R. Alsaqour 2 and S. Kurkushi 1 1 Faculty of Computer Science and Information Systems, Thamar University, Thamar, Republic of Yemen

More information

Mobile Ad Hoc Networks: Basic Concepts and Research Issues

Mobile Ad Hoc Networks: Basic Concepts and Research Issues Mobile Ad Hoc s: Basic Concepts and Research Issues Ing. Alessandro Leonardi aleonardi@dieei.unict.it Wireless s Generations (1/3) Generation 1G 2G 2.5G 3G 4/5G Time 1980s 1990s Late1990s 2000s (2010 full

More information

Quiz 5 Answers. CS 441 Spring 2017

Quiz 5 Answers. CS 441 Spring 2017 Quiz 5 Answers CS 441 Spring 2017 1. How does Flooding differ from the route discovery phase used in other reactive routing protocols such as DSR and AODV? [2] Flooding involves broadcasting of data packet

More information

Power aware Multi-path Routing Protocol for MANETS

Power aware Multi-path Routing Protocol for MANETS Power aware Multi-path Routing Protocol for MANETS Shruthi P Murali 1,Joby John 2 1 (ECE Dept, SNGCE, India) 2 (ECE Dept, SNGCE, India) Abstract: Mobile Adhoc Network consists of a large number of mobile

More information

Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol

Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol V.S.Chaudhari 1, Prof.P.N.Matte 2, Prof. V.P.Bhope 3 Department of E&TC, Raisoni College of Engineering, Ahmednagar Abstract:-

More information

Lecture 13: Routing in multihop wireless networks. Mythili Vutukuru CS 653 Spring 2014 March 3, Monday

Lecture 13: Routing in multihop wireless networks. Mythili Vutukuru CS 653 Spring 2014 March 3, Monday Lecture 13: Routing in multihop wireless networks Mythili Vutukuru CS 653 Spring 2014 March 3, Monday Routing in multihop networks Figure out a path from source to destination. Basic techniques of routing

More information

A Highly Effective and Efficient Route Discovery & Maintenance in DSR

A Highly Effective and Efficient Route Discovery & Maintenance in DSR A Highly Effective and Efficient Route Discovery & Maintenance in DSR Shiva Prakash 1, Rajeev Kumar 2, Brijesh Nayak 3, Manindar Kumar Yadav 4 Department of Computer Science and Engineering, Madan Mohan

More information

Mobile Communications. Ad-hoc and Mesh Networks

Mobile Communications. Ad-hoc and Mesh Networks Ad-hoc+mesh-net 1 Mobile Communications Ad-hoc and Mesh Networks Manuel P. Ricardo Faculdade de Engenharia da Universidade do Porto Ad-hoc+mesh-net 2 What is an ad-hoc network? What are differences between

More information

White Paper. Mobile Ad hoc Networking (MANET) with AODV. Revision 1.0

White Paper. Mobile Ad hoc Networking (MANET) with AODV. Revision 1.0 White Paper Mobile Ad hoc Networking (MANET) with AODV Revision 1.0 This page is intentionally blank, or rather nearly blank. Table of Contents TABLE OF CONTENTS...3 TABLE OF FIGURES...4 WHAT IS MANET?...5

More information

SUMMERY, CONCLUSIONS AND FUTURE WORK

SUMMERY, CONCLUSIONS AND FUTURE WORK Chapter - 6 SUMMERY, CONCLUSIONS AND FUTURE WORK The entire Research Work on On-Demand Routing in Multi-Hop Wireless Mobile Ad hoc Networks has been presented in simplified and easy-to-read form in six

More information

A Survey of Vehicular Ad hoc Networks Routing Protocols

A Survey of Vehicular Ad hoc Networks Routing Protocols International Journal of Innovation and Applied Studies ISSN 2028-9324 Vol. 3 No. 3 July 2013, pp. 829-846 2013 Innovative Space of Scientific Research Journals http://www.issr-journals.org/ijias/ A Survey

More information

Experiment and Evaluation of a Mobile Ad Hoc Network with AODV Routing Protocol

Experiment and Evaluation of a Mobile Ad Hoc Network with AODV Routing Protocol Experiment and Evaluation of a Mobile Ad Hoc Network with AODV Routing Protocol Kalyan Kalepu, Shiv Mehra and Chansu Yu, Department of Electrical and Computer Engineering Cleveland State University 2121

More information

PERFORMANCE ANALYSIS OF AODV ROUTING PROTOCOL IN MANETS

PERFORMANCE ANALYSIS OF AODV ROUTING PROTOCOL IN MANETS PERFORMANCE ANALYSIS OF AODV ROUTING PROTOCOL IN MANETS AMANDEEP University College of Engineering, Punjabi University Patiala, Punjab, India amandeep8848@gmail.com GURMEET KAUR University College of Engineering,

More information

Anil Saini Ph.D. Research Scholar Department of Comp. Sci. & Applns, India. Keywords AODV, CBR, DSDV, DSR, MANETs, PDF, Pause Time, Speed, Throughput.

Anil Saini Ph.D. Research Scholar Department of Comp. Sci. & Applns, India. Keywords AODV, CBR, DSDV, DSR, MANETs, PDF, Pause Time, Speed, Throughput. Volume 6, Issue 7, July 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Performance Analysis

More information

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols 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 Jetcheva Presentation by: Michael Molignano Jacob

More information

Performance Comparison of Ad Hoc Routing Protocols over IEEE DCF and TDMA MAC Layer Protocols

Performance Comparison of Ad Hoc Routing Protocols over IEEE DCF and TDMA MAC Layer Protocols Performance Comparison of Ad Hoc Routing Protocols over IEEE 82.11 DCF and TDMA MAC Layer Protocols Govind. P. Gupta Computer Science Department R.K.G.I.T, Ghaziabad (India) er_gpgupta@yahoo.com A. K.

More information

Caching Strategies in MANET Routing Protocols

Caching Strategies in MANET Routing Protocols International Journal of Scientific and Research Publications, Volume 2, Issue 9, September 2012 1 Caching Strategies in MANET Routing Protocols Narinderjeet Kaur, Maninder Singh Punjabi university, Department

More information

A Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver

A Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver 1 A Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver Jungmin So Dept. of Computer Science, and Coordinated Science Laboratory University of Illinois

More information

Effects of Caching on the Performance of DSR Protocol

Effects of Caching on the Performance of DSR Protocol IOSR Journal of Engineering (IOSRJEN) e-issn: 2250-3021, p-issn: 2278-8719, Volume 2, Issue 9 (September 2012), PP 07-11 Effects of Caching on the Performance of DSR Protocol Narinderjeet Kaur 1, Maninder

More information

Figure 1: Ad-Hoc routing protocols.

Figure 1: Ad-Hoc routing protocols. Performance Analysis of Routing Protocols for Wireless Ad-Hoc Networks Sukhchandan Lally and Ljiljana Trajković Simon Fraser University Vancouver, British Columbia Canada E-mail: {lally, ljilja}@sfu.ca

More information

Analysis of GPS and Zone Based Vehicular Routing on Urban City Roads

Analysis of GPS and Zone Based Vehicular Routing on Urban City Roads Analysis of GPS and Zone Based Vehicular Routing on Urban City Roads Aye Zarchi Minn 1, May Zin Oo 2, Mazliza Othman 3 1,2 Department of Information Technology, Mandalay Technological University, Myanmar

More information

PERFORMANCE EVALUATION OF DSR USING A NOVEL APPROACH

PERFORMANCE EVALUATION OF DSR USING A NOVEL APPROACH PERFORMANCE EVALUATION OF DSR USING A NOVEL APPROACH 1. Prof.S.P. Setti 2. Narasimha Raju K 3. Naresh Kumar K CS&SE Dept., CS&SE Dept., CS&SE Dept., AU College of Engineering, AU College of Engineering,

More information

Resource management issues in mobile ad hoc networks (MANET)

Resource management issues in mobile ad hoc networks (MANET) Autonomic Communication and Knowledge Plane Resource management in autonomic communication Resource management issues in mobile ad hoc networks (MANET) S-38.4030 The aim of this presentation is to give

More information

Vorlesung Kommunikationsnetze Research Topics: QoS in VANETs

Vorlesung Kommunikationsnetze Research Topics: QoS in VANETs Vorlesung Kommunikationsnetze Research Topics: QoS in VANETs Prof. Dr. H. P. Großmann mit B. Wiegel sowie A. Schmeiser und M. Rabel Sommersemester 2009 Institut für Organisation und Management von Informationssystemen

More information

PERFORMANCE COMPARISON OF LINK, NODE AND ZONE DISJOINT MULTI-PATH ROUTING STRATEGIES AND MINIMUM HOP SINGLE PATH ROUTING FOR MOBILE AD HOC NETWORKS

PERFORMANCE COMPARISON OF LINK, NODE AND ZONE DISJOINT MULTI-PATH ROUTING STRATEGIES AND MINIMUM HOP SINGLE PATH ROUTING FOR MOBILE AD HOC NETWORKS PERFORMANCE COMPARISON OF LINK, NODE AND ZONE DISJOINT MULTI-PATH ROUTING STRATEGIES AND MINIMUM HOP SINGLE PATH ROUTING FOR MOBILE AD HOC NETWORKS Natarajan Meghanathan Jackson State University, 1400

More information

Principles behind data link layer services

Principles behind data link layer services Data link layer Goals: Principles behind data link layer services Error detection, correction Sharing a broadcast channel: Multiple access Link layer addressing Reliable data transfer, flow control: Done!

More information

Maharishi Markandeshwar University

Maharishi Markandeshwar University RESEARCH ARTICLE OPEN ACCESS Simulation Based Performance Comparison of Adhoc Routing Protocols Kushagra Agrawal*, Shaveta Jain** *Department of Computer Science,, Mullana, Ambala agrawal_kushagra@rediffmail.com

More information

Performance evaluation of reactive and proactive routing protocol in IEEE ad hoc network

Performance evaluation of reactive and proactive routing protocol in IEEE ad hoc network Author manuscript, published in "ITCom 6 - next generation and sensor networks, Boston : United States (26)" DOI :.7/2.68625 Performance evaluation of reactive and proactive routing protocol in IEEE 82.

More information

Varying Overhead Ad Hoc on Demand Vector Routing in Highly Mobile Ad Hoc Network

Varying Overhead Ad Hoc on Demand Vector Routing in Highly Mobile Ad Hoc Network Journal of Computer Science 7 (5): 678-682, 2011 ISSN 1549-3636 2011 Science Publications Varying Overhead Ad Hoc on Demand Vector Routing in Highly Mobile Ad Hoc Network 1 V. Balaji and 2 V. Duraisamy

More information

CSMA based Medium Access Control for Wireless Sensor Network

CSMA based Medium Access Control for Wireless Sensor Network CSMA based Medium Access Control for Wireless Sensor Network H. Hoang, Halmstad University Abstract Wireless sensor networks bring many challenges on implementation of Medium Access Control protocols because

More information

Analyzing Routing Protocols Performance in VANET Using p and g

Analyzing Routing Protocols Performance in VANET Using p and g Analyzing Routing Protocols Performance in VANET Using 802.11p and 802.11g Rasha Kaiss Aswed and Mohammed Ahmed Abdala Network Engineering Department, College of Information Engineering, Al-Nahrain University

More information

Overview (Advantages and Routing Protocols) of MANET

Overview (Advantages and Routing Protocols) of MANET Advances in Computational Sciences and Technology ISSN 0973-6107 Volume 10, Number 5 (2017) pp. 855-861 Research India Publications http://www.ripublication.com Overview (Advantages and Routing Protocols)

More information

Performance Evaluation of Routing Protocols in Wireless Mesh Networks. Motlhame Edwin Sejake, Zenzo Polite Ncube and Naison Gasela

Performance Evaluation of Routing Protocols in Wireless Mesh Networks. Motlhame Edwin Sejake, Zenzo Polite Ncube and Naison Gasela Performance Evaluation of Routing Protocols in Wireless Mesh Networks Motlhame Edwin Sejake, Zenzo Polite Ncube and Naison Gasela Department of Computer Science, North West University, Mafikeng Campus,

More information

A Survey on Path Weight Based routing Over Wireless Mesh Networks

A Survey on Path Weight Based routing Over Wireless Mesh Networks A Survey on Path Weight Based routing Over Wireless Mesh Networks Ankush Sharma Assistant Professor, Dept. Of C.S.E, Chandigarh University Gharuan, India Anuj Gupta Head C.S.E and M.C.A Dept, RIMT Mandi

More information

CMPE 257: Wireless and Mobile Networking

CMPE 257: Wireless and Mobile Networking CMPE 257: Wireless and Mobile Networking Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 3 CMPE 257 Winter'11 1 Announcements Accessing secure part of the class Web page: User id: cmpe257.

More information

Performance Analysis of Various Routing Protocols for Motorway Surveillance System Cameras Network

Performance Analysis of Various Routing Protocols for Motorway Surveillance System Cameras Network www.ijcsi.org 7 Performance Analysis of Various Routing Protocols for Motorway Surveillance System Cameras Network L. A. Hassnawi 1, R.B Ahmad 2, Abid Yahya 3, S. A. Aljunid 4, M. Elshaikh 5 School of

More information

CSE 6811 Ashikur Rahman

CSE 6811 Ashikur Rahman Data Link layer Application Overview of IEEE 802.11 LLC: On transmission, assemble data into a frame with address and CRC fields. On reception, disassemble frame, perform address recognition and CRC validation.

More information

The Basics of Wireless Communication Octav Chipara

The Basics of Wireless Communication Octav Chipara The asics of Wireless ommunication Octav hipara genda hannel model: the protocol model High-level media access TM, SM hidden/exposed terminal problems WLN Fundamentals of routing proactive on-demand 2

More information

Logical Link Control (LLC) Medium Access Control (MAC)

Logical Link Control (LLC) Medium Access Control (MAC) Overview of IEEE 802.11 Data Link layer Application Presentation Session Transport LLC: On transmission, assemble data into a frame with address and CRC fields. On reception, disassemble frame, perform

More information

Evaluation of Ad-hoc Routing Protocols with. Different Mobility Models for Warfield. Scenarios

Evaluation of Ad-hoc Routing Protocols with. Different Mobility Models for Warfield. Scenarios Contemporary Engineering Sciences, Vol. 7, 2014, no. 12, 559-567 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ces.2014.4436 Evaluation of Ad-hoc Routing Protocols with Different Mobility Models

More information

Energy Efficient Routing Protocols in Mobile Ad hoc Networks

Energy Efficient Routing Protocols in Mobile Ad hoc Networks International Journal of Engineering Research and Development e-issn : 2278-067X, p-issn : 2278-800X, www.ijerd.com Volume 2, Issue 7 (August 2012), PP. 45-51 Energy Efficient Routing Protocols in Mobile

More information

Lecture 9. Quality of Service in ad hoc wireless networks

Lecture 9. Quality of Service in ad hoc wireless networks Lecture 9 Quality of Service in ad hoc wireless networks Yevgeni Koucheryavy Department of Communications Engineering Tampere University of Technology yk@cs.tut.fi Lectured by Jakub Jakubiak QoS statement

More information

MANET is considered a collection of wireless mobile nodes that are capable of communicating with each other. Research Article 2014

MANET is considered a collection of wireless mobile nodes that are capable of communicating with each other. Research Article 2014 Throughput Analysis of Proactive and Reactive MANET Routing Protocols Kiranveer Kaur 1 Surinderjit Kaur 2 Vikramjit Singh 3 Department of Computer Science, University College of Engineering, Department

More information

Keywords Minimum Spanning Tree, Mobile Adhoc Network (MANET), Multicast, Overhead, Scalability, Spanning Tree.

Keywords Minimum Spanning Tree, Mobile Adhoc Network (MANET), Multicast, Overhead, Scalability, Spanning Tree. Volume 3, Issue 12, December 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Challenges

More information

Routing In Ad Hoc Networks

Routing In Ad Hoc Networks Routing n d oc Networks ontents 1. ntroduction to ad-hoc networks 2. Proactive routing protocols OLR 3. Reactive routing protocols R, OV 4. Non-uniform routing protocols ZRP, R 5. Other approaches eographical

More information

A STUDY ON AODV AND DSR MANET ROUTING PROTOCOLS

A STUDY ON AODV AND DSR MANET ROUTING PROTOCOLS A STUDY ON AODV AND DSR MANET ROUTING PROTOCOLS M.KRISHNAMOORTHI 1 Research Scholar in PG and Research Department of Computer Science, Jamal Mohamed College, Tiruchirappalli, Tamilnadu, India Krishnasmk004@hotmail.com

More information

UNIT 1 Questions & Solutions

UNIT 1 Questions & Solutions UNIT 1 Questions & Solutions 1. Give any 5 differences between cellular wireless networks and ADHOC wireless network. Ans: The following table shows the difference between cellular networks and Adhoc wireless

More information

Effect of Variable Bit Rate Traffic Models on the Energy Consumption in MANET Routing Protocols

Effect of Variable Bit Rate Traffic Models on the Energy Consumption in MANET Routing Protocols Volume 1, Issue 3, October 2013 ISSN: 2320-9984 (Online) International Journal of Modern Engineering & Management Research Website: www.ijmemr.org Effect of Variable Bit Rate Traffic Models on the Energy

More information

A Comparative Analysis of Energy Preservation Performance Metric for ERAODV, RAODV, AODV and DSDV Routing Protocols in MANET

A Comparative Analysis of Energy Preservation Performance Metric for ERAODV, RAODV, AODV and DSDV Routing Protocols in MANET A Comparative Analysis of Energy Preservation Performance Metric for ERAODV, RAODV, AODV and DSDV Routing Protocols in MANET Bhabani Sankar Gouda Department of Computer Science & Engineering National Institute

More information

Principles behind data link layer services:

Principles behind data link layer services: Data link layer Goals: Principles behind data link layer services: Error detection, correction Sharing a broadcast channel: Multiple access Link layer addressing Reliable data transfer, flow control Example

More information

ENERGY-AWARE FOR DH-AODV ROUTING PROTOCOL IN WIRELESS MESH NETWORK

ENERGY-AWARE FOR DH-AODV ROUTING PROTOCOL IN WIRELESS MESH NETWORK ENERGY-AWARE FOR DH-AODV ROUTING PROTOCOL IN WIRELESS MESH NETWORK Yousif Ali Saadi, Rosilah Hassan and Dahlila Putri Dahnil Network Communication Lab Research, Centre for Software Technology and Management

More information

Alma Mater Studiorum University of Bologna CdS Laurea Magistrale (MSc) in Computer Science Engineering

Alma Mater Studiorum University of Bologna CdS Laurea Magistrale (MSc) in Computer Science Engineering Mobile Systems M Alma Mater Studiorum University of Bologna CdS Laurea Magistrale (MSc) in Computer Science Engineering Mobile Systems M course (8 ECTS) II Term Academic Year 2016/2017 02 Mobile Ad Hoc

More information

REVIEW ON ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS

REVIEW ON ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS REVIEW ON ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS G. Poornima 1, Mr. M. Rajasenathipathi 2, 1 Research Scholar, Department of Computer Science, NGM College, Pollachi 2 Assistant Professor, Department

More information

A Location-based Predictive Route Caching Scheme for Pure Reactive Zone-based Routing Protocol in Mobile Ad Hoc Networks Abstract Introduction

A Location-based Predictive Route Caching Scheme for Pure Reactive Zone-based Routing Protocol in Mobile Ad Hoc Networks Abstract Introduction A Location-based Predictive Route Caching Scheme for Pure Reactive Zone-based Routing Protocol in Mobile Ad Hoc Networks Weibo Chen 1, Kun Yang 1 and Xueqi Cheng 2 1. University of Essex, School of Computer

More information

Poonam kori et al. / International Journal on Computer Science and Engineering (IJCSE)

Poonam kori et al. / International Journal on Computer Science and Engineering (IJCSE) An Effect of Route Caching Scheme in DSR for Vehicular Adhoc Networks Poonam kori, Dr. Sanjeev Sharma School Of Information Technology, RGPV BHOPAL, INDIA E-mail: Poonam.kori@gmail.com Abstract - Routing

More information

Medium Access Protocols

Medium Access Protocols Medium Access Protocols Summary of MAC protocols What do you do with a shared media? Channel Partitioning, by time, frequency or code Time Division,Code Division, Frequency Division Random partitioning

More information

Scalability Performance of AODV, TORA and OLSR with Reference to Variable Network Size

Scalability Performance of AODV, TORA and OLSR with Reference to Variable Network Size Lovekesh Kumar / International Journal of Engineering Research and Applications (IJERA) ISSN: Scalability Performance of AODV, TORA and OLSR with Reference to Variable Network Size Lovekesh Kumar* *(Department

More information

Multicasting in Ad-Hoc Networks: Comparing MAODV and ODMRP

Multicasting in Ad-Hoc Networks: Comparing MAODV and ODMRP Multicasting in Ad-Hoc Networks: Comparing MAODV and ODMRP Thomas Kunz and Ed Cheng Carleton University tkunz@sce.carleton.ca Abstract. Multicasting can efficiently support a variety of applications that

More information

Performance Analysis and Enhancement of Routing Protocol in Manet

Performance Analysis and Enhancement of Routing Protocol in Manet Vol.2, Issue.2, Mar-Apr 2012 pp-323-328 ISSN: 2249-6645 Performance Analysis and Enhancement of Routing Protocol in Manet Jaya Jacob*, V.Seethalakshmi** *II MECS, Sri Shakthi Institute of Engineering and

More information

Medium Access Control (MAC) Protocols for Ad hoc Wireless Networks -IV

Medium Access Control (MAC) Protocols for Ad hoc Wireless Networks -IV Medium Access Control (MAC) Protocols for Ad hoc Wireless Networks -IV CS: 647 Advanced Topics in Wireless Networks Drs. Baruch Awerbuch & Amitabh Mishra Department of Computer Science Johns Hopkins University

More information

CHAPTER 2 WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL

CHAPTER 2 WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL 2.1 Topology Control in Wireless Sensor Networks Network topology control is about management of network topology to support network-wide requirement.

More information

Ad hoc Network Routing Wireless Systems, a.a 2015/2016

Ad hoc Network Routing Wireless Systems, a.a 2015/2016 Ad hoc Network Routing Wireless Systems, a.a 2015/2016 Un. of Rome La Sapienza Chiara Petrioli Department of Computer Science University of Rome Sapienza Italy Why traditional approaches have limits? Proactive

More information

Performance Comparison of AODV and AOMDV Routing Protocols in Mobile Ad Hoc Networks

Performance Comparison of AODV and AOMDV Routing Protocols in Mobile Ad Hoc Networks International Research Journal of Applied and Basic Sciences 2013 Available online at www.irjabs.com ISSN 2251-838X / Vol, 4 (11): 3277-3285 Science Explorer Publications Performance Comparison of AODV

More information

Zone-based Proactive Source Routing Protocol for Ad-hoc Networks

Zone-based Proactive Source Routing Protocol for Ad-hoc Networks 2014 IJSRSET Volume i Issue i Print ISSN : 2395-1990 Online ISSN : 2394-4099 Themed Section: Science Zone-based Proactive Source Routing Protocol for Ad-hoc Networks Dr.Sangheethaa.S 1, Dr. Arun Korath

More information

ENHANCING THE PERFORMANCE OF MOBILE AD HOC NETWORKS WITH INTERNET GATEWAYS SHIV MEHRA

ENHANCING THE PERFORMANCE OF MOBILE AD HOC NETWORKS WITH INTERNET GATEWAYS SHIV MEHRA ENHANCING THE PERFORMANCE OF MOBILE AD HOC NETWORKS WITH INTERNET GATEWAYS SHIV MEHRA Bachelor of Engineering in Electronics and Telecommunication Engineering University of Bombay, India June, 2000 Submitted

More information

Performance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols

Performance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols www.ijcsi.org 551 Performance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols Kashif Ibrahim Qazi Javed Ahmed Abdul Qudoos Mirza Aamir Mehmood Department of Computer Science, Balochistan

More information

The Effect of Number of Hops per Path on Remind Energy in MANETs Routing Protocols

The Effect of Number of Hops per Path on Remind Energy in MANETs Routing Protocols The Effect of Number of Hops per Path on Remind Energy in MANETs Routing Protocols Khafaei Taleb Department of Computer Engineering Islamic Azad University, Bushehr Branch ABSTRACT Bushehr, Iran In mobile

More information

WEAMR A Weighted Energy Aware Multipath Reliable Routing Mechanism for Hotline-Based WSNs

WEAMR A Weighted Energy Aware Multipath Reliable Routing Mechanism for Hotline-Based WSNs Sensors 2013, 13, 6295-6318; doi:10.3390/s130506295 Article OPEN ACCESS sensors ISSN 1424-8220 www.mdpi.com/journal/sensors WEAMR A Weighted Energy Aware Multipath Reliable Routing Mechanism for Hotline-Based

More information

Ad Hoc Wireless Routing CS 218- Fall 2003

Ad Hoc Wireless Routing CS 218- Fall 2003 Ad Hoc Wireless Routing CS 218- Fall 2003 Wireless multihop routing challenges Review of conventional routing schemes Proactive wireless routing Hierarchical routing Reactive (on demand) wireless routing

More information

DYNAMIC VIRTUAL BACKBONE ROUTING PROTOCOL: A HYBRID ROUTING PROTOCOL FOR ADHOC NETWORKS

DYNAMIC VIRTUAL BACKBONE ROUTING PROTOCOL: A HYBRID ROUTING PROTOCOL FOR ADHOC NETWORKS DYNAMIC VIRTUAL BACKBONE ROUTING PROTOCOL: A HYBRID ROUTING PROTOCOL FOR ADHOC NETWORKS Melvin John Supervised By Dr. Cheryl Pope & Dr. Cruz Izu Submitted to the School of Computer Science The University

More information

What is Multicasting? Multicasting Fundamentals. Unicast Transmission. Agenda. L70 - Multicasting Fundamentals. L70 - Multicasting Fundamentals

What is Multicasting? Multicasting Fundamentals. Unicast Transmission. Agenda. L70 - Multicasting Fundamentals. L70 - Multicasting Fundamentals What is Multicasting? Multicasting Fundamentals Unicast transmission transmitting a packet to one receiver point-to-point transmission used by most applications today Multicast transmission transmitting

More information

An Implementation Study of the AODV Routing Protocol

An Implementation Study of the AODV Routing Protocol An Implementation Study of the AODV Routing Protocol Elizabeth M. Royer Dept. of Electrical & Computer Engineering University of California, Santa Barbara Santa Barbara, CA 93106 eroyer@alpha.ece.ucsb.edu

More information

Security in DOA routing protocol for Mobile Adhoc Networks

Security in DOA routing protocol for Mobile Adhoc Networks Security in DOA routing protocol for Mobile Adhoc Networks Vanitha.M 1, Deepak.S 2, Ayesha.N 3 1,2,3 Department of Electronics and Communication Engineering, Sriram Engineering College Abstract One of

More information

Qos-Aware Routing Based on Bandwidth Estimation for Mobile Ad Hoc Networks

Qos-Aware Routing Based on Bandwidth Estimation for Mobile Ad Hoc Networks Qos-Aware Routing Based on Bandwidth Estimation for Mobile Ad Hoc Networks 1 Ravindra.E, 2 Pooja Agraharkar Asst Prof, Dept. of Electronics & Communication Engg, Mtech Student, Dept. of Electronics & Communication

More information

CSE 461: Wireless Networks

CSE 461: Wireless Networks CSE 461: Wireless Networks Wireless IEEE 802.11 A physical and multiple access layer standard for wireless local area networks (WLAN) Ad Hoc Network: no servers or access points Infrastructure Network

More information

Chapter 5 Ad Hoc Wireless Network. Jang Ping Sheu

Chapter 5 Ad Hoc Wireless Network. Jang Ping Sheu Chapter 5 Ad Hoc Wireless Network Jang Ping Sheu Introduction Ad Hoc Network is a multi-hop relaying network ALOHAnet developed in 1970 Ethernet developed in 1980 In 1994, Bluetooth proposed by Ericsson

More information

Congestion Avoidance in Mobile Ad-Hoc Networks, through Cooperative AODV Routing

Congestion Avoidance in Mobile Ad-Hoc Networks, through Cooperative AODV Routing Congestion Avoidance in Mobile Ad-Hoc Networks, through Cooperative AODV Routing Steffi George 1, Sharda Patel 2 1 MTech Student,Gyan Ganga Institute of Technology, INDIA 2 Assistant professor, Gyan Ganga

More information

The MAC layer in wireless networks

The MAC layer in wireless networks The MAC layer in wireless networks The wireless MAC layer roles Access control to shared channel(s) Natural broadcast of wireless transmission Collision of signal: a /space problem Who transmits when?

More information

Performance Comparison of MANET (Mobile Ad hoc Network) Protocols (ODMRP with AMRIS and MAODV)

Performance Comparison of MANET (Mobile Ad hoc Network) Protocols (ODMRP with AMRIS and MAODV) Performance Comparison of MANET (Mobile Ad hoc Network) Protocols (ODMRP with AMRIS and MAODV) Aparna K Lecturer, Dept. of Master of Computer Applications BMS Institute of Technology, Bangalore, India.

More information