Geographic Routing in Simulation: GPSR

Size: px
Start display at page:

Download "Geographic Routing in Simulation: GPSR"

Transcription

1 Geographic Routing in Simulation: GPSR Brad Karp UCL Computer Science CS M038/GZ06 23 rd January 2013

2 Context: Ad hoc Routing Early 90s: availability of off-the-shelf wireless network cards and laptops 1994: first papers on Destination-Sequenced Distance Vector (DSDV) routing and Dynamic Source Routing (DSR) spark tremendous interest in routing on mobile wireless (ad hoc) networks 1998: Broch et al. s comparison of leading ad hoc routing protocol proposals in ns-2 simulator in MobiCom [2000: GPSR in MobiCom] 2000: Estrin et al. s Directed Diffusion in MobiCom sparks interest in wireless sensor networks 2

3 Context: Ad hoc Routing Early 90s: availability of off-the-shelf wireless network cards and laptops Reasons 1994: first to papers work on Destination-Sequenced a research problem: Distance Intellectual Vector rigor, (DSDV) technical routing difficulty and Dynamic Source Routing (DSR) spark tremendous interest in routing Practicality: on mobile solve wireless a relevant (ad problem hoc) networks 1998: whose Broch solution et al. s will comparison find use of leading ad Extremes hoc routing of one protocol or the proposals other tend in ns-2 to lead simulator success in MobiCom (e.g., Fermat proof; Napster) Solutions [2000: GPSR to problems in MobiCom] that capture both aspects often 2000: are Estrin the et most al. s important Directed results Diffusion in Examine MobiCom motivation sparks interest of in research wireless carefully! sensor networks 3

4 Original Motivation (2000): Mobile Sensornets 4

5 Original Motivation (2000): Rooftop Networks Potentially lower-cost alternative to cellular architecture (no backhaul to every base station) 5

6 Motivation (2010+): Sensornets Many sensors, widely dispersed Sensor: radio, transducer(s), CPU, storage, battery Multiple wireless hops, forwarding sensorto-sensor to a base station What communication primitives will thousand- or million-node sensornets need? 6

7 Scalability in Sensor Networks Resource constraints drive metrics State per node: minimize Energy consumed: minimize Bandwidth consumed: minimize System scale in nodes: maximize Operation success rate: maximize 7

8 Outline Motivation Context Algorithm Greedy forwarding Graph planarization Perimeter forwarding Evaluation in simulation Footnotes Open questions Foibles of simulation 8

9 The Routing Problem Each router has unique ID Packets stamped with destination node ID Router must choose next hop for received packet Routers communicate to accumulate state for use in forwarding decisions Routes change with topology Evaluation metrics: Routing protocol message cost Data delivery success rate Route length (hops) Per-router state D S 9

10 The Routing Problem Each router has unique ID Packets stamped with destination node ID Router must choose next hop for received packet Routers communicate to accumulate state for use in forwarding decisions Routes change with topology Evaluation metrics: Routing protocol message cost Data delivery success rate Route length (hops) Per-router state D? S 10

11 The Routing Problem Each router has unique ID Packets stamped with destination node ID Router must choose next hop for received packet Routers communicate to accumulate state for use in forwarding decisions Routes change with topology Evaluation metrics: Routing protocol message cost Data delivery success rate Route length (hops) Per-router state D S 11

12 The Routing Problem Each router has unique ID Packets stamped with destination node ID Router must choose next hop for received packet Routers communicate to accumulate state for use in forwarding decisions Routes change with topology Evaluation metrics: Routing protocol message cost Data delivery success rate Route length (hops) Per-router state D? S 12

13 The Routing Problem Each router has unique ID Packets stamped with destination node ID Router must choose next hop for received packet Routers communicate to accumulate state for use in forwarding decisions Routes change with topology Evaluation metrics: Routing protocol message cost Data delivery success rate Route length (hops) Per-router state D S 13

14 Why Are Topologies Dynamic? Node failure Battery depletion Hardware malfunction Physical damage (harsh environment) Link failure Changing RF interference sources Mobile obstacles change multi-path fading Node mobility In-range neighbor set constantly changing Extreme case for routing scalability Not commonly envisioned for sensor networks 14

15 Routing: Past Approaches, Scaling Wired, Intra-domain Internet routing: Link-state and Distance-vector: shortest paths in hops LS: push full topology map to all routers, O(L) state DV: push distances across network diameter, O(N) state Each link change must be communicated to all routers, or loops/disconnection result [Zaumen, Garcia-Luna, 91] Dynamic Source Routing (DSR), ad hoc routing: Flood queries on-demand to learn source routes Cache replies 15

16 Scaling Routing (cont d) Dominant factors in cost of DV, LS, DSR: rate of change of topology (bandwidth) number of routers in routing domain (b/w, state) Scaling strategies: Hierarchy: at AS boundaries (BGP) or on finer scale (OSPF) Goal: reduce number of routers in routing domain Assumption: address aggregation Caching: store source routes overheard (DSR) Goal: limit propagation of future queries Assumption: source route remains fixed while cached 16

17 Scaling Routing (cont d) Dominant factors in cost of DV, LS, DSR: rate of change of topology (bandwidth) number of routers in routing domain (b/w, state) Today: Scaling Internet strategies: routing scales because of IP prefix aggregation; not easily applicable in sensornets Hierarchy: at AS boundaries (BGP) or on finer scale (OSPF) Goal: reduce number of routers in routing domain Assumption: address aggregation Can we achieve per-node state independent of N? Can we reduce bandwidth spent communicating topology changes? Caching: store source routes overheard (DSR) Goal: limit propagation of future queries Assumption: source route remains fixed while cached 17

18 Greedy Perimeter Stateless Routing (GPSR) Central idea: Machines can know their geographic locations. Route using geography. Packet destination field: location of destination Nodes all know own positions, e.g., by GPS (outdoors) by surveyed position (for non-mobile nodes) by short-range localization (indoors, [AT&T Camb, 1997], [Priyantha et al., 2000]) &c. Assume an efficient node location registration/ lookup system (e.g., GLS [Li et al., 2000]) to support host-centric addressing 18

19 Assumptions Bi-directional radio links (unidirectional links may be blacklisted) Network nodes placed roughly in a plane Radio propagation in free space; distance from transmitter determines signal strength at receiver Fixed, uniform radio transmitter power 19

20 Greedy Forwarding Nodes learn immediate neighbors positions from beaconing/piggybacking on data packets Locally optimal, greedy next hop choice: Neighbor geographically nearest destination x y D 20

21 Greedy Forwarding Nodes learn immediate neighbors positions from beaconing/piggybacking on data packets Neighbor Locally optimal, must be greedy strictly next closer hop choice: to avoid loops Neighbor geographically nearest destination x y D 21

22 In Praise of Geography Self-describing As node density increases, shortest path tends toward Euclidean straight line between source and destination Node s state concerns only one-hop neighbors: Low per-node state: O(density) Low routing protocol overhead: state pushed only one hop 22

23 Greedy Forwarding Failure Greedy forwarding not always possible! Consider: D v z w y x 23

24 Greedy Forwarding Failure Greedy forwarding not always possible! Consider: D v z void w y x 24

25 Greedy Forwarding Failure Greedy forwarding not always possible! Consider: D v z How can we circumnavigate voids? based only on one-hop neighborhood? void w y x 25

26 Node Density and Voids 26

27 Node Density and Voids Voids more prevalent in sparser topologies 27

28 Void Traversal: The Right-hand Rule Well-known graph traversal: right-hand rule Requires only neighbors positions y z x 28

29 Void Traversal: The Right-hand Rule Well-known graph traversal: right-hand rule Requires only neighbors positions y z x 29

30 Void Traversal: The Right-hand Rule Well-known graph traversal: right-hand rule Requires only neighbors positions y z x 30

31 Void Traversal: The Right-hand Rule Well-known graph traversal: right-hand rule Requires only neighbors positions y z x 31

32 Void Traversal: The Right-hand Rule Well-known graph traversal: right-hand rule Requires only neighbors positions y z x 32

33 Void Traversal: The Right-hand Rule Well-known graph traversal: right-hand rule Requires only neighbors positions y z x 33

34 Planar vs. Non-planar Graphs On graphs with edges that cross (non-planar graphs), right-hand rule may not tour enclosed face boundary 34

35 Planar vs. Non-planar Graphs On graphs with edges that cross (non-planar graphs), right-hand rule may not tour enclosed face boundary 35

36 Planar vs. Non-planar Graphs On graphs with edges that cross (non-planar graphs), right-hand rule may not tour enclosed face boundary 36

37 Planar vs. Non-planar Graphs On graphs with edges that cross (non-planar graphs), right-hand rule may not tour enclosed face boundary 37

38 Planar vs. Non-planar Graphs On graphs with edges that cross (non-planar graphs), right-hand rule may not tour enclosed face boundary 38

39 Planar vs. Non-planar Graphs On graphs with edges that cross (non-planar graphs), right-hand rule may not tour enclosed face boundary 39

40 Planar vs. Non-planar Graphs On graphs with edges that cross (non-planar graphs), right-hand rule may not tour enclosed face boundary 40

41 Planar vs. Non-planar Graphs On graphs with edges that cross (non-planar graphs), right-hand rule may not tour enclosed face boundary 41

42 Planar vs. Non-planar Graphs On graphs with edges that cross (non-planar graphs), right-hand rule may not tour enclosed face boundary 42

43 Planar vs. Non-planar Graphs On graphs with edges that cross (non-planar graphs), right-hand rule may not tour enclosed face boundary 43

44 Planar vs. Non-planar Graphs On graphs with edges that cross (non-planar graphs), right-hand rule may not tour enclosed face boundary 44

45 Planar vs. Non-planar Graphs On graphs with edges that cross (non-planar graphs), right-hand rule may not tour enclosed face boundary How to remove crossing edges without partitioning graph? And using only single-hop neighbors positions? 45

46 Planarized Graphs Relative Neighborhood Graph (RNG) [Toussaint, 80] and Gabriel Graph (GG) [Gabriel, 69]: long-known planar graphs Assume edge exists between any pair of nodes separated by less than threshold distance (i.e., nominal radio range) RNG and GG can be constructed from only neighbors positions, and can be shown not to partition network! u? v u? v RNG GG 46

47 Planarized Graphs Relative Neighborhood Graph (RNG) [Toussaint, 80] and Gabriel Graph (GG) [Gabriel, 69]: long-known planar graphs Assume edge exists between any pair of nodes separated by less than threshold distance (i.e., nominal radio range) RNG and GG can be constructed from only neighbors positions, and can be shown not to partition network! u w? v u? v RNG GG 47

