{"title":"User association with lighting constraints in visible light communication systems","authors":"Cong Shen, Shun Lou, Chen Gong, Zhengyuan Xu","doi":"10.1109/CISS.2016.7460505","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460505","url":null,"abstract":"The user association problem for light emitting diode (LED)-based visible light communication (VLC) systems is investigated in this paper. Unlike its counterpart in other RF communication systems, the LED-based VLC system has unique lighting constraints which have to be satisfied when making user association decisions. This work establishes a utility maximization framework for VLC user association with lighting constraints. The optimization problem is shown to be non-convex mixed integer, and hence is very difficult to solve. Two sub-optimal solutions are proposed and their performance is analyzed, one based on a greedy heuristic and the other based on a convex relaxation. Simulation results are provided to demonstrate the effectiveness of the solutions.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"31 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":"127675598","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":"Cyclic stochastic optimization via arbitrary selection procedures for updating parameters","authors":"Karla Hernandez","doi":"10.1109/CISS.2016.7460527","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460527","url":null,"abstract":"Many of the algorithms that exist to tackle optimization problems (either stochastic or deterministic) are iterative in nature. Methods where only a subset of the parameter vector is updated each time have been frequently used in practice. While some of these methods update different sets of parameters according to some predetermined pattern, others select the parameters to update according to a random variable. Much work exists on the convergence of such procedures in the case of deterministic optimization. However, very little is known about their convergence when applied to general stochastic optimization problems; this is the setting this work focuses on. We describe the generalized cyclic seesaw algorithm-a general method for selecting which parameters to update during each iteration-and give sufficient conditions for its convergence.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"80 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":"115805933","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":"A generalized Nash equilibrium model of a resource stockpile with independent market response dynamics","authors":"J. Lloyd, G. Meyer","doi":"10.1109/CISS.2016.7460577","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460577","url":null,"abstract":"Closely related to inventory control problems and Nash-Cournot games, research into the optimal build-up and depletion of strategic resource stockpiles is of critical interest to governments and private industry. Enhancing previously reported SISO models of strategic resource stockpiles, this paper reports three innovations in game theoretic optimal stockpile modeling that differentiate it from previous publications: the combination of a stockpile model in parallel with an independent, open market inventory model, the addition of a producer's extraction cost, and the consideration of initial stockpile build-up costs. The following sections introduce this new model, offer a solution existence proof, and present example solutions and comparative numerical analyses.","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":"126382017","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}
M. Giordani, M. Mezzavilla, Nicolas Barati, S. Rangan, M. Zorzi
{"title":"Comparative analysis of initial access techniques in 5G mmWave cellular networks","authors":"M. Giordani, M. Mezzavilla, Nicolas Barati, S. Rangan, M. Zorzi","doi":"10.1109/CISS.2016.7460513","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460513","url":null,"abstract":"The millimeter wave frequencies (roughly above 10 GHz) offer the availability of massive bandwidth to greatly increase the capacity of fifth generation (5G) cellular wireless systems. However, to overcome the high isotropic pathloss at these frequencies, highly directional transmissions will be required at both the base station (BS) and the mobile user equipment (UE) to establish sufficient link budget in wide area networks. This reliance on directionality has important implications for control layer procedures. Initial access in particular can be significantly delayed due to the need for the BS and the UE to find the initial directions of transmission. This paper provides a survey of several recently proposed techniques. Detection probability and delay analysis is performed to compare various techniques including exhaustive and iterative search. We show that the optimal strategy depends on the target SNR regime.","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":"132121125","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":"Hard decision based distributed detection in multi-sensor system over noise correlated sensing channels","authors":"Hadi Kasasbeh, Lei Cao, R. Viswanathan","doi":"10.1109/CISS.2016.7460515","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460515","url":null,"abstract":"In spite of the spectrum sensing importance, small part of the literature deals with the case of dependency between sensors' observations. In this paper, Bayes criterion for minimizing the probability of error (Pe) is used to find the distributed decision rule at each sensor in a binary hypothesis multi-sensor system, while considering the correlation over the sensing channels. This paper proposes a new, simple, yet efficient algorithm to find the local decision rules to achieve the objective of minimizing the Pe. Upon receiving the signal, each sensor sends a local hard decision to the fusion center (FC). The FC then generates a global decision using the K-out-of-N majority rule. The derived problem formulation and the proposed algorithm can be used with any joint probability density functions and with any odd number of sensors. The proposed framework also accounts for the path attenuation effect on the global decision. The results show the effectiveness and validity of the proposed framework in practical sensor systems.","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":"131455082","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":"Caching Gaussians: Minimizing total correlation on the Gray-Wyner network","authors":"G. Veld, M. Gastpar","doi":"10.1109/CISS.2016.7460549","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460549","url":null,"abstract":"We study a caching problem that resembles a lossy Gray-Wyner network: A source produces vector samples from a Gaussian distribution, but the user is interested in the samples of only one component. The encoder first sends a cache message without any knowledge of the user's preference. Upon learning her request, a second message is provided in the update phase so as to attain the desired fidelity on that component. The cache is efficient if it exploits as much of the correlation in the source as possible, which connects to the notions of Wyner's common information (for high cache rates) and Watanabe's total correlation (for low cache rates). For the former, we extend known results for 2 Gaussians to multivariates by showing that common information is a simple linear program, which can be solved analytically for circulant correlation matrices. Total correlation in a Gaussian setting is less well-studied. We show that for bivariates and using Gaussian auxiliaries it is captured in the dominant eigenvalue of the correlation matrix. For multivariates the problem is a more difficult optimization over a non-convex domain, but we conjecture that circulant matrices may again be analytically solvable.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"266 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133357091","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}
R. Naous, Mohammed Affan Zidan, A. Sultan, K. Salama
{"title":"Channel equalization techniques for non-volatile memristor memories","authors":"R. Naous, Mohammed Affan Zidan, A. Sultan, K. Salama","doi":"10.1109/CISS.2016.7460486","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460486","url":null,"abstract":"Channel coding and information theoretic approaches have been utilized in conventional non-volatile memories to overcome their inherent design limitations of leakage, coupling and refresh rates. However, the continuous scaling and integration constraints set on the current devices directed the attention towards emerging memory technologies as suitable alternatives. Memristive devices are prominent candidates to replace the conventional electronics due to its non-volatility and small feature size. Nonetheless, memristor-based memories still encounter an accuracy limitation throughout the read operation addressed as the sneak path phenomenon. The readout data is corrupted with added distortion that increases significantly the bit error rate and jeopardizes the reliability of the read operation. A novel technique is applied to alleviate this distorting effect where the communication channel model is proposed for the memory array. Noise cancellation principles are applied with the aid of preset pilots to extract channel information and adjust the readout values accordingly. The proposed technique has the virtue of high speed, energy efficiency, and low complexity design while achieving high reliability and error-free decoding.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"71 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":"130753366","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":"Load statistics and required spectrum in multi-tier heterogeneous networks","authors":"Sanam Sadr, R. Adve","doi":"10.1109/CISS.2016.7460521","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460521","url":null,"abstract":"We obtain the minimum bandwidth required to meet an outage constraint in a multi-tier heterogeneous network assuming “maximum (biased) average received signal power” as the tier association metric. To do so, we model user and access point (AP) locations as Poisson point processes, and obtain the moment generating function (MGF) of the required spectrum; this analysis, in turn, is based on the cumulative distribution function of the bandwidth required by a typical user. Using this user load and the distribution of the coverage area of a typical AP, we derive the MGF of the AP load. We consider path loss attenuation and Rayleigh fading on both the desired and interfering signals; however, the expression for the AP load can be generalized to include arbitrarily distributed fading. An application of the results is to relate the AP outage rate and the tiers' allocated bandwidths.","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":"131122128","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":"State estimation for flag Hidden Markov Models with imperfect sensors","authors":"Kyle Doty, Sandip Roy, T. Fischer","doi":"10.1109/CISS.2016.7460529","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460529","url":null,"abstract":"State detection is studied for a special class of flag Hidden Markov Models (HMMs), which comprise 1) an arbitrary finite-state underlying Markov chain and 2) a structured observation process wherein a subset of states emit distinct flags with some probability while other states are unmeasured. The focus of this article is to develop an explicit computation of the probability of error for the maximum-likelihood filter, specifically for the case that the sensors are imperfect. The algebraic result is leveraged to address sensor placement in a couple of examples, including one on activity-monitoring in a home environment that is drawn from field data.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"38 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":"115142936","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":"Migration to a non-neutral internet: Economics modeling and analysis of impact","authors":"M. Lotfi, S. Sarkar, G. Kesidis","doi":"10.1109/CISS.2016.7460555","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460555","url":null,"abstract":"Net neutrality on the Internet is perceived as the policy that mandates Internet Service Providers (ISPs) to treat all data equally, regardless of the source, destination, and type of the data. In this work, we consider a scheme in which there exist two ISPs, one Content Provider (CP), and a continuum of end-users. One of the ISPs are neutral and the other is non-neutral, i.e. she offers a premium quality to a CP in exchange of a side-payment. In addition, we consider that the CP can differentiate between ISPs by controlling the quality of the content she is offering on each one. We consider a near-perfect competition between ISPs, i.e. a scenario that none of the ISPs has high market power, and formulate the game as a sequential game. We show that there exist a unique SPNE for the game. In the unique SPNE outcome of the game, the CP pays the side-payment to the non-neutral ISP and offers her content with the premium quality. On the other hand, the CP does not offer her content on the neutral ISP. Thus, the neutral ISP would be driven out of the market. We show that in this case, a neutral regime yields a higher end-user welfare than a non-neutral regime.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"16 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":"120946296","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}