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, revelamos tráfego de controle redundante no protocolo de roteamento de estado de link otimizado (OLSR) para MANET. Mensagens de controle de topologia (TC), que ocupam uma parte do tráfego de controle no OLSR, são usadas para trocar informações de topologia com outros nós. As mensagens TC são geradas e encaminhadas apenas por nós que foram selecionados como relés multiponto (MPRs) por pelo menos um nó vizinho. Esses nós selecionados como MPRs são chamados de remetentes de mensagens TC nesta carta. Uma das soluções para reduzir o número de mensagens TC é reduzir o número de remetentes de mensagens TC. Descrevemos um algoritmo não distribuído para minimizar o número de remetentes de mensagens TC. Através da simulação de cenários de nós estáticos, mostramos que 18% a 37% dos remetentes de mensagens TC em OLSR baseado em RFC são redundantes. Ao eliminar remetentes redundantes de mensagens TC, o número de pacotes TC, cada um contendo uma ou mais mensagens TC, também é reduzido de 19% para 46%. Mostramos também que cenários de alta densidade têm mais redundância do que cenários de baixa densidade. Esta observação pode ajudar a considerar uma seleção cooperativa de MPR em OLSR.
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
Kenji YAMADA, Tsuyoshi ITOKAWA, Teruaki KITASUKA, Masayoshi ARITSUGI, "Redundant TC Message Senders in OLSR" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 12, pp. 3269-3272, December 2010, doi: 10.1587/transinf.E93.D.3269.
Abstract: In this letter, we reveal redundant control traffic in the optimized link state routing protocol (OLSR) for MANET. Topology control (TC) messages, which occupy a part of control traffic in OLSR, are used to exchange topology information with other nodes. TC messages are generated and forwarded by only nodes that have been selected as multipoint relays (MPRs) by at least one neighbor node. These nodes selected as MPRs are called TC message senders in this letter. One of solutions to reduce the number of TC messages is to reduce the number of TC message senders. We describe a non-distributed algorithm to minimize the number of TC message senders. Through simulation of static-node scenarios, we show 18% to 37% of TC message senders in RFC-based OLSR are redundant. By eliminating redundant TC message senders, the number of TC packets, each of which contains one or more TC messages, is also reduced from 19% to 46%. We also show that high density scenarios have more redundancy than low density scenarios. This observation can help to consider a cooperative MPR selection in OLSR.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.3269/_p
Copiar
@ARTICLE{e93-d_12_3269,
author={Kenji YAMADA, Tsuyoshi ITOKAWA, Teruaki KITASUKA, Masayoshi ARITSUGI, },
journal={IEICE TRANSACTIONS on Information},
title={Redundant TC Message Senders in OLSR},
year={2010},
volume={E93-D},
number={12},
pages={3269-3272},
abstract={In this letter, we reveal redundant control traffic in the optimized link state routing protocol (OLSR) for MANET. Topology control (TC) messages, which occupy a part of control traffic in OLSR, are used to exchange topology information with other nodes. TC messages are generated and forwarded by only nodes that have been selected as multipoint relays (MPRs) by at least one neighbor node. These nodes selected as MPRs are called TC message senders in this letter. One of solutions to reduce the number of TC messages is to reduce the number of TC message senders. We describe a non-distributed algorithm to minimize the number of TC message senders. Through simulation of static-node scenarios, we show 18% to 37% of TC message senders in RFC-based OLSR are redundant. By eliminating redundant TC message senders, the number of TC packets, each of which contains one or more TC messages, is also reduced from 19% to 46%. We also show that high density scenarios have more redundancy than low density scenarios. This observation can help to consider a cooperative MPR selection in OLSR.},
keywords={},
doi={10.1587/transinf.E93.D.3269},
ISSN={1745-1361},
month={December},}
Copiar
TY - JOUR
TI - Redundant TC Message Senders in OLSR
T2 - IEICE TRANSACTIONS on Information
SP - 3269
EP - 3272
AU - Kenji YAMADA
AU - Tsuyoshi ITOKAWA
AU - Teruaki KITASUKA
AU - Masayoshi ARITSUGI
PY - 2010
DO - 10.1587/transinf.E93.D.3269
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E93-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2010
AB - In this letter, we reveal redundant control traffic in the optimized link state routing protocol (OLSR) for MANET. Topology control (TC) messages, which occupy a part of control traffic in OLSR, are used to exchange topology information with other nodes. TC messages are generated and forwarded by only nodes that have been selected as multipoint relays (MPRs) by at least one neighbor node. These nodes selected as MPRs are called TC message senders in this letter. One of solutions to reduce the number of TC messages is to reduce the number of TC message senders. We describe a non-distributed algorithm to minimize the number of TC message senders. Through simulation of static-node scenarios, we show 18% to 37% of TC message senders in RFC-based OLSR are redundant. By eliminating redundant TC message senders, the number of TC packets, each of which contains one or more TC messages, is also reduced from 19% to 46%. We also show that high density scenarios have more redundancy than low density scenarios. This observation can help to consider a cooperative MPR selection in OLSR.
ER -