发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
Detecting Primary Transmitters via Cooperation and Memory in Cognitive Radio 认知无线电中通过合作和记忆检测初级发射机
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-09-04 DOI: 10.1109/CISS.2007.4298330
A. Betran-Martinez, O. Simeone, Y. Bar-Ness
{"title":"Detecting Primary Transmitters via Cooperation and Memory in Cognitive Radio","authors":"A. Betran-Martinez, O. Simeone, Y. Bar-Ness","doi":"10.1109/CISS.2007.4298330","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298330","url":null,"abstract":"Effective detection of the activity of primary transmitters is known to be one of the major challenges to the implementation of cognitive radio systems. In this paper, we investigate the use of cooperation and memory (using tools from change detection) as means to enhance primary detection. We focus on the simple case of two secondary users and one primary source. Numerical results show the relevant performance benefits of both cooperation and memory.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117342347","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}
引用次数: 12
Profit Maximizing Pricing Strategies for Dynamic Spectrum Allocation 动态频谱分配的利润最大化定价策略
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-09-04 DOI: 10.1109/CISS.2007.4298326
J. Acharya, R. Yates
{"title":"Profit Maximizing Pricing Strategies for Dynamic Spectrum Allocation","authors":"J. Acharya, R. Yates","doi":"10.1109/CISS.2007.4298326","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298326","url":null,"abstract":"We consider a system where one service provider (SP) allocates spectrum to users subscribed to his network. The SP charges a two part tariff from the users comprising of a fixed subscription price and price per unit spectrum used. We formulate the spectrum allocation problem from the SP profit maximization framework and calculate the resulting expressions for prices and spectrum allocated for different user utilities and SP power allocation strategies.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122632244","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
Correlated Sources over an Asymmetric Multiple Access Channel with One Distortion Criterion 具有一个失真准则的非对称多址信道上的相关信源
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-09-04 DOI: 10.1109/CISS.2007.4298322
Deniz Gündüz, E. Erkip
{"title":"Correlated Sources over an Asymmetric Multiple Access Channel with One Distortion Criterion","authors":"Deniz Gündüz, E. Erkip","doi":"10.1109/CISS.2007.4298322","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298322","url":null,"abstract":"We consider transmission of two arbitrarily correlated sources over a discrete memoryless asymmetric multiple access channel, where one of the sources is available at both transmitters. We want to transmit the common source lossless in the Shannon sense, while there is a distortion requirement on the other source. For a given bandwidth ratio between the channel and source bandwidths and a distortion requirement, we derive the necessary and sufficient conditions, and show that separation of source and channel coding is optimal. Finally, we extend our results to the case where perfect casual feedback is available at either one or both of the transmitters.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"21 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131177462","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
Minimax and Maxmin Solutions to Gaussian Jamming in Block-Fading Channels under Long Term Power Constraints 长期功率约束下块衰落信道高斯干扰的最小、最大和最大解
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557116
G. Amariucai, Shuangqing Wei, R. Kannan
{"title":"Minimax and Maxmin Solutions to Gaussian Jamming in Block-Fading Channels under Long Term Power Constraints","authors":"G. Amariucai, Shuangqing Wei, R. Kannan","doi":"10.1109/ISIT.2007.4557116","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557116","url":null,"abstract":"Without assuming any knowledge on source's code-book and its output signals, we formulate a Gaussian jamming problem in block fading channels as a two-player zero-sum game. The outage probability is adopted as an objective function, over which transmitter aims at minimization and jammer aims at maximization by selecting their power control strategies. Under long term power constraints, the optimal power control strategies of each player for both maxmin and minimax problems are obtained. Numerical results demonstrate a sharp difference between the resulting outage probabilities of the minimax and maxmin solutions, which thus implies the non-existence of Nash equilibria.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133965769","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}
引用次数: 12
A High-Throughput Cross-Layer Scheme for Distributed Wireless Ad Hoc Networks 分布式无线自组织网络的高吞吐量跨层方案
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-04-21 DOI: 10.1109/CISS.2007.4298434
A. Petropulu, Lun Dong, H. Poor
{"title":"A High-Throughput Cross-Layer Scheme for Distributed Wireless Ad Hoc Networks","authors":"A. Petropulu, Lun Dong, H. Poor","doi":"10.1109/CISS.2007.4298434","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298434","url":null,"abstract":"In wireless ad hoc networks, distributed nodes can collaboratively form an antenna array for long-distance communications to achieve high energy efficiency. In recent work, Ochiai, et al., have shown that such collaborative beamforming can achieve a statistically nice beampattern with a narrow main lobe and low side lobes. However, the process of collaboration introduces significant delay, since all collaborating nodes need access to the same information. In this paper, a technique that significantly reduces the collaboration overhead is proposed. It consists of two phases. In the first phase, nodes transmit locally in a random access fashion. Collisions, when they occur, are viewed as linear mixtures of the collided packets. In the second phase, a set of cooperating nodes acts as a distributed antenna system and beamform the received analog waveform to one or more faraway destinations. This step requires multiplication of the received analog waveform by a complex number, which is independently computed by each cooperating node, and which enables separation of the collided packets based on their final destination. The scheme requires that each node has global knowledge of the network coordinates. The proposed scheme can achieve high throughput, which in certain cases exceeds one.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129091808","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
An Attempt Towards Charge-Domain Logic (CDL) 电荷域逻辑(CDL)的尝试
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298403
Koichi Itoh, Masashi Yamazaki, S. Nakamura, Y. Nagazumi
{"title":"An Attempt Towards Charge-Domain Logic (CDL)","authors":"Koichi Itoh, Masashi Yamazaki, S. Nakamura, Y. Nagazumi","doi":"10.1109/CISS.2007.4298403","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298403","url":null,"abstract":"Application examples of charge-domain logic are described. To investigate the characteristics and possibilities of charge-domain logic, prototype implementations are made for full adder and CRC checker designs by standard CMOS, and fabricated by MOSIS 1.5 mum double overlapping poly, and double metal technology. Those application designs require less than 8 steps of charge transfer so that no special fabrication process is required. Some of the results from evaluation experiment for both designs are also included.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"26 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":"123558374","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
Cooperative Relaying with Carrier Frequency Uncertainty 载波频率不确定的协同中继
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298331
S. Ponnaluri, S. G. Wilson
{"title":"Cooperative Relaying with Carrier Frequency Uncertainty","authors":"S. Ponnaluri, S. G. Wilson","doi":"10.1109/CISS.2007.4298331","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298331","url":null,"abstract":"We investigate the performance of several suboptimal detectors in a differential space-time coding based cooperative relaying scenario with two relays wherein the carrier frequencies of the relays are not identical due to native oscillator instability. The relays cooperate using a differential Alamouti space-time block code with QPSK symbols transmitted over an unknown quasi-static Rayleigh fading channel. In such a scenario we observe that an optimal detector is prohibitively complex to use and hence we describe various suboptimal detectors and observe that there is no loss in the diversity order which is 2 in the case of using two relays.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"100 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":"122689848","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
Dynamic Self-Calibration in Collaborative Wireless Networks Using Belief Propagation with Gaussian Particle Filtering 基于高斯粒子滤波信念传播的协同无线网络动态自标定
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298412
Yanbing Zhang, H. Dai
{"title":"Dynamic Self-Calibration in Collaborative Wireless Networks Using Belief Propagation with Gaussian Particle Filtering","authors":"Yanbing Zhang, H. Dai","doi":"10.1109/CISS.2007.4298412","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298412","url":null,"abstract":"Belief propagation (BP) is considered as a prominent information processing framework for wireless networks recently. However, infeasible computation and communication requirement involved in applications entailing non-discrete distributions limits its use in practical situations with resource constraints. In this paper, based on some previous work, we further investigate an effective approach to address the message representation/approximation problem in BP algorithms, exploiting the recently proposed Gaussian particle filtering technique. The effectiveness of our approach is testified through the dynamic self-calibration problem in wireless networks. This framework can also be readily extended to address various applications in general distributed networks.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"24 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":"122972386","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}
引用次数: 6
Coverage-Based Information Retrieval for Lifetime Maximization in Sensor Networks 基于覆盖的传感器网络生命周期最大化信息检索
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298303
Tong Zhao, Qing Zhao
{"title":"Coverage-Based Information Retrieval for Lifetime Maximization in Sensor Networks","authors":"Tong Zhao, Qing Zhao","doi":"10.1109/CISS.2007.4298303","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298303","url":null,"abstract":"We consider information retrieval in a wireless sensor network deployed to monitor a spatially correlated random field. We address sensor scheduling in each data collection under the performance measure of network lifetime. We formulate this problem as an energy constrained coverage problem and proposal a scheduling algorithm based on a greedy approach. In the proposed algorithm, we consider the impact of both the network geometry and the energy consumption by sensors to the network lifetime. Numerical examples are carried out to demonstrate the performance of the proposed algorithm.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"13 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":"114387328","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}
引用次数: 22
Guidelines for Channel Code Design in Quasi-Static Fading Channels 准静态衰落信道中信道码设计准则
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298280
M. Lamarca, H. Lou, J. Garcia-Frías
{"title":"Guidelines for Channel Code Design in Quasi-Static Fading Channels","authors":"M. Lamarca, H. Lou, J. Garcia-Frías","doi":"10.1109/CISS.2007.4298280","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298280","url":null,"abstract":"In this paper, we provide guidelines for the design of good binary error correcting codes in quasi-static fading channels, using established design rules in AWGN channels as a starting point. The proposed analysis is based on the Gaussian assumption of demodulator log-likelihood ratios. This assumption allows to decouple the influence of the convergence threshold, slope in the BER waterfall region and error-floor of the channel code, so that these parameters can be analyzed separately. Our analysis evidences that, contrary to what happens in AWGN channels, the design of good low rate codes in quasi-static fading channels is much simpler than those of standard rates (.3 to .8 ).","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"31 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":"117091808","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
下一页 尾页
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学术官方微信