Efficient discovery and recovery of common control channel in cognitive radio wireless ad-hoc networks

2.50
Hdl Handle:
http://hdl.handle.net/10547/288589
Title:
Efficient discovery and recovery of common control channel in cognitive radio wireless ad-hoc networks
Authors:
Shah, Munam Ali ( 0000-0002-4037-3405 ) ; Zhang, Sijing; Maple, Carsten
Abstract:
The most important aspect of cognitive radio (CR) networks is to search, scan, and access the control channel to advertise the free channel list (FCL)amongst the participating CR nodes. Subsequent communication could not take place until there is an access to a well-known and agreed upon control channel to dialogue the initial configuration. In this paper, a novel protocol for searching, scanning, and accessing the control channel is proposed. The protocol consists of two levels of selection: rapid channel accessing and reliable channel accessing. In rapid channel accessing, nodes quickly and efficiently converge to a newly found control channel. In reliable channel accessing, switching to the backup control channel is performed when necessary. Furthermore, our reliable channel accessing allows CR nodes to access more than one control channel simultaneously. We evaluate the performance of the proposed approach through analytical modelling. The performance results show that our protocol can achieve efficient channel access time and fairness
Citation:
Shah, M.A., Zhang, S.& Maple, C. (2013) “Efficient discovery and recovery of common control channel in cognitive radio wireless ad-hoc networks,” Journal of Green Engineering, 3 (3) pp. 273-289
Publisher:
River Publishers
Journal:
Journal of Green Engineering
Issue Date:
2013
URI:
http://hdl.handle.net/10547/288589
Additional Links:
http://www.www.riverpublishers.com/journal.php?j=JGE/3/3#1
Type:
Article
Language:
en
ISSN:
1904-4720
Appears in Collections:
Centre for Wireless Research (CWR)

Full metadata record

DC FieldValue Language
dc.contributor.authorShah, Munam Alien_GB
dc.contributor.authorZhang, Sijingen_GB
dc.contributor.authorMaple, Carstenen_GB
dc.date.accessioned2013-05-07T11:20:36Z-
dc.date.available2013-05-07T11:20:36Z-
dc.date.issued2013-
dc.identifier.citationShah, M.A., Zhang, S.& Maple, C. (2013) “Efficient discovery and recovery of common control channel in cognitive radio wireless ad-hoc networks,” Journal of Green Engineering, 3 (3) pp. 273-289en_GB
dc.identifier.issn1904-4720-
dc.identifier.urihttp://hdl.handle.net/10547/288589-
dc.description.abstractThe most important aspect of cognitive radio (CR) networks is to search, scan, and access the control channel to advertise the free channel list (FCL)amongst the participating CR nodes. Subsequent communication could not take place until there is an access to a well-known and agreed upon control channel to dialogue the initial configuration. In this paper, a novel protocol for searching, scanning, and accessing the control channel is proposed. The protocol consists of two levels of selection: rapid channel accessing and reliable channel accessing. In rapid channel accessing, nodes quickly and efficiently converge to a newly found control channel. In reliable channel accessing, switching to the backup control channel is performed when necessary. Furthermore, our reliable channel accessing allows CR nodes to access more than one control channel simultaneously. We evaluate the performance of the proposed approach through analytical modelling. The performance results show that our protocol can achieve efficient channel access time and fairnessen_GB
dc.language.isoenen
dc.publisherRiver Publishersen_GB
dc.relation.urlhttp://www.www.riverpublishers.com/journal.php?j=JGE/3/3#1en_GB
dc.subjectMAC protocolsen_GB
dc.subjectcommon control channelen_GB
dc.subjectchannel searchingen_GB
dc.subjectcognitive radioen_GB
dc.subjectwireless networkingen_GB
dc.titleEfficient discovery and recovery of common control channel in cognitive radio wireless ad-hoc networksen
dc.typeArticleen
dc.identifier.journalJournal of Green Engineeringen_GB
All Items in UOBREP are protected by copyright, with all rights reserved, unless otherwise indicated.