Routing and Topology Control in Ad Hoc & Wireless Sensor Networks
|
|
- Brendan Quinn
- 6 years ago
- Views:
Transcription
1 Routing and Topology Control in Ad Hoc & Wireless Sensor Networks Marcin Brzozowski IHP Im Technologiepark Frankfurt (Oder) Germany All rights reserved
2 Overview 1. Basics of routing Network in computer science Necessity of routing in wireless networks Routing in OSI reference model Routing challenges in Wireless Sensor Networks Energy efficiency 2
3 Overview 1. Routing ideas and protocols Routing in Ad Hoc & Wireless Sensor Networks Historical classification Network structure Distance vector Link state Flat Hierarchical Backbone Clustering When updates exchanged Addressing Proactive Reactive Hybrid Identity-centric Data-centric Geographic 3
4 Network in computer science Network is a graph G = (V,E) V set of all nodes E set of all edges: (v 1,v 2 ) E V 2 e.g. V = { A, B, C,... } E = { (A,B), (B,C), (C,F),... } Routing Find a (the best) path from source to destination D A I H C G F M L K E Q P U R O J W T N V S WSN graph idealized model connectivity is function of time nodes mobility... B 4
5 Routing in wireless networks Motivation Broadcast wireless medium, routing necessary? Radio range limited, direct communication source-sink impossible......multi hop communication required A J B I C H D E F G Routing necessary Find (optimal) route to destination on source.....and on intermediates nodes (forwarding) 5
6 Routing in wireless networks Motivation J H I E A B C D F G Direct communication sometimes possible Multi hop communication (often) more efficient than a direct one TX energy ~ distance α (α >= 2) (too) many receivers (overhearing) -> MAC solution? Collisions, reduced throughput 6
7 Routing in OSI Reference Model data dest G next E Application Presentation Session Transport E dest G G data next F F G data A J B I C H D E F G E G data Network Network PHY+MAC E G data Data link (MAC) Physical Data link (MAC) Physical PHY+MAC F G data 7
8 Network in computer science Routing: main task of network layer Network layer Abstraction for higher layer: SEND PACKET RECEIVE PACKET Hide multi-hop communication Wireless Sensor Networks: OSI Model relaxed Data-centric routing Cross-layer (e.g. RSSI read by Link Layer, Routing and Application) 8
9 Routing in Wireless Sensor Networks Challenges nodes fail hardware/software failures (repairs inconvenient) hostile environment nodes move around wireless communication unreliable scalability: number of nodes from several to many thousands limited energy need of energy-aware routing -> Communication interruptions (temporary, permanent) 9
10 Routing in Wireless Sensor Networks Communication interruptions Temporary Permanent Redundancy Retries Several routes Divesion (Re-routing) 10
11 Energy-efficient Routing Goals Minimize energy/bit Example: A-B-E-H Maximize network lifetime (Time until first node failure, loss of coverage, partitioning) D 3 3 A 1 B C E H G 2 2 F 4 Source:Holger Karl, Andreas Willig, University of Paderborn 11
12 Energy-efficient Routing Maximum total available battery capacity Path metric: Sum of battery levels (A-C-F-H) Minimum battery cost routing Path metric: Sum of reciprocal battery levels (A-D-H) Min-Max battery capacity routing Path metric: largest reciprocal battery level use route with smallest metric Minimize variance in power levels Minimum total transmission power D A 1 B 1 E 1 H G C F 2 4 Source:Holger Karl, Andreas Willig, University of Paderborn 12
13 Taxonomy Routing in Ad Hoc & Wireless Sensor Networks Historical classification Network structure Distance vector Link state Flat Hierarchical Backbone Clustering When updates exchanged Addressing Proactive Reactive Hybrid Identity-centric Data-centric Geographic 13
14 Routing maintenance Routing: additional information required (e.g. neighbours, network topology,...) Routing information exchanged with other nodes What information? With which nodes exchanged? D A B I H C G F M L K E Q P U R O J W T N V S How to find route? 14
15 Distance Vector Routing Called Bellman-Ford (1957), Routing Information Protocol (RIP) in Internet each node maintains routing table (no topology graph) dest next distance C B 2 G B 2 B B 1 L J 3 nodes known distances (hops, delay...) to their neighbours periodically distance vectors sent to all neighbours Routing table determined from received distance vectors Source: A.S. Tanenbaum, Computer Networks, Pearson Education International,
16 Distance Vector Routing Fast good news propagation off on Distance to A = DV sent DV sent B gets DV from A C gets DV from B (B->A = 1 hop) Source: A.S. Tanenbaum, Computer Networks, Pearson Education International,
17 Distance Vector Routing Slow bad news propagation Slow bad news propagation off on Distance to A DV sent (no A s DV) DV sent (no A s DV) A B C D E C gets DV from B (B->A B = gets 3 hops) DV from C (C->A = 2 Count-to-infinity hops) problem Source: A.S. Tanenbaum, Computer Networks, Pearson Education International,
18 Count-to-infinity solution Destination Sequenced Distance-Vector Routing (DSDV) Count-to-infinity problem: use of sequence numbers (in routing tables and update packets) Source: Ch.Perkins, P.Bhagwat, Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers, ACM SIGCOMM'94 Conference on Communications Architectures, Protocols and Applications,
19 Link State Routing Maintain (store) network topology graph Calculate the best path locally (e.g. Dijkstra shortest path algorithm) Network graph maintenance: Discover neighbours (ID, link cost) Broadcast neighbour list (link state packets) - send to all nodes! On RX update network graph Source: A.S. Tanenbaum, Computer Networks, Pearson Education International,
20 Distance Vector vs Link State Routing Distance Vector Routing Link State Routing Send routing table to neighbours Send link state (neighbour list) to all nodes large overhead Suffers from count-to-infinity (long convergence) Better (faster) convergence than DV In ARPANET: Distance Vector Routing replaced by Link State Routing Routing updates necessary, but when? Periodically On event, what event? 20
21 Taxonomy Routing in Ad Hoc & Wireless Sensor Networks Historical classification Network structure Distance vector Link state Flat Hierarchical Backbone Clustering When updates exchanged Addressing Proactive Reactive Hybrid Identity-centric Data-centric Geographic 21
22 Proactive Protocols Routing structures (routing tables, network graph) maintained continually -> route updates sent regardless of data traffic Route updates sent even when no data traffic overhead Maintained continually: periodically on topology change (e.g. Node fails) Referred as table-driven 22
23 Destination Sequenced Distance-Vector (DSDV) Modified Distance-Vector protocol Dest Next Dist Seq I am next to I am 1 to 5 I am 1 to 5 I am 2 to Routing table at node 15 I am next to 5 10 I am 1 to 5 15 I am 2 to 5 2 I am 3 to 5 Source: Dr.-Ing. Falko Dressler, University of Erlangen-Nürnberg 23
24 Destination Sequenced Distance-Vector (DSDV) Improvements on Distance-Vector Aging mechanism against count-to-infinity problem / loops each route entry with sequence number originated by destination Optimization Full route updates sent periodically Incremental route updates (smaller) sent on topological changes Don t forward updates immediately, wait for settling time 24
25 Fisheye State Routing (FSR) Goal: reduce Link State protocol overhead Detailed knowledge about distant nodes necessary? Imprecise knowledge = routing overhead reduction Data moves closer to dest -> enters regions with detailed knowledge Source: G.Pei, M.Gerla, and Tsu-Wei Chen. Fisheye state routing: A routing scheme for ad hoc wireless networks. In Proceedings of the IEEE International Conference on Communications, pages 70 74, New Orleans, LA, June
26 Fisheye State Routing (FSR) Link State with limited flooding LS packets exchanged with neighbors (instead of flooding like in LS routing) Frequent TX update for near stations Rare TX update for stations afar Source: G.Pei, M.Gerla, and Tsu-Wei Chen. Fisheye state routing: A routing scheme for ad hoc wireless networks. In Proceedings of the IEEE International Conference on Communications, pages 70 74, New Orleans, LA, June
27 Optimized Link State Routing (OLSR) Link State with efficient flooding Multiple Relay Node (MPR) must be one-hop neighbour MPR set covers all 2-hop nodes Each node selects its own minimal MPR set (for flooding) Suited for dense networks Source: T. Clausen, P. Jacquet, A. Laouiti, P. Muhlethaler, A. Qayyum, and L. Viennot, Optimized link state routing protocol for ad hoc networks, in Proceedings of the IEEE International Multi Topic Conference, December
28 Reactive Protocols Idea: No data traffic = no route maintenance Find route just before data transmission No route information (next hop, distance,...) initially; Steps to be taken: Discover path to dest (routing packets flooded) Destinations unicast response Data transmission Discovered path used for future data transmissions Referred as on-demand 28
29 Ad Hoc On-Demand Distance Vector Routing (AODV) Source sends route request (RREQ) Intermediate nodes record (memory) where RREQ came from required for reverse path Destination sends back directed route reply (RREP) reverse path used Intermediate nodes activate route routing table Source: E.Royer and C-K. Toh. A review of current routing protocols for ad hoc mobile wireless networks. In IEEE Personal Communication, volume 6, pages 46-55, April
30 Ad Hoc On-Demand Distance Vector Routing (AODV) Link failure maintenance How to detect a failure? Source moves route discovery reinitiated Failure along route Upstream neighbor detects failure Link failure notification to upstream nodes Source gets link failure notification Route discovery reinitiated Local repair Source: E.Royer and C-K. Toh. A review of current routing protocols for ad hoc mobile wireless networks. In IEEE Personal Communication, volume 6, pages 46-55, April
31 Dynamic Source Routing (DSR) Source sends route request (RREQ) Intermediate nodes records add ID in RREQ and forward......or send back RREP when route to destination is known Destination sends back RREP Asymmetric links supported: Destination initiates route discovery to source Source: E.Royer and C-K. Toh. A review of current routing protocols for ad hoc mobile wireless networks. In IEEE Personal Communication, volume 6, pages 46-55, April
32 Dynamic Source Routing (DSR) Optimizations: Route caching (in both directions: to source and to destination) from forwarded packets overhearing RREPLY created from local caches RREQ with hop limit (e.g. expanding ring starting from 0 hops) 32
33 Dynamic Source Routing (DSR) Error recovery basic DSR recovery DATA DATA DATA A B C D E ERR ERR package salvaging use local cache DATA DATA DATA A B C D E DATA DATA DATA F G 33
34 Zone Routing Protocol (ZRP) Hybrid Protocol (Proactive and Reactive) Nodes maintains two zones Intra-zone: proactive Inter-zone: reactive Zone radius in hops Bordercast instead of broadcast (e.g. in RREQ) Behaviour adjustable Larger radius: more proactive Smaller radiusor more reactive Source: N.Beijar, Zone Routing Protocol, Networking Laboratory, Helsinky University of Technology 34
35 Proactive and Reactive Protocols Proactive Reactive Maintain routing structures (routing tables, network graph) continually periodically on event (topology change) Route updates sent even when no data traffic overhead Do nothing when no data traffic Find path shortly before data transmission 1. Discover path (routing packets) 2. Transmit data Referred as table-driven Referred as on-demand 35
36 Summary Proactive Reactive Advantages: Advantages: No delays before data transmission Alternative paths without delay QoS support Overhead proportional to data transmission mostly much smaller than proactive (what if nodes move frequently?) Drawbacks: Drawbacks: Large protocol overhead Delay before data transmission 36
37 Taxonomy Routing in Ad Hoc & Wireless Sensor Networks Historical classification Network structure Distance vector Link state Flat Hierarchical Backbone Clustering When updates exchanged Addressing Proactive Reactive Hybrid Identity-centric Data-centric Geographic 37
38 Geographic Routing Physical locations (e.g. GPS, time of arrival, time difference of arrival,...) No route maintance required Routing overhead decreased Forward decision locally (based on positions) 38
39 Greedy Routing Forward to node closer to destination Known positions own destination (in packet) last sender (in packet) neighbours (e.g. one-hop broadcasts) Strategies most forward within radius (MFR) nearest with forward progress (NFP) neighbor closest to straight line between sender and destination (compass routing) Source: M.Ilyas, The Handbook of Wireless Ad Hoc Wireless Networks, CRC Press,
40 Greedy Routing...not always possible, what then? Traversal of planar graph when greedy fails F local optimum, no neighbour closer to dest -> switch to graph traversal G closer to dest than F, resume greedy More sophisticated approaches: Greedy Perimeter Stateless Routing Face-2 Source: M.Ilyas, The Handbook of Wireless Ad Hoc Wireless Networks, CRC Press,
41 Geographic Addressing and Routing (GeoCast) messages sent to all nodes in given area (point, circle, polygon) instead of IDs (geocasting) multi-level GeoRouters each router calculates its service area source passes data to its GeoRouter GeoRouter checks whether dest in its service area if not, forwards to the higher-level GeoRouter Source: X.Hong, K.Xu, M.Gerla, Scalable routing protocols for mobile ad hoc networks, IEEE Network, Volume 16 Issue 4, pages 11-21, Jul/Aug
42 Identity-centric Directed towards a well-specified particular destination (sink) Support for unicast, multicast, and broadcast messages 7 TO:2 1 Data TO:2 Data 11 Source TO:2 Data 2 Sink Source: Dr.-Ing. Falko Dressler, University of Erlangen-Nürnberg 42
43 Data-centric Data is focus of attention Doesn t matter which node exactly (which ID) sends data (several nodes sense same data) Forwarding of messages to all / some appropriate nodes Routing decisions according to the data, i.e. encoding rules are needed ID: B Data ID: B ID: B Data Data Waiting for B B Source ID: B Data B Waiting for B Source: Dr.-Ing. Falko Dressler, University of Erlangen-Nürnberg 43
44 Identity-centric vs. Data-centric Routing approach Prerequisites Routing techniques Identity-centric Identification of a path according to the destination address of the data message Network-wide unique addresses Proactive routing (continuous state maintenance) or reactive routing (on-demand path finding) Data-centric Determination of the destination of a data message according to the content of the packet Pre-defined message types and semantics (probabilistic) flooding schemes or interest-based reverse routing Source: Dr.-Ing. Falko Dressler, University of Erlangen-Nürnberg 44
45 Data-dissemination Data dissemination forwarding of data though the network Data dissemination Flooding Gossiping Agent-based approaches Reverse path techniques Source: Dr.-Ing. Falko Dressler, University of Erlangen-Nürnberg 45
46 Flooding Basic mechanism: Each node that receives a packet re-broadcasts it to all neighbors The data packet is discarded when the maximum hop count is reached Step 1 Step 2 Step 3 Source: Dr.-Ing. Falko Dressler, University of Erlangen-Nürnberg 46
47 Flooding Advantages No route discovery No topology maintenance Delay minimal (source-sink) Disadvantages TTL 3 TTL 4 Implosion: duplicate messages are sent to the same node Overlap: same events sensed by several nodes -> duplicate reports of the same event Resource blindness: available energy not considered and redundant transmissions may occur -> limited network lifetime Source: Dr.-Ing. Falko Dressler, University of Erlangen-Nürnberg 47
48 Gossiping GOSSIP(p) Probabilistic version of flooding Packets are re-broadcasted with a gossiping probability p for each message m if random(0,1) < p then message m Step 1 Step 2 Step 3 p p p p p p p p p p p Source: Dr.-Ing. Falko Dressler, University of Erlangen-Nürnberg 48
49 Gossiping Advantages Avoids packet implosion Lower network overhead compared to flooding Disadvantages Long propagation time throughout the network Does not guarantee that all nodes of the network will receive the message (similarly do other protocols but for gossiping this is an inherent feature ) p p p p n-1 n p p 2 p (n-1) p n Source: Dr.-Ing. Falko Dressler, University of Erlangen-Nürnberg 49
50 Publish/subscribe paradigm Decoupling in space: publisher and subscribers not aware of each other (e.g. sink ID not known to source) in time: publishing and notification at different times (Event Service as intermediate storage) in flows: asynchronous (no blocking) Source: P.T. Eugster, P.A. Felber, R. Guerraoui, and A.M. Kermarrec. The many faces of publish/subscribe. ACM Computing Surveys, 35(2): , June
51 Directed Diffusion Realization of publish/subscribe paradigm Data dissemination based on reverse path Basic behavior Each sensor node names its data with one or more attributes Other nodes express their interest depending on these attributes The sink node has to periodically refresh its interest if it still requires data to be reported to it Data is propagated along the reverse path of the interest propagation Source: Dr.-Ing. Falko Dressler, University of Erlangen-Nürnberg 51
52 Directed Diffusion Named data Interest propagation type = four-legged animal interval = 1s rect = [-100, 200, 200, 400] timestamp = 01:20:40 expiresat = 01:30:40 Data transmission type = four-legged animal instance = elephant location = [125, 220] intensity = 0.6 confidence = 0.85 timestamp = 01:20:40 // type of animal seen // instance of this type // node location // signal amplitude measure // confidence in the match // event generation time Source: Dr.-Ing. Falko Dressler, University of Erlangen-Nürnberg 52
53 Directed Diffusion Steps: Interest propagation send named data to neighbours Convergast tree creation: gradients set up store who interest came from (no global unique id required) Data propagation send data according to gradients 53
54 Rumor Routing Agent-based path creation algorithm Motivation: Query: sink->sources I need data... Event: sources -> sinks I collected data... Few queries, many events query flooding (+ paths to sinks set up) Many queries, few events event flooding (+ gradients towards event set up) Rumor routing in between Source: Dr.-Ing. Falko Dressler, University of Erlangen-Nürnberg 54
55 Rumor Routing Agents, or ants are long-lived entities created at random by nodes These are basically packets which are circulated in the network to establish shortest paths to events that they encounter Event A Agent A Known path to A Agent B Known path to B Event B Source: Dr.-Ing. Falko Dressler, University of Erlangen-Nürnberg 55
56 Rumor Routing Optimizations: Propagation of several events Path shortening Y Event A 2 Distance Event A Event B Z Event Distance Direction A 43 XY B 1 X X Event Distance A 4 B 2 Source: Dr.-Ing. Falko Dressler, University of Erlangen-Nürnberg 56
57 In-Network Processing Lifetime...several years required limited battery capacity, energy harvesting in initial phase Communicaton consumes much more energy that CPU TMOTE Sky: Energy for sending of 1 byte = hundreds of CPU instructions (100-byte packet = tens thousand CPU instructions) Goal: Network traffic reduction 57
58 In-Network Processing Local data processing compression aggregation (but large packets -> higher PER Distributed data processing cooperation in-network processing 43 C 22 C 43 C 22 C 22 C 22 C 21.7 C 21 C 21 C General communication high network traffic tardy data error discovery Data aggregation reduced network traffic early error discovery 58
59 Data aggregation chain 2 chain 3 Chain-based aggregation Tree-based aggregation chain 1 sink cluster 2 chain 4 A A A A cluster 1 C C C cluster 3 sink Grid-based aggregation sink Source: Dr.-Ing. Falko Dressler, University of Erlangen-Nürnberg 59
60 Data-aggregation Tradeoff: latency vs efficiency Δt Δt Δt Δt n-1 n Δt 2 Δt (n-1) Δt n Δt Source: Dr.-Ing. Falko Dressler, University of Erlangen-Nürnberg 60
61 In-Network Processing data dest G next E Application Presentation Session Transport E dest next G F G data F G Content Layer data A J B I C H D E F G E G data Network Network PHY+MAC E G data Data link (MAC) Physical Data link (MAC) Physical PHY+MAC F G data 61
62 Summary Forwarding based on: Locations, Addresses or/and Data Geographic routing (locations): Routing overhead decreased (e.g. No route maintenance) Data-centric routing Focus of attention: data Often more suitable for WSN than pure id-centric: Flexibility (source-sink decoupling) In-network processing 62
63 Taxonomy Routing in Ad Hoc & Wireless Sensor Networks Historical classification Network structure Distance vector Link state Flat Hierarchical Backbone Clustering When updates exchanged Addressing Proactive Reactive Hybrid Identity-centric Data-centric Geographic 63
64 Topology control Motivation Tasks carried out by dozens, hundreds, thousands...of nodes Topology control Massive routing overhead Collisions Reduced throughput Choose Backbone, links clusterheads explicitly Control Number transmit of routing power nodes reduced 64
65 Taxonomy Topology control Flat network all nodes have essentially same role Hierarchical network assign different roles to nodes; exploit that to control node/link activity Power control Backbones Clustering 65
66 Connectivity Network characteristic preserved (e.g. connectivity)......can be overpriced Maximum component size 5000 Probability of connectivity 1 Average size of the largest component ,8 0,6 0,4 0,2 Probability of connectivity Maximum transmission range Source:Holger Karl, Andreas Willig, University of Paderborn 66
67 Metrics Connectivity If two nodes connected in G, they have to be connected in G0 resulting from topology control Stretch factor should be small Hop stretch factor: how much longer are paths in G0 than in G? Energy stretch factor: how much more energy does the most energyefficient path need? Throughput removing nodes/links can reduce throughput, by how much? Robustness to mobility Algorithm overhead Source:Holger Karl, Andreas Willig, University of Paderborn 67
68 Flat Network Power control Idea: Controlling transmission power corresponds to controlling the number of neighbors for a given node 68
69 Flat Network Power control (?) Basic idea: Take a graph G = (V,E), produce a graph G0 = (V,E 0 ) that maintains connectivity with fewer edges Assume, e.g., knowledge about node positions Construction should be local (for distributed implementation) Source:Holger Karl, Andreas Willig, University of Paderborn 69
70 Relative Neighborhood Graph (RNG) Edge between nodes u and v if and only if there is no other node w that is closer to either u or v (remove longest edge from triangle) Formally: RNG maintains connectivity of the original graph Easy to compute locally Power control: find closest neighbours and use minimal power to reach them (?) This region has to be empty for the two nodes to be connected Source:Holger Karl, Andreas Willig, University of Paderborn 70
71 Backbone Construct a backbone network Some nodes control their neighbors; they form (minimal) dominating set Each node should have controlling neighbor Controlling nodes have to be connected (backbone) Only links within backbone and from backbone to controlled neighbors are used Formally: Given graph G = (V,E), construct D V such that Source:Holger Karl, Andreas Willig, University of Paderborn 71
72 Backbone Idea: Select some nodes from the network/graph to form a backbone A connected, minimal, dominating set (MDS or MCDS) Dominating nodes control their neighbors Protocols like routing are confronted with a simple topology from a simple node, route to the backbone, routing in backbone is simple (few nodes) Problem: MDS is an NP-hard problem Hard to approximate, and even approximations need quite a few messages Source:Holger Karl, Andreas Willig, University of Paderborn 72
73 Backbone by growing a tree 1: 2: 3: 4: Source:Holger Karl, Andreas Willig, University of Paderborn 73
74 Backbone by growing a tree Problem: Which gray node to pick? (turn whitest node gray) u u u d d d Lookahead using nodes g and w g v d u v d u v Lookahead: what would happen if not only gray node turned black, but also its white neighbours turned black? v=w v Source:Holger Karl, Andreas Willig, University of Paderborn 74
75 Clustering Partition nodes into groups ( clusters ) Each node in exactly one group (Except for nodes bridging between two or more groups) Groups can have clusterheads Typically: all nodes in a cluster are direct neighbors of their clusterhead Clusterheads are also a dominating set, but should be separated from each other they form an independent set Formally: Given graph G = (V,E), construct C V such that Source:Holger Karl, Andreas Willig, University of Paderborn 75
76 Clustering Partition nodes into groups of nodes clusters Many options for details Are there clusterheads? One controller/representative node per cluster May clusterheads be neighbors? If no: clusterheads form an independent set C: Typically: clusterheads form a maximum independent set May clusters overlap? Do they have nodes in common? Source:Holger Karl, Andreas Willig, University of Paderborn 76
77 Clustering Further options How do clusters communicate? Gateways between clusters No cluster overlap -> distributed gateway How many gateways exist between clusters? Are all active, or some standby? What is the maximal diameter of a cluster? If more than 2, then clusterheads are not necessarily a maximum independent set Is there a hierarchy of clusters? Source:Holger Karl, Andreas Willig, University of Paderborn 77
78 Clustering Computing a maximum independent set is NP-complete Can be approximate within ( +3)/5 for small, within O( log log / log ) else; bounded degree Maximum independent set not necessarily intuitively desired solution Source:Holger Karl, Andreas Willig, University of Paderborn 78
79 Clustering Basic construction of independent sets Init: Use some attribute of nodes to break local symmetries Node identifiers, energy reserve, mobility, weighted combinations - matters not for the idea as such (all types of variations have been looked at) Step 1: Step 2: Make each node a clusterhead that locally has the largest attribute value Black: cluster Gray: cluster member White: undecided Step 3: Step 4: Source:Holger Karl, Andreas Willig, University of Paderborn 79
80 Clustering Rotating clusterheads Serving as a clusterhead can put additional burdens on a node For MAC coordination, data forwarding... Let this duty rotate among various members Periodically reelect useful when energy reserves are used as discriminating attribute LEACH determine an optimal percentage P of nodes to become clusterheads in a network Use 1/P rounds to form a period In each round, np nodes are elected as clusterheads At beginning of round r, node that has not served as clusterhead in this period becomes clusterhead with probability P/(1-p(r mod 1/P)) Source:Holger Karl, Andreas Willig, University of Paderborn 80
81 Adaptive node activity Remaining option: Turn some nodes off deliberately Only possible if other nodes remain on that can take over their duties Example duty: Packet forwarding Approach: Geographic Adaptive Fidelity (GAF) Observation: Any two nodes within a square of length r < R/5 1/2 can replace each other with respect to forwarding R radio range Keep only one such node active, let the other sleep r R r Source:Holger Karl, Andreas Willig, University of Paderborn 81
82 Summary Large networks: Massive routing overhead Collisions...Topology control required Flat networks (power control) Hierarchy (backbone, clustering) Adaptive node activity 82
83 Routing in Ad Hoc & WSN Summary Internet routing (Distance-Vector, Link State) not directly usable in Ad Hoc & WSN No routing one size fits all, very application specific Data-centric: efficient means to energy efficiency Topology control essential in large networks 83
84 Summary Thank you for your attention! 84
Ad 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 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 informationAd hoc and Sensor Networks Chapter 10: Topology control
Ad hoc and Sensor Networks Chapter 10: Topology control Holger Karl Computer Networks Group Universität Paderborn Goals of this chapter Networks can be too dense too many nodes in close (radio) vicinity
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 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 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 informationMotivation and Basics Flat networks Hierarchy by dominating sets Hierarchy by clustering Adaptive node activity. Topology Control
Topology Control Andreas Wolf (0325330) 17.01.2007 1 Motivation and Basics 2 Flat networks 3 Hierarchy by dominating sets 4 Hierarchy by clustering 5 Adaptive node activity Options for topology control
More information2013, IJARCSSE All Rights Reserved Page 85
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 Overview of
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 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 informationInformation Brokerage
Information Brokerage Sensing Networking Leonidas Guibas Stanford University Computation CS321 Information Brokerage Services in Dynamic Environments Information Brokerage Information providers (sources,
More informationWireless Sensor Networks
Wireless Sensor Networks Routing M. Schölzel Network in computer science Network is a graph G = (V,E) V set of all nodes E set of all edges: (v 1,v 2 ) E V 2 V = { A, B, C,... } E = { (A,B), (B,C), (C,F),...
More informationA Comparative Study of Routing Protocols for Mobile Ad-Hoc Networks
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 11, November 2014,
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 informationCS5984 Mobile Computing
CS5984 Mobile Computing Dr. Ayman Abdel-Hamid Computer Science Department Virginia Tech Part II 1 Outline Routing Protocols for Ad hoc Networks DSDV: Highly Dynamic Destination-Sequenced Distance- Vector
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 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 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 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 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 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 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 informationRouting 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 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 informationECS-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 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 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 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 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 informationWireless Networking & Mobile Computing
Wireless Networking & Mobile Computing CS 752/852 - Spring 2012 Network Layer: Ad Hoc Routing Tamer Nadeem Dept. of Computer Science The OSI Communication Model Page 2 Spring 2012 CS 752/852 - Wireless
More informationREVIEW 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 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 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 information5.2 Routing Algorithms
CEN445 Network Protocols and Algorithms Chapter 5 Network Layer 5. Routing Algorithms Dr. Mostafa Hassan Dahshan Department of Computer Engineering College of Computer and Information Sciences King Saud
More informationChapter 11 Chapter 6
Routing Protocols References H. Karl and A. Willing. Protocols and Architectures for Wireless Sensor Networks. John Wiley & Sons, 2005. (Chapter 11) K. Sohraby, D. Minoli, and T. Znati. Wireless Sensor
More informationReferences. 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 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 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 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 informationOutline. 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 informationCMPE 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 informationSimulation and Comparative Analysis of AODV, DSR, DSDV and OLSR Routing Protocol in MANET Abstract Keywords:
Volume-9 Number-1 Jan -June 2017 pp. 16-21 available online at www.csjournalss.com Simulation and Comparative Analysis of AODV, DSR, DSDV and OLSR Routing Protocol in MANET Sachin Lalar, Arun Kumar Yadav
More informationChapter 16. Wireless LAN, Mobile Ad Hoc Networks, and MANET Routing Protocols. Wireless Network Models. Illustration of an ad hoc network
Chapter 16 Wireless LAN, Mobile Ad Hoc Networks, and MANET Routing Protocols Associate Prof. Yuh-Shyan Chen Department of CSIE National Chung Cheng University Wireless Network Models With Infrastructure:
More informationWireless LAN, Mobile Ad Hoc Networks, and MANET Routing Protocols
Chapter 16 Wireless LAN, Mobile Ad Hoc Networks, and MANET Routing Protocols Associate Prof. Yuh-Shyan Chen Department of CSIE National Chung Cheng University 2002/11/ Yuh-Shyan Chen 1 Wireless Network
More informationRouting Protocols in MANET: Comparative Study
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 7, July 2014, pg.119
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 informationEnergy-Efficient Communication Protocol for Wireless Micro-sensor Networks
Energy-Efficient Communication Protocol for Wireless Micro-sensor Networks Paper by: Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan Outline Brief Introduction on Wireless Sensor
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 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 informationAd hoc and Sensor Networks Chapter 3: Network architecture
Ad hoc and Sensor Networks Chapter 3: Network architecture Holger Karl, Andreas Willig, "Protocols and Architectures for Wireless Sensor Networks," Wiley 2005 Goals of this chapter Having looked at the
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 informationAd 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 informationA 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 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 informationPolitecnico 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 informationWireless Sensor Architecture GENERAL PRINCIPLES AND ARCHITECTURES FOR PUTTING SENSOR NODES TOGETHER TO
Wireless Sensor Architecture 1 GENERAL PRINCIPLES AND ARCHITECTURES FOR PUTTING SENSOR NODES TOGETHER TO FORM A MEANINGFUL NETWORK Mobile ad hoc networks Nodes talking to each other Nodes talking to some
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 informationQuiz 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 informationMobile Ad-hoc and Sensor Networks Lesson 04 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1
Mobile Ad-hoc and Sensor Networks Lesson 04 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1 Oxford University Press 2007. All rights reserved. 1 Ad-hoc networks deployment For routing, target detection,
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 informationPerformance Analysis of Proactive and Reactive Routing Protocols for QOS in MANET through OLSR & AODV
MIT International Journal of Electrical and Instrumentation Engineering, Vol. 3, No. 2, August 2013, pp. 57 61 57 Performance Analysis of Proactive and Reactive Routing Protocols for QOS in MANET through
More informationSimulation & 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 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 informationEnhanced QoS in MANETs using Analysis of Routing Protocol
International Journal of Scientific & Engineering Research, Volume 3, Issue 11, November-2012 1 Enhanced QoS in MANETs using Analysis of Routing Protocol # K. Venkata Ramana $ P.C. Devi and * B. Chaithanya
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 informationGeographic Routing in Simulation: GPSR
Geographic Routing in Simulation: GPSR Brad Karp UCL Computer Science CS M038/GZ06 23 rd January 2013 Context: Ad hoc Routing Early 90s: availability of off-the-shelf wireless network cards and laptops
More informationMobile 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 informationGeographic Adaptive Fidelity and Geographic Energy Aware Routing in Ad Hoc Routing
309 Geographic Adaptive Fidelity and Geographic Energy Aware Routing in Ad Hoc Routing Sinchan Roychowdhury Instrumentation Control Engineering Calcutta Institute of Engineering & Management Kolkata, India
More informationEZR: Enhanced Zone Based Routing In Manet
EZR: Enhanced Zone Based Routing In Manet Bency Wilson 1, Geethu Bastian 2, Vinitha Ann Regi 3, Arun Soman 4 Department of Information Technology, Rajagiri School of Engineering and Technology, Rajagiri
More informationA Review Paper on Routing Protocols in Wireless Sensor Networks
A Review Paper on Routing Protocols in Wireless Sensor Networks Seema Pahal 1, Kusum Dalal 2 1,2 ECE Department, DCRUST MURTHAL, Haryana Abstract- This paper presents a literature review on WSN networks,
More informationMaharishi 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 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 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 informationThe Open System Interconnect model
The Open System Interconnect model Telecomunicazioni Undergraduate course in Electrical Engineering University of Rome La Sapienza Rome, Italy 2007-2008 1 Layered network design Data networks are usually
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 informationComparison of proposed path selection protocols for IEEE s WLAN mesh networks
Comparison of proposed path selection protocols for IEEE 802.11s WLAN mesh networks Sana Ghannay, Sonia Mettali Gammar and Farouk Kamoun CRISTAL lab, National School of Computer Sciences, ENSI, 2010, Manouba
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 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 informationDYNAMIC 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 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 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 informationAd hoc and Sensor Networks Chapter 3: Network architecture
Ad hoc and Sensor Networks Chapter 3: Network architecture Goals of this chapter Having looked at the individual nodes in the previous chapter, we look at general principles and architectures how to put
More informationPerformance Evaluation of AODV DSDV and OLSR Routing Protocols with Varying FTP Connections in MANET
Performance Evaluation of AODV DSDV and OLSR Protocols with Varying FTP Connections in MANET Alok Upadhyay, Rupali Phatak Research Scholar, Asst. Professor -Department of Electronics & Communication Engineering
More informationCSC8223 Wireless Sensor Networks. Chapter 3 Network Architecture
CSC8223 Wireless Sensor Networks Chapter 3 Network Architecture Goals of this chapter General principles and architectures: how to put the nodes together to form a meaningful network Design approaches:
More informationPerformance Evaluation of AODV and DSR routing protocols in MANET
Performance Evaluation of AODV and DSR routing protocols in MANET Naresh Dobhal Diwakar Mourya ABSTRACT MANETs are wireless temporary adhoc networks that are being setup with no prior infrastructure and
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 informationComparative Study on Performance Evaluation of Ad-Hoc Network Routing Protocols Navpreet Chana 1, Navjot Kaur 2, Kuldeep Kumar 3, Someet Singh 4
Comparative Study on Performance Evaluation of Ad-Hoc Network Routing Protocols Navpreet Chana 1, Navjot Kaur 2, Kuldeep Kumar 3, Someet Singh 4 1 Research Scholar, Computer Science and Engineering, Lovely
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 informationTime Synchronization in Wireless Sensor Networks: CCTS
Time Synchronization in Wireless Sensor Networks: CCTS 1 Nerin Thomas, 2 Smita C Thomas 1, 2 M.G University, Mount Zion College of Engineering, Pathanamthitta, India Abstract: A time synchronization algorithm
More informationComputation of Multiple Node Disjoint Paths
Chapter 5 Computation of Multiple Node Disjoint Paths 5.1 Introduction In recent years, on demand routing protocols have attained more attention in mobile Ad Hoc networks as compared to other routing schemes
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 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 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 informationDYNAMIC SEARCH TECHNIQUE USED FOR IMPROVING PASSIVE SOURCE ROUTING PROTOCOL IN MANET
DYNAMIC SEARCH TECHNIQUE USED FOR IMPROVING PASSIVE SOURCE ROUTING PROTOCOL IN MANET S. J. Sultanuddin 1 and Mohammed Ali Hussain 2 1 Department of Computer Science Engineering, Sathyabama University,
More informationLecture 4. The Network Layer (cont d)
Lecture 4 The Network Layer (cont d) Agenda Routing Tables Unicast and Multicast Routing Protocols Routing Algorithms Link State and Distance Vector Routing Information and Open Shortest Path First Protocols
More informationAd hoc and Sensor Networks Chapter 3: Network architecture
Ad hoc and Sensor Networks Chapter 3: Network architecture Holger Karl Computer Networks Group Universität Paderborn Goals of this chapter Having looked at the individual nodes in the previous chapter,
More informationA Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network
ShriRam College of Engineering & Management 1 A Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network M.Ramaiya Rohit Gupta Rachit Jain Head,Dept. Computer Science Dept. Computer
More informationRedes 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 informationCSE 461 Routing. Routing. Focus: Distance-vector and link-state Shortest path routing Key properties of schemes
CSE 46 Routing Routing Focus: How to find and set up paths through a network Distance-vector and link-state Shortest path routing Key properties of schemes Application Transport Network Link Physical Forwarding
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 information