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
N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.
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
T3 - Proceedings of the 2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications, CROWNCOM 2011
SP - 301
EP - 305
BT - Proceedings of the 2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications, CROWNCOM 2011
T2 - 2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications, CROWNCOM 2011
Y2 - 1 June 2011 through 3 June 2011
ER -