Chapter 11 Chapter 6
|
|
- Phebe Oliver
- 6 years ago
- Views:
Transcription
1 Routing Protocols
2 References H. Karl and A. Willing. Protocols and Architectures for Wireless Sensor Networks. John Wiley & Sons, (Chapter 11) K. Sohraby, D. Minoli, and T. Znati. Wireless Sensor Networks: Technology, Protocols, and Applications. John Wiley & Sons, (Chapter 6) 2 E. M. Royer and C. C-K K. Toh. A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks. IEEE Personal Communications. Vol. 6, No. 2, pp 46 55, April 1999 X. Hong, K. Xu, and M. Gerla. Scalable Routing Protocols for Mobile Ad Hoc Networks. IEEE Network, Vol. 16, No. 4, pp , July/August 2006
3 Introduction... WSNs can be deployed to support a wide range of applications, whether they have stationary or mobile nodes Once deployed, the nodes self-organize into a autonomous wireless ad hoc network, with little or no maintenance The nodes collaborate to perform the task(s) of the application for which they are deployed Their main task is to collect data, process data, forward the information back to the application; achieving this task efficiently requires an efficient routing protocol to set up paths between the sensors and the data sink 3
4 Forwarding Whenever a node cannot send its data directly to the sink, it has to rely assistance of intermediate nodes to forward the data, thus form a multihop network 4 A S C B Node S wants to send a packet to node D; no direct link, has to pass (forward) the packet to its neighbor first D
5 Forwarding 2 5 The simplest forwarding technique is flooding, where every packet is sent to every neighbor until it reaches the sink Alternatively, a packet is forwarded only to a randomly selected neighbor, in a technique called gossiping Using a technique (in the middle grounds), called controlled flooding, a packet is sent to a select set of neighbors The performance of forwarding is measured in terms of number of packets sent or delay, and usually the above techniques demonstrate a poor performance suitability of a neighbor is needed (captured as a set of metrics) Is the forwarding node capable? Is it closer to the destination?
6 Routing tables Nodes gather and store metrics about their neighbors in routing tables Destination Node S Next hop Cost A A 1 B B 1 C C 1 D C 2 D B 2 6 Destination Node A Next hop Cost S S 1 B S 2 C S 2 D C 3 Determining these tables is performed by the routing protocols
7 Routing gprotocols In wired networks, the routing protocols are usually based on the link state or distance vector algorithms. In wireless (mobile, multihop) networks, different strategies es are required; ed; should be distributed low overhead self configuring Ad hoc routing can be classified as Table driven (proactive) Source initiated (demand driven) 7
8 Ad hoc protocols 8 Ad hoc routing protocols Table driven Source-initiated On-demand DSDV WRP AODV DSR LMR ABR CGSR TORA SSR DSDV Destination Sequenced Distance Vector CGSR Cluster Gateway Switch Routing WRP Wireless Routing Protocol AODV Ad hoc On-demand Distance Vector DSR Dynamic Source Routing LMR Lightweight Mobile Routing TORA Temporally T Ordered d Routing Algorithm ABR Associativity Based Routing SSR Signal Stability Routing
9 Routing in WSNs The crucial aspects in WSNs are Energy efficiency Selecting the most energy efficient routes Low overhead of table construction Stability and dependability of routes Size of the routing table Resilience Unicasting, broadcasting, and multicasting Geographic routing 9
10 Gossiping and agent-based unicast forwarding The idea is to eliminate the need of a routing table The overhead is high or The tables are to be created in the first place! A parallel is drawn between the distribution of data in a replicated data base system and epidemics occurring in human populations 10 Rumor mongering Once an update is received, the site propagates this periodically and randomly to another site The goal is to spread the updates as fast as possible while minimizing the message overhead g The idea of randomly choosing forwarding nodes can be applied to WSNs
11 Randomized forwarding In gossip based randomized d forwarding, the key is the probability with which a node retransmits an incoming packet It is shown that the critical threshold is 65-75% 11 The boundary nodes are critical, as they have fewer neighbors Alternatively, a data packet (acting as an agent) can wander through the network in search for its destination (this is known as random walking) All packets wander flooding Some packets wander gossiping
12 Rumor routing Rumor routing Detect an event and install a few paths in the network Agents propagate from node to node installing routing information 12?
13 Energy-efficient unicast Take the network graph Assign a cost value (reflecting the energy consumption) to each link Use an algorithm that would compute the least-cost path(s) 4 D Send data from A to H A B H E 2 C 2 2 G F 4
14 Energy-efficient unicast 2 Minimize energy/bit Example: A-B-E-H Maximize network lifetime Time until the first node fails Routing considering available battery capacity Maximum available battery levels Example: A-C-F-H Minimum battery cost routing (MBCR) Example: A-D-H Min-max battery capacity routing (MMBCR) Only take battery level into account when below a given level Conditional min-max capacity routing (CMMBCR) Minimize variance in power levels Minimum total transmission power routing (MTPR) 14
15 Some unicast protocols Attracting ti routes by redirecting Distance vector routing over topology control Maximizing time to first node failure as a flow problem Maximizing time to first node failure by max-min optimization Maximizing number of messages Bounding the difference between routing protocols 15
16 Multipath unicast routing 16 Instead of constructing ti a single energy-efficient i path, focus can be shifted on choosing the best possible path from a set of paths Provides redundancy as a standby Goal is to find k paths that do not have either links or nodes in common Increased robustness Well studied
17 Multipath unicast routing 2 Sequential assignment routing (SAR) 17 Based on the observation that the nodes close to the sink are likely to fail sooner Construct trees outward from each sink neighbor Energy-efficient secondary ypaths Construct braided paths where various paths may share nodes Simultaneous transmission i over multiple l paths Send several copies of a packet over multiple node-disjoint paths Random selection of the next upstream hop
18 Multipath unicast routing 3 18 Unicast routing is the broadest research topic in the context of ad hoc and wireless sensor networks A variety of other topics considered (but not covered) include: Routing and topology control Maximizing data flow for multiple source/destination pairs All costs considered Integration of scheduling and power control Routing and link quality Routing and lifetime guarantees Routing for one-shot queries
19 Broadcast and multicast While transmitting data from one node to another, nodes may also need to perform a broadcast operation Efficient broadcasting to restrict the set of forwarding nodes as much as possible, while all the nodes receive data Multicasting li i has a similar il goal 19
20 Options 20 Broadcast Multicast Source-based tree Shared core- based tree Mesh Minimize total cost Minimize maximum cost per destination Single core Multiple core
21 Source-based tree approach The idea is to construct, t for each source, a tree, rooted at the given source, that contains all the destinations for this source, as well as other nodes that are needed Try to find a tree for which the sum of all link costs is minimum (Steiner tree) Try to find the minimum cost to each destination (shortest- path tree) 21 Steiner tree src dst 2 2 Shortest path tree src dst dst 1 dst 1 1
22 Source-based protocols A greedy heuristic Shortest Path Tree 22 Calculate the shortest (cheapest) path to each destination and overlay these paths onto a tree Broadcast using minimum cost spanning tree Prim s algorithm Start with a tree consisting of the source node and, in V -1 steps, add one node For every next node, construct a shortest path to some other node already on the tree Other Steiner tree approximations Broadcasting or multicasting with a finite set of powers
23 Wireless advantage Broadcasting or Multicasting in wireless medium is different from the same in wired medium 23 Wired: locally distributing a packet to n neighbors: n times the cost of a unicast packet kt Wireless: sending to n neighbors can incur costs As high as sending to a single neighbor if receive costs are neglected completely As high as sending once, receiving n times if receives are tuned to the right moment As high as sending n unicast packets if the MAC protocol does not support local multicast If local multicast is cheaper than repeated unicasts (a realistic assumption), then we claim the wireless multicast advantage
24 Broadcast incremental power (BIP) 24 In the previous algorithms, the cost of transmitting to multiple neighbors (multiple children) increases exponentially BIP differs by exploiting the wireless multicasting A node already transmitting to some other node can increase its transmitting power to further the transmission to other nodes, without the cost of a new transmission The additional cost is only the difference between the current cost and the needed (higher) transmission power
25 Broadcast incremental power (BIP) 2 // Initialize V t = {source node} P(source node) = 0 // transmission power assigned to a node foreach (v in V\V t ) { Set candidate edge to (source node, v) Set candidate edge weight to transmission power to reach reach v from source node } // Compute tree while (V t V) { Select v V\V t with smallest candidate edge weight Add v to V t using this candidate edge (u,v) Increase P(u) to smallest power that reaches v // Re-compute candidate edges and their weights foreach (v in V\V t ) { Select u which minimized P (u)-p(u) // where P (u) P(u) is smallest power to reach from v to u Set candidate edge to (u,v), Set candidate edge weight to P (u)-p(u) } } 25
26 BIP in action 26
27 Other multicast algorithms Exploiting wireless multicast t advantage Multicast Incremental Power (MIP) Embedded d wireless multicast advantage Transforming existing trees A distributed, position based approach 27
28 Shared, core-based protocols The challenge is to find the core 28 The problem can then be solved with a source-based tree algorithm with the core as the source One approach is merge point formation, where a merge point for a tree with a few sinks is to be found
29 Mesh-based protocols Tree-based protocols suffer from scalability and robustness A structure with high h level l of connectivity i is needed d to connect multiple sources to their destinations Core-Assisted Mesh Protocol (CAMP) 29 The mesh (a sub-graph of the original graph) has to contain all sources and destinations i and provide at least one path from each source to each destination Redundancy in a mesh can enable shorter paths than in a core- Redundancy in a mesh can enable shorter paths than in a corebased tree, based on the forwarding procedure
30 Other broadcast and multicast approaches Gossiping for multicast E.g., to improve the reliability Directed antennas for multicast Robustness and traffic carrying capacity improvements Relationship to topology control Difference is the source-based protocols Optimal solutions by linear programming LP is NP-hard, but provides better approximations 30 Optimal solutions for tree networks Collecting and distributing data Time to complete a multicast Time is important, too Data replacement Caching Cooperative multihop broadcast
31 Geographic routing In geographic routing protocols: 31 Known positions of the source and destination, as well as the intermediate nodes can be used to assist the routing position-based routing It is necessary y( (for many applications) to address physical locations (e.g., any node in a given region) geocasting For wireless sensor networks the latter is more important Nodes are interchangeable and distinguishable only by their external aspects, the location service is usually not necessary
32 Position-based routing basics Simple forwarding strategies: 32 Most forward within r Nearest with forward progress Directional routing Restricted flooding Hmmm. Dead ends... Basic idea to get out of a dead end: Put right hand to the wall, follow the wall Does not work if on some inner wall will walk in circles Need some additional rules to detect t such circles Send the packets around the face using the right-hand rule
33 Greedy yperimeter stateless routing g( (GPSR) 33
34 Greedy yperimeter stateless routing g( (GPSR) When stuck in a dead-end, d d one way of escaping is to keep the right hand to the wall and keep walking Practically, backtrack k the packet out of the dead d end, counterclockwise around the obstacle Similar approach will allow the discovery of a node closer to the destination in WSNs In GPSR, a packet is greedily forwarded, until an obstacle is reached at, when the algorithm switches to perimeter routing (essentially, sending a packet around a plane using the right-hand rule)
35 A GPSR example Route packet from node A to node Z 35 Leave face routing E I B F H K Enter face routing A C D G J L Z
36 Other position-based routing ID-based routing, hierarchies Randomized forwarding and adaptive node activity (GeRaF) Geographic routing without positions (GEM) 36
37 Geocasting Sending data to a subset of nodes that are located in an indicated region (an example of multicasting!) Geographically restricted flooding Location based multicast Static zone, adaptive zone, adaptive distance Finding the right direction Voronoi diagrams and convex hulls Tessellating the plane Simpler forms (tessellations) of the plane Mesh-based geocasting Unicast routing Geocasting using unicast (GeoTORA) Trajectory-based forwarding (TBF) 37
38 Further issues in geocasting g Impact of localization errors Impractical assumption in real systems, that all the nodes know their location Location services 38 Mapping node IDs to node locations; more important in ad hoc networks Location-aided aided Routing (LAR) Use location information to assist in the flooding phase(s) Energy aware geocast (GEAR) Load splitting among neighbors when forwarding Geographic routing without geographic coordinates Does not really need exact location Link asymmetry Geographic routing fails badly
39 Mobile nodes Sources of mobility in WSNs: The sensor nodes Data sinks Observed event(s) 39
40 Multiple sinks 40 Source Sink moves downward Source Source Sink moves upward
References. Forwarding. Introduction...
References Routing Protocols H. Karl and A. Willing. Protocols and Architectures for Wireless Sensor Networks. John Wiley & Sons, 005. (Chapter 11) K. Sohraby, D. Minoli, and T. Znati. Wireless Sensor
More informationAd hoc and Sensor Networks Chapter 11: Routing Protocols. Holger Karl
Ad hoc and Sensor Networks Chapter 11: Routing Protocols Holger Karl Goals of this Chapter In any network of diameter > 1, the routing & forwarding problem appears We will discuss mechanisms for constructing
More informationOutline. Wireless Ad Hoc & Sensor Networks (Wireless Sensor Networks III) Localisation and Positioning. Localisation and Positioning properties
Wireless Ad Hoc & Sensor Networks (Wireless Sensor Networks III) Outline Localisation and Positioning Topology Control Routing Summary WS 2009/2010 Prof. Dr. Dieter Hogrefe/Prof. Dr. Xiaoming Fu Dr. Omar
More informationRouting protocols in WSN
Routing protocols in WSN 1.1 WSN Routing Scheme Data collected by sensor nodes in a WSN is typically propagated toward a base station (gateway) that links the WSN with other networks where the data can
More informationIntroduction to Mobile Ad hoc Networks (MANETs)
Introduction to Mobile Ad hoc Networks (MANETs) 1 Overview of Ad hoc Network Communication between various devices makes it possible to provide unique and innovative services. Although this inter-device
More informationLocation Awareness in Ad Hoc Wireless Mobile Neworks
Location Awareness in Ad Hoc Wireless Mobile Neworks Lijuan Ai Wenyu Wang Yi Zhou 11/14/2001 Mobile Computing, Fall 2001 1 PART I INTRODUCTION TO MANET & LOCATION-AWARE COMPONENTS 11/14/2001 Mobile Computing,
More informationAd hoc and Sensor Networks Topology Control
Ad hoc and Sensor Networks Topology Control Slides taken from Holger Karl (Protocols and Architectures for Wireless Sensor Networks) Goals Networks can be too dense too many nodes in close (radio) vicinity
More informationContent. 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 informationA Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks
A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks Stephen S. Yau, Wei Gao, and Dazhi Huang Dept. of Computer Science and Engineering Arizona State University Tempe,
More informationMulticasting in ad hoc networks: Energy efficient
Multicasting in ad hoc networks: Energy efficient Blerta Bishaj Helsinki University of Technology 1. Introduction...2 2. Sources of power consumption... 3 3. Directional antennas... 3 4. TCP... 3 5. Energy-efficient
More informationUnicast 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 information6367(Print), ISSN (Online) Volume 4, Issue 2, March April (2013), IAEME & TECHNOLOGY (IJCET)
INTERNATIONAL International Journal of Computer JOURNAL Engineering OF COMPUTER and Technology ENGINEERING (IJCET), ISSN 0976- & TECHNOLOGY (IJCET) ISSN 0976 6367(Print) ISSN 0976 6375(Online) Volume 4,
More informationNetworking Sensors, II
Networking Sensors, II Sensing Networking Leonidas Guibas Stanford University Computation CS321 ZG Book, Ch. 3 1 Class Administration Paper presentation preferences due today, by class time Project info
More informationMobile & Wireless Networking. Lecture 10: Mobile Transport Layer & Ad Hoc Networks. [Schiller, Section 8.3 & Section 9] [Reader, Part 8]
192620010 Mobile & Wireless Networking Lecture 10: Mobile Transport Layer & Ad Hoc Networks [Schiller, Section 8.3 & Section 9] [Reader, Part 8] Geert Heijenk Outline of Lecture 10 Mobile transport layer
More information3. Evaluation of Selected Tree and Mesh based Routing Protocols
33 3. Evaluation of Selected Tree and Mesh based Routing Protocols 3.1 Introduction Construction of best possible multicast trees and maintaining the group connections in sequence is challenging even in
More informationKapitel 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 informationAd 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 informationLecture 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 informationA Survey - Energy Efficient Routing Protocols in MANET
, pp. 163-168 http://dx.doi.org/10.14257/ijfgcn.2016.9.5.16 A Survey - Energy Efficient Routing Protocols in MANET Jyoti Upadhyaya and Nitin Manjhi Department of Computer Science, RGPV University Shriram
More informationA Survey on Performance Evaluation of MANET Routing Protocols
ISSN 2278 0211 (Online) A Survey on Performance Evaluation of MANET Routing Protocols Aviral Kumar Nishank Tyagi Vipin Kumar Abstract: The task of finding and sustaining routes in Mobile Ad-hoc Networks
More informationAd Hoc Networks: Introduction
Ad Hoc Networks: Introduction Module A.int.1 Dr.M.Y.Wu@CSE Shanghai Jiaotong University Shanghai, China Dr.W.Shu@ECE University of New Mexico Albuquerque, NM, USA 1 Ad Hoc networks: introduction A.int.1-2
More informationPrinciples of Wireless Sensor Networks. Routing, Zigbee, and RPL
http://www.ee.kth.se/~carlofi/teaching/pwsn-2011/wsn_course.shtml Lecture 8 Stockholm, November 11, 2011 Routing, Zigbee, and RPL Royal Institute of Technology - KTH Stockholm, Sweden e-mail: carlofi@kth.se
More informationA Graph-based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks
A Graph-based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks Gunyoung Koh, Duyoung Oh 1 and Heekyoung Woo 2 1 School of Electrical Engineering and Computer Science Seoul National University,
More informationPerformance Evaluation of Various Routing Protocols in MANET
208 Performance Evaluation of Various Routing Protocols in MANET Jaya Jacob 1,V.Seethalakshmi 2 1 II MECS,Sri Shakthi Institute of Science and Technology, Coimbatore, India 2 Associate Professor-ECE, Sri
More informationROUTING ALGORITHMS Part 1: Data centric and hierarchical protocols
ROUTING ALGORITHMS Part 1: Data centric and hierarchical protocols 1 Why can t we use conventional routing algorithms here?? A sensor node does not have an identity (address) Content based and data centric
More informationRouting Protocols in MANETs
Chapter 4 Routing Protocols in MANETs 4.1 Introduction The main aim of any Ad Hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish a correct and an
More informationCS551 Ad-hoc Routing
CS551 Ad-hoc Routing Bill Cheng http://merlot.usc.edu/cs551-f12 1 Mobile Routing Alternatives Why not just assume a base station? good for many cases, but not some (military, disaster recovery, sensor
More informationPerformance 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 informationRouting Protocols in Mobile Ad-Hoc Network
International Journal of Computer Science & Management Studies, Vol. 12, Issue 02, April 2012 Protocols in Mobile Ad-Hoc Network Sachin Minocha M. Tech Student, Vaish College of Engineering, Rohtak, Haryana
More informationMANET TECHNOLOGY. Keywords: MANET, Wireless Nodes, Ad-Hoc Network, Mobile Nodes, Routes Protocols.
MANET TECHNOLOGY Dharna 1, Varsha Saroha 2, R. B. Dubey 3 1,2,3 Department of Electronics and Communication Engineering, Hindu College of Engineering, Sonepat, Haryana,(India) ABSTRACT Wireless technology
More informationTable of Contents. 1. Introduction. 2. Geographic Routing. 2.1 Routing Mechanisms. 2.2 Destination Location. 2.3 Location Inaccuracy. 3.
Geographic Protocols in Sensor Networks Karim Seada, Ahmed Helmy Electrical Engineering Department, University of Southern California {seada, helmy}@usc.edu Table of Contents 1. Introduction 2. Geographic
More informationOverview of Sensor Network Routing Protocols. WeeSan Lee 11/1/04
Overview of Sensor Network Routing Protocols WeeSan Lee weesan@cs.ucr.edu 11/1/04 Outline Background Data-centric Protocols Flooding & Gossiping SPIN Directed Diffusion Rumor Routing Hierarchical Protocols
More informationRouting Protocols Wireless for Ad Hoc Wireless Networks: Classifications of Protocols and A review of Table Driven Protocols Abstract:
Routing Protocols Wireless for Ad Hoc Wireless Networks: Classifications of Protocols and A review of Table Driven Protocols Amr Ergawy aergawy@cc.hut.fi Abstract: Ad Hoc wireless networks have their own
More informationMultipath Routing Algorithm for Wireless Sensor Networks
Multipath Routing Algorithm for Wireless Sensor Networks by Ye Ming Lu B. Eng., École Ploytechnique de Montréal, 1999 A THESIS SUBMITTED IN PARTIAL FULFILMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER
More informationA 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 informationMiddle in Forwarding Movement (MFM): An efficient greedy forwarding approach in location aided routing for MANET
Middle in Forwarding Movement (MFM): An efficient greedy forwarding approach in location aided routing for MANET 1 Prashant Dixit* Department of CSE FET, Manavrachna international institute of research
More informationAn Efficient Routing Approach and Improvement Of AODV Protocol In Mobile Ad-Hoc Networks
An Efficient Routing Approach and Improvement Of AODV Protocol In Mobile Ad-Hoc Networks Tejomayee Nath #1 & Suneeta Mohanty *2 # School of Computer Engineering, KIIT University Bhubaneswar,, India Abstract
More informationSimulations of the quadrilateral-based localization
Simulations of the quadrilateral-based localization Cluster success rate v.s. node degree. Each plot represents a simulation run. 9/15/05 Jie Gao CSE590-fall05 1 Random deployment Poisson distribution
More informationGeographical routing 1
Geographical routing 1 Routing in ad hoc networks Obtain route information between pairs of nodes wishing to communicate. Proactive protocols: maintain routing tables at each node that is updated as changes
More informationPERFORMANCE 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 informationArvind Krishnamurthy Fall 2003
Ad-hoc Routing Arvind Krishnamurthy Fall 2003 Ad Hoc Routing Create multi-hop connectivity among set of wireless, possibly moving, nodes Mobile, wireless hosts act as forwarding nodes as well as end systems
More informationROMR: ROBUST MULTICAST ROUTING IN MOBILE AD-HOC NETWORKS
ROMR: ROBUST MULTICAST ROUTING IN MOBILE AD-HOC NETWORKS by Gretchen H. Lynn BS, BSEd, Concord College, 1978 MS, University of Tennessee - Knoxville, 1984 Submitted to the Graduate Faculty of the School
More informationII. CLASSIFICATION OF ROUTING PROTOCOLS MANET routing protocols are classified into three major categories: proactive, reactive and hybrid.
A COMPLETE STUDY ON POWER AWARE ROUTING PROTOCOL FOR MOBILE ADHOC NETWORK A. Kumaravel 1, Dr. M.Chandrasekaran 2 1 (Electronics and Communication Engineering, Paavai Engineering College,India) 2 (Electronics
More informationFig. 2: Architecture of sensor node
Volume 4, Issue 11, November 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com To Reduce
More informationEvaluation of Power Aware Routing Protocols Mohammad Mahmud. Wireless Networks Professor: Dr. Lijun Qian
Evaluation of Power Aware Routing Protocols Mohammad Mahmud Wireless Networks Professor: Dr. Lijun Qian Power Aware Routing In a typical network, the route of a packet will be determined by calculating
More informationLECTURE 9. Ad hoc Networks and Routing
1 LECTURE 9 Ad hoc Networks and Routing Ad hoc Networks 2 Ad Hoc Networks consist of peer to peer communicating nodes (possibly mobile) no infrastructure. Topology of the network changes dynamically links
More informationZone-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 informationMobile Ad-hoc and Sensor Networks Lesson 05 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 2
Mobile Ad-hoc and Sensor Networks Lesson 05 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 2 Oxford University Press 2007. All rights reserved. 1 Temporally ordered routing algorithm (TORA) A reactive
More informationA New Approach for Energy Efficient Routing in MANETs Using Multi Objective Genetic Algorithm
A New Approach for Energy Efficient in MANETs Using Multi Objective Genetic Algorithm Neha Agarwal, Neeraj Manglani Abstract Mobile ad hoc networks (MANET) are selfcreating networks They contain short
More informationThe General Analysis of Proactive Protocols DSDV, FSR and WRP
Volume 116 No. 10 2017, 375-380 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu The General Analysis of Proactive Protocols DSDV, FSR and WRP 1 Dr.
More informationWSN Routing Protocols
WSN Routing Protocols 1 Routing Challenges and Design Issues in WSNs 2 Overview The design of routing protocols in WSNs is influenced by many challenging factors. These factors must be overcome before
More informationUCS-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 informationMobility and Density Aware AODV Protocol Extension for Mobile Adhoc Networks-MADA-AODV
Journal of Computer Science 8 (1): 13-17, 2012 ISSN 1549-3636 2011 Science Publications Mobility and Density Aware AODV Protocol Extension for Mobile Adhoc Networks-MADA-AODV 1 S. Deepa and 2 G.M. Kadhar
More informationGeo-Routing. Chapter 2. Ad Hoc and Sensor Networks Roger Wattenhofer
Geo-Routing Chapter 2 Ad Hoc and Sensor Networks Roger Wattenhofer 2/1 Application of the Week: Mesh Networking (Roofnet) Sharing Internet access Cheaper for everybody Several gateways fault-tolerance
More informationLoad Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department RPI Mobile Wireless Networks Wireless nodes
More informationGeographic Routing Without Location Information. AP, Sylvia, Ion, Scott and Christos
Geographic Routing Without Location Information AP, Sylvia, Ion, Scott and Christos Routing in Wireless Networks Distance vector DSDV On-demand DSR, TORA, AODV Discovers and caches routes on demand Geographic
More informationPerformance Analysis of MANET Routing Protocols OLSR and AODV
VOL. 2, NO. 3, SEPTEMBER 211 Performance Analysis of MANET Routing Protocols OLSR and AODV Jiri Hosek Faculty of Electrical Engineering and Communication, Brno University of Technology Email: hosek@feec.vutbr.cz
More informationComprehensive Study and Review Various Routing Protocols in MANET
126 Comprehensive Study and Review Various Routing Protocols in MANET Prabhjot Kaur 1, Preet Bala 2 M-Tech Student(CSE), GZS PTU CAMPUS, Bathinda Prabhjot6996@gmail.com Dr. Shaveta Rani, Dr. Paramjeet
More informationRelative Performance Analysis of Reactive (on-demand-driven) Routing Protocols
Relative Performance Analysis of Reactive (on-demand-driven) Routing Protocols Mukesh Kumar Garg, Dr. Ela Kumar Abstract A Mobile Ad Hoc Network (MANET) is a group of wireless mobile computers (or nodes);
More informationA COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET
ISSN: 2278 1323 All Rights Reserved 2016 IJARCET 296 A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET Dr. R. Shanmugavadivu 1, B. Chitra 2 1 Assistant Professor, Department of Computer
More informationStudy and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs
Study and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs Rajneesh Gujral Associate Proffesor (CSE Deptt.) Maharishi Markandeshwar University, Mullana, Ambala Sanjeev Rana Associate
More informationData Gathering for Wireless Sensor Network using PEGASIS Protocol
Data Gathering for Wireless Sensor Network using PEGASIS Protocol Kumari Kalpna a, Kanu Gopal b, Navtej katoch c a Deptt. of ECE, College of Engg.& Mgmt.,Kapurthala, b Deptt. of CSE, College of Engg.&
More informationMobile Routing : Computer Networking. Overview. How to Handle Mobile Nodes? Mobile IP Ad-hoc network routing Assigned reading
Mobile Routing 15-744: Computer Networking L-10 Ad Hoc Networks Mobile IP Ad-hoc network routing Assigned reading Performance Comparison of Multi-Hop Wireless Ad Hoc Routing Protocols A High Throughput
More information[Kamboj* et al., 5(9): September, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY NOVEL REVIEW OF MANET ROUTING PROTOCOLS Nippun Kamboj*, Dr. Munishwar Rai Department of Computer Applications Maharishi Markandeshwar
More informationAd Hoc Networks: Issues and Routing
Ad Hoc Networks: Issues and Routing Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse574-08/
More informationGeographic and Diversity Routing in Mesh Networks
Geographic and Diversity Routing in Mesh Networks COS 463: Wireless Networks Lecture 7 Kyle Jamieson [Parts adapted from B. Karp, S. Biswas, S. Katti] Course Contents 1. Wireless From the Transport Layer
More informationCOMPARISON OF ENERGY EFFICIENT DATA TRANSMISSION APPROACHES FOR FLAT WIRELESS SENSOR NETWORKS
COMPARISON OF ENERGY EFFICIENT DATA TRANSMISSION APPROACHES FOR FLAT WIRELESS SENSOR NETWORKS Saraswati Mishra 1 and Prabhjot Kaur 2 Department of Electrical, Electronics and Communication Engineering,
More informationSimulation and Analysis of AODV and DSDV Routing Protocols in Vehicular Adhoc Networks using Random Waypoint Mobility Model
Simulation and Analysis of AODV and DSDV Routing Protocols in Vehicular Adhoc Networks using Random Waypoint Mobility Model 1 R. Jeevitha, 2 M. Chandra Kumar 1 Research Scholar, Department of Computer
More informationRouting in Sensor Networks
Routing in Sensor Networks Routing in Sensor Networks Large scale sensor networks will be deployed, and require richer inter-node communication In-network storage (DCS, GHT, DIM, DIFS) In-network processing
More informationPrinciples of Wireless Sensor Networks
Principles of Wireless Sensor Networks www.kth.se/student/program-kurser/kurshemsidor/kurshemsidor/control/el2745 Lecture 6 Stockholm, February 6, 2012 Carlo Fischione Royal Institute of Technology - KTH
More informationSelf-Organization in Autonomous Sensor/Actuator Networks [SelfOrg]
Self-Organization in Autonomous Sensor/Actuator Networks [SelfOrg] PD Dr.-Ing. Falko Dressler Computer Networks and Communication Systems Department of Computer Science University of Erlangen http://www7.informatik.uni-erlangen.de/~dressler/
More informationROUTING ALGORITHMS Part 2: Data centric and hierarchical protocols
ROUTING ALGORITHMS Part 2: Data centric and hierarchical protocols 1 Negative Reinforcement Time out Explicitly degrade the path by re-sending interest with lower data rate. Source Gradient New Data Path
More informationReferences. The vision of ambient intelligence. The missing component...
References Introduction 1 K. Sohraby, D. Minoli, and T. Znadi. Wireless Sensor Networks: Technology, Protocols, and Applications. John Wiley & Sons, 2007. H. Karl and A. Willig. Protocols and Architectures
More informationLocation Oriented Networking
Location Oriented Networking Daniel Alves University of California Santa Cruz dalves@ucsc.edu Suppose you want to send a message to everyone in this room Use location information on the network Message
More informationRumor Routing Algorithm
Aleksi.Ahtiainen@hut.fi T-79.194 Seminar on Theoretical Computer Science Feb 9 2005 Contents Introduction The Algorithm Research Results Future Work Criticism Conclusions Introduction is described in paper:
More informationAnalysis of Cluster based Routing Algorithms in Wireless Sensor Networks using NS2 simulator
Analysis of Cluster based Routing Algorithms in Wireless Sensor Networks using NS2 simulator Ashika R. Naik Department of Electronics & Tele-communication, Goa College of Engineering (India) ABSTRACT Wireless
More informationA 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 informationReferences. Introduction. Publish/Subscribe paradigm. In a wireless sensor network, a node is often interested in some information, but
References Content-based Networking H. Karl and A. Willing. Protocols and Architectures t for Wireless Sensor Networks. John Wiley & Sons, 2005. (Chapter 12) P. Th. Eugster, P. A. Felber, R. Guerraoui,
More informationChapter 7 Routing Protocols for Ad Hoc Wireless Networks. Jang-Ping Sheu
Chapter 7 Routing Protocols for Ad Hoc Wireless Networks Jang-Ping Sheu Introduction Routing protocols used in wired networks cannot be directly applied to ad hoc wireless networks Highly dynamic topology
More informationCLASSIFICATION OF ROUTING Routing. Fig.1 Types of routing
Volume 5, Issue 5, MAY 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Survey on Unicast
More informationEfficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks
Efficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks Jayanta Biswas and Mukti Barai and S. K. Nandy CAD Lab, Indian Institute of Science Bangalore, 56, India {jayanta@cadl, mbarai@cadl,
More information15-441: Computer Networking. Lecture 24: Ad-Hoc Wireless Networks
15-441: Computer Networking Lecture 24: Ad-Hoc Wireless Networks Scenarios and Roadmap Point to point wireless networks (last lecture) Example: your laptop to CMU wireless Challenges: Poor and variable
More informationAanchal Walia #1, Pushparaj Pal *2
An Implemented approach of VANET using Location Information based Technique for safe city and vehicle Aanchal Walia #1, Pushparaj Pal *2 #1. M.Tech Scholor,ECE,Krukshetra University, *2. A.P.ECE Department,
More informationWIRELESS SENSOR NETWORKS A Networking Perspective Edited by Jun Zheng Abbas Jamalipour A JOHN WILEY & SONS, INC., PUBLICATION WIRELESS SENSOR NETWORKS IEEE Press 445 Hoes Lane Piscataway, NJ 08854 IEEE
More informationRouting 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 informationNetworking Sensors, I
Networking Sensors, I Sensing Networking Leonidas Guibas Stanford University Computation CS428 Networking Sensors Networking is a crucial capability for sensor networks -- networking allows: Placement
More informationAd hoc and Sensor Networks Topology control
Ad hoc and Sensor Networks Topology control Goals of this chapter Networks can be too dense too many nodes in close (radio) vicinity This chapter looks at methods to deal with such networks by Reducing/controlling
More informationComparison of MANET and Sensor in Ad hoc Network
Comparison of MANET and Sensor in Ad hoc Network Tejeswar Raju V Vineeth V Sneha Raju tejeswarrajuv@gmail.com vineeth.381994@gmail.com sneharaju666@gmail.com Ajina Jaya Professor C.S.E department ajinajaya@gmail.com
More informationA Topology Based Routing Protocols Comparative Analysis for MANETs Girish Paliwal, Swapnesh Taterh
A Topology Based Routing Protocols Comparative Analysis for MANETs Girish Paliwal, Swapnesh Taterh Amity University Rajasthan, Jaipur, India Abstract MANET is a dynamic topology wireless network in which
More informationMobile Communications Chapter 8: Routing Protocols
Mobile Communications Chapter 8: Routing Protocols Ad-hoc networks Routing protocols Prof. Dr.-Ing. Jochen Schiller, http://www.jochenschiller.de/ MC SS05 8.1 Mobile ad hoc networks Standard Mobile IP
More informationData Communication. Guaranteed Delivery Based on Memorization
Data Communication Guaranteed Delivery Based on Memorization Motivation Many greedy routing schemes perform well in dense networks Greedy routing has a small communication overhead Desirable to run Greedy
More informationA Novel Review on Routing Protocols in MANETs
Robinpreet Kaur & Mritunjay Kumar Rai Department of Electronics and Engineering, Lovely Professional University, Phagwara, Punjab, India E-mail : robin_turna@yahoo.com, raimritunjay@gmail.com Abstract
More informationA Comparative study of On-Demand Data Delivery with Tables Driven and On-Demand Protocols for Mobile Ad-Hoc Network
A Comparative study of On-Demand Data Delivery with Tables Driven and On-Demand Protocols for Mobile Ad-Hoc Network Humayun Bakht Research Fellow, London School of Commerce, United Kingdom humayunbakht@yahoo.co.uk
More informationEfficient and Robust Geocasting Protocols for Sensor Networks
Efficient and Robust Geocasting Protocols for Sensor Networks Karim Seada, Ahmed Helmy Electrical Engineering Department, University of Southern California {seada, helmy}@usc.edu Abstract- Geocasting is
More informationA Survey on Intra Domain Protocols and Metrics for Choosing a Best Path in Wireless Network
IJSTE - International Journal of Science Technology & Engineering Volume 2 Issue 12 June 2016 ISSN (online): 2349-784X A Survey on Intra Domain Protocols and Metrics for Choosing a Best Path in Wireless
More informationDynamic Route Switching Protocol in Mobile Ad Hoc Networks
Dynamic Route Switching Protocol in Mobile Ad Hoc Networks Abstract Due to limited bandwidth, how to decrease routing overhead is an important issue in mobile ad hoc networks. Several multipath routing
More informationEnergy aware geographic routing in wireless sensor networks with anchor nodes. Mircea Cretu Stancu Utrecht University Computing Science May 2013
Energy aware geographic routing in wireless sensor networks with anchor nodes Mircea Cretu Stancu Utrecht University Computing Science May 2013 Overview Introduction Current paradigm EAGR preliminaries
More informationQoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET
2011 International Conference on Information and Network Technology IPCSIT vol.4 (2011) (2011) IACSIT Press, Singapore QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET Ashwini V. Biradar
More informationPerformance Evaluation Of Ad-Hoc On Demand Routing Protocol (AODV) Using NS-3 Simulator
Performance Evaluation Of Ad-Hoc On Demand Routing Protocol (AODV) Using NS-3 Simulator Dr. S. K. Singh Professor, Department of EC, India Dr. R. Gupta Asst. Prof. Department of EC, India Abstract: The
More informationSabareesan M, Srinivasan S*,John Deva Prasanna D S
Overall performance of Flooding Sequence Protocol in Wireless Sensor Networks Sabareesan M, Srinivasan S*,John Deva Prasanna D S Department of Computer Science and Technology, Hindustan University, Chennai,
More information