Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/150998
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLi, Yanhongen_US
dc.contributor.authorZhang, Wangen_US
dc.contributor.authorZhu, Rongboen_US
dc.contributor.authorLi, Guohuien_US
dc.contributor.authorMa, Maodeen_US
dc.contributor.authorShu, Lihchyunen_US
dc.contributor.authorLuo, Changyinen_US
dc.date.accessioned2021-06-02T08:56:45Z-
dc.date.available2021-06-02T08:56:45Z-
dc.date.issued2018-
dc.identifier.citationLi, Y., Zhang, W., Zhu, R., Li, G., Ma, M., Shu, L. & Luo, C. (2018). Fog-based pub/sub index with Boolean expressions in the internet of industrial vehicles. IEEE Transactions On Industrial Informatics, 15(3), 1629-1642. https://dx.doi.org/10.1109/TII.2018.2868720en_US
dc.identifier.issn1551-3203en_US
dc.identifier.other0000-0002-2057-4648-
dc.identifier.other0000-0003-1746-7259-
dc.identifier.other0000-0003-1620-0560-
dc.identifier.other0000-0001-6984-1914-
dc.identifier.other0000-0003-1438-7018-
dc.identifier.other0000-0003-4125-2020-
dc.identifier.other0000-0003-4060-2420-
dc.identifier.urihttps://hdl.handle.net/10356/150998-
dc.description.abstractStructured publish/subscribe (pub/sub) is a promising technique adopted on kinds of vehicle applications of Internet of industrial vehicles (IoIV), which uses Boolean expressions to capture the items with thousands of different attributes, values and spatial locations, and then processes and analyzes the vast amounts of data collected to obtain users' interests. However, existing pub/sub work with Boolean expressions either ignores spatial requirement or focuses on Euclidean space. This paper aims to fill this gap by addressing the issue of fog-based spatial-textual pub/sub problem with Boolean expressions in IoIV. A novel hybrid index called RnetBE is proposed, which exquisitely organizes traffic network structure, Boolean expressions, and spatial information of subscriptions. And RnetBE can prune huge numbers of unqualified subscriptions based on both spatial constraint and Boolean expressions, thus achieving high efficiency in indexing and matching. Moreover, range-tree deletion and orderly group processing optimization techniques are proposed to save storage space and further improve the subscription pruning efficiency. Simulation results show that RnetBE and the proposed algorithm are efficient in terms of memory consumption and matching time.en_US
dc.language.isoenen_US
dc.relation.ispartofIEEE Transactions on Industrial Informaticsen_US
dc.rights© 2018 IEEE. All rights reserved.en_US
dc.subjectEngineering::Electrical and electronic engineeringen_US
dc.titleFog-based pub/sub index with Boolean expressions in the internet of industrial vehiclesen_US
dc.typeJournal Articleen
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US
dc.identifier.doi10.1109/TII.2018.2868720-
dc.identifier.scopus2-s2.0-85052849660-
dc.identifier.issue3en_US
dc.identifier.volume15en_US
dc.identifier.spage1629en_US
dc.identifier.epage1642en_US
dc.subject.keywordsBoolean Expressionen_US
dc.subject.keywordsFog Computingen_US
item.fulltextNo Fulltext-
item.grantfulltextnone-
Appears in Collections:EEE Journal Articles

Page view(s)

38
Updated on Oct 28, 2021

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.