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

2008 IEEE International Zurich Seminar on Communications最新文献

筛选
英文 中文
Phase Transition in Opportunistic Mobile Networks 机会移动网络中的相变
2008 IEEE International Zurich Seminar on Communications Pub Date : 2008-03-12 DOI: 10.1109/IZS.2008.4497269
A. Chaintreau, L. Massoulié
{"title":"Phase Transition in Opportunistic Mobile Networks","authors":"A. Chaintreau, L. Massoulié","doi":"10.1109/IZS.2008.4497269","DOIUrl":"https://doi.org/10.1109/IZS.2008.4497269","url":null,"abstract":"Opportunistic mobile networks take advantage of local opportunities of wireless communication between devices (cellphones, etc.) to construct a path over time between a source and a destination. This paper uses a model of random temporal network to study the existence of those paths that use a small number of time slots and a small number of steps. It establishes that a phase transition occurs as time and hops are jointly increase according to the logarithm of the network size. For a given intensity of contact, as time grows the network abruptly change from a regime where almost surely no path exists to a regime where paths exist with a positive probability. Our proof illustrates a strong correlation close to the critical point between nearby paths (those who share a prefix and suffix term), which explain the relatively high value of the variance. We identify combinatorial properties specific to temporal paths, which are critical to characterize the phase transition and impact the estimation of the probability of success. We believe that it is the first rigorous proof that a phenomenon recalling the small world effect may be found in dynamic random graphs.","PeriodicalId":212936,"journal":{"name":"2008 IEEE International Zurich Seminar on Communications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115352483","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
Finite-Length Scaling of Repeat-Accumulate Codes on the BEC BEC上重复累积码的有限长度缩放
2008 IEEE International Zurich Seminar on Communications Pub Date : 2008-03-12 DOI: 10.1109/IZS.2008.4497277
I. Andriyanova
{"title":"Finite-Length Scaling of Repeat-Accumulate Codes on the BEC","authors":"I. Andriyanova","doi":"10.1109/IZS.2008.4497277","DOIUrl":"https://doi.org/10.1109/IZS.2008.4497277","url":null,"abstract":"In this paper we consider the finite-length performance of Repeat-Accumulate codes in the waterfall region assuming the transmission on the binary erasure channel. We extend the finite-length scaling law of LDPC codes [1] to this ensemble and we derive the scaling parameter. The obtained performance estimations match very well with numerical results.","PeriodicalId":212936,"journal":{"name":"2008 IEEE International Zurich Seminar on Communications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114243011","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
Achievable Distortion/Rate Tradeoff in a Decentralized Gaussian Parameter Estimation Problem 分散高斯参数估计问题中可实现的失真/率权衡
2008 IEEE International Zurich Seminar on Communications Pub Date : 2008-03-12 DOI: 10.1109/IZS.2008.4497286
A. Scaglione, M. E. Yildiz, T. C. Aysal
{"title":"Achievable Distortion/Rate Tradeoff in a Decentralized Gaussian Parameter Estimation Problem","authors":"A. Scaglione, M. E. Yildiz, T. C. Aysal","doi":"10.1109/IZS.2008.4497286","DOIUrl":"https://doi.org/10.1109/IZS.2008.4497286","url":null,"abstract":"In this paper, we study the decentralized version of the classical rate constrained Gaussian parameter estimation problem referred to as the Central Estimation Officer (CEO) problem which we refer to as the Decentralized Estimation Officers (DEO) problem. Like in the CEO case, we consider a group of N sensors observing an independently corrupted version of an infinite i.i.d. sequence of samples from a Gaussian source, in additive Gaussian noise. Unlike the CEO case, the sensors in our study are also the estimation officers. They are uniformly deployed in a circular pattern of radius r and communicate over RF links with limited energy. Their task is to reconstruct the quantity of interest (the samples of the source), without a central fusion node, better than what they are capable of with their local observations. We find achievable scaling laws by structuring our communication protocol as an instance of the so called average consensus algorithm, a gossiping protocol used for averaging original sensor measurements via near neighbors communications. We derive how the Mean Squared Error (MSE) of the sensors' estimation scales with the network size, per node power and ring radius r. Moreover, we compare our results with scaling laws previously derived for the centralized case, i.e, the CEO problem in a comparable scenario.","PeriodicalId":212936,"journal":{"name":"2008 IEEE International Zurich Seminar on Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123878116","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
Convex Precoding for Vector Channels in High Dimensions 高维矢量通道的凸预编码
2008 IEEE International Zurich Seminar on Communications Pub Date : 2008-03-12 DOI: 10.1109/IZS.2008.4497290
R. de Miguel, R. Miiller
{"title":"Convex Precoding for Vector Channels in High Dimensions","authors":"R. de Miguel, R. Miiller","doi":"10.1109/IZS.2008.4497290","DOIUrl":"https://doi.org/10.1109/IZS.2008.4497290","url":null,"abstract":"We analyze a non-linear vector preceding technique for MIMO channels in high dimensions. Channel inversion is carried out at the transmitter with the aim of minimizing signal processing at the receiver. In order to contain the transmission power, symbol constellations are extended onto the complex plane using convex alphabets. We compare the case where full channel inversion is possible at the transmitter (more transmitting elements than receiving elements), and the converse case where only partial channel inversion is possible and matched filter detection is required at the receiver. We show that, in some cases, it might be advantageous to turn off some receiving elements in order to contain the transmitted energy per bit. We also propose the use of two novel 8PSK modulation schemes.","PeriodicalId":212936,"journal":{"name":"2008 IEEE International Zurich Seminar on Communications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130463890","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
On Universal Coding for Parallel Gaussian Channels 并行高斯信道的通用编码
2008 IEEE International Zurich Seminar on Communications Pub Date : 2008-03-12 DOI: 10.1109/IZS.2008.4497284
M. Shanechi, U. Erez, G. Wornell
{"title":"On Universal Coding for Parallel Gaussian Channels","authors":"M. Shanechi, U. Erez, G. Wornell","doi":"10.1109/IZS.2008.4497284","DOIUrl":"https://doi.org/10.1109/IZS.2008.4497284","url":null,"abstract":"Two classes of approximately universal codes are developed for parallel Gaussian channels whose state information is not available at the encoder. Both architectures convert the channel into a set of scalar additive white Gaussian noise (AWGN) channels to which good AWGN base codes can be applied, and both are layered schemes used in conjunction with successive interference cancellation to keep decoding complexity low. The first construction uses a concatenated code structure, and with perfect base codes achieves an arbitrarily high fraction of capacity in the limit of high SNR. The second construction uses a layer-dither-repeat structure, and with perfect base codes can achieve better than 90% of capacity at typical target spectral efficiencies, corresponding to a roughly 1 dB gap to capacity.","PeriodicalId":212936,"journal":{"name":"2008 IEEE International Zurich Seminar on Communications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131644471","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
Diversity-Multiplexing Tradeoff for the Slow Fading Interference Channel 慢衰落干扰信道的分集-复用权衡
2008 IEEE International Zurich Seminar on Communications Pub Date : 2008-03-12 DOI: 10.1109/IZS.2008.4497295
E. Akuiyibo, O. Lévêque
{"title":"Diversity-Multiplexing Tradeoff for the Slow Fading Interference Channel","authors":"E. Akuiyibo, O. Lévêque","doi":"10.1109/IZS.2008.4497295","DOIUrl":"https://doi.org/10.1109/IZS.2008.4497295","url":null,"abstract":"We establish the high SNR diversity-multiplexing tradeoff of the fading interference channel, for a general interference level and under the assumption that transmitters and receivers are equipped with a single antenna each.","PeriodicalId":212936,"journal":{"name":"2008 IEEE International Zurich Seminar on Communications","volume":"648 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120867117","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}
引用次数: 37
Wireless Social Community Networks: A Game-Theoretic Analysis 无线社会社区网络:博弈论分析
2008 IEEE International Zurich Seminar on Communications Pub Date : 2008-03-12 DOI: 10.1109/IZS.2008.4497267
M. Manshaei, Julien Freudiger, M. Félegyházi, P. Marbach, Jean-Pierre Hubaux
{"title":"Wireless Social Community Networks: A Game-Theoretic Analysis","authors":"M. Manshaei, Julien Freudiger, M. Félegyházi, P. Marbach, Jean-Pierre Hubaux","doi":"10.1109/IZS.2008.4497267","DOIUrl":"https://doi.org/10.1109/IZS.2008.4497267","url":null,"abstract":"Wireless social community networks formed by users with a WiFi access point have been created as an alternative to traditional wireless networks that operate in the licensed spectrum. By relying on access points owned by users for access, wireless community networks provide a wireless infrastructure in an inexpensive way. However, the coverage of such a network is limited by the set of users who open their access points to the social community. Currently, it is not clear to what degree this paradigm can serve as a replacement, or a complimentary service, of existing centralized networks operating in licensed bands. In this paper, we study the dynamics of wireless social community networks using, as well as the situation where a wireless social community networks co-exists with a traditional wireless network operating in the licensed spectrum.","PeriodicalId":212936,"journal":{"name":"2008 IEEE International Zurich Seminar on Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133725008","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}
引用次数: 23
Wireless Sensor Networks for Environmental Monitoring: The SensorScope Experience 用于环境监测的无线传感器网络:SensorScope体验
2008 IEEE International Zurich Seminar on Communications Pub Date : 2008-03-12 DOI: 10.1109/IZS.2008.4497285
G. Barrenetxea, F. Ingelrest, Gunnar Schaefer, M. Vetterli
{"title":"Wireless Sensor Networks for Environmental Monitoring: The SensorScope Experience","authors":"G. Barrenetxea, F. Ingelrest, Gunnar Schaefer, M. Vetterli","doi":"10.1109/IZS.2008.4497285","DOIUrl":"https://doi.org/10.1109/IZS.2008.4497285","url":null,"abstract":"While wireless sensor networks have been extensively studied in the past few years, most results are of theoretical nature and were obtained outside of a practical context. This can be problematic for real applications, especially in the area of environmental monitoring where many factors, such as harsh weather conditions, can greatly influence the performance of such a network, while reliable delivery and high-quality measurements are required. SensorScope is an interdisciplinary project, elaborated by environmental and networking researchers, that aims at narrowing the gap between theory and practice. Several successful real-world deployments have already been undertaken in rugged environments. In this paper, we analyze the particular requirements of environmental monitoring and how these requirements have been met in the SensorScope project. We also present an application example of a deployment, undertaken in a harsh mountain environment.","PeriodicalId":212936,"journal":{"name":"2008 IEEE International Zurich Seminar on Communications","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134418247","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}
引用次数: 126
Electronic Equalization of Fiber Optic Links 光纤链路的电子均衡
2008 IEEE International Zurich Seminar on Communications Pub Date : 2008-03-12 DOI: 10.1109/IZS.2008.4497273
A. Singer, N. Shanbhag, Hyeon-Min Bae
{"title":"Electronic Equalization of Fiber Optic Links","authors":"A. Singer, N. Shanbhag, Hyeon-Min Bae","doi":"10.1109/IZS.2008.4497273","DOIUrl":"https://doi.org/10.1109/IZS.2008.4497273","url":null,"abstract":"The days when optical fiber was viewed as having unlimited capacity have come to an end due to the steady growth in demand for bandwidth. Dispersion, noise and nonlinearities pose substantial channel impairments that need to be overcome. As a result, over the last decade, signal processing has emerged as a key technology to the advancement of low-cost high data rate optical communication systems. The unrelenting progress of semiconductor technology exemplified by Moore's Law provides an efficient platform for implementing signal processing techniques in the electrical domain leading to what is known as electronic dispersion compensation (EDC). In this paper, we provide an overview of some of the driving factors that limit the performance of optical links and provide a design example of an MLSE-based receiver for 10 Gb/sec long haul links.","PeriodicalId":212936,"journal":{"name":"2008 IEEE International Zurich Seminar on Communications","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133747649","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
Lossy Source Coding via Markov Chain Monte Carlo 通过马尔科夫链蒙特卡洛进行有损源编码
2008 IEEE International Zurich Seminar on Communications Pub Date : 2008-03-12 DOI: 10.1109/IZS.2008.4497281
S. Jalali, T. Weissman
{"title":"Lossy Source Coding via Markov Chain Monte Carlo","authors":"S. Jalali, T. Weissman","doi":"10.1109/IZS.2008.4497281","DOIUrl":"https://doi.org/10.1109/IZS.2008.4497281","url":null,"abstract":"We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two well-known tools from statistical physics and computer science: Gibbs sampling and simulated annealing. In order to code a source sequence xn, the encoder initializes the reconstruction block as x circn = xn, and then at each iteration uniformly at random chooses one of the symbols of x circn, and updates it. This updating is based on some conditional probability distribution which depends on a parameter beta representing inverse temperature, an integer parameter k = o(log n) representing context length, and the original source sequence. At the end of this process, the encoder outputs the Lempel-Ziv description of x circn, which the decoder deciphers perfectly, and sets as its reconstruction. The complexity of the proposed algorithm in each iteration is linear in k and independent of n. We prove that, for any stationary ergodic source, the algorithm achieves the optimal rate-distortion performance asymptotically in the limits of large number of iterations, beta, and n.","PeriodicalId":212936,"journal":{"name":"2008 IEEE International Zurich Seminar on Communications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114753737","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
下一页 尾页
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学术官方微信
小红书