2024-03-28T15:34:30Z
https://niigata-u.repo.nii.ac.jp/oai
oai:niigata-u.repo.nii.ac.jp:00001791
2022-12-15T03:34:37Z
423:424:425
453:454
Theoretical Analysis of Route Expected Transmission Count in Multi-Hop Wireless Networks
Miyakita, Kazuyuki
5607
Nakano, Keisuke
5597
Sengoku, Masakazu
5609
Shinoda, Shoji
5445
multi-hop wireless networks
Expected Transmission Count
theoretical analysis
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.
journal article
電子情報通信学会
2008-08
application/pdf
IEICE transactions on communications
8
E91-B
2533
2544
AA10826261
0916-8516
https://niigata-u.repo.nii.ac.jp/record/1791/files/E91-B_8_2533-2544.pdf
eng
http://doi.org/10.1093/ietcom/e91-b.8.2533
http://www.ieice.org/jpn/trans_online/
copyright(C)2008 IEICE