Дисертації з теми "Networks with underlay cognitive nodes"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-19 дисертацій для дослідження на тему "Networks with underlay cognitive nodes".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Jasbi, Fahimeh Jafarali. "Hybrid overlay/underlay cognitive radio networks with MC-CDMA." Thesis, University of Manchester, 2014. https://www.research.manchester.ac.uk/portal/en/theses/hybrid-overlayunderlay-cognitive-radio-networks-with-mccdma(435d45a5-82c0-4507-9c53-23aa248988c9).html.
Повний текст джерелаAl-Hraishawi, Hayder Abed Hussein. "DESIGN AND ANALYSIS OF COGNITIVE MASSIVE MIMO NETWORKS WITH UNDERLAY SPECTRUM SHARING." OpenSIUC, 2017. https://opensiuc.lib.siu.edu/dissertations/1412.
Повний текст джерелаKabiri, Charles. "On the Performance of Underlay Cognitive Radio Networks with Interference Constraints and Relaying." Doctoral thesis, Blekinge Tekniska Högskola [bth.se], Faculty of Computing - Department of Communication Systems, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-00609.
Повний текст джерелаTran, Hung. "Performance Analysis of Cognitive Radio Networks with Interference Constraints." Doctoral thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-00550.
Повний текст джерелаSibomana, Louis. "Performance Analysis of Cognitive Radio Networks under Spectrum Sharing and Security Constraints." Doctoral thesis, Blekinge Tekniska Högskola, Institutionen för kommunikationssystem, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-11739.
Повний текст джерелаChu, Thi My Chinh. "On the Performance Assessment of Advanced Cognitive Radio Networks." Doctoral thesis, Blekinge Tekniska Högskola [bth.se], Faculty of Computing - Department of Communication Systems, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-00611.
Повний текст джерелаDevanarayana, Chamara. "Spectrum access in cognitive radio networks based on prediction and estimation." EURASIP Journal on Wireless Communications and Networking, 2011. http://hdl.handle.net/1993/31605.
Повний текст джерелаOctober 2016
Samarasekera, Andawattage Chaminda Janaka. "The Performance of Dual-Hop Decode-and-Forward Underlay Cognitive Relay Networks with Interference Power Constraints over Weibull Fading Channels." Thesis, Blekinge Tekniska Högskola, Sektionen för ingenjörsvetenskap, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3201.
Повний текст джерелаLu, Lu. "Spectral-efficient design in modern wireless communications networks." Diss., Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/53902.
Повний текст джерелаMoteka, Leutsoa. "User pairing and power allocation in underlay cognitive NOMA networks." Thesis, 2020. https://hdl.handle.net/10539/31115.
Повний текст джерелаThe unique structure of Non-Orthogonal Multiple Access (NOMA), a candidate for multiple access techniques for fifth-generation mobile networks, poses formidable design challenges when the number of users in the network rises. Fifth generation networks, however, demand hyper connected societies with phenomenal number of users. In a multi-channel NOMA system with a large number of users, the literature has shown that the best performance is achieved if no more than three users share a channel. Most research typically allocates two users to a channel. One of the key issues then is user pairing, which must be done in order to maximize the network capacity. A number of user pairing schemes have been derived in the literature, but these have been done mostly for non-cognitive radio networks. A need for user pairing schemes in cognitive networks has therefore risen. Developed schemes need to take into account a plethora of complications such as energy consumption and an increase in interference raised in the cognitive environment. The main focus of this dissertation is to mathematically model a framework to optimize power allocation and user pairing in a cognitive NOMA network. In particular, we determine various power allocation schemes that can cope with the severe energy constraints of an underlay cognitive network and employ these schemes for use indifferent user pairing schemes. First, we employ an underlay random pairing algorithm and an underlay channel state sorting pairing algorithm, for use in a large-scale network. Because of the low complexity of these algorithms, we use their performance to study and compare with other pairing algorithms. Then we propose a near-optimal preference list matching algorithm (PLMA) based on matching theory to perform user pairing. Performance evaluation of the proposed schemes is presented through simulations. Results show how that the preference list matching algorithm effectively outperforms other pairing algorithms and can also perform better that the Hungarian algorithm
CK2021
Ao, Weng-Chon, and 歐永俊. "Phase Transition Analysis for Underlay Heterogeneous Cognitive Radio Networks with Applications." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/23981309145885872180.
Повний текст джерела臺灣大學
電信工程學研究所
98
Characterizing the topology and therefore fundamental limit is a must to establish effective cognitive radio networking (CRN). However, there lacks complete understanding of the relationship among connectivity, interference, latency and other system parameters of the underlay CRN. To clarify this complication, by employing tools from both percolation theory and stochastic geometry, we provide a novel parametrization of underlay secondary ad hoc CRN wherein the secondary network is regarded as an operating point in the phase space in both cases with and without outage constraints on secondary links. Coexisting with a primary ad hoc network, the secondary network undergoes a phase transition due to avoiding interference to primary receivers, while being interfered by primary transmitters. Furthermore, transmit power allocation of secondary users is represented by a Pareto contour in the phase space, and the impact of interference on connectivity is captured by the latency-to-percolate. Based on this proposed framework, we develop and analyze many applications on underlay secondary network, such as benefits of importing avoidance regions, self-motivated cooperation scheme, delay minimizing routing, and data dissemination with epidemic broadcasting so that CRNs can successfully operate.
Yu, Hao-Ting, and 游皓婷. "Lifetime Maximization of Secondary Cooperative Systems in Underlay Cognitive Radio Networks." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/14507104935542138794.
Повний текст джерела國立中山大學
通訊工程研究所
100
In this thesis, we consider cognitive radio networks (CRN) combined with cooperative transmission, and investigate relay selection and power allocation strategies to maximize network lifetime (NLT). Cognitive radio network enhances spectrum efficiency resource by exploiting capabilities of cognition, learning and coordination against insufficient spectrum resource. In underlay cognitive radio network, however, transmitted energy of secondary user is constrained by interference level observed at primary user (PU). Though cooperation among secondary users (SU), multiple relays from virtual antenna array to improve transmission rate and reliability by exploiting spatial diversity. Most existing works assume that cooperative secondary users are plugged and with infinite energy device. In this thesis, we consider secondary cooperative systems where relays are battery-powered and with finite energy. We will investigate relay-selection schemes to reduce energy consumption of secondary relays and prolong network lifetime under the premises that secondary user’s transmission rate is guaranteed and interference constraint of primary user is met. Our major difference between this work and previous works is the definition of network lifetime, which is defined by the maximum duration that the probability of secondary user’s achievable rate below the guaranteed value, i.e. outage probability, is lower than a predetermined threshold. We proposed four relay-selection methods which take channel state information (CSI) and residual energy information (REI) into considerations to prolong network lifetime. Since the selection metrics of the proposed strategies requires CSI and REI of each individual relay, so the relay-selection can be accomplished in distributed manner through opportunistic sensing. No additional overhead is demanded for information exchange.
Song, Yao. "Threshold Based Opportunistic Scheduling of Secondary Users in Underlay Cognitive Radio Networks." Thesis, 2011. http://hdl.handle.net/10754/205811.
Повний текст джерелаSainath, B. "Optimal Amplify-And-Forward Relaying For Cooperative Communications And Underlay Cognitive Radio." Thesis, 2015. http://etd.iisc.ernet.in/handle/2005/2650.
Повний текст джерелаDadallage, Suren Tharanga Darshana. "Joint beamforming, channel and power allocation in multi-user and multi-channel underlay MISO cognitive radio networks." 2014. http://hdl.handle.net/1993/30077.
Повний текст джерела陳韋豪. "Optimal Probabilistic Power Allocation For Underlay Cognitive Radio Networks with Outage Constraint and One-bit Side Information." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/00418626018213841944.
Повний текст джерела國立清華大學
通訊工程研究所
101
In this paper, we study a spectrum sharing based cognitive radio network (CRN) where $N$ secondary users (SUs) share the same spectrum with a primary user (PU) over block fading channels. We assume complete perfect channel state information (CSI) at the secondary transmitters while only local instantaneous CSI is assumed at the primary transmitter. The PU is assumed to adopt an ON-OFF power control policy and convey this one-bit side information to all secondary transmitters. Based on these assumptions, we investigate the optimal probabilistic power allocation that seeks to maximize the system utilities for SUs subject to the primary interference power constraint, the secondary rate outage constraints and the average power constraints. The probabilistic power allocation problem was first reformulated as a deterministic power allocation problem through defining a set of weighting variables based on the conditional probability and conditional mean of the probabilistic power random variables. The resulting optimization problem, however, is still non-convex in general. To handle the non-convex constraints, we applied a conservative convex first-order approximation technique. Furthermore, by the successive convex approximation (SCA), we proposed an algorithm that provides high-quality approximate solutions via solving a sequence of convex approximation problems. Our theoretical analysis further demonstrated that the limit point generated by our proposed SCA algorithm is indeed a stationary point of the original optimization problem. To further reduce complexity, a decentralized version of the SCA algorithm was proposed, where only a limited amount of information exchange between the secondary transmitters is required. The convergence analysis was also provided for the decentralized counterpart. Extensive simulations validated our analyses and demonstrated that near-optimal performance is indeed achieved by both our proposed algorithms.
Jamal, Nadia. "Throughput Scaling Laws in Point-to-Multipoint Cognitive Networks." Thesis, 2010. http://hdl.handle.net/10012/5289.
Повний текст джерелаVenugopalakrishna, Y. R. "Data Fusion Based Physical Layer Protocols for Cognitive Radio Applications." Thesis, 2016. http://etd.iisc.ernet.in/handle/2005/2683.
Повний текст джерелаGuo, Jing. "Stochastic Geometry for Modeling, Analysis and Design of Future Wireless Networks." Phd thesis, 2016. http://hdl.handle.net/1885/107351.
Повний текст джерела