2010 44th Annual Conference on Information Sciences and Systems (CISS)最新文献

筛选
英文 中文
ALOHA with Collision Resolution: MAC layer analysis and software defined radio implementation 具有碰撞分辨率的ALOHA: MAC层分析和软件定义的无线电实现
2010 44th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2010-03-17 DOI: 10.1109/CISS.2010.5464810
J. Kountouriotis, Xin Liu, A. Petropulu, K. Dandekar
{"title":"ALOHA with Collision Resolution: MAC layer analysis and software defined radio implementation","authors":"J. Kountouriotis, Xin Liu, A. Petropulu, K. Dandekar","doi":"10.1109/CISS.2010.5464810","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464810","url":null,"abstract":"A cross-layer scheme, namely ALOHA with Collision Resolution (ALOHA-CR), is proposed for high throughput wireless communications in a cellular scenario. Transmissions occur in a time-slotted ALOHA-type fashion but with an important difference: simultaneous transmissions of two users can be successful. In this paper, throughput and service delay analysis is provided and the analytical results are validated on the Wireless Open Access Research Platform (WARP) [14] testbed containing software defined radio (SDR) testbed. Both analysis and experiments indicate that ALOHA-CR leads to significant increase in throughput and reduction of service delays.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123754638","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
On the impact of transmit waveforms on channel estimation inaccuracies in distributed MIMO ad hoc networks 分布式MIMO自组织网络中发射波形对信道估计精度的影响
2010 44th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2010-03-17 DOI: 10.1109/CISS.2010.5464923
P. Casari, Davide Chiarotto, M. Zorzi
{"title":"On the impact of transmit waveforms on channel estimation inaccuracies in distributed MIMO ad hoc networks","authors":"P. Casari, Davide Chiarotto, M. Zorzi","doi":"10.1109/CISS.2010.5464923","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464923","url":null,"abstract":"In this paper, we present a general analysis to evaluate the performance of correlator-based channel estimation in distributed MIMO ad hoc networks. This analysis is required to characterize the behavior of networks employing advanced physical-level (PHY) techniques, which call for precise assessment of channel effects in order to be operated correctly. To this end, we assume that several non-orthogonal signals are simultaneously received in a coordinated (i.e., frame-synchronous) but symbol-asynchronous fashion, and undergo flat, independent Rayleigh fading. We show that, in this scenario, channel estimates are affected not only by noise, but also by a displacement depending on the current channel realization. Such additional component can be modeled as a Gaussian random variable, of which we calculate the mean and variance, highlighting its dependence on the number of training symbols and the shape of transmit impulse. In particular, we show that an interesting interplay exists between MAC parameters (e.g., throughput) and the type of impulse chosen in an ad hoc networking protocol simulator.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"09 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127199451","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}
引用次数: 5
Transmission completion time minimization in an energy harvesting system 能量收集系统中传输完成时间的最小化
2010 44th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2010-03-17 DOI: 10.1109/CISS.2010.5464947
Jing Yang, S. Ulukus
{"title":"Transmission completion time minimization in an energy harvesting system","authors":"Jing Yang, S. Ulukus","doi":"10.1109/CISS.2010.5464947","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464947","url":null,"abstract":"We consider the transmission completion time minimization problem in a single-user energy harvesting wireless communication system. In this system, both the data packets and the harvested energy are modelled to arrive at the source node randomly. Our goal is to adaptively change the transmission rate according to the traffic load and available energy, such that the transmission completion time is minimized. Under a deterministic system setting, we assume that the energy harvesting times and harvested energy amounts are known before the transmission starts. For the data traffic arrivals, we consider two different scenarios. In the first scenario, we assume that all bits have arrived and are ready at the transmitter before the transmission starts. In the second scenario we consider, packets arrive during the transmissions with known arriving times and sizes. We develop optimal off-line scheduling policies which minimize the overall transmission completion time under causality constraints on both data and energy arrivals.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126429924","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}
引用次数: 91
Traitor-tracing aided by compressed SURF image features 利用压缩SURF图像特征辅助叛徒跟踪
2010 44th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2010-03-17 DOI: 10.1109/CISS.2010.5464707
Guillaume Gigaud, P. Moulin
{"title":"Traitor-tracing aided by compressed SURF image features","authors":"Guillaume Gigaud, P. Moulin","doi":"10.1109/CISS.2010.5464707","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464707","url":null,"abstract":"Traitor-tracing (aka fingerprinting) has received much attention as a possible solution for protecting media copyrights. However, all the current schemes for images and video lack robustness against geometric attacks. We propose a novel semi-blind algorithm that can cope with such attacks. The algorithm uses compressed SURF features as side information in order to estimate and invert the geometric attack. Moreover the algorithm is highly robust against cropping and additive white noise.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121601549","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
Random frames from binary linear block codes 随机帧从二进制线性块码
2010 44th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2010-03-17 DOI: 10.1109/CISS.2010.5464847
B. Babadi, V. Tarokh
{"title":"Random frames from binary linear block codes","authors":"B. Babadi, V. Tarokh","doi":"10.1109/CISS.2010.5464847","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464847","url":null,"abstract":"Let C be an [n, k, d] binary linear block code of length n, dimension k and minimum Hamming distance d over GF(2<sup>n</sup>). Let d<sup>⊥</sup> denote the minimum Hamming distance of the dual code of C over GF(2<sup>n</sup>). Let ɛ : GF(2<sup>n</sup>) → {−1, 1}n be the component-wise mapping ɛ(v<inf>i</inf>) := (−1)<sup>vi</sup> , for v =(v<inf>1</inf>, v<inf>2</inf>, … , v<inf>n</inf>) ∈ GF(2<sup>n</sup>). Finally, for p ≪ n, let φ<inf>C</inf> be a p × n random matrix whose rows are obtained by mapping a uniformly drawn set of size p of the codewords of C under e. Recently, the authors have established that [3] for d<sup>⊥</sup> large enough and y := p/n ∈ (0, 1) fixed, as n → ∞ the empirical eigen-distribution of the Gram matrix of 1 over √n times φ<inf>C</inf> resembles that of a random i.i.d. Rademacher matrix (i.e., the Marchenko-Pastur distribution). In this paper, we overview this result and discuss its implications on the design of frames for compressed sensing applications.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124054140","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}
引用次数: 4
Sobolev duals of random frames 随机帧的Sobolev对偶
2010 44th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2010-03-17 DOI: 10.1109/CISS.2010.5464811
C. S. Güntürk, M. Lammers, A. Powell, Rayan Saab, Ö. Yilmaz
{"title":"Sobolev duals of random frames","authors":"C. S. Güntürk, M. Lammers, A. Powell, Rayan Saab, Ö. Yilmaz","doi":"10.1109/CISS.2010.5464811","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464811","url":null,"abstract":"Sobolev dual frames have recently been proposed as optimal alternative reconstruction operators that are specifically tailored for Sigma-Delta (¿¿) quantization of frame coefficients. While the canonical dual frame of a given analysis (sampling) frame is optimal for the white-noise type quantization error of Pulse Code Modulation (PCM), the Sobolev dual offers significant reduction of the reconstruction error for the colored-noise of ¿¿ quantization. However, initial quantitative results concerning the use of Sobolev dual frames required certain regularity assumptions on the given analysis frame in order to deduce improvements of performance on reconstruction that are similar to those achieved in the standard setting of bandlimited functions. In this paper, we show that these regularity assumptions can be lifted for (Gaussian) random frames with high probability on the choice of the analysis frame. Our results are immediately applicable in the traditional oversampled (coarse) quantization scenario, but also extend to compressive sampling of sparse signals.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131188300","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
A probabilistic transmission scheme for distributed estimation in wireless sensor networks 无线传感器网络中分布式估计的概率传输方案
2010 44th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2010-03-17 DOI: 10.1109/CISS.2010.5464918
E. Masazade, R. Niu, P. Varshney, Mehmet Keskinöz
{"title":"A probabilistic transmission scheme for distributed estimation in wireless sensor networks","authors":"E. Masazade, R. Niu, P. Varshney, Mehmet Keskinöz","doi":"10.1109/CISS.2010.5464918","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464918","url":null,"abstract":"In this paper, we propose a probabilistic transmission scheme for distributed parameter estimation in wireless sensor networks. We assume that sensor observation noises are Gaussian distributed with non-identical statistics and the fusion center does not know the sensors' noise statistics. Each sensor employs a data rate to quantize its analog measurement that is a function of its signal-to-noise ratio (SNR). In order not to exceed the available capacity, for each possible data rate, the quantized sensor data are sent to the fusion center with a certain transmission probability. Under total bandwidth and network utilization constraints, we formulate an optimization problem to find the optimal transmission probabilities of each data rate by minimizing the inverse of the average Fisher information of the estimate. Under stringent availability of bandwidth, simulation results show that the proposed probabilistic transmission scheme outperforms the scheme where the total bandwidth is equally distributed among sensors. The optimal transmission probabilities are assigned in such a way that the sensors with high SNR have priority to transmit their data, and the mean squared estimation error is quite close to the case where all the sensors transmit at the maximum data rate.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128863590","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}
引用次数: 4
Practical Distributed Video Coding based on source rate estimation 基于信源率估计的实用分布式视频编码
2010 44th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2010-03-17 DOI: 10.1109/CISS.2010.5464919
Rami D. Halloush, H. Radha
{"title":"Practical Distributed Video Coding based on source rate estimation","authors":"Rami D. Halloush, H. Radha","doi":"10.1109/CISS.2010.5464919","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464919","url":null,"abstract":"In Distributed Video Coding (DVC) the encoder compresses frames at source rates that depend on the statistical dependency between the Wyner-Ziv (WZ) and side information frames. An important issue that we address in this paper is providing the encoder with a mechanism to identify the source rate to be used in encoding a WZ frame. One possible solution is to follow a feedback approach; the encoder starts by sending a small amount of data (low source rate). In case the decoder fails to recover the compressed frame, it provides the encoder with a feedback requesting more bits. This solution results in using source rates that are ideal in the sense that they are the minimal rates that lead to successful decoding. Nevertheless, this solution might not be practical for visual sensor networks as it may exhaust limited bandwidth and energy resources. We propose a mechanism to estimate ideal source rates without the need to exchanging feedback messages. The proposed mechanism uses conditional entropy (entropy of a WZ source conditioned on a side information source) to estimate ideal source rates. Further, we show that by estimating the source rates (using optimal estimators) we can achieve a video quality and compression performance that is close to that achieved when feedback messages are exchanged. Moreover, we show that by avoiding incremental transmission and feedback messages, the proposed estimation-based approach can demonstrate lower energy consumption for a range of video quality compared with the feedback approach when both are deployed over a real visual sensor platform, namely, the imote2/IMB400.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134266384","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
Vanishing criteria in multiterminal source coding 多终端信源编码中的消失准则
2010 44th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2010-03-17 DOI: 10.1109/CISS.2010.5464974
S. Jana, R. Blahut
{"title":"Vanishing criteria in multiterminal source coding","authors":"S. Jana, R. Blahut","doi":"10.1109/CISS.2010.5464974","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464974","url":null,"abstract":"In Shannon theory literature, nuances of closely related, yet formally dissimilar, vanishing criteria have not been widely studied. For example, the distinctions between the vanishing-distortion and the vanishing-error criteria, and between the vanishing-rate and the zero-rate coding are still not well understood. In this paper, with the help of our recently proposed canonical theory, we show that each pair gives rise to two related geometries, obtained by interchanging the order of section and closure operations on an underlying set. For amenable problems, that set is closed, and hence the rival geometries are indistinguishable. However, we believe that there exists an (intransigent) problem with an underlying open set for which those geometries are distinct. Our belief is buttressed by the fact that the vanishing-error and the zero-error coding problems, involving similarly interchanged section and closure operations, are known to sometimes differ","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129972249","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
Adaptive spectrum sensing with noise variance estimation for dynamic cognitive radio systems 基于噪声方差估计的动态认知无线电系统自适应频谱感知
2010 44th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2010-03-17 DOI: 10.1109/CISS.2010.5464913
Deepak R. Joshi, D. Popescu, O. Dobre
{"title":"Adaptive spectrum sensing with noise variance estimation for dynamic cognitive radio systems","authors":"Deepak R. Joshi, D. Popescu, O. Dobre","doi":"10.1109/CISS.2010.5464913","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464913","url":null,"abstract":"Cognitive radios (CR) are regarded as a viable solution to enabling flexible use of the frequency spectrum in future generations of wireless networks. An important aspect of spectrum management in CR systems is adaptation of the spectrum sensing methods employed by CRs in order to accurately detect the changing patterns of spectrum use and to update the spectrum and interference constraints under which CR terminals operate. In this paper we study adaptation of the spectrum sensing threshold in CR using discrete Fourier transform (DFT) filter bank (DFB) method in a dynamic scenario where the sensing threshold is adapted to minimize the spectrum sensing error in the presence of noise. We present an algorithm for spectrum sensing threshold adaptation using DFB with estimated noise variance which we illustrate with numerical examples obtained from simulations. These show the effectiveness of the proposed method in dynamic scenarios with varying noise variance.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130946895","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}
引用次数: 36
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学术官方微信