information brokerage and delivery to mobile sinks
DESCRIPTION
Information Brokerage and Delivery to Mobile Sinks. HyungJune Lee, Branislav Kusy, Martin Wicke. Motivations. How to forward relevant data to mobile sinks with hard latency constraint? Use two-tier architecture 1) Exploit stationary node networks to forward packets with reliability - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Information Brokerage and Delivery to Mobile Sinks](https://reader036.vdocuments.net/reader036/viewer/2022070419/56815d91550346895dcbaadf/html5/thumbnails/1.jpg)
Information Brokerage and Deliveryto Mobile Sinks
HyungJune Lee, Branislav Kusy, Martin Wicke
![Page 2: Information Brokerage and Delivery to Mobile Sinks](https://reader036.vdocuments.net/reader036/viewer/2022070419/56815d91550346895dcbaadf/html5/thumbnails/2.jpg)
Motivations
• How to forward relevant data to mobile sinks with hard latency constraint?– Use two-tier architecture1) Exploit stationary node
networks to forward packets with reliability
2) Track mobile nodes by using nearby stationary nodes
Sensornet Meeting 2
![Page 3: Information Brokerage and Delivery to Mobile Sinks](https://reader036.vdocuments.net/reader036/viewer/2022070419/56815d91550346895dcbaadf/html5/thumbnails/3.jpg)
Sensornet Meeting 3
Evaluation of two-tier architecture
• Evaluation setting– Field size: 220 x 220 m2
– Transmission range of 802.11b: 500 m
– Transmission range of 802.15.4: 30 m
– # of static nodes: 100– # of mobile nodes: 10
(This is set to stationary for now)– # of cluster-heads: 9– Total # of nodes: 119– Measure average latency, packet
delivery ratio and packet overhead
![Page 4: Information Brokerage and Delivery to Mobile Sinks](https://reader036.vdocuments.net/reader036/viewer/2022070419/56815d91550346895dcbaadf/html5/thumbnails/4.jpg)
Average Latency, Packet Delivery Ratio, Packet Overhead
Sensornet Meeting 4
![Page 5: Information Brokerage and Delivery to Mobile Sinks](https://reader036.vdocuments.net/reader036/viewer/2022070419/56815d91550346895dcbaadf/html5/thumbnails/5.jpg)
Cluster-wide flood
802.11
Easy to implement, but inefficient!!!!
CTP tree maintained in each cluster, cluster-head is CTP sink
![Page 6: Information Brokerage and Delivery to Mobile Sinks](https://reader036.vdocuments.net/reader036/viewer/2022070419/56815d91550346895dcbaadf/html5/thumbnails/6.jpg)
Maintain back route
802.11
CTP tree maintained in each cluster, cluster-head is CTP sink
Route to the mobile node is maintained using beacon pckts
beacon pckt collects path info
1 route is kept
Beacon pckts are periodically broadcasted, thus back route remains reliable
Much lower streaming overhead!
![Page 7: Information Brokerage and Delivery to Mobile Sinks](https://reader036.vdocuments.net/reader036/viewer/2022070419/56815d91550346895dcbaadf/html5/thumbnails/7.jpg)
Problem: routing in the same cluster
802.11
Shorter route may exist
Cluster head becomes a bottleneck
![Page 8: Information Brokerage and Delivery to Mobile Sinks](https://reader036.vdocuments.net/reader036/viewer/2022070419/56815d91550346895dcbaadf/html5/thumbnails/8.jpg)
Solution 1: CTP redirection
Most of the time, the route length increase is negligible (we have small clusters)
The rest of the cases: cluster head can detect where the 2 routes join and set a marker to redirect the traffic
![Page 9: Information Brokerage and Delivery to Mobile Sinks](https://reader036.vdocuments.net/reader036/viewer/2022070419/56815d91550346895dcbaadf/html5/thumbnails/9.jpg)
Solution 2: two CTP trees
Set up a new CTP tree with the mobile node being the sink
More overhead to maintain two CTP trees
But the performance is as good as the point to point routing…
802.11
![Page 10: Information Brokerage and Delivery to Mobile Sinks](https://reader036.vdocuments.net/reader036/viewer/2022070419/56815d91550346895dcbaadf/html5/thumbnails/10.jpg)
Best neighbor prediction
Problem 1: how to fix the data structure (back route vs CTP)
Problem 2: how to re-route packets until data structure gets fixed
Hope to efficiently solve these, by predicting the next neighbor of the mobile node at cluster head.
![Page 11: Information Brokerage and Delivery to Mobile Sinks](https://reader036.vdocuments.net/reader036/viewer/2022070419/56815d91550346895dcbaadf/html5/thumbnails/11.jpg)
RSSI-based vs. Location-based
• Location-based prediction– RADAR: IEEE Infocom’00– Nibble: UbiComp’01– Distance != Connectivity
• RSSI-based prediction– RSSI value can provide the link
status information– Locally weighted linear
regression– Gaussian process regression
• Bayesian learning technique
Sensornet Meeting 11
RSSI
Neighbor 1
Neighbor 2
Neighbor 3
![Page 12: Information Brokerage and Delivery to Mobile Sinks](https://reader036.vdocuments.net/reader036/viewer/2022070419/56815d91550346895dcbaadf/html5/thumbnails/12.jpg)
Estimation of the nearest neighbor
• Evaluation setting– Field size: 120 x 120 m2
– Wireless PHY/MAC: 802.15.4– Transmission range: 30 m– Propagation model
• Shadowing model– Mobility model
• Random waypoint mobility model• Max speed: 5 m/s, pause time:
10 sec– # of mobile nodes: 20– Beacon period: 5 sec– Check whether the real closest
node at a given time resides in the best k neighbors where k=1, 2, and 3
Sensornet Meeting 12
![Page 13: Information Brokerage and Delivery to Mobile Sinks](https://reader036.vdocuments.net/reader036/viewer/2022070419/56815d91550346895dcbaadf/html5/thumbnails/13.jpg)
Path Prediction
Sensornet Meeting 13
![Page 14: Information Brokerage and Delivery to Mobile Sinks](https://reader036.vdocuments.net/reader036/viewer/2022070419/56815d91550346895dcbaadf/html5/thumbnails/14.jpg)
Path Prediction
• From the RSSI graph, can we tell which path will be taken?– Extract typical RSSI graphs– Using partial information, generate most likely
complete RSSI graph• Subspace projection• Discrete selection
– Use reconstructed RSSI graph to select best relay node
Sensornet Meeting 14