1 / 120

Corso di Reti mobili Reti ad hoc & Reti di Sensori

Corso di Reti mobili Reti ad hoc & Reti di Sensori. S. Chessa. Sensor Networks: the network. Ad Hoc Networks specialized for environmental monitoring Traditional approaches: Manual deployment (small number of sensors) Fixed topology Sensed data gathered to a sink node

Download Presentation

Corso di Reti mobili Reti ad hoc & Reti di Sensori

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.


Presentation Transcript

  1. Corso di Reti mobili Reti ad hoc & Reti di Sensori S. Chessa

  2. Sensor Networks: the network • Ad Hoc Networks specialized for environmental monitoring • Traditional approaches: • Manual deployment (small number of sensors) • Fixed topology • Sensed data gathered to a sink node • Sinks issue requests/commands and receive (preprocessed) sensed data • Sinks provide the user with an interface to the network • Current trend • Large number of sensors • Connected as in a multihop ad hoc network • High network density • Autonomous when the sinks are disconnected

  3. Sensor Networks: the network User Internet, Satellite Network, etc.. Sink

  4. Sensor Networks: the sensors • Each sensor : • Low power, low cost system • Small • Autonomous • Sensors equipped with: • Processor • Memory • Radio Transceiver • Sensing devices • Acceleration, pressure, humidity, light, acoustic, temperature, GPS, magnetic, … • Battery, solar cells, …

  5. Sensor Networks Differences with Ad Hoc Networks • Number of sensor nodes can be several orders of magnitude higher • Sensor nodes are strongly constrained in power, computational capacities, and memory • Sensor network are denser and sensors are prone to failures • The topology of a sensor network changes very frequently due node failures (and mobility?) • Sensors may not have individual IDs • Need tight integration with sensing tasks

  6. Sensor Networks • Sensors are deployed in the Sensing Field • Each sensors samples environmental parameters • Produces a streams of data • data stream can be pre-processed locally and then forwarded to a sink • The sinks might be temporarily unavailable • The network operates autonomously • Pre-process and store sensed data • Sensors may implement a database

  7. Sensor Networks Applications • Environmental • Tracking animals, … • Pollution control, … • Disaster recovery • Monitor disaster areas, • Fire/flooding detection, … • Meteorological research • Security • Nuclear, Biological and Chemical (NBC) attack detection • Monitoring battlefield, • Surveillance, …

  8. Sensor Networks Applications • Health • Diagnostics • Monitoring of physiological data, • Support for disabled, … • Commercial • Inventory management, • Vehicle tracking, • Toys, • Domotics, • … • Space exploration

  9. Sensor networks issues • Communication is expensive • Routing is programmed by the sink node • Programming is focused to specific applications • Current research: • Point to point geographic routing • Distributed Data Centric Storage • Development of general purpose DBMS • Desiderata: • Guaranteed storage/communication • Security • Mobility? Sensor Networks

  10. Sensor Networks: Motes Distributed by Crossbow INC. (http://www.xbow.com) Standard packages: 8 processing/radio units 8 sensing units 1 serial programmer Operating System (tinyOS) Programming environment (nesC)

  11. Motes: processing / radio CPU: ATMEL 128L (8 bit, 8Mhz) Program memory: 128 Kb Data memory: 4 Kb – 512 Kb (?) Radio: 433 Mhz

  12. Motes: sensing units • MTS 300 CA • Light • Temperature • Acoustic • Sounder • MTS 510 CA • Light • Accelerometer • Acoustic

  13. Motes: base station • MIB 510 CA • Serial interface • Able to host MICA boards • Externally powered

  14. Motes: Software • tinyOS • Developed at UC Berkeley • Event scheduler + minimal C runtime • Size: < 1 Kb • Open Source (BSD Licence) • Many modules (e.g. MAC layers, etc) freely available • nesC • Event driven language: • Components • Commands (exported interface) • Events (imported interface) • Component-level concurrency • Compiler for MOTES or emulator • TinyOS & NesC Tutorial: • http://www.tinyos.net/tinyos-1.x/doc/tutorial/

  15. Motes: Software implementation {command result_t StdControl.init() {    call Leds.init();    return SUCCESS;  }command result_t StdControl.start() {    return call Timer.start(TIMER_REPEAT, 1000) ;  }command result_t StdControl.stop() {    return call Timer.stop();  }event result_t Timer.fired()  {    call Leds.redToggle();    return SUCCESS;  }} • A simple nesC application: BLINK • Toggles the red led every second module BlinkM { provides {    interface StdControl;  } uses {    interface Timer;    interface Leds;  }}

  16. Motes: Software configuration Blink {implementation {  components Main, BlinkM, SingleTimer, LedsC;  Main.StdControl -> BlinkM.StdControl;  Main.StdControl -> SingleTimer.StdControl;  BlinkM.Timer -> SingleTimer.Timer;  BlinkM.Leds -> LedsC.Leds;} }

  17. Sensor Networks: Network Layer • Important considerations: • Sensor networks are mostly data centric • Attribute-based addressing and location awareness • Data aggregation can be useful but it might prevent collaborative effort • Energy efficiency is a key factor • Traditional routing protocols are not practical: • Large routing tables • Size of packet headers • Node IDs are less meaningful than their capabilities • From identity-based to data-driven routing

  18. A B C D r q s C B <r,q> <r,s> D Protocols for Sensor Networks Drawbacks of flooding-based data dissemination: • The implosion problem: • node A starts by flooding its data to all of its neighbors. • Two copies of the data eventually arrive at node D. • The system wastes resources in one unnecessary send and receive. • The overlap problem: • Two sensors cover an overlapping geographic region. • The sensors flood their data • Node C receives two copies of the data marked r. • Resource blindness • Sensors are not “resource-aware”: they do not adapt their activities based on their energy

  19. Aggregation: 4 2 3 6 4 2 Protocols for Sensor Networks 4 2 7 Data centric routing 3 6 5 8 6 6 9 8 4 7 8 9 2 Sink Temperature < 5

  20. 6 8 6 8 7 2 Protocols for Sensor Networks Area B Area A Location Awareness 4 Area C 2 7 3 6 5 8 6 6 9 8 4 7 8 9 2 Sink Temperature of the sensors in area C

  21. Sensor Protocol for Information via Negotiation

  22. SPIN • Heinzelman et Al.,MobiCom ’99 • Negotiation • Resource-adaptation • Negotiation • ensures that only useful information will be transferred. • use of meta-data to describe data • Resource adaptation • Each sensor has a resource manager that monitors energy consumption • Applications probe the resource manager before transmitting/processing data

  23. SPIN • SPIN Messages: • ADV: When a sensor node has a new data, it broadcasts (to its neighbors) an advertisement (ADV) packet that describes the new data by using meta data • REQ: used by interested nodes to subscribe data advertised with ADV • DATA: to send the data to its subscribers • Resource manager • If the residual energy of a sensor is below a given bound, the sensor does not partecipate to the ADV-REQ-DATA protocol. • However, it will spend energy to receive the ADV messages ADV REQ Data

  24. ADV ADV Data REQ Data ADV REQ Data ADV REQ ADV SPIN • Example of data propagation with SPIN

  25. SPIN • Simulations: SPIN VS • Flooding • Gossiping • Nodes forward data to a random subset of neighbors • Ideal • With perfect knowledge of the network topology and shortest paths • Simulation parameters: • 25 nodes • Each node with 3 data items of 500 bytes each • Each data item has a distinct name

  26. SPIN: simulations • Percent of total data acquired in the system over time for each protocol (SPIN, Flooding, gossiping, and ideal)

  27. SPIN: simulations • Total amount of energy dissipated in the system for each protocol (SPIN, Flooding, gossiping, and ideal)

  28. SPIN • Drawbacks: • Energy management: • Nodes cannot turn off the radio to save energy • Need for synchronization • The same data travels along multiple paths • Wastage of energy • Assumes that all the sampled data should be delivered to the sink • No mechanisms to let the sink request for specific data • No local processing of sensed data

  29. Directed Diffusion

  30. Directed Diffusion • Intanagonwiwat et Al., MobiCom 2OOO • Coordination protocol to perform distributed sensing of environmental phenomena • The sensor network is programmed to respond to queries such as: • "How many pedestrians do you observe in the geographical region X” • "Tell me in what direction that vehicle in region Y is moving" • Directed diffusion is datacentric • all communication is for named data • Data generated by sensors is named by attribute-value pairs. • A node requests data by sending interests for named data.

  31. Directed Diffusion Basic elements of Directed Diffusion: • Data is namedusing attribute-value pairs. • A sensing task is disseminated in the network as an interestfor named data. • The dissemination of interests sets up gradients • gradients "draw" events (i.e., data matching the interest). • Data matching the interest flow towards the sink of interest along multiple paths. • The sink reinforcesone, or a small number of these paths.

  32. Directed Diffusion • Interests are named by a sequence of attribute-value pairs that describe the task. • Example of a simple animal tracking task: type = four-legged animal // detect animal location interval = 20 ms // send back events every 20 ms duration = 10 seconds // .. for the next 10 seconds rect = [-100, 100, 200, 400] // from sensors within rectangle • Coordinate may refer to a GPS-based coordinate system • The data sent in response to the interest is also named using a similar naming scheme. • Example : type = four-legged animal // type of animal seen instance = elephant // instance of this type location = [125, 220] // node location intensity = 0.6 // signal amplitude measure confidence = 0.85 // confidence in the match timestamp = 01:20:40 // event generation time

  33. Directed Diffusion • Interests are periodically generated by the sink • The first broadcast is exploratory • The next broadcasts are refreshes of the interest • Necessary because dissemination of interests is not reliable • Nodes receiving an interest may forward the interest to a subset of neighbors • nodes must be assigned with a unique ID • Directed diffusion works also in presence of multiple sinks

  34. Directed Diffusion • Nodes cache received interests • Different interests with same time interval, area, and type (but, for example, different sampling rate) are aggregated • Interests in the cache expire when the duration time is elapsed • Each interest in the cache is associated with a gradient, i.e. the node from which it was received • Gradients might be associated with different sampling rate • Note that the same interest may be received from different nodes Interest propagation Gradients set up 4 1 5 sink 2 3 6

  35. Multiple sources Delivery along strongest gradients Propagation to all interested neighbors Event 5 5 Event Event 6 6 Directed Diffusion • A gradient is a direction and a data rate • Gradients are used to route data matching the interest toward the sink whom originated the interest • A data may be routed along multiple paths • Data is routed along a single path if a preferred gradient is used Examples of data propagation: 4 1 5 sink 2 3 6

  36. Directed Diffusion • A sensor node which detects an event matching with an interest in the cache: • Start sampling the event at the largest sampling rate of the corresponding gradients • The node sends sampled data to neighbors interested in the event • This information is stored in the gradients associated to the interest in the cache • If a gradient g has a lower rate then the others, data along g is sent with lower rate • Neighbors forward the data only if a corresponding interest (with a gradient) is still in the cache • However if that data has already been sent it is dropped

  37. Directed Diffusion Reinforcements • Used when the sink start receiving data matching an exploratory interest from node u • The sink reinforces node u to improve the quality of received data • Exploratory interests use a low sampling rate • Reinforces of interests specify an interest with larger sampling rate • In turn, a node receiving a reinforce of an interest reinforces one of its neighbors • Reinforces are propagated through the path along which the data flows

  38. Directed Diffusion Drawbacks • Assumes that the sink is permanently connected to the network • the network does not operate autonomously • Sensors do not process data (apart aggregation) • The sensors just send the data matching the interests to the sink • Does not exploit processing and storage capabilities of the sensors Flexible network design needs flexible routing

  39. Greedy Perimeter Stateless Routing(GPRS)

  40. Routing with GPS: GPSR • Karp & Kung, MOBICOM 2OOO • Assumptions: • The nodes are deployed on a two-dimensional space • Nodes are aware of their position and of the position of their neighbors • For example the nodes are equipped with GPS • The source knows the coordinate of the destination • Packet headers contain the destination coordinate • The protocol is scalable: • No need for route discovery • Few control packets • Nodes maintain only local information • Large route caches or routing table are not necessary • Packet headers do not need to store routes

  41. GPSR • GPRS comprises two modes: • Greedy forwarding • Perimeter forwarding • Greedy forwarding • Consider a packet with destination D • the forwarding node x select as next hop a neighbor y such that: • y is closer to D than x • Among neighbors y is the closest to the destination • Greedy forwarding fails if the packet encounters a “void”

  42. GPSR w u x void D v z

  43. GPSR • Perimeter mode forwarding is executed when greedy forwarding finds a void • Routes around the void • Based on the right hand rule • When arriving from y to x • Selects as next edge the one sequentially counterclockwise about x from edge (x,y) • Traverses the interior of a closed polygonal region (face) in clockwise edge order • Intuitively it explores the polygon enclosing the void to route around the void • In the previous example it would produce x – w – u – D z 2 x 3 1 y

  44. GPSR • However, graph G corresponding to the sensor network is a non-planar embedding of a graph • Edges may cross • the right hand rule may take a degenerate tour of edges that does not trace the boundary of a closed polygon • In the example, from x to v the right hand rule produces the path x – v – w – u – x w v u z x

  45. GPSR: graph planarization • For this reason GPRS applies the perimeter mode to a planar graph P obtained from G • Relative Neighborhood Graph of G • Gabriel Graph of G • Properties: • If G is connected then P is connected • P is obtained from G by removing edges • P is computed with a distributed algorithm executed along with the perimeter mode packet forwarding

  46. GPSR : graph planarization w • Relative Neighborhood Graph (P) of G: • Edge (u,v)P iff • (u,v)G • d(u,v)  Max(d(u,w),d(v,w)) for each wN(u)N(v) • Consider the forwarding node u: • u considers each neighbor vN(u) • edge (u,v) is kept iff the above property is satisfied u v This area must be empty in order to include (u,v) in P

  47. GPSR : graph planarization w • Gabriel Graph (P) of G: • Edge (u,v)P iff • (u,v)G • d2(u,v)  [d2(u,w)+d2 (v,w)] for each wN(u)N(v) • GG constructed with a distributed algorithm as RNG • RNG is a subgraph of GG • RNG has smaller link density • RNG or GG are both suitable to GPRS u v This area must be empty in order to include (u,v) in P

  48. GPSR : graph planarization Full graph, Gabriel Graph and Relative Neighborhood Graph

  49. GPSR: perimeter mode • Packet header in perimeter mode: • Let x be the node where the packet enters in perimeter mode • Consider the line x-D • GPSR forwards the packet on progressively closer faces on the planar graph, each of which intersects x-D

  50. GPSR: perimeter mode • A planar graph has two types of faces: • Interior faces • Closed polygonal regions bounded by the graph edges • One exterior face • The unbounded face outside the outer boundary of the graph • On each face GPRS uses the right hand rule to reach an edge which crosses x-D (and that is closer to D than x) • At that edge GPRS moves to the adjacent face crossed by x-D • Each time it enters a new face the packet records: • In Lf the point on the intersection between x-D and the current edge • In eo the current edge • GPRS returns to greedy mode if the current node is closer to D than x • Perimeter mode is intended to recover from a local maximum…

More Related