The performance of Rayleigh fading channels is substantially impacted by the impacts of relays, antennas, and the number of branches. Opportunistic relaying is a potent technique for enhancing the effects of the afore...The performance of Rayleigh fading channels is substantially impacted by the impacts of relays, antennas, and the number of branches. Opportunistic relaying is a potent technique for enhancing the effects of the aforementioned factors while enhancing the performance of fading channels. Due to these issues, a secure wireless multicasting scenario using opportunistic relaying over Rayleigh fading channel in the presence of multiple wiretappers is taken into consideration in this study. So the investigation of a secure wireless multicasting scenario using opportunistic relaying over Rayleigh fading channel in the presence of multiple wiretappers is the focus of this paper. The primary goals of this study are to maximize security in wireless multicasting while minimizing security loss caused by the effects of relays, branches at destinations and wiretappers, as well as multicast users and wiretappers through opportunistic relaying. To comprehend the insight effects of prior parameters, the closed form analytical expressions are constructed for the probability of non-zero secrecy multicast capacity (PNSMC), ergodic secrecy multicast capacity (ESMC), and secure outage probability for multicasting (SOPM). The findings demonstrate that opportunistic relaying is a successful method for reducing the loss of security in multicasting.展开更多
With the development of astronautic technology, communication satellites now have a tremendous gain in both quantity and quality, and have already shown their capability on multi-functional converged communication oth...With the development of astronautic technology, communication satellites now have a tremendous gain in both quantity and quality, and have already shown their capability on multi-functional converged communication other than telecommunication. Under this circumstance, increasing the transmission efficiency of satellite communication network becomes a top priority. In this paper, we focus on content delivery service on satellite networks, where each ground station may have prefetched some file fragments. We cast this problem into a coded caching framework so as to exploit the coded multicast gain for minimizing the satellite communication load. We first propose an optimization-based coded multicast scheme by considering the special property that the satellite network topology is predictable and timevariant. Then, a greedy based fast algorithm is proposed, which can tremendously reduce the computation complexity with a small loss in optimality. Simulation experiments conducted on two Walker constellation satellite networks show that our proposed coded multicast method can efficiently reduce the communication load of satellite networks.展开更多
The additional diversity gain provided by the relays improves the secrecy capacity of communications system significantly. The multiple hops in the relaying system is an important technique to improve this diversity g...The additional diversity gain provided by the relays improves the secrecy capacity of communications system significantly. The multiple hops in the relaying system is an important technique to improve this diversity gain. The development of an analytical mathematical model of ensuring security in multicasting through fading channels incorporating this benefit of multi-hop relaying is still an open problem. Motivated by this issue, this paper considers a secure wireless multicasting scenario employing multi-hop relaying technique over frequency selective Nakagami-m fading channel and develops an analytical mathematical model to ensure the security against multiple eavesdroppers. This mathematical model has been developed based on the closed-form analytical expressions of the probability of non-zero secrecy multicast capacity (PNSMC) and the secure outage probability for multicasting (SOPM) to ensure the security in the presence of multiple eavesdroppers. Moreover, the effects of the fading parameter of multicast channel, the number of hops and eavesdropper are investigated. The results show that the security in multicasting through Nakagami-m fading channel with multi-hop relaying system is more sensitive to the number of hops and eavesdroppers. The fading of multicast channel helps to improve the secrecy multicast capacity and is not the enemy of security in multicasting.展开更多
Delay and stability are two key factors that affect the performance of multicast data transmission in a network.However,current algorithms of tree generation hardly meet the requirements of low delay and high sta-bili...Delay and stability are two key factors that affect the performance of multicast data transmission in a network.However,current algorithms of tree generation hardly meet the requirements of low delay and high sta-bility simultaneously.Given a general network,the generation algorithm of a multicast tree with minimum delay and maximum stability is an NP-hard problem,without a precise and efficient algorithm.To address these challenges,this paper studies the generation of low-delay and high-stability multicast trees under the model of spanning tree based on stability probability,degree-constrained,edge-weighted for multicast(T-SDE).A class of algorithms was proposed which creates the multicast tree greedy on the ratio of fan-out to delay(RFD)and probability of stability of terminal to obtain a high performance in multicast.The proposed algorithms greedily select terminals with a large RFD and a high probability of stability as forwarding nodes in the generation of the multicast tree,where the larger RFD and higher stability of upstream nodes are beneficial to achieve a low transmission delay and high stability in multicast.The proposed RFD can be compatible with the original model,which can take advantage of network connectivity during the generation of a multicast tree.This paper carries out simulation experiments on Matlab R2016b to measure the performance of the proposed algorithm.Experimental results show that the proposed algorithm can provide a smaller height,higher stability,and a lower transmission delay of the resulting multicast tree than other solutions.The spanning tree of the proposed algorithms can support low transmission delay and high stability in multicast transmission.展开更多
Rate-splitting multiple access(RSMA)can cope with a wide range of propagation conditions in multigroup multicast communications through rate splitting optimization.To breakthrough the grouprate limited bottleneck,reco...Rate-splitting multiple access(RSMA)can cope with a wide range of propagation conditions in multigroup multicast communications through rate splitting optimization.To breakthrough the grouprate limited bottleneck,reconfigurable intelligent surface(RIS)technique can be introduced to assist wireless communications through enhancing the channel quality.In RIS-aided RSMA multigroup multicasting,how to provide fair and high-quality multiuser service under power and spectrum constraints is essential.In this paper,we propose a max-min fair RIS-aided rate-splitting multiple access(MMF-RISRSMA)scheme for multigroup multicast communications,where the rate fairness is obtained by maximizing the minimum group-rate.In doing so,we jointly optimize the beamformers,the rate splitting vector at the transmitter,as well as the phase shifts at RIS.To solve it,we divide the original optimization problem into two subproblems and alternately optimize the variables.The beamforming and rate splitting optimization subproblem is solved by using the successive convex approximation technique.The phase shift optimization subproblem is solved through the penalty function method to achieve a rank-one locally optimal solution.Simulations demonstrate that the proposed MMF-RIS-RSMA scheme can obtain significant performance gain in terms of the minimum group-rate.展开更多
As an alternative of Internet protocol(IP)multicast,application layer multicast(ALM)is widely used with the advantage of simplicity and flexibility.However,the existing problems of large transmission delay and poor st...As an alternative of Internet protocol(IP)multicast,application layer multicast(ALM)is widely used with the advantage of simplicity and flexibility.However,the existing problems of large transmission delay and poor stability limit the application and development.In this article,to solve these problems,an ALM model based on node potential(NP)and topological index(TI)is proposed.The proposed model considers the factors of node capability and node distance in constructing and maintaining multicast tree to reduce transmission delay and increase stability,and thus it improves the application level in real-time multimedia multicast.The computer simulations prove that the proposed model reduces the ALM transmission delay,increases multicast tree stability effectively,and improves the ALM performance,and therefore it is suitable to apply in large-scale real-time multimedia environment.展开更多
文摘The performance of Rayleigh fading channels is substantially impacted by the impacts of relays, antennas, and the number of branches. Opportunistic relaying is a potent technique for enhancing the effects of the aforementioned factors while enhancing the performance of fading channels. Due to these issues, a secure wireless multicasting scenario using opportunistic relaying over Rayleigh fading channel in the presence of multiple wiretappers is taken into consideration in this study. So the investigation of a secure wireless multicasting scenario using opportunistic relaying over Rayleigh fading channel in the presence of multiple wiretappers is the focus of this paper. The primary goals of this study are to maximize security in wireless multicasting while minimizing security loss caused by the effects of relays, branches at destinations and wiretappers, as well as multicast users and wiretappers through opportunistic relaying. To comprehend the insight effects of prior parameters, the closed form analytical expressions are constructed for the probability of non-zero secrecy multicast capacity (PNSMC), ergodic secrecy multicast capacity (ESMC), and secure outage probability for multicasting (SOPM). The findings demonstrate that opportunistic relaying is a successful method for reducing the loss of security in multicasting.
基金supported by the National Natural Science Foundation of China under Grants 61941106,61901261,12031011,and 62071026。
文摘With the development of astronautic technology, communication satellites now have a tremendous gain in both quantity and quality, and have already shown their capability on multi-functional converged communication other than telecommunication. Under this circumstance, increasing the transmission efficiency of satellite communication network becomes a top priority. In this paper, we focus on content delivery service on satellite networks, where each ground station may have prefetched some file fragments. We cast this problem into a coded caching framework so as to exploit the coded multicast gain for minimizing the satellite communication load. We first propose an optimization-based coded multicast scheme by considering the special property that the satellite network topology is predictable and timevariant. Then, a greedy based fast algorithm is proposed, which can tremendously reduce the computation complexity with a small loss in optimality. Simulation experiments conducted on two Walker constellation satellite networks show that our proposed coded multicast method can efficiently reduce the communication load of satellite networks.
文摘The additional diversity gain provided by the relays improves the secrecy capacity of communications system significantly. The multiple hops in the relaying system is an important technique to improve this diversity gain. The development of an analytical mathematical model of ensuring security in multicasting through fading channels incorporating this benefit of multi-hop relaying is still an open problem. Motivated by this issue, this paper considers a secure wireless multicasting scenario employing multi-hop relaying technique over frequency selective Nakagami-m fading channel and develops an analytical mathematical model to ensure the security against multiple eavesdroppers. This mathematical model has been developed based on the closed-form analytical expressions of the probability of non-zero secrecy multicast capacity (PNSMC) and the secure outage probability for multicasting (SOPM) to ensure the security in the presence of multiple eavesdroppers. Moreover, the effects of the fading parameter of multicast channel, the number of hops and eavesdropper are investigated. The results show that the security in multicasting through Nakagami-m fading channel with multi-hop relaying system is more sensitive to the number of hops and eavesdroppers. The fading of multicast channel helps to improve the secrecy multicast capacity and is not the enemy of security in multicasting.
基金supported by the Hainan Provincial Natural Science Foundation of China(620RC560,2019RC096,620RC562)the Scientific Research Setup Fund of Hainan University(KYQD(ZR)1877)+2 种基金the National Natural Science Foundation of China(62162021,61802092,82160345,61862020)the key research and development program of Hainan province(ZDYF2020199,ZDYF2021GXJS017)the key science and technology plan project of Haikou(2011-016).
文摘Delay and stability are two key factors that affect the performance of multicast data transmission in a network.However,current algorithms of tree generation hardly meet the requirements of low delay and high sta-bility simultaneously.Given a general network,the generation algorithm of a multicast tree with minimum delay and maximum stability is an NP-hard problem,without a precise and efficient algorithm.To address these challenges,this paper studies the generation of low-delay and high-stability multicast trees under the model of spanning tree based on stability probability,degree-constrained,edge-weighted for multicast(T-SDE).A class of algorithms was proposed which creates the multicast tree greedy on the ratio of fan-out to delay(RFD)and probability of stability of terminal to obtain a high performance in multicast.The proposed algorithms greedily select terminals with a large RFD and a high probability of stability as forwarding nodes in the generation of the multicast tree,where the larger RFD and higher stability of upstream nodes are beneficial to achieve a low transmission delay and high stability in multicast.The proposed RFD can be compatible with the original model,which can take advantage of network connectivity during the generation of a multicast tree.This paper carries out simulation experiments on Matlab R2016b to measure the performance of the proposed algorithm.Experimental results show that the proposed algorithm can provide a smaller height,higher stability,and a lower transmission delay of the resulting multicast tree than other solutions.The spanning tree of the proposed algorithms can support low transmission delay and high stability in multicast transmission.
基金supported in part by the Project of International Cooperation and Exchanges NSFC under Grant No.61860206005in part by the National Natural Science Foundation of China under Grant No.62201329,No.62171262in part by Shandong Provincial Natural Science Foundation under Grant ZR2021YQ47。
文摘Rate-splitting multiple access(RSMA)can cope with a wide range of propagation conditions in multigroup multicast communications through rate splitting optimization.To breakthrough the grouprate limited bottleneck,reconfigurable intelligent surface(RIS)technique can be introduced to assist wireless communications through enhancing the channel quality.In RIS-aided RSMA multigroup multicasting,how to provide fair and high-quality multiuser service under power and spectrum constraints is essential.In this paper,we propose a max-min fair RIS-aided rate-splitting multiple access(MMF-RISRSMA)scheme for multigroup multicast communications,where the rate fairness is obtained by maximizing the minimum group-rate.In doing so,we jointly optimize the beamformers,the rate splitting vector at the transmitter,as well as the phase shifts at RIS.To solve it,we divide the original optimization problem into two subproblems and alternately optimize the variables.The beamforming and rate splitting optimization subproblem is solved by using the successive convex approximation technique.The phase shift optimization subproblem is solved through the penalty function method to achieve a rank-one locally optimal solution.Simulations demonstrate that the proposed MMF-RIS-RSMA scheme can obtain significant performance gain in terms of the minimum group-rate.
基金National Natural Science Foundation of China(Nos.71171045 and 61801107)。
文摘As an alternative of Internet protocol(IP)multicast,application layer multicast(ALM)is widely used with the advantage of simplicity and flexibility.However,the existing problems of large transmission delay and poor stability limit the application and development.In this article,to solve these problems,an ALM model based on node potential(NP)and topological index(TI)is proposed.The proposed model considers the factors of node capability and node distance in constructing and maintaining multicast tree to reduce transmission delay and increase stability,and thus it improves the application level in real-time multimedia multicast.The computer simulations prove that the proposed model reduces the ALM transmission delay,increases multicast tree stability effectively,and improves the ALM performance,and therefore it is suitable to apply in large-scale real-time multimedia environment.