A cluster-based link recovery mechanism for spectrum aware on-demand routing in cognitive radio ad hoc networks

Chih Chieh Tang, Kuo-Feng Ssu, Chun Hao Yang

Research output: Chapter in Book/Report/Conference proceedingChapter

3 Citations (Scopus)

Abstract

In cognitive radio ad hoc networks (CRAHNs), link failures among secondary users (SUs) primarily result from sudden appearance of primary users (PUs). In tradition, route recovery generates much packet loss before the routes are recovered completely. Recent researches on route recovery process in CRAHNs mainly adopt on-demand route maintenance protocols in wireless networks. This paper proposes a clusterbased link recovery mechanism (CLR) in CRAHNs. CLR recovers failed links locally and does not change the original routes. Since the routes have not been changed, the data packets are able to be cached in the buffer. Data packets can be sent after the links are recovered and hence decreases the amount of packet loss. If there is an intersection area of all PUs' radio coverage in the network with some SUs existence in the area, links between these SUs are apt to break no matter what channels these SUs choose. CLR recovers all link failures by using clustering method and effectively increases end-to-end throughput and successful packet delivery fraction. The simulation results indicate that CLR increases successful packet delivery ratio and end-to-end throughput. The performance is much superior particularly if there is an intersection area of all PUs' radio coverage in the network.

Original languageEnglish
Title of host publicationAdvances in Intelligent Systems and Applications -Volume 1 Proceedings of the International Computer Symposium ICS 2012 Held at Hualien,Taiwan
EditorsJain Lakhmi, Chang Ruay-Shiung, Peng Sheng-Lung
Pages601-610
Number of pages10
DOIs
Publication statusPublished - 2013 Jun 28

Publication series

NameSmart Innovation, Systems and Technologies
Volume20
ISSN (Print)2190-3018
ISSN (Electronic)2190-3026

Fingerprint

Cognitive radio
Ad hoc networks
Recovery
Telecommunication links
Packet loss
Throughput
Routing
Wireless networks
Network protocols

All Science Journal Classification (ASJC) codes

  • Decision Sciences(all)
  • Computer Science(all)

Cite this

Tang, C. C., Ssu, K-F., & Yang, C. H. (2013). A cluster-based link recovery mechanism for spectrum aware on-demand routing in cognitive radio ad hoc networks. In J. Lakhmi, C. Ruay-Shiung, & P. Sheng-Lung (Eds.), Advances in Intelligent Systems and Applications -Volume 1 Proceedings of the International Computer Symposium ICS 2012 Held at Hualien,Taiwan (pp. 601-610). (Smart Innovation, Systems and Technologies; Vol. 20). https://doi.org/10.1007/978-3-642-35452-6_61
Tang, Chih Chieh ; Ssu, Kuo-Feng ; Yang, Chun Hao. / A cluster-based link recovery mechanism for spectrum aware on-demand routing in cognitive radio ad hoc networks. Advances in Intelligent Systems and Applications -Volume 1 Proceedings of the International Computer Symposium ICS 2012 Held at Hualien,Taiwan. editor / Jain Lakhmi ; Chang Ruay-Shiung ; Peng Sheng-Lung. 2013. pp. 601-610 (Smart Innovation, Systems and Technologies).
@inbook{7af2160b0ad84a14aa9de9b1a6c3eeb7,
title = "A cluster-based link recovery mechanism for spectrum aware on-demand routing in cognitive radio ad hoc networks",
abstract = "In cognitive radio ad hoc networks (CRAHNs), link failures among secondary users (SUs) primarily result from sudden appearance of primary users (PUs). In tradition, route recovery generates much packet loss before the routes are recovered completely. Recent researches on route recovery process in CRAHNs mainly adopt on-demand route maintenance protocols in wireless networks. This paper proposes a clusterbased link recovery mechanism (CLR) in CRAHNs. CLR recovers failed links locally and does not change the original routes. Since the routes have not been changed, the data packets are able to be cached in the buffer. Data packets can be sent after the links are recovered and hence decreases the amount of packet loss. If there is an intersection area of all PUs' radio coverage in the network with some SUs existence in the area, links between these SUs are apt to break no matter what channels these SUs choose. CLR recovers all link failures by using clustering method and effectively increases end-to-end throughput and successful packet delivery fraction. The simulation results indicate that CLR increases successful packet delivery ratio and end-to-end throughput. The performance is much superior particularly if there is an intersection area of all PUs' radio coverage in the network.",
author = "Tang, {Chih Chieh} and Kuo-Feng Ssu and Yang, {Chun Hao}",
year = "2013",
month = "6",
day = "28",
doi = "10.1007/978-3-642-35452-6_61",
language = "English",
isbn = "9783642354519",
series = "Smart Innovation, Systems and Technologies",
pages = "601--610",
editor = "Jain Lakhmi and Chang Ruay-Shiung and Peng Sheng-Lung",
booktitle = "Advances in Intelligent Systems and Applications -Volume 1 Proceedings of the International Computer Symposium ICS 2012 Held at Hualien,Taiwan",

}

