A Distributed Relation Detection Approach in the Internet of Things
In the Internet of Things, it is important to detect the various relations among objects for mining useful knowledge. Existing works on relation detection are based on centralized processing, which is not suitable for the Internet of Things owing to the unavailability of a server, one-point failure,...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2017-01-01
|
Series: | Mobile Information Systems |
Online Access: | http://dx.doi.org/10.1155/2017/4789814 |
id |
doaj-249a24156b864ccab60a3e95032691d3 |
---|---|
record_format |
Article |
spelling |
doaj-249a24156b864ccab60a3e95032691d32021-07-02T02:58:18ZengHindawi LimitedMobile Information Systems1574-017X1875-905X2017-01-01201710.1155/2017/47898144789814A Distributed Relation Detection Approach in the Internet of ThingsWeiping Zhu0Hongliang Lu1Xiaohui Cui2Jiannong Cao3International School of Software, Wuhan University, Wuhan, ChinaScience and Technology on Parallel and Distributed Processing Laboratory, National University of Defense Technology, Changsha, ChinaInternational School of Software, Wuhan University, Wuhan, ChinaDepartment of Computing, Hong Kong Polytechnic University, Kowloon, Hong KongIn the Internet of Things, it is important to detect the various relations among objects for mining useful knowledge. Existing works on relation detection are based on centralized processing, which is not suitable for the Internet of Things owing to the unavailability of a server, one-point failure, computation bottleneck, and moving of objects. In this paper, we propose a distributed approach to detect relations among objects. We first build a system model for this problem that supports generic forms of relations and both physical time and logical time. Based on this, we design the Distributed Relation Detection Approach (DRDA), which utilizes a distributed spanning tree to detect relations using in-network processing. DRDA can coordinate the distributed tree-building process of objects and automatically change the depth of the routing tree to a proper value. Optimization among multiple relation detection tasks is also considered. Extensive simulations were performed and the results show that the proposed approach outperforms existing approaches in terms of the energy consumption.http://dx.doi.org/10.1155/2017/4789814 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Weiping Zhu Hongliang Lu Xiaohui Cui Jiannong Cao |
spellingShingle |
Weiping Zhu Hongliang Lu Xiaohui Cui Jiannong Cao A Distributed Relation Detection Approach in the Internet of Things Mobile Information Systems |
author_facet |
Weiping Zhu Hongliang Lu Xiaohui Cui Jiannong Cao |
author_sort |
Weiping Zhu |
title |
A Distributed Relation Detection Approach in the Internet of Things |
title_short |
A Distributed Relation Detection Approach in the Internet of Things |
title_full |
A Distributed Relation Detection Approach in the Internet of Things |
title_fullStr |
A Distributed Relation Detection Approach in the Internet of Things |
title_full_unstemmed |
A Distributed Relation Detection Approach in the Internet of Things |
title_sort |
distributed relation detection approach in the internet of things |
publisher |
Hindawi Limited |
series |
Mobile Information Systems |
issn |
1574-017X 1875-905X |
publishDate |
2017-01-01 |
description |
In the Internet of Things, it is important to detect the various relations among objects for mining useful knowledge. Existing works on relation detection are based on centralized processing, which is not suitable for the Internet of Things owing to the unavailability of a server, one-point failure, computation bottleneck, and moving of objects. In this paper, we propose a distributed approach to detect relations among objects. We first build a system model for this problem that supports generic forms of relations and both physical time and logical time. Based on this, we design the Distributed Relation Detection Approach (DRDA), which utilizes a distributed spanning tree to detect relations using in-network processing. DRDA can coordinate the distributed tree-building process of objects and automatically change the depth of the routing tree to a proper value. Optimization among multiple relation detection tasks is also considered. Extensive simulations were performed and the results show that the proposed approach outperforms existing approaches in terms of the energy consumption. |
url |
http://dx.doi.org/10.1155/2017/4789814 |
work_keys_str_mv |
AT weipingzhu adistributedrelationdetectionapproachintheinternetofthings AT honglianglu adistributedrelationdetectionapproachintheinternetofthings AT xiaohuicui adistributedrelationdetectionapproachintheinternetofthings AT jiannongcao adistributedrelationdetectionapproachintheinternetofthings AT weipingzhu distributedrelationdetectionapproachintheinternetofthings AT honglianglu distributedrelationdetectionapproachintheinternetofthings AT xiaohuicui distributedrelationdetectionapproachintheinternetofthings AT jiannongcao distributedrelationdetectionapproachintheinternetofthings |
_version_ |
1721342403418259456 |