Pub Date : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063533
Fangqing Tan, Hui Gao, Tiejun Lv, Jie Zeng
Three dimensions multiple-input multiple-output (3D MIMO) system is now gaining a growing interest among researchers in wireless communication, the reason can be attributed to its potential to enable a variety of strategies like user specific 3D beamforming and cell-splitting. In this paper, we pursue the performance evaluation of 3D MIMO system employing zero-forcing (ZF) receivers, accounting for both large and small-scale fading. In particular, we consider the classical log-normal model and antenna gain with tilting angle, we derive the optimal tilting angle for 3D MIMO system which maximizes the sum rate, furthermore, based on the optimal tilting angle, we propose a closed-form linear approximation on the achievable sum rate in the asymptotically high signal-to-noise ratio (SNR) and low-SNR regime, respectively. We investigate the effect of antenna tilting angle, number of base station (BS) antennas and the distance between BS and the center of building on the achievable sum rate performance of 3D MIMO.
{"title":"Achievable sum rate analysis of ZF receivers in 3D MIMO with Rayleigh/log-normal fading channels","authors":"Fangqing Tan, Hui Gao, Tiejun Lv, Jie Zeng","doi":"10.1109/GLOCOMW.2014.7063533","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063533","url":null,"abstract":"Three dimensions multiple-input multiple-output (3D MIMO) system is now gaining a growing interest among researchers in wireless communication, the reason can be attributed to its potential to enable a variety of strategies like user specific 3D beamforming and cell-splitting. In this paper, we pursue the performance evaluation of 3D MIMO system employing zero-forcing (ZF) receivers, accounting for both large and small-scale fading. In particular, we consider the classical log-normal model and antenna gain with tilting angle, we derive the optimal tilting angle for 3D MIMO system which maximizes the sum rate, furthermore, based on the optimal tilting angle, we propose a closed-form linear approximation on the achievable sum rate in the asymptotically high signal-to-noise ratio (SNR) and low-SNR regime, respectively. We investigate the effect of antenna tilting angle, number of base station (BS) antennas and the distance between BS and the center of building on the achievable sum rate performance of 3D MIMO.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123957664","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063508
Guillaume Habault, L. Toutain, N. Montavont, P. Bertin
In most parts of the world there are multiple ways to access a given network. Users can benefit from this plethora of access networks, as they are able to select the best possible connection at all times. However, current methods used to select the best network, mostly based on link quality, do not always guarantee that users will connect to the one best suited to their needs. Devices have different interfaces for accessing different type of technologies, which also means that the selection has to be made regardless of the type of networks the user has access to. In order to support this type of custom selection, networks need to advertise their capabilities prior to the connection process. Moreover, in addition to supporting multihoming, devices must be able to assign each applications flow towards the most suitable network. Ideally, this new connection process would be completely transparent for the user. In this paper, we present a solution to ensure that devices in this multi-access environment are able to maintain the best possible connection for each service at any given time and in any given location. This proposal allows providers to send information to devices regarding the services supported by each point of attachment to their network. This additional information helps devices select the most suitable network for each service. We define a service announcement mechanism to facilitate the advertisement of available services. This mechanism, associated with other existing protocols, enables this solution to be used with different types of access networks.
{"title":"Service-based network selection proposal for complex heterogeneous environments","authors":"Guillaume Habault, L. Toutain, N. Montavont, P. Bertin","doi":"10.1109/GLOCOMW.2014.7063508","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063508","url":null,"abstract":"In most parts of the world there are multiple ways to access a given network. Users can benefit from this plethora of access networks, as they are able to select the best possible connection at all times. However, current methods used to select the best network, mostly based on link quality, do not always guarantee that users will connect to the one best suited to their needs. Devices have different interfaces for accessing different type of technologies, which also means that the selection has to be made regardless of the type of networks the user has access to. In order to support this type of custom selection, networks need to advertise their capabilities prior to the connection process. Moreover, in addition to supporting multihoming, devices must be able to assign each applications flow towards the most suitable network. Ideally, this new connection process would be completely transparent for the user. In this paper, we present a solution to ensure that devices in this multi-access environment are able to maintain the best possible connection for each service at any given time and in any given location. This proposal allows providers to send information to devices regarding the services supported by each point of attachment to their network. This additional information helps devices select the most suitable network for each service. We define a service announcement mechanism to facilitate the advertisement of available services. This mechanism, associated with other existing protocols, enables this solution to be used with different types of access networks.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124618565","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063448
S. Zarei, W. Gerstacker, R. Schober
In-phase/quadrature-phase (I/Q) imbalance is one of the most important hardware impairments in communication systems. It arises in the analog parts of direct conversion radio frequency (RF) transceivers and can cause large performance losses. In this paper, the impact of I/Q imbalance on the sum rate performance of downlink massive multiple-input multiple-output (MIMO) systems is analyzed and I/Q imbalance aware widely-linear precoding is considered. The proposed precoder is a widely-linear (WL) extension of the regularized zero-forcing (RZF) precoder and jointly mitigates multi-user interference and I/Q imbalance by processing the real and the imaginary parts of the transmit signal separately. Results from random matrix theory are used to derive analytical expressions for the achievable sum rate of the proposed precoder. Our analytical results show that if the number of base station antennas is much larger than the number of users, the proposed I/Q imbalance aware WL-RZF precoder achieves the same sum rate as the RZF precoder in an ideal system without I/Q imbalance. We also provide an analytical expression for the sum rate loss of the I/Q imbalance unaware RZF precoder compared to the ideal case without I/Q imbalance.
{"title":"I/Q imbalance aware widely-linear precoding for downlink massive MIMO systems","authors":"S. Zarei, W. Gerstacker, R. Schober","doi":"10.1109/GLOCOMW.2014.7063448","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063448","url":null,"abstract":"In-phase/quadrature-phase (I/Q) imbalance is one of the most important hardware impairments in communication systems. It arises in the analog parts of direct conversion radio frequency (RF) transceivers and can cause large performance losses. In this paper, the impact of I/Q imbalance on the sum rate performance of downlink massive multiple-input multiple-output (MIMO) systems is analyzed and I/Q imbalance aware widely-linear precoding is considered. The proposed precoder is a widely-linear (WL) extension of the regularized zero-forcing (RZF) precoder and jointly mitigates multi-user interference and I/Q imbalance by processing the real and the imaginary parts of the transmit signal separately. Results from random matrix theory are used to derive analytical expressions for the achievable sum rate of the proposed precoder. Our analytical results show that if the number of base station antennas is much larger than the number of users, the proposed I/Q imbalance aware WL-RZF precoder achieves the same sum rate as the RZF precoder in an ideal system without I/Q imbalance. We also provide an analytical expression for the sum rate loss of the I/Q imbalance unaware RZF precoder compared to the ideal case without I/Q imbalance.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128187634","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063555
Y. Liu, Xin Quan, Wensheng Pan, S. Shao, Youxi Tang
Self-interference (SI) cancellation is one of the most important techniques for full duplex wireless communication. As an indispensable component, the active analog canceller (AC) needs to mitigate the analog SI to ensure it meets the analog-to-digital converter (ADC) sampling requirement. However, the active AC cancellation performance is often restricted by the nonideal electronic components, e.g., the tunable attenuator, the phase shifter and associated circuits, which introduce nonlinear distortions to the residual SI signal that enters the receive chain, as the transmit power increases. This paper presents a full duplex architecture with AC nonlinearity modeling and suppression by including an extra feedback loop right after the power amplifier and an AC nonlinear distortion modeling and cancellation process followed by SI channel estimation and digital SI cancellation. By analyzing the feedback signal feeding the AC and the residual signal after AC cancellation, the AC nonlinear distortion can be estimated and subsequently suppressed by subtracting its estimates from the received samples. The distortion-suppressed signal is then processed by the refined digital SI cancellation with channel estimation and mitigation to further improve the cancellation performance. Experiments are performed on 20-MHz Long Term Evolution-advanced signals to demonstrate the effectiveness of the proposed full duplex architecture with signal power ranging from -5 dBm to 23 dBm at the PA output while from -23 dBm to 5 dBm at the receiver front end.
{"title":"Nonlinear distortion suppression for active analog self-interference cancellers in full duplex wireless communication","authors":"Y. Liu, Xin Quan, Wensheng Pan, S. Shao, Youxi Tang","doi":"10.1109/GLOCOMW.2014.7063555","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063555","url":null,"abstract":"Self-interference (SI) cancellation is one of the most important techniques for full duplex wireless communication. As an indispensable component, the active analog canceller (AC) needs to mitigate the analog SI to ensure it meets the analog-to-digital converter (ADC) sampling requirement. However, the active AC cancellation performance is often restricted by the nonideal electronic components, e.g., the tunable attenuator, the phase shifter and associated circuits, which introduce nonlinear distortions to the residual SI signal that enters the receive chain, as the transmit power increases. This paper presents a full duplex architecture with AC nonlinearity modeling and suppression by including an extra feedback loop right after the power amplifier and an AC nonlinear distortion modeling and cancellation process followed by SI channel estimation and digital SI cancellation. By analyzing the feedback signal feeding the AC and the residual signal after AC cancellation, the AC nonlinear distortion can be estimated and subsequently suppressed by subtracting its estimates from the received samples. The distortion-suppressed signal is then processed by the refined digital SI cancellation with channel estimation and mitigation to further improve the cancellation performance. Experiments are performed on 20-MHz Long Term Evolution-advanced signals to demonstrate the effectiveness of the proposed full duplex architecture with signal power ranging from -5 dBm to 23 dBm at the PA output while from -23 dBm to 5 dBm at the receiver front end.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127036125","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063419
D. Liao, Gang Sun, V. Anand, Hong-Fang Yu, Kexiang Xiao
In this paper, we investigate the problem of online multicast virtual network embedding (MVNE) by introducing the strategies of waiting-tolerant and load-prediction into our VN provisioning framework for reducing the blocking ratio. We propose a heuristic algorithm called MVNE-WL (MVN Embedding with the strategies of Waiting-tolerant and Load-prediction) for solving this problem efficiently. The numerical results obtained from extensive simulations demonstrate the effectiveness of the proposed approach and show that MVNE-WL is better than traditional solutions in terms of the MVN mapping blocking ratio, the total net revenue, the unit cost efficiency, the node utilization and the link utilization in the long term.
{"title":"Opportunistic provisioning for multicast virtual network requests","authors":"D. Liao, Gang Sun, V. Anand, Hong-Fang Yu, Kexiang Xiao","doi":"10.1109/GLOCOMW.2014.7063419","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063419","url":null,"abstract":"In this paper, we investigate the problem of online multicast virtual network embedding (MVNE) by introducing the strategies of waiting-tolerant and load-prediction into our VN provisioning framework for reducing the blocking ratio. We propose a heuristic algorithm called MVNE-WL (MVN Embedding with the strategies of Waiting-tolerant and Load-prediction) for solving this problem efficiently. The numerical results obtained from extensive simulations demonstrate the effectiveness of the proposed approach and show that MVNE-WL is better than traditional solutions in terms of the MVN mapping blocking ratio, the total net revenue, the unit cost efficiency, the node utilization and the link utilization in the long term.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126950623","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063417
M. Dabbagh, B. Hamdaoui, M. Guizani, A. Rayes
Consolidating virtual machines (VMs) on as few physical machines (PMs) as possible so as to turn into sleep as many PMs as possible can make significant energy savings in cloud centers. Although traditional online bin packing heuristics, such as Best Fit (BF), have been used to reduce the number of active PMs, they share one common limitation; they do not account for VM release times, which can lead to an inefficient usage of energy resources. In this paper, we propose several extensions to the original BF heuristic by accounting for VMs' release times when making VM placement decisions. Our comparative studies conducted on Google traces show that, when compared to existing heuristics, the proposed heuristic reduces energy consumption and enhances utilization of cloud servers.
{"title":"Release-time aware VM placement","authors":"M. Dabbagh, B. Hamdaoui, M. Guizani, A. Rayes","doi":"10.1109/GLOCOMW.2014.7063417","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063417","url":null,"abstract":"Consolidating virtual machines (VMs) on as few physical machines (PMs) as possible so as to turn into sleep as many PMs as possible can make significant energy savings in cloud centers. Although traditional online bin packing heuristics, such as Best Fit (BF), have been used to reduce the number of active PMs, they share one common limitation; they do not account for VM release times, which can lead to an inefficient usage of energy resources. In this paper, we propose several extensions to the original BF heuristic by accounting for VMs' release times when making VM placement decisions. Our comparative studies conducted on Google traces show that, when compared to existing heuristics, the proposed heuristic reduces energy consumption and enhances utilization of cloud servers.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130746970","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063615
Pang-Chang Lan, Y. Hong, C.-C. Jay Kuo
This work examines the advantages of having only channel state information at the transmitter (CSIT), and not at the receiver and the eavesdropper, when achieving secrecy in fading wiretap channels. The key idea is that, with only CSIT, the transmitter can pre-compensate for the amplitude and phase distortions on the main channel. This allows the receiver to decode coherently even without knowledge of the CSI, while leaving the eavesdropper confused by the unknown variations of its own channel. When the channel is reciprocal, this CSI assumption can be achieved in practice through reverse training, i.e., by having the receiver emit the training signal so that the transmitter can estimate the channel by itself. Two secrecy-enhancing transmission schemes are proposed to exploit the CSIT. The truncated channel inversion scheme is used when the receiver and the eavesdropper have no CSI available, and the truncated phase compensation scheme is adopted when they can practically measure the SNR. The achievable secrecy rates of these schemes are derived for both single-antenna and multi-antenna wireless fading scenarios. Numerical results show significant improvements in secrecy rate compared to the case with full CSI at all terminals.
{"title":"Enhancing secrecy in fading wiretap channels with only transmitter-side channel state information","authors":"Pang-Chang Lan, Y. Hong, C.-C. Jay Kuo","doi":"10.1109/GLOCOMW.2014.7063615","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063615","url":null,"abstract":"This work examines the advantages of having only channel state information at the transmitter (CSIT), and not at the receiver and the eavesdropper, when achieving secrecy in fading wiretap channels. The key idea is that, with only CSIT, the transmitter can pre-compensate for the amplitude and phase distortions on the main channel. This allows the receiver to decode coherently even without knowledge of the CSI, while leaving the eavesdropper confused by the unknown variations of its own channel. When the channel is reciprocal, this CSI assumption can be achieved in practice through reverse training, i.e., by having the receiver emit the training signal so that the transmitter can estimate the channel by itself. Two secrecy-enhancing transmission schemes are proposed to exploit the CSIT. The truncated channel inversion scheme is used when the receiver and the eavesdropper have no CSI available, and the truncated phase compensation scheme is adopted when they can practically measure the SNR. The achievable secrecy rates of these schemes are derived for both single-antenna and multi-antenna wireless fading scenarios. Numerical results show significant improvements in secrecy rate compared to the case with full CSI at all terminals.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132415043","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063415
Mohammadhossein Malekloo, N. Kara
Cloud computing systems provide services to users based on a pay-as-you-go model. The more services that data centers deliver to users, the more those centers need to be prepared. However, data centers consume huge amounts of energy from the environment. In order to improve data-center efficiency, resource consolidation using virtualization technology is becoming important for the reduction of the environmental impact caused by the data centers. One of the important keys in resource consolidation is the mapping of virtual machines to suitable physical machines, a procedure called virtual machine placement. The present paper focuses on this problem of virtual machine placement and proposes a multi-objective optimization approach to minimize both power consumption and resource wastage and to minimize energy communication cost between network elements within a data center. An Ant Colony Optimization (ACO) algorithm is proposed to obtain a Pareto set for a multi-objective problem. The proposed algorithms are tested using Cloudsim tools. The performances of these algorithms are compared with three well-known single-objective approaches and a multi-objective Genetic Algorithm (GA). The results demonstrate that the proposed algorithms can seek and find solutions that exhibit balance between different objectives. However, ACO is able to And better solutions than GA in terms of our objectives.
{"title":"Multi-objective ACO virtual machine placement in cloud computing environments","authors":"Mohammadhossein Malekloo, N. Kara","doi":"10.1109/GLOCOMW.2014.7063415","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063415","url":null,"abstract":"Cloud computing systems provide services to users based on a pay-as-you-go model. The more services that data centers deliver to users, the more those centers need to be prepared. However, data centers consume huge amounts of energy from the environment. In order to improve data-center efficiency, resource consolidation using virtualization technology is becoming important for the reduction of the environmental impact caused by the data centers. One of the important keys in resource consolidation is the mapping of virtual machines to suitable physical machines, a procedure called virtual machine placement. The present paper focuses on this problem of virtual machine placement and proposes a multi-objective optimization approach to minimize both power consumption and resource wastage and to minimize energy communication cost between network elements within a data center. An Ant Colony Optimization (ACO) algorithm is proposed to obtain a Pareto set for a multi-objective problem. The proposed algorithms are tested using Cloudsim tools. The performances of these algorithms are compared with three well-known single-objective approaches and a multi-objective Genetic Algorithm (GA). The results demonstrate that the proposed algorithms can seek and find solutions that exhibit balance between different objectives. However, ACO is able to And better solutions than GA in terms of our objectives.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"94 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127985182","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063626
N. Kolokotronis, Kyriakos Fytrakis, A. Katsiotis, N. Kalouptsidis
Wireless communications system designs are sought that rely on the potential of the physical (PHY) layer to allow a transmitter-receiver pair communicate securely in the presence of one or more eavesdroppers. Communication is performed with the help of multiple trusted relays, via the decode-and-forward (DF) protocol, and assuming knowledge of global channel state information (CSI). Instead of dealing with information-theoretic security, we assume that eavesdroppers have bounded resources, and therefore we need to assure that the transmitted information is computationally secure; this is shown to impose constraints on the maximum power of the signals received by the eavesdroppers. The optimal relay weights that maximize the signal-to-noise ratio (SNR) difference SNRd - SNRe between the destination and the eavesdroppers are determined under various (transmit, security, reliability) power constraints. Closed-form solutions are obtained in some problem formulations for one eavesdropper, whereas an iterative algorithm is proposed if more eavesdroppers are present. Simulation results indicate that a higher SNR value (compared to the non-cooperative case) is attained at the destination, while satisfying the security constraints.
{"title":"Cooperation for secure wireless communications with resource-bounded eavesdroppers","authors":"N. Kolokotronis, Kyriakos Fytrakis, A. Katsiotis, N. Kalouptsidis","doi":"10.1109/GLOCOMW.2014.7063626","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063626","url":null,"abstract":"Wireless communications system designs are sought that rely on the potential of the physical (PHY) layer to allow a transmitter-receiver pair communicate securely in the presence of one or more eavesdroppers. Communication is performed with the help of multiple trusted relays, via the decode-and-forward (DF) protocol, and assuming knowledge of global channel state information (CSI). Instead of dealing with information-theoretic security, we assume that eavesdroppers have bounded resources, and therefore we need to assure that the transmitted information is computationally secure; this is shown to impose constraints on the maximum power of the signals received by the eavesdroppers. The optimal relay weights that maximize the signal-to-noise ratio (SNR) difference SNRd - SNRe between the destination and the eavesdroppers are determined under various (transmit, security, reliability) power constraints. Closed-form solutions are obtained in some problem formulations for one eavesdropper, whereas an iterative algorithm is proposed if more eavesdroppers are present. Simulation results indicate that a higher SNR value (compared to the non-cooperative case) is attained at the destination, while satisfying the security constraints.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126364575","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063628
B. Soret, P. Mogensen, K. Pedersen, M. Aguayo-Torres
We address the fundamental tradeoffs among latency, reliability and throughput in a cellular network. The most important elements influencing the KPIs in a 4G network are identified, and the inter-relationships among them is discussed. We use the effective bandwidth and the effective capacity theory as analytical framework for calculating the maximum achievable rate for a given latency and reliability constraint. The analysis is conducted in a simplified LTE network, providing baseline - yet powerful - insight of the main tradeoffs. Guidelines to extend the theory to more complex systems are also presented, including a semi-analytical approach for cases with intractable channel and traffic models. We also discuss the use of system-level simulations to explore the limits of LTE networks. Based on our findings, we give some recommendations for the imminent 5G technology design phase, in which latency and reliability will be two of the principal KPIs.
{"title":"Fundamental tradeoffs among reliability, latency and throughput in cellular networks","authors":"B. Soret, P. Mogensen, K. Pedersen, M. Aguayo-Torres","doi":"10.1109/GLOCOMW.2014.7063628","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063628","url":null,"abstract":"We address the fundamental tradeoffs among latency, reliability and throughput in a cellular network. The most important elements influencing the KPIs in a 4G network are identified, and the inter-relationships among them is discussed. We use the effective bandwidth and the effective capacity theory as analytical framework for calculating the maximum achievable rate for a given latency and reliability constraint. The analysis is conducted in a simplified LTE network, providing baseline - yet powerful - insight of the main tradeoffs. Guidelines to extend the theory to more complex systems are also presented, including a semi-analytical approach for cases with intractable channel and traffic models. We also discuss the use of system-level simulations to explore the limits of LTE networks. Based on our findings, we give some recommendations for the imminent 5G technology design phase, in which latency and reliability will be two of the principal KPIs.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"155 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114030569","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
扫码关注我们
求助内容：
应助结果提醒方式：