Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655234
Jie Lin, Wei Yu, Xinyu Yang, Cong Zhao, Qingyu Yang
The smart grid shall not only integrate the intermittent resources (IRs) to meet the diverse demands of users and reduce the greenhouse gas emission, but also integrate Electricity Vehicles (EVs) as the energy storage facility to smooth the bulk power generation over time. In this paper, we model and analyze the impact of integrating IRs and EVs on the bulk power generation in the smart grid. In particular, we introduce the reliability ratio to quantify the power generation capacity of intermittent resources and model the process of charging and discharging of EVs as a queuing system. We extend the Security-Constrained Economic Dispatch (SCED) and include the reliability limit of IRs and the number of EVs in the power generation dispatch process and formally analyze the effect of IRs and EVs on the bulk power generation. We conduct extensive simulation and our data shows that increasing IRs can decrease the bulk generation and the curve of bulk generation over time becomes smooth as the number of EVs increases.
{"title":"On effectiveness of integrating intermittent resources and electricity vehicles in the smart grid","authors":"Jie Lin, Wei Yu, Xinyu Yang, Cong Zhao, Qingyu Yang","doi":"10.1109/ICC.2013.6655234","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655234","url":null,"abstract":"The smart grid shall not only integrate the intermittent resources (IRs) to meet the diverse demands of users and reduce the greenhouse gas emission, but also integrate Electricity Vehicles (EVs) as the energy storage facility to smooth the bulk power generation over time. In this paper, we model and analyze the impact of integrating IRs and EVs on the bulk power generation in the smart grid. In particular, we introduce the reliability ratio to quantify the power generation capacity of intermittent resources and model the process of charging and discharging of EVs as a queuing system. We extend the Security-Constrained Economic Dispatch (SCED) and include the reliability limit of IRs and the number of EVs in the power generation dispatch process and formally analyze the effect of IRs and EVs on the bulk power generation. We conduct extensive simulation and our data shows that increasing IRs can decrease the bulk generation and the curve of bulk generation over time becomes smooth as the number of EVs increases.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"40 1","pages":"4266-4270"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85998107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655015
Yuli Yang, S. Aïssa
In this paper, we consider a broadcast channel in spectrum-sharing networks, where the base station schedules licensed primary users (PUs) and cognitive secondary users (SUs) simultaneously. Based on such a framework, we present a transmission strategy in the light of dirty paper coding. In order to promise the PUs' quality of service (QoS) in the broadcasting, the base station chooses codewords for the users by taking into account that the codewords pertaining to SUs can be pre-subtracted from those pertaining to PUs as if there were no interference from the secondary's data to the primary's data. For the purpose of performance evaluation, by taking capacity behavior and bit error rate (BER) as metrics, we study the achievable data rate regions for both types of users with the introduced design, and analyze the BER performance in corresponding systems implemented with hierarchical modulation. Numerical results substantiate that with flexible management of the spectrum resources, our proposed scheme provides more communication opportunities for SUs while maintaining PUs' QoS at an acceptable level.
{"title":"On the coexistence of primary and secondary users in spectrum-sharing broadcast channels","authors":"Yuli Yang, S. Aïssa","doi":"10.1109/ICC.2013.6655015","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655015","url":null,"abstract":"In this paper, we consider a broadcast channel in spectrum-sharing networks, where the base station schedules licensed primary users (PUs) and cognitive secondary users (SUs) simultaneously. Based on such a framework, we present a transmission strategy in the light of dirty paper coding. In order to promise the PUs' quality of service (QoS) in the broadcasting, the base station chooses codewords for the users by taking into account that the codewords pertaining to SUs can be pre-subtracted from those pertaining to PUs as if there were no interference from the secondary's data to the primary's data. For the purpose of performance evaluation, by taking capacity behavior and bit error rate (BER) as metrics, we study the achievable data rate regions for both types of users with the introduced design, and analyze the BER performance in corresponding systems implemented with hierarchical modulation. Numerical results substantiate that with flexible management of the spectrum resources, our proposed scheme provides more communication opportunities for SUs while maintaining PUs' QoS at an acceptable level.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"95 1","pages":"3085-3089"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77088772","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655560
Amr Abdelnasser, E. Hossain
Efficient power and subchannel allocation methods are required for orthogonal frequency division multiple access (OFDMA)-based femtocells to mitigate both co-tier and cross-tier interferences. In this paper, we study the problem of joint power and subchannel allocation in a densely deployed femtocell network with constraints on co-tier and cross-tier interference and minimum datarate requirements. A convex optimization problem is formulated and the solution of the problem is obtained numerically. For this joint resource allocation problem, the effect of clustering (or cooperation) is studied as well, where femtocells are placed in disjoint groups. The performances of distributed resource allocation (i.e., without clustering) and centralized resource allocation (i.e., with only one cluster) are compared against clustering-based (i.e., semi-distributed) resource allocation. Numerical results show that, in a dense environment, with femtocells closely located to each other, the effect of co-tier interference becomes significantly dominant and clustering is a very effective technique in such a densely deployed environment to improve the sumrate capacity of the femtocells.
{"title":"Joint subchannel and power allocation in two-tier OFDMA HetNets with clustered femtocells","authors":"Amr Abdelnasser, E. Hossain","doi":"10.1109/ICC.2013.6655560","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655560","url":null,"abstract":"Efficient power and subchannel allocation methods are required for orthogonal frequency division multiple access (OFDMA)-based femtocells to mitigate both co-tier and cross-tier interferences. In this paper, we study the problem of joint power and subchannel allocation in a densely deployed femtocell network with constraints on co-tier and cross-tier interference and minimum datarate requirements. A convex optimization problem is formulated and the solution of the problem is obtained numerically. For this joint resource allocation problem, the effect of clustering (or cooperation) is studied as well, where femtocells are placed in disjoint groups. The performances of distributed resource allocation (i.e., without clustering) and centralized resource allocation (i.e., with only one cluster) are compared against clustering-based (i.e., semi-distributed) resource allocation. Numerical results show that, in a dense environment, with femtocells closely located to each other, the effect of co-tier interference becomes significantly dominant and clustering is a very effective technique in such a densely deployed environment to improve the sumrate capacity of the femtocells.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"64 1","pages":"6002-6007"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80973828","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655359
Sheng-Ming Cai, Yi Gong
Throughput maximization is considered in this paper for a multiple-input multiple-output (MIMO) cognitive radio system when no cross channel state information is available at the secondary transmitter (ST). We study cognitive beamforming subject to interference expectation constraint and interference outage probability constraint at the primary receiver (PR), respectively. We prove that with the former constraint, the beamforming problem can be formulated as a conventional MIMO transmission problem, which can be easily solved via the water-filling method. With the latter constraint, we find that the interference power is related to the eigenvalues of the covariance matrix of the secondary signals, and thus it can be expressed as a linear combination of multiple chi-square distributed variables. By exploiting the impact of the eigenvalues on the interference outage probability and establishing the relationship between the vibrations of secondary covariance matrix and its eigenvalues, we design an algorithm for this beamforming problem. Finally, simulation results are presented to demonstrate the performance of the proposed beamforming solutions subject to both constraints.
{"title":"Cognitive beamforming with unknown cross channel state information","authors":"Sheng-Ming Cai, Yi Gong","doi":"10.1109/ICC.2013.6655359","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655359","url":null,"abstract":"Throughput maximization is considered in this paper for a multiple-input multiple-output (MIMO) cognitive radio system when no cross channel state information is available at the secondary transmitter (ST). We study cognitive beamforming subject to interference expectation constraint and interference outage probability constraint at the primary receiver (PR), respectively. We prove that with the former constraint, the beamforming problem can be formulated as a conventional MIMO transmission problem, which can be easily solved via the water-filling method. With the latter constraint, we find that the interference power is related to the eigenvalues of the covariance matrix of the secondary signals, and thus it can be expressed as a linear combination of multiple chi-square distributed variables. By exploiting the impact of the eigenvalues on the interference outage probability and establishing the relationship between the vibrations of secondary covariance matrix and its eigenvalues, we design an algorithm for this beamforming problem. Finally, simulation results are presented to demonstrate the performance of the proposed beamforming solutions subject to both constraints.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"18 1","pages":"4931-4935"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80991188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655296
Haibin Wan, Wen Chen
This paper considers the wireless multicast cell, in which two source nodes with multiple antennas communicate with two destinations over a common medium simultaneously assisted by a multi-antenna relay node. Assume that the sources and relay have individual power constraints. The purpose of this work is to develop an optimal algorithm to compute the source beamforming vectors and the relay beamforming matrix to maximize the system sum-rate, subject to the power constraints in the sources and relay. The problem is nonconvex and apparently has no simple solution. In this paper, We first develop the beamforming vectors at the sources, and then explore the linear beamforming matrix for the nonregenerative relay, Finally, we present a coordinated optimal algorithm to jointly optimize the vectors and matrix, which performance is compared with the conventional methods. Simulations demonstrate that our algorithm outperforms the conventional methods.
{"title":"Coordinated beamforming for wireless multicast cell with nonregenerative multi-antenna relay","authors":"Haibin Wan, Wen Chen","doi":"10.1109/ICC.2013.6655296","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655296","url":null,"abstract":"This paper considers the wireless multicast cell, in which two source nodes with multiple antennas communicate with two destinations over a common medium simultaneously assisted by a multi-antenna relay node. Assume that the sources and relay have individual power constraints. The purpose of this work is to develop an optimal algorithm to compute the source beamforming vectors and the relay beamforming matrix to maximize the system sum-rate, subject to the power constraints in the sources and relay. The problem is nonconvex and apparently has no simple solution. In this paper, We first develop the beamforming vectors at the sources, and then explore the linear beamforming matrix for the nonregenerative relay, Finally, we present a coordinated optimal algorithm to jointly optimize the vectors and matrix, which performance is compared with the conventional methods. Simulations demonstrate that our algorithm outperforms the conventional methods.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"25 1","pages":"4603-4607"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81086049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655077
D. Truhachev, C. Schlegel
A novel modulation format based on coupling for streaming data transmissions is proposed. The construction utilizes an infinite parity-check matrix of a low-density parity-check convolutional code which is used for data encoding with real-domain addition instead of modulo-two addition. The demodulation and decoding is accomplished using iterative bit estimation and interference cancellation. We demonstrate that the threshold saturation effect of spatial graph coupling holds for the proposed format and the achievable communication rate approaches the additive white Gaussian noise channel capacity and exceeds the capacities of traditional PAM modulations.
{"title":"Spatially coupled streaming modulation","authors":"D. Truhachev, C. Schlegel","doi":"10.1109/ICC.2013.6655077","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655077","url":null,"abstract":"A novel modulation format based on coupling for streaming data transmissions is proposed. The construction utilizes an infinite parity-check matrix of a low-density parity-check convolutional code which is used for data encoding with real-domain addition instead of modulo-two addition. The demodulation and decoding is accomplished using iterative bit estimation and interference cancellation. We demonstrate that the threshold saturation effect of spatial graph coupling holds for the proposed format and the achievable communication rate approaches the additive white Gaussian noise channel capacity and exceeds the capacities of traditional PAM modulations.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"61 1","pages":"3418-3422"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73614983","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655017
Andrea Modenini, F. Rusek, G. Colavolpe
We consider intersymbol interference channels with reduced-complexity, mutual information optimized, channel-shortening detectors. For a given channel and receiver complexity, we optimize the transmit filter to use. The cost function we consider is the (Shannon) achievable information rate of the entire transceiver system. By functional analysis, we can establish a general form of the optimal transmit filter, which can then be optimized by standard numerical methods. As a side result, we also obtain an insight of the behaviour of the standard waterfilling algorithm for intersymbol interference channels.
{"title":"Optimal transmit filters for constrained complexity channel shortening detectors","authors":"Andrea Modenini, F. Rusek, G. Colavolpe","doi":"10.1109/ICC.2013.6655017","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655017","url":null,"abstract":"We consider intersymbol interference channels with reduced-complexity, mutual information optimized, channel-shortening detectors. For a given channel and receiver complexity, we optimize the transmit filter to use. The cost function we consider is the (Shannon) achievable information rate of the entire transceiver system. By functional analysis, we can establish a general form of the optimal transmit filter, which can then be optimized by standard numerical methods. As a side result, we also obtain an insight of the behaviour of the standard waterfilling algorithm for intersymbol interference channels.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"24 1","pages":"3095-3100"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79519238","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655140
Jungang Liu, O. Yang
We have designed and investigated a new congestion control scheme, called the OFEX (Optimal and Fully EXplicit) controller. Different from the existing relatively explicit controllers, this new scheme is able to provide not only optimal bandwidth allocation but also fully explicit congestion signal to sources. It overcomes the drawback of the relatively explicit controllers that “bias” the multi-bottlenecked users, and improves their convergence speed and source throughput performance. Furthermore, the OFEX controller design considers a dynamic model by proposing a remedial measure against the unpredictable bandwidth changes in contention-based networks (such as shared Ethernet and IEEE 802.11). Compared with the former works/controllers, such a remedy also effectively reduces the instantaneous queue size in a link, and thus significantly improving the queueing delay and system stability performance. We have evaluated the effectiveness of the OFEX controller in OPNET. The experimental comparison verifies the superiority of the OFEX controller.
{"title":"An optimal and fully explicit rate controller for high-speed networks","authors":"Jungang Liu, O. Yang","doi":"10.1109/ICC.2013.6655140","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655140","url":null,"abstract":"We have designed and investigated a new congestion control scheme, called the OFEX (Optimal and Fully EXplicit) controller. Different from the existing relatively explicit controllers, this new scheme is able to provide not only optimal bandwidth allocation but also fully explicit congestion signal to sources. It overcomes the drawback of the relatively explicit controllers that “bias” the multi-bottlenecked users, and improves their convergence speed and source throughput performance. Furthermore, the OFEX controller design considers a dynamic model by proposing a remedial measure against the unpredictable bandwidth changes in contention-based networks (such as shared Ethernet and IEEE 802.11). Compared with the former works/controllers, such a remedy also effectively reduces the instantaneous queue size in a link, and thus significantly improving the queueing delay and system stability performance. We have evaluated the effectiveness of the OFEX controller in OPNET. The experimental comparison verifies the superiority of the OFEX controller.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"40 1","pages":"3759-3763"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79539815","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655549
Nika Naghavi, V. Friderikos, Toktam Mahmoodi, H. Aghvami
This paper's central aim is to address the issue of resource management at the Local Mobility Anchors (LMA) in the Proxy Mobile IPv6 (PMIPv6) networks. A class-based admission control is proposed to improve the bottleneck effect caused by triangular routing in PMIPv6, where resource units are rationed amongst different classes of traffic according to their QoS requirements. The PMIPv6 network is modeled as an M/M/m/m tandem queuing network with two types (classes) of arrival process and an analytical model is presented. Performance of our proposed admission control scheme is evaluated through simulation and results are compared to the case where no distinction in terms of resource unit allocation between classes of traffic was considered.
{"title":"Admission control scheme for Proxy Mobile IPv6 networks","authors":"Nika Naghavi, V. Friderikos, Toktam Mahmoodi, H. Aghvami","doi":"10.1109/ICC.2013.6655549","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655549","url":null,"abstract":"This paper's central aim is to address the issue of resource management at the Local Mobility Anchors (LMA) in the Proxy Mobile IPv6 (PMIPv6) networks. A class-based admission control is proposed to improve the bottleneck effect caused by triangular routing in PMIPv6, where resource units are rationed amongst different classes of traffic according to their QoS requirements. The PMIPv6 network is modeled as an M/M/m/m tandem queuing network with two types (classes) of arrival process and an analytical model is presented. Performance of our proposed admission control scheme is evaluated through simulation and results are compared to the case where no distinction in terms of resource unit allocation between classes of traffic was considered.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"18 1","pages":"5944-5948"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85519658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655137
Charilaos Stais, Alexios Voulimeneas, G. Xylomenos
Many proposals for the next generation of the Internet suggest moving from an end-point oriented to an information-centric oriented architecture. Many of these proposals are based on the publish/subscribe paradigm, which lends itself naturally to native multicast support, a key factor for efficient content distribution. However, the design of efficient reliable transport protocols for multicast is a largely open problem, due to the problem of feedback implosion towards the sender as group size grows. In this paper we propose a hierarchical retransmission-based error control scheme for a native publish/subscribe internetwork. We compare our protocol with similar approaches proposed for IP multicast and evaluate its performance against IP multicast with unicast-based error control.
{"title":"Towards an error control scheme for a publish/subscribe network","authors":"Charilaos Stais, Alexios Voulimeneas, G. Xylomenos","doi":"10.1109/ICC.2013.6655137","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655137","url":null,"abstract":"Many proposals for the next generation of the Internet suggest moving from an end-point oriented to an information-centric oriented architecture. Many of these proposals are based on the publish/subscribe paradigm, which lends itself naturally to native multicast support, a key factor for efficient content distribution. However, the design of efficient reliable transport protocols for multicast is a largely open problem, due to the problem of feedback implosion towards the sender as group size grows. In this paper we propose a hierarchical retransmission-based error control scheme for a native publish/subscribe internetwork. We compare our protocol with similar approaches proposed for IP multicast and evaluate its performance against IP multicast with unicast-based error control.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"5 1","pages":"3743-3747"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85664670","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：