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
Em redes ad hoc sem fio estáticas, como redes mesh sem fio e redes de sensores sem fio, as técnicas de roteamento de múltiplos caminhos são muito úteis para melhorar o atraso, a taxa de transferência e o balanceamento de carga de ponta a ponta, em comparação com técnicas de roteamento de caminho único. Ao determinar múltiplos caminhos, no entanto, os protocolos de roteamento multicaminhos devem resolver o conhecido problema de acoplamento de rotas que resulta de uma proximidade geográfica de rotas adjacentes e que dificulta o ganho de desempenho. Embora muitos protocolos de roteamento multicaminho tenham sido propostos, a maioria deles se concentrava na obtenção de multicaminhos disjuntos de nós ou enlaces. Para resolver o problema de acoplamento de rotas, foram propostos alguns protocolos de roteamento multipercurso utilizando a propriedade de disjunção de zona. No entanto, eles sofrem com uma sobrecarga de tráfego de controle ou requerem equipamentos adicionais, como antena direcional. Este artigo propõe, portanto, um novo protocolo de roteamento multicaminho, baseado em informações geográficas com baixo overhead, denominado protocolo de roteamento multicaminho disjunto por zona tridirecional (3DMRP). O 3DMRP pesquisa até três caminhos disjuntos de zona usando duas técnicas: 3) encaminhamento ganancioso e 1) escuta RREP. Um caminho primário e dois caminhos secundários são obtidos através de encaminhamento ganancioso, a fim de reduzir a sobrecarga de controle, e esses caminhos secundários são encontrados evitando a zona de sobreescuta RREP criada durante a aquisição do caminho primário. Em particular, duas versões do 2DMRP são introduzidas para evitar a zona de escuta RREQ. Através de simulações do ns-3, o 2DMRP é avaliado para verificar se ele alcança melhorias de desempenho em termos de rendimento e sobrecarga de controle.
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
Dongseung SHIN, Dongkyun KIM, "3DMRP: 3-Directional Zone-Disjoint Multipath Routing Protocol" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 4, pp. 620-629, April 2009, doi: 10.1587/transinf.E92.D.620.
Abstract: In static wireless ad hoc networks such as wireless mesh networks and wireless sensor networks, multipath routing techniques are very useful for improving end-to-end delay, throughput, and load balancing, as compared to single-path routing techniques. When determining multiple paths, however, multipath routing protocols should address the well-known route coupling problem that results from a geographic proximity of adjacent routes and that hampers performance gain. Although a lot of multipath routing protocols have been proposed, most of them focused on obtaining node or link-disjoint multipaths. In order to address the route coupling problem, some multipath routing protocols utilizing zone-disjointness property were proposed. However, they suffer from an overhead of control traffic or require additional equipment such as directional antenna. This paper therefore proposes a novel multipath routing protocol, based on geographical information with low overhead, called 3-directional zone-disjoint multipath routing protocol (3DMRP). 3DMRP searches up to three zone-disjoint paths by using two techniques: 1) greedy forwarding, and 2) RREP-overhearing. One primary and two secondary paths are obtained via greedy forwarding in order to reduce control overhead, and these secondary paths are found by avoiding the RREP overhearing zone created during the primary path acquisition. In particular, two versions of 3DMRP are introduced in order to avoid the RREQ-overhearing zone. Through ns-2 simulations, 3DMRP is evaluated to verify that it achieves performance improvements in terms of throughput and control overhead.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.620/_p
Copiar
@ARTICLE{e92-d_4_620,
author={Dongseung SHIN, Dongkyun KIM, },
journal={IEICE TRANSACTIONS on Information},
title={3DMRP: 3-Directional Zone-Disjoint Multipath Routing Protocol},
year={2009},
volume={E92-D},
number={4},
pages={620-629},
abstract={In static wireless ad hoc networks such as wireless mesh networks and wireless sensor networks, multipath routing techniques are very useful for improving end-to-end delay, throughput, and load balancing, as compared to single-path routing techniques. When determining multiple paths, however, multipath routing protocols should address the well-known route coupling problem that results from a geographic proximity of adjacent routes and that hampers performance gain. Although a lot of multipath routing protocols have been proposed, most of them focused on obtaining node or link-disjoint multipaths. In order to address the route coupling problem, some multipath routing protocols utilizing zone-disjointness property were proposed. However, they suffer from an overhead of control traffic or require additional equipment such as directional antenna. This paper therefore proposes a novel multipath routing protocol, based on geographical information with low overhead, called 3-directional zone-disjoint multipath routing protocol (3DMRP). 3DMRP searches up to three zone-disjoint paths by using two techniques: 1) greedy forwarding, and 2) RREP-overhearing. One primary and two secondary paths are obtained via greedy forwarding in order to reduce control overhead, and these secondary paths are found by avoiding the RREP overhearing zone created during the primary path acquisition. In particular, two versions of 3DMRP are introduced in order to avoid the RREQ-overhearing zone. Through ns-2 simulations, 3DMRP is evaluated to verify that it achieves performance improvements in terms of throughput and control overhead.},
keywords={},
doi={10.1587/transinf.E92.D.620},
ISSN={1745-1361},
month={April},}
Copiar
TY - JOUR
TI - 3DMRP: 3-Directional Zone-Disjoint Multipath Routing Protocol
T2 - IEICE TRANSACTIONS on Information
SP - 620
EP - 629
AU - Dongseung SHIN
AU - Dongkyun KIM
PY - 2009
DO - 10.1587/transinf.E92.D.620
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 2009
AB - In static wireless ad hoc networks such as wireless mesh networks and wireless sensor networks, multipath routing techniques are very useful for improving end-to-end delay, throughput, and load balancing, as compared to single-path routing techniques. When determining multiple paths, however, multipath routing protocols should address the well-known route coupling problem that results from a geographic proximity of adjacent routes and that hampers performance gain. Although a lot of multipath routing protocols have been proposed, most of them focused on obtaining node or link-disjoint multipaths. In order to address the route coupling problem, some multipath routing protocols utilizing zone-disjointness property were proposed. However, they suffer from an overhead of control traffic or require additional equipment such as directional antenna. This paper therefore proposes a novel multipath routing protocol, based on geographical information with low overhead, called 3-directional zone-disjoint multipath routing protocol (3DMRP). 3DMRP searches up to three zone-disjoint paths by using two techniques: 1) greedy forwarding, and 2) RREP-overhearing. One primary and two secondary paths are obtained via greedy forwarding in order to reduce control overhead, and these secondary paths are found by avoiding the RREP overhearing zone created during the primary path acquisition. In particular, two versions of 3DMRP are introduced in order to avoid the RREQ-overhearing zone. Through ns-2 simulations, 3DMRP is evaluated to verify that it achieves performance improvements in terms of throughput and control overhead.
ER -