{"title":"Energy-efficient power control with finite discrete inputs under quality of service constraints","authors":"Gozde Ozcan, M. C. Gursoy","doi":"10.1109/CISS.2016.7460480","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460480","url":null,"abstract":"This paper presents an energy-efficient optimal power control policy with finite discrete inputs in the presence of statistical quality of service (QoS) limitations. In particular, an optimization problem is formulated to maximize the energy efficiency (EE) of the system, which is defined as the ratio of the effective capacity achieved with finite discrete inputs to the total power consumption. The circuit power consumption is explicitly considered in the total power expenditure. Subsequently, the optimal power control is derived using fractional programming. The resulting optimal power control strategy is further analyzed in two limiting cases, namely, the extremely stringent QoS constraints and looser QoS constraints. Through numerical results, the EE attained with the proposed optimal power control policy and constant power scheme is compared. Also, the effects of QoS constraints and signaling distribution on the maximum achievable EE are evaluated.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124883536","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}
Ananth V. Kini, Loïc Canonne-Velasquez, M. Hosseinian, M. Rudolf, Janet Stern-Berkowitz
{"title":"Wi-Fi-LAA coexistence: Design and evaluation of Listen Before Talk for LAA","authors":"Ananth V. Kini, Loïc Canonne-Velasquez, M. Hosseinian, M. Rudolf, Janet Stern-Berkowitz","doi":"10.1109/CISS.2016.7460494","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460494","url":null,"abstract":"With licensed spectrum at a premium, recent interest has shifted to investigating the possibility of utilizing unlicensed bands as a means of providing additional bandwidth. License assisted access (LAA) and Long Term Evolution-Unlicensed (LTE-U) are radio access technologies (RATs) aimed at providing carrier-grade wireless service in the 5 GHz unlicensed spectrum. Since Wi-Fi devices are widespread in the unlicensed space, it is important to ensure that any new technology deployed coexists fairly with Wi-Fi and other preexisting technologies that already occupy this space. At the heart of the Wi-Fi-LAA coexistence problem is the difference in channel access mechanisms for these two technologies; Wi-Fi is a contention based channel access scheme, while Long Term Evolution (LTE) is schedule-based. As a result, introducing an LTE system as is into the Wi-Fi space would likely result in LAA gradually taking over the channel and starving Wi-Fi of access. In this paper we focus on schemes to address this very issue. In particular, we will focus on various design aspects of Listen Before Talk (LBT) schemes for LAA that aim to emulate the contention based scheme in Wi-Fi as a means of providing equal opportunity channel access for both of these technologies. We consider and evaluate the impact of various design aspects on fairness through several key performance metrics. Our simulation results demonstrate that LBT when applied to LTE can ensure good Wi-Fi-LAA coexistence.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124915682","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}
{"title":"Spectral bounds for independent cascade model with sensitive edges","authors":"E. Lee, Sudeep Kamath, E. Abbe, S. Kulkarni","doi":"10.1109/CISS.2016.7460579","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460579","url":null,"abstract":"This paper studies independent cascade models where influence propagates from seed-nodes along edges with independent probabilities. Upper-bounds for the expected number of influenced nodes were previously proposed using the spectral norm of a Hazard matrix. However, these bounds turn out loose in many cases, in particular with respect to sensitive edges such as bottlenecks, seed adjacent, and high probability edges. This paper proposes a similar bound that improves in such cases by handling sensitives edges more carefully.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134357961","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}
{"title":"Statistical analysis of measured ground penetrating radar data","authors":"A. M. Rangaswamy, L. Monte, M. Wicks","doi":"10.1109/CISS.2016.7460478","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460478","url":null,"abstract":"This paper provides a statistical analysis of measured data from ground penetrating radar experiments at the MUMMA Laboratory, University of Dayton. A variety of statistical and spectral techniques are used to characterize the underlying statistical properties of the background data from three different experimental campaigns.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134561356","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}
{"title":"Effect of fading on maximum sum rate of Aloha","authors":"Yitong Li, L. Dai","doi":"10.1109/CISS.2016.7460542","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460542","url":null,"abstract":"In the literature, the network throughput of slotted Aloha with the capture model over fading channels has been found to be higher than e-1, the maximum network throughput of slotted Aloha with the collision model over ideal channel conditions. Such an improvement is often misinterpreted as the result of channel fading, which as we will demonstrate in this paper, indeed comes from the receiver. Specifically, based on the analytical framework proposed in our recent work [15], the optimal network throughput and sum rate performance of slotted Aloha with the capture model over Additive-White-Gaussian-Noise (AWGN) channels is characterized. Explicit expressions of the maximum network throughput and the maximum sum rate are obtained, and the comparison to Rayleigh fading channels shows that substantial gains in both the maximum network throughput and the maximum sum rate are observed in the AWGN case.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128548812","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}
S. Kokalj-Filipovic, J. Goodman, C. Acosta, G. Stantchev
{"title":"I/O HSMM: Learning behavioral dynamics of a cognitive wireless network node from spectrum sensing","authors":"S. Kokalj-Filipovic, J. Goodman, C. Acosta, G. Stantchev","doi":"10.1109/CISS.2016.7460548","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460548","url":null,"abstract":"We introduce a generative model, dubbed I/O HSMM, for learning the bi-modal behavioral dynamics of a network of cognitive radios (CRs). Each of the two modes of the CRs is represented as a Hidden Semi-Markov model (HSMM), where the states, state durations and emissions, transition probabilities between states, and transitions between modes are uncovered based solely on RF spectrum sensing. The learning of the CR dynamics is non-parametric and derived from the Hierarchical Dirichlet Process (HDP), with the switching between the two modes modeled as a latent variable that is estimated as a part of the learning process. The non-parametric model provides flexibility in handling unknown communication protocols. We evaluate the quality of learning against ground truth, and demonstrate that this approach is promising and merits extension to more complex models.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127708380","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}
{"title":"Incentive mechanisms for privacy-sensitive electricity consumers with alternative energy sources","authors":"Chong Huang, L. Sankar","doi":"10.1109/CISS.2016.7460497","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460497","url":null,"abstract":"Access to alternative energy sources provides consumers with a way to not only be energy efficient but also restrict the amount of information potentially shared with electricity providers via smart meters. On the other hand, electricity providers require certain amount of energy to be consumed directly from the grid in order to perform load forecasting and maintain stable and reliable operation. Therefore, the electricity provider may need to offer incentives to encourage consumers to consume a desired level of energy directly from the grid. Each consumer faces a trade-off between masking consumption from the electric power grid for privacy reasons and revealing consumption patterns to the electricity provider for energy cost reduction. In this paper, we present a game theoretic approach to design price-based incentives for consumers that balance their privacy concerns against the electricity provider's needs. Under certain conditions, we show the existence and uniqueness of the nondegenerate mixed strategy Nash equilibrium and study the relationship between incentive prices from the electricity provider and responses from privacy-sensitive consumers. Simulation results indicate that the proposed mechanism can benefit both electricity providers and consumers.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"11 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127973837","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}
{"title":"Symbol Alphabet Modifier for PAPR reduction in OFDM communications","authors":"Yuewen Wang, A. Akansu","doi":"10.1109/CISS.2016.7460524","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460524","url":null,"abstract":"High Peak-to-Average Power Ratio (PAPR) is a major drawback of Orthogonal Frequency Division Multiplexing (OFDM) based communications systems. Many methods for PAPR reduction have been reported in the literature. They include popularly used Selective Mapping (SLM) and Partial Transmit Sequences (PTS) techniques. Although these two methods reduce PAPR quite well, their implementation cost is relatively high. In this paper, Symbol Alphabet Modifier Matrix (SAM) is proposed to jointly alter the phase and amplitude values of the original symbols in the alphabet. This framework utilizes only one FFT/IFFT operation pair for transmultiplexing of symbols without any side information. The merit of the proposed method to reduce PAPR for four cases without BER degradation along with its implementation simplicity is shown in the paper.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128451640","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}
{"title":"Differential privacy in networked data collection","authors":"O. Javidbakht, P. Venkitasubramaniam","doi":"10.1109/CISS.2016.7460487","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460487","url":null,"abstract":"The problem of destination privacy in networked data collection is investigated under constraints on routing overhead. Using differential privacy as a metric to quantify the privacy of the intended destination, optimal probabilistic routing schemes are investigated under unicast and multicast paradigms. When the overhead is weighted equally to the incurred routing cost to intended destination, it is shown that the optimal solution for unicast private routing is identical to a traveling sales man solution. When the overhead weight is strictly different to the intended routing cost, the optimal solution is expressed as a solution to a linear programming problem. It is shown that the optimal solution can be implemented in decentralized manner. Under a multicast paradigm, the optimal solution when overhead is weighted equal to the intended cost, the optimal solution is shown to be a variant of the Steiner tree problem. In general, it is proved that multicast private routing is an np-complete problem. Simulations and numerical results for both private unicast and multicast routing on random graphs are presented.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"101 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134506159","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}
{"title":"Vector Gaussian multi-decoder rate-distortion: Trace constraints","authors":"Sinem Unal, A. Wagner","doi":"10.1109/CISS.2016.7460485","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460485","url":null,"abstract":"The problem of a lossy compression of a vector Gaussian source with correlated side information at decoders is considered. We characterize the rate-distortion function when the decoders' reconstructions are subject to small trace error covariance distortion constraints.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121476796","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}