Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/76470
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorZhu, WP-
dc.creatorLu, HL-
dc.creatorCui, XH-
dc.creatorCao, JN-
dc.date.accessioned2018-05-10T02:56:02Z-
dc.date.available2018-05-10T02:56:02Z-
dc.identifier.issn1574-017Xen_US
dc.identifier.urihttp://hdl.handle.net/10397/76470-
dc.language.isoenen_US
dc.publisherHindawi Publishing Corporationen_US
dc.rightsCopyright © 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.rightsThe 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.titleA distributed relation detection approach in the internet of thingsen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.doi10.1155/2017/4789814en_US
dcterms.abstractIn 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.accessRightsopen accessen_US
dcterms.bibliographicCitationMobile information systems, 2017, 4789814-
dcterms.isPartOfMobile information systems-
dcterms.issued2017-
dc.identifier.isiWOS:000412169800001-
dc.identifier.scopus2-s2.0-85031922648-
dc.identifier.eissn1875-905Xen_US
dc.identifier.artn4789814en_US
dc.identifier.rosgroupid2017001618-
dc.description.ros2017-2018 > Academic research: refereed > Publication in refereed journal-
dc.description.validate201811_a bcma; 201805 bcrcen_US
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Zhu_Distributed_relation_detection.pdf1.91 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

120
Last Week
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
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.