Massively Distributed Database Systems In-Network Query Processing (Ad-Hoc Sensor Network) Spring...
-
Upload
duane-rich -
Category
Documents
-
view
219 -
download
0
Transcript of Massively Distributed Database Systems In-Network Query Processing (Ad-Hoc Sensor Network) Spring...
![Page 1: Massively Distributed Database Systems In-Network Query Processing (Ad-Hoc Sensor Network) Spring 2014 Ki-Joune Li lik Pusan.](https://reader031.fdocuments.us/reader031/viewer/2022032518/56649ccc5503460f94996267/html5/thumbnails/1.jpg)
Massively Distributed Data-base Systems
In-Network Query Processing(Ad-Hoc Sensor Network)
Spring 2014Ki-Joune Li
http://isel.cs.pusan.ac.kr/~likPusan National University
![Page 2: Massively Distributed Database Systems In-Network Query Processing (Ad-Hoc Sensor Network) Spring 2014 Ki-Joune Li lik Pusan.](https://reader031.fdocuments.us/reader031/viewer/2022032518/56649ccc5503460f94996267/html5/thumbnails/2.jpg)
2
Basic Concepts – in-network query processing
each node has - a local & tiny DB and- sensors
a query "find the nodes where temperature is higher than 35oC"
How to process it?
![Page 3: Massively Distributed Database Systems In-Network Query Processing (Ad-Hoc Sensor Network) Spring 2014 Ki-Joune Li lik Pusan.](https://reader031.fdocuments.us/reader031/viewer/2022032518/56649ccc5503460f94996267/html5/thumbnails/3.jpg)
3
Why in-network query processing ?
• scalable• No need to store the entire DB• Interact with neighbor nodes• A node failure is not critical
• Issue• Query processing time determined by # of hops• Energy consumption
• Battery is normally limited• Energy consumption for communication is relatively high
• SQL-like query
![Page 4: Massively Distributed Database Systems In-Network Query Processing (Ad-Hoc Sensor Network) Spring 2014 Ki-Joune Li lik Pusan.](https://reader031.fdocuments.us/reader031/viewer/2022032518/56649ccc5503460f94996267/html5/thumbnails/4.jpg)
4
Energy Consumption
in S. Banerjee, A. Misra, http://pages.cs.wisc.edu/~suman/pubs/winet03.pdf
![Page 5: Massively Distributed Database Systems In-Network Query Processing (Ad-Hoc Sensor Network) Spring 2014 Ki-Joune Li lik Pusan.](https://reader031.fdocuments.us/reader031/viewer/2022032518/56649ccc5503460f94996267/html5/thumbnails/5.jpg)
5
Energy Consumption
. . .
Prx
Ptx
Ptx
r
N r
𝑃 𝑃𝑟𝑥∝𝑃 𝑡𝑥
𝑟𝛼
What does it imply?
![Page 6: Massively Distributed Database Systems In-Network Query Processing (Ad-Hoc Sensor Network) Spring 2014 Ki-Joune Li lik Pusan.](https://reader031.fdocuments.us/reader031/viewer/2022032518/56649ccc5503460f94996267/html5/thumbnails/6.jpg)
6
Multi-hop instead of infrastructure network
• No global network topology like TCP/IP• Network topology with its neighbors
local stateless routing algorithm
![Page 7: Massively Distributed Database Systems In-Network Query Processing (Ad-Hoc Sensor Network) Spring 2014 Ki-Joune Li lik Pusan.](https://reader031.fdocuments.us/reader031/viewer/2022032518/56649ccc5503460f94996267/html5/thumbnails/7.jpg)
7
Unit-Disk Graph
• UDG: Graph G(N,E) where N is the set of nodes (sensors) andE is set of edges whose length is less than 1 (unit)
• Types if UDG• RNG• Gabriel Graph• Delaunay Graph
• Each node in V maintains the node IDs connected via edges in E
![Page 8: Massively Distributed Database Systems In-Network Query Processing (Ad-Hoc Sensor Network) Spring 2014 Ki-Joune Li lik Pusan.](https://reader031.fdocuments.us/reader031/viewer/2022032518/56649ccc5503460f94996267/html5/thumbnails/8.jpg)
8
Gabriel Graph
• Graph GG(V,E) • V is a set of nodes n (id, p) where p is a point in Euclidean space• E is a set of edge (a, b) that there is no other node within the closed
disk of (a, b)
![Page 9: Massively Distributed Database Systems In-Network Query Processing (Ad-Hoc Sensor Network) Spring 2014 Ki-Joune Li lik Pusan.](https://reader031.fdocuments.us/reader031/viewer/2022032518/56649ccc5503460f94996267/html5/thumbnails/9.jpg)
9
RNG – Relatively Neighborhood Graph
• Graph RNG(V,E) • V is a set of nodes n (id, p) where p is a point in Euclidean space• E is a set of edge (a, b) that two points a and b by an edge
whenever there is no third point c that is closer to both a and b than they are to each other (there is no other point within the intersection of the circles centered at a and b with radius the distance d(a, b))
![Page 10: Massively Distributed Database Systems In-Network Query Processing (Ad-Hoc Sensor Network) Spring 2014 Ki-Joune Li lik Pusan.](https://reader031.fdocuments.us/reader031/viewer/2022032518/56649ccc5503460f94996267/html5/thumbnails/10.jpg)
10
Delaunay Triangulation Graph
• Graph DTG(V,E) • V is a set of nodes n (id, p) where p is a point in Euclidean space• E is a set of edge e (a, b) where e is a side of triangle constructed by
Delaunay Triangulation.• Delaunay Triangulation: for a set P of points in a plane is a
triangulation DT(P) such that no point in P is inside the circumcircle of any triangle in DT(P)
![Page 11: Massively Distributed Database Systems In-Network Query Processing (Ad-Hoc Sensor Network) Spring 2014 Ki-Joune Li lik Pusan.](https://reader031.fdocuments.us/reader031/viewer/2022032518/56649ccc5503460f94996267/html5/thumbnails/11.jpg)
11
Routing - GPSR
• in Brad Karp and H.T. Kung in MobiCom 2000, pp.243-254• GPSR (Greedy Perimeter Stateless Routing)• A node x
• broadcasts a query message with destination point D• the closest node y receives and forwards the message.
![Page 12: Massively Distributed Database Systems In-Network Query Processing (Ad-Hoc Sensor Network) Spring 2014 Ki-Joune Li lik Pusan.](https://reader031.fdocuments.us/reader031/viewer/2022032518/56649ccc5503460f94996267/html5/thumbnails/12.jpg)
12
Example
full UDG with 200 nodes GG with 200 nodes(subset of full UDG)
RNG with 200 nodes(subset of GG)
GG with 200 nodes over 2Km X 2Km where radio range is 250 m
![Page 13: Massively Distributed Database Systems In-Network Query Processing (Ad-Hoc Sensor Network) Spring 2014 Ki-Joune Li lik Pusan.](https://reader031.fdocuments.us/reader031/viewer/2022032518/56649ccc5503460f94996267/html5/thumbnails/13.jpg)
13
Routing - GPSR
• Problem• both of node x are farther
from the destination D
• Right-Hand Rule: Perimeter
• Combination of UNG and Perimeter routing
circle(xD)