Abstract
Social Internet of Things (SIoT) incorporates social relationship into the Internet of Things (IoT), and a compositive relationship between persons, devices, and persons to devices is utilized for providing better services. This article proposes a novel type of search, namely, top- <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> social spatial keyword search (SSKS) in SIoT networks to discover relevant users or data objects according to social, spatial, and textual preferences. Existing works mainly focus on two of these preferences at the same time, and efficiently processing top- <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> SSKS remains challenging. To this end, we propose two algorithms to evaluate top- <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> SSKS in SIoT networks. The first algorithm is a forward search-based algorithm, which spreads the search from the vertex of the querying user. An effective pruning strategy is established by recognizing an early termination condition according to the threefold preference. The forward search-based algorithm is efficient when textual objects are dense. The second algorithm is based on index searching. We present an index namely 2HL-GIL to support spatial and textual pruning while providing fast computation of social distances in the SIoT. Then an index-based search algorithm is proposed for top- <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> SSKS, and it is efficient especially when textual objects are sparse. Our proposed algorithms are evaluated over two real-life social networks attached with synthetic locations and textual data. Evaluation results illustrate the effectiveness and efficiency of our proposed forward search-based algorithm and index-based search algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
