2014 48th Annual Conference on Information Sciences and Systems (CISS)最新文献

筛选
英文 中文
Optimal partial decode-and-forward rates for stochastically degraded Gaussian relay channels 随机退化高斯中继信道的最优部分译码转发速率
2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI: 10.1109/CISS.2014.6814147
Lennart Gerdes, L. Weiland, Maximilian Riemensberger, W. Utschick
{"title":"Optimal partial decode-and-forward rates for stochastically degraded Gaussian relay channels","authors":"Lennart Gerdes, L. Weiland, Maximilian Riemensberger, W. Utschick","doi":"10.1109/CISS.2014.6814147","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814147","url":null,"abstract":"For the Gaussian MIMO relay channel, we consider rates that can be achieved with the relay using the partial decode-and-forward (PDF) scheme, which is a generalization of the decode-and-forward (DF) scheme. Since for the general case the optimal channel input distribution for the PDF strategy is unknown, the maximum PDF rate for the Gaussian relay channel can only be determined if the best PDF strategy is equivalent to the DF strategy, point-to-point (P2P) transmission from source to destination, or if PDF achieves the cut-set bound (CSB), where Gaussian channel inputs are known to be optimal. In this paper, we identify and discuss two new such special cases, the stochastically degraded and the reversely stochastically degraded Gaussian relay channel.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126065528","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}
引用次数: 7
Wireless backhaul node placement for small cell networks 小型蜂窝网络的无线回程节点布置
2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI: 10.1109/CISS.2014.6814156
M. Islam, A. Sampath, A. Maharshi, O. Koymen, N. Mandayam
{"title":"Wireless backhaul node placement for small cell networks","authors":"M. Islam, A. Sampath, A. Maharshi, O. Koymen, N. Mandayam","doi":"10.1109/CISS.2014.6814156","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814156","url":null,"abstract":"Small cells have been proposed as a vehicle for wireless networks to keep up with surging demand. Small cells come with a significant challenge of providing backhaul to transport data to(from) a gateway node in the core network. Fiber based backhaul offers the high rates needed to meet this requirement, but is costly and time-consuming to deploy, when not readily available. Wireless backhaul is an attractive option for small cells as it provides a less expensive and easy-to-deploy alternative to fiber. However, there are multitude of bands and features (e.g. LOS/NLOS, spatial multiplexing etc.) associated with wireless backhaul that need to be used intelligently for small cells. Candidate bands include: sub-6 GHz band that is useful in non-line-of-sight (NLOS) scenarios, microwave band (6-42 GHz) that is useful in point-to-point line-of-sight (LOS) scenarios, and millimeter wave bands (e.g. 60, 70 and 80 GHz) that are recently being commercially used in LOS scenarios. In many deployment topologies, it is advantageous to use aggregator nodes, located at the roof tops of tall buildings near small cells. These nodes can provide high data rate to multiple small cells in NLOS paths, sustain the same data rate to gateway nodes using LOS paths and take advantage of all available bands. This work performs the joint cost optimal aggregator node placement, power allocation, channel scheduling and routing to optimize the wireless backhaul network. We formulate mixed integer nonlinear programs (MINLP) to capture the different interference and multiplexing patterns at sub-6 GHz and microwave band. We solve the MINLP through linear relaxation and branch-and-bound algorithm and apply our algorithm in an example wireless backhaul network of downtown Manhattan.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123786075","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}
引用次数: 56
Decision making in forward power markets with supply and demand uncertainty 具有供需不确定性的远期电力市场决策
2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI: 10.1109/CISS.2014.6814131
F. Paganini, P. Belzarena, P. Monzón
{"title":"Decision making in forward power markets with supply and demand uncertainty","authors":"F. Paganini, P. Belzarena, P. Monzón","doi":"10.1109/CISS.2014.6814131","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814131","url":null,"abstract":"The paper studies forward markets of electric energy, where generators and consumers bid for quantities of energy ahead of time, but face uncertainty on their real-time supply or demand, expressed through a probability distribution. The optimal forward decision is derived in both cases, providing extensions to the recent literature on this topic. In particular, the case where demand is elastic in addition to uncertain is addressed in detail. Finally, we analyze the integrated forward market where buyers and sellers of random energy interact with dispatchable sellers to determine a clearing price.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115943597","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}
引用次数: 9
Low complexity scheduling algorithms for wireless networks with full duplex state exchange 全双工状态交换无线网络的低复杂度调度算法
2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI: 10.1109/CISS.2014.6814178
Weihe Wang, V. Subramanian, Dongning Guo
{"title":"Low complexity scheduling algorithms for wireless networks with full duplex state exchange","authors":"Weihe Wang, V. Subramanian, Dongning Guo","doi":"10.1109/CISS.2014.6814178","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814178","url":null,"abstract":"In a peer-to-peer wireless network, efficient distributed scheduling algorithms generally require all active nodes to acquire the state information of their respective neighbors, e.g., their queue lengths. However, information exchange between nodes is challenging in the absence of a collision-free schedule, mainly due to the half duplex design of today's radios. This paper studies medium access control (MAC) with the help of a physical layer technique that allows all nodes to efficiently exchange state messages with one-hop neighbors at the same time. Low-complexity distributed scheduling algorithms using simultaneous message exchange are proposed for two interference models. One of the algorithms is shown to produce schedules realizable by the greedy maximal scheduling algorithm under the node-exclusive interference model. Simulations demonstrate that both algorithms outperform some popular distributed random access schemes.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122388389","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}
引用次数: 1
Congestion-free routing reconfiguration: Formulation and examples 无拥塞路由重构:公式和示例
2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI: 10.1109/CISS.2014.6814142
Chiunlin Lim, N. Wu, A. Tang
{"title":"Congestion-free routing reconfiguration: Formulation and examples","authors":"Chiunlin Lim, N. Wu, A. Tang","doi":"10.1109/CISS.2014.6814142","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814142","url":null,"abstract":"We consider the network-layer problem of avoiding congestion while reconfiguring the routing paths. We formulate a flow-based and a switch-based model. For the flow-based model, we demonstrate that an optimal sequence of minimum update steps could always be found when the dependency graph is acyclic. For the switch-based model, we find a way to translate a feasible flow-based sequence to a feasible switch-based sequence subject to a tree topology constraint on the routing paths.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122520265","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}
引用次数: 3
SCHEME: Stochastically convergent heuristical Expectation Maximization estimation 方案:随机收敛启发式期望最大化估计
2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI: 10.1109/CISS.2014.6814110
M. A. Tope, Joel M. Morris
{"title":"SCHEME: Stochastically convergent heuristical Expectation Maximization estimation","authors":"M. A. Tope, Joel M. Morris","doi":"10.1109/CISS.2014.6814110","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814110","url":null,"abstract":"This paper introduces a modification to the EM (Expectation Maximization) algorithm potentially allowing reliable convergence to the ML (Maximum Likelihood) parameter estimate for a set of previously intractable problems. The modification is based on the MCEM (Monte Carlo EM) algorithm, which substitutes sample averages for the explicit calculation of expectation. A problem with previous algorithms is that the number of samples required for convergence and the generally convergence behavior was uncertain. Using information geometric principles, we arrive at a new formulation that ensures convergence with probability one. Further, we begin an investigation attempting to minimize the number of samples required to obtain an acceptable approximation of the ML estimate. This algorithm is well suited to solve numerous challenging statistical problems.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116501052","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}
引用次数: 0
Controllability and observability grammians for balancing linear singularly perturbed systems 平衡线性奇摄动系统的可控性和可观察性文法
2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI: 10.1109/CISS.2014.6814190
Kliti Kodra, M. Skataric, Z. Gajic
{"title":"Controllability and observability grammians for balancing linear singularly perturbed systems","authors":"Kliti Kodra, M. Skataric, Z. Gajic","doi":"10.1109/CISS.2014.6814190","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814190","url":null,"abstract":"In this article we present a method to obtain an improved balancing transformation for linear singularly perturbed (SP) systems. First, an algorithm which utilizes the Chang transformation is introduced. The algorithm is used to obtain the exact controllability and observability Grammians (identical under balanced coordinates) of a linear system. The exact Grammians obtained in terms of reduced order Lyapunov/Sylvester equations corresponding to slow and fast subsystems are then used to construct the improved balanced realization of the SP system. A case study is provided at the end of the article to demonstrate the difference between the algorithm present in current literature and the method we develop.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126704018","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}
引用次数: 0
Design and performance of noncoherent massive SIMO systems 非相干大规模SIMO系统的设计与性能
2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI: 10.1109/CISS.2014.6814078
Mainak Chowdhury, Alexandros Manolakos, A. Goldsmith
{"title":"Design and performance of noncoherent massive SIMO systems","authors":"Mainak Chowdhury, Alexandros Manolakos, A. Goldsmith","doi":"10.1109/CISS.2014.6814078","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814078","url":null,"abstract":"A system with a single antenna transmitter and a large number of antennas at the receiver is considered. For this system we propose a simple noncoherent communication scheme based on energy detection that does not require knowledge of instantaneous channel state information at either the transmitter or the receiver. We also propose a constellation design based on the minimum distance criterion for this system and present numerical results to demonstrate the performance of this scheme for representative fading and noise statistics. Moreover, we show that this constellation design has the same scaling law performance as a system with perfect channel knowledge at the receiver.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127971954","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}
引用次数: 44
Required number of small-cells in heterogenous networks with non-uniform traffic distribution 流量分布不均匀的异构网络中所需的小蜂窝数
2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI: 10.1109/CISS.2014.6814184
S. Banani, A. Eckford, R. Adve
{"title":"Required number of small-cells in heterogenous networks with non-uniform traffic distribution","authors":"S. Banani, A. Eckford, R. Adve","doi":"10.1109/CISS.2014.6814184","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814184","url":null,"abstract":"The operation of a primary macrocell (MC) network can be efficiently supported by secondary small cells (SCs) deployed in traffic hotspots and/or outage areas of the MCs. In this paper we consider a downlink heterogeneous network with frequency reuse-1 hexagonal MCs and non-uniform traffic density distribution. Assuming isolated SCs, we provide an analytical formulation for the average number of SCs (per MC) required to cover the hotspots areas and overcome outages within a MC (due to path loss and shadowing). The analytical framework is validated via simulations, confirming the agreement between the analytical results and the simulations. The expressions developed are useful as a tool to guide network design and subsequent deployment.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128757039","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}
引用次数: 2
Linear minimum mean-square error estimation based on high-dimensional data with missing values 基于缺失值高维数据的线性最小均方误差估计
2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI: 10.1109/CISS.2014.6814083
Mahdi Zamanighomi, Zhengdao Wang, K. Slavakis, G. Giannakis
{"title":"Linear minimum mean-square error estimation based on high-dimensional data with missing values","authors":"Mahdi Zamanighomi, Zhengdao Wang, K. Slavakis, G. Giannakis","doi":"10.1109/CISS.2014.6814083","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814083","url":null,"abstract":"In linear minimum mean-square error (LMMSE) estimation problems, the observation data may have missing entries. Processing such data vectors may have high complexity if the observation data vector has high-dimensionality and the LMMSE estimator must be re-derived whenever there are missing values. In this context, a means of reducing the computational complexity is introduced when the number of missing entries is relatively small. All first- and second-order data statistics are assumed known, and the positions of the missing values are also known. The proposed method works by first applying the LMMSE estimator on the data vector with missing values replaced by zeros, and then applying a low-complexity update that depends on the positions of the missing. The method achieves exact LMMSE based on only observed data with lower complexity compared to the direct implementation of a time-varying LMMSE filter based on the incomplete data. We also show that if LMMSE imputation is used to fill the missing entires first based on the non-missing entries, and then a complete-data LMMSE filter is applied to the completed data vector, then the same linear MMSE is also achieved, but with higher complexity.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"10 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133070916","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}
引用次数: 8
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信