A multihop cooperative routing algorithm for minimizing the number of hops in spectrum sharing networks

I. Te Lin, Iwao Sasase

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

We propose a multihop cooperative routing (MCR) algorithm that extends the lengths of the x axis projections of the hop distances and finds the multihop route that minimizes the number of hops in spectrum sharing networks. The cognitive relay and the cognitive receiver of each hop except the last one are selected by the following procedures. First, the cognitive node that is nearest away from the cognitive sender is selected as the cognitive relay, and let the cognitive destination (CD) be the cognitive receiver. Then, if the participation of the selected cognitive relay can not satisfy the QoS requirement of the cognitive transmission, among the cognitive receiver candidates that satisfy the QoS requirement of the cognitive transmission, the one whose x coordinate has the largest difference from that of the cognitive relay is selected as the cognitive receiver. At the last hop, if the cognitive relay is available, the cooperative transmission is performed. Otherwise, the direct transmission is performed. Simulation results show that the MCR reduces the average number of hops compared to the FNR and outperforms the FNR in terms of the average end-to-end reliability, the average end-to-end throughput, and the average required transmission power.

Original languageEnglish
Title of host publicationProceedings of the 2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications, CROWNCOM 2011
Pages301-305
Number of pages5
DOIs
Publication statusPublished - 2011
Event2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications, CROWNCOM 2011 - Osaka, Japan
Duration: 2011 Jun 12011 Jun 3

Other

Other2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications, CROWNCOM 2011
CountryJapan
CityOsaka
Period11/6/111/6/3

Fingerprint

Routing algorithms
recipient
Quality of service
Power transmission
projection
candidacy
Throughput
simulation
participation

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Communication

Cite this

Lin, I. T., & Sasase, I. (2011). A multihop cooperative routing algorithm for minimizing the number of hops in spectrum sharing networks. In Proceedings of the 2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications, CROWNCOM 2011 (pp. 301-305). [6030796] https://doi.org/10.4108/icst.crowncom.2011.245838

A multihop cooperative routing algorithm for minimizing the number of hops in spectrum sharing networks. / Lin, I. Te; Sasase, Iwao.

Proceedings of the 2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications, CROWNCOM 2011. 2011. p. 301-305 6030796.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lin, IT & Sasase, I 2011, A multihop cooperative routing algorithm for minimizing the number of hops in spectrum sharing networks. in Proceedings of the 2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications, CROWNCOM 2011., 6030796, pp. 301-305, 2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications, CROWNCOM 2011, Osaka, Japan, 11/6/1. https://doi.org/10.4108/icst.crowncom.2011.245838
Lin IT, Sasase I. A multihop cooperative routing algorithm for minimizing the number of hops in spectrum sharing networks. In Proceedings of the 2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications, CROWNCOM 2011. 2011. p. 301-305. 6030796 https://doi.org/10.4108/icst.crowncom.2011.245838
Lin, I. Te ; Sasase, Iwao. / A multihop cooperative routing algorithm for minimizing the number of hops in spectrum sharing networks. Proceedings of the 2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications, CROWNCOM 2011. 2011. pp. 301-305
@inproceedings{0e12d0ee10284b5e9dc34db55d4c814b,
title = "A multihop cooperative routing algorithm for minimizing the number of hops in spectrum sharing networks",
abstract = "We propose a multihop cooperative routing (MCR) algorithm that extends the lengths of the x axis projections of the hop distances and finds the multihop route that minimizes the number of hops in spectrum sharing networks. The cognitive relay and the cognitive receiver of each hop except the last one are selected by the following procedures. First, the cognitive node that is nearest away from the cognitive sender is selected as the cognitive relay, and let the cognitive destination (CD) be the cognitive receiver. Then, if the participation of the selected cognitive relay can not satisfy the QoS requirement of the cognitive transmission, among the cognitive receiver candidates that satisfy the QoS requirement of the cognitive transmission, the one whose x coordinate has the largest difference from that of the cognitive relay is selected as the cognitive receiver. At the last hop, if the cognitive relay is available, the cooperative transmission is performed. Otherwise, the direct transmission is performed. Simulation results show that the MCR reduces the average number of hops compared to the FNR and outperforms the FNR in terms of the average end-to-end reliability, the average end-to-end throughput, and the average required transmission power.",
author = "Lin, {I. Te} and Iwao Sasase",
year = "2011",
doi = "10.4108/icst.crowncom.2011.245838",
language = "English",
isbn = "9781936968190",
pages = "301--305",
booktitle = "Proceedings of the 2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications, CROWNCOM 2011",

}

TY - GEN

T1 - A multihop cooperative routing algorithm for minimizing the number of hops in spectrum sharing networks

AU - Lin, I. Te

AU - Sasase, Iwao

PY - 2011

Y1 - 2011

N2 - We propose a multihop cooperative routing (MCR) algorithm that extends the lengths of the x axis projections of the hop distances and finds the multihop route that minimizes the number of hops in spectrum sharing networks. The cognitive relay and the cognitive receiver of each hop except the last one are selected by the following procedures. First, the cognitive node that is nearest away from the cognitive sender is selected as the cognitive relay, and let the cognitive destination (CD) be the cognitive receiver. Then, if the participation of the selected cognitive relay can not satisfy the QoS requirement of the cognitive transmission, among the cognitive receiver candidates that satisfy the QoS requirement of the cognitive transmission, the one whose x coordinate has the largest difference from that of the cognitive relay is selected as the cognitive receiver. At the last hop, if the cognitive relay is available, the cooperative transmission is performed. Otherwise, the direct transmission is performed. Simulation results show that the MCR reduces the average number of hops compared to the FNR and outperforms the FNR in terms of the average end-to-end reliability, the average end-to-end throughput, and the average required transmission power.

AB - We propose a multihop cooperative routing (MCR) algorithm that extends the lengths of the x axis projections of the hop distances and finds the multihop route that minimizes the number of hops in spectrum sharing networks. The cognitive relay and the cognitive receiver of each hop except the last one are selected by the following procedures. First, the cognitive node that is nearest away from the cognitive sender is selected as the cognitive relay, and let the cognitive destination (CD) be the cognitive receiver. Then, if the participation of the selected cognitive relay can not satisfy the QoS requirement of the cognitive transmission, among the cognitive receiver candidates that satisfy the QoS requirement of the cognitive transmission, the one whose x coordinate has the largest difference from that of the cognitive relay is selected as the cognitive receiver. At the last hop, if the cognitive relay is available, the cooperative transmission is performed. Otherwise, the direct transmission is performed. Simulation results show that the MCR reduces the average number of hops compared to the FNR and outperforms the FNR in terms of the average end-to-end reliability, the average end-to-end throughput, and the average required transmission power.

UR - http://www.scopus.com/inward/record.url?scp=80054733282&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80054733282&partnerID=8YFLogxK

U2 - 10.4108/icst.crowncom.2011.245838

DO - 10.4108/icst.crowncom.2011.245838

M3 - Conference contribution

AN - SCOPUS:80054733282

SN - 9781936968190

SP - 301

EP - 305

BT - Proceedings of the 2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications, CROWNCOM 2011

ER -