Advanced Mathematics and Numerical Modeling of IoT
of the Advance Computing Conference (IACC ’13), pp. 963–969, 2013. [14] P. G. J. Leelipushpam and J. Sharmila, “Live VM migratio ...
Research Article Grid-PPPS: A Skyline Method for Efficiently Handling Top-푘 Queries in Internet of Things Sun-Young Ihm,^1 Aziz ...
Distance Price 200 0 0 400 600 800 20 40 60 80 100 A B C D E F G H I J K (a) Data of Example 1 Distance Price 200 0 0 400 600 80 ...
again using hyperplane projection. This reduces the time complexity of the PPPS. (ii) We show the performance advantages of the ...
(a) Approximate skylining step f e a c d g b i h j (b) Grid-based partitioning step f e a c d g b h i j (d) Local skylining step ...
f e a c d g b h i j X 1 X 2 O (a) Grid-based partitioning in two-dimensional data space f e a c d g b h i j X 1 X 2 X 3 (b) Grid ...
0.001 0.01 0.1 1 10 100 1000 23456789 Index building time (s) SFS PPPS Grid-PPPS Dimension d (a) Computing time as푑is varied(푁=1 ...
0 0.05 0.1 0.15 0.2 0.25 0.3 0.35 0.4 0.45 23456789 Index building time (s) PPPS Grid-PPPS Dimension d (a) Computing time as푑is ...
0 5000 10000 15000 20000 25000 30000 35000 23456789 PPPS Grid-PPPS Dimension d nDC (×1000) (a)nDCas푑is varied(푁=10K) PPPS Grid-P ...
improves by 0.65–1.49 times over the PPPS as푑is varied and 푁is 1000 K. 5. Conclusion As more and more sensors get connected to t ...
[23] S. Hong and J. Chang, “A newk-NN query processing algorithm basedonmulticasting-basedcellexpansioninlocation-based services ...
Research Article Analysis and Enhancement of IEEE 802.15.4e DSME Beacon Scheduling Model Kwang-il Hwang and Sung-wook Nam Depart ...
Table 1: Tree-based beacon scheduling. Title (author) Characteristics Cho and An [ 5 ] Proposes a clustering approach based on g ...
B A D E C Transmission range Interface range Beacon interval SD index(0) SD index(1) SD index(2) SD index(3) Beacon slot DSME-be ...
Create beacon bitmap (depending on SD index) Transmit beacon Beacon reception Add the device ID to my neighbor table Select my S ...
(Variables) A[]: BITMAP ARRAY sA: Size of bitmap data type (eg., unsigned char A[BITMAPARRAYSIZE], in that case we have sA = 8) ...
1 2 3 4 7 8 5 6 9 Sparse (a) 1 2 3 4 7 8 5 6 9 Dense (b) Figure 3: Experiment topologies: spare and dense models. 0 10 20 30 40 ...
1 2 3 4 7 8 5 6 9 2 13 4 (a) Allocation completion of nodes 1, 2, 4, and 5 Beacon 1 2 3 4 7 8 5 6 9 2 13 4 (b) Beacon transmissi ...
1 2 3 4 7 8 5 6 9 2 13 4 (a) Allocation completion of nodes 1, 2, 4, and 5 1 2 3 4 7 8 5 6 9 2 13 4 Beacon (b) Beacon transmissi ...
0 10 20 30 40 50 60 70 80 90 100 LAB MAB Random Sparse topology Success ratio (%) SD index selection algorithm LAB MAB Random (a ...
«
7
8
9
10
11
12
13
14
15
16
»
Free download pdf