A Distant Multipath Routing Method for Reliable Wireless Multi-Hop Data Transmission

Kento TERAI; Daisuke ANZAI; Kyesan LEE; Kentaro YANAGIHARA; Shinsuke HARA

doi:10.1587/transfun.E95.A.723

A Distant Multipath Routing Method for Reliable Wireless Multi-Hop Data Transmission

Kento TERAI, Daisuke ANZAI, Kyesan LEE, Kentaro YANAGIHARA, Shinsuke HARA

Full Text Views

0

Share
Cite this

Summary :

In a wireless multi-hop network between a source node (S) and a destination node (D), multipath routing in which S redundantly sends the same packets to D through multiple routes at the same time is effective for enhancing the reliability of the wireless data transmission by means of route diversity. However, when applying the multipath routing to a factory where huge robots are moving around, if closer multiple routes are selected, the probability that they are blocked by the robots at the same time becomes higher, so the reliability in terms of packet loss rate cannot be enhanced. In this paper, we propose a multipath routing method which can select physically distant multiple routes without any knowledge on the locations of nodes. We introduce a single metric composed of “the distance between routes” and “the route quality” by means of scalarization in multi-objective maximization problem and apply a genetic algorithm (GA) for searching for adequate routes which maximize the metric. Computer simulation results show that the proposed method can adaptively control the topologies of selected routes between S and D, and effectively reduce the packet loss rates.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E95-A No.4 pp.723-734

Publication Date: 2012/04/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E95.A.723

Type of Manuscript: Special Section PAPER (Special Section on Reliable Robust Radio Control Technology)

Category

Cite this

Copy

Kento TERAI, Daisuke ANZAI, Kyesan LEE, Kentaro YANAGIHARA, Shinsuke HARA, "A Distant Multipath Routing Method for Reliable Wireless Multi-Hop Data Transmission" in IEICE TRANSACTIONS on Fundamentals, vol. E95-A, no. 4, pp. 723-734, April 2012, doi: 10.1587/transfun.E95.A.723.
Abstract: In a wireless multi-hop network between a source node (S) and a destination node (D), multipath routing in which S redundantly sends the same packets to D through multiple routes at the same time is effective for enhancing the reliability of the wireless data transmission by means of route diversity. However, when applying the multipath routing to a factory where huge robots are moving around, if closer multiple routes are selected, the probability that they are blocked by the robots at the same time becomes higher, so the reliability in terms of packet loss rate cannot be enhanced. In this paper, we propose a multipath routing method which can select physically distant multiple routes without any knowledge on the locations of nodes. We introduce a single metric composed of “the distance between routes” and “the route quality” by means of scalarization in multi-objective maximization problem and apply a genetic algorithm (GA) for searching for adequate routes which maximize the metric. Computer simulation results show that the proposed method can adaptively control the topologies of selected routes between S and D, and effectively reduce the packet loss rates.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E95.A.723/_p

Copy

@ARTICLE{e95-a_4_723,
author={Kento TERAI, Daisuke ANZAI, Kyesan LEE, Kentaro YANAGIHARA, Shinsuke HARA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Distant Multipath Routing Method for Reliable Wireless Multi-Hop Data Transmission},
year={2012},
volume={E95-A},
number={4},
pages={723-734},
abstract={In a wireless multi-hop network between a source node (S) and a destination node (D), multipath routing in which S redundantly sends the same packets to D through multiple routes at the same time is effective for enhancing the reliability of the wireless data transmission by means of route diversity. However, when applying the multipath routing to a factory where huge robots are moving around, if closer multiple routes are selected, the probability that they are blocked by the robots at the same time becomes higher, so the reliability in terms of packet loss rate cannot be enhanced. In this paper, we propose a multipath routing method which can select physically distant multiple routes without any knowledge on the locations of nodes. We introduce a single metric composed of “the distance between routes” and “the route quality” by means of scalarization in multi-objective maximization problem and apply a genetic algorithm (GA) for searching for adequate routes which maximize the metric. Computer simulation results show that the proposed method can adaptively control the topologies of selected routes between S and D, and effectively reduce the packet loss rates.},
keywords={},
doi={10.1587/transfun.E95.A.723},
ISSN={1745-1337},
month={April},}

Copy

TY - JOUR
TI - A Distant Multipath Routing Method for Reliable Wireless Multi-Hop Data Transmission
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 723
EP - 734
AU - Kento TERAI
AU - Daisuke ANZAI
AU - Kyesan LEE
AU - Kentaro YANAGIHARA
AU - Shinsuke HARA
PY - 2012
DO - 10.1587/transfun.E95.A.723
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E95-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2012
AB - In a wireless multi-hop network between a source node (S) and a destination node (D), multipath routing in which S redundantly sends the same packets to D through multiple routes at the same time is effective for enhancing the reliability of the wireless data transmission by means of route diversity. However, when applying the multipath routing to a factory where huge robots are moving around, if closer multiple routes are selected, the probability that they are blocked by the robots at the same time becomes higher, so the reliability in terms of packet loss rate cannot be enhanced. In this paper, we propose a multipath routing method which can select physically distant multiple routes without any knowledge on the locations of nodes. We introduce a single metric composed of “the distance between routes” and “the route quality” by means of scalarization in multi-objective maximization problem and apply a genetic algorithm (GA) for searching for adequate routes which maximize the metric. Computer simulation results show that the proposed method can adaptively control the topologies of selected routes between S and D, and effectively reduce the packet loss rates.
ER -