Geographic routing and hole bypass using long range sinks for wireless sensor networks
Greedy Forward is a well-known technique used by most of the geographic routing algorithms to forward packets to the node that is geographically closer to the destination node. It is the simplest form of the proposed geographic routing algorithms and it is particularly attractive in sensor networks...
| Autor principal: | Lima, Moysés M. |
|---|---|
| Outros Autores: | Oliveira, Horácio de B.F., Guidoni, Daniel Ludovico, Loureiro, António Alfredo Ferreira |
| Grau: | Artigo |
| Idioma: | English |
| Publicado em: |
Ad Hoc Networks
2020
|
| Assuntos: | |
| Acesso em linha: |
https://repositorio.inpa.gov.br/handle/1/17013 |
| id |
oai:repositorio:1-17013 |
|---|---|
| recordtype |
dspace |
| spelling |
oai:repositorio:1-17013 Geographic routing and hole bypass using long range sinks for wireless sensor networks Lima, Moysés M. Oliveira, Horácio de B.F. Guidoni, Daniel Ludovico Loureiro, António Alfredo Ferreira Sensor Nodes Wireless Sensor Networks Communication Range Data Aggregation Destination Nodes Geographic Routing Greedy Forwarding Hole Bypass Local Minimums Received Signal Strength Indicators Network Routing Greedy Forward is a well-known technique used by most of the geographic routing algorithms to forward packets to the node that is geographically closer to the destination node. It is the simplest form of the proposed geographic routing algorithms and it is particularly attractive in sensor networks by bringing additional advantages such scalability, dynamism, and high delivery rates. However, in the presence of a hole (or voids), greedy forward techniques tend to fail. Thus, a hole bypass solution needs to be used in order to route packets to a node where greedy forwarding process can be resumed. In this work, we propose a new geographic routing algorithm called REACT that can bypass routing holes and create routing paths toward the sink node. Our solution takes advantage of the higher communication range of the sink node and the Received Signal Strength Indicator (RSSI) to enable the construction of routing paths by self-electing the next hop at each step while also performing data aggregation. No extra packets are required to configure the routing task. Our results clearly show an efficient data delivery achieved by the proposed algorithm in scenarios with routing holes with all the benefits of a greedy forwarding technique. © 2017 Elsevier B.V. 2020-06-15T21:38:05Z 2020-06-15T21:38:05Z 2017 Artigo https://repositorio.inpa.gov.br/handle/1/17013 10.1016/j.adhoc.2017.08.010 en Volume 67, Pags. 1-10 Restrito Ad Hoc Networks |
| institution |
Instituto Nacional de Pesquisas da Amazônia - Repositório Institucional |
| collection |
INPA-RI |
| language |
English |
| topic |
Sensor Nodes Wireless Sensor Networks Communication Range Data Aggregation Destination Nodes Geographic Routing Greedy Forwarding Hole Bypass Local Minimums Received Signal Strength Indicators Network Routing |
| spellingShingle |
Sensor Nodes Wireless Sensor Networks Communication Range Data Aggregation Destination Nodes Geographic Routing Greedy Forwarding Hole Bypass Local Minimums Received Signal Strength Indicators Network Routing Lima, Moysés M. Geographic routing and hole bypass using long range sinks for wireless sensor networks |
| topic_facet |
Sensor Nodes Wireless Sensor Networks Communication Range Data Aggregation Destination Nodes Geographic Routing Greedy Forwarding Hole Bypass Local Minimums Received Signal Strength Indicators Network Routing |
| description |
Greedy Forward is a well-known technique used by most of the geographic routing algorithms to forward packets to the node that is geographically closer to the destination node. It is the simplest form of the proposed geographic routing algorithms and it is particularly attractive in sensor networks by bringing additional advantages such scalability, dynamism, and high delivery rates. However, in the presence of a hole (or voids), greedy forward techniques tend to fail. Thus, a hole bypass solution needs to be used in order to route packets to a node where greedy forwarding process can be resumed. In this work, we propose a new geographic routing algorithm called REACT that can bypass routing holes and create routing paths toward the sink node. Our solution takes advantage of the higher communication range of the sink node and the Received Signal Strength Indicator (RSSI) to enable the construction of routing paths by self-electing the next hop at each step while also performing data aggregation. No extra packets are required to configure the routing task. Our results clearly show an efficient data delivery achieved by the proposed algorithm in scenarios with routing holes with all the benefits of a greedy forwarding technique. © 2017 Elsevier B.V. |
| format |
Artigo |
| author |
Lima, Moysés M. |
| author2 |
Oliveira, Horácio de B.F. Guidoni, Daniel Ludovico Loureiro, António Alfredo Ferreira |
| author2Str |
Oliveira, Horácio de B.F. Guidoni, Daniel Ludovico Loureiro, António Alfredo Ferreira |
| title |
Geographic routing and hole bypass using long range sinks for wireless sensor networks |
| title_short |
Geographic routing and hole bypass using long range sinks for wireless sensor networks |
| title_full |
Geographic routing and hole bypass using long range sinks for wireless sensor networks |
| title_fullStr |
Geographic routing and hole bypass using long range sinks for wireless sensor networks |
| title_full_unstemmed |
Geographic routing and hole bypass using long range sinks for wireless sensor networks |
| title_sort |
geographic routing and hole bypass using long range sinks for wireless sensor networks |
| publisher |
Ad Hoc Networks |
| publishDate |
2020 |
| url |
https://repositorio.inpa.gov.br/handle/1/17013 |
| _version_ |
1787144340219363328 |
| score |
11.755432 |