On detecting termination in cognitive radio networks

Shantanu Sharma; Awadhesh Kumar Singh

doi:10.1109/PRDC.2011.18

On detecting termination in cognitive radio networks

Shantanu Sharma, Awadhesh Kumar Singh

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

4 Scopus citations

Abstract

The cognitive radio network is an emerging wireless communication and computing paradigm where the network is not equipped with control infrastructure. The cognitive radios are allowed to execute the processes over the multiple heterogeneous channels without perturbing the licensed users of respective channels. The termination detection is a fundamental and non-trivial problem in the distributed computing systems. In this article, we present a termination detection protocol for heterogeneous multihop cognitive radio network. The proposed protocol applies the credit distribution and recovery approach. We present the two types of termination detection, i.e., strong and weak termination. Also, we give the correctness proof of the protocol.

Original language	English (US)
Title of host publication	Proceedings - 2011 17th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2011
Pages	71-78
Number of pages	8
DOIs	https://doi.org/10.1109/PRDC.2011.18
State	Published - 2011
Externally published	Yes
Event	17th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2011 - Pasadena, CA, United States Duration: Dec 12 2011 → Dec 14 2011

Publication series

Name	Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC
ISSN (Print)	1541-0110

Conference

Conference	17th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2011
Country/Territory	United States
City	Pasadena, CA
Period	12/12/11 → 12/14/11

All Science Journal Classification (ASJC) codes

Computational Theory and Mathematics
Computer Science Applications
Hardware and Architecture
Software

Keywords

Cognitive radio network
credit diffusion and aggregation
multiple heterogeneous channels
termination detection
virtual partitioning and merging
virtual tree-like structure

Access to Document

10.1109/PRDC.2011.18

Cite this

@inproceedings{59c3e5818dc54230ae8b0e3051bdc82b,

title = "On detecting termination in cognitive radio networks",

abstract = "The cognitive radio network is an emerging wireless communication and computing paradigm where the network is not equipped with control infrastructure. The cognitive radios are allowed to execute the processes over the multiple heterogeneous channels without perturbing the licensed users of respective channels. The termination detection is a fundamental and non-trivial problem in the distributed computing systems. In this article, we present a termination detection protocol for heterogeneous multihop cognitive radio network. The proposed protocol applies the credit distribution and recovery approach. We present the two types of termination detection, i.e., strong and weak termination. Also, we give the correctness proof of the protocol.",

keywords = "Cognitive radio network, credit diffusion and aggregation, multiple heterogeneous channels, termination detection, virtual partitioning and merging, virtual tree-like structure",

author = "Shantanu Sharma and Singh, {Awadhesh Kumar}",

year = "2011",

doi = "10.1109/PRDC.2011.18",

language = "English (US)",

isbn = "9780769545905",

series = "Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC",

pages = "71--78",

booktitle = "Proceedings - 2011 17th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2011",

note = "17th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2011 ; Conference date: 12-12-2011 Through 14-12-2011",

}

Sharma, S & Singh, AK 2011, On detecting termination in cognitive radio networks. in Proceedings - 2011 17th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2011., 6133068, Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC, pp. 71-78, 17th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2011, Pasadena, CA, United States, 12/12/11. https://doi.org/10.1109/PRDC.2011.18

On detecting termination in cognitive radio networks. / Sharma, Shantanu; Singh, Awadhesh Kumar.
Proceedings - 2011 17th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2011. 2011. p. 71-78 6133068 (Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - On detecting termination in cognitive radio networks

AU - Sharma, Shantanu

AU - Singh, Awadhesh Kumar

PY - 2011

Y1 - 2011

N2 - The cognitive radio network is an emerging wireless communication and computing paradigm where the network is not equipped with control infrastructure. The cognitive radios are allowed to execute the processes over the multiple heterogeneous channels without perturbing the licensed users of respective channels. The termination detection is a fundamental and non-trivial problem in the distributed computing systems. In this article, we present a termination detection protocol for heterogeneous multihop cognitive radio network. The proposed protocol applies the credit distribution and recovery approach. We present the two types of termination detection, i.e., strong and weak termination. Also, we give the correctness proof of the protocol.

AB - The cognitive radio network is an emerging wireless communication and computing paradigm where the network is not equipped with control infrastructure. The cognitive radios are allowed to execute the processes over the multiple heterogeneous channels without perturbing the licensed users of respective channels. The termination detection is a fundamental and non-trivial problem in the distributed computing systems. In this article, we present a termination detection protocol for heterogeneous multihop cognitive radio network. The proposed protocol applies the credit distribution and recovery approach. We present the two types of termination detection, i.e., strong and weak termination. Also, we give the correctness proof of the protocol.

KW - Cognitive radio network

KW - credit diffusion and aggregation

KW - multiple heterogeneous channels

KW - termination detection

KW - virtual partitioning and merging

KW - virtual tree-like structure

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

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

U2 - 10.1109/PRDC.2011.18

DO - 10.1109/PRDC.2011.18

M3 - Conference contribution

AN - SCOPUS:84863421783

SN - 9780769545905

T3 - Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC

SP - 71

EP - 78

BT - Proceedings - 2011 17th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2011

T2 - 17th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2011

Y2 - 12 December 2011 through 14 December 2011

ER -

On detecting termination in cognitive radio networks

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this