Skewness‐aware clustering tree for unevenly distributed spatial sensor nodes in smart city. (11th December 2012)

• Record Type: Journal Article
• Authors: Tang, Jine; Zhou, ZhangBing; Shu, Lei; Niu, Jianwei; Liu, Jin; Hu, Qiping; Wang, Qun
• Other Names: Chen Hsiao‐Hwa guestEditor.; Deng Der‐Jiunn guestEditor.; Cheng Rung‐Shiang guestEditor.; Chilamkurti Naveen guestEditor.; Yu Qiyue guestEditor.
• Is Part Of: International journal of communication systems. Volume 26:Number 9(2013:Sep.)
• Page Start: 1143
• Page End: 1162
• Publication Date: 2012-12-11
• Subjects: density‐based clustering tree -- skewed distribution -- R‐tree -- spatial sensor node; Telecommunication systems -- Periodicals; 621.382
• DOI: 10.1002/dac.2477
• Languages: English
• ISSNs: 1074-5351

Abstract

SUMMARY: Efficient spatial index is essential for querying spatial sensor nodes in the context of smart city. Sensor nodes are usually unevenly distributed in real situations. In this setting, R‐tree and its variants may cause large overlap and coverage among branch nodes, which impact the query efficiency greatly. To address this challenge, this paper proposes a novel skewness‐aware clustering tree (SWC‐tree) by clustering sensor nodes. Sensor nodes in a dense region will be put into the same node. Thus, overlap and coverage among node regions are less than that of R‐tree and its variants. As dense regions contain more sensor nodes, we assign a higher priority to these region nodes for facilitating the query operation. Experimental results show that in the context of skewed distribution, SWC‐tree is efficient in performance for conducting insertion, deletion, and query operations of sensor nodes. Copyright © 2012 John Wiley & Sons, Ltd. Abstract : This figure shows the varied trend of average query time under different sensor node sets and different skewness degrees. The important finding in our paper is that the bigger the skewness degree is, the less the average query time is under the situation of the same sensor node set.