Ad hoc and Sensor Networks Chapter 11: Routing Protocols. Holger Karl
|
|
- Cordelia Hudson
- 5 years ago
- Views:
Transcription
1 Ad hoc and Sensor Networks Chapter 11: Routing Protocols Holger Karl
2 Goals of this Chapter In any network of diameter > 1, the routing & forwarding problem appears We will discuss mechanisms for constructing routing tables in ad hoc/sensor networks Specifically, when nodes are mobile Specifically, for broadcast/multicast requirements Specifically, with energy efficiency as an optimization metric Specifically, when node position is available
3 Overview Unicast routing in MANETs Gossiping and agent-based unicast forwarding Energy efficiency & unicast routing Multi-/broadcast routing Geographical routing Mobile nodes 3
4 Unicast, Id-centric Routing Given: a network/a graph Each node has a unique identifier (ID) Goal: Derive a mechanism that allows a packet sent from an arbitrary node to arrive at some arbitrary destination node The routing & forwarding problem Routing: Construct data structures (e.g., tables) that contain information how a given destination can be reached Forwarding: Consult these data structures to forward a given packet to its next hop 4
5 Unicast, Id-centric Routing Challenges Nodes may move around, neighborhood relations change Optimization metrics may be more complicated 5
6 Routing Protocols Because of challenges, standard routing approaches not really applicable Too big an overhead, too slow in reacting to changes Examples: Dijkstra s link state algorithm; Bellman-Ford distance vector algorithm 6
7 Routing Protocols Simple solution: Flooding Does not need any information (routing tables) simple Packets are usually delivered to destination But: overhead is prohibitive! Usually not acceptable, either! Need specific, ad hoc routing protocols
8 Routing Protocols Classification Main question to ask: When does the routing protocol operate? Option 1: Routing protocol always tries to keep its routing data up-to-date Protocol is proactive (routing tables are actually needed) or tabledriven Option : Route is only determined when actually needed Protocol operates on demand (reactive) Option 3: Combine these behaviors Hybrid protocols 8
9 Identification of Nodes Which data is used to identify nodes? An arbitrary identifier? The position of a node? Can be used to assist in geographic routing protocols because choice of next hop neighbor can be computed based on destination address Identifiers that are not arbitrary, but carry some structure? As in traditional routing Structure akin to position, on a logical level?
10 Overview Unicast routing in MANETs Gossiping and agent-based unicast forwarding Energy efficiency & unicast routing Multi-/broadcast routing Geographical routing Mobile nodes 10
11 Gossiping and Agent-based Unicast Forwarding Basic idea : Attempt to work without routing table Find a forwarding set without recurring to topology control mechanism
12 Gossiping and Agent-based Unicast Forwarding Basic idea : Rumor mongering Once a site receives an update, It periodically, randomly chooses another site to propagate this update to it It stop doing so after the update has already been received by a sufficient number of sites Wireless multicast advantage A single transmission can be received by all neighboring nodes in radio ranges
13 Randomized Forwarding How information spreads in a wireless network by such a gossiping mechanism? The key parameter of their mechanism is the probability with which a node retransmits a newly incoming message 13
14 Randomized Forwarding The probability with which a node retransmits a newly incoming message In the simplest case, this probability is constant. If the critical probability value below the threshold the gossip dies out quickly and reaches only a small number of nodes If the probability larger than the critical The most of gossips reach (almost) all of the nodes in the network Typical value for the critical threshold are about 65 to 75 % 14
15 Randomized Forwarding The node near the boundary of the sensor network s deployment region is critical as they have a smaller number of neighbors than nodes in the center of the region 15
16 Randomized Forwarding Possible solution: A node with few neighbors retransmit with higher probability, Retransmitting messages over the first few hops with probability 1, Retransmit a message if the node does not overhear the message repeated from at least one of its neighbors
17 Random Walks: Basic idea: Think of a data packet as an agent that wanders through the network in search of its destination Agents are sent via unicast Instead of single agent, several of them can be injected into the network 17
18 Random Walks: Rumor Routing The rumor routing Only installs a few paths in the network by sending out one or several agents 18
19 Random Walks: Rumor Routing The middle detects an event and installs two event paths in the network Once a node tries to query an event, it also sends out one or more agents Such a search agent is forwarded through the network until it intersects with a preinstalled event path and then knows how to find an event. 19
20 Random Walks: Rumor Routing The node in the lower left corner sends out such a search, which happens to propagate upward until it intersects with one event path? 0
21 Random Walks with Known Destination Problem: lots of nodes are redundantly deployed but some of these nodes are randomly turned off and later on again Solution: Idea: use random walks to ensure that all possible paths in the network are used with equal probability, spreading the forwarding burden over all nodes To do so, only local computations should be required for each node 1
22 Further Reading The basic ideas of random walks are related to biologically inspired algorithms For example, based on the behavior of ants or other swarm insects The idea of mobile agents originally contains the idea of sending code, through the network, that is executed at each node (active networks) A multipath approach where an intermediate node makes a probabilistic decision about whether to forward a packet This probability depends on distance between sensor and destination or number of hops that a packet has already traveled
23 Overview Unicast routing in MANETs Gossiping and agent-based unicast forwarding Energy efficiency & unicast routing Multi-/broadcast routing Geographical routing Mobile nodes 3
24 Energy-Efficient Unicast Particularly interesting performance metric Goals: 3 A 1 4 Minimize energy/bit Example: A-B-E-H Maximize network lifetime Time until first node failure, loss of coverage, partitioning D 3 3 B 1 E 1 H 4 G C 1 F 4 4 Example: Send data from node A to node H
25 Basic Options for Path Metrics Maximum total available battery capacity Path metric: Sum of battery levels Example: A-C-F-H D 3 3 A 1 B 1 4 C E H 1 4 G F 4
26 Basic Options for Path Metrics Minimum battery cost routing (MBCR) Path metric: Sum of reciprocal battery levels Example: A-D-H D 3 3 A 1 B 1 4 C E H 1 4 G F 4
27 Basic Options for Path Metrics Min Max Battery Cost Routing (MMBCR) Instead of using the sum of reciprocal battery levels, simply the largest reciprocal level of all nodes along a path is used as the cost for this path Then, again the path with the smallest cost is used In this sense, the optimal path is chosen by minimizing over a maximum Example: A-D-H (1/3) 3 ACFG(1/1) 7 3 D 3 A 1 B 1 E 1 H 4 4 C 1 F G 4
28 Basic Options for Path Metrics Conditional max-min battery capacity routing If there are routes along which all nodes have a battery level exceeding a given threshold Then select the route that requires the lowest energy per bit. If there is no such route, then pick that route which maximizes the minimum battery level 8 D A 1 B 1 E H G C 1 F 4
29 Basic Options for Path Metrics Minimize variance in power levels To avoid some nodes prematurely running out of energy and disrupting the network Hence, routes should be chosen such that the variance in battery levels between different routes is reduced D 3 3 A 1 B 1 4 C E 1 H 4 G F 4
30 Basic Options for Path Metrics Minimum Total Transmission Power Routing (MTPR) Goal: guarantee that transmissions are successful A given transmission is successful if its SINR exceeds a given threshold MTPR is of course also applicable to multi-hop networks D 3 3 A 1 B 1 4 C E 1 H 4 G F 4
31 Some Example Unicast Protocols Attracting routes by redirecting Idea: nodes can overhear packet exchanges between other nodes Process: Energy requirement is included in the packet When communication between two adjacent nodes X and Z proceeds, a third node Y can decide whether it can offer a more energy-efficient route. Y Z 31 X
32 Some Example Unicast Protocols Distance vector routing on top of topology control The relay regions concept described in Section also lends itself to a formulation of an energy-efficient routing problem 3
33 Some Example Unicast Protocols Maximizing time to first node outage (run out of energy) as a flow problem (normal maximum flow algorithm are not applicable ) 33
34 Some Example Unicast Protocols Two approximation algorithms first algorithm: find a generalized description of the costs of a link (consider energy cost, initial and residual battery capacity.) second algorithm is a flow redirection algorithm The core result is that system lifetime can be extended up to 60% 34 D A 1 B 1 E 1 H 4 4 G C 1 F 4
35 Some Example Unicast Protocols Maximizing time to first node outage by a max min optimization There are two algorithms The max min zpmin approximation: the minimal remaining power in all nodes is the largest. Property: Require knowledge of battery power level May pick a very expensive path Sol: Pick a path having at most a power consumption of zpmin The zone routing approximation can work without this information at only slightly reduced performance 35
36 Some Example Unicast Protocols Maximizing number of messages The goal is to maximize the number of messages that can be sent over a network before it runs out of energy 36
37 Some Example Unicast Protocols One non-trivial link weight: w ij weight for link node i to node j e ij required energy, λ some constant, α i fraction of battery of node i already used up Path metric: Sum of link weights Use path with smallest metric Properties: Many messages can be send, high network lifetime 37
38 Some Example Unicast Protocols Bounding the difference between routing protocols the graph is partitioned into spheres Si that include all the nodes that are reachable from the base station in at most i hops 38
39 Some Example Unicast Protocols Bounding the difference between routing protocols Then, all traffic has to go through the nodes of sphere S1, and because there are relatively few of these nodes, they limit the lifetime of the network 39
40 Multipath Unicast Routing Multiple paths between a given source/destination pair Energy consumption across multiple path is therefore an option worthwhile exploring Fault-tolerance: multiple paths provide redundancy in that they can serve as hot standbys to quickly switch to when a node or a link on a primary path fails 40
41 Multipath Unicast Routing Sequential Assignment Routing (SAR) Problem : computing such k-disjoint paths requires about k times more overhead than a single-path routing protocol SAR : require paths different neighbors of the sink. constructing trees outward from each sink neighbor; in the end, most nodes will then be part of several such trees 41
42 Multipath Unicast Routing Constructing energy-efficient secondary paths Concern: the energy efficiency of these secondary paths compared to the optimal primary path 4
43 Multipath Unicast Routing For disjoint paths, Primary path: via its best neighbor toward the data source neighbor This alternate path: forwarded toward the best neighbor that is not already on the primary path. 43
44 Multipath Unicast Routing For braided paths, Require to leave out some nodes of the primary path but are free to use other nodes on the primary path. 44
45 Multipath Unicast Routing Simultaneous transmissions over multiple paths There is some delay in detecting the need to use a secondary path The idea assume node-disjoint paths send several copies of a given packet over these different paths to the destination This trades off resource consumption against packet error rates 45
46 Multipath Unicast Routing Randomly choosing one of several paths Each node maintains an energy cost estimate for each of its neighbors The next hop is randomly chosen proportional to the energy consumption of the path over this neighbor 46
47 Multipath Unicast Routing Randomly choosing one of several paths Suppose node v has neighbors v1 to vn that advertise cost c1,..., cn, respectively Node v will advertise as its own cost Node v forward an incoming packet to neighbor i with probability 47
48 Multipath Unicast Routing Trade-off analysis Supporting such multiple paths in a network implies a trade-off between robustness and energy efficiency This tradeoff is analyzed by Krishnamachari et al. [440], who compare the robustness gained by multiple paths with those owing to simply increasing transmission power Result: Single path with a larger transmission power dominates. 48
49 Overview Unicast routing in MANETs Gossiping and agent-based unicast forwarding Energy efficiency & unicast routing Multi-/broadcast routing Geographical routing Mobile nodes 49
50 Broadcast & Multicast(Energy-Efficient) Distribute a packet to all reachable nodes (broadcast) or to a somehow (explicitly) denoted subgroup (multicast) 50
51 Broadcast & Multicast(Energy-Efficient) Basic options Source-based tree: Construct a tree (one for each source) to reach all addressees Minimize total cost (= sum of link weights) of the tree Minimize maximum cost to each destination Shared, core-based trees Use only a single tree for all sources Every source sends packets to the tree where they are distributed Mesh Trees are only 1-connected! Provide higher redundancy and thus robustness in mobile environments 51
52 Broadcast & Multicast (Energy-Efficient) Source-based tree: For each source, minimize the total cost Try to find a tree for which the sum of all link costs is minimal (over all possible trees rooted at the source) This is the Steiner tree problem 5
53 Broadcast & Multicast (Energy-Efficient) Source-based tree: For each source, minimize the maximum cost to each destination minimize the costs to each individual destination separately In effect, this maps the multicast problem to repeated unicast shortest path problems, 53
54 Broadcast & Multicast (Energy-Efficient) Shared, core-based trees Use only a single tree for all sources Every source sends packets to the tree where they are distributed 54
55 Broadcast & Multicast (Energy-Efficient) Mesh Trees are only 1-connected! use meshes to provide higher redundancy and thus robustness in mobile environments 55
56 Summary of Options (Broadcast/Multicast) Broadcast Multicast One tree per source Shared tree (core-based tree) Mesh Minimize total cost (Steiner tree) Minimize cost to each node (e.g., Dijkstra) Single core Multiple core 56
57 Wireless Multicast Advantage Broad-/Multicasting in wireless is unlike broad- /multicasting in a wired medium Wires: Locally distributing a packet to n neighbors: n times the cost of a unicast packet 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 57
58 Source-Based Tree Protocols A greedy heuristic Shortest Path Tree the shortest path and overlay all these paths onto a tree Shortest Path Tree (SPT) this greedy heuristic does not have a good approximation ratio 58
59 Source-Based Tree Protocols Broadcasting using minimum cost spanning tree Prim s algorithm A simple broadcasting algorithm can be based on a minimum cost spanning tree. One possible algorithm to compute it is due to Prim 59
60 Source-Based Tree Protocols Some Steiner tree approximations for multicasting Computing Steiner tree is NP complete A simple approximation Pick some arbitrary order of all destination nodes + source node Successively add these nodes to the tree: For every next node, construct a shortest path to some other node already on the tree Performs reasonably well in practice 60
61 Source-Based Tree Protocols Some Steiner tree approximations for multicasting Takahashi Matsuyama heuristic Similar, but let algorithm decide which is the next node to be added Start with source node, add that destination node to the tree which has shortest path Iterate, picking that destination node which has the shortest path to some node already on the tree 61
62 Exploiting Wireless Multicast Advantage for Broadcast Broadcast incremental power The core idea is that a node that is already transmitting to some other node would only have to raise its transmission power in order provide data also to further nodes, without incurring cost for another transmission the additional cost for a node to supply a further node with data is only the difference between the current and the needed (higher) transmission power On the basis of this idea, a modification of Prim s algorithm is possible 6
63 BIP Example Round 1: A Round : A Round 3: A S 1 B S (1) B S (3) B D 1 C Round 4: A D 1 C Round 5: A D 1 C S (3) 3 B S (5) 3 B D C (1) D C (1)
64 Sweep Operation 64
65 Exploiting Wireless Multicast Advantage for Multicast Pruning broadcast trees by Multicast Incremental Power (MIP) Given a broadcast tree, Prune it by removing all nodes from the tree that have no members of the destination set as downstream nodes In addition, the sweep operation can be applied to reduce transmission power if high power is only needed to supply subtrees without any destination nodes. 65
66 Embedded Wireless Multicast Advantage Transforming Existing Graphs A different approach to leverage the wireless multicast advantage Start from a traditional, link-oriented broadcast tree, ex: the minimum-cost spanning tree Look for opportunities to increase transmission power levels of certain trees such that the additionally covered nodes can stop transmitting and the resulting, 66
67 A Distributed, Position-Based Approach to the Wireless Multicast Mdvantage Start from Relative Neighborhood Graph (RNG) u and v are connected if no w that is close to each of u and v For each v, the transmission range as the smallest range that connect v and its neighbors. Take the wireless multicast advantage The RNG-based scheme is advantageous, especially in dense networks 67
68 Shared, Core-based Tree Protocols The challenge in core-based tree multicast protocols lies in finding a good core node. Once this node is determined, essentially the problem can be reformulated as a source-based tree protocol with the core node as the source 68
69 Shared, Core-based Tree Protocols Merge point formation Assume there are a few sinks in a network to which data shall be distributed via a core-based multicast tree Process Each sink broadcast advertisement messages indicating its presence. Each node collect these advertisement along with sink ID and number of hops After a certain time, each node that has received more than one sink advertisement broadcasts merge advertisement messages. These messages are only forwarded by nodes that have heard from fewer sinks or whose cumulative distance to all sinks is larger 69
70 Mesh-Based Protocols Core-Assisted Mesh Protocol (CAMP) The redundancy of the mesh can actually enable shorter paths in the mesh than would be possible in a core-based tree However, up to the forwarding procedure to actually be able to exploit these shortcuts without resorting to flooding the entire mesh with data. 70
71 Mesh-Based Protocols Two-tier data dissemination Overlay a mesh, route along mesh intersections Broadcast within the quadrant where the destination is (assumed to be) located Sink Event 71
72 Further reading on broadcast and multicast Gossiping for multicast Gossiping is used to improve the reliability of multicasting Directed antennas for multicasting Assuming that directed antennas can be used to concentrate power to the neighbors in the multicast tree and thus reduce power consumption. Optimal solutions by linear programming This modeling approach obviously does not change the complexity of the problem (integer linear programming is NPhard), it can often lead to good approximations of the optimal solutions by standard relaxation techniques 7
73 Further reading on broadcast and multicast Time to complete a multicast Mostly the energy required for a multicast or broadcast has been considered. But the time necessary to do so can also be important Data placement There is a further variant of Steiner tree approximations which boils down to choosing good Steiner points. Cooperative multihop broadcast Using advanced signal processing, a node might be able to reconstruct the correct packet even if each individual reception is erroneous 73
74 Overview Unicast routing in MANETs Gossiping and agent-based unicast forwarding Energy efficiency & unicast routing Multi-/broadcast routing Geographical routing Position-based routing Geocasting Mobile nodes 74
75 Geographic routing Routing tables contain information to which next hop a packet should be forwarded Explicitly constructed Alternative: Implicitly infer this information from physical placement of nodes Position of current node, current neighbors, destination known send to a neighbor in the right direction as next hop Geographic routing 75
76 Geographic routing Options Send to any node in a given area geocasting Use position information to aid in routing position-based routing Might need a location service to map node ID to node position 76
77 Basics of position-based routing Most forward within range r strategy Send to that neighbor that realizes the most forward progress towards destination Note: farthest away from sender! 77
78 Basics of position-based routing Nearest node with (any) forward progress Idea: Minimize transmission power Directional routing Choose next hop that is angularly closest to destination Choose next hop that is closest to the connecting line to destination Problem: Might result in loops! 78
79 Basics of position-based routing The problem of dead ends Simple strategies might send a packet into a dead end 79
80 Basics of position-based routing Restricted flooding Restricted flooding is quite suited to compensate for mobility of the destination. Assume that the destination moves at a given speed v the distance between transmitting node and destination is known, a source forwards to some of or all of the nodes that are closer to the destination than itself 80
81 Right hand rule to leave dead ends GPSR 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 such circles 81
82 Right hand rule to leave dead ends GPSR Geometric Perimeter State Routing (GPSR) Earlier versions: Compass Routing II, face- routing Use greedy, most forward routing as long as possible If no progress possible: Switch to face routing Face: largest possible region of the plane that is not cut by any edge of the graph; can be exterior or interior Send packet around the face using right-hand rule Use position where face was entered and destination position to determine when face can be left again, switch back to greedy routing Requires: planar graph! (topology control can ensure that) 8
83 GPSR Example Route packet from node A to node Z Leave face routing E I B F H K A D Z Enter face routing C G J L 83
84 Performance guarantees of combined greedy/face routing Face routing is tasked with routing around obstacles or out of dead ends while greedy routing tries to make quick progress toward the destination The first combined greedy/face routing algorithm that is provably worst-case optimal In order to show the worst-case optimality, quickly switching back to greedy routing could not be used the Greedy and (Other Adaptive) Face Routing (GOAFR)+ algorithm that is worst-case optimal and at the same time efficient in the average case 84
85 GOAFR+ algorithm The algorithm maintains a bounding circle, centered at the destination node, that prevents the face search from needlessly exploring in the wrong direction A packet maintains two counters, p and q Counter p contains the number of nodes on the face perimeter that are closer to the destination than is the node where face search started; Counter q counts nodes farther away 85
86 Combination with ID-base routing Pure position-baseed routing in Mobile destination node, immediate vicinity can be problematic Solution: by ID
87 GeRaF How to combine position knowledge with nodes turning on/off? Goal: Transmit message over multiple hops to destination node; deal with topology constantly changing because of on/off node Idea: Receiver-initiated forwarding Forwarding node S simply broadcasts a packet, without specifying next hop node Some node T will pick it up (ideally, closest to the source) and forward it 87
88 GeRaF Problem: How to deal with multiple forwarders? Position-informed randomization: The closer to the destination a forwarding node is, the shorter does it hesitate to forward packet Use several annuli to make problem easier, group nodes according to distance (collisions can still occur) 88
89 GeRaF Example A 4 A 3 A A D-1 D
90 Geographic routing without positions GEM Apparent contradiction: geographic, but no position? virtual coordinates preserve enough neighborhood information to be useful in geographic routing do not require actual position determination
91 Geographic routing without positions GEM Two essential parts: Use polar coordinates from a center point Assign virtual angle range to neighbors of a node, Construct a spanning tree with the center point as the root. Define the radius of a node by the number of hops (in spanning tree) 91
92 Geographic routing without positions GEM Process: Choose two nodes in addition to the original root. Determine, for each node, the hop count of the shortest path between each of these three nodes(so, total three spanning tree) Each node can triangulate its own position in the hop count metric. 9
93 Overview Unicast routing in MANETs Gossiping and agent-based unicast forwarding Energy efficiency & unicast routing Multi-/broadcast routing Geographical routing Position-based routing Geocasting Mobile node 93
94 Location-based Multicast (LBM) Geocasting by geographically restricted flooding Define a forwarding zone nodes in this zone will forward the packet to make it reach the destination zone 94
95 Location-based Multicast (LBM) Static zone: smallest rectangle that contains both the source and the entire destination region. Adaptive zone smallest rectangle containing forwarding node and destination zone Possible dead ends again Adaptive distances packet is forwarded by node u if node u is closer to destination zone s center than predecessor node v (packet has made progress) Packet is always forwarded by nodes within the destination zone itself otherwise. 95
96 Determining next hops based on Voronoi diagrams Goal: Use that neighbor to forward packet that is closest to destination among all the neighbors Use Voronoi diagram computed for the set of neighbors of the node currently holding the packet B C A S D 96
97 Tessellating the plane Tessellation: of the plane is a collection of plane figures that fills the plane with no overlaps and no gaps The first protocol uses a fixed tessellation of the plane into hexagons where each hexagon either has a manager in charge of it or is classified as an obstacle to be rooted around 97
98 Tessellating the plane The second protocol is GeoGRID The plane is divided into square grids where each grid has an elected gateway in charge of it. Only those gateway nodes propagate packets among different grids, resulting in a need to control the size of such a grid 98
99 Mesh-based geocasting Geocast Adaptive Mesh Environment for Routing (GAMER) a mesh-based protocol for geocasting It improves upon other mesh-based geocasting protocols by adapting the density of the created mesh according to the mobility of the nodes in the network 99
100 Geocasting using ad hoc routing GeoTORA GeoTORA: All nodes in the destination region act as sinks Different nodes have different heights above ground. Destination is the lowest point No local minimum. 100
101 Trajectory-based forwarding (TBF) Think in terms of an agent : Should travel around the network, e.g., collecting measurements Random forwarding may take a long time Idea: Provide the agent with a certain trajectory along which to travel Described, e.g., by a simple curve Forward to node closest to this trajectory 101
102 Further reading on geographic routing Impact of localization errors In a real system, it is unrealistic to expect that all nodes know their correct positions Location services This service is important for ad hoc or Internet-based geographic information but rarely needed in WSNs Such position databases or location tables can be organized centrally or the information can be kept distributed in structures akin to routing tables 10
103 Further reading on geographic routing Location-Aided Routing (LAR) This protocol uses location information to assist in the flooding phases of standard ad hoc routing protocols The protocol is similar in many respects to the LBM Making geocasting energy aware Geographic and Energy Aware Routing (GEAR) is a geocasting scheme that introduces load-splitting among neighbors when forwarding toward the target region, trying to equalize the energy consumption of all nodes 103
104 Further reading on geographic routing Geographic routing without geographic coordinates The coordinates used for geographic routing are purely virtual ones and are constructed without actually recurring to the physical location of nodes at all Another schemes where perimeter nodes do not know their location and show that, even then, virtual coordinates are still useful for geographic routing protocols 104
105 Overview Unicast routing in MANETs Energy efficiency & unicast routing Multi-/broadcast routing Geographical routing Mobile nodes 105
106 Mobile nodes, mobile sinks Mobile nodes cause some additional problems E.g., multicast tree to distribute readings has to be adapted Source Sink moves downward Source Source Sink moves upward 106
107 Mobile data collectors Sometimes, it is not possible or desirable to move the actual data sinks around but using multihop communication might also not be useful Mobile Ubiquitous LAN extensions (MULEs) MULE is a mobile device, equipped with radio front ends to communicate with sensor nodes, that moves around between the sensor nodes, collects and buffers their data, and occasionally visits the actual data sink to off-load that data. MULEs are considerably more energy efficient than multihop communication and can increase lifetime of the network without impeding data collection quality too much 107
108 Mobile regions The geocast destination regions so far considered were static For some applications like tracking mobile events, it would be useful to be able to specify a destination zone that changes its location over time. For such a moving zone, data should be delivered at time t to all nodes that are covered by the destination zone at time t. This service model is called mobicast 108
109 Conclusion Routing exploit various sources of information to find destination of a packet Explicitly constructed routing tables Implicit topology/neighborhood information via positions Routing can make some difference for network lifetime However, in some scenarios (streaming data to a single sink), there is only so much that can be done Energy efficiency does not equal lifetime, holds for routing as well Non-standard routing tasks (multicasting, geocasting) require adapted protocols 109
Chapter 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 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 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 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 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 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 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 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 13a: Protocols for dependable data transport
Ad hoc and Sensor Networks Chapter 13a: Protocols for dependable data transport Holger Karl Computer Networks Group Universität Paderborn Overview Dependability requirements Delivering single packets Delivering
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 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 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 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 informationData gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks
Mobile Information Systems 9 (23) 295 34 295 DOI.3233/MIS-364 IOS Press Data gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks Keisuke Goto, Yuya Sasaki, Takahiro
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 informationInformation Brokerage
Information Brokerage Sensing Networking Leonidas Guibas Stanford University Computation CS321 Information Brokerage Services in Dynamic Environments Information Brokerage Information providers (sources,
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 informationWhat is Multicasting? Multicasting Fundamentals. Unicast Transmission. Agenda. L70 - Multicasting Fundamentals. L70 - Multicasting Fundamentals
What is Multicasting? Multicasting Fundamentals Unicast transmission transmitting a packet to one receiver point-to-point transmission used by most applications today Multicast transmission transmitting
More 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 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 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 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 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 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 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 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 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 informationEnd-To-End Delay Optimization in Wireless Sensor Network (WSN)
Shweta K. Kanhere 1, Mahesh Goudar 2, Vijay M. Wadhai 3 1,2 Dept. of Electronics Engineering Maharashtra Academy of Engineering, Alandi (D), Pune, India 3 MITCOE Pune, India E-mail: shweta.kanhere@gmail.com,
More informationExperiments with Broadcast Routing Algorithms for Energy- Constrained Mobile Adhoc Networks. (Due in class on 7 March 2002)
EE Project Description Winter Experiments with Broadcast Routing Algorithms for Energy- Constrained Mobile Adhoc Networks (Due in class on March ) Abstract In this project, you will experiment with the
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 informationCourse Routing Classification Properties Routing Protocols 1/39
Course 8 3. Routing Classification Properties Routing Protocols 1/39 Routing Algorithms Types Static versus dynamic Single-path versus multipath Flat versus hierarchical Host-intelligent versus router-intelligent
More informationAn Ant-Based Routing Algorithm to Achieve the Lifetime Bound for Target Tracking Sensor Networks
An Ant-Based Routing Algorithm to Achieve the Lifetime Bound for Target Tracking Sensor Networks Peng Zeng Cuanzhi Zang Haibin Yu Shenyang Institute of Automation Chinese Academy of Sciences Target Tracking
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 informationDISCOVERING OPTIMUM FORWARDER LIST IN MULTICAST WIRELESS SENSOR NETWORK
DISCOVERING OPTIMUM FORWARDER LIST IN MULTICAST WIRELESS SENSOR NETWORK G.Ratna kumar, Dr.M.Sailaja, Department(E.C.E), JNTU Kakinada,AP, India ratna_kumar43@yahoo.com, sailaja.hece@gmail.com ABSTRACT:
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 informationCHAPTER 2 WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL
WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL 2.1 Topology Control in Wireless Sensor Networks Network topology control is about management of network topology to support network-wide requirement.
More informationConnected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees
Connected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees Pouya Ostovari Department of Computer and Information Siences Temple University Philadelphia, Pennsylvania, USA Email: ostovari@temple.edu
More informationChapter 8: Energy Conservation. MANETs. Prof. Yuh-Shyan Chen Department t of Computer Science and Information Engineering
Chapter 8: Energy Conservation for Broadcast Routing in MANETs Prof. Yuh-Shyan Chen Department t of Computer Science and Information Engineering National Taipei University 1 Outline Introduction Energy-Efficient
More informationRouting. 4. Mar INF-3190: Switching and Routing
Routing 4. Mar. 004 1 INF-3190: Switching and Routing Routing: Foundations! Task! To define the route of packets through the network! From the source! To the destination system! Routing algorithm! Defines
More informationEfficient Broadcasting in Ad Hoc Wireless Networks Using Directional Antennas
Efficient Broadcasting in Ad Hoc Wireless Networks Using Directional Antennas Fei Dai Department of Electrical and Computer Engineering North Dakota State University Fargo, ND 5805 Email: fdai@ece.ndsu.edu
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 informationCHAPTER 5 MULTICAST GEOGRAPHY BASED ROUTING IN AD HOC NETWORKS
89 CHAPTER 5 MULTICAST GEOGRAPHY BASED ROUTING IN AD HOC NETWORKS 5.1 INTRODUCTION Efficient routing in MANET is a tough task due to their highly dynamic network topology, bandwidth controlled links and
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 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 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 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 informationExtended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication
Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication Jie Wu, Mihaela Cardei, Fei Dai, and Shuhui Yang Department of Computer Science and Engineering Florida Atlantic
More informationCACHING IN WIRELESS SENSOR NETWORKS BASED ON GRIDS
International Journal of Wireless Communications and Networking 3(1), 2011, pp. 7-13 CACHING IN WIRELESS SENSOR NETWORKS BASED ON GRIDS Sudhanshu Pant 1, Naveen Chauhan 2 and Brij Bihari Dubey 3 Department
More informationData-Centric Query in Sensor Networks
Data-Centric Query in Sensor Networks Jie Gao Computer Science Department Stony Brook University 10/27/05 Jie Gao, CSE590-fall05 1 Papers Chalermek Intanagonwiwat, Ramesh Govindan and Deborah Estrin, Directed
More informationIJREAT International Journal of Research in Engineering & Advanced Technology, Volume 1, Issue 2, April-May, 2013 ISSN:
Fast Data Collection with Reduced Interference and Increased Life Time in Wireless Sensor Networks Jayachandran.J 1 and Ramalakshmi.R 2 1 M.Tech Network Engineering, Kalasalingam University, Krishnan koil.
More informationLecture 6: Vehicular Computing and Networking. Cristian Borcea Department of Computer Science NJIT
Lecture 6: Vehicular Computing and Networking Cristian Borcea Department of Computer Science NJIT GPS & navigation system On-Board Diagnostic (OBD) systems DVD player Satellite communication 2 Internet
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 informationFairness Example: high priority for nearby stations Optimality Efficiency overhead
Routing Requirements: Correctness Simplicity Robustness Under localized failures and overloads Stability React too slow or too fast Fairness Example: high priority for nearby stations Optimality Efficiency
More informationRouting. Information Networks p.1/35
Routing Routing is done by the network layer protocol to guide packets through the communication subnet to their destinations The time when routing decisions are made depends on whether we are using virtual
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 informationMobile Advanced Networks. Position-based routing geometric, geographic, location-based. Navid Nikaein Mobile Communication Department
Mobile Advanced Networks Position-based routing geometric, geographic, location-based Navid Nikaein Mobile Communication Department Navid Nikaein 2010 1 Reminder In topology-based routing, each node has
More informationRouting in packet-switching networks
Routing in packet-switching networks Circuit switching vs. Packet switching Most of WANs based on circuit or packet switching Circuit switching designed for voice Resources dedicated to a particular call
More informationEnergy Efficient Data Gathering For Throughput Maximization with Multicast Protocol In Wireless Sensor Networks
Energy Efficient Data Gathering For Throughput Maximization with Multicast Protocol In Wireless Sensor Networks S. Gokilarani 1, P. B. Pankajavalli 2 1 Research Scholar, Kongu Arts and Science College,
More informationECE 333: Introduction to Communication Networks Fall 2001
ECE : Introduction to Communication Networks Fall 00 Lecture : Routing and Addressing I Introduction to Routing/Addressing Lectures 9- described the main components of point-to-point networks, i.e. multiplexed
More informationPart I. Wireless Communication
1 Part I. Wireless Communication 1.5 Topologies of cellular and ad-hoc networks 2 Introduction Cellular telephony has forever changed the way people communicate with one another. Cellular networks enable
More informationEfficient Broadcasting in Ad Hoc Wireless Networks Using Directional Antennas
Efficient Broadcasting in Ad Hoc Wireless Networks Using Directional Antennas Fei Dai and Jie Wu Department of Computer Science and Engineering Florida Atlantic University Boca Raton, FL 3343 Abstract
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 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 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 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 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 informationCHAPTER 5 PROPAGATION DELAY
98 CHAPTER 5 PROPAGATION DELAY Underwater wireless sensor networks deployed of sensor nodes with sensing, forwarding and processing abilities that operate in underwater. In this environment brought challenges,
More informationReceiver Based Multicasting Protocol for Wireless Sensor Networks
Receiver Based Multicasting Protocol for Wireless Sensor Networks Madesha M Assistant Professor, Department of CSE Sahyadri College of Engineering and Management Chaya D Lecturer, Department of CSE H.M.S
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 informationChallenges in Geographic Routing: Sparse Networks, Obstacles, and Traffic Provisioning
Challenges in Geographic Routing: Sparse Networks, Obstacles, and Traffic Provisioning Brad Karp Berkeley, CA bkarp@icsi.berkeley.edu DIMACS Pervasive Networking Workshop 2 May, 2 Motivating Examples Vast
More informationNETWORK coding is an area that has emerged in 2000 [1],
450 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 16, NO. 2, APRIL 2008 Efficient Broadcasting Using Network Coding Christina Fragouli, Jörg Widmer, and Jean-Yves Le Boudec, Fellow, IEEE Abstract We consider
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 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 informationChapter 7 CONCLUSION
97 Chapter 7 CONCLUSION 7.1. Introduction A Mobile Ad-hoc Network (MANET) could be considered as network of mobile nodes which communicate with each other without any fixed infrastructure. The nodes in
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 informationEvaluation of Cartesian-based Routing Metrics for Wireless Sensor Networks
Evaluation of Cartesian-based Routing Metrics for Wireless Sensor Networks Ayad Salhieh Department of Electrical and Computer Engineering Wayne State University Detroit, MI 48202 ai4874@wayne.edu Loren
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 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 informationContents. Overview Multicast = Send to a group of hosts. Overview. Overview. Implementation Issues. Motivation: ISPs charge by bandwidth
EECS Contents Motivation Overview Implementation Issues Ethernet Multicast IGMP Routing Approaches Reliability Application Layer Multicast Summary Motivation: ISPs charge by bandwidth Broadcast Center
More informationStateless Multicasting in Mobile Ad Hoc Networks
Stateless Multicasting in Mobile Ad Hoc Networks Xiaojing Xiang, Member, IEEE, Xin Wang, Member, IEEE, and Yuanyuan Yang, Fellow, IEEE Abstract There are increasing interest and big challenge in designing
More informationFERMA: An Efficient Geocasting Protocol for Wireless Sensor Networks with Multiple Target Regions
FERMA: An Efficient Geocasting Protocol for Wireless Sensor Networks with Multiple Target Regions Young-Mi Song, Sung-Hee Lee, and Young-Bae Ko College of Information and Communication, Ajou University,
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 informationICMP, ARP, RARP, IGMP
Internet Layer Lehrstuhl für Informatik 4 Raw division into three tasks: Data transfer over a global network Route decision at the sub-nodes Control of the network or transmission status Routing Protocols
More informationAlgorithms for Energy-Efficient Multicasting in Static Ad Hoc Wireless Networks
Mobile Networks and Applications 6, 251 263, 2001 2001 Kluwer Academic Publishers. Manufactured in The Netherlands. Algorithms for Energy-Efficient Multicasting in Static Ad Hoc Wireless Networks JEFFREY
More informationEnergy Aware Node Placement Algorithm for Wireless Sensor Network
Advance in Electronic and Electric Engineering. ISSN 2231-1297, Volume 4, Number 6 (2014), pp. 541-548 Research India Publications http://www.ripublication.com/aeee.htm Energy Aware Node Placement Algorithm
More informationBroadcasting with Hard Deadlines in Wireless Multi-hop Networks Using Network Coding
WIRELESS COMMUNICATIONS AND MOBILE COMPUTING Wirel. Commun. Mob. Comput. 0000; 00: 6 Broadcasting with Hard Deadlines in Wireless Multi-hop Networks Using Network Coding Pouya Ostovari, Abdallah Khreishah,
More informationOutline. CS5984 Mobile Computing. Dr. Ayman Abdel-Hamid, CS5984. Wireless Sensor Networks 1/2. Wireless Sensor Networks 2/2
CS5984 Mobile Computing Outline : a Survey Dr. Ayman Abdel-Hamid Computer Science Department Virginia Tech An Introduction to 1 2 1/2 Advances in micro-electro-mechanical systems technology, wireless communications,
More informationSecure Routing in Wireless Sensor Networks: Attacks and Countermeasures
Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures By Chris Karlof and David Wagner Lukas Wirne Anton Widera 23.11.2017 Table of content 1. Background 2. Sensor Networks vs. Ad-hoc
More information13 Sensor networks Gathering in an adversarial environment
13 Sensor networks Wireless sensor systems have a broad range of civil and military applications such as controlling inventory in a warehouse or office complex, monitoring and disseminating traffic conditions,
More informationChapter 7: Naming & Addressing
Chapter 7: Naming & Addressing Goals of this chapter This short chapter looks at non-standard options for denoting the senders/receivers of messages Traditional (fixed, wireless, ad hoc): Denote individual
More informationUsing Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions
Using Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions R.Thamaraiselvan 1, S.Gopikrishnan 2, V.Pavithra Devi 3 PG Student, Computer Science & Engineering, Paavai College
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 informationA Review: Optimization of Energy in Wireless Sensor Networks
A Review: Optimization of Energy in Wireless Sensor Networks Anjali 1, Navpreet Kaur 2 1 Department of Electronics & Communication, M.Tech Scholar, Lovely Professional University, Punjab, India 2Department
More informationPERFORMANCE COMPARISON OF LINK, NODE AND ZONE DISJOINT MULTI-PATH ROUTING STRATEGIES AND MINIMUM HOP SINGLE PATH ROUTING FOR MOBILE AD HOC NETWORKS
PERFORMANCE COMPARISON OF LINK, NODE AND ZONE DISJOINT MULTI-PATH ROUTING STRATEGIES AND MINIMUM HOP SINGLE PATH ROUTING FOR MOBILE AD HOC NETWORKS Natarajan Meghanathan Jackson State University, 1400
More informationUNIT 2 ROUTING ALGORITHMS
UNIT ROUTING ALGORITHMS Routing Algorithms Structure Page Nos..0 Introduction 3. Objectives 3. Flooding 3.3 Shortest Path Routing Algorithm 5.4 Distance Vector Routing 6.4. Comparison.4. The Count-to-Infinity
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 informationData Partitioning. Figure 1-31: Communication Topologies. Regular Partitions
Data In single-program multiple-data (SPMD) parallel programs, global data is partitioned, with a portion of the data assigned to each processing node. Issues relevant to choosing a partitioning strategy
More informationCongestion Aware Routing in Sensor Networks
Congestion Aware Routing in Sensor Networks Raju Kumar, Hosam Rowaihy, Guohong Cao, Farooq Anjum, Aylin Yener and Thomas La Porta Department of Computer Science and Engineering The Pennsylvania State University
More informationCS 268: Computer Networking. Taking Advantage of Broadcast
CS 268: Computer Networking L-12 Wireless Broadcast Taking Advantage of Broadcast Opportunistic forwarding Network coding Assigned reading XORs In The Air: Practical Wireless Network Coding ExOR: Opportunistic
More information