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 sem fio multi-hop, a qualidade da comunicação depende da rota desde a origem até o destino. Neste artigo, consideramos uma rede sem fio multi-hop unidimensional onde os nós são distribuídos aleatoriamente e analisamos teoricamente a relação entre a qualidade da comunicação e a política de roteamento usando uma medida chamada Expected Transmission Count (ETX), que é o número previsto de dados transmissões necessárias para enviar um pacote por esse enlace, incluindo retransmissões. Primeiro, analisamos teoricamente o comprimento médio dos links, o número médio de saltos e o ETX médio da rota, que é a soma dos ETXs de todos os links em uma rota, do Longest Path Routing (LPR) e do Shortest Path Routing ( SPR). Em segundo lugar, propomos o Roteamento Ajustável (AR), uma aproximação ao Roteamento Ótimo (OR), que minimiza o ETX da rota. Teoricamente calculamos os valores característicos de AR acima. Também calculamos teoricamente um limite inferior da rota média ETX de OR. Comparamos LPR, SPR e OR usando os resultados das análises e mostramos diferenças entre esses algoritmos na rota ETX.
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
Kazuyuki MIYAKITA, Keisuke NAKANO, Masakazu SENGOKU, Shoji SHINODA, "Theoretical Analysis of Route Expected Transmission Count in Multi-Hop Wireless Networks" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 8, pp. 2533-2544, August 2008, doi: 10.1093/ietcom/e91-b.8.2533.
Abstract: In multi-hop wireless networks, communication quality depends on the route from a source to a destination. In this paper, we consider a one-dimensional multi-hop wireless network where nodes are distributed randomly and theoretically analyze the relation between communication quality and routing policy using a measure called the Expected Transmission Count (ETX), which is the predicted number of data transmissions required to send a packet over that link, including retransmissions. First, we theoretically analyze the mean length of links, the mean number of hops, and the mean route ETX, which is the sum of the ETXs of all links in a route, of Longest Path Routing (LPR), and Shortest Path Routing (SPR). Second, we propose Adjustable Routing (AR), an approximation to Optimum Routing (OR), which minimizes route ETX. We theoretically compute the above characteristic values of AR. We also theoretically compute a lower bound of the mean route ETX of OR. We compare LPR, SPR, and OR using the results of analyses and show differences between these algorithms in the route ETX.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.8.2533/_p
Copiar
@ARTICLE{e91-b_8_2533,
author={Kazuyuki MIYAKITA, Keisuke NAKANO, Masakazu SENGOKU, Shoji SHINODA, },
journal={IEICE TRANSACTIONS on Communications},
title={Theoretical Analysis of Route Expected Transmission Count in Multi-Hop Wireless Networks},
year={2008},
volume={E91-B},
number={8},
pages={2533-2544},
abstract={In multi-hop wireless networks, communication quality depends on the route from a source to a destination. In this paper, we consider a one-dimensional multi-hop wireless network where nodes are distributed randomly and theoretically analyze the relation between communication quality and routing policy using a measure called the Expected Transmission Count (ETX), which is the predicted number of data transmissions required to send a packet over that link, including retransmissions. First, we theoretically analyze the mean length of links, the mean number of hops, and the mean route ETX, which is the sum of the ETXs of all links in a route, of Longest Path Routing (LPR), and Shortest Path Routing (SPR). Second, we propose Adjustable Routing (AR), an approximation to Optimum Routing (OR), which minimizes route ETX. We theoretically compute the above characteristic values of AR. We also theoretically compute a lower bound of the mean route ETX of OR. We compare LPR, SPR, and OR using the results of analyses and show differences between these algorithms in the route ETX.},
keywords={},
doi={10.1093/ietcom/e91-b.8.2533},
ISSN={1745-1345},
month={August},}
Copiar
TY - JOUR
TI - Theoretical Analysis of Route Expected Transmission Count in Multi-Hop Wireless Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2533
EP - 2544
AU - Kazuyuki MIYAKITA
AU - Keisuke NAKANO
AU - Masakazu SENGOKU
AU - Shoji SHINODA
PY - 2008
DO - 10.1093/ietcom/e91-b.8.2533
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2008
AB - In multi-hop wireless networks, communication quality depends on the route from a source to a destination. In this paper, we consider a one-dimensional multi-hop wireless network where nodes are distributed randomly and theoretically analyze the relation between communication quality and routing policy using a measure called the Expected Transmission Count (ETX), which is the predicted number of data transmissions required to send a packet over that link, including retransmissions. First, we theoretically analyze the mean length of links, the mean number of hops, and the mean route ETX, which is the sum of the ETXs of all links in a route, of Longest Path Routing (LPR), and Shortest Path Routing (SPR). Second, we propose Adjustable Routing (AR), an approximation to Optimum Routing (OR), which minimizes route ETX. We theoretically compute the above characteristic values of AR. We also theoretically compute a lower bound of the mean route ETX of OR. We compare LPR, SPR, and OR using the results of analyses and show differences between these algorithms in the route ETX.
ER -