Pub Date : 2016-05-22DOI: 10.1109/ICC.2016.7511603
S. Misra, Abu Saleh Md Tayeen, Wen Xu
The popularity of online social networks (OSNs) has resulted in them being targeted with Sybil attacks, where an adversary forges many fake identities (called Sybils) to disrupt or control the normal functioning of the system. Several schemes have been proposed to defend against Sybil attacks. Most of these schemes work by computing the landing probability or statistical distribution of visiting frequency of random walks. These schemes usually have high running time cost and are highly dependent upon the proper choice of known trusted nodes. To address these limitations, in this paper we present SybilExposer, an efficient and effective Sybil community detection algorithm, which relies on the properties of social graph communities to rank communities according to their perceived likelihood of being fake or Sybil. Our experiments on several real-world OSN graphs illustrate that SybilExposer has close to 100% true positive rate and nearly zero false positive rate in identifying Sybil communities, and the best running time complexity compared to the state of the art.
{"title":"SybilExposer: An effective scheme to detect Sybil communities in online social networks","authors":"S. Misra, Abu Saleh Md Tayeen, Wen Xu","doi":"10.1109/ICC.2016.7511603","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511603","url":null,"abstract":"The popularity of online social networks (OSNs) has resulted in them being targeted with Sybil attacks, where an adversary forges many fake identities (called Sybils) to disrupt or control the normal functioning of the system. Several schemes have been proposed to defend against Sybil attacks. Most of these schemes work by computing the landing probability or statistical distribution of visiting frequency of random walks. These schemes usually have high running time cost and are highly dependent upon the proper choice of known trusted nodes. To address these limitations, in this paper we present SybilExposer, an efficient and effective Sybil community detection algorithm, which relies on the properties of social graph communities to rank communities according to their perceived likelihood of being fake or Sybil. Our experiments on several real-world OSN graphs illustrate that SybilExposer has close to 100% true positive rate and nearly zero false positive rate in identifying Sybil communities, and the best running time complexity compared to the state of the art.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116062151","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511212
Shuowen Zhang, Rui Zhang, Teng Joon Lim
In this paper, we study the receive beamforming design to minimize the symbol error rate (SER) in a point-to-point multiple-input multiple-output (MIMO) system with constant envelope (CE) precoding. In this case, a constellation is feasible at the combiner output of the receiver if and only if it can be scaled to lie in an annular region, whose boundaries are determined by channel realization, receive beamforming and per-antenna transmit power. By approximating the exact SER with its union bound, we aim to optimize the receive beamforming weights to maximize the minimum Euclidean distance (MED) between any two signal points at the combiner output for any desired constellation and given channel realization, subject to the feasibility constraint of the constellation. We first show that under the assumption of independent and identically distributed (i.i.d.) Rayleigh fading channel, this problem is feasible as long as there are no more transmit antennas than receive antennas. Then, we assume the aforementioned condition holds and reformulate this problem into an equivalent quadratically constrained quadratic program (QCQP), for which we find an approximate solution by applying the semidefinite relaxation (SDR) technique and a customized Gaussian randomization method. Numerical results show that our proposed receive beamforming scheme achieves significantly improved SER performance than other benchmark schemes.
{"title":"Receive beamforming optimization for MIMO system with constant envelope precoding","authors":"Shuowen Zhang, Rui Zhang, Teng Joon Lim","doi":"10.1109/ICC.2016.7511212","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511212","url":null,"abstract":"In this paper, we study the receive beamforming design to minimize the symbol error rate (SER) in a point-to-point multiple-input multiple-output (MIMO) system with constant envelope (CE) precoding. In this case, a constellation is feasible at the combiner output of the receiver if and only if it can be scaled to lie in an annular region, whose boundaries are determined by channel realization, receive beamforming and per-antenna transmit power. By approximating the exact SER with its union bound, we aim to optimize the receive beamforming weights to maximize the minimum Euclidean distance (MED) between any two signal points at the combiner output for any desired constellation and given channel realization, subject to the feasibility constraint of the constellation. We first show that under the assumption of independent and identically distributed (i.i.d.) Rayleigh fading channel, this problem is feasible as long as there are no more transmit antennas than receive antennas. Then, we assume the aforementioned condition holds and reformulate this problem into an equivalent quadratically constrained quadratic program (QCQP), for which we find an approximate solution by applying the semidefinite relaxation (SDR) technique and a customized Gaussian randomization method. Numerical results show that our proposed receive beamforming scheme achieves significantly improved SER performance than other benchmark schemes.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"687 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122701494","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511087
A. Rao, F. Abdesslem, Anders Lindgren, A. Ziviani
Exploring a large area can be conveniently performed by a team of small autonomous vehicles for different applications, such as search and rescue, cleaning, or lawn mowing. The efficiency and performance of such autonomous exploration depends on the exploration algorithm implemented by the vehicles, and can be enhanced with a better communication and collaboration strategy within the team. In this paper, a new algorithm is proposed and evaluated where vehicles with a limited communication range pro-actively seek their teammates to exchange information about the explored area. Simulations show that this approach allows the vehicles to finish the exploration and return to their base station 18% faster, without consuming more energy.
{"title":"Team communication strategy for collaborative exploration by autonomous vehicles","authors":"A. Rao, F. Abdesslem, Anders Lindgren, A. Ziviani","doi":"10.1109/ICC.2016.7511087","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511087","url":null,"abstract":"Exploring a large area can be conveniently performed by a team of small autonomous vehicles for different applications, such as search and rescue, cleaning, or lawn mowing. The efficiency and performance of such autonomous exploration depends on the exploration algorithm implemented by the vehicles, and can be enhanced with a better communication and collaboration strategy within the team. In this paper, a new algorithm is proposed and evaluated where vehicles with a limited communication range pro-actively seek their teammates to exchange information about the explored area. Simulations show that this approach allows the vehicles to finish the exploration and return to their base station 18% faster, without consuming more energy.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122735071","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511242
M. Dabbagh, A. Rayes, B. Hamdaoui, M. Guizani
We propose efficient control strategies for deciding the amount of energy that a battery needs to charge/discharge over time with the objective of minimizing the Peak Charge and the Energy Charge components of the Data Center (DC) electricity bill. We consider first the case where the DC's power demands throughout the whole billing cycle are known and we present an optimal peak shaving control strategy for a battery that has certain leakage and conversion losses. We then relax this assumption and propose an efficient battery control strategy when we only know predictions of the DC's power demands in a short duration in the future. Several comparative studies are conducted based on real traces from a Google DC in order to validate the proposed techniques.
{"title":"Peak shaving through optimal energy storage control for data centers","authors":"M. Dabbagh, A. Rayes, B. Hamdaoui, M. Guizani","doi":"10.1109/ICC.2016.7511242","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511242","url":null,"abstract":"We propose efficient control strategies for deciding the amount of energy that a battery needs to charge/discharge over time with the objective of minimizing the Peak Charge and the Energy Charge components of the Data Center (DC) electricity bill. We consider first the case where the DC's power demands throughout the whole billing cycle are known and we present an optimal peak shaving control strategy for a battery that has certain leakage and conversion losses. We then relax this assumption and propose an efficient battery control strategy when we only know predictions of the DC's power demands in a short duration in the future. Several comparative studies are conducted based on real traces from a Google DC in order to validate the proposed techniques.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122539351","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511172
T. A. Zewde, M. C. Gursoy
In this paper, we study the performance of wireless information and power transfer in the presence of statistical queuing constraints. We consider harvest-then-transmit protocol in which users first harvest energy from a dedicated source and then transmit information through an uplink multiple access channel (MAC). Each user is subject to limitations on the buffer overflow probability, specified by the quality of service (QoS) exponent θ, and the optimal time allocation for energy harvesting and information decoding operations depends on these constraints in addition to the channel characteristics. We formulate optimization problems to maximize the throughput with and without QoS constraints. In both cases, the problems are convex, and hence Karush-Kuhn-Tucker (KKT) conditions are necessary and sufficient for global optimality. However, it is difficult to obtain closed-form expressions for optimal time interval since we assume that operating intervals are independent of each fading state realization. Hence, we develop an algorithm to obtain optimal solutions numerically. Simulation results justify that QoS constraints primarily affect achievable rate distribution among the users, and override the channel conditions.
{"title":"Wireless-powered communication under statistical quality of service constraints","authors":"T. A. Zewde, M. C. Gursoy","doi":"10.1109/ICC.2016.7511172","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511172","url":null,"abstract":"In this paper, we study the performance of wireless information and power transfer in the presence of statistical queuing constraints. We consider harvest-then-transmit protocol in which users first harvest energy from a dedicated source and then transmit information through an uplink multiple access channel (MAC). Each user is subject to limitations on the buffer overflow probability, specified by the quality of service (QoS) exponent θ, and the optimal time allocation for energy harvesting and information decoding operations depends on these constraints in addition to the channel characteristics. We formulate optimization problems to maximize the throughput with and without QoS constraints. In both cases, the problems are convex, and hence Karush-Kuhn-Tucker (KKT) conditions are necessary and sufficient for global optimality. However, it is difficult to obtain closed-form expressions for optimal time interval since we assume that operating intervals are independent of each fading state realization. Hence, we develop an algorithm to obtain optimal solutions numerically. Simulation results justify that QoS constraints primarily affect achievable rate distribution among the users, and override the channel conditions.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122602908","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511084
Wiem Benrhaiem, A. Hafid, P. Sahu
We propose a multi-hop reliable broadcasting (M-HRB) scheme suitable for a wide range of vehicular ad-hoc network (VANET) applications in urban setting. Multi-hop reliability is performed using local state information. Basically, a street is divided into multiple cells to form grid-like zones. We apply a proactive local state processing scheme exploiting features of periodic beacons to estimate wireless link quality of the neighbours. With availability of local state information, adequate numbers of forwarders are selected to achieve desired reliability in each hop for a multi-hop broadcast. Furthermore, M-HRB saves bandwidth consumption by enabling cooperation among forwarders. Simulation results show the superior performance of M-HRB in city environment in terms of reliability and bandwidth consumption. M-HRB also satisfies transmission latency requirements for time-sensitive vehicular applications.
{"title":"Multi-hop reliability for broadcast-based VANET in city environments","authors":"Wiem Benrhaiem, A. Hafid, P. Sahu","doi":"10.1109/ICC.2016.7511084","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511084","url":null,"abstract":"We propose a multi-hop reliable broadcasting (M-HRB) scheme suitable for a wide range of vehicular ad-hoc network (VANET) applications in urban setting. Multi-hop reliability is performed using local state information. Basically, a street is divided into multiple cells to form grid-like zones. We apply a proactive local state processing scheme exploiting features of periodic beacons to estimate wireless link quality of the neighbours. With availability of local state information, adequate numbers of forwarders are selected to achieve desired reliability in each hop for a multi-hop broadcast. Furthermore, M-HRB saves bandwidth consumption by enabling cooperation among forwarders. Simulation results show the superior performance of M-HRB in city environment in terms of reliability and bandwidth consumption. M-HRB also satisfies transmission latency requirements for time-sensitive vehicular applications.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122612024","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511067
Yamuna Dhungana, C. Tellambura
The downlink performance of two-tier (macro/pico) multi-antenna cellular heterogeneous networks (HetNets) employing space division multiple access (SDMA) technique is analyzed in this paper. The number of users simultaneously served with SDMA by each BS in a resource block depends on user distribution, unlike previous studies which assume the number to be any arbitrary value. By exploiting the feasibility of deploying larger number of antennas at macro BS, we propose to utilize the excess spatial degrees of freedom for interference nulling to pico users from their corresponding nearest (dominant) macro BSs. Biased-nearest-distance based user association scheme is proposed as those introduced in previous studies are unsuitable for analyzing the proposed multi-antenna scheme. Coverage probability and average data rate of a typical user are then evaluated. Our results demonstrate that the proposed interference nulling scheme has strong potential to improve performance. However, the system parameters such as association bias, and number of dedicated antennas at each macro BS for serving its own users must be carefully tuned.
{"title":"Performance analysis of SDMA with inter-tier interference nulling in HetNets","authors":"Yamuna Dhungana, C. Tellambura","doi":"10.1109/ICC.2016.7511067","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511067","url":null,"abstract":"The downlink performance of two-tier (macro/pico) multi-antenna cellular heterogeneous networks (HetNets) employing space division multiple access (SDMA) technique is analyzed in this paper. The number of users simultaneously served with SDMA by each BS in a resource block depends on user distribution, unlike previous studies which assume the number to be any arbitrary value. By exploiting the feasibility of deploying larger number of antennas at macro BS, we propose to utilize the excess spatial degrees of freedom for interference nulling to pico users from their corresponding nearest (dominant) macro BSs. Biased-nearest-distance based user association scheme is proposed as those introduced in previous studies are unsuitable for analyzing the proposed multi-antenna scheme. Coverage probability and average data rate of a typical user are then evaluated. Our results demonstrate that the proposed interference nulling scheme has strong potential to improve performance. However, the system parameters such as association bias, and number of dedicated antennas at each macro BS for serving its own users must be carefully tuned.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114258228","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511396
Zhiyi Lu, Haojie Zhou, V. Li, Yi Long
While the influence maximization problem (IMP) which studies how to trigger a large cascade in Online Social Networks (OSNs) by properly selecting seed nodes has been extensively studied in the past decade, one important and practical issue on how these seed nodes or celebrities will get paid for promoting cascades is seldom addressed. In order to get selected by the advertising platform and to maximize his/her own utility, it is natural for each celebrity to determine his/her price of promoting cascades based on other celebrities' decisions and his/her power of influence. In this paper, we formulate the problem of determining prices by celebrities as a pricing game, with celebrities as players. We show that celebrity selection by the advertising platform is NP-hard, and assume that the advertising platform will adopt the simple greedy algorithm that is widely used in IMP. Under this assumption, we study the pure Nash equilibrium of the pricing game among celebrities. In particular, we prove that while equilibrium exists and is unique when there are only two or three players, the equilibrium is not guaranteed to exist in cases of four or more players.
在过去的十年中，研究如何通过正确选择种子节点来引发在线社交网络(Online Social Networks, OSNs)中大规模级联的影响最大化问题(IMP)已经得到了广泛的研究，但关于这些种子节点或名人如何通过促进级联获得报酬的一个重要而现实的问题却很少得到解决。为了被广告平台选中，实现自身效用最大化，每个名人自然会根据其他名人的决定和自己的影响力来确定自己的推广级联价格。本文将名人定价问题表述为一个以名人为参与者的定价博弈问题。我们证明了广告平台对名人的选择是np困难的，并假设广告平台将采用IMP中广泛使用的简单贪婪算法，在此假设下，我们研究了名人定价博弈的纯纳什均衡。特别地，我们证明了当只有两个或三个参与者时，均衡存在并且是唯一的，但当有四个或更多参与者时，均衡不保证存在。
{"title":"Pricing game of celebrities in sponsored viral marketing in online social networks with a greedy advertising platform","authors":"Zhiyi Lu, Haojie Zhou, V. Li, Yi Long","doi":"10.1109/ICC.2016.7511396","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511396","url":null,"abstract":"While the influence maximization problem (IMP) which studies how to trigger a large cascade in Online Social Networks (OSNs) by properly selecting seed nodes has been extensively studied in the past decade, one important and practical issue on how these seed nodes or celebrities will get paid for promoting cascades is seldom addressed. In order to get selected by the advertising platform and to maximize his/her own utility, it is natural for each celebrity to determine his/her price of promoting cascades based on other celebrities' decisions and his/her power of influence. In this paper, we formulate the problem of determining prices by celebrities as a pricing game, with celebrities as players. We show that celebrity selection by the advertising platform is NP-hard, and assume that the advertising platform will adopt the simple greedy algorithm that is widely used in IMP. Under this assumption, we study the pure Nash equilibrium of the pricing game among celebrities. In particular, we prove that while equilibrium exists and is unique when there are only two or three players, the equilibrium is not guaranteed to exist in cases of four or more players.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122116128","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511041
Yan Li, Shifang Dai, Ji-Zheng You
Optical orthogonal frequency division multiplexing (O-OFDM) technology, which divides fiber bandwidth into multiple OFDM subcarriers, enables high bandwidth and fine granularity intra data center networks (DCNs) to provide powerful platform for cloud computing. An important issue raised in such O-OFDM based intra-DCNs is how to assign contiguous subcarriers for connection requests with the aim to balance the revenue of cloud providers with the connection performance of tenants. In this paper, considering the limited bandwidth, we firstly propose a revenue model that introduces a penalty policy for assuring connection performance according to the reservation price paid by tenants. We then study revenue-oriented bandwidth allocation problem over O-OFDM intra-DCNs based on the proposed revenue model. For a special case that there is no background traffic while conducting bandwidth allocation, we show that the problem can be transformed into a minimum cost network flow problem. For the case that extremely strict penalty is regulated, we design a two-phase algorithm to solve the problem. An efficient heuristic algorithm is also proposed to settle the problem with general form. The efficiency of the work is finally demonstrated by simulations.
{"title":"Revenue-oriented bandwidth allocation in optical OFDM intra data center networks","authors":"Yan Li, Shifang Dai, Ji-Zheng You","doi":"10.1109/ICC.2016.7511041","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511041","url":null,"abstract":"Optical orthogonal frequency division multiplexing (O-OFDM) technology, which divides fiber bandwidth into multiple OFDM subcarriers, enables high bandwidth and fine granularity intra data center networks (DCNs) to provide powerful platform for cloud computing. An important issue raised in such O-OFDM based intra-DCNs is how to assign contiguous subcarriers for connection requests with the aim to balance the revenue of cloud providers with the connection performance of tenants. In this paper, considering the limited bandwidth, we firstly propose a revenue model that introduces a penalty policy for assuring connection performance according to the reservation price paid by tenants. We then study revenue-oriented bandwidth allocation problem over O-OFDM intra-DCNs based on the proposed revenue model. For a special case that there is no background traffic while conducting bandwidth allocation, we show that the problem can be transformed into a minimum cost network flow problem. For the case that extremely strict penalty is regulated, we design a two-phase algorithm to solve the problem. An efficient heuristic algorithm is also proposed to settle the problem with general form. The efficiency of the work is finally demonstrated by simulations.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116590025","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 : 2016-05-22DOI: 10.1109/ICC.2016.7510795
Deli Qiao, Mustafa Ozmen, M. C. Gursoy
Power control policies in the fading multiple-access channels (MAC) with quality of service (QoS) constraints and random arrivals are studied. Perfect channel side information (CSI) is assumed to be available at both the transmitters and the receiver. Two types of Markovian sources, namely discrete Markov source and Markov fluid source, are considered. The maximum average arrival rates that can be supported in the fading multiple-access channel under QoS constraints are identified by incorporating the effective capacity of time-varying wireless transmission channels and effective bandwidth of random arrivals. The average throughput region is shown to be convex. Power control policies that maximize the weighted summation of the average arrival rates are characterized in the two-user case. Specifically, given the decoding order strategy, the conditions that the optimal power control policies must satisfy are determined, and an algorithm for the optimal power control policies is proposed for different source arrival models.
{"title":"QoS-driven power control in fading multiple-access channels with random arrivals","authors":"Deli Qiao, Mustafa Ozmen, M. C. Gursoy","doi":"10.1109/ICC.2016.7510795","DOIUrl":"https://doi.org/10.1109/ICC.2016.7510795","url":null,"abstract":"Power control policies in the fading multiple-access channels (MAC) with quality of service (QoS) constraints and random arrivals are studied. Perfect channel side information (CSI) is assumed to be available at both the transmitters and the receiver. Two types of Markovian sources, namely discrete Markov source and Markov fluid source, are considered. The maximum average arrival rates that can be supported in the fading multiple-access channel under QoS constraints are identified by incorporating the effective capacity of time-varying wireless transmission channels and effective bandwidth of random arrivals. The average throughput region is shown to be convex. Power control policies that maximize the weighted summation of the average arrival rates are characterized in the two-user case. Specifically, given the decoding order strategy, the conditions that the optimal power control policies must satisfy are determined, and an algorithm for the optimal power control policies is proposed for different source arrival models.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129793914","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
扫码关注我们
求助内容：
应助结果提醒方式：