A bounded heuristic for collection-based routing in wireless sensor networks
Autor(a) principal: | |
---|---|
Data de Publicação: | 2018 |
Outros Autores: | , , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10400.1/11968 |
Resumo: | Wireless sensor networks are used to monitor and control physical phenomena and to provide interaction between clients and the physical environment. Clients have been typically users or user applications, but next generation wireless sensor networks will also work in machine-to-machine scenarios where some nodes can be interested in some other nodes' data. These scenarios may run the risk of becoming overloaded with messaging, a pernicious fact in particular for constrained networks where both bandwidth and power supply are limited. Resource collections can be used in wireless sensor networks to improve bandwidth usage and to reduce energy consumption, reducing the overall number of notification packets and wrapping overhead, required for the delivery of sensor data. This article proposes a heuristic algorithm for the planning of both routing and collections, in wireless sensor networks. Results show that collections are always worthwhile, and that the heuristic is able to find feasible and cost effective solutions, approaching its lower bound. |
id |
RCAP_c8e1e00010d571064d947b2612755c29 |
---|---|
oai_identifier_str |
oai:sapientia.ualg.pt:10400.1/11968 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
A bounded heuristic for collection-based routing in wireless sensor networksWireless sensor networks are used to monitor and control physical phenomena and to provide interaction between clients and the physical environment. Clients have been typically users or user applications, but next generation wireless sensor networks will also work in machine-to-machine scenarios where some nodes can be interested in some other nodes' data. These scenarios may run the risk of becoming overloaded with messaging, a pernicious fact in particular for constrained networks where both bandwidth and power supply are limited. Resource collections can be used in wireless sensor networks to improve bandwidth usage and to reduce energy consumption, reducing the overall number of notification packets and wrapping overhead, required for the delivery of sensor data. This article proposes a heuristic algorithm for the planning of both routing and collections, in wireless sensor networks. Results show that collections are always worthwhile, and that the heuristic is able to find feasible and cost effective solutions, approaching its lower bound.FCT from Portugal within the CEOT research center [UID/MULTI/00631/2013]Ieee-Inst Electrical Electronics Engineers Inc.SapientiaSchütz, GabrielaCorreia, NoéliaMartins, JaimeMazayev, AndriyBarradas, Álvaro2018-12-07T14:58:20Z20182018-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.1/11968eng2169-353610.1109/ACCESS.2018.2841846info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-07-24T10:23:53Zoai:sapientia.ualg.pt:10400.1/11968Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T20:03:24.023912Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
A bounded heuristic for collection-based routing in wireless sensor networks |
title |
A bounded heuristic for collection-based routing in wireless sensor networks |
spellingShingle |
A bounded heuristic for collection-based routing in wireless sensor networks Schütz, Gabriela |
title_short |
A bounded heuristic for collection-based routing in wireless sensor networks |
title_full |
A bounded heuristic for collection-based routing in wireless sensor networks |
title_fullStr |
A bounded heuristic for collection-based routing in wireless sensor networks |
title_full_unstemmed |
A bounded heuristic for collection-based routing in wireless sensor networks |
title_sort |
A bounded heuristic for collection-based routing in wireless sensor networks |
author |
Schütz, Gabriela |
author_facet |
Schütz, Gabriela Correia, Noélia Martins, Jaime Mazayev, Andriy Barradas, Álvaro |
author_role |
author |
author2 |
Correia, Noélia Martins, Jaime Mazayev, Andriy Barradas, Álvaro |
author2_role |
author author author author |
dc.contributor.none.fl_str_mv |
Sapientia |
dc.contributor.author.fl_str_mv |
Schütz, Gabriela Correia, Noélia Martins, Jaime Mazayev, Andriy Barradas, Álvaro |
description |
Wireless sensor networks are used to monitor and control physical phenomena and to provide interaction between clients and the physical environment. Clients have been typically users or user applications, but next generation wireless sensor networks will also work in machine-to-machine scenarios where some nodes can be interested in some other nodes' data. These scenarios may run the risk of becoming overloaded with messaging, a pernicious fact in particular for constrained networks where both bandwidth and power supply are limited. Resource collections can be used in wireless sensor networks to improve bandwidth usage and to reduce energy consumption, reducing the overall number of notification packets and wrapping overhead, required for the delivery of sensor data. This article proposes a heuristic algorithm for the planning of both routing and collections, in wireless sensor networks. Results show that collections are always worthwhile, and that the heuristic is able to find feasible and cost effective solutions, approaching its lower bound. |
publishDate |
2018 |
dc.date.none.fl_str_mv |
2018-12-07T14:58:20Z 2018 2018-01-01T00:00:00Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10400.1/11968 |
url |
http://hdl.handle.net/10400.1/11968 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
2169-3536 10.1109/ACCESS.2018.2841846 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Ieee-Inst Electrical Electronics Engineers Inc. |
publisher.none.fl_str_mv |
Ieee-Inst Electrical Electronics Engineers Inc. |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799133268040220672 |