Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/76470
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Computing | - |
dc.creator | Zhu, WP | - |
dc.creator | Lu, HL | - |
dc.creator | Cui, XH | - |
dc.creator | Cao, JN | - |
dc.date.accessioned | 2018-05-10T02:56:02Z | - |
dc.date.available | 2018-05-10T02:56:02Z | - |
dc.identifier.issn | 1574-017X | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/76470 | - |
dc.language.iso | en | en_US |
dc.publisher | Hindawi Publishing Corporation | en_US |
dc.rights | Copyright © 2017 Weiping Zhu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. | en_US |
dc.rights | The following article: Weiping Zhu, Hongliang Lu, Xiaohui Cui, and Jiannong Cao, “A Distributed Relation Detection Approach in the Internet of Things,” Mobile Information Systems, vol. 2017, Article ID 4789814, 14 pages, 2017 is available at https://doi.org/10.1155/2017/4789814. | en_US |
dc.title | A distributed relation detection approach in the internet of things | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.doi | 10.1155/2017/4789814 | en_US |
dcterms.abstract | 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 treebuilding 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. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Mobile information systems, 2017, 4789814 | - |
dcterms.isPartOf | Mobile information systems | - |
dcterms.issued | 2017 | - |
dc.identifier.isi | WOS:000412169800001 | - |
dc.identifier.scopus | 2-s2.0-85031922648 | - |
dc.identifier.eissn | 1875-905X | en_US |
dc.identifier.artn | 4789814 | en_US |
dc.identifier.rosgroupid | 2017001618 | - |
dc.description.ros | 2017-2018 > Academic research: refereed > Publication in refereed journal | - |
dc.description.validate | 201811_a bcma; 201805 bcrc | en_US |
dc.description.oa | Version of Record | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Zhu_Distributed_relation_detection.pdf | 1.91 MB | Adobe PDF | View/Open |
Page views
120
Last Week
2
2
Last month
Citations as of Mar 24, 2024
Downloads
100
Citations as of Mar 24, 2024
WEB OF SCIENCETM
Citations
1
Last Week
0
0
Last month
Citations as of Mar 28, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.