Distributed Cooperative Routing Algorithm for Multi-Hop Multi-Relay Wireless Networks
Summary :
Motivated by the recent research in crosslayer design of cooperative wireless network, we propose a distributed cooperative routing algorithm for a multihop multi-relay wireless network to achieve selection diversity. We propose two algorithms, rate optimal path selection and outage optimal path selection, to satisfy the different requirements of the systems. Both algorithms work on distributed processing without requiring any centralized controller. Simulations are conducted to evaluate the performance of the proposal. The results of the simulations show that the proposed routing algorithms significantly improve the end-to-end data rate and outage performance compared with noncooperative routing protocols.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E93-B No.4 pp.1049-1052
- Publication Date
- 2010/04/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E93.B.1049
- Type of Manuscript
- LETTER
- Category
- Wireless Communication Technologies
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
ASADUZZAMAN, Hyung-Yun KONG, "Distributed Cooperative Routing Algorithm for Multi-Hop Multi-Relay Wireless Networks" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 4, pp. 1049-1052, April 2010, doi: 10.1587/transcom.E93.B.1049.
Abstract: Motivated by the recent research in crosslayer design of cooperative wireless network, we propose a distributed cooperative routing algorithm for a multihop multi-relay wireless network to achieve selection diversity. We propose two algorithms, rate optimal path selection and outage optimal path selection, to satisfy the different requirements of the systems. Both algorithms work on distributed processing without requiring any centralized controller. Simulations are conducted to evaluate the performance of the proposal. The results of the simulations show that the proposed routing algorithms significantly improve the end-to-end data rate and outage performance compared with noncooperative routing protocols.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.1049/_p
Copy
@ARTICLE{e93-b_4_1049,
author={ASADUZZAMAN, Hyung-Yun KONG, },
journal={IEICE TRANSACTIONS on Communications},
title={Distributed Cooperative Routing Algorithm for Multi-Hop Multi-Relay Wireless Networks},
year={2010},
volume={E93-B},
number={4},
pages={1049-1052},
abstract={Motivated by the recent research in crosslayer design of cooperative wireless network, we propose a distributed cooperative routing algorithm for a multihop multi-relay wireless network to achieve selection diversity. We propose two algorithms, rate optimal path selection and outage optimal path selection, to satisfy the different requirements of the systems. Both algorithms work on distributed processing without requiring any centralized controller. Simulations are conducted to evaluate the performance of the proposal. The results of the simulations show that the proposed routing algorithms significantly improve the end-to-end data rate and outage performance compared with noncooperative routing protocols.},
keywords={},
doi={10.1587/transcom.E93.B.1049},
ISSN={1745-1345},
month={April},}
Copy
TY - JOUR
TI - Distributed Cooperative Routing Algorithm for Multi-Hop Multi-Relay Wireless Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1049
EP - 1052
AU - ASADUZZAMAN
AU - Hyung-Yun KONG
PY - 2010
DO - 10.1587/transcom.E93.B.1049
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2010
AB - Motivated by the recent research in crosslayer design of cooperative wireless network, we propose a distributed cooperative routing algorithm for a multihop multi-relay wireless network to achieve selection diversity. We propose two algorithms, rate optimal path selection and outage optimal path selection, to satisfy the different requirements of the systems. Both algorithms work on distributed processing without requiring any centralized controller. Simulations are conducted to evaluate the performance of the proposal. The results of the simulations show that the proposed routing algorithms significantly improve the end-to-end data rate and outage performance compared with noncooperative routing protocols.
ER -
English