Tang, CC, Ssu, K-F & Yang, CH 2013, A cluster-based link recovery mechanism for spectrum aware on-demand routing in cognitive radio ad hoc networks. in J Lakhmi, C Ruay-Shiung & P Sheng-Lung (eds), Advances in Intelligent Systems and Applications -Volume 1 Proceedings of the International Computer Symposium ICS 2012 Held at Hualien,Taiwan. Smart Innovation, Systems and Technologies, vol. 20, pp. 601-610. https://doi.org/10.1007/978-3-642-35452-6_61

A cluster-based link recovery mechanism for spectrum aware on-demand routing in cognitive radio ad hoc networks. / Tang, Chih Chieh; Ssu, Kuo-Feng; Yang, Chun Hao.

Advances in Intelligent Systems and Applications -Volume 1 Proceedings of the International Computer Symposium ICS 2012 Held at Hualien,Taiwan. ed. / Jain Lakhmi; Chang Ruay-Shiung; Peng Sheng-Lung. 2013. p. 601-610 (Smart Innovation, Systems and Technologies; Vol. 20).

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - A cluster-based link recovery mechanism for spectrum aware on-demand routing in cognitive radio ad hoc networks

AU - Tang, Chih Chieh

AU - Ssu, Kuo-Feng

AU - Yang, Chun Hao

PY - 2013/6/28

Y1 - 2013/6/28

N2 - In cognitive radio ad hoc networks (CRAHNs), link failures among secondary users (SUs) primarily result from sudden appearance of primary users (PUs). In tradition, route recovery generates much packet loss before the routes are recovered completely. Recent researches on route recovery process in CRAHNs mainly adopt on-demand route maintenance protocols in wireless networks. This paper proposes a clusterbased link recovery mechanism (CLR) in CRAHNs. CLR recovers failed links locally and does not change the original routes. Since the routes have not been changed, the data packets are able to be cached in the buffer. Data packets can be sent after the links are recovered and hence decreases the amount of packet loss. If there is an intersection area of all PUs' radio coverage in the network with some SUs existence in the area, links between these SUs are apt to break no matter what channels these SUs choose. CLR recovers all link failures by using clustering method and effectively increases end-to-end throughput and successful packet delivery fraction. The simulation results indicate that CLR increases successful packet delivery ratio and end-to-end throughput. The performance is much superior particularly if there is an intersection area of all PUs' radio coverage in the network.

AB - In cognitive radio ad hoc networks (CRAHNs), link failures among secondary users (SUs) primarily result from sudden appearance of primary users (PUs). In tradition, route recovery generates much packet loss before the routes are recovered completely. Recent researches on route recovery process in CRAHNs mainly adopt on-demand route maintenance protocols in wireless networks. This paper proposes a clusterbased link recovery mechanism (CLR) in CRAHNs. CLR recovers failed links locally and does not change the original routes. Since the routes have not been changed, the data packets are able to be cached in the buffer. Data packets can be sent after the links are recovered and hence decreases the amount of packet loss. If there is an intersection area of all PUs' radio coverage in the network with some SUs existence in the area, links between these SUs are apt to break no matter what channels these SUs choose. CLR recovers all link failures by using clustering method and effectively increases end-to-end throughput and successful packet delivery fraction. The simulation results indicate that CLR increases successful packet delivery ratio and end-to-end throughput. The performance is much superior particularly if there is an intersection area of all PUs' radio coverage in the network.

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

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

U2 - 10.1007/978-3-642-35452-6_61

DO - 10.1007/978-3-642-35452-6_61

M3 - Chapter

SN - 9783642354519

T3 - Smart Innovation, Systems and Technologies

SP - 601

EP - 610

BT - Advances in Intelligent Systems and Applications -Volume 1 Proceedings of the International Computer Symposium ICS 2012 Held at Hualien,Taiwan

A2 - Lakhmi, Jain

A2 - Ruay-Shiung, Chang

A2 - Sheng-Lung, Peng

ER -

Tang CC, Ssu K-F, Yang CH. A cluster-based link recovery mechanism for spectrum aware on-demand routing in cognitive radio ad hoc networks. In Lakhmi J, Ruay-Shiung C, Sheng-Lung P, editors, Advances in Intelligent Systems and Applications -Volume 1 Proceedings of the International Computer Symposium ICS 2012 Held at Hualien,Taiwan. 2013. p. 601-610. (Smart Innovation, Systems and Technologies). https://doi.org/10.1007/978-3-642-35452-6_61