Skewness-aware clustering tree for unevenly distributed spatial sensor nodes in smart city

International Journal of Communication Systems

Volumn 26, Issue 9, 2013, Pages 1143-1162

  Tang, Jine ^a   Zhou, Zhangbing ^a,b   Shu, Lei ^c   Niu, Jianwei ^d   Liu, Jin ^e   Hu, Qiping ^e   Wang, Qun ^a  

^a CHINA UNIVERSITY OF GEOSCIENCES   (China)

^b INSTITUT NATIONAL DES TÉLÉCOMMUNICATIONS   (France)

^c OSAKA UNIVERSITY   (Japan)

^d BEIHANG UNIVERSITY   (China)

^e WUHAN UNIVERSITY   (China)

Author keywords

density based clustering tree; R tree; skewed distribution; spatial sensor node

Indexed keywords

CLUSTERING TREES; DENSITY-BASED CLUSTERING; QUERY EFFICIENCY; QUERY OPERATIONS; R-TREE; SKEWED DISTRIBUTION; SPATIAL INDEXES; SPATIAL SENSORS;

DECISION TREES; ELECTRONIC COMMERCE; HIGHER ORDER STATISTICS;

SENSOR NODES;

EID: 84883198786     PISSN: 10745351     EISSN: 10991131     Source Type: Journal    
DOI: 10.1002/dac.2477     Document Type: Article

References (55)

