Pub Date : 2017-05-21DOI: 10.1109/ICC.2017.7996810
Chengjun Cai, Xingliang Yuan, Cong Wang
Emerging decentralized storage services such as Storj and Filecoin show promise as a new paradigm for data outsourcing. These services tie cryptocurrency to personal storage resources and leverage blockchain technology to ensure data integrity in distributed networks. Compared to current cloud storage, they are expected to be more scalable, cost effective, and secure. In addition to the features above, strong guarantees of data privacy are seriously desired due to today's prevalent data leak and abuse incidents. However, simply using end-to-end encryption limits the search capability and thus will degrade the user experience. In this paper, we propose an encrypted decentralized storage architecture that can support trustworthy and private keyword search functions. We start from searchable encryption to achieve search on encrypted data. Yet, only adopting this primitive is not sufficient to address particular threats in our target decentralized service model. Service peers would maliciously return incorrect results, while user peers would fraudulently refuse to pay service fees. To resolve those threats, we devise specific secure data addition and keyword search protocols to enable client-side verifiability and blockchain based fair judgments on the search results. For practical considerations, we integrate an efficient dynamic searchable encryption scheme to our protocols as an instantiation to lower the blockchain overhead. Our security and performance analysis indicates the advance of the proposed architecture.
{"title":"Towards trustworthy and private keyword search in encrypted decentralized storage","authors":"Chengjun Cai, Xingliang Yuan, Cong Wang","doi":"10.1109/ICC.2017.7996810","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996810","url":null,"abstract":"Emerging decentralized storage services such as Storj and Filecoin show promise as a new paradigm for data outsourcing. These services tie cryptocurrency to personal storage resources and leverage blockchain technology to ensure data integrity in distributed networks. Compared to current cloud storage, they are expected to be more scalable, cost effective, and secure. In addition to the features above, strong guarantees of data privacy are seriously desired due to today's prevalent data leak and abuse incidents. However, simply using end-to-end encryption limits the search capability and thus will degrade the user experience. In this paper, we propose an encrypted decentralized storage architecture that can support trustworthy and private keyword search functions. We start from searchable encryption to achieve search on encrypted data. Yet, only adopting this primitive is not sufficient to address particular threats in our target decentralized service model. Service peers would maliciously return incorrect results, while user peers would fraudulently refuse to pay service fees. To resolve those threats, we devise specific secure data addition and keyword search protocols to enable client-side verifiability and blockchain based fair judgments on the search results. For practical considerations, we integrate an efficient dynamic searchable encryption scheme to our protocols as an instantiation to lower the blockchain overhead. Our security and performance analysis indicates the advance of the proposed architecture.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"145 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86020921","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 : 2017-05-21DOI: 10.1109/ICC.2017.7996684
Yue Li, Nan Zheng, Haining Wang, Kun Sun, Hui Fang
User preference plays an important factor in E-commerce websites for advertising and marketing, and the disclosure of user preference could also raise privacy concerns. As one of the largest E-commerce platform, Amazon features a wishlist that allows users to keep track of their desired products. In this paper, we investigate Amazon wishlist, and its possible privacy exposure. To this end, we collect complete wishlists of over 30,000 users, by analyzing which we are able to make interesting observations based on user online shopping preference in multiple dimensions. Specifically, we show user preference variation from different demographical groups, including gender and geo-locations. Taking timing factors into consideration, we also observe that unlike traditional walk-in-shop type of shopping, there is no significant difference in the dynamics of Amazon wishlists between weekdays and weekend. In the investigation of user information exposure in Amazon wishlists, we parse and analyze list-descriptions, illustrating which and to what extent user personal information is exposed to the public. Finally, we demonstrate that the information in wishlists has potential to leak a user's private personal information. Based on the collected user data, we can predict user gender with over 80% accuracy by just exploiting items present in Amazon wishlists.
{"title":"A measurement study on Amazon wishlist and its privacy exposure","authors":"Yue Li, Nan Zheng, Haining Wang, Kun Sun, Hui Fang","doi":"10.1109/ICC.2017.7996684","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996684","url":null,"abstract":"User preference plays an important factor in E-commerce websites for advertising and marketing, and the disclosure of user preference could also raise privacy concerns. As one of the largest E-commerce platform, Amazon features a wishlist that allows users to keep track of their desired products. In this paper, we investigate Amazon wishlist, and its possible privacy exposure. To this end, we collect complete wishlists of over 30,000 users, by analyzing which we are able to make interesting observations based on user online shopping preference in multiple dimensions. Specifically, we show user preference variation from different demographical groups, including gender and geo-locations. Taking timing factors into consideration, we also observe that unlike traditional walk-in-shop type of shopping, there is no significant difference in the dynamics of Amazon wishlists between weekdays and weekend. In the investigation of user information exposure in Amazon wishlists, we parse and analyze list-descriptions, illustrating which and to what extent user personal information is exposed to the public. Finally, we demonstrate that the information in wishlists has potential to leak a user's private personal information. Based on the collected user data, we can predict user gender with over 80% accuracy by just exploiting items present in Amazon wishlists.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"60 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84151426","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 : 2017-05-21DOI: 10.1109/ICC.2017.7996980
Vasileios Kotsiou, Georgios Z. Papadopoulos, P. Chatzimisios, Fabrice Théoleyre
With the large growth of the Internet of Things (IoT), a strong focus has been put on designing and developing energy efficient and high performance protocols. Industrial-type wireless networks require strict and on-time delivery guarantees, such as close to 100% network reliability and ultra low delay. To this aim, standards such as IEEE 802.15.4-TSCH or Wireless HART, aim to guarantee high-level network reliability by keeping nodes time-synchronized and by employing a slow channel hopping pattern to combat noisy environments and external interference. In wireless networks, since all the radio channels are not impacted in a similar manner, blacklisting bad channels may improve performance of the whole wireless infrastructure. In this paper, we perform a thorough experimental study to characterize the radio (for all IEEE 802.15.4 channels) and connectivity among the nodes of an indoor testbed. More precisely, we investigate the locality of these blacklisting techniques and we highlighted: the fact that some channels perform poorly only in a small set of locations, for certain radio links. Our study tends to justify the need for local blacklisting techniques, demanding more control packets, but dealing more efficiently with spectral re-use.
{"title":"Is local blacklisting relevant in slow channel hopping low-power wireless networks?","authors":"Vasileios Kotsiou, Georgios Z. Papadopoulos, P. Chatzimisios, Fabrice Théoleyre","doi":"10.1109/ICC.2017.7996980","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996980","url":null,"abstract":"With the large growth of the Internet of Things (IoT), a strong focus has been put on designing and developing energy efficient and high performance protocols. Industrial-type wireless networks require strict and on-time delivery guarantees, such as close to 100% network reliability and ultra low delay. To this aim, standards such as IEEE 802.15.4-TSCH or Wireless HART, aim to guarantee high-level network reliability by keeping nodes time-synchronized and by employing a slow channel hopping pattern to combat noisy environments and external interference. In wireless networks, since all the radio channels are not impacted in a similar manner, blacklisting bad channels may improve performance of the whole wireless infrastructure. In this paper, we perform a thorough experimental study to characterize the radio (for all IEEE 802.15.4 channels) and connectivity among the nodes of an indoor testbed. More precisely, we investigate the locality of these blacklisting techniques and we highlighted: the fact that some channels perform poorly only in a small set of locations, for certain radio links. Our study tends to justify the need for local blacklisting techniques, demanding more control packets, but dealing more efficiently with spectral re-use.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"34 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81472362","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 : 2017-05-21DOI: 10.1109/ICC.2017.7996606
Bin Chen, Biling Zhang, Jung-Lang Yu, Yan Chen, Zhu Han
To overcome the hidden terminal problem a secondary user (SU) may encounter, cooperative spectrum sensing (CSS) is proposed and gained much attention in the last decades. However, due to the selfish nature, SUs may not cooperate unconditionally as most previous works have assumed. Therefore, how to stimulate SUs to play cooperatively is an important issue. In this paper, we propose a reputation-based CSS incentive framework, where the cooperation stimulation problem is modeled as an indirect reciprocity game. In the proposed game, SUs choose how to report their sensing results to the fusion center (FC) and gain reputations, based on which they can access a certain amount of vacant licensed channels in the future. For the proposed game, we derive theoretically the optimal action rule, according to which the SU will truthfully report its result when the estimated average energy is equal to or higher than the given threshold and vice versa. The decision accuracy of the FC thereby can be greatly improved. Moreover, we derive the condition under which the optimal action rule is evolutionarily stable. Finally, simulation results are shown to verify the effectiveness of the proposed scheme.
{"title":"An indirect reciprocity based incentive framework for cooperative spectrum sensing","authors":"Bin Chen, Biling Zhang, Jung-Lang Yu, Yan Chen, Zhu Han","doi":"10.1109/ICC.2017.7996606","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996606","url":null,"abstract":"To overcome the hidden terminal problem a secondary user (SU) may encounter, cooperative spectrum sensing (CSS) is proposed and gained much attention in the last decades. However, due to the selfish nature, SUs may not cooperate unconditionally as most previous works have assumed. Therefore, how to stimulate SUs to play cooperatively is an important issue. In this paper, we propose a reputation-based CSS incentive framework, where the cooperation stimulation problem is modeled as an indirect reciprocity game. In the proposed game, SUs choose how to report their sensing results to the fusion center (FC) and gain reputations, based on which they can access a certain amount of vacant licensed channels in the future. For the proposed game, we derive theoretically the optimal action rule, according to which the SU will truthfully report its result when the estimated average energy is equal to or higher than the given threshold and vice versa. The decision accuracy of the FC thereby can be greatly improved. Moreover, we derive the condition under which the optimal action rule is evolutionarily stable. Finally, simulation results are shown to verify the effectiveness of the proposed scheme.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"54 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87020514","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 : 2017-05-21DOI: 10.1109/ICC.2017.7996360
Fang Fang, Haijun Zhang, Julian Cheng, Victor C. M. Leung
Non-orthogonal multiple access (NOMA) is considered as a promising technology for the fifth generation mobile communications. Energy-efficient resource allocation scheme is studied for a downlink NOMA wireless network, where multiple users can be multiplexed on the same subchannel by applying successive interference cancellation technique at the receivers. Most previous works focus on resource allocation for sum rate maximization with perfect channel state information (CSI) in NOMA systems. We formulate the energy-efficient resource allocation as a probabilistic mixed non-convex optimization problem by considering imperfect CSI. To solve this problem, we decouple it into user scheduling and power allocation sub-problems. We propose a low-complexity suboptimal user scheduling algorithm and a power allocation scheme to maximize the system energy efficiency under the maximum transmitted power limit, imperfect CSI and the outage probability constraints. Simulation results are provided to show that the proposed algorithms yield much improved energy efficiency performance over the conventional orthogonal frequency division multiple access scheme.
{"title":"Energy-efficient resource scheduling for NOMA systems with imperfect channel state information","authors":"Fang Fang, Haijun Zhang, Julian Cheng, Victor C. M. Leung","doi":"10.1109/ICC.2017.7996360","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996360","url":null,"abstract":"Non-orthogonal multiple access (NOMA) is considered as a promising technology for the fifth generation mobile communications. Energy-efficient resource allocation scheme is studied for a downlink NOMA wireless network, where multiple users can be multiplexed on the same subchannel by applying successive interference cancellation technique at the receivers. Most previous works focus on resource allocation for sum rate maximization with perfect channel state information (CSI) in NOMA systems. We formulate the energy-efficient resource allocation as a probabilistic mixed non-convex optimization problem by considering imperfect CSI. To solve this problem, we decouple it into user scheduling and power allocation sub-problems. We propose a low-complexity suboptimal user scheduling algorithm and a power allocation scheme to maximize the system energy efficiency under the maximum transmitted power limit, imperfect CSI and the outage probability constraints. Simulation results are provided to show that the proposed algorithms yield much improved energy efficiency performance over the conventional orthogonal frequency division multiple access scheme.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"40 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86784415","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 : 2017-05-21DOI: 10.1109/ICC.2017.7996758
Jinshan Liu, Gaurang Naik, J. Park
To adequately support high-throughput applications in next-generation WLANs, more spectrum will be needed to accommodate wider channels. To address this issue, spectrum regulators and stakeholders from the wireless industry and the intelligent transportation system communities are exploring possible band sharing approaches in the 5.9 GHz band. Such approaches include techniques that enable the harmonious coexistence of Dedicated Short Range Communications (DSRC) networks and IEEE 802.11ac networks. In this paper, we provide in-depth discussions on how the coexistence of DSRC and 802.11ac impacts the performance of DSRC applications, with a particular focus on vehicular safety applications. We propose an analytical model that provides valuable insights on DSRC network performance and its vulnerability to interference induced by other DSRC nodes as well as 802.11ac nodes. Using the analytical results derived from the model and extensive simulation results, we also propose a methodology for adjusting 802.11ac parameters that enables a DSRC network to meet the performance requirements of safety applications. Using simulations, we also analyze the throughput of the coexisting 802.11ac network.
{"title":"Coexistence of DSRC and Wi-Fi: Impact on the performance of vehicular safety applications","authors":"Jinshan Liu, Gaurang Naik, J. Park","doi":"10.1109/ICC.2017.7996758","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996758","url":null,"abstract":"To adequately support high-throughput applications in next-generation WLANs, more spectrum will be needed to accommodate wider channels. To address this issue, spectrum regulators and stakeholders from the wireless industry and the intelligent transportation system communities are exploring possible band sharing approaches in the 5.9 GHz band. Such approaches include techniques that enable the harmonious coexistence of Dedicated Short Range Communications (DSRC) networks and IEEE 802.11ac networks. In this paper, we provide in-depth discussions on how the coexistence of DSRC and 802.11ac impacts the performance of DSRC applications, with a particular focus on vehicular safety applications. We propose an analytical model that provides valuable insights on DSRC network performance and its vulnerability to interference induced by other DSRC nodes as well as 802.11ac nodes. Using the analytical results derived from the model and extensive simulation results, we also propose a methodology for adjusting 802.11ac parameters that enables a DSRC network to meet the performance requirements of safety applications. Using simulations, we also analyze the throughput of the coexisting 802.11ac network.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"21 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89339910","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 : 2017-05-21DOI: 10.1109/ICC.2017.7996783
Jingwen Zhang, Fanggang Wang, Z. Zhong, D. Cabric
With the advent of cognitive radio (CR) and dynamic spectrum access techniques, where multiple signals may coexist within the same frequency band, multiuser modulation classification problem becomes a vital issue, which has not been sufficiently investigated. In this paper, we consider a cooperative multiuser modulation classification problem, in the presence of unknown multipath channels. A likelihood-based (LB) classifier using the expectation-maximization (EM) algorithm is proposed, which enables to find the maximum likelihood estimates (MLEs) iteratively. Numerical results show that the proposed algorithm achieves significant improvement on the classification performance with a small number of samples when compared to the conventional methods, which demonstrates its reliability and efficiency of identifying modulations of multiple users under the multipath scenarios.
{"title":"Cooperative multiuser modulation classification in multipath channels via expectation-maximization","authors":"Jingwen Zhang, Fanggang Wang, Z. Zhong, D. Cabric","doi":"10.1109/ICC.2017.7996783","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996783","url":null,"abstract":"With the advent of cognitive radio (CR) and dynamic spectrum access techniques, where multiple signals may coexist within the same frequency band, multiuser modulation classification problem becomes a vital issue, which has not been sufficiently investigated. In this paper, we consider a cooperative multiuser modulation classification problem, in the presence of unknown multipath channels. A likelihood-based (LB) classifier using the expectation-maximization (EM) algorithm is proposed, which enables to find the maximum likelihood estimates (MLEs) iteratively. Numerical results show that the proposed algorithm achieves significant improvement on the classification performance with a small number of samples when compared to the conventional methods, which demonstrates its reliability and efficiency of identifying modulations of multiple users under the multipath scenarios.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"23 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85251578","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 : 2017-05-21DOI: 10.1109/ICC.2017.7996660
A. Chorti, E. Belmega
Jamming attacks have been shown to disrupt secret key generation (SKG) in systems that exploit the reciprocity of the wireless medium to generate symmetric keys at two remote locations through public discussion. In this study, the use of frequency hopping/spreading in Rayleigh block fading additive white Gaussian noise (BF-AWGN) channels is investigated as a means to counteract such attacks. The competitive interaction between a pair of legitimate users and a jammer is formulated as a zero-sum game and the corresponding Nash equilibria (NE) are characterized analytically and in closed form. It is found that the jammer's optimal strategy is to spread its power across the entire spectrum. On the contrary, the pair of legitimate users should use frequency spreading only in favorable transmission conditions, and frequency hopping otherwise (e.g., low signal to jamming power ratio). Numerical results show that frequency hopping/spreading in BF-AWGN channels is an effective technique for combating jamming attacks in SKG systems; a modest increase of the system bandwidth can substantially increase the SKG rates.
{"title":"Secret key generation in Rayleigh block fading AWGN channels under jamming attacks","authors":"A. Chorti, E. Belmega","doi":"10.1109/ICC.2017.7996660","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996660","url":null,"abstract":"Jamming attacks have been shown to disrupt secret key generation (SKG) in systems that exploit the reciprocity of the wireless medium to generate symmetric keys at two remote locations through public discussion. In this study, the use of frequency hopping/spreading in Rayleigh block fading additive white Gaussian noise (BF-AWGN) channels is investigated as a means to counteract such attacks. The competitive interaction between a pair of legitimate users and a jammer is formulated as a zero-sum game and the corresponding Nash equilibria (NE) are characterized analytically and in closed form. It is found that the jammer's optimal strategy is to spread its power across the entire spectrum. On the contrary, the pair of legitimate users should use frequency spreading only in favorable transmission conditions, and frequency hopping otherwise (e.g., low signal to jamming power ratio). Numerical results show that frequency hopping/spreading in BF-AWGN channels is an effective technique for combating jamming attacks in SKG systems; a modest increase of the system bandwidth can substantially increase the SKG rates.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85328076","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 : 2017-05-21DOI: 10.1109/ICC.2017.7996394
Miltiades Filippou, Danilo De Donno, Camila Priale, J. Palacios, D. Giustiniano, J. Widmer
Millimeter wave (mm-wave) communication is a topic of intensive recent study, as it allows to significantly boost data rates of future 5G networks. In this paper, we focus on a mm-wave system consisting of a single Access Point (AP) and two User Equipments (UEs), where one UE requires high throughput, while the other is characterized by a low latency demand. Given that setup, we aim at optimally allocating the available AP hardware resources for the beam training phase and data communication, in order to efficiently serve both UEs via hybrid analog-digital beamforming. We evaluate an optimization framework with the objective to maximize the expected rate of one UE, for a given latency constraint set by the other UE. The optimal data rates are illustrated for different latency constraints and for different strategies of exploiting the full RF chain set at the AP side. We observe that our proposed access schemes outperform the basic TDMA approach by up to 22 %.
{"title":"Throughput vs. latency: QoS-centric resource allocation for multi-user millimeter wave systems","authors":"Miltiades Filippou, Danilo De Donno, Camila Priale, J. Palacios, D. Giustiniano, J. Widmer","doi":"10.1109/ICC.2017.7996394","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996394","url":null,"abstract":"Millimeter wave (mm-wave) communication is a topic of intensive recent study, as it allows to significantly boost data rates of future 5G networks. In this paper, we focus on a mm-wave system consisting of a single Access Point (AP) and two User Equipments (UEs), where one UE requires high throughput, while the other is characterized by a low latency demand. Given that setup, we aim at optimally allocating the available AP hardware resources for the beam training phase and data communication, in order to efficiently serve both UEs via hybrid analog-digital beamforming. We evaluate an optimization framework with the objective to maximize the expected rate of one UE, for a given latency constraint set by the other UE. The optimal data rates are illustrated for different latency constraints and for different strategies of exploiting the full RF chain set at the AP side. We observe that our proposed access schemes outperform the basic TDMA approach by up to 22 %.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"223 1 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76670871","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 : 2017-05-21DOI: 10.1109/ICC.2017.7996795
Yannan Ruan, Wei Wang, Zhaoyang Zhang, V. Lau
In this paper, we study the delay-aware access control of massive random access for machine-type communications (MTC). We model this stochastic optimization problem as an infinite horizon average cost Markov decision process. To deal with the distributive requirement and the exponential computational complexity, we first exploit the property of successful access probability to transform the coupling to the constraint on the number of MTC devices attempting to access. As a result, we decompose the Bellman equation into multiple fixed point equations for each MTC device by primal-dual decomposition. Based on the equivalent per-MTC fixed point equations, we propose the online hierarchical stochastic learning algorithm to estimate the local Q-factors and determine the access decision at the MTC devices separately with the assistance of the base station which broadcasts common control information only. Finally, the simulation result shows that the proposed hierarchical stochastic learning algorithm has significant performance gain over the baseline algorithm.
{"title":"Delay-aware massive random access for machine-type communications via hierarchical stochastic learning","authors":"Yannan Ruan, Wei Wang, Zhaoyang Zhang, V. Lau","doi":"10.1109/ICC.2017.7996795","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996795","url":null,"abstract":"In this paper, we study the delay-aware access control of massive random access for machine-type communications (MTC). We model this stochastic optimization problem as an infinite horizon average cost Markov decision process. To deal with the distributive requirement and the exponential computational complexity, we first exploit the property of successful access probability to transform the coupling to the constraint on the number of MTC devices attempting to access. As a result, we decompose the Bellman equation into multiple fixed point equations for each MTC device by primal-dual decomposition. Based on the equivalent per-MTC fixed point equations, we propose the online hierarchical stochastic learning algorithm to estimate the local Q-factors and determine the access decision at the MTC devices separately with the assistance of the base station which broadcasts common control information only. Finally, the simulation result shows that the proposed hierarchical stochastic learning algorithm has significant performance gain over the baseline algorithm.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"7 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73093196","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
扫码关注我们
求助内容：
应助结果提醒方式：