检索结果-南通市图书馆

Robust beamforming for IRS-aided SWIPT in Cognitive radio networks

Digital Communications and networks 2023年第3期9卷 645-654页

作者： Zining Wang Min Lin Shupei Huang Ming Cheng Wei-Ping Zhu Yan Guo College of Telecommunications and Information Engineering Nanjing University of Posts and TelecommunicationsNanjing210003China Department of Electrical and Computer Engineering Concordia UniversityMontrealQCH3G 1M8Canada

Intelligent reflecting surface(IRS)is widely recognized as a promising technique to enhance the system perfor-mance,and thus is a hot research topic in future wireless communications.In this context,this paper proposes a robust BF scheme to improve the spectrum and energy harvesting efficiencies for the IRS-aided simultaneous wireless information and power transfer(SWIPT)in a cognitive radio network(CRN).Here,the base station(BS)utilizes spectrum assigned to the primary users(PUs)to simultaneously serve multiple energy receivers(ERs)and information receivers(IRs)through IRS-aided multicast technology.In particular,by assuming that only the imperfect channel state information(CSI)is available,we first formulate a constrained problem to maximize the minimal achievable rate of IRs,while satisfying the harvesting energy threshold of ERs,the quality-of-service requirement of IRs,the interference threshold of PUs and transmit power budget of BS.To address the non-convex problem,we then adopt triangle inequality to deal with the channel uncertainty,and propose a low-complexity algorithm combining alternating direction method of multipliers(ADMM)with alternating optimi-zation(AO)to jointly optimize the active and passive beamformers for the BS and IRS,respectively.Finally,our simulation results confirm the effectiveness of the proposed BF scheme and also provide useful insights into the importance of introducing IRS into the CRN with SWIPT.

关键词： Cognitive radio networks Intelligent reflecting surface Simultaneous wireless information and power transfer Robust beamforming

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Pricing Policy for a Dynamic Spectrum Allocation Scheme with Batch Requests and Impatient Packets in Cognitive radio networks

引用

Journal of Systems Science and Systems Engineering 2022年第2期31卷 133-149页

作者： Haixing Wu Shunfu Jin Wuyi Yue School of Information Science and Engineering Yanshan UniversityQinhuangdao 066004China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan UniversityQinhuangdao 066004China Department of Intelligence and Informatics Konan UniversityKobe 658-8501Japan

In Cognitive radio networks(CRNs),multiple secondary users may send out requests simultaneously and one secondary user may send out multiple requests at one time,i.e.,request arrivals usually show an aggregate manner.Moreover,a secondary user packet waiting in the buffer may leave the system due to impatience before it is transmitted,and this impatient behavior inevitably has an impact on the system performance.Aiming to investigate the influence of the aggregate behavior of requests and the likelihood of impatience on a dynamic spectrum allocation scheme in CRNs,in this paper a batch arrival queueing model with possible reneging and potential transmission interruption is established.By constructing a Markov chain and presenting a transition rate matrix,the steady-state distribution of the queueing model along with a dynamic spectrum allocation scheme is derived to analyze the stochastic behavior of the system.Accordingly,some important performance measures such as the loss rate,the balk rate and the average delay of secondary user packets are given.Moreover,system experiments are carried out to show the change trends of the performance measures with respect to batch arrival rates of secondary user packets for different impatience parameters,different batch sizes of secondary user packets,and different arrival rates of primary user packets.Finally,a pricing policy for secondary users is presented and the dynamic spectrum allocation scheme is socially optimized.

关键词： Cognitive radio networks dynamic spectrum scheme batch arrival impatient packets Markov chain social optimization

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Cognitive radio networks Using Intelligent Reflecting Surfaces

引用

Computer Systems Science & Engineering 2022年第11期43卷 751-765页

作者： Raed Alhamad Information Technology Department Saudi Electronic UniversityRiaydhKingdom of Saudi Arabia

In this article,we optimize harvesting and sensing duration for Cognitive radio networks(CRN)using Intelligent Reflecting Surfaces(IRS).The secondary source harvests energy using the received signal from node A.Then,it performs spectrum sensing to detect Primary Source PS activity.When PS activity is not detected,The Secondary Source SS transmits data to Secondary Destination SD where all reflected signals on IRS are in phase at SD.We show that IRS offers 14,20,26,32,38,44,50 dB enhancement in throughput using M=8,16,32,64,128,256,512 reflectors with respect to CRN without IRS.We also suggested to add a second IRS between A and SS to increase the harvested energy.The use of 2 IRS with M1=8 reflectors in the first IRS and M2=8 reflectors in the second IRS offers 18 dB gain(respectively 32 dB)gain with respect to a single IRS with M2=8 reflectors(respectively without IRS).The use of 2 IRS with M1=16 reflectors in the first IRS and M2=8 reflectors in the second IRS offers 28 dB gain(respectively 42 dB)gain with respect to a single IRS with M2=8 reflectors(respectively without IRS).Our results are valid for Nakagami channels of fading figure m.We also provide the throughput of IRS with energy harvesting.We have studied packet waiting time and total delay in the presence and absence or IRS.At Signal to Noise Ratio(SNR)per bit equal to 0 dB,packet waiting time is 0.9 ms when there is no IRS and 0.5 ms when there is an IRS with M=8 reflector.At SNR per bit equal to 0 dB,total transmission delay is 54 ms when there is no IRS and 1.5 ms when there is an IRS with M=8 reflectors.We show that the energy efficiency is larger when both harvesting and sensing durations are optimized.The maximum of energy efficiency is 260 Mbit/s/Hz/J when harvesting and sensing durations are optimized while the maximum is 80 Mbit/s/Hz/J when harvesting and sensing durations are not optimized.

关键词： Cognitive radio networks energy harvesting spectrum sensing throughput analysis

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

An Effective Secure MAC Protocol for Cognitive radio networks

引用

Computer Systems Science & Engineering 2022年第7期42卷 133-148页

作者： Bayan Al-Amri Gofran Sami Wajdi Alhakami Department of Information Technology College of Computers and Information TechnologyTaif UniversityTaif21944Saudi Arabia Department of Computer Science Joint First Year DeanshipUmm Al-Qura UniversityMakkah21955Saudi Arabia

The vast revolution in networking is increasing rapidly along with tech-nology advancements,which requires more effort from all cyberspace profes-sionals to cope with the challenges that come with advanced technology privileges and services.Hence,cognitive radio Network is one of the promising approaches that permit a dynamic type of smart network for improving the utili-zation of idle spectrum portions of wireless communications.However,it is vul-nerable to security threats and attacks and demands security mechanisms to preserve and protect the Cognitive radio networks for ensuring a secure commu-nication environment.This paper presents an effective secure MAC protocol for Cognitive radio networks,signiﬁcantly enhancing the security level of the existing DSMCRN and SSMCRN protocols by eliminating the authentication server’s necessity,which can be a single point of failure to compromise the entire network communication.The proposed protocol has proven to be effective and reliable since it does not rely on a centralized entity for providing the required security for a single pair of cognitive users.The protocol also improves the performance in the context of fast switching to data channels leading to higher throughput is achieved compared to the benchmark protocols.

关键词： Cognitive radio networks shared key authentication elliptic curve cryptography throughput

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Securing Privacy Using Optimization and Statistical Models in Cognitive radio networks

引用

Computer Systems Science & Engineering 2022年第8期42卷 523-533页

作者： R.Neelaveni B.Sridevi J.Sivasankari Department of Electronics and Communication Engineering MNM Jain Engineering CollegeChennai60009India Department of Electronics and Communication Engineering Velammal Institute of TechnologyChennai602001India Department of Electronics and Communication Engineering Ultra College of Engineering and TechnologyMadurai625104India

