Mostrar el registro sencillo del ítem
dc.contributor.author | García-González, Emmanuel | es_ES |
dc.contributor.author | Chimal-Eguía, Juan C. | es_ES |
dc.contributor.author | Rivero-Angeles, Mario E. | es_ES |
dc.contributor.author | Pla, Vicent | es_ES |
dc.date.accessioned | 2021-01-14T04:32:37Z | |
dc.date.available | 2021-01-14T04:32:37Z | |
dc.date.issued | 2019-11-19 | es_ES |
dc.identifier.issn | 1687-725X | es_ES |
dc.identifier.uri | http://hdl.handle.net/10251/158942 | |
dc.description.abstract | [EN] Wireless sensor networks (WSNs) have been extensively studied in the literature. However, in hostile environments where node connectivity is severely compromised, the system performance can be greatly affected. In this work, we consider such a hostile environment where sensor nodes cannot directly communicate to some neighboring nodes. Building on this, we propose a distributed data gathering scheme where data packets are stored in different nodes throughout the network instead to considering a single sink node. As such, if nodes are destroyed or damaged, some information can still be retrieved. To evaluate the performance of the system, we consider the properties of different graphs that describe the connections among nodes. It is shown that the degree distribution of the graph has an important impact on the performance of the system. A teletraffic analysis is developed to study the average buffer size and average packet delay. To this end, we propose a reference node approach, which entails an approximation for the mathematical modeling of these networks that effectively simplifies the analysis and approximates the overall performance of the system. | es_ES |
dc.description.sponsorship | The authors wish to thank the Consejo Nacional de Ciencia y Tecnologia (CONACyT), the Comision de Operacion y Fomento de Actividades Academicas, Instituto Politecnico Nacional (COFAA-IPN, project numbers 20196225 and 20196678), and the Estimulos al Desempeno de los Investigadores del Instituto Politecnico Nacional (EDI-IPN) for the support given for this work. The work of V. Pla was supported by Grant PGC2018-094151-B-I00 (MCIU/AEI/FEDER, UE). | es_ES |
dc.language | Inglés | es_ES |
dc.publisher | Hindawi Limited | es_ES |
dc.relation.ispartof | Journal of Sensors | es_ES |
dc.rights | Reconocimiento (by) | es_ES |
dc.subject.classification | INGENIERIA TELEMATICA | es_ES |
dc.title | On the Use of Graphs for Node Connectivity in Wireless Sensor Networks for Hostile Environments | es_ES |
dc.type | Artículo | es_ES |
dc.identifier.doi | 10.1155/2019/7409329 | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/COFAA//20196225/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/COFAA//20196678/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PGC2018-094151-B-I00/ES/SLICING DINAMICO EN REDES DE ACCESO RADIO 5G/ | es_ES |
dc.rights.accessRights | Abierto | es_ES |
dc.contributor.affiliation | Universitat Politècnica de València. Departamento de Comunicaciones - Departament de Comunicacions | es_ES |
dc.description.bibliographicCitation | García-González, E.; Chimal-Eguía, JC.; Rivero-Angeles, ME.; Pla, V. (2019). On the Use of Graphs for Node Connectivity in Wireless Sensor Networks for Hostile Environments. Journal of Sensors. 2019:1-22. https://doi.org/10.1155/2019/7409329 | es_ES |
dc.description.accrualMethod | S | es_ES |
dc.relation.publisherversion | https://doi.org/10.1155/2019/7409329 | es_ES |
dc.description.upvformatpinicio | 1 | es_ES |
dc.description.upvformatpfin | 22 | es_ES |
dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
dc.description.volume | 2019 | es_ES |
dc.relation.pasarela | S\398952 | es_ES |
dc.contributor.funder | Agencia Estatal de Investigación | es_ES |
dc.contributor.funder | European Regional Development Fund | es_ES |
dc.contributor.funder | Instituto Politécnico Nacional, México | es_ES |
dc.contributor.funder | Consejo Nacional de Ciencia y Tecnología, México | es_ES |
dc.contributor.funder | Ministerio de Ciencia, Innovación y Universidades | es_ES |
dc.contributor.funder | Comisión de Operación y Fomento de Actividades Académicas, Instituto Politécnico Nacional | es_ES |
dc.description.references | Eren, T. (2017). The effects of random geometric graph structure and clustering on localizability of sensor networks. International Journal of Distributed Sensor Networks, 13(12), 155014771774889. doi:10.1177/1550147717748898 | es_ES |
dc.description.references | Clauset, A., Shalizi, C. R., & Newman, M. E. J. (2009). Power-Law Distributions in Empirical Data. SIAM Review, 51(4), 661-703. doi:10.1137/070710111 | es_ES |
dc.description.references | Hakimi, S. L. (1962). On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I. Journal of the Society for Industrial and Applied Mathematics, 10(3), 496-506. doi:10.1137/0110037 | es_ES |