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
멀티홉 무선 네트워크에서 통신 품질은 여러 후보 경로 중에서 소스 노드와 대상 노드 사이의 경로 선택에 따라 달라집니다. 경로 선택이 통신 품질에 어떤 영향을 미치는지 탐색하는 것은 최상의 경로를 특성화하는 데 중요합니다. 이를 위해 [1]에서는 통신 품질의 척도로 ETX(예상 전송 횟수)를 사용하고 정적 XNUMX차원 무작위 다중 홉 네트워크에서 최적 경로의 ETX인 최소 경로 ETX를 이론적으로 특성화했습니다. . 본 논문에서는 정적 XNUMX차원 다중 홉 네트워크에서 최소 경로 ETX를 특성화합니다. 노드가 격자 구조로 위치하고 ETX 함수가 분석 단순화를 위한 세 가지 조건을 만족한다는 가정 하에 XNUMX차원 네트워크에서 최소 경로 ETX의 정확한 공식을 제공합니다. 이 공식은 세 가지 조건 중 두 가지 조건을 만족하지 않아도 최소 경로 ETX의 상한으로 사용될 수 있습니다. 우리는 시뮬레이션 결과와 비교하여 이 상한이 최소 경로 ETX에 가깝다는 것을 보여줍니다. 공식을 도출하기 전에 노드가 일정한 간격으로 위치하는 XNUMX차원 네트워크에 대한 공식도 제공합니다. 또한 수치 결과와 시뮬레이션 결과의 비교를 통해 노드 밀도가 클 경우 격자 네트워크의 최소 경로 ETX가 XNUMX차원 랜덤 네트워크의 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.
부
Kazuyuki MIYAKITA, Keisuke NAKANO, Yusuke MORIOKA, Masakazu SENGOKU, Shoji SHINODA, "Characterization of Minimum Route ETX in Multi-Hop Wireless Networks" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 3, pp. 745-754, March 2009, doi: 10.1587/transcom.E92.B.745.
Abstract: In multi-hop wireless networks, communication quality depends on the selection of a path between source and destination nodes from several candidate paths. Exploring how path selection affects communication quality is important to characterize the best path. To do this, in [1], we used expected transmission count (ETX) as a metric of communication quality and theoretically characterized minimum route ETX, which is the ETX of the best path, in a static one-dimensional random multi-hop network. In this paper, we characterize minimum route ETX in static two-dimensional multi-hop networks. We give the exact formula of minimum route ETX in a two-dimensional network, assuming that nodes are located with lattice structure and that the ETX function satisfies three conditions for simplifying analysis. This formula can be used as an upper bound of minimum route ETX without two of the three conditions. We show that this upper bound is close to minimum route ETX by comparing it with simulation results. Before deriving the formula, we also give the formula for a one-dimensional network where nodes are located at constant intervals. We also show that minimum route ETX in the lattice network is close to that in a two-dimensional random network if the node density is large, based on a comparison between the numerical and simulation results.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.745/_p
부
@ARTICLE{e92-b_3_745,
author={Kazuyuki MIYAKITA, Keisuke NAKANO, Yusuke MORIOKA, Masakazu SENGOKU, Shoji SHINODA, },
journal={IEICE TRANSACTIONS on Communications},
title={Characterization of Minimum Route ETX in Multi-Hop Wireless Networks},
year={2009},
volume={E92-B},
number={3},
pages={745-754},
abstract={In multi-hop wireless networks, communication quality depends on the selection of a path between source and destination nodes from several candidate paths. Exploring how path selection affects communication quality is important to characterize the best path. To do this, in [1], we used expected transmission count (ETX) as a metric of communication quality and theoretically characterized minimum route ETX, which is the ETX of the best path, in a static one-dimensional random multi-hop network. In this paper, we characterize minimum route ETX in static two-dimensional multi-hop networks. We give the exact formula of minimum route ETX in a two-dimensional network, assuming that nodes are located with lattice structure and that the ETX function satisfies three conditions for simplifying analysis. This formula can be used as an upper bound of minimum route ETX without two of the three conditions. We show that this upper bound is close to minimum route ETX by comparing it with simulation results. Before deriving the formula, we also give the formula for a one-dimensional network where nodes are located at constant intervals. We also show that minimum route ETX in the lattice network is close to that in a two-dimensional random network if the node density is large, based on a comparison between the numerical and simulation results.},
keywords={},
doi={10.1587/transcom.E92.B.745},
ISSN={1745-1345},
month={March},}
부
TY - JOUR
TI - Characterization of Minimum Route ETX in Multi-Hop Wireless Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 745
EP - 754
AU - Kazuyuki MIYAKITA
AU - Keisuke NAKANO
AU - Yusuke MORIOKA
AU - Masakazu SENGOKU
AU - Shoji SHINODA
PY - 2009
DO - 10.1587/transcom.E92.B.745
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2009
AB - In multi-hop wireless networks, communication quality depends on the selection of a path between source and destination nodes from several candidate paths. Exploring how path selection affects communication quality is important to characterize the best path. To do this, in [1], we used expected transmission count (ETX) as a metric of communication quality and theoretically characterized minimum route ETX, which is the ETX of the best path, in a static one-dimensional random multi-hop network. In this paper, we characterize minimum route ETX in static two-dimensional multi-hop networks. We give the exact formula of minimum route ETX in a two-dimensional network, assuming that nodes are located with lattice structure and that the ETX function satisfies three conditions for simplifying analysis. This formula can be used as an upper bound of minimum route ETX without two of the three conditions. We show that this upper bound is close to minimum route ETX by comparing it with simulation results. Before deriving the formula, we also give the formula for a one-dimensional network where nodes are located at constant intervals. We also show that minimum route ETX in the lattice network is close to that in a two-dimensional random network if the node density is large, based on a comparison between the numerical and simulation results.
ER -