Cognitive radio networks(CRN)are the possible and ideal solution for meeting the spectrum needs of next-generation communication systems.CRN is a promising alternative approach that allows spectrum sharing in many applications.The licensed users considered Primary Users(PU)and unlicensed users as Secondary Users(SU).Time and power consumption on security issues are considered degrading factors in performance for improving the Quality of Service(QoS).Irrespective of using different optimization techniques,the same methodology is to be updated for the task.So that,learning and optimization go hand in hand.It ensures the security in CRN,risk factors in spectrum sharing to SU for secure communication.The objective of the proposed work is to preserve the location of the SU from attackers and attain the clustering of SU to utilize the resource.Ant Colony Optimization(ACO)is implemented to increase the overall efficiency and utilization of the CRN.ACO is used to form clusters of SUs in the co-operative spectrum sensing technique.This paper deals with threat detection and classifying threats using parameters such as unlikability,context privacy,anonymity,conditional traceability,and trade-off.In this privacy-preserving model,overall accuracy is 97.4%,and it is 9%higher than the conventional models without Privacy-Preserving Architecture(PPA).

关键词： Attacks secondary users Cognitive radio networks security

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Power Control and Routing Selection for Throughput Maximization in Energy Harvesting Cognitive radio networks

引用

Computers, Materials & Continua 2020年第6期63卷 1273-1296页

作者： Xiaoli He Hong Jiang Yu Song Muhammad Owais School of Information Engineering South West University of Science and TechnologyMianyang621010China School of Computer Science Sichuan University of Science and EngineeringZigong643000China Department of Network Information Management Center Sichuan University of Science and EngineeringZigong643000China Alhamd Islamic University BalochistanPakistan

This paper investigates the power control and routing problem in the communication process of an energy harvesting(EH)multi-hop cognitive radio network(CRN).The secondary user(SU)nodes(i.e.,source node and relay nodes)harvest energy from the environment and use the energy exclusively for transmitting data.The SU nodes(i.e.,relay nodes)on the path,store and forward the received data to the destination node.We consider a real world scenario where the EH-SU node has only local causal knowledge,i.e.,at any time,each EH-SU node only has knowledge of its own EH process,channel state and currently received data.In order to study the power and routing issues,an optimization problem that maximizes path throughput considering quality of service(QoS)and available energy constraints is proposed.To solve this optimization problem,we propose a hybrid game theory routing and power control algorithm(HGRPC).The EH-SU nodes on the same path cooperate with each other,but EH-SU nodes on the different paths compete with each other.By selecting the best next hop node,we find the best strategy that can maximize throughput.In addition,we have established four steps to achieve routing,i.e.,route discovery,route selection,route reply,and route maintenance.Compared with the direct transmission,HGRPC has advantages in longer distances and higher hop counts.The algorithm generates more energy,reduces energy consumption and increases predictable residual energy.In particular,the time complexity of HGRPC is analyzed and its convergence is proved.In simulation experiments,the performance(i.e.,throughput and bit error rate(BER))of HGRPC is evaluated.Finally,experimental results show that HGRPC has higher throughput,longer network life,less latency,and lower energy consumption.

关键词： Cognitive radio networks power control routing selection energy harvesting game theory amplify-and-forward(AF) throughput

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Multiple Relay Selection Based on Game Theory in Cooperative Cognitive radio networks

引用

Chinese Journal of Electronics 2017年第3期26卷 624-633页

作者： WU Renyong WANG Wenru LI Renfa The College of Information Science and Engineering Hunan University

Due to the inefficiency of traditional fixed spectrum allocation policies,the paradox of apparent spectrum scarcity occurs while most of the bands are underutilized.This has prompted proposals for Dynamic spectrum sharing(DSS),which explains why cognitive radio network(CRN)has been widely accepted as a promising approach to settle inefficient usage of scarce available radio spectrum.As a subset of DSS,Dynamic spectrum leasing(DSL)strategy has been proposed based on game idea,where Primary user(PU)has an incentive to allow cognitive users(CUs)to access its licensed spectrum for a fraction of time in exchange for revenue.This paper proposes an approach,named multiple relay selection based on Game theory(GTMRS),to optimize the utilities of PU and CUs as a whole,where a pricing-based spectrum leasing mechanism is applied.While the parameter price c is jointly determined by PU and CUs,all selected cognitive user’s optimal cooperative powers can be satisfied through a non-cooperative game among themselves.Numerical results show that more CUs are involved in the cooperation and both utilities of PU and CUs as a whole are improved,which means the whole system throughput is increased.

关键词： Cognitive radio networks Dynamic spectrum leasing Cooperative transmission Nash equilibrium

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Secrecy outage analysis for underlay Cognitive radio networks over correlated channels

引用

Science China(Information Sciences) 2017年第2期60卷 107-115页

作者： Jiliang ZHANG Hui ZHAO Gaofeng PAN Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing School of Electronic and Information Engineering Southwest University

This paper investigates the secrecy outage performance of underlay Cognitive radio networks, in which a source in a secondary system transmits its confidential information to a legitimate destination in the presence of an eavesdropper. Specifically, the main(the source-to-destination) and eavesdropping(the sourceto-eavesdropper) channels are assumed to be correlated. Moreover, it is also assumed that the main channel and the channel from the source to the primary user’s receiver are correlated. Tight closed-form analytical expression for secrecy outage probability and the closed-form analytical expression for the probability of non-zero secrecy capacity are derived and validated by simulation results when the interference temperature limit is comparably large.

关键词： Cognitive radio networks correlated fading channels probability of non-zero secrecy capacity secrecy outage probability

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Joint channel selection and power control for video streaming over D2D communications based Cognitive radio networks

引用

The Journal of China Universities of Posts and Telecommunications 2018年第1期25卷 1-14页

作者： Gao Ya Zhang Hailin Lu Xiaofeng State Key Laboratory of Integrated Services networks Xidian University College of Physics and Electronic Information Luoyang Normal University

A joint channel selection and power control scheme is developed for video streaming in device-to-device （D2D） communications based Cognitive radio networks. In particular, physical queue and virtual queue models by applying ＇M/G/1 queue＇ and ＇M/G/1 queue with vacations＇ theories are built up, respectively, to evaluate the delays experienced by various video traffics. Such delays play a vital role in calculating the packet loss rate for video streaming, which reflects the video distortion. Based on the distortion model, a video distortion minimization problem is formulated, subject to the rate constraint, maximum power constraint, primary users＇ tolerant interference constraint, and secondary users＇ minimum data rate requirement constraint. The optimization problem turns out to be a mixed integer nonlinear programming （MINLP） , which is generally nondeterministic in polynomial time. A Lagrangian dual method is thus employed to reformulate the video distortion minimization problem, based on which the sub-gradient algorithm is used to determine a relaxed solution. Thereafter, applying the iterative user removal yields the optimal joint channel selection and power control solution to the original MINLP problem. Extensive simulations validate our proposed scheme and demonstrate that it significantly increases the peak signal- to-noise ratio （PSNR） compared with the existing schemes.

关键词： channel selection power control Cognitive radio networks D2D communications video streaming convex optimization

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Delay optimization scheduling algorithm in Cognitive radio networks

引用

Journal of Beijing Institute of Technology 2016年第2期25卷 271-277页

作者：柴争义汪宏海 School of Computer Science and Software Engineering Tianjin Polytechnic UniversityTianjin 300384China Department of Mathematics and Information Science Zhoukou Normal UniversityZhoukou 455001China Tourism College of Zhejiang China Hangzhou 311231China

In Cognitive radio networks,delay scheduling optimization has attracted an increasing attention in recent years. Numerous researches have been performed on it with different scenarios. However,these approaches have either high computational complexity or relatively poor performance. Delay scheduling is a constraint optimization problem with non-deterministic polynomial（ NP） hard feathers. In this paper,we proposed an immune algorithm-based suboptimal method to solve the problem. Suitable immune operators have been designed such as encoding,clone,mutation and selection. The simulation results show that the proposed algorithm yields near-optimal performance and operates with much lower computational complexity.

关键词： Cognitive radio networks delay scheduling immune algorithm interference temperature

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：