The search functionality is under construction.

The search functionality is under construction.

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.

- Publication
- IEICE TRANSACTIONS on Communications Vol.E91-B No.8 pp.2533-2544

- Publication Date
- 2008/08/01

- Publicized

- Online ISSN
- 1745-1345

- DOI
- 10.1093/ietcom/e91-b.8.2533

- Type of Manuscript
- PAPER

- Category
- Network

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.

Copy

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

Copy

@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},}

Copy

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 -