1. Zhu C, Zheng C, Shu L, Han G,. A survey on coverage and connectivity issues in wireless sensor networks. Journal of Network and Computer Applications 2012; 35 (2): 619-632.
2. Zhou Z, Bhiri S, Zhuge H, Gaaloul W,. Assessment of service protocol adaptability based on novel walk computation. IEEE Transactions on Systems, Man, and Cybernetics 2012; 42 (5): 1109-1140.
3. Yang K, Cheng X, Hu L, Zhang J,. Mobile social networks: state-of-the-art and a new vision. International Journal of Communication System 2012; 25 (10): 1245-1259.
4. Megalingam RK, Mohan V, Shooja R,. Smart traffic controller using wireless sensor network for dynamic traffic routing and over speed detection. IEEE Global Humanitarian Technology Conference, Seattle, WA, USA, 2011; 528-533.
5. Chuang Y-R, Hsu C-S, Chen J-W,. Implementation of a smart traffic prediction and flow control mechanism for video streaming. International Conference on Intelligent Information Hiding and Multimedia Signal Processing, Darmstadt, Germany, 2010; 240-243.
6. Yang J, Shu L, Wu X, Cho J, Lee S,. Etri-qm: reward oriented query model for wireless sensor networks. Proceedings of the 2005 IFIP International Conference on Embedded & Ubiquitous Computing, Nagasaki, Japan, 2005; 597-608.
7. Navarro G, Reyes N,. Dynamic spatial approximation trees for massive data. 2009 Second International Workshop on Similarity Search and Applications 2009; 35: 81-88.
8. Al-Badarneh A, Al-Alaj A,. A spatial index structure using dynamic recursive space partitioning, International Conference on Innovations in Information Technology, Abu Dhabi, United Arab Emirates, 2011; 255-260.
9. Mouratidis K, Papadias D, Papadimitriou S,. Tree-based partition querying: a methodology for computing medoids in large spatial datasets. The Very Large DataBases Journal 2008; 17 (4): 1-19.
10. Zhu C, Yang LT, Shu L, Hara T, Nishio S,. Implementing top-k query in duty-cycled wireless sensor networks. The 7th International Wireless Communications & Mobile Computing Conference, Wuhan, China, 2011; 553-558.
11. Zhang D, Chee YM, Mondal A, Tung AKH, Kitsuregawa M,. Keyword search in spatial databases: towards searching by document. IEEE International Conference on Data Engineering, Shanghai, China, 2009; 688-699.
12. Wu X, Zang C,. A new spatial index structure for gis data. 2009 Third International Conference on Multimedia and Ubiquitous Engineering, Qingdao, China, 2009; 471-476.
13. Wei H, Wei Z, Yin Q,. A new parallel spatial query algorithm for distributed spatial databases. International Conference on Machine Learning and Cybernetics, Kunming, China, 2008; 1570-1574.
14. Emrich T, Kriegel H-P, Mamoulis N, Renz M, Zufle A,. Querying uncertain spatio-temporal data. Proceedings of the 28th IEEE International Conference on Data Engineering, Washington, DC, USA, 2012; 354-365.
15. Li J, Su Y,. A framework for efficient query answering on semantically heterogeneous grids. International Journal of Computational Science 2009; 3 (4): 355-372.
16. Guttman A,. R-trees: a dynamic index structure for spatial searching. Proceedings of the ACM SIGMOD International Conference on Management of Data, Boston, Massachusetts, 1984; 47-57.
17. Silva YN, Xiong X, Aref WG,. The rum-tree: supporting frequent updates in r-trees using memos. The Very Large DataBases Journal 2009; 18 (3): 719-738.
18. Zhang Z, Zhang J, Yang J, Yang Y,. A new approach to creating spatial index with r-tree. Proceedings of the Sixth International Conference on Machine Learning and Cybernetics, Hong Kong, China, 2007; 2645-2648.
19. Huang M, Chen Z,. The r+tree: a dynamic index for multi-dimensional objects. The 13th International Conference on Very Large Databases, Brighton, England, 1987; 507-518.
20. Fu Y, Hu Z, Zhou GWD,. Qr-tree: a hybrid spatial index structure. Proceedings of the Second International Conference on Machine Learning and Cybernetics, Xi-an, China, 2003; 459-463.
21. Zhang D, Chen Z,. The spatial index studies based on improved qr-tree. In Heilongjiang Academy of Engineering. Journal of Heilongjiang Institute of Technology: Heilongjiang, China, 2005; 18-20.
22. Berchtold S, Keim DA, Kriegel H-P,. The x-tree: an index structure for high-dimensional data. The 22nd International Conference on Very Large Databases, Bombay, India, 1996; 28-39.
23. Xia T, Zhang D,. Improving the r tree with outlier handling techniques. Proceedings of the 13th ACM International Workshop on Geographic Information Systems (GIS), Bremen, Germany, 2005; 125-134.
24. Aggarwal C, Wolf J, Yu P, Epelman M,. The s-tree: an efficient index for multidimensional objects. 5th International Symposium Advances in Spatial Databases, Berlin, Germany, 1997; 359-373.
25. Berkmann N, Krigel H-P,. The r*-tree: an efficient and robust access method for points and rectangles. Proceedings of the ACM SIGMOD International Conference on Management of Data, Atlantic City, NJ, 1990; 322-331.
26. Roumelis G, Vassilakopoulos M, Corral A,. Performance comparison of xbr-trees and r-trees for single dataset spatial queries. Proceedings of the 15th International Conference on Advances in Databases and Information Systems, Vienna, Austria, 2011; 228-242.
27. White DA, Jain R,. Similarity indexing with the ss-tree. Proceedings of the 12th International Conference on Data Engineering, New Orleans, Louisiana, 1996; 516-523.
28. Berkmann N, Krigel H-P,. The sr-tree: an index structure for high-dimensional nearest neighbor queries. Proceedings of the ACM SIGMOD International Conference on Management of Data, Tucson, Arizona, 1997; 369-380.
29. Li A, Zhang Z,. Rs-tree: a dynamic index structure. The International Conference on Information Engineering and Computer Science, Wuhan, China, 2009; 1-4.
30. Vlachou A, Doulkeridis C, Kotidis Y, Norvag K,. Reverse top-k queries. IEEE International Conference on Data Engineering, Long Beach, California, USA, 2010; 365-376.
31. Lu J, Lu Y, Cong G,. Reverse spatial and textual k nearest neighbor search. Proceedings of the 2011 International Conference on Management of Data, Athens, Greece, 2011; 349-360.
32. Kwon Y, Balazinska M, How1 B, Rolia J,. Skewtune: mitigating skew in mapreduce applications. Proceedings of the 2012 International Conference on Management of Data, Scottsdale, Arizona, USA, 2012.
33. Zhang W, Wu W, Yang X, Xiang G,. An optimized query index method based on r-tree. Fourth International Joint Conference on Computational Sciences and Optimization, Kunming and Lijiang, Yunnan Province, China, 2011; 1007-1010.
34. Theodoridis Y, Stefanakis E, Sellis T,. Efficient cost models for spatial queries using r-trees. IEEE Transactions on Knowledge and Data Engineering 2000; 12 (1): 19-32.
35. bin Wang J, xing Peng Z,. An optimization algorithm for spatial index structure based on spatial clustering. International Conference on Business Computing and Global Informatization, Shanghai, China, 2011; 589-592.
36. Sheikholeslami G, Chatterjee S, Zhang A,. Wavecluster: a wavelet-based clustering approach for spatial data in very large databases. The Very Large DataBases Journal 2000; 8 (3-4): 289-304.
37. Wu X, Shu L, Meng M, Cho J, Lee S,. Coverage-driven self-deployment for cluster based mobile sensor networks. Proceedings of the 2006 IEEE International Conference on Computer and Information Technology, Seoul, Korea, 2006; 226-231.
38. Huang Y-M, Su B-L, Wang M-S,. Localized and load-balanced clustering for energy saving in wireless sensor networks. International Journal of Communication Systems 2008; 21 (8): 799-814.
39. Pettinger D, Fatta GD,. Space partitioning for scalable k-means. 2010 Ninth International Conference on Machine Learning and Applications, Washington D.C., USA, 2010; 319-324.
40. ur Rehman Khan A, Madani SA, Hayat K, Khan SU,. Clustering-based power-controlled routing for mobile wireless sensor networks. International Journal of Communication Systems 2012; 25 (4): 529-542.
41. Nekrich Y,. Space-efficient range reporting for categorical data. Proceedings of the 31st Symposium on Principles of Database Systems, Scottsdale, AZ, USA, 2012; 113-120.
42. Singh M, Zhu Q, Jagadish HV,. Swst: a disk based index for sliding window spatio-temporal data. Proceedings of the 28th IEEE International Conference on Data Engineering, 2012; 342-353.
43. Yan F, Hou W-C, Jiang Z, Huang Y, Che D,. Selectivity estimation of range queries over data streams using cosine transform. International Journal of Computational Science 2007; 1 (4): 422-439.
44. Liu R, An X, Gao X,. Spatial index structure based on r-tree. The Journal of Computer Engineering 2009; 35: 32-34.
45. Floriani LD, Fellegara R, Magillo P,. Spatial indexing on tetrahedral meshes. The 18th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, San Jose, California, 2010; 506-509.
46. Barroso M, Reyes N, Paredes R,. Enlarging nodes to improve dynamic spatial approximation trees. Proceedings of the Third International Conference on Similarity Search and Applications, Istanbul, Turkey, 2010; 41-48.
47. Weiss K, Fellegara R, Floriani LD, Velloso M,. The pr-star octree: a spatio-topological data structure for tetrahedral meshes. The 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, Chicago, Illinois, 2011; 92-101.
48. Kamel I, Faloutsos C,. Hilbert r-tree: an improved r-tree using fractals. Proceedings of the International Conference on Very Large Databases, Zurich, Switzerland, 1995; 500-509.
49. Leuteneggert ST, Lopezt MA, Edgington J,. Str: a simple and efficient algorithm for r-tree packing. Proceedings of the 13th International Conference on Data Engineering, Birmingham, U.K., 1997; 497-506.
50. Beckmann N, Seeger B,. A revised r-tree in comparison with related index structures. Proceedings of the ACM SIGMOD International Conference on Management of Data, Providence, Rhode Island, USA, 2009; 799-811.
51. Liu Y, Fang J, Han C,. New r-tree node splitting algorithm using mbr partition policy. Geoinformatics, 2009; 1-6.
52. He Z, Wu C, Wang C,. Clustered sorting r-tree: an index for multi-dimensional spatial objects. Fourth International Conference on Natural Computation, Jinan, China, 2008; 348-352.
53. Brakatsoulas S, Pfoser D, Theodoridis Y,. Revisiting r-tree construction principles. Advances in Databases and Information Systems, 2002; 149-162.
54. Zhang S, Chen Z,. The research of Hilbert r-tree spatial index algorithm based on hybrid clustering. International Conference on Electronic and Mechanical Engineering and Information Technology, Harbin, Heilongjiang, China, 2011; 3407-3495.
55. Xu H, Yu D, Xu D,. Ss-cluster tree: a subspace clustering based indexing algorithm over high-dimensional image features. Proceedings of the 2008 International Conference on Content-based Image and Video Retrieval, Niagara Falls, Canada, 2008; 95-104.