48 Planarized Graphs Relative Neighborhood Graph (RNG) [Toussaint, 80] and Gabriel Graph (GG) [Gabriel, 69]: long-known planar graphs Assume edge exists between any pair of nodes separated by less than threshold distance (i.e., nominal radio range) RNG and GG can be constructed from only neighbors positions, and can be shown not to partition network! u w v u? v RNG GG 48

49 Planarized Graphs Relative Neighborhood Graph (RNG) [Toussaint, 80] and Gabriel Graph (GG) [Gabriel, 69]: long-known planar graphs Assume edge exists between any pair of nodes separated by less than threshold distance (i.e., nominal radio range) RNG and GG can be constructed from only neighbors positions, and can be shown not to partition network! u w v u w? v RNG GG 49

50 Planarized Graphs Relative Neighborhood Graph (RNG) [Toussaint, 80] and Gabriel Graph (GG) [Gabriel, 69]: long-known planar graphs Assume edge exists between any pair of nodes separated by less than threshold distance (i.e., nominal radio range) RNG and GG can be constructed from only neighbors positions, and can be shown not to partition network! u w v u w v RNG GG 50

51 Planarized Graphs Relative Neighborhood Graph (RNG) [Toussaint, 80] and Gabriel Graph (GG) [Gabriel, 69]: long-known planar graphs Assume edge exists between any pair of nodes separated by less than threshold distance (i.e., nominal radio range) RNG and GG can be constructed from only neighbors positions, and can be shown not to partition network! Euclidean MST (so connected) RNG GG u w w v u v Delaunay Triangulation (so planar) RNG GG 51

52 Planarized Graphs: Example 200 nodes, placed uniformly at random on 2000-by-2000-meter region; 250-meter radio range Full Graph GG Subgraph RNG Subgraph 52

53 Full Greedy Perimeter Stateless Routing All packets begin in greedy mode Greedy mode uses full graph Upon greedy failure, node marks its location in packet, marks packet in perimeter mode Perimeter mode packets follow simple planar graph traversal: Forward along successively closer faces by right-hand rule, until reaching destination Packets return to greedy mode upon reaching node closer to destination than perimeter mode entry point 53

54 Perimeter Mode Forwarding Example D x Traverse face closer to D along xd by right-hand rule, until crossing xd Repeat with next-closer face, &c. 54

55 Perimeter Mode Forwarding Example D x Traverse face closer to D along xd by right-hand rule, until crossing xd Repeat with next-closer face, &c. 55

56 Perimeter Mode Forwarding Example D x Traverse face closer to D along xd by right-hand rule, until crossing xd Repeat with next-closer face, &c. 56

57 Perimeter Mode Forwarding Example D x Traverse face closer to D along xd by right-hand rule, until crossing xd Repeat with next-closer face, &c. 57

58 Perimeter Mode Forwarding Example D x Traverse face closer to D along xd by right-hand rule, until crossing xd Repeat with next-closer face, &c. 58

59 Perimeter Mode Forwarding Example D x Traverse face closer to D along xd by right-hand rule, until crossing xd Repeat with next-closer face, &c. 59

60 Perimeter Mode Forwarding Example D x Traverse face closer to D along xd by right-hand rule, until crossing xd Repeat with next-closer face, &c. 60

61 Perimeter Mode Forwarding Example D x Traverse face closer to D along xd by right-hand rule, until crossing xd Repeat with next-closer face, &c. 61

62 Perimeter Mode Forwarding Example D x Traverse face closer to D along xd by right-hand rule, until crossing xd Repeat with next-closer face, &c. 62

63 Perimeter Mode Forwarding Example D x Traverse face closer to D along xd by right-hand rule, until crossing xd Repeat with next-closer face, &c. 63

64 Perimeter Mode Forwarding Example D x Traverse face closer to D along xd by right-hand rule, until crossing xd Repeat with next-closer face, &c. 64

65 Perimeter Mode Forwarding Example D x Traverse face closer to D along xd by right-hand rule, until crossing xd Repeat with next-closer face, &c. 65

66 Protocol Tricks for Dynamic Networks Use of MAC-layer failure feedback: As in DSR [Broch, Johnson, 98], interpret retransmit failure reports from MAC as indication neighbor gone out-of-range Interface queue traversal and packet purging: Upon MAC retransmit failure for a neighbor, remove packets to that neighbor from IFQ to avoid head-of-line blocking of transmitter during retries Promiscuous network interface: Reduce beacon load and keep positions stored in neighbor tables current by tagging all packets with forwarding node s position Planarization triggers: Re-planarize upon acquisition of new neighbor and every loss of former neighbor, to keep planarization up-to-date as topology changes 66

67 Outline Motivation Context Algorithm Greedy forwarding Graph planarization Perimeter forwarding Evaluation in simulation Footnotes Open questions Foibles of simulation 67

68 Evaluation: Simulations ns-2 with wireless extensions [Broch et al., 98]; full MAC, free space physical propagation Topologies: Nodes Region Density m x 300 m 1 node / 9000 m m x 600 m 1 node / 9000 m m x 1340 m 1 node / m Kbps CBR flows; 64-byte data packets Random Waypoint Mobility in [1, 20 m/s]; Pause Time [0, 30, 60, 120s]; 1.5s GPSR beacons 68

69 Packet Delivery Success Rate (50, 200; Dense) 69

70 Routing Protocol Overhead (50, 200; Dense) 70

71 Path Length (50; Dense) 71

72 Path Length (200; Dense) 72

73 Path Length (200; Dense) Why does DSR find shorter paths more of the time when mobility rate increases? 73

74 State Size (200; Dense) 74

