2007 Information Theory and Applications Workshop最新文献_第3页

Efficient Box and Match Algorithm for Reliability-Based Soft-Decision Decoding of Linear Block Codes 基于可靠性的线性分组码软判决译码的高效盒匹配算法

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357575

Wenyi Jin

引用次数: 6

Robust Routing for Dynamic Wireless Networks Based on Stable Embeddings 基于稳定嵌入的动态无线网络鲁棒路由

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357571

D. Tschopp, S. Diggavi, M. Grossglauser, J. Widmer

{"title":"Robust Routing for Dynamic Wireless Networks Based on Stable Embeddings","authors":"D. Tschopp, S. Diggavi, M. Grossglauser, J. Widmer","doi":"10.1109/ITA.2007.4357571","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357571","url":null,"abstract":"Routing packets is a central function of multi-hop wireless networks. Traditionally, there have been two paradigms for routing, either based on the geographical coordinates of the nodes (geographic routing), or based on the connectivity graph (topology-based routing). The former implicitly assumes that geometry determines connectivity, whereas the latter does not exploit this inherent geometry of wireless networks, and assumes a general graph instead. In this paper, we explore ideas that attempt to bridge these two paradigms. We do so by investigating routing techniques based on metric embeddings of the connectivity graph. If this graph is closely related to the underlying geometry of the nodes, then it is possible to embed the graph in a low-dimensional normed space. This keeps the overhead of the routing protocol low. We specifically explore embeddings of dynamic networks induced by channel fading and mobility. This motivates the novel problem of stable embeddings, where the additional goal is to maintain an embedding over time, such that the evolution of the embedding faithfully captures the evolution of the underlying graph itself. This is crucial to limit the control overhead of the routing protocol, and to ensure that our approach is scalable.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125149417","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

On Achievable Rates for Relay Channels 关于中继信道的可实现速率

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357615

Hon-Fah Chong, M. Motani, H. K. Garg

引用次数: 5

Application of the many sources asymptotic in downscaling Internet-like Networks 多源渐近在类互联网网络降尺度中的应用

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357597

Fragkiskos Papadopoulos, K. Psounis

{"title":"Application of the many sources asymptotic in downscaling Internet-like Networks","authors":"Fragkiskos Papadopoulos, K. Psounis","doi":"10.1109/ITA.2007.4357597","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357597","url":null,"abstract":"In our earlier work by Fragkiskos Papadopoulos, et al. (2005), we have presented two methods to scale down the topology of the Internet, while preserving important performance metrics. We have shown that the methods can be used to greatly simplify and expedite performance prediction. The key insight that we have leveraged is that only the congested links along the path of each flow introduce sizable queueing delays and dependencies among flows. Based on this, we have shown that it is possible to infer the performance of the larger Internet by creating and observing a suitably scaled- down replica, consisting of the congested links only. However, two main assumptions of our approach were that uncongested links are known in advance, and that the queueing delays imposed by such links are negligible. In this paper we provide rules that can be used to identify uncongested links when these are not known, and we theoretically establish the conditions under which the negligible queueing delay assumption is valid. In particular, we first identify scenarios under which one can easily deduce whether a link imposes negligible queueing by inspecting the network topology. Then, we identify scenarios in which this is not possible and use known results based on the large deviations theory to approximate the queue length distribution. Finally, we use this approximation to decide which links are uncongested, and show that in the many- sources limit the queueing delays of uncongested links are indeed negligible. Our results are verified using simulations with TCP traffic.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129499540","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

Transmission of Correlated Sources Over Multiuser Channels with Receiver Side Information 基于接收机侧信息的多用户信道相关信源传输

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357580

D. Gunduz, E. Erkip

{"title":"Transmission of Correlated Sources Over Multiuser Channels with Receiver Side Information","authors":"D. Gunduz, E. Erkip","doi":"10.1109/ITA.2007.4357580","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357580","url":null,"abstract":"We consider transmission of correlated sources over multiuser channels where the receiver(s) have access to correlated side information. Our goal is to characterize necessary and sufficient conditions for lossless transmission and uncover scenarios where separation of source and channel coding, either in the traditional dasiainformationalpsila sense (where both source and channel encoders and decoders are designed independently) or in the 'operational' sense (where the encoders are independent, but the source and channel decoding is done jointly), is optimal. We first study a multiple access channel where the source signals are independent given the receiver side information. We prove an informational source channel separation theorem for this communication system. We next investigate source and channel coding for the compound multiple access and interference channels. We give general sufficient conditions for lossless transmission of each source for both channels, and then provide necessary conditions that hold under certain assumptions on the nature of the source and the receiver side information. For the interference channel, the necessary conditions hinge on a strong source- channel interference condition which depends not only on the channel but on the source and side information correlations as well. Our results suggest the optimality of informational or operational separation depending on the correlation structure of the side information and the amount of interference.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131640891","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

Minimal Markov chain embeddings of pattern problems 最小马尔可夫链嵌入模式问题

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357588

M. Lladser

引用次数: 19

Joint Source-Channel Coding: a Practical Approach and an implementation Example 联合信源信道编码:一种实用的方法和实现实例

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357563

G. Caire

引用次数: 3

On the Codebook-Level Duality Between Slepian-Woif Coding and Channel Coding 论睡眠- woif编码与信道编码的码本级对偶性

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357566

Jun Chen, Dake He, E. Yang

引用次数: 11

An Information Theoretic Framework for Ontology-based Bioinformatics 基于本体的生物信息学信息理论框架

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357555

G. Alterovitz, M. Xiang, M. Ramoni

引用次数: 5

Resource Consumption in Dynamic Spectrum Access Networks: Applications and Shannon Limits 动态频谱接入网中的资源消耗:应用和香农极限

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357598

M. Pursley, T. Royster

引用次数: 6