IEICE TRANSACTIONS on Information
Routing in Hexagonal Networks under a Corner-Based Addressing Scheme
Summary :
In this letter, a new addressing scheme for hexagonal networks is proposed. Using the new addressing scheme, many routing algorithms designed for networks using square-based topologies such as mesh and torus can also be applied to hexagonal networks. Methods of applying the turn model to hexagonal networks are derived, with some new minimal and partial adaptive routing algorithms obtained. Simulations of the new routing algorithms under different working conditions are carried on hexagonal networks of various sizes. The results show that the proposed algorithms can offer lower packet delay and loss rate than the popular dimension order routing algorithm.
- Publication
- IEICE TRANSACTIONS on Information Vol.E89-D No.5 pp.1755-1758
- Publication Date
- 2006/05/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1093/ietisy/e89-d.5.1755
- Type of Manuscript
- LETTER
- Category
- Networks
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Huaxi GU, Jie ZHANG, Zengji LIU, Xiaoxing TU, "Routing in Hexagonal Networks under a Corner-Based Addressing Scheme" in IEICE TRANSACTIONS on Information,
vol. E89-D, no. 5, pp. 1755-1758, May 2006, doi: 10.1093/ietisy/e89-d.5.1755.
Abstract: In this letter, a new addressing scheme for hexagonal networks is proposed. Using the new addressing scheme, many routing algorithms designed for networks using square-based topologies such as mesh and torus can also be applied to hexagonal networks. Methods of applying the turn model to hexagonal networks are derived, with some new minimal and partial adaptive routing algorithms obtained. Simulations of the new routing algorithms under different working conditions are carried on hexagonal networks of various sizes. The results show that the proposed algorithms can offer lower packet delay and loss rate than the popular dimension order routing algorithm.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e89-d.5.1755/_p
Copy
@ARTICLE{e89-d_5_1755,
author={Huaxi GU, Jie ZHANG, Zengji LIU, Xiaoxing TU, },
journal={IEICE TRANSACTIONS on Information},
title={Routing in Hexagonal Networks under a Corner-Based Addressing Scheme},
year={2006},
volume={E89-D},
number={5},
pages={1755-1758},
abstract={In this letter, a new addressing scheme for hexagonal networks is proposed. Using the new addressing scheme, many routing algorithms designed for networks using square-based topologies such as mesh and torus can also be applied to hexagonal networks. Methods of applying the turn model to hexagonal networks are derived, with some new minimal and partial adaptive routing algorithms obtained. Simulations of the new routing algorithms under different working conditions are carried on hexagonal networks of various sizes. The results show that the proposed algorithms can offer lower packet delay and loss rate than the popular dimension order routing algorithm.},
keywords={},
doi={10.1093/ietisy/e89-d.5.1755},
ISSN={1745-1361},
month={May},}
Copy
TY - JOUR
TI - Routing in Hexagonal Networks under a Corner-Based Addressing Scheme
T2 - IEICE TRANSACTIONS on Information
SP - 1755
EP - 1758
AU - Huaxi GU
AU - Jie ZHANG
AU - Zengji LIU
AU - Xiaoxing TU
PY - 2006
DO - 10.1093/ietisy/e89-d.5.1755
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E89-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2006
AB - In this letter, a new addressing scheme for hexagonal networks is proposed. Using the new addressing scheme, many routing algorithms designed for networks using square-based topologies such as mesh and torus can also be applied to hexagonal networks. Methods of applying the turn model to hexagonal networks are derived, with some new minimal and partial adaptive routing algorithms obtained. Simulations of the new routing algorithms under different working conditions are carried on hexagonal networks of various sizes. The results show that the proposed algorithms can offer lower packet delay and loss rate than the popular dimension order routing algorithm.
ER -
English
