The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
A rede de sensores sem fio (RSSF) é uma abordagem promissora para uma variedade de aplicações. O protocolo de roteamento para RSSFs é muito desafiador porque deve ser simples, escalável, energeticamente eficiente e robusto para lidar com um grande número de nós, e também autoconfigurável para falhas de nós e mudanças na topologia da rede de forma dinâmica. Recentemente, muitos pesquisadores têm se concentrado no desenvolvimento de protocolos hierárquicos para RSSFs. No entanto, a maioria dos protocolos na literatura não pode ser bem dimensionada para grandes redes de sensores e é difícil de aplicar em aplicações reais. Neste artigo, propomos um novo protocolo de roteamento adaptativo para RSSFs chamado ARPEES. As principais características de projeto do método proposto são: eficiência energética, agrupamento dinâmico de eventos e retransmissão multi-hop, considerando a relação de compensação entre a energia residual disponível dos nós retransmissores e a distância do nó retransmissor à estação base. Com uma abordagem de tráfego aéreo distribuído e leve, distribuímos o consumo de energia necessário para agregar dados e retransmiti-los para diferentes nós sensores para prolongar a vida útil de toda a rede. Neste método, consideramos energia e distância como os parâmetros na função proposta para selecionar os nós retransmissores e, finalmente, selecionar o caminho ideal entre os chefes do cluster, os nós retransmissores e a estação base. Os resultados da simulação mostram que nosso protocolo de roteamento atinge melhor desempenho do que outros protocolos de roteamento anteriores.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Vinh TRAN QUANG, Takumi MIYOSHI, "Adaptive Routing Protocol with Energy Efficiency and Event Clustering for Wireless Sensor Networks" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 9, pp. 2795-2805, September 2008, doi: 10.1093/ietcom/e91-b.9.2795.
Abstract: Wireless sensor network (WSN) is a promising approach for a variety of applications. Routing protocol for WSNs is very challenging because it should be simple, scalable, energy-efficient, and robust to deal with a very large number of nodes, and also self-configurable to node failures and changes of the network topology dynamically. Recently, many researchers have focused on developing hierarchical protocols for WSNs. However, most protocols in the literatures cannot scale well to large sensor networks and difficult to apply in the real applications. In this paper, we propose a novel adaptive routing protocol for WSNs called ARPEES. The main design features of the proposed method are: energy efficiency, dynamic event clustering, and multi-hop relay considering the trade-off relationship between the residual energy available of relay nodes and distance from the relay node to the base station. With a distributed and light overhead traffic approach, we spread energy consumption required for aggregating data and relaying them to different sensor nodes to prolong the lifetime of the whole network. In this method, we consider energy and distance as the parameters in the proposed function to select relay nodes and finally select the optimal path among cluster heads, relay nodes and the base station. The simulation results show that our routing protocol achieves better performance than other previous routing protocols.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.9.2795/_p
Copiar
@ARTICLE{e91-b_9_2795,
author={Vinh TRAN QUANG, Takumi MIYOSHI, },
journal={IEICE TRANSACTIONS on Communications},
title={Adaptive Routing Protocol with Energy Efficiency and Event Clustering for Wireless Sensor Networks},
year={2008},
volume={E91-B},
number={9},
pages={2795-2805},
abstract={Wireless sensor network (WSN) is a promising approach for a variety of applications. Routing protocol for WSNs is very challenging because it should be simple, scalable, energy-efficient, and robust to deal with a very large number of nodes, and also self-configurable to node failures and changes of the network topology dynamically. Recently, many researchers have focused on developing hierarchical protocols for WSNs. However, most protocols in the literatures cannot scale well to large sensor networks and difficult to apply in the real applications. In this paper, we propose a novel adaptive routing protocol for WSNs called ARPEES. The main design features of the proposed method are: energy efficiency, dynamic event clustering, and multi-hop relay considering the trade-off relationship between the residual energy available of relay nodes and distance from the relay node to the base station. With a distributed and light overhead traffic approach, we spread energy consumption required for aggregating data and relaying them to different sensor nodes to prolong the lifetime of the whole network. In this method, we consider energy and distance as the parameters in the proposed function to select relay nodes and finally select the optimal path among cluster heads, relay nodes and the base station. The simulation results show that our routing protocol achieves better performance than other previous routing protocols.},
keywords={},
doi={10.1093/ietcom/e91-b.9.2795},
ISSN={1745-1345},
month={September},}
Copiar
TY - JOUR
TI - Adaptive Routing Protocol with Energy Efficiency and Event Clustering for Wireless Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2795
EP - 2805
AU - Vinh TRAN QUANG
AU - Takumi MIYOSHI
PY - 2008
DO - 10.1093/ietcom/e91-b.9.2795
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2008
AB - Wireless sensor network (WSN) is a promising approach for a variety of applications. Routing protocol for WSNs is very challenging because it should be simple, scalable, energy-efficient, and robust to deal with a very large number of nodes, and also self-configurable to node failures and changes of the network topology dynamically. Recently, many researchers have focused on developing hierarchical protocols for WSNs. However, most protocols in the literatures cannot scale well to large sensor networks and difficult to apply in the real applications. In this paper, we propose a novel adaptive routing protocol for WSNs called ARPEES. The main design features of the proposed method are: energy efficiency, dynamic event clustering, and multi-hop relay considering the trade-off relationship between the residual energy available of relay nodes and distance from the relay node to the base station. With a distributed and light overhead traffic approach, we spread energy consumption required for aggregating data and relaying them to different sensor nodes to prolong the lifetime of the whole network. In this method, we consider energy and distance as the parameters in the proposed function to select relay nodes and finally select the optimal path among cluster heads, relay nodes and the base station. The simulation results show that our routing protocol achieves better performance than other previous routing protocols.
ER -