This paper investigates the impacts of network coding (NC) on user fairness from the network perspective in multiple access channels. Firstly, simultaneous outage is exploited as the metric to evaluate user fairness...
详细信息
This paper investigates the impacts of network coding (NC) on user fairness from the network perspective in multiple access channels. Firstly, simultaneous outage is exploited as the metric to evaluate user fairness. To optimize it, a fairness-oriented physical layer NC scheme is proposed, in which users' signals are superimposed in specific calculated proportion at relay and then decoded by maximal ratio combination (MRC) and serial interference cancellation (SIC) at destination. Furthermore, the influence of power allocation coefficient error on simultaneous outage is also analyzed to reveal its correlation with user fairness. Simulation results indicate that the proposed scheme can supply approximately equal performance promotion for each cooperation-participated user and outperform those without fairness consideration in terms of the employed metric.
Abstract: This paper focuses on the first-or- der and second-order performance of dual-hop underlay cognitive radio systems with oppor- tunistic relaying (UCR-OR) over indepen- dent and non-identically distributed ...
详细信息
Abstract: This paper focuses on the first-or- der and second-order performance of dual-hop underlay cognitive radio systems with oppor- tunistic relaying (UCR-OR) over indepen- dent and non-identically distributed (***.d) Rayleigh fading channels. For the UCR-OR systems, the tolerable maximum interference power (TMIP) Q at primary users (PUs) and the allowable maximum transmission power limit (AMTP) P at secondary users (SUs) are considered, simultaneously. We first obtain the closed-form solutions to the first-order performance such as outage probability, ave- rage symbol error ratio (SER), and ergodic capacity (EC). Secondly, we investigate the second-order statistical performance, i.e., ave- rage outage rate (AOR) and average outage duration (AOD). With the consideration that in practice implementation the receiver perfor- mance is primarily influenced by the signal- to-noise ratio (SNR) (not the signal envelope), the second-order statistical performance is investigated based on the equivalent instan- taneous end-to-end SNR. Finally, we present the detailed performance comparison analysis of UCR-OR systems by defining a random variable ,μ=Pmax/Q. The results show that the effect of μ on the first-order and second-or- der performances is different greatly. For the first-order performance, the perlbrmance gap is negligible when the value of// is relatively large. However, for the second-order one, the gap is distinct.
Cooperative relaying has been emerging as a key technology in Cognitive radio(CR) networks. A two-way Amplify-and-forward(AF) based multi-relay CR network is considered, where a primary user coexists with a pair of se...
详细信息
Cooperative relaying has been emerging as a key technology in Cognitive radio(CR) networks. A two-way Amplify-and-forward(AF) based multi-relay CR network is considered, where a primary user coexists with a pair of secondary users and multiple relays. A Timeefficient sub-optimal power allocation scheme(TESOPA)based on Cauchy-Schwarz inequality is provided to maximize the total end-to-end transmission rate of the secondary system. TESOPA is proposed under maximal transmission power constraints, while ensuring the quality of service of the primary user during the whole communication process. The computational complexity is sharply decreased by using the Cauchy-Schwarz inequality. Simulation results show that the proposed TESOPA scheme performs very close to the near-optimal Interior point method based power allocation(IPMPA), especially in interference dominant networks where interference constraints play a key role in determining power allocation results instead of maximal transmission power constraints.
Continuous-variable quantum key distribution(CVQKD)[1-7]allows two remote parties(Alice and Bob)to share a secret key,even in the presence of an eavesdropper(Eve)with unlimited computational power[8-17].While,a ...
详细信息
Continuous-variable quantum key distribution(CVQKD)[1-7]allows two remote parties(Alice and Bob)to share a secret key,even in the presence of an eavesdropper(Eve)with unlimited computational power[8-17].While,a highly efficient reconciliation protocol[18-21]is crucial in a CVQKDsystem, which can not only extract the errorless secret keys, but also provide a promising way to achieve a long distance CVQKD at a low signal-to-noise ratio (SNR).
Currently,the cloud computing systems use simple key-value data processing,which cannot support similarity search efectively due to lack of efcient index structures,and with the increase of dimensionality,the existing...
详细信息
Currently,the cloud computing systems use simple key-value data processing,which cannot support similarity search efectively due to lack of efcient index structures,and with the increase of dimensionality,the existing tree-like index structures could lead to the problem of"the curse of dimensionality".In this paper,a novel VF-CAN indexing scheme is ***-CAN integrates content addressable network(CAN)based routing protocol and the improved vector approximation fle(VA-fle) *** are two index levels in this scheme:global index and local *** local index VAK-fle is built for the data in each storage ***-fle is thek-means clustering result of VA-fle approximation vectors according to their degree of *** cluster forms a separate local index fle and each fle stores the approximate vectors that are contained in the *** vector of each cluster center is stored in the cluster center information fle of corresponding storage *** the global index,storage nodes are organized into an overlay network CAN,and in order to reduce the cost of calculation,only clustering information of local index is issued to the entire overlay network through the CAN *** experimental results show that VF-CAN reduces the index storage space and improves query performance efectively.
In the open network environment, malicious attacks to the trust model have become increasingly serious. Compared with single node attacks, collusion attacks do more harm to the trust model. To solve this problem, a co...
详细信息
In the open network environment, malicious attacks to the trust model have become increasingly serious. Compared with single node attacks, collusion attacks do more harm to the trust model. To solve this problem, a collusion detector based on the GN algorithm for the trust evaluation model is proposed in the open Internet environment. By analyzing the behavioral characteristics of collusion groups, the concept of flatting is defined and the G-N community mining algorithm is used to divide suspicious communities. On this basis, a collusion community detector method is proposed based on the breaking strength of suspicious communities. Simulation results show that the model has high recognition accuracy in identifying collusion nodes, so as to effectively defend against malicious attacks of collusion nodes.
Cloud computing is experiencing a rapid development since a large amount of data need to be addressed. How to carry on the reasonable task scheduling plays a vital role in the operating efficiency of cloud computing. ...
详细信息
This paper considers the problem of transmitting correlated information from multiple sources to multiple receivers, where every receiver seeks to recover all of the original sources. In order to improve the efficienc...
详细信息
This paper presents a new method of gaze tracking based on iris detection for images of human eyes captured by ordinary PC camera. In the basis of traditional iris detection, this paper improves the circle detection b...
详细信息
Compared with the encryption and the authentication which can prevent the external attacks,the trust management schemes are the better approaches for defending against the internal attacks in wirelesssensornetwork(W...
详细信息
Compared with the encryption and the authentication which can prevent the external attacks,the trust management schemes are the better approaches for defending against the internal attacks in wirelesssensornetwork(WSN). The reputation time-varying(RTV) attacks are internal attacks. In the reputation timevarying attacks, the reputation value of nodes is manipulated to adjust dynamically by the compromised nodes or malicious attackers. Hence, these attacks have greater covert and invasive. In this paper, we propose a Timewindow-based Resilient Trust Management Scheme(TRTMS) to defend against the reputation time-varying attacks in wirelesssensornetwork. In this scheme, based on BETA distribution, the behaviors of compromised nodes are analyzed for a period of time, and then the difference judgment and the trend analysis are utilized to identify the abnormality of nodes’ reputation value, meanwhile, the control factor Fc and the time window are introduced to verify and remove the compromised modes from the suspected malicious nodes, which refer to those nodes’ reputation value changes are caused by the wireless channel changes. The result of simulation shows that our proposed scheme can defend reputation time-varying attacks effectively and it is convenient to implement.
暂无评论