Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 178 papers published in subject: > since this site started. |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. Performance evaluation in the uplink multiple relay access channel | |||
Hu Bingshan,Chuai Gang | |||
Electrics, Communication and Autocontrol Technology 25 December 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:?Multiple access relay channel (MARC) has been considered in recent papers as a means of improving the performance of spectral efficiency in mobile radio networks. And it has been considered as a promising solution to make the conventional point-to-point mode operation more competitive to the future mobile radio networks. In MARC, transmitting users share their resources to help each others' transmission for reliable delivery to the destinations. Relay stations in MARC are deployed in standard with the objectives of significant increase of achievable rate for both cell-edge users as well as overall system capacity. In this paper, we have proposed a modification to the MARC scheme and take the proposed scheme into LTE systems. The performance of MARC networks has been investigated based on different relay deployments and power control, it is presented a system level simulation developed to evaluate the performance of MARC scheme and we mainly focus on the Cell-edge and Cell-average spectral efficiency of mobile radio networks in the MARC. Simulation results demonstrate that the proposed scheme achieved significant performance gains compared to the conventional macro-only and L1 Relay schemes. ???? | |||
TO cite this article:Hu Bingshan,Chuai Gang. Performance evaluation in the uplink multiple relay access channel[OL].[25 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4501993 |
2. Nash Bargaining Game Based Joint Resource Allocation and Hungarian Method Based Partner Selection for WirelessCooperative Networks | |||
HUANG Shuanglin,WEI Jiaolong,LIU Cai | |||
Electrics, Communication and Autocontrol Technology 14 December 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In wireless communication networks, the cooperative communication performance depends on careful resource allocation. This paper considers the problem of resource sharing among selfish nodes in wireless cooperative networks. In the system, each node can act as a source as well as a potential relay, and both nodes are willing to achieve an extra rate increase by jointly adjusting their channel bandwidth and power levels for cooperative relaying. First, a two-user algorithm is proposed to bargain joint bandwidth and power allocation(JBPA) between two users. Then a multiuser bargaining algorithm is developed based on the Hungarian method. NBS is applied to formulate the JBPA problem to guarantee fairness. And, the optimal coalitions are formed by using the Hungarian method, such that the overall network rate increase is also maximized for multiple users. Simulation results indicate the Nash bargaining solution(NBS) resource sharing is fair and the fairness of resource allocation only depends on how much contribution its partner can make to its rate increase. Meanwhile, the proposed algorithm has fast convergence to the optimum and the multiuser bargaining algorithm can guarantee fairness between cooperative partner, but also maximize the overall network rate increase. | |||
TO cite this article:HUANG Shuanglin,WEI Jiaolong,LIU Cai. Nash Bargaining Game Based Joint Resource Allocation and Hungarian Method Based Partner Selection for WirelessCooperative Networks[OL].[14 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4502706 |
3. Selection of High Speed ADC in the Application of Digital IF Receiver for OFDM | |||
Tong Jiaxin,Gao Jinchun | |||
Electrics, Communication and Autocontrol Technology 13 December 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:When it comes to the design of digital intermediate-frequency (IF) receiver, how to select an optimum high-speed analog to digital converter (ADC) is a key point. This paper presents an effective method in the selection of ADC and the main consideration is signal to noise ratio (SNR), which contains the influence of peak-to-average Ratio (PAPR). A helpful formula is derived that can combine the power of input signal with ADC's quantitative peak. This paper provides calculation model for OFDM and analysis of simulation result using MATLAB. It turned out that the practical ADC's resolution bits should be left three digits allowances. In addition, the noise figure (NF) of ADC is discussed in digital IF receiver and RF directly-sampling digital receiver. | |||
TO cite this article:Tong Jiaxin,Gao Jinchun. Selection of High Speed ADC in the Application of Digital IF Receiver for OFDM[OL].[13 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4499664 |
4. Energy- and Spectral-efficiency Tradeoff From Nash Bargaining Aspect | |||
ZHANG Ling,GAO Jinchun,XIE Gang | |||
Electrics, Communication and Autocontrol Technology 13 December 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Conventional design of wireless networks mainly focuses on system capacity and spectral efficiency(SE). As green radio (GR) becomes an inevitable trend, energy-efficient design is becoming more and more important. For SE oriented design, it can improve the system rate as much as possible, but energy efficiency (EE) may be not desirable. Similarly, for EE oriented design, it can save the energy mostly, but the system rate may be low. It can be proved that Pareto Optimality between SE and EE exists. In this paper, a new design about the tradeoff between SE and EE is addressed on the basis of Nash Bargaining to improve the system's comprehensive performance. With this design, we can not only improve the transmission rate but also save the energy. We first set up a general EE-SE tradeoff framework, then demonstrate the new objective function is strictly quasi-concave and get the unique and optimal Nash Bargaining Solutions (NBS). | |||
TO cite this article:ZHANG Ling,GAO Jinchun,XIE Gang. Energy- and Spectral-efficiency Tradeoff From Nash Bargaining Aspect[OL].[13 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4503773 |
5. Optimal Transmit Schemes for CR MIMO Systems Under The Average Interference Power Constraints | |||
Zhao Lu,Lin Gan,Xie Gang | |||
Electrics, Communication and Autocontrol Technology 12 December 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Considering the statistical properties of Rayleigh fading channels, this paper tries to gain the average interference power (AIP) constraint for Primary User (PU) in CR MIMO system and studies the optimal transmit strategy for a Cognitive Radio(CR)link to maximize the ergodic capacity subject to the AIP constraint and CR transmit power constraint. Then we compare it with the counterpart subject to the peak interference power (PIP) constraint for PU and the same CR transmit power constraint. Simulation results show that the former can not only reduce the algorithm complexity but also improve the CR ergodic capacity. | |||
TO cite this article:Zhao Lu,Lin Gan,Xie Gang. Optimal Transmit Schemes for CR MIMO Systems Under The Average Interference Power Constraints[OL].[12 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4500464 |
6. A Channel-Grouping Based Neighbor Discovery Algorithm for Cognitive Radio System | |||
Chang Honggang,Wenbo Wang,Wenbin Guo | |||
Electrics, Communication and Autocontrol Technology 16 October 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, a neighbor discovery problem is addressed for cognitive radio (CR) system. CR is such a promising technology that enables a more efficient usage of the already assigned spectrum. However, CR users operate in a particularly challenging wireless environment. Specifically in CR systems, not only it is dynamic multi-channel, but also the channels available at different nodes may be different. Those characteristics make the CR technology more challenging. Neighbor discovery is one of the challenges. Especially, when the channel set is relatively large and seriously influenced by the primary users (PU), who are licenced, thus the available channel will be more uncertain, and the neighbor discovery becomes more difficult. To solve this problem an algorithm is proposed, which uses a grouping strategy. This algorithm is able to reduce the time consumed in neighbor discovery for a dynamic multi-channel environment. | |||
TO cite this article:Chang Honggang,Wenbo Wang,Wenbin Guo. A Channel-Grouping Based Neighbor Discovery Algorithm for Cognitive Radio System[OL].[16 October 2012] http://en.paper.edu.cn/en_releasepaper/content/4491116 |
7. Access Selection Scheme Based on Effective Capacity in Heterogeneous Network | |||
Hu Yang,Wang Jingyao,Liu Yang | |||
Electrics, Communication and Autocontrol Technology 24 September 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Mobile multimedia service is widely used in many new applications which require QoS of time-delay. This leads a new situation that the traditional access selection mode won't meet the user's demanding very well. In this paper, we propose a new access selection scheme which is designed for the multimedia service in heterogeneous mobile network. The main idea can be generalized as: Firstly, we analyze the effective capacity of different candidate network as its description of network character to solve which problem. Secondly, the load balancing index of candidate network also is taken into consideration to guarantee traffic balance in different network. Finally, considering all of the network parameters, we do a MADM. The simulation results show, our proposed scheme is effective in improving the time-delay QoS performance of the mobile multimedia service | |||
TO cite this article:Hu Yang,Wang Jingyao,Liu Yang. Access Selection Scheme Based on Effective Capacity in Heterogeneous Network[OL].[24 September 2012] http://en.paper.edu.cn/en_releasepaper/content/4489801 |
8. Outage Performance Analysis of Two-Way Relay System with Multi-Antenna Relay Node | |||
WANG Rui,TAO Meixia | |||
Electrics, Communication and Autocontrol Technology 08 February 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper presents an analytical study on the outage performance of amplify-and-forward (AF) two-way relay system with multi-antenna relay node (RN).Two major bidirectional protocols, i.e., two time slots multiple access broadcast (MABC) protocol and three time slots time division broadcast (TDBC) protocol, are considered respectively. For both considerations, we first assume that instantaneous channel-state-information (CSI) is unavailable at RN, thus RN just simply uses the fixed relay gain derived from statistical CSI to scalethe received signals before forwarding.We then consider the scenario where RN can obtainthe instantaneous CSI to perform the zero-forcing (ZF) relayprecoding. The closed-form expressions ofoutage probability are derived for all cases.Based on these expressions,the diversity-multiplexing tradeoff (DMT) is further obtained for the MABC protocol.The analytical results show that, for non-precoding MABC scheme, the diversity order of 1 can only be obtainedand it is irrelevant to the relay antenna number M. While for theZF-precoding case, the diversity order of M-1 can be obtained. | |||
TO cite this article:WANG Rui,TAO Meixia. Outage Performance Analysis of Two-Way Relay System with Multi-Antenna Relay Node[OL].[ 8 February 2012] http://en.paper.edu.cn/en_releasepaper/content/4464893 |
9. Cross-Layer Resource Allocation of Two-Way Relaying for Statistical Delay-QoS Guarantees | |||
LIN Cen,LIU Yuan,TAO Meixia | |||
Electrics, Communication and Autocontrol Technology 02 February 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper considers the cross-layer design for delayquality-of-service (QoS) provisioning in two-way relay systems. Theaim is to find the optimal cross-layer resource allocation policy tomaximize the weighted sum-rate of the considered two-way relaysystem while guaranteeing the bounded delay-QoS constraints for bothusers. By applying the concept of effective capacity, the delayrequirements are characterized as the statistical QoS exponents,which are the only information exchanged between layers. Thecross-layer optimization problem then is equivalent to a weightedsum effective capacity maximization problem. The optimal joint powerand rate adaptation policy for the two-phase two-way relaying isderived. Numerical results show that the proposed policy canefficiently support diverse QoS requirements and significantlyimprove the performance compared with either the fixed power schemeor the conventional weight-based method. | |||
TO cite this article:LIN Cen,LIU Yuan,TAO Meixia. Cross-Layer Resource Allocation of Two-Way Relaying for Statistical Delay-QoS Guarantees[OL].[ 2 February 2012] http://en.paper.edu.cn/en_releasepaper/content/4464801 |
10. Spectrum Allocation in Cognitive Radio with Particle Swarm Optimization Algorithm | |||
Zhang Jie,Lv Tiejun | |||
Electrics, Communication and Autocontrol Technology 10 January 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Cognitive radio (CR) is of special significance to improve spectrum utilization, and spectrum allocation is one of the key technologies in the realization of cognitive radio. The spectrum allocation problem considered in this paper aims to maximize the throughput of the second users (SUs) within the transmit power limit of SUs and the PU interference constraint. Based on the throughput maximization model in CR network, the spectrum allocation algorithm based on particle swarm optimization (PSO) is proposed in this paper. According to the feature of CR, the interference caused by SUs transmission to the primary users must be taken into consideration, which makes the spectrum allocation problem different from other networks. Simulated annealing (SA) and roulette strategy are introduced to avoid algorithm prematurity of PSO and further improve the algorithm performace. Finally, simulation results show that the proposed PSO based spectrum allocation algorithm outperform the commonly used color-sensitive graph coloring (CSGC) and greedy algorithms. | |||
TO cite this article:Zhang Jie,Lv Tiejun. Spectrum Allocation in Cognitive Radio with Particle Swarm Optimization Algorithm[OL].[10 January 2012] http://en.paper.edu.cn/en_releasepaper/content/4461051 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated