Pub Date : 2018-06-01DOI: 10.1109/SPAWC.2018.8446016
Brandon Oselio, Sijia Liu, A. Hero
Many real-world complex systems can be described by a network structure, where a set of elementary units, e.g, human, gene, sensor, or other types of ‘nodes' are connected by edges that represent dyadic relations, e.g., an observed interaction or an inferred dependence measured by correlation or mutual information. Such so-called relevance networks can be undirected or directed graphs depending on whether the relevance measure is symmetric or asymmetric. Often there are multiple ways that pairs of nodes might be related, e.g., by family ties, friendships, and professional connections in a social network. A multi-layer relevance network can be used to simultaneously capture these different types of relations. Dynamic relevance networks whose edges change over time are a type of multi-layer network, with each layer representing relations at a particular time instant. In this paper, we review and discuss multi-layer relevance network models in the context of relevance measures and node centrality for datasets with multivalent relations. We illustrate these models for dynamic gene regulatory networks and dynamic social networks.
{"title":"Multi-Layer Relevance Networks","authors":"Brandon Oselio, Sijia Liu, A. Hero","doi":"10.1109/SPAWC.2018.8446016","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8446016","url":null,"abstract":"Many real-world complex systems can be described by a network structure, where a set of elementary units, e.g, human, gene, sensor, or other types of ‘nodes' are connected by edges that represent dyadic relations, e.g., an observed interaction or an inferred dependence measured by correlation or mutual information. Such so-called relevance networks can be undirected or directed graphs depending on whether the relevance measure is symmetric or asymmetric. Often there are multiple ways that pairs of nodes might be related, e.g., by family ties, friendships, and professional connections in a social network. A multi-layer relevance network can be used to simultaneously capture these different types of relations. Dynamic relevance networks whose edges change over time are a type of multi-layer network, with each layer representing relations at a particular time instant. In this paper, we review and discuss multi-layer relevance network models in the context of relevance measures and node centrality for datasets with multivalent relations. We illustrate these models for dynamic gene regulatory networks and dynamic social networks.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121339213","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445772
Steven Claessens, Cheng-Ming Chen, D. Schreurs, S. Pollin
Massive multiple-input multiple-output transfer (MaMIMO) has been shown to be a viable technology for improving spectrum and energy efficiency of future wireless generations, both using theoretical and measurement-based approaches. While the benefits of Massive MIMO for simultaneous wireless information and power transfer (SWIPT) have been established in theory, no practical evaluations have been reported. In this paper, we evaluate the power transfer efficiency of various established precoding algorithms, using random data signals and two methods to deal with the necessity of channel state information. A first method relies on uplink pilots transmitted by the energy harvesting receiver, while for the second method we use channel beacons to avoid that every sensor has to consume power to transmit pilots. We experimentally evaluate the efficiency of both approaches as function of the number of antennas and the precoder used and show that increasing the amount of antennas from 2 to 64 while fixing total transmit power results in a 10 fold increase in rectifier output voltage. When using a channel beacon, we show that receive power can be sacrificed to construct broader beams, which can be shared by different wirelessly powered sensors. All measurements report rectifier output voltage, as measured in our facility.
{"title":"Massive MIMO for SWIPT: A Measurement-Based Study of Precoding","authors":"Steven Claessens, Cheng-Ming Chen, D. Schreurs, S. Pollin","doi":"10.1109/SPAWC.2018.8445772","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445772","url":null,"abstract":"Massive multiple-input multiple-output transfer (MaMIMO) has been shown to be a viable technology for improving spectrum and energy efficiency of future wireless generations, both using theoretical and measurement-based approaches. While the benefits of Massive MIMO for simultaneous wireless information and power transfer (SWIPT) have been established in theory, no practical evaluations have been reported. In this paper, we evaluate the power transfer efficiency of various established precoding algorithms, using random data signals and two methods to deal with the necessity of channel state information. A first method relies on uplink pilots transmitted by the energy harvesting receiver, while for the second method we use channel beacons to avoid that every sensor has to consume power to transmit pilots. We experimentally evaluate the efficiency of both approaches as function of the number of antennas and the precoder used and show that increasing the amount of antennas from 2 to 64 while fixing total transmit power results in a 10 fold increase in rectifier output voltage. When using a channel beacon, we show that receive power can be sacrificed to construct broader beams, which can be shared by different wirelessly powered sensors. All measurements report rectifier output voltage, as measured in our facility.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127446964","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8446033
M. Melvasalo, V. Koivunen
Radio frequency surveillance avoiding path planning for platforms such as aircrafts is becoming increasingly challenging due to dense spectrum use and evolving radar systems. In order to find a safe path we need to acquire and learn awareness about the total exposure to radars. In practice, surveillance by radars can not be totally avoided, but it must be minimized or kept in a tolerable level. In this paper we first construct spectrum maps which present the levels of adversary surveillance signals as well as unintentional interferences. These maps are used to create virtual potential fields where adversary surveillance signals are modeled as repulsive forces. The proposed path planning algorithm navigates through such a potential field. It is a heuristic multistep algorithm that plans a surveillance avoiding path that trades off between the path length and the total level of surveillance signals illuminating the aircraft during the mission.
{"title":"Using Spectrum Maps for Surveillance Avoiding Path Planning","authors":"M. Melvasalo, V. Koivunen","doi":"10.1109/SPAWC.2018.8446033","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8446033","url":null,"abstract":"Radio frequency surveillance avoiding path planning for platforms such as aircrafts is becoming increasingly challenging due to dense spectrum use and evolving radar systems. In order to find a safe path we need to acquire and learn awareness about the total exposure to radars. In practice, surveillance by radars can not be totally avoided, but it must be minimized or kept in a tolerable level. In this paper we first construct spectrum maps which present the levels of adversary surveillance signals as well as unintentional interferences. These maps are used to create virtual potential fields where adversary surveillance signals are modeled as repulsive forces. The proposed path planning algorithm navigates through such a potential field. It is a heuristic multistep algorithm that plans a surveillance avoiding path that trades off between the path length and the total level of surveillance signals illuminating the aircraft during the mission.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126174268","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445976
Ligong Wang
We consider a problem of communication over a continuous-time additive Gaussian noise channel. A covertness constraint is imposed on the communication protocol, which says that the channel output must statistically resemble pure noise. When there is no bandwidth constraint on the input, we argue that the covert communication capacity of this channel is positive, in contrast to the band-limited case where covertness requires that the amount of transmission grow at most like the square root of total communication time. This claim is formally proven in the case where the Gaussian noise is white with respect to the bandwidth used by the transmitter.
{"title":"On Covert Communication Over Infinite-Bandwidth Gaussian Channels","authors":"Ligong Wang","doi":"10.1109/SPAWC.2018.8445976","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445976","url":null,"abstract":"We consider a problem of communication over a continuous-time additive Gaussian noise channel. A covertness constraint is imposed on the communication protocol, which says that the channel output must statistically resemble pure noise. When there is no bandwidth constraint on the input, we argue that the covert communication capacity of this channel is positive, in contrast to the band-limited case where covertness requires that the amount of transmission grow at most like the square root of total communication time. This claim is formally proven in the case where the Gaussian noise is white with respect to the bandwidth used by the transmitter.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121995538","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445924
Milind Rao, N. Farsad, A. Goldsmith
We consider joint source and channel coding of natural language over a noisy channel using deep learning. While the typical approach based on separate source and channel code design minimizes bit error rates, the proposed deep learning approach preserves semantic information of sentences. In particular, unlike previous work which used a fixed-length encoding per sentence, a variable-length neural network encoder is presented. The performance of this new architecture is compared to the one with fixed-length encoding per sentence. We show that the variable-length encoder has a lower word error rate compared with the fixed-length encoder as well as separate source and channel coding schemes across several different communication channels.
{"title":"Variable Length Joint Source-Channel Coding of Text Using Deep Neural Networks","authors":"Milind Rao, N. Farsad, A. Goldsmith","doi":"10.1109/SPAWC.2018.8445924","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445924","url":null,"abstract":"We consider joint source and channel coding of natural language over a noisy channel using deep learning. While the typical approach based on separate source and channel code design minimizes bit error rates, the proposed deep learning approach preserves semantic information of sentences. In particular, unlike previous work which used a fixed-length encoding per sentence, a variable-length neural network encoder is presented. The performance of this new architecture is compared to the one with fixed-length encoding per sentence. We show that the variable-length encoder has a lower word error rate compared with the fixed-length encoder as well as separate source and channel coding schemes across several different communication channels.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129601841","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445981
S. Farazi, A. G. Klein, J. McNeill, D. Brown
This paper studies a multi-source “age of information” problem in multi-hop wireless networks with packetized status updates and explicit channel contention. Specifically, the scenario considered in this paper assumes that each node in the network is a both a source and a monitor of information. Nodes take turns broadcasting their information to other nodes in the network while also maintaining tables of status updates for the information received from all other nodes in the network. Lower bounds on the peak and average age of information are derived and are found to be a function of fundamental graph properties including the connected domination number of the graph and the average shortest path length. In addition to these converse results, achievability results are developed through the presentation of an explicit algorithm for constructing near-optimal status update schedules along with an analytical upper bound for the average and peak age of these schedules. Finally, numerical results are presented that compute the bounds, construct schedules, and compute the achieved average and peak ages of these schedules exhaustively over every connected network topology with nine or fewer nodes. The results show that the the developed schedules achieve a peak age exactly matching the lower bounds and an average age within a multiplicative factor of 1.035 of the lower bound in all tested cases.
{"title":"On the Age of Information in Multi-Source Multi-Hop Wireless Status Update Networks","authors":"S. Farazi, A. G. Klein, J. McNeill, D. Brown","doi":"10.1109/SPAWC.2018.8445981","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445981","url":null,"abstract":"This paper studies a multi-source “age of information” problem in multi-hop wireless networks with packetized status updates and explicit channel contention. Specifically, the scenario considered in this paper assumes that each node in the network is a both a source and a monitor of information. Nodes take turns broadcasting their information to other nodes in the network while also maintaining tables of status updates for the information received from all other nodes in the network. Lower bounds on the peak and average age of information are derived and are found to be a function of fundamental graph properties including the connected domination number of the graph and the average shortest path length. In addition to these converse results, achievability results are developed through the presentation of an explicit algorithm for constructing near-optimal status update schedules along with an analytical upper bound for the average and peak age of these schedules. Finally, numerical results are presented that compute the bounds, construct schedules, and compute the achieved average and peak ages of these schedules exhaustively over every connected network topology with nine or fewer nodes. The results show that the the developed schedules achieve a peak age exactly matching the lower bounds and an average age within a multiplicative factor of 1.035 of the lower bound in all tested cases.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129104696","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445861
Nikolaos Nomikos, N. Pappas, Themistoklis Charalambous, Y. Pignolet
We consider a network of buffer-aided wireless devices having to transmit deadline-constrained data packets on a slotted-ALOHA random-access channel. While retransmission-based communication enhances reliability, the transmission of packets in the queue is delayed and as a result, they might get dropped before they are transmitted successfully. In this work, we study the performance of deadline-constrained bursty traffic with retransmissions providing a Markov chain-based analysis. The aim is to reveal the trade-off between the packet deadline and the number of retransmissions as a function of the arrival rate, and pave the way towards finding the optimal number of retransmissions, given the packet deadline and packet arrival rate. Furthermore, performance evaluation is conducted for a user with varying transmit probability and different number of retransmissions. The results reveal the effect of these parameters on the drop probability and average throughput showing the values under which, improved performance can be obtained.
{"title":"Deadline-constrained Bursty Traffic in Random Access Wireless Networks","authors":"Nikolaos Nomikos, N. Pappas, Themistoklis Charalambous, Y. Pignolet","doi":"10.1109/SPAWC.2018.8445861","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445861","url":null,"abstract":"We consider a network of buffer-aided wireless devices having to transmit deadline-constrained data packets on a slotted-ALOHA random-access channel. While retransmission-based communication enhances reliability, the transmission of packets in the queue is delayed and as a result, they might get dropped before they are transmitted successfully. In this work, we study the performance of deadline-constrained bursty traffic with retransmissions providing a Markov chain-based analysis. The aim is to reveal the trade-off between the packet deadline and the number of retransmissions as a function of the arrival rate, and pave the way towards finding the optimal number of retransmissions, given the packet deadline and packet arrival rate. Furthermore, performance evaluation is conducted for a user with varying transmit probability and different number of retransmissions. The results reveal the effect of these parameters on the drop probability and average throughput showing the values under which, improved performance can be obtained.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130677278","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445974
H. Çelebi, Antonios Pitarokoilis, M. Skoglund
Squared-envelope receivers, also known as energy detectors, are, due to their simplified circuitry, low-cost and low-complexity receivers. Hence they are attractive implementation structures for future Internet-of-Things (IoT) applications. Even though there is considerable work on the wider research area of squared-envelope receivers, a comprehensive comparison and statistical characterization of training-assisted channel estimators for squared-envelope receivers appear to be absent from the literature. A detailed description of practical channel estimation schemes is necessary for the optimal training design of latency-constrained IoT applications. In this paper, various channel estimators are derived, their bias and variance are studied, and their performance is numerically compared against the Cramer-Rao lower bound.
{"title":"Training-Assisted Channel Estimation for Low-Complexity Squared-Envelope Receivers","authors":"H. Çelebi, Antonios Pitarokoilis, M. Skoglund","doi":"10.1109/SPAWC.2018.8445974","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445974","url":null,"abstract":"Squared-envelope receivers, also known as energy detectors, are, due to their simplified circuitry, low-cost and low-complexity receivers. Hence they are attractive implementation structures for future Internet-of-Things (IoT) applications. Even though there is considerable work on the wider research area of squared-envelope receivers, a comprehensive comparison and statistical characterization of training-assisted channel estimators for squared-envelope receivers appear to be absent from the literature. A detailed description of practical channel estimation schemes is necessary for the optimal training design of latency-constrained IoT applications. In this paper, various channel estimators are derived, their bias and variance are studied, and their performance is numerically compared against the Cramer-Rao lower bound.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123816352","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445884
Zahmeeth Sakkaff, Aditya Immaneni, M. Pierobon
The development of reliable abstractions, models, and characterizations of biochemical communication channels that propagate information from/to biological cells is one of the first challenges for the engineering of systems able to pervasively interface, control, and communicate through these channels, i.e., the Internet of Bio-N ano Things. Signal transduction pathways in eukaryotic cells are important examples of these channels, especially since their performance is directly linked to organisms' health, such as in cancer. In this paper, a novel computational approach is proposed to characterize the communication performance of signal transduction pathways based on chemical stochastic simulation tools, and the estimation of information-theoretic parameters from sample distributions. Differently from previous literature, this approach does not have constraints on the size of the data, accounts for the information contained in the dynamic pathway evolution, and estimates not only the end-to-end information propagation, but also the information through each component of the pathway. Numerical examples are provided as a case study focused on the popular JAK-STAT pathway, linked to immunodeficiency and cancer.
{"title":"Estimating the Molecular Information Through Cell Signal Transduction Pathways","authors":"Zahmeeth Sakkaff, Aditya Immaneni, M. Pierobon","doi":"10.1109/SPAWC.2018.8445884","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445884","url":null,"abstract":"The development of reliable abstractions, models, and characterizations of biochemical communication channels that propagate information from/to biological cells is one of the first challenges for the engineering of systems able to pervasively interface, control, and communicate through these channels, i.e., the Internet of Bio-N ano Things. Signal transduction pathways in eukaryotic cells are important examples of these channels, especially since their performance is directly linked to organisms' health, such as in cancer. In this paper, a novel computational approach is proposed to characterize the communication performance of signal transduction pathways based on chemical stochastic simulation tools, and the estimation of information-theoretic parameters from sample distributions. Differently from previous literature, this approach does not have constraints on the size of the data, accounts for the information contained in the dynamic pathway evolution, and estimates not only the end-to-end information propagation, but also the information through each component of the pathway. Numerical examples are provided as a case study focused on the popular JAK-STAT pathway, linked to immunodeficiency and cancer.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124296862","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445879
J. Akhtar, K. Rajawat
This paper considers a zero-forcing (ZF) downlink transmission in a multiuser massive-MIMO system under large-scale fading. While the base station has many antennas, the associated circuit costs require some antennas to be turned off. Further, the users have quality of service (QoS) constraints and cannot be served with arbitrarily low signal-to-interference-plus-noise ratios. Instead, the base stations seeks to schedule only a subset of users for which the QoS constraints can be met, while the remaining users must be scheduled in other time-frequency slots. A joint antenna selection, power allocation, and user selection problem is formulated. Different from the existing approaches that either rely on greedy schemes or other heuristics, an efficient algorithm is proposed that yields the globally optimum solution to the problem. Finally, the simulation results are presented to corroborate the efficacy of the proposed schemes.
{"title":"QOS-Based Antenna and User Selection in Large-Scale Fading for Massive-MIMO Systems","authors":"J. Akhtar, K. Rajawat","doi":"10.1109/SPAWC.2018.8445879","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445879","url":null,"abstract":"This paper considers a zero-forcing (ZF) downlink transmission in a multiuser massive-MIMO system under large-scale fading. While the base station has many antennas, the associated circuit costs require some antennas to be turned off. Further, the users have quality of service (QoS) constraints and cannot be served with arbitrarily low signal-to-interference-plus-noise ratios. Instead, the base stations seeks to schedule only a subset of users for which the QoS constraints can be met, while the remaining users must be scheduled in other time-frequency slots. A joint antenna selection, power allocation, and user selection problem is formulated. Different from the existing approaches that either rely on greedy schemes or other heuristics, an efficient algorithm is proposed that yields the globally optimum solution to the problem. Finally, the simulation results are presented to corroborate the efficacy of the proposed schemes.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"35 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124333286","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
扫码关注我们
求助内容：
应助结果提醒方式：