75 State Size (200; Dense) How would you expect GPSR s state size to change the number of nodes in the network increases? Why does DSR hold state for more nodes than there are in the network? 75

76 Critical Thinking Based on the results thus far (indeed, all results in the paper), what do we know about the performance of GPSR s perimeter mode? Would you expect it to be more or less reliable than greedy mode? Would you expect use of perimeter mode to affect path length? 76

77 Critical Thinking Based on the results thus far (indeed, all results in the paper), what do we know performance about the performance of perimeter mode! of GPSR s perimeter mode? Evaluation in paper reveals nearly nothing about Why doesn t it? Would you expect it to be more or less reliable than greedy mode? Would you expect use of perimeter mode to affect path length? 77

78 Packet Delivery Success Rate (50; Sparse) 78

79 Routing Protocol Overhead (50; Sparse) 79

80 Path Length (50; Sparse) 80

81 Outline Motivation Context Algorithm Greedy forwarding Graph planarization Perimeter forwarding Evaluation in simulation Footnotes Open questions Foibles of simulation 81

82 Open Questions How to route geographically in 3D? Greedy mode? Perimeter mode? More in CLDP paper (next) Effect of radio-opaque obstacles? More in CLDP paper (next) Effect of position errors? More in CLDP paper (next) J Better planar graphs than GG, RNG? See [Guibas et al., 2001] Name-to-location database, built atop geo routing? See [GLS, Li et al., MobiCom 2000] 82

83 Foibles of Simulation Greedy mode works more often as nodes move more rapidly?! Why? (Hint: when does greedy forwarding work best?) 83

84 Recap: Scalability via Geography with GPSR Key scalability properties: Small state per router: O(D), not O(N) or O(L) as for shortest-path routing, where D = density (neighbors), N = total nodes, L = total links Low routing protocol overhead: each node merely single-hop broadcasts own position periodically Approximates shortest paths on dense networks Delivers more packets successfully on dynamic topologies than shortest-paths routing protocols 84

Challenges in Geographic Routing: Sparse Networks, Obstacles, and Traffic Provisioning

Challenges 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 information

Geographic and Diversity Routing in Mesh Networks

Geographic 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 information

Routing in Sensor Networks

Routing in Sensor Networks Routing in Sensor Networks Routing in Sensor Networks Large scale sensor networks will be deployed, and require richer inter-node communication In-network storage (DCS, GHT, DIM, DIFS) In-network processing

More information

Geographic Routing Without Location Information. AP, Sylvia, Ion, Scott and Christos

Geographic Routing Without Location Information. AP, Sylvia, Ion, Scott and Christos Geographic Routing Without Location Information AP, Sylvia, Ion, Scott and Christos Routing in Wireless Networks Distance vector DSDV On-demand DSR, TORA, AODV Discovers and caches routes on demand Geographic

More information

GPSR: Greedy Perimeter Stateless Routing for Wireless Networks

GPSR: Greedy Perimeter Stateless Routing for Wireless Networks GPSR: Greedy Perimeter Stateless Routing for Wireless Networks Brad Karp Harvard University / ACIRI karp@eecs.harvard.edu H. T. Kung Harvard University htk@eecs.harvard.edu ABSTRACT We present Greedy Perimeter

More information

Simulations of the quadrilateral-based localization

Simulations 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 information

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. Broch et al Presented by Brian Card

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. Broch et al Presented by Brian Card A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols Broch et al Presented by Brian Card 1 Outline Introduction NS enhancements Protocols: DSDV TORA DRS AODV Evaluation Conclusions

More information

Geographical routing 1

Geographical 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 information

End-to-end path: route

End-to-end path: route Multi-hop Wireless Netorks CMU CS 15-829: Internet-Scale Sensor Sstems Overvie: Large-Scale Wireless Sstems Small-Scale: Ho to build single-hop ireless LAN; ho to make TCP perform ell over it Large-Scale:

More information

CS551 Ad-hoc Routing

CS551 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 information

R2D2: Rendezvous Regions for Data Discovery Karim Seada 1, Ahmed Helmy 2

R2D2: Rendezvous Regions for Data Discovery Karim Seada 1, Ahmed Helmy 2 R2D2: Rendezvous Regions for Data Discovery Karim Seada 1, Ahmed Helmy 2 1 Nokia Research Center, Palo Alto 2 Computer and Information Science and Engineering Department, University of Florida, Gainesville

More information

Networking Sensors, I

Networking 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 information

(General article) Position Based Routing Technique: Greedy Perimeter Stateless Routing for Wireless Networks

(General article) Position Based Routing Technique: Greedy Perimeter Stateless Routing for Wireless Networks ijesm www.ijesm.com International Journal of Engineering, Science and Metallurgy (General article) Position Based Routing Technique: Greedy Perimeter Stateless Routing for Wireless Networks Niyati Bansal

More information

Geometric Spanners for Routing in Mobile Networks

Geometric Spanners for Routing in Mobile Networks 1 Geometric Spanners for Routing in Mobile Networks Jie Gao, Leonidas J Guibas, John Hershberger, Li Zhang, An Zhu Abstract We propose a new routing graph, the Restricted Delaunay Graph (RDG), for mobile

More information

AN AD HOC network consists of a collection of mobile

AN AD HOC network consists of a collection of mobile 174 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 23, NO. 1, JANUARY 2005 Geometric Spanners for Routing in Mobile Networks Jie Gao, Member, IEEE, Leonidas J. Guibas, John Hershberger, Li Zhang,

More information

Wireless Mesh Networks

Wireless Mesh Networks Wireless Mesh Networks COS 463: Wireless Networks Lecture 6 Kyle Jamieson [Parts adapted from I. F. Akyildiz, B. Karp] Wireless Mesh Networks Describes wireless networks in which each node can communicate

More information

15-441: Computer Networking. Lecture 24: Ad-Hoc Wireless Networks

15-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 information

Arvind Krishnamurthy Fall 2003

Arvind 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 information

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

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols By Josh Broch, David A. Maltz, David B. Johnson, Yih- Chun Hu, Jorjeta Jetcheva Presentation by: Michael Molignano Jacob

More information

Table of Contents. 1. Introduction. 2. Geographic Routing. 2.1 Routing Mechanisms. 2.2 Destination Location. 2.3 Location Inaccuracy. 3.

Table 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 information

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

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

More information

Dynamic Source Routing in ad hoc wireless networks

Dynamic Source Routing in ad hoc wireless networks Dynamic Source Routing in ad hoc wireless networks David B. Johnson David A. Maltz Computer Science Department Carnegie Mellon University In Mobile Computing, vol. 353, chapter 5, T. Imielinski and H.

More information

Data-Centric Query in Sensor Networks

Data-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 information

SMITE: A Stochastic Compressive Data Collection. Sensor Networks

SMITE: A Stochastic Compressive Data Collection. Sensor Networks SMITE: A Stochastic Compressive Data Collection Protocol for Mobile Wireless Sensor Networks Longjiang Guo, Raheem Beyah, and Yingshu Li Department of Computer Science, Georgia State University, USA Data

More information

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

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

More information

An efficient implementation of the greedy forwarding strategy

An efficient implementation of the greedy forwarding strategy An efficient implementation of the greedy forwarding strategy Hannes Stratil Embedded Computing Systems Group E182/2 Technische Universität Wien Treitlstraße 3 A-1040 Vienna Email: hannes@ecs.tuwien.ac.at

More information

Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table

Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table Mobile Networks and Applications 8, 427 442, 2003 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table SYLVIA RATNASAMY

More information

DYNAMIC DATA ROUTING IN MANET USING POSITION BASED OPPORTUNISTIC ROUTING PROTOCOL

DYNAMIC DATA ROUTING IN MANET USING POSITION BASED OPPORTUNISTIC ROUTING PROTOCOL INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 DYNAMIC DATA ROUTING IN MANET USING POSITION BASED OPPORTUNISTIC ROUTING PROTOCOL P. Kalaivani 1, G. Sathya 2, N.

More information

Inter-Domain Routing: BGP

Inter-Domain Routing: BGP Inter-Domain Routing: BGP Brad Karp UCL Computer Science (drawn mostly from lecture notes by Hari Balakrishnan and Nick Feamster, MIT) CS 3035/GZ01 4 th December 2014 Outline Context: Inter-Domain Routing

More information

Optimized Greedy Perimeter Stateless Routing

Optimized Greedy Perimeter Stateless Routing Optimized Greedy Perimeter Stateless Routing Neha Department of Electronics and Communication Engineering Punjab Technical University, Kapurthhala, Punjab, India Jogishwar Singh Sohal Department of Electronics

More information

Location Awareness in Ad Hoc Wireless Mobile Neworks

Location 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 information

Mobility and Density Aware AODV Protocol Extension for Mobile Adhoc Networks-MADA-AODV

Mobility 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 information

A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks

A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks Stephen S. Yau, Wei Gao, and Dazhi Huang Dept. of Computer Science and Engineering Arizona State University Tempe,

More information

BGR: Blind Geographic Routing for Sensor Networks

BGR: Blind Geographic Routing for Sensor Networks BGR: Blind Geographic Routing for Sensor Networks Matthias Witt 1 and Volker Turau 1 1 Department of Telematics, Hamburg University of Technology, Hamburg, Germany {matthias.witt,turau}@tuhh.de Abstract

More information

CHAPTER 5 MULTICAST GEOGRAPHY BASED ROUTING IN AD HOC NETWORKS

CHAPTER 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 information

Mobile 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 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 information

Energy-Efficient Forwarding Strategies for Geographic Routing in Lossy Wireless Sensor Networks

Energy-Efficient Forwarding Strategies for Geographic Routing in Lossy Wireless Sensor Networks Energy-Efficient Forwarding Strategies for Geographic Routing in Lossy Wireless Sensor Networks K. Seada, M.Zuniga, A. Helmy and B. Krishnamachari Department of Electrical Engineering University of Southern

More information

Approximately Uniform Random Sampling in Sensor Networks

Approximately Uniform Random Sampling in Sensor Networks Approximately Uniform Random Sampling in Sensor Networks Boulat A. Bash, John W. Byers and Jeffrey Considine Motivation Data aggregation Approximations to COUNT, SUM, AVG, MEDIAN Existing work does not

More information

Ad hoc and Sensor Networks Topology control

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 information

LECTURE 9. Ad hoc Networks and Routing

LECTURE 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 information

Information Brokerage

Information Brokerage Information Brokerage Sensing Networking Leonidas Guibas Stanford University Computation CS321 Information Brokerage Services in Dynamic Environments Information Brokerage Information providers (sources,

More information

EFFICIENT DATA TRANSMISSION AND SECURE COMMUNICATION IN VANETS USING NODE-PRIORITY AND CERTIFICATE REVOCATION MECHANISM

EFFICIENT DATA TRANSMISSION AND SECURE COMMUNICATION IN VANETS USING NODE-PRIORITY AND CERTIFICATE REVOCATION MECHANISM EFFICIENT DATA TRANSMISSION AND SECURE COMMUNICATION IN VANETS USING NODE-PRIORITY AND CERTIFICATE REVOCATION MECHANISM D.Yamini 1, J. Jayavel 2 1 III-M.tech(IT), Department of Information technology,

More information

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

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

More information

Networking Sensors, II

Networking 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 information

CHAPTER 2 WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL

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

More information

Geographic rendezvous-based architectures for emergency data dissemination

Geographic rendezvous-based architectures for emergency data dissemination WIRELESS COMMUNICATIONS AND MOBILE COMPUTING Wirel. Commun. Mob. Comput. (28) Published online in Wiley InterScience (www.interscience.wiley.com).68 Geographic rendezvous-based architectures for emergency

More information

An Energy-aware Greedy Perimeter Stateless Routing Protocol for Mobile Ad hoc Networks

An Energy-aware Greedy Perimeter Stateless Routing Protocol for Mobile Ad hoc Networks An Energy-aware Greedy Perimeter Stateless Routing Protocol for Mobile Ad hoc Networks Natarajan Meghanathan Jackson State University P. O. Box 18839, 1400 J. Lynch Street Jackson, MS 39217, USA ABSTRACT

More information

GHT: A Geographic Hash Table for Data-Centric Storage

GHT: A Geographic Hash Table for Data-Centric Storage GHT: A Geographic Hash Table for Data-Centric Storage Sylvia Ratnasamy and Brad Karp ICIR/ICSI, Berkeley, CA 94704 {sylviar,bkarp}@icsi.berkeley.edu Deborah Estrin UCLA Comp. Sci., LA, CA 90095 destrin@cs.ucla.edu

More information

Performance of Various Routing Protocols in Mobile Ad Hoc Networks-A Survey

Performance of Various Routing Protocols in Mobile Ad Hoc Networks-A Survey Research Journal of Applied Sciences, Engineering and Technology 6(22): 4181-4185, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scientific Organization, 2013 Submitted: January 26, 2013 Accepted: March

More information

ROUTING ALGORITHMS Part 2: Data centric and hierarchical protocols

ROUTING 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 information

Data Communication. Guaranteed Delivery Based on Memorization

Data 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 information

Efficient and Robust Geocasting Protocols for Sensor Networks

Efficient 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 information

DYNAMIC SEARCH TECHNIQUE USED FOR IMPROVING PASSIVE SOURCE ROUTING PROTOCOL IN MANET

DYNAMIC 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 information

AODV-PA: AODV with Path Accumulation

AODV-PA: AODV with Path Accumulation -PA: with Path Accumulation Sumit Gwalani Elizabeth M. Belding-Royer Department of Computer Science University of California, Santa Barbara fsumitg, ebeldingg@cs.ucsb.edu Charles E. Perkins Communications

More information

Efficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks

Efficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks Efficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks Joo-Han Song, Vincent Wong and Victor Leung Department of Electrical and Computer Engineering The University of British Columbia 56

More information

A Survey on Geographic Routing Protocols for Mobile Ad hoc Networks

A Survey on Geographic Routing Protocols for Mobile Ad hoc Networks A Survey on Geographic Routing Protocols for Mobile Ad hoc Networks Atekeh Maghsoudlou, Marc St-Hilaire, and Thomas Kunz Department of Systems and Computer Engineering Carleton University, Ottawa, ON,

More information

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

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

More information

Performance Comparison of Scalable Location Services for Geographic Ad Hoc Routing

Performance Comparison of Scalable Location Services for Geographic Ad Hoc Routing Performance Comparison of Scalable Location Services for Geographic Ad Hoc Routing Saumitra M. Das, Himabindu Pucha and Y. Charlie Hu School of Electrical and Computer Engineering Purdue University West

More information

Chapter 7 TOPOLOGY CONTROL

Chapter 7 TOPOLOGY CONTROL Chapter 7 TOPOLOGY CONTROL Distributed Computing Group Mobile Computing Winter 2005 / 2006 Overview Topology Control Gabriel Graph et al. XTC Interference SINR & Scheduling Complexity Distributed Computing

More information

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

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols Josh Broch David A. Maltz David B. Johnson Yih-Chun Hu Jorjeta Jetcheva Computer Science Department Carnegie Mellon University

More information

Data gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks

Data 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 information

Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures

Secure 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 information

Lecture 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 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 information

Geographic Adaptive Fidelity and Geographic Energy Aware Routing in Ad Hoc Routing

Geographic 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 information

Ad hoc and Sensor Networks Chapter 10: Topology control

Ad 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 information

GLIDER: Gradient Landmark-Based Distributed Routing for Sensor Networks. Stanford University. HP Labs

GLIDER: Gradient Landmark-Based Distributed Routing for Sensor Networks. Stanford University. HP Labs GLIDER: Gradient Landmark-Based Distributed Routing for Sensor Networks Qing Fang Jie Gao Leonidas J. Guibas Vin de Silva Li Zhang Stanford University HP Labs Point-to-Point Routing in Sensornets Routing

More information

Qos Parameters Estimation in MANET Using Position Based Opportunistic Routing Protocol

Qos Parameters Estimation in MANET Using Position Based Opportunistic Routing Protocol Original Article Qos Parameters Estimation in MANET Using Position Based Opportunistic Routing Protocol P. Kalaivani* 1, G. Sathya 1 and N. Senthilnathan 2 1 Assistant Professor, SNS College of Engineering,

More information

Motivation and Basics Flat networks Hierarchy by dominating sets Hierarchy by clustering Adaptive node activity. Topology Control

Motivation 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 information

Wireless and Mobile Networks Reading: Sections 2.8 and 4.2.5

Wireless and Mobile Networks Reading: Sections 2.8 and 4.2.5 Wireless and Mobile Networks Reading: Sections 2.8 and 4.2.5 Acknowledgments: Lecture slides are from Computer networks course thought by Jennifer Rexford at Princeton University. When slides are obtained

More information

Ad Hoc Routing Protocols and Issues

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

More information

Outline. Wireless Ad Hoc & Sensor Networks (Wireless Sensor Networks III) Localisation and Positioning. Localisation and Positioning properties

Outline. 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 information

Modeling and analyzing the correctness of geographic face routing under realistic conditions

Modeling and analyzing the correctness of geographic face routing under realistic conditions Ad Hoc Networks 5 (2007) 855 87 www.elsevier.com/locate/adhoc Modeling and analyzing the correctness of geographic face routing under realistic conditions Karim eada a, *, Ahmed Helmy b, Ramesh Govindan

More information

Dynamic Source Routing in Ad Hoc Wireless Networks

Dynamic Source Routing in Ad Hoc Wireless Networks Dynamic Source Routing in Ad Hoc Wireless Networks David B. Johnson David A. Maltz Computer Science Department Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213-3891 dbj@cs.cmu.edu Abstract

More information

Performance Comparison of MANETs Routing Protocols for Dense and Sparse Topology

Performance Comparison of MANETs Routing Protocols for Dense and Sparse Topology 2012 International Conference on Information and Computer Networks (ICICN 2012) IPCSIT vol. 27 (2012) (2012) IACSIT Press, Singapore Performance Comparison of MANETs Routing Protocols for Dense and Sparse

More information

More wireless: Sensor networks and TCP on mobile hosts

More wireless: Sensor networks and TCP on mobile hosts More wireless: Sensor networks and TCP on mobile hosts CSU CS557, Spring 2018 Instructor: Lorenzo De Carli (Slides by Christos Papadopoulos, remixed by Lorenzo De Carli) Outline Routing in sensor networks

More information

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

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

More information

On Delivery Guarantees of Face and Combined Greedy-Face Routing in Ad Hoc and Sensor Networks

On Delivery Guarantees of Face and Combined Greedy-Face Routing in Ad Hoc and Sensor Networks On Delivery Guarantees of Face and Combined Greedy-Face Routing in Ad Hoc and Sensor Networks ABSTRACT Hannes Frey IMADA, University of Southern Denmark DK-5230 Odense M, Denmark frey@imada.sdu.dk It was

More information

Announcements. CMPE 257: Wireless and Mobile Networking. Today. Location Management. Project status update 2. Graded exams. Hw 4 (?) Project report.

Announcements. CMPE 257: Wireless and Mobile Networking. Today. Location Management. Project status update 2. Graded exams. Hw 4 (?) Project report. CMPE 257: Wireless and Mobile Networking Spring 2003 Lecture 17 Announcements Project status update 2. Graded exams. Hw 4 (?) Project report. CMPE 257 Spring 2003 1 CMPE 257 Spring 2003 2 Today Location

More information

We noticed that the trouble is due to face routing. Can we ignore the real coordinates and use virtual coordinates for routing?

We noticed that the trouble is due to face routing. Can we ignore the real coordinates and use virtual coordinates for routing? Geographical routing in practice We noticed that the trouble is due to face routing. Is greedy routing robust to localization noise? Can we ignore the real coordinates and use virtual coordinates for routing?

More information

Location-aware In-Network Monitoring in Wireless Sensor Networks

Location-aware In-Network Monitoring in Wireless Sensor Networks Location-aware In-Network Monitoring in Wireless Sensor Networks Volker Turau and Christoph Weyer Department of Telematics, Technische Universität Hamburg-Harburg Schwarzenbergstraße 95, 21073 Hamburg,

More information

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

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

More information

DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks

DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks David B. Johnson David A. Maltz Josh Broch Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213-3891

More information

Broadcasting Techniques for Mobile Ad Hoc Networks

Broadcasting Techniques for Mobile Ad Hoc Networks Broadcasting Techniques for Mobile Ad Hoc Networks Broadcasting: It is the process in which one node sends a packet to all other nodes in the network. 1 Usefulness of broadcasting Broadcasting of net-wide

More information

Energy-Efficient Communication Protocol for Wireless Micro-sensor Networks

Energy-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 information

PROJECT REPORT VIRTUAL COORDINATE GENERATOR AND ROUTING SIMULATION TOOL FOR WIRELESS SENSOR NETWORKS IN 2 AND 3-DIMENSIONAL NETWORK SPACE

PROJECT REPORT VIRTUAL COORDINATE GENERATOR AND ROUTING SIMULATION TOOL FOR WIRELESS SENSOR NETWORKS IN 2 AND 3-DIMENSIONAL NETWORK SPACE PROJECT REPORT VIRTUAL COORDINATE GENERATOR AND ROUTING SIMULATION TOOL FOR WIRELESS SENSOR NETWORKS IN 2 AND 3-DIMENSIONAL NETWORK SPACE Submitted by Aravindhan Vijayaraj Department of Electrical and

More information

M-Geocast: Robust and Energy-Efficient Geometric Routing for Mobile Sensor Networks

M-Geocast: Robust and Energy-Efficient Geometric Routing for Mobile Sensor Networks M-Geocast: Robust and Energy-Efficient Geometric Routing for Mobile Sensor Networks Lynn Choi 1, Jae Kyun Jung 1, Byong-Ha Cho 1, and Hyohyun Choi 2 1 Korea University, Anam-Dong, Sungbuk-Ku, Seoul, Korea

More information

Routing on Overlay Graphs in Mobile Ad Hoc Networks

Routing on Overlay Graphs in Mobile Ad Hoc Networks Routing on Overlay Graphs in Mobile Ad Hoc Networks Sumesh J. Philip Department of Computer Science Western Illinois University Macomb IL 61455 Email: sj-philip@wiu.edu Joy Ghosh, Hung Q. Ngo, Chunming

More information

Mitigating Routing Misbehavior in Mobile Ad Hoc Networks

Mitigating Routing Misbehavior in Mobile Ad Hoc Networks Mitigating Routing Misbehavior in Mobile Ad Hoc Networks S. Marti, T. Giuli, K. Lai, and M. Baker, Mitigating routing misbehavior in mobile ad hoc networks, in The 6th ACM International Conference on Mobile

More information

3. Evaluation of Selected Tree and Mesh based Routing Protocols

3. 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 information

Geo-Routing. Chapter 2. Ad Hoc and Sensor Networks Roger Wattenhofer

Geo-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 information

CS 229 Final Report: Location Based Adaptive Routing Protocol(LBAR) using Reinforcement Learning

CS 229 Final Report: Location Based Adaptive Routing Protocol(LBAR) using Reinforcement Learning CS 229 Final Report: Location Based Adaptive Routing Protocol(LBAR) using Reinforcement Learning By: Eunjoon Cho and Kevin Wong Abstract In this paper we present an algorithm for a location based adaptive

More information

Performance Evaluation of Routing Protocols for MAC Layer Models

Performance Evaluation of Routing Protocols for MAC Layer Models IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 10, Issue 4 (Mar. - Apr. 2013), PP 71-77 Performance Evaluation of Routing Protocols for MAC Layer Models Somya

More information

Efficient Peer-to-Peer Information Sharing over Mobile Ad Hoc Networks

Efficient Peer-to-Peer Information Sharing over Mobile Ad Hoc Networks Efficient Peer-to-Peer Information Sharing over Mobile Ad Hoc Networks Mei Li Wang-Chien Lee Anand Sivasubramaniam Department of Computer Science and Engineering Pennsylvania State University University

More information

Information Brokerage

Information Brokerage Information Brokerage Sensing Networking Leonidas Guibas Stanford University Computation CS428 Next Class Thursday, April 28, 3:15 5:05 pm, in Gates 104 Project Schedule E-mail with team members (groups

More information

The CMU Monarch Project s Wireless and Mobility Extensions to ns

The CMU Monarch Project s Wireless and Mobility Extensions to ns The CMU Monarch Project s Wireless and Mobility Extensions to ns David B. Johnson Josh Broch Yih-Chun Hu Jorjeta Jetcheva David A. Maltz The Monarch Project Carnegie Mellon University http://www.monarch.cs.cmu.edu/

More information

Routing. Geo-Routing. Thanks to Stefan Schmid for slides

Routing. Geo-Routing. Thanks to Stefan Schmid for slides Routing Geo-Routing Thanks to Stefan Schmid for slides 1 Overview Classic routing overview Geo-routing Greedy geo-routing Euclidean and Planar graphs Face Routing Greedy and Face Routing 2 Shortest path

More information

Outline. Motivation. Traditional Database Systems. A Distributed Indexing Scheme for Multi-dimensional Range Queries in Sensor Networks

Outline. Motivation. Traditional Database Systems. A Distributed Indexing Scheme for Multi-dimensional Range Queries in Sensor Networks A Distributed Indexing Scheme for Multi-dimensional Range Queries in Sensor Networks Tingjian Ge Outline Introduction and Overview Concepts and Technology Inserting Events into the Index Querying the Index

More information

Link Estimation and Tree Routing

Link Estimation and Tree Routing Network Embedded Systems Sensor Networks Link Estimation and Tree Routing 1 Marcus Chang, mchang@cs.jhu.edu Slides: Andreas Terzis Outline Link quality estimation Examples of link metrics Four-Bit Wireless

More information

Performance Metrics of MANET in Multi-Hop Wireless Ad-Hoc Network Routing Protocols

Performance Metrics of MANET in Multi-Hop Wireless Ad-Hoc Network Routing Protocols Performance Metrics of MANET in Multi-Hop Wireless Ad-Hoc Network Routing Protocols R.Devi, B.Sumathi, T.Gandhimathi, G.Alaiyarasi 1 st year, M.Tech (Software Engineering), Department of Information Technology,

More information

J. A. Drew Hamilton, Jr., Ph.D. Director, Information Assurance Laboratory and Associate Professor Computer Science & Software Engineering

J. A. Drew Hamilton, Jr., Ph.D. Director, Information Assurance Laboratory and Associate Professor Computer Science & Software Engineering Auburn Information Assurance Laboratory J. A. Drew Hamilton, Jr., Ph.D. Director, Information Assurance Laboratory and Associate Professor Computer Science & Software Engineering 107 Dunstan Hall Auburn

More information