Cognitive Radio (CR) has emerged as the key technology to enable dynamic spectrum access. Capabilities of CR can meet the unique requirements of many wireless networks.
Hence, Cognitive Radio Sensor Networks (CRSN) is introduced as a promising solution to address the unique challenges of Wireless Sensor Networks (WSN) which have been widely used for reliable event detection for many applications. However, there exist many open research issues for the realization of CRSN. Among others, determination
of optimal packet size for CRSN is one of the most fundamental problems to be addressed. The existing optimal packet size solutions devised for CR networks as well as WSN are not applicable in CRSN regime and would cause a waste of energy resources. Hence, the objective of this thesis is to determine the optimal packet size for CRSN that maximizes energy-efficiency while maintaining acceptable interference
level for licensed primary users (PU) and remaining under the maximum allowed distortion level between tracked event signal and its estimation at sink. Energy-efficient packet size reduces energy consumption and increases the transmission efficiency for CRSN. In this thesis, the energy-efficient packet size optimization problem is analytically formulated. Then, sequential quadratic programming (SQP) method is used for solving the optimization problem. The variation of optimal packet size with respect to different parameters of CRSN network is observed through numerical analysis. Results
reveal that PU behavior and channel bit error rate (BER) are the most critical parameters in determining energy-efficient optimal packet size for CRSN.
Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12613040/index.pdf |
Date | 01 February 2011 |
Creators | Oto, Mert Can |
Contributors | Candan, Cagatay |
Publisher | METU |
Source Sets | Middle East Technical Univ. |
Language | English |
Detected Language | English |
Type | M.S. Thesis |
Format | text/pdf |
Rights | To liberate the content for public access |
Page generated in 0.0018 seconds