A low-complexity optimization scheme is proposed to balance the tradeoff between system capacity and proportional fairness in orthogonal frequency division multiple access(OFDMA) based multicast systems. The major cha...A low-complexity optimization scheme is proposed to balance the tradeoff between system capacity and proportional fairness in orthogonal frequency division multiple access(OFDMA) based multicast systems. The major challenge is to solve the non-convexity optimization problem with strict proportional fairness. Constrained team progress algorithm(CTPA) solves this non-convexity problem by allocating sub-channels to each group based on sub-channel gains and proportional fairness constraint. Mapping power algorithm(MPA) guarantees strict proportional fairness with efficient power allocation which utilizes the mapping relation between power and throughput. CTPA-MPA is analyzed in three aspects: complexity, fairness and efficiency. We numerically show that when the system capacity is slightly increased in lower power region compared with several previous approaches, CTPA-MPA improves the proportional fairness in a typical scenario with 4 groups over 16 sub-channels, while reducing the complexity from exponential to linear in the number of sub-channels. It is also proved available in a more complicated system.展开更多
Multimedia data traffic occupies more than 70% of the Internet traffic and is still growing. On-demand video is already a major video content platform and private broadcast is getting more popular. In addition to this...Multimedia data traffic occupies more than 70% of the Internet traffic and is still growing. On-demand video is already a major video content platform and private broadcast is getting more popular. In addition to this, virtual reality （VR） and augmented reali- ty （AR） data traffic is increasing very fast. To provide the good quality of the multimediaservice, huge amount of resource is need- ed because users ＇ service experience is usually proportional to the video rates they can receive. Moreover, the variation of the bandwidth also affects to the users＇ experience, w-hile more users w-ant to use their mobile devices to see multimedia data by ac- cessing the network through wireless links, such as Long Term Evolution （LTE） and Wi-Fi. Therefore, better spectral efficiency during wireless transmission and video rate adaptation to provide better quality to users are in great demand. Multicast system is one of the technologies that can improve the spectral efficiency drastically, and Dynamic Adaptive Streaming over HTTP （DASH） is one of the most popular video rate adaptation platforms. In this paper, we investigate the state-of-the-art video multicast technol- ogies. LTE supports the multicast service through evolved Multimedia Broadcast Multicast Service （eMBMS） systems, and there are different algorithms to perform the video multicast along with adaptive video quality control. The algorithms include the proce- dure to decide the video rates, resource allocations, and user groupings. Moreover, we propose a novel approach to improve the quality of experience for DASH-VR video multicast systems.展开更多
As the cornerstone of future information security,quantum key distribution(QKD)is evolving towards large-scale hybrid discrete-variable/continuous-variable(DV/CV)multi-domain quantum networks.Meanwhile,multicast-orien...As the cornerstone of future information security,quantum key distribution(QKD)is evolving towards large-scale hybrid discrete-variable/continuous-variable(DV/CV)multi-domain quantum networks.Meanwhile,multicast-oriented multi-party key negotiation is attracting increasing attention in quantum networks.However,the efficient key provision for multicast services over hybrid DV/CV multi-domain quantum networks remains challenging,due to the limited probability of service success and the inefficient utilization of key resources.Targeting these challenges,this study proposes two key-resource-aware multicast-oriented key provision strategies,namely the link distance-resource balanced key provision strategy and the maximum shared link key provision strategy.The proposed strategies are applicable to hybrid DV/CV multi-domain quantum networks,which are typically implemented by GG02-based intra-domain connections and BB84-based inter-domain connections.Furthermore,the multicast-oriented key provision model is formulated,based on which two heuristic algorithms are designed,i.e.,the shared link distance-resource(SLDR)dependent and the maximum shared link distance-resource(MSLDR)dependent multicast-oriented key provision algorithms.Simulation results verify the applicability of the designed algorithms across different multi-domain quantum networks,and demonstrate their superiority over the benchmark algorithms in terms of the success probability of multicast service requests,the number of shared links,and the key resource utilization.展开更多
This paper considers a secure multigroup multicast multiple-input single-output(MISO)communication system aided by an intelligent reflecting surface(IRS).Specifically,we aim to minimize the transmit power at Alice via...This paper considers a secure multigroup multicast multiple-input single-output(MISO)communication system aided by an intelligent reflecting surface(IRS).Specifically,we aim to minimize the transmit power at Alice via jointly optimizing the transmit beamformer,artificial noise(AN)vector and phase shifts at the IRS subject to the secrecy rate constraints as well as the unit modulus constraints of IRS phase shifts.To tackle the optimization problem,we first transform it into a semidefinite relaxation(SDR)problem,and then alternately update the transmit beamformer and AN matrix as well as the phase shifts at the IRS.In order to reduce the high computational complexity,we further propose a low-complexity algorithm based on second-order cone programming(SOCP).We decouple the optimization problem into two sub-problems and optimize the transmit beamformer,AN vector and the phase shifts alternately by solving two corresponding SOCP subproblem.Simulation results show that the proposed SDR and SOCP schemes require half or less transmit power than the scheme without IRS,which demonstrates the advantages of introducing IRS and the effectiveness of the proposed methods.展开更多
To decrease the cost of exchanging load information among processors, a dynamic load-balancing （DLB） algorithm which adopts multieast tree technology is proposed. The muhieast tree construction rules are also propos...To decrease the cost of exchanging load information among processors, a dynamic load-balancing （DLB） algorithm which adopts multieast tree technology is proposed. The muhieast tree construction rules are also proposed to avoid wrongly transferred or redundant DLB messages due to the overlapping of multicast trees. The proposed DLB algorithm is distributed controlled, sender initiated and can help heavily loaded processors with complete distribution of redundant loads with minimum number of executions. Experiments were executed to compare the effects of the proposed DLB algorithm and other three ones, the results prove the effectivity and practicability of the proposed algorithm in dealing with great scale compute-intensive tasks.展开更多
The recent growth of the World Wide Web has sparked new research into using the Internet for novel types of group communication, like multiparty videoconferencing and real-time streaming. Multicast has the potential t...The recent growth of the World Wide Web has sparked new research into using the Internet for novel types of group communication, like multiparty videoconferencing and real-time streaming. Multicast has the potential to be very useful, but it suffers from many problems like security. To achieve secure multicast communications with the dynamic aspect of group applications due to free membership joins and leaves in addition to member's mobility, key management is one of the most critical problems. So far, a lot of multicast key management schemes have been proposed and most of them are centralized, which have the problem of 'one point failure' and that the group controller is the bottleneck of the group. In order to solve these two problems, we propose a Key Management Scheme, using cluster-based End-System Multicast (ESM). The group management is between both 1) the main controller (MRP, Main Rendezvous Point) and the second controllers (CRP, Cluster RP), and 2) the second controllers (CRPs) and its members. So, ESM simplifies the implementation of group communication and is efficient ways to deliver a secure message to a group of recipients in a network as a practical alternative to overcome the difficulty of large scale deployment of traditional IP multicast. In this paper, we analyze different key management schemes and propose a new scheme, namely Advanced Transition/Cluster Key management Scheme (ATCKS) and find it has appropriate performance in security.展开更多
Within a cell of cellular system,cooperative relay technique can improve the performance of multicast efficiently,but it can cause the stream frequent interruptions because of the mobility of relay terminals.A video l...Within a cell of cellular system,cooperative relay technique can improve the performance of multicast efficiently,but it can cause the stream frequent interruptions because of the mobility of relay terminals.A video layered cooperative relay strategy is proposed to guarantee the continuity of multicast stream and retain high-bandwidth of the cooperative relay channel.Based on the capacity analysis for layered relay channel in the strategy,the optimal power allocation is studied to maximize capacity.After analyzing and optimizing the capacity in abstract models,the study is extended to a non-fading and a Gaussian wireless channel model to satisfy the scenario of cellular system.Giving the relay nodes position or distribution of noise power,the obtained results can determine the optimal power allocation among the transmitter and relay nodes.At last,the simulation results show that the strategy and its optimal power allocation have a significant improvement on the performance.展开更多
Onboard resources are limited for multibeam satellite communication systems,while differences exist in traffic demands among users.Since conventional multigroup multicast precoding methods do not take traffic demands ...Onboard resources are limited for multibeam satellite communication systems,while differences exist in traffic demands among users.Since conventional multigroup multicast precoding methods do not take traffic demands for users into consideration,it is difficult to flexibly adjust the offered throughput to users’demands.Users with higher demand may obtain lower throughput while users with lower demand may be over-satisfied,which results in the requested-offered throughput mismatch and resource waste.This paper proposes a fair multigroup multicast precoding design based on traffic demands.To obtain the precoding design,the optimization problem aimed at maximizing the minimum throughput satisfaction ratio,which is defined as the ratio of the offered throughput to the traffic demand,is formulated,so as to provide fair service for all users while satisfying per-feed power constraints and traffic demand constraints.To address this problem,an auxiliary variable is first introduced to equivalently simplify it.Then,the semidefinite relaxation and the bisection search strategies are adopted to further handle the problem.Finally,the optimal precoding vectors are obtained by employing eigenvalue decomposition or Gaussian randomization.Simulation results indicate the effectiveness of the proposed precoding algorithm and demonstrate that it can better adapt to the scenarios with different traffic demands.展开更多
Providing end-to-end delay guarantees in traditional Internet is a complex task due to the distributed nature of TCP/IP protocols. Software Defined Networking(SDN) gives a new dimension to improve QoS(Quality of Servi...Providing end-to-end delay guarantees in traditional Internet is a complex task due to the distributed nature of TCP/IP protocols. Software Defined Networking(SDN) gives a new dimension to improve QoS(Quality of Service) as it can benefit from its flexibility, programmability and centralized view. In this paper, we provide delay-guaranteed data transmission service instead of "best efforts" service for a topic-based publish/subscribe system by means of exploring these specific features of SDN. We attribute this routing problem in such conditions to Delay-Constraint Lowest Cost Steiner Tree(DCLCST) problem. To solve it, we compute the shortest delay paths from source node to every subscribe node and the shortest cost paths from every subscribe node to any other node using dijkstra algorithm. Then we construct a delay-constraint least cost steiner tree for per-topic based on these paths as multicast tree. We also present experimental results to demonstrate the effectiveness of the algorithms and methods we proposed.展开更多
The current multicast model provides no access control mechanism. Any host can send data directly to a multicast address or join a multicast group to become a member, which brings safety problems to multicast. In this...The current multicast model provides no access control mechanism. Any host can send data directly to a multicast address or join a multicast group to become a member, which brings safety problems to multicast. In this paper, we present a new active multicast group access control mechanism that is founded on trust management. This structure can solve the problem that exists in multicast members＇ access control and distributing authorization of traditional IP multicast.展开更多
To minimize the total transmit power for multicast service in an orthogonal frequency division multiplexing（OFDM） downlink system,resource allocation algorithms that adaptively allocate subcarriers and bits are prop...To minimize the total transmit power for multicast service in an orthogonal frequency division multiplexing（OFDM） downlink system,resource allocation algorithms that adaptively allocate subcarriers and bits are proposed.The proposed algorithms select users with good channel conditions for each subcarrier to reduce the transmit power,while guaranteeing each user＇s instantaneous minimum rate requirement.The resource allocation problem is first formulated as an integer programming（IP） problem,and then,a full search algorithm that achieves an optimal solution is presented.To reduce the computation load,a suboptimal algorithm is proposed.This suboptimal algorithm decouples the joint resource allocation problem by separating subcarrier and bit allocation.Greedy-like algorithms are employed in both procedures.Simulation results illustrate that the proposed algorithms can significantly reduce the transmit power compared with the conventional multicast approach and the performance of the suboptimal algorithm is close to the optimum.展开更多
Nowadays, Health Care Training-based System (HCTS) is a vital component in the education and training of health care in 3D Virtual Environment (VE). The practice of HCTS continues to grow at rapid pace throughout all ...Nowadays, Health Care Training-based System (HCTS) is a vital component in the education and training of health care in 3D Virtual Environment (VE). The practice of HCTS continues to grow at rapid pace throughout all of the healthcare disciplines, however research in this field is still in its early stage. Increasingly, decision makers and developers look forward to offer more sophisticated, much larger, and more complex HCTS to serve the desired outcome and improve the quality and safety of patient care. Due to the rapidly increasing usage of personal mobile devices and the need of executing HCTS applications in environments that have no previous network infrastructure available, Mobile Health Care Training-based System (MHCTS) is an expected future trend. In such systems, medical staff will share and collaborate in a 3D virtual environment through their mobile devices in an ad-hoc network (MANET) in order to accomplish specific missions’ typically surgical emergency room. Users are organized into various groups (Radiologists, Maternity departments, and General surgery etc...), and need to be managed by a multicast scheme to save network bandwidth and offer immersive sense. MHCTS is sensitive to networking issues, since interactive 3D graphics requires additional load due to the use of mobile devices. Therefore, we need to emphasize on the importance and the improvement of multicast techniques for the effectiveness of MHCTS and the management of collaborative group interaction. Research so far has devoted little attention to the network communication protocols design of such systems which is crucial to preserve the sense of immersion for participating users. In this paper, we investigate the effect of multicast routing protocol in advancing the field of Health care Training-based System to the benefit of patient’s safety, and health care professional. Also, we address the issue of selecting a multicast protocol to provide the best performance for a particular e-health system at any time. Previous work has demonstrated that multicast operates at least as efficiently as traditional MAODV. A comprehensive analysis about various ad-hoc multicast routing protocols is proposed. The selection key factors for the right protocol for MHCTS applications were safety and robustness. To the best of our knowledge, this work will be the first initiative involving systematic literature reviews to identify a research gate for the use of multicast protocol in health care simulation learning community.展开更多
It is widely believed that cooperative relay technologies can improve the throughput of multicasting in mobile cellular networks significantly, however, the mobility of the relay terrninals may cause frequent relay li...It is widely believed that cooperative relay technologies can improve the throughput of multicasting in mobile cellular networks significantly, however, the mobility of the relay terrninals may cause frequent relay link outage. This paper proposes a stream layered cooperative relay scheme to deal with this problem. In order to study the characteristics of layered relay channels in the scheme, the capacity region is determined based on a single and a multi relay abstract model with streams layering. Besides, to satisfy the cellular network scenario, the results are extended to a wireless Gaussian channel model. The analysis and simulation results show that the scheme guarantees the continuity of the multicast streams, and maintains the high bandwidth of relay channel, with a slight loss on system capacity.展开更多
We propose two rate control schemes for multi-antenna multicast in OFDM systems, which aim to maximize the minimum average rate over all users in a multicast group. In our system, we do not require all multicast users...We propose two rate control schemes for multi-antenna multicast in OFDM systems, which aim to maximize the minimum average rate over all users in a multicast group. In our system, we do not require all multicast users to successfully recover the signals received on each subcarrier. In contrast, we allow certain loss for multicast users, such that the multicast transmission rate can be increased. We assume that the loss-repairing can be completed at upper protocol layers via advanced fountain codes. Following this principle, we formulate the rate control problem via beamforming in multi-antenna multicast to optimize the minimum achievable rate for all multicast users. While the computation complexity to solve for the optimal beamformer is prohibitively high, we propose a suboptimal iterative rate control scheme. Moreover, we modify the above optimization problem by selecting a ?xed proportion of users on each subcarrier. The beamformer searching process will then be performed only based on the selected users on each subcarrier, such that the complexity can be further reduced. We also solve this new problem with a low complexity approach. Theoretical analyses and simulation results show that our proposed two rate control schemes can have higher minimum average rate than the baseline scheme without rate control, while achieving low complexity.展开更多
Orbital angular momentum(OAM),described by an azimuthal phase term expej lθT,has unbound orthogonal states with different topological charges l.Therefore,with the explosive growth of global communication capacity,esp...Orbital angular momentum(OAM),described by an azimuthal phase term expej lθT,has unbound orthogonal states with different topological charges l.Therefore,with the explosive growth of global communication capacity,especially for short-distance optical interconnects,light-carrying OAM has proved its great potential to improve transmission capacity and spectral efficiency in the space-division multiplexing system due to its orthogonality,security,and compatibility with other techniques.Meanwhile,100-m freespace optical interconnects become an alternative solution for the“last mile”problem and provide interbuilding communication.We experimentally demonstrate a 260-m secure optical interconnect using OAM multiplexing and 16-ary quadrature amplitude modulation(16-QAM)signals.We study the beam wandering,power fluctuation,channel cross talk,bit-error-rate performance,and link security.Additionally,we also investigate the link performance for 1-to-9 multicasting at the range of 260 m.Considering that the power distribution may be affected by atmospheric turbulence,we introduce an offline feedback process to make it flexibly controllable.展开更多
Effective propagation of information among multiple users is the purpose of realizing large-scale quantum communication networks. In this paper, multicast protocols for any single, two and three qubits with real ampli...Effective propagation of information among multiple users is the purpose of realizing large-scale quantum communication networks. In this paper, multicast protocols for any single, two and three qubits with real amplitude and complex phase information are presented. They were realized using a composite of Greenberger–Horne–Zeilinger states as shared channels. Joint remote state preparation was the main method for completing quantum multicast. At the same time, quantum state tomography of the schemes was carried out on the IBM Quantum platform.The obtained states were compared with the target states by fidelity. The analysis of communication efficiency and noise effects shows that our protocol has advantages in the case of complex coefficients.展开更多
文摘A low-complexity optimization scheme is proposed to balance the tradeoff between system capacity and proportional fairness in orthogonal frequency division multiple access(OFDMA) based multicast systems. The major challenge is to solve the non-convexity optimization problem with strict proportional fairness. Constrained team progress algorithm(CTPA) solves this non-convexity problem by allocating sub-channels to each group based on sub-channel gains and proportional fairness constraint. Mapping power algorithm(MPA) guarantees strict proportional fairness with efficient power allocation which utilizes the mapping relation between power and throughput. CTPA-MPA is analyzed in three aspects: complexity, fairness and efficiency. We numerically show that when the system capacity is slightly increased in lower power region compared with several previous approaches, CTPA-MPA improves the proportional fairness in a typical scenario with 4 groups over 16 sub-channels, while reducing the complexity from exponential to linear in the number of sub-channels. It is also proved available in a more complicated system.
文摘Multimedia data traffic occupies more than 70% of the Internet traffic and is still growing. On-demand video is already a major video content platform and private broadcast is getting more popular. In addition to this, virtual reality （VR） and augmented reali- ty （AR） data traffic is increasing very fast. To provide the good quality of the multimediaservice, huge amount of resource is need- ed because users ＇ service experience is usually proportional to the video rates they can receive. Moreover, the variation of the bandwidth also affects to the users＇ experience, w-hile more users w-ant to use their mobile devices to see multimedia data by ac- cessing the network through wireless links, such as Long Term Evolution （LTE） and Wi-Fi. Therefore, better spectral efficiency during wireless transmission and video rate adaptation to provide better quality to users are in great demand. Multicast system is one of the technologies that can improve the spectral efficiency drastically, and Dynamic Adaptive Streaming over HTTP （DASH） is one of the most popular video rate adaptation platforms. In this paper, we investigate the state-of-the-art video multicast technol- ogies. LTE supports the multicast service through evolved Multimedia Broadcast Multicast Service （eMBMS） systems, and there are different algorithms to perform the video multicast along with adaptive video quality control. The algorithms include the proce- dure to decide the video rates, resource allocations, and user groupings. Moreover, we propose a novel approach to improve the quality of experience for DASH-VR video multicast systems.
基金supported by the National Natural Science Foundation of China(Grant Nos.62201276,62350001,U22B2026,and 62425105)the Innovation Program for Quantum Science and Technology(Grant No.2021ZD0300701)the Key R&D Program(Industry Foresight and Key Core Technologies)of Jiangsu Province(Grant No.BE2022071)。
文摘As the cornerstone of future information security,quantum key distribution(QKD)is evolving towards large-scale hybrid discrete-variable/continuous-variable(DV/CV)multi-domain quantum networks.Meanwhile,multicast-oriented multi-party key negotiation is attracting increasing attention in quantum networks.However,the efficient key provision for multicast services over hybrid DV/CV multi-domain quantum networks remains challenging,due to the limited probability of service success and the inefficient utilization of key resources.Targeting these challenges,this study proposes two key-resource-aware multicast-oriented key provision strategies,namely the link distance-resource balanced key provision strategy and the maximum shared link key provision strategy.The proposed strategies are applicable to hybrid DV/CV multi-domain quantum networks,which are typically implemented by GG02-based intra-domain connections and BB84-based inter-domain connections.Furthermore,the multicast-oriented key provision model is formulated,based on which two heuristic algorithms are designed,i.e.,the shared link distance-resource(SLDR)dependent and the maximum shared link distance-resource(MSLDR)dependent multicast-oriented key provision algorithms.Simulation results verify the applicability of the designed algorithms across different multi-domain quantum networks,and demonstrate their superiority over the benchmark algorithms in terms of the success probability of multicast service requests,the number of shared links,and the key resource utilization.
基金supported in part by the National Natural Science Foundation of China under Grants 62071234,61901121 and 61771244in part by the Natural Science Research Project of Education Department of Anhui Province of China under Grant KJ2019A1002.
文摘This paper considers a secure multigroup multicast multiple-input single-output(MISO)communication system aided by an intelligent reflecting surface(IRS).Specifically,we aim to minimize the transmit power at Alice via jointly optimizing the transmit beamformer,artificial noise(AN)vector and phase shifts at the IRS subject to the secrecy rate constraints as well as the unit modulus constraints of IRS phase shifts.To tackle the optimization problem,we first transform it into a semidefinite relaxation(SDR)problem,and then alternately update the transmit beamformer and AN matrix as well as the phase shifts at the IRS.In order to reduce the high computational complexity,we further propose a low-complexity algorithm based on second-order cone programming(SOCP).We decouple the optimization problem into two sub-problems and optimize the transmit beamformer,AN vector and the phase shifts alternately by solving two corresponding SOCP subproblem.Simulation results show that the proposed SDR and SOCP schemes require half or less transmit power than the scheme without IRS,which demonstrates the advantages of introducing IRS and the effectiveness of the proposed methods.
基金the National Natural Science Foundation of China(69973007)
文摘To decrease the cost of exchanging load information among processors, a dynamic load-balancing （DLB） algorithm which adopts multieast tree technology is proposed. The muhieast tree construction rules are also proposed to avoid wrongly transferred or redundant DLB messages due to the overlapping of multicast trees. The proposed DLB algorithm is distributed controlled, sender initiated and can help heavily loaded processors with complete distribution of redundant loads with minimum number of executions. Experiments were executed to compare the effects of the proposed DLB algorithm and other three ones, the results prove the effectivity and practicability of the proposed algorithm in dealing with great scale compute-intensive tasks.
文摘The recent growth of the World Wide Web has sparked new research into using the Internet for novel types of group communication, like multiparty videoconferencing and real-time streaming. Multicast has the potential to be very useful, but it suffers from many problems like security. To achieve secure multicast communications with the dynamic aspect of group applications due to free membership joins and leaves in addition to member's mobility, key management is one of the most critical problems. So far, a lot of multicast key management schemes have been proposed and most of them are centralized, which have the problem of 'one point failure' and that the group controller is the bottleneck of the group. In order to solve these two problems, we propose a Key Management Scheme, using cluster-based End-System Multicast (ESM). The group management is between both 1) the main controller (MRP, Main Rendezvous Point) and the second controllers (CRP, Cluster RP), and 2) the second controllers (CRPs) and its members. So, ESM simplifies the implementation of group communication and is efficient ways to deliver a secure message to a group of recipients in a network as a practical alternative to overcome the difficulty of large scale deployment of traditional IP multicast. In this paper, we analyze different key management schemes and propose a new scheme, namely Advanced Transition/Cluster Key management Scheme (ATCKS) and find it has appropriate performance in security.
基金Sponsored by State Key Program of National Natural Science of China(Grant No.60832009)Natural Science Foundation of Beijing,China(Grant No.4102044)+1 种基金Innovative Project for Young Researchers in Central Higher Education Institutions,China(Grant No.2009RC0119New Generation of Broadband Wireless Mobile Communication Networks of Major Projects of National Science and Technology(Grant No.2009ZX03003-003-01)
文摘Within a cell of cellular system,cooperative relay technique can improve the performance of multicast efficiently,but it can cause the stream frequent interruptions because of the mobility of relay terminals.A video layered cooperative relay strategy is proposed to guarantee the continuity of multicast stream and retain high-bandwidth of the cooperative relay channel.Based on the capacity analysis for layered relay channel in the strategy,the optimal power allocation is studied to maximize capacity.After analyzing and optimizing the capacity in abstract models,the study is extended to a non-fading and a Gaussian wireless channel model to satisfy the scenario of cellular system.Giving the relay nodes position or distribution of noise power,the obtained results can determine the optimal power allocation among the transmitter and relay nodes.At last,the simulation results show that the strategy and its optimal power allocation have a significant improvement on the performance.
基金the National Key R&D Program of China(No.2020YFB1806800).
文摘Onboard resources are limited for multibeam satellite communication systems,while differences exist in traffic demands among users.Since conventional multigroup multicast precoding methods do not take traffic demands for users into consideration,it is difficult to flexibly adjust the offered throughput to users’demands.Users with higher demand may obtain lower throughput while users with lower demand may be over-satisfied,which results in the requested-offered throughput mismatch and resource waste.This paper proposes a fair multigroup multicast precoding design based on traffic demands.To obtain the precoding design,the optimization problem aimed at maximizing the minimum throughput satisfaction ratio,which is defined as the ratio of the offered throughput to the traffic demand,is formulated,so as to provide fair service for all users while satisfying per-feed power constraints and traffic demand constraints.To address this problem,an auxiliary variable is first introduced to equivalently simplify it.Then,the semidefinite relaxation and the bisection search strategies are adopted to further handle the problem.Finally,the optimal precoding vectors are obtained by employing eigenvalue decomposition or Gaussian randomization.Simulation results indicate the effectiveness of the proposed precoding algorithm and demonstrate that it can better adapt to the scenarios with different traffic demands.
基金supported in part by the National Natural Science Foundation of China under Grants U1804164, 61902112 and U1404602in part by the Science and Technology Foundation of Henan Educational Committee under Grants 19A510015, 20A520019 and 20A520020the Doctoral Research Project of Henan Normal University under Grant 5101119170149
文摘Providing end-to-end delay guarantees in traditional Internet is a complex task due to the distributed nature of TCP/IP protocols. Software Defined Networking(SDN) gives a new dimension to improve QoS(Quality of Service) as it can benefit from its flexibility, programmability and centralized view. In this paper, we provide delay-guaranteed data transmission service instead of "best efforts" service for a topic-based publish/subscribe system by means of exploring these specific features of SDN. We attribute this routing problem in such conditions to Delay-Constraint Lowest Cost Steiner Tree(DCLCST) problem. To solve it, we compute the shortest delay paths from source node to every subscribe node and the shortest cost paths from every subscribe node to any other node using dijkstra algorithm. Then we construct a delay-constraint least cost steiner tree for per-topic based on these paths as multicast tree. We also present experimental results to demonstrate the effectiveness of the algorithms and methods we proposed.
基金Supported by the National Natural Science Foun-dation of China (60363001 ,60373087 ,90104005 ,60473023)
文摘The current multicast model provides no access control mechanism. Any host can send data directly to a multicast address or join a multicast group to become a member, which brings safety problems to multicast. In this paper, we present a new active multicast group access control mechanism that is founded on trust management. This structure can solve the problem that exists in multicast members＇ access control and distributing authorization of traditional IP multicast.
基金supported by the National High Technology Research and Development Program of China (863 Program) (2008AA01Z226)
文摘To minimize the total transmit power for multicast service in an orthogonal frequency division multiplexing（OFDM） downlink system,resource allocation algorithms that adaptively allocate subcarriers and bits are proposed.The proposed algorithms select users with good channel conditions for each subcarrier to reduce the transmit power,while guaranteeing each user＇s instantaneous minimum rate requirement.The resource allocation problem is first formulated as an integer programming（IP） problem,and then,a full search algorithm that achieves an optimal solution is presented.To reduce the computation load,a suboptimal algorithm is proposed.This suboptimal algorithm decouples the joint resource allocation problem by separating subcarrier and bit allocation.Greedy-like algorithms are employed in both procedures.Simulation results illustrate that the proposed algorithms can significantly reduce the transmit power compared with the conventional multicast approach and the performance of the suboptimal algorithm is close to the optimum.
文摘Nowadays, Health Care Training-based System (HCTS) is a vital component in the education and training of health care in 3D Virtual Environment (VE). The practice of HCTS continues to grow at rapid pace throughout all of the healthcare disciplines, however research in this field is still in its early stage. Increasingly, decision makers and developers look forward to offer more sophisticated, much larger, and more complex HCTS to serve the desired outcome and improve the quality and safety of patient care. Due to the rapidly increasing usage of personal mobile devices and the need of executing HCTS applications in environments that have no previous network infrastructure available, Mobile Health Care Training-based System (MHCTS) is an expected future trend. In such systems, medical staff will share and collaborate in a 3D virtual environment through their mobile devices in an ad-hoc network (MANET) in order to accomplish specific missions’ typically surgical emergency room. Users are organized into various groups (Radiologists, Maternity departments, and General surgery etc...), and need to be managed by a multicast scheme to save network bandwidth and offer immersive sense. MHCTS is sensitive to networking issues, since interactive 3D graphics requires additional load due to the use of mobile devices. Therefore, we need to emphasize on the importance and the improvement of multicast techniques for the effectiveness of MHCTS and the management of collaborative group interaction. Research so far has devoted little attention to the network communication protocols design of such systems which is crucial to preserve the sense of immersion for participating users. In this paper, we investigate the effect of multicast routing protocol in advancing the field of Health care Training-based System to the benefit of patient’s safety, and health care professional. Also, we address the issue of selecting a multicast protocol to provide the best performance for a particular e-health system at any time. Previous work has demonstrated that multicast operates at least as efficiently as traditional MAODV. A comprehensive analysis about various ad-hoc multicast routing protocols is proposed. The selection key factors for the right protocol for MHCTS applications were safety and robustness. To the best of our knowledge, this work will be the first initiative involving systematic literature reviews to identify a research gate for the use of multicast protocol in health care simulation learning community.
基金Supported by the State Key Program of National Natural Science Foundation of China （No. 60832009）, Natural Science Foundation of Bcijing （No. 4102044）, Innovative Project for Young Researchers in Central Higher Education Institutions, China （No. 2009RC0119） and New Generation of Broadband Wireless Mobile Communication Networks of Major Projects of National Science and Technology （No.2009ZX03003-003-01）.
文摘It is widely believed that cooperative relay technologies can improve the throughput of multicasting in mobile cellular networks significantly, however, the mobility of the relay terrninals may cause frequent relay link outage. This paper proposes a stream layered cooperative relay scheme to deal with this problem. In order to study the characteristics of layered relay channels in the scheme, the capacity region is determined based on a single and a multi relay abstract model with streams layering. Besides, to satisfy the cellular network scenario, the results are extended to a wireless Gaussian channel model. The analysis and simulation results show that the scheme guarantees the continuity of the multicast streams, and maintains the high bandwidth of relay channel, with a slight loss on system capacity.
文摘We propose two rate control schemes for multi-antenna multicast in OFDM systems, which aim to maximize the minimum average rate over all users in a multicast group. In our system, we do not require all multicast users to successfully recover the signals received on each subcarrier. In contrast, we allow certain loss for multicast users, such that the multicast transmission rate can be increased. We assume that the loss-repairing can be completed at upper protocol layers via advanced fountain codes. Following this principle, we formulate the rate control problem via beamforming in multi-antenna multicast to optimize the minimum achievable rate for all multicast users. While the computation complexity to solve for the optimal beamformer is prohibitively high, we propose a suboptimal iterative rate control scheme. Moreover, we modify the above optimization problem by selecting a ?xed proportion of users on each subcarrier. The beamformer searching process will then be performed only based on the selected users on each subcarrier, such that the complexity can be further reduced. We also solve this new problem with a low complexity approach. Theoretical analyses and simulation results show that our proposed two rate control schemes can have higher minimum average rate than the baseline scheme without rate control, while achieving low complexity.
基金supported by the National Natural Science Foundation of China (Grant Nos.62125503,62261160388,and 62101198)the Natural Science Foundation of Hubei Province of China (Grant Nos.2021CFB011 and 2023AFA028)+2 种基金the Key R&D Program of Hubei Province of China (Grant Nos.2020BAB001 and 2021BAA024)Shenzhen Science and Technology Program (Grant No.JCYJ20200109114018750)the Innovation Project of Optics Valley Laboratory (Grant Nos.OVL2021BG004 and OVL2023ZD004).
文摘Orbital angular momentum(OAM),described by an azimuthal phase term expej lθT,has unbound orthogonal states with different topological charges l.Therefore,with the explosive growth of global communication capacity,especially for short-distance optical interconnects,light-carrying OAM has proved its great potential to improve transmission capacity and spectral efficiency in the space-division multiplexing system due to its orthogonality,security,and compatibility with other techniques.Meanwhile,100-m freespace optical interconnects become an alternative solution for the“last mile”problem and provide interbuilding communication.We experimentally demonstrate a 260-m secure optical interconnect using OAM multiplexing and 16-ary quadrature amplitude modulation(16-QAM)signals.We study the beam wandering,power fluctuation,channel cross talk,bit-error-rate performance,and link security.Additionally,we also investigate the link performance for 1-to-9 multicasting at the range of 260 m.Considering that the power distribution may be affected by atmospheric turbulence,we introduce an offline feedback process to make it flexibly controllable.
基金supported by the National Natural Science Foundation of China (Grant No. 12201300)。
文摘Effective propagation of information among multiple users is the purpose of realizing large-scale quantum communication networks. In this paper, multicast protocols for any single, two and three qubits with real amplitude and complex phase information are presented. They were realized using a composite of Greenberger–Horne–Zeilinger states as shared channels. Joint remote state preparation was the main method for completing quantum multicast. At the same time, quantum state tomography of the schemes was carried out on the IBM Quantum platform.The obtained states were compared with the target states by fidelity. The analysis of communication efficiency and noise effects shows that our protocol has advantages in the case of complex coefficients.
