Show simple item record

dc.contributor.authorHossain, Md Shamiun
dc.date.accessioned2026-04-01T06:25:32Z
dc.date.available2026-04-01T06:25:32Z
dc.date.issued2026-03-31
dc.identifier.urihttp://dspace.uiu.ac.bd/handle/52243/3408
dc.description.abstractPersistent Secure Spectrum Aware MAC layer, scalability and load balancing are important requirements for numerous ad-hoc sensor network. Secure Clustering sensor nodes is an effective technique for achieving these goals. In this work, we present a secure, spectrum-aware cross-layer MAC protocol designed for Cognitive Radio Ad Hoc Networks (CRAHN), where cluster formation is defined maximum edge biclique problem, enhance the security of the cluster formation process and ensure both a stable number of common channels and robustness to varying spectrum availability. The clustering process concludes in O(1) of iterations, independent of the network’s structure or scale. By carefully choosing the secondary clustering parameter, the process can significantly reduce the hassle of re-clustering. This thoughtful selection ensures that the workload is evenly spread across the cluster heads, preventing any one cluster from becoming overloaded, and keeping the network running smoothly and efficiently. Dynamic approach maintains a stable network structure despite node mobility. These protocols focus on secure and efficient spectrum sharing among nodes to enhance network performance. It also achieves fairly uniform cluster head distribution across the network. The cluster-based architecture is designed to be highly flexible, allowing it to build and adjust itself as needed. This dynamic nature is supported by two key operations: Node-Move-In and Node-Move-Out. These operations enable the network to easily integrate new nodes and remove existing ones, ensuring that the system can adapt to changes and maintain optimal performance without manual intervention. A pseudocode analysis focused on enhancing the security of the cluster formation process is also applied in two topology management operations. Overall, the time complexity for the Node-Move-In and Node-Move-Out algorithms is O(n), where n represents the number of members in the cluster. This means that the algorithms handle a number of operations proportional to the number of nodes involved, making them efficient and scalable as the network grows.en_US
dc.publisherUIUen_US
dc.subjectCRN Security Join Leave Simulationen_US
dc.titleA Secure Spectrum Aware MAC layer protocol for Cognitive Radio Wireless Sensor Network.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record