Raghed El-Bardan, W. Saad, Swastik Brahma, P. Varshney
{"title":"Matching theory for cognitive spectrum allocation in wireless networks","authors":"Raghed El-Bardan, W. Saad, Swastik Brahma, P. Varshney","doi":"10.1109/CISS.2016.7460547","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460547","url":null,"abstract":"In this paper, a novel spectrum allocation approach for cognitive radio networks (CRNs) is proposed. Based on a measure of inference performance as well as on a measure of quality-of-service, the association between secondary users (SUs) in the network and frequency bands licensed to primary users (PUs) is investigated. The problem is formulated as a matching game between SUs and PUs. In this game, SUs employ hypothesis testing to detect PUs' signals and, eventually, rank them based on the logarithm of the a posteriori probability ratio. A valuation that captures the ranking metric and rate over the PU-owned frequency bands is proposed to PUs in the form of credit or rewards by SUs. Using this proposal, a PU evaluates a utility function that it uses to build its association preferences. A distributed algorithm that allows both SUs and PUs to interact and self-organize into a stable and optimal matching is presented. Simulation results show that the proposed algorithm can improve: i) the sum of SUs' rates by up to 20% and 60% relative to the deferred acceptance algorithm and random channel allocation approach respectively, and ii) the sum of PUs' payoffs by up to 25% compared to the deferred acceptance algorithm. The results also show an improved convergence time.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"35 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":"122497293","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":"Quality of Service timeseries forecasting for Web Services: A machine learning, Genetic Programming-based approach","authors":"Yang Syu, Yong-Yi Fanjiang, J. Kuo, Jui-Lung Su","doi":"10.1109/CISS.2016.7460526","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460526","url":null,"abstract":"Today, many software systems and applications are consisted of various services on the Web (Cloud). When selecting services or performing a service operation, a critical criterion is Quality of Service (QoS). Because the actual value of some dynamic QoS attributes could vary with time, there must be an approach that can accurately forecast future QoS value. In this paper, we propose to use a machine learning technique, i.e., Genetic Programming (GP), for the problem. When performing QoS forecasting, the proposed approach employs GP to evolve out a predictor, and then uses it to obtain future QoS forecasts. To test and understand the forecasting performance (accuracy) of the proposed approach, in our experiments with a real-world QoS dataset, we compare our approach with other existing QoS forecasting methods, and then prove and discuss its outperformance.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"40 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":"122920043","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":"Adaptive decision fusion using genetic algorithm","authors":"Ji Wang, Sayandeep Acharya, Moshe Kam","doi":"10.1109/CISS.2016.7460536","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460536","url":null,"abstract":"We consider a parallel distributed decision fusion system consisting of a bank of local sensors and a fusion center. Each local sensor makes binary decisions based on its own observations. The decision is to accept one of the hypotheses, H0 or H1. Each local sensor transmits its decisions to the fusion center over an error free channel. The fusion center combines all the local decisions to obtain a global decision. For observations that are statistically independent conditioned on the hypothesis and fixed local decisions, the Chair-Varshney fusion rule minimizes the global Bayesian risk. However, this fusion rule requires knowledge of local sensor performance parameters and the prior probabilities of the hypothesis set. In most applications, these are unavailable. Moreover, local sensor performance may be time varying. Several studies attempted on-line estimation of the unknown local performance metrics and prior probabilities. We develop a fusion rule that applies a genetic algorithm to fuse the local sensors' binary decisions. The rule adapts to time varying local sensor error characteristics and provides near-optimal performance at the expense of a larger number of observations and higher computational overhead.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"594 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":"122938068","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":"Efficient implementation of enhanced adaptive simultaneous perturbation algorithms","authors":"Pushpendre Rastogi, Jingyi Zhu, J. Spall","doi":"10.1109/CISS.2016.7460518","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460518","url":null,"abstract":"Stochastic approximation (SA) applies in both the gradient-free optimization (Kiefer-Wolfowitz) and the gradient-based setting (Robbins-Monro). The idea of simultaneous perturbation (SP) has been well established. This paper discusses an efficient way of implementing both the adaptive Newton-like SP algorithms and their enhancements (feedback and optimal weighting incorporated), using the Woodbury matrix identity, a.k.a. matrix inversion lemma. Basically, instead of estimating the Hessian matrix directly, this paper deals with the estimation of the inverse of the Hessian matrix. Furthermore, the preconditioning steps, which are required in early iterations to maintain positive-definiteness of the Hessian estimates, are imposed on the Hessian inverse rather than the Hessian itself. Numerical results also demonstrate the superiority of this efficient implementation on Newton-like SP algorithms.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"64 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":"131446553","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":"Towards optimal PMU placement against data integrity attacks in smart grid","authors":"Qingyu Yang, Rui Min, Dou An, Wei Yu, Xinyu Yang","doi":"10.1109/CISS.2016.7460476","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460476","url":null,"abstract":"State estimation plays a critical role in self-detection and control of the smart grid. Data integrity attacks (also known as false data injection attacks) have shown significant potential in undermining the state estimation of power systems, and corresponding countermeasures have drawn increased scholarly interest. In this paper, we consider the existing least-effort attack model that computes the minimum number of sensors that must be compromised in order to manipulate a given number of states, and develop an effective greedy-based algorithm for optimal PMU placement to defend against data integrity attacks. We develop a greedy-based algorithm for optimal PMU placement, which can not only combat data integrity attacks, but also ensure the system observability with low overhead. The experimental data obtained based on IEEE standard systems demonstrates the effectiveness of the proposed defense scheme against data integrity attacks.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"32 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":"127720077","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":"Advanced persistent threats: Behind the scenes","authors":"M. Ussath, David Jaeger, Feng Cheng, C. Meinel","doi":"10.1109/CISS.2016.7460498","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460498","url":null,"abstract":"Advanced persistent threats (APTs) pose a significant risk to nearly every infrastructure. Due to the sophistication of these attacks, they are able to bypass existing security systems and largely infiltrate the target network. The prevention and detection of APT campaigns is also challenging, because of the fact that the attackers constantly change and evolve their advanced techniques and methods to stay undetected. In this paper we analyze 22 different APT reports and give an overview of the used techniques and methods. The analysis is focused on the three main phases of APT campaigns that allow to identify the relevant characteristics of such attacks. For each phase we describe the most commonly used techniques and methods. Through this analysis we could reveal different relevant characteristics of APT campaigns, for example that the usage of 0-day exploit is not common for APT attacks. Furthermore, the analysis shows that the dumping of credentials is a relevant step in the lateral movement phase for most APT campaigns. Based on the identified characteristics, we also propose concrete prevention and detection approaches that make it possible to identify crucial malicious activities that are performed during APT campaigns.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"6 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":"127454221","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":"Strong coordination over a line when actions are Markovian","authors":"B. Vellambi, J. Kliewer, M. Bloch","doi":"10.1109/CISS.2016.7460538","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460538","url":null,"abstract":"We analyze the problem of strong coordination over a multi-hop line network when the actions to be generated by the nodes satisfy a Markov chain that is matched to the network topology. We devise and prove the optimality of two schemes that cover the portions of the capacity region corresponding to unlimited or no common randomness shared by all nodes.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"37 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":"124341495","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":"Decentralized simultaneous energy and information transmission in multiple access channels","authors":"Selma Belhadj Amor, S. Perlaza","doi":"10.1109/CISS.2016.7460508","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460508","url":null,"abstract":"In this paper, the fundamental limits of decentralized simultaneous information and energy transmission in the two-user Gaussian multiple access channel (G-MAC) are fully characterized for the case in which a minimum energy transmission rate b is required for successful decoding. All the achievable and stable information-energy transmission rate tuples (R1, R2, B) are identified. R1 and R2 are in bits per channel use measured at the receiver and B is in energy units per channel use measured at an energy-harvester (EH). Stability is considered in the sense of an η-Nash equilibrium (NE), with η ≥ 0 arbitrarily small. The main result consists of the full characterization of the η-NE information-energy region, i.e., the set of information-energy rate triplets (R1, R2, B) that are achievable and stable in the G-MAC when: (a) both transmitters autonomously and independently tune their own transmit configurations seeking to maximize their own information transmission rates, R1 and R2 respectively; (b) both transmitters jointly guarantee an energy transmission rate B at the EH, such that B ≥ b. Therefore, any rate triplet outside the η-NE region is not stable as there always exists one transmitter able to increase by at least η bits per channel use its own information transmission rate by updating its own transmit configuration.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"160 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":"126913048","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}
Peijian Wang, Y. Zhang, Lei Deng, Minghua Chen, Xue Liu
{"title":"Second Chance works out better: Saving more for data center operator in open energy market","authors":"Peijian Wang, Y. Zhang, Lei Deng, Minghua Chen, Xue Liu","doi":"10.1109/CISS.2016.7460532","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460532","url":null,"abstract":"Geographical load balancing (GLB) is a promising technique to reduce power cost for cloud service providers (CSPs). To fully exploit the potential of GLB, Camacho et al. [1] advocate broker-assisted GLB where CSPs first bid in deregulated electricity markets and then balance their workloads accordingly. In this paper, we further explore along this line and propose the idea of Second Chance, which explores the design space in sequential bidding into sequential geographical markets. We formulate the optimal sequential bidding and GLB problem as a Markov Decision Process (MDP) problem. To solve this problem, however, faces the curse of dimensionality commonly encountered in MDP approach. To tackle this challenge, we first establish an optimality criterion for the problem and derive the structure of cost-to-go function. Then we analytically characterize the optimal action. Real-world trace-driven evaluation shows that the electricity cost can be reduced by more than 10% by jointly using GLB and Second Chance.","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":"121846012","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":"An operational measure of information leakage","authors":"Ibrahim Issa, Sudeep Kamath, A. Wagner","doi":"10.1109/CISS.2016.7460507","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460507","url":null,"abstract":"Given two discrete random variables X and Y, an operational approach is undertaken to quantify the “leakage” of information from X to Y. The resulting measure ℒ(X→Y ) is called maximal leakage, and is defined as the multiplicative increase, upon observing Y, of the probability of correctly guessing a randomized function of X, maximized over all such randomized functions. It is shown to be equal to the Sibson mutual information of order infinity, giving the latter operational significance. Its resulting properties are consistent with an axiomatic view of a leakage measure; for example, it satisfies the data processing inequality, it is asymmetric, and it is additive over independent pairs of random variables. Moreover, it is shown that the definition is robust in several respects: allowing for several guesses or requiring the guess to be only within a certain distance of the true function value does not change the resulting measure.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"13 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":"133114272","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}