Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/331462
Title: Optimized cognitive radio network crn using genetic algorithm and artificial bee colony algorithm
Researcher: Arun J
Guide(s): Karthikeyan M
Keywords: Cognitive Radio network
Cluster Head
Topology management
University: Anna University
Completed Date: 2020
Abstract: In the present communication scenario, a solution that can overcome the scarcity of spectrum is Cognitive Radio (CR). To know how much spectrum the Primary User (PU) has occupied, a very important activity used by the CR is spectrum sensing. For sensing the spectrum hole, there are many techniques that have been suggested in literatures. A spectrum pool is formed by the CR user; it comprises all the spectrum holes that are in the spectrum range; it then chooses a suitable one for its future use. Using appropriate spectrum sharing policy, there can be an increase in the channel capacity. A tough issue in Cognitive Radio Network (CRN) is the spectrum prediction; there are many sub topics that are involved like the channel status prediction and the prediction of PU activity, radio environment and transmission rate. One mechanism for topology management is referred to as clustering. This organizes the nodes in logical sets so that the performance of the network is enhanced. The objectives of clustering include supporting collaborative tasks like channel access and channel sensing alongside network stability as well as scalability which is critical for CR functioning. The channel availability being dynamic, it changes with time as well as location, thus novel clustering algorithms must be formulated to tackle these issues that are inherent to CRs. This work proposes a lowest ID clustering algorithm which chooses a certain node as the cluster leader which has the lowest ID. This leader is referred to as Cluster Head (CH). The other algorithm that selects a node having the highest number of neighboring nodes as the CH is referred to as the maximum node degree clustering algorithm. newline
Pagination: x,137p.
URI: http://hdl.handle.net/10603/331462
Appears in Departments:Faculty of Information and Communication Engineering

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File28.41 kBAdobe PDFView/Open
02_certificates.pdf153.51 kBAdobe PDFView/Open
03_vivaproceedings.pdf236.53 kBAdobe PDFView/Open
04_bonafidecertificate.pdf194.75 kBAdobe PDFView/Open
05_abstracts.pdf6.86 kBAdobe PDFView/Open
06_acknowledgements.pdf112.67 kBAdobe PDFView/Open
07_contents.pdf6.98 kBAdobe PDFView/Open
08_listoftables.pdf2.27 kBAdobe PDFView/Open
09_listoffigures.pdf3.03 kBAdobe PDFView/Open
10_listofabbreviations.pdf8.36 kBAdobe PDFView/Open
11_chapter1.pdf80.38 kBAdobe PDFView/Open
12_chapter2.pdf90.56 kBAdobe PDFView/Open
13_chapter3.pdf251.64 kBAdobe PDFView/Open
14_chapter4.pdf221.39 kBAdobe PDFView/Open
15_chapter5.pdf249.63 kBAdobe PDFView/Open
16_conclusion.pdf9.7 kBAdobe PDFView/Open
17_references.pdf43.66 kBAdobe PDFView/Open
18_listofpublications.pdf5.57 kBAdobe PDFView/Open
80_recommendation.pdf131.64 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: