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
Nesta carta, propomos três algoritmos para reduzir o congestionamento no encaminhamento ganancioso, que é um dos princípios comuns no roteamento geográfico. Os novos algoritmos utilizam informações de posição geográfica e métricas de congestionamento da rede para equilibrar o tráfego. Quando esses algoritmos são combinados com o conhecido protocolo GPSR [1], a taxa de entrega de pacotes é aprimorada pela redução do número de pacotes perdidos em um buffer. Além disso, o atraso ponta a ponta é reduzido contornando nós congestionados. Essas características são avaliadas e analisadas através de diversos resultados de simulação.
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
Ki-Il KIM, Min-Jung BAEK, Tae-Eung SUNG, "Load Balancing for Greedy Forwarding of Geographic Routing in Wireless Networks" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 8, pp. 2184-2187, August 2010, doi: 10.1587/transcom.E93.B.2184.
Abstract: In this letter, we propose three algorithms to reduce congestion for greedy forwarding, which is one of common principles in geographic routing. The new algorithms take geographic position information and network congestion metrics to balance traffic. When these algorithms are combined with well-known GPSR protocol [1], packet delivery ratio is enhanced by reducing number of lost packets in a buffer. In addition, end-to-end delay is reduced by bypassing congested nodes. These features are evaluated and analyzed through several simulation results.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.2184/_p
Copiar
@ARTICLE{e93-b_8_2184,
author={Ki-Il KIM, Min-Jung BAEK, Tae-Eung SUNG, },
journal={IEICE TRANSACTIONS on Communications},
title={Load Balancing for Greedy Forwarding of Geographic Routing in Wireless Networks},
year={2010},
volume={E93-B},
number={8},
pages={2184-2187},
abstract={In this letter, we propose three algorithms to reduce congestion for greedy forwarding, which is one of common principles in geographic routing. The new algorithms take geographic position information and network congestion metrics to balance traffic. When these algorithms are combined with well-known GPSR protocol [1], packet delivery ratio is enhanced by reducing number of lost packets in a buffer. In addition, end-to-end delay is reduced by bypassing congested nodes. These features are evaluated and analyzed through several simulation results.},
keywords={},
doi={10.1587/transcom.E93.B.2184},
ISSN={1745-1345},
month={August},}
Copiar
TY - JOUR
TI - Load Balancing for Greedy Forwarding of Geographic Routing in Wireless Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2184
EP - 2187
AU - Ki-Il KIM
AU - Min-Jung BAEK
AU - Tae-Eung SUNG
PY - 2010
DO - 10.1587/transcom.E93.B.2184
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2010
AB - In this letter, we propose three algorithms to reduce congestion for greedy forwarding, which is one of common principles in geographic routing. The new algorithms take geographic position information and network congestion metrics to balance traffic. When these algorithms are combined with well-known GPSR protocol [1], packet delivery ratio is enhanced by reducing number of lost packets in a buffer. In addition, end-to-end delay is reduced by bypassing congested nodes. These features are evaluated and analyzed through several simulation results.
ER -