2007 41st Annual Conference on Information Sciences and Systems最新文献

筛选
英文 中文
System-Level Performance of Cellular Multihop Relaying with Multiuser Scheduling 基于多用户调度的蜂窝多跳中继系统级性能研究
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298384
M. Charafeddine, O. Oyman, S. Sandhu
{"title":"System-Level Performance of Cellular Multihop Relaying with Multiuser Scheduling","authors":"M. Charafeddine, O. Oyman, S. Sandhu","doi":"10.1109/CISS.2007.4298384","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298384","url":null,"abstract":"Multihop relaying in cellular networks is seen as a viable strategy to address the need for higher data rates and better coverage. In this paper, we analyze the system-level performance of multicellular multihop networks in the presence of co-channel interference, and build upon prior work in the research conducted by O. Oyman, et. al (2006) which considered multihop relaying in a single-cell setting. Considering an opportunistic hop-count routing algorithm, we study cellular sum capacity under different multiuser scheduling algorithms such as MaxCap, proportional fair, and round robin. We numerically investigate the competing interaction between multihop diversity and multiuser diversity, and discuss the areal diversity aspect as a byproduct of multihop relaying. Finally, we provide further practical design insights on cellular planning through our empirical results on interference statistics in multicellular multihop networks.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133316518","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}
引用次数: 11
Algorithms for Relaying via Channel Quantization in Finite Rate Feedback Limited Sensor Networks 有限速率反馈有限传感器网络中信道量化中继算法
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298263
R. Kannan, Shuangqing Wei, Guohui Deng, V. Chakravarthy, M. Rangaswamy
{"title":"Algorithms for Relaying via Channel Quantization in Finite Rate Feedback Limited Sensor Networks","authors":"R. Kannan, Shuangqing Wei, Guohui Deng, V. Chakravarthy, M. Rangaswamy","doi":"10.1109/CISS.2007.4298263","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298263","url":null,"abstract":"Relaying is often advocated for improving system performance by enhancing spatial diversity in wireless networks. In this paper, we address the issue of energy tradeoff made by relay nodes between transmitting their own data and forwarding other nodes' information in fading channels. First, assuming perfect channel state information (CSI), we propose a power control policy in a two-node relay network under which total energy consumption across both nodes is minimized while meeting both outage probability requirements. However perfect CSI at each node is not possible in general due to bandwidth limitations that prevent the full exchange of precise channel information. Thus in this paper, we develop power control algorithms for relaying under bandwidth constraints, via quantization. Specifically, we develop a quantization protocol that accounts for the asymmetric nature of uplink/downlink communication bandwidths and develop an optimal polynomial time algorithm for channel quantization using this protocol. The quantization algorithm minimizes the sum of expected transmission powers at the source and relay, required for collaborative relaying to satisfy the given outage probability.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132089445","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
On Coding for the Broadcast Phase in the Two-Way Relay Channel 双向中继信道中广播相位的编码研究
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298312
C. Schnurr, T. Oechtering, S. Stańczak
{"title":"On Coding for the Broadcast Phase in the Two-Way Relay Channel","authors":"C. Schnurr, T. Oechtering, S. Stańczak","doi":"10.1109/CISS.2007.4298312","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298312","url":null,"abstract":"In this paper, we address the problem of designing practical codes for the broadcast phase in the two-way relay channel. The paper provides guidelines for the use of well-developed single-user codes in the bidirectional broadcast channel, with the goal of achieving or closely approaching the performance bounds. In case of finite alphabet channels with the channel distortion being independent of the channel input, the performance of our coding scheme only depends on the performance of the base codes on the corresponding single-user channels. If the involved single-user codes provides the best possible performance, so also does the proposed coding scheme for the bidirectional broadcast channel.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115737652","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}
引用次数: 29
Max-Min Strategies for Power-Limited Games in the Presence of Correlated Jamming 相关干扰下有限功率博弈的最大-最小策略
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298317
S. Farahmand, G. Giannakis, Xin Wang
{"title":"Max-Min Strategies for Power-Limited Games in the Presence of Correlated Jamming","authors":"S. Farahmand, G. Giannakis, Xin Wang","doi":"10.1109/CISS.2007.4298317","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298317","url":null,"abstract":"In tactical (or commercial) wireless communication systems, a jammer (or hacker) may be present to disrupt the link of legitimate users with an access point (AP). In this context, we introduce a game-theoretic max-min formulation for multiple access in the presence of the correlated jamming, replacing the mutual information game setup that has been studied so far. The novel formulation is well-suited for power-limited systems. Specifically, the AP strives to maximize the network's lifetime by minimizing sum-power while guaranteeing a minimum sum-rate for the users. We show that the AP's optimal strategy is a greedy one which allocates power to the strongest user, while the jammer's best response is to reduce the aggregate channel gain of the strongest user as much as possible. Hence, the multiuser game with a sum-rate constraint is equivalent to a single-user game where only the strongest user is present. Numerical results verify the correlated jammer's improved capability to inflict severe disruption in low data rate and low user channel gain settings. However, in a high data rate regime, generating white noise is the jammer's best strategy.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124349518","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}
引用次数: 15
Sequential Geometric Programming for 2 × 2 Interference Channel Power Control 2 × 2干扰信道功率控制的顺序几何规划
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298297
M. Charafeddine, A. Paulraj
{"title":"Sequential Geometric Programming for 2 × 2 Interference Channel Power Control","authors":"M. Charafeddine, A. Paulraj","doi":"10.1109/CISS.2007.4298297","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298297","url":null,"abstract":"We analyze the performance of sequential geometric programming (SGP) in solving the nonconvex power control problem of maximizing the sum capacity of the interference channel with no multiuser decoding. We focus on the 2x2 interference channel, for which we know the optimal power allocation tuples. We validate the SGP approaches of single and double condensation methods and we analyze the accuracy and convergence performance of each.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114340653","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}
引用次数: 19
Joint ML Channel Tracking and Decoding for MIMO Channels MIMO信道的联合ML信道跟踪与解码
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298359
E. Karami, M. Juntti
{"title":"Joint ML Channel Tracking and Decoding for MIMO Channels","authors":"E. Karami, M. Juntti","doi":"10.1109/CISS.2007.4298359","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298359","url":null,"abstract":"In this paper, a joint tracking and decoding algorithm is proposed for MIMO channels. This algorithm is based on a super trellis structure which calculates new estimations of the channel matrix; moreover to calculation of a new metric for each node of the trellis. This algorithm for each branch of the trellis diagram of convolutional encoder, calculate matrix estimation by ML channel tracking algorithm. The proposed algorithm is simulated for 1/2 rate convolutional code and 2x2 MIMO channel for different values of Doppler frequencies and Eb/N0. Bit error rate (BER) and channel tracking error are considered as comparison criteria and it is shown that its performance is good and channel tracking curves have always negative slope even in blind mode of the operation. The more simulations with more efficient channel models will be presented in full version of the paper.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114414536","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
An EM Technique for Multiple Transmitter Localization 一种多发射机定位的电磁技术
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298380
J. Nelson, M. Gupta
{"title":"An EM Technique for Multiple Transmitter Localization","authors":"J. Nelson, M. Gupta","doi":"10.1109/CISS.2007.4298380","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298380","url":null,"abstract":"We propose an expectation-maximization (EM) technique for locating multiple transmitters based on power levels observed by a set of arbitrarily-placed receivers. Multiple transmitter localization is of interest for uncoordinated cognitive radio systems, which must identify and transmit over unused radio spectrum without cooperation from conventional transmitters. We employ the EM algorithm to reduce the dimensionality of the maximum-likelihood estimation problem. Because the EM algorithm finds only a locally optimal solution, we explore the use of clustering to generate \"smart\" initial estimates of the transmitter locations. Simulation results show that, as the number of sensors increases, the proposed EM technique achieves gains of up to an order of magnitude over constricted particle swarm optimization, a popular global optimization technique.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124010078","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}
引用次数: 31
A Practical Hybrid-ARQ Protocol Using Noncoherent Orthogonal Modulation 一种实用的非相干正交调制混合arq协议
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298354
S. A. Ahmad, M. Valenti
{"title":"A Practical Hybrid-ARQ Protocol Using Noncoherent Orthogonal Modulation","authors":"S. A. Ahmad, M. Valenti","doi":"10.1109/CISS.2007.4298354","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298354","url":null,"abstract":"This paper considers hybrid-ARQ under the constraints of noncoherent orthogonal modulation and hard-decision decoding. Information theoretic bounds on the throughput for such systems are derived. A practical coding technique based on Reed-Solomon codes is proposed and analyzed. The proposed hybrid-ARQ protocol is modified to allow relay nodes to service retransmission requests. The proposed protocol is suitable for IEEE 802.15.4/Zigbee networks using commodity off-the-shelf hardware.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125908417","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
Secret Communication via Multi-antenna Transmission 多天线传输秘密通信
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298439
Zang Li, W. Trappe, R. Yates
{"title":"Secret Communication via Multi-antenna Transmission","authors":"Zang Li, W. Trappe, R. Yates","doi":"10.1109/CISS.2007.4298439","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298439","url":null,"abstract":"For a multiple antenna Gaussian broadcast channel, we look for inputs that facilitate secret transmission between authorized communication parties in the presence of passive eavesdroppers. In this work, we assume all channel information is known at the transmitter. For the general multiple antenna system, we find that the problem of optimizing over Gaussian inputs for achievable secrecy rate is not convex, making it difficult to solve. However, for the simpler case where multiple transmit antennas are deployed with only a single receive antenna used at both the intended receiver and the eavesdropper, the problem can be solved easily. The analytical solution for this case is presented.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128487472","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}
引用次数: 217
A New Lattice-Reduction-Based Receiver for MIMO Systems 一种新的基于格化简的MIMO接收机
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298357
Jun Niu, I. Lu
{"title":"A New Lattice-Reduction-Based Receiver for MIMO Systems","authors":"Jun Niu, I. Lu","doi":"10.1109/CISS.2007.4298357","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298357","url":null,"abstract":"In this paper, a new practical lattice reduction scheme, Seysen's algorithm, is combined with linear detectors such as Zero Forcing, MMSE and extended MMSE for MIMO digital communications. Seysen-based lattice-reduction aided detectors achieve the same diversity order as the optimum ML detector. It outperforms the existing LLL-based lattice-reduction aided detector. The performance improvement is more profound for MIMO systems with a larger number of transmit and receive antennas. Moreover, Seysen requires less computational time than the LLL scheme.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"13 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127050805","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}
引用次数: 10
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学术文献互助群
群 号:481959085
Book学术官方微信