Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/31296
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJabeur, Nafaa-
dc.contributor.authorYASAR, Ansar-
dc.contributor.authorShakshuki, Elhadi-
dc.contributor.authorHaddad, Hedi-
dc.date.accessioned2020-06-16T13:39:42Z-
dc.date.available2020-06-16T13:39:42Z-
dc.date.issued2020-
dc.date.submitted2020-06-02T14:16:12Z-
dc.identifier.citationFuture Generation Computer Systems-The International Journal of eScience, 107 , p. 736 -744-
dc.identifier.urihttp://hdl.handle.net/1942/31296-
dc.description.abstractBio-inspired algorithms have demonstrated effective capabilities to solve Wireless Sensor Network (WSN) challenges. As sensors represent a main component in the emergent domain of Internet of Things (IoT), these algorithms are expected to perform also well in this field while adapting to contextual changes and optimizing the use of the limited resources. In this paper, we propose a new firefly-based clustering approach for IoT applications. Our approach includes a micro clustering phase during which Real-World Things (RWTs) compete and self-organize into clusters. These clusters are then polished during a macro-clustering phase where they compete to integrate small neighboring clusters. We extend our approach to allow the IoT clusters to self-adapt by hiring and/or firing RWTs depending on ongoing events and their expected impact on the network and its current deployment area. Initial simulations are showing promising results where the number of clusters tends to stabilize independently from the density of the network and the various communication ranges of RWTs. (c) 2017 Elsevier B.V. All rights reserved.-
dc.language.isoen-
dc.publisherELSEVIER-
dc.subject.otherFirefly approach-
dc.subject.otherBio-inspired algorithm-
dc.subject.otherWireless Sensor Network-
dc.subject.otherInternet of Things-
dc.subject.otherMicro clustering-
dc.subject.otherMacro clustering-
dc.subject.otherAttractiveness-
dc.subject.otherHiring candidates-
dc.subject.otherFiring candidates-
dc.titleToward a bio-inspired adaptive spatial clustering approach for IoT applications-
dc.typeJournal Contribution-
dc.identifier.epage744-
dc.identifier.spage736-
dc.identifier.volume107-
local.format.pages9-
local.bibliographicCitation.jcatA1-
dc.description.notesJabeur, N (reprint author), German Univ Technol Oman Gutech, Comp Sci Dept, POB 1816, Muscat 130, Oman.-
dc.description.notesnafaa.jabeur@gutech.edu.om-
dc.description.otherJabeur, N (reprint author), German Univ Technol Oman Gutech, Comp Sci Dept, POB 1816, Muscat 130, Oman. nafaa.jabeur@gutech.edu.om-
local.publisher.placeRADARWEG 29, 1043 NX AMSTERDAM, NETHERLANDS-
local.type.refereedRefereed-
local.type.specifiedArticle-
dc.identifier.doi10.1016/j.future.2017.05.013-
dc.identifier.isiWOS:000527331800054-
dc.contributor.orcidYasar, Ansar-Ul-Haque/0000-0002-1542-2658; Shakshuki,-
dc.contributor.orcidElhadi/0000-0002-0226-075X-
dc.identifier.eissn-
dc.identifier.eissn1872-7115-
local.provider.typewosris-
local.uhasselt.uhpubyes-
item.fulltextWith Fulltext-
item.fullcitationJabeur, Nafaa; YASAR, Ansar; Shakshuki, Elhadi & Haddad, Hedi (2020) Toward a bio-inspired adaptive spatial clustering approach for IoT applications. In: Future Generation Computer Systems-The International Journal of eScience, 107 , p. 736 -744.-
item.accessRightsRestricted Access-
item.validationecoom 2021-
item.contributorJabeur, Nafaa-
item.contributorYASAR, Ansar-
item.contributorShakshuki, Elhadi-
item.contributorHaddad, Hedi-
crisitem.journal.issn0167-739X-
crisitem.journal.eissn1872-7115-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
jabeur.pdf
  Restricted Access
Published version2.96 MBAdobe PDFView/Open    Request a copy
Show simple item record

SCOPUSTM   
Citations

4
checked on Sep 5, 2020

WEB OF SCIENCETM
Citations

13
checked on May 8, 2024

Page view(s)

30
checked on Sep 7, 2022

Download(s)

4
checked on Sep 7, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.