A Novel Shortcut Addition Algorithm With Particle Swarm for Multisink Internet of Things

dc.contributor.affiliationDepartamento de Comunicaciones
dc.contributor.affiliationEscuela Politécnica Superior de Gandia
dc.contributor.authorQiu, Tiees_ES
dc.contributor.authorLi, Bolunes_ES
dc.contributor.authorZhou, Xiaoboes_ES
dc.contributor.authorSong, Houbinges_ES
dc.contributor.authorLee, Ivanes_ES
dc.contributor.authorLloret, Jaime
dc.contributor.funderNational Natural Science Foundation of Chinaes_ES
dc.date.accessioned2022-11-03T10:38:31Z
dc.date.available2022-11-03T10:38:31Z
dc.date.issued2020-05es_ES
dc.description.abstract[EN] The Internet of Things integrates a large number of distributed nodes to collect or transmit data. When the network scale increases, individuals use multiple sink nodes to construct the network. This increases the complexity of the network and leads to significant challenges in terms of the existing methods with respect to the aspect of data forwarding and collection. In order to address the issue, this paper proposes a Shortcut Addition strategy based on the Particle Swarm algorithm (SAPS) for multisink network. It constructs a network topology with multiple sinks based on a small-world network. In the SAPS, we create a fitness function by combining the average path length and load of the sink node, to evaluate the quality of a particle. Subsequently, crossover and mutation are used to update the particles to determine the optimal solution. The simulation results indicate that the SAPS is superior both to the greedy model with small world and the load-balanced multigateway aware long link addition strategy in terms of the average path length, load balance, and number of added shortcuts.en_EN
dc.description.accrualMethodSes_ES
dc.description.bibliographicCitationQiu, T.; Li, B.; Zhou, X.; Song, H.; Lee, I.; Lloret, J. (2020). A Novel Shortcut Addition Algorithm With Particle Swarm for Multisink Internet of Things. IEEE Transactions on Industrial Informatics. 16(5):3566-3577. https://doi.org/10.1109/TII.2019.2925023es_ES
dc.description.issue5es_ES
dc.description.sponsorshipThis work was supported by the National Natural Science Foundation of China under Grant 61672131 and Grant 61702365. Paper no. TII-19-0511.es_ES
dc.description.upvformatpfin3577es_ES
dc.description.upvformatpinicio3566es_ES
dc.description.volume16es_ES
dc.identifier.doi10.1109/TII.2019.2925023es_ES
dc.identifier.issn1551-3203es_ES
dc.identifier.urihttps://riunet.upv.es/handle/10251/189086
dc.languageIngléses_ES
dc.publisherInstitute of Electrical and Electronics Engineerses_ES
dc.relation.ispartofIEEE Transactions on Industrial Informaticses_ES
dc.relation.pasarelaS\473541es_ES
dc.relation.projectIDinfo:eu-repo/grantAgreement/NSFC//61672131/es_ES
dc.relation.projectIDinfo:eu-repo/grantAgreement/NSFC//61702365/es_ES
dc.relation.publisherversionhttps://doi.org/10.1109/TII.2019.2925023es_ES
dc.relation.references10.1007/s11277-015-2518-8es_ES
dc.relation.references10.1145/3033288.3033325es_ES
dc.relation.references10.1108/10662241111104866es_ES
dc.relation.references10.1038/30918es_ES
dc.relation.references10.1016/S0375-9601(99)00757-4es_ES
dc.relation.references10.1109/ISCC.2012.6249385es_ES
dc.relation.references10.1109/TC.2013.12es_ES
dc.relation.references10.1007/978-3-642-13577-4_14es_ES
dc.relation.references10.1109/IIC.2015.7150766es_ES
dc.relation.references10.1109/ChiCC.2014.6896666es_ES
dc.relation.references10.1007/978-3-642-54174-2_16es_ES
dc.relation.references10.1016/j.adhoc.2012.02.016es_ES
dc.relation.references10.1109/CISS.2013.6552329es_ES
dc.relation.references10.1109/MC.2004.93es_ES
dc.relation.references10.1109/TVT.2018.2841348es_ES
dc.relation.references10.1109/CIRSYSSIM.2017.8023202es_ES
dc.relation.references10.1109/TII.2018.2799907es_ES
dc.relation.references10.1016/j.comnet.2017.05.022es_ES
dc.relation.references10.3390/s17040907es_ES
dc.relation.references10.1109/TII.2018.2872579es_ES
dc.relation.references10.1007/s11277-017-4335-8es_ES
dc.relation.references10.1109/TII.2015.2389656es_ES
dc.relation.references10.1155/2014/476253es_ES
dc.relation.references10.1016/j.comnet.2015.12.019es_ES
dc.relation.references10.1109/ANTS.2010.5983519es_ES
dc.relation.references10.1109/SUTC.2008.93es_ES
dc.relation.references10.1109/LCOMM.2003.818887es_ES
dc.relation.references10.1109/WiCOM.2012.6478470es_ES
dc.relation.references10.1016/j.comnet.2009.10.021es_ES
dc.rightsReserva de todos los derechoses_ES
dc.rights.accessRightsAbiertoes_ES
dc.subjectNetwork topologyes_ES
dc.subjectInformaticses_ES
dc.subjectParticle swarm optimizationes_ES
dc.subjectClustering algorithmses_ES
dc.subjectTopologyes_ES
dc.subjectData communicationes_ES
dc.subjectInternet of Thingses_ES
dc.subjectInternet of Things (IoT)es_ES
dc.subjectMultisink networkes_ES
dc.subjectParticle swarmes_ES
dc.subjectSmall-world networkes_ES
dc.subject.classificationINGENIERIA TELEMATICAes_ES
dc.titleA Novel Shortcut Addition Algorithm With Particle Swarm for Multisink Internet of Thingses_ES
dc.typeArtículoes_ES
dc.type.versioninfo:eu-repo/semantics/publishedVersiones_ES
dspace.entity.typePublication
person.identifier260345
person.identifier.orcid0000-0002-0862-0533
relation.isAuthorOfPublicatione6f912f7-e605-4217-ac55-555ebb925e03
relation.isAuthorOfPublication.latestForDiscoverye6f912f7-e605-4217-ac55-555ebb925e03
relation.isOrgUnitOfPublication02a0f2c5-c452-4e1d-a7d9-b731347d078c
relation.isOrgUnitOfPublication1db03441-9881-4e7e-a0a9-daca18341155
relation.isOrgUnitOfPublication.latestForDiscovery02a0f2c5-c452-4e1d-a7d9-b731347d078c
upv.uuid14706276-166e-4c2f-bcb6-4a8a6e2f607fes_ES

Archivos

Bloque original

Mostrando 1 - 2 de 2
Cargando...
Miniatura
Nombre:
QiuLiZhou - A Novel Shortcut Addition Algorithm With Particle Swarm for Multisink Internet of Thi....pdf
Tamaño:
483.76 KB
Formato:
Adobe Portable Document Format
Descripción:
Versión del Autor.
Cargando...
Miniatura
Nombre:
A_Novel_Shortcut_Addition_Algorithm_With_Particle_Swarm_for_Multisink_Internet_of_Things.pdf
Tamaño:
1.71 MB
Formato:
Adobe Portable Document Format
Descripción:
Versión editorial