Pub Date : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797603
I. Marić, Nan Liu, A. Goldsmith
Motivated by cognitive radio applications, we consider mitigating the effect of interference by exploiting known properties about its signal structure. Specifically, we analyze communication between a source and destination with an interferer that induces random variations in the source-destination channel. The interferer transmits a sequence chosen uniformly from a randomly generated codebook, which has an i.i.d. structure, or a superposition structure. It is assumed that both the encoder and decoder know the interferer's codebook. We first provide a definition of capacity for these settings. When the encoder knows the interferer's message noncausally, it can use Gel'fand-Pinsker (GP) encoding to precode against interference. Alternatively, it can encode by taking into account that the interference is a codeword, to enable the decoder to decode both messages. It is demonstrated by an example that the latter can outperform GP encoding. Two upper bounds to the performance of this channel are then presented. Next, a more realistic scenario is considered in which the interference is learned at the cognitive encoder causally through a noisy channel. It is shown that for the case of i.i.d. generated interference, this information has no value. In contrast, when the interference is a codeword from an i.i.d. generated codebook, this fact can be exploited to obtain higher rates between the cognitive pair.
{"title":"Encoding against an interferer's codebook","authors":"I. Marić, Nan Liu, A. Goldsmith","doi":"10.1109/ALLERTON.2008.4797603","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797603","url":null,"abstract":"Motivated by cognitive radio applications, we consider mitigating the effect of interference by exploiting known properties about its signal structure. Specifically, we analyze communication between a source and destination with an interferer that induces random variations in the source-destination channel. The interferer transmits a sequence chosen uniformly from a randomly generated codebook, which has an i.i.d. structure, or a superposition structure. It is assumed that both the encoder and decoder know the interferer's codebook. We first provide a definition of capacity for these settings. When the encoder knows the interferer's message noncausally, it can use Gel'fand-Pinsker (GP) encoding to precode against interference. Alternatively, it can encode by taking into account that the interference is a codeword, to enable the decoder to decode both messages. It is demonstrated by an example that the latter can outperform GP encoding. Two upper bounds to the performance of this channel are then presented. Next, a more realistic scenario is considered in which the interference is learned at the cognitive encoder causally through a noisy channel. It is shown that for the case of i.i.d. generated interference, this information has no value. In contrast, when the interference is a codeword from an i.i.d. generated codebook, this fact can be exploited to obtain higher rates between the cognitive pair.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116196704","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}
Pub Date : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797672
O. Simeone, O. Somekh, G. Kramer, H. Poor, S. Shamai
The capacity region of a Multiple Access Channel can be increased by feedback to the sources, since feedback enables cooperative transmission. Focusing on a linear cellular system (as for a highway or a corridor), a novel transmission strategy is proposed that exploits feedback from the neighboring mobile stations (MSs). The strategy enables cooperative communications via ldquoanalog network codingrdquo (i.e., broadcasting and interference cancellation via side information) to exchange signalling information among MSs. Numerical results show that the proposed technique provides gains over non-cooperative strategies in the low-signal-to-noise-ratio regime.
{"title":"Uplink sum-rate analysis of a multicell system with feedback","authors":"O. Simeone, O. Somekh, G. Kramer, H. Poor, S. Shamai","doi":"10.1109/ALLERTON.2008.4797672","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797672","url":null,"abstract":"The capacity region of a Multiple Access Channel can be increased by feedback to the sources, since feedback enables cooperative transmission. Focusing on a linear cellular system (as for a highway or a corridor), a novel transmission strategy is proposed that exploits feedback from the neighboring mobile stations (MSs). The strategy enables cooperative communications via ldquoanalog network codingrdquo (i.e., broadcasting and interference cancellation via side information) to exchange signalling information among MSs. Numerical results show that the proposed technique provides gains over non-cooperative strategies in the low-signal-to-noise-ratio regime.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116455202","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}
Pub Date : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797548
Chih-Chun Wang
There are two common network models for network coded traffic: one is the fractional rate model (the primary model for non-coded communication) and the other is the integer rate model used for detailed coding analysis on packet-by-packet behaviors. The existing approach of finding minimum-cost multicast network codes is based on the fractional rate model and solves the corresponding linear-programming (LP) problem. The LP-based network optimization generally converges slowly due to the small step size and does not take care of the packet-by-packet coding behavior of network coding. This paper develops a minimum-cost multicast scheme based on the integer rate model. The new scheme exploits a new concept of coded feedback, takes full advantages of the forward network-coded traffic, and possesses many practical advantages for efficient implementation. The complexity and performance of the coded-feedback scheme are studied both analytically and through simulations.
{"title":"A coded-feedback construction of locally minimum-cost multicast network codes","authors":"Chih-Chun Wang","doi":"10.1109/ALLERTON.2008.4797548","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797548","url":null,"abstract":"There are two common network models for network coded traffic: one is the fractional rate model (the primary model for non-coded communication) and the other is the integer rate model used for detailed coding analysis on packet-by-packet behaviors. The existing approach of finding minimum-cost multicast network codes is based on the fractional rate model and solves the corresponding linear-programming (LP) problem. The LP-based network optimization generally converges slowly due to the small step size and does not take care of the packet-by-packet coding behavior of network coding. This paper develops a minimum-cost multicast scheme based on the integer rate model. The new scheme exploits a new concept of coded feedback, takes full advantages of the forward network-coded traffic, and possesses many practical advantages for efficient implementation. The complexity and performance of the coded-feedback scheme are studied both analytically and through simulations.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123480957","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}
Pub Date : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797724
J. Price, T. Javidi
Since its inception, network coding literature has, for the most part, assumed cooperation among users. In unicast applications where users have no inherent interest in providing (or concealing) their information to (or from) any destinations except for their unique one, this assumption must be reconsidered. In this paper, we examine the impact of selfish users on coding strategies by formulating network coding games, in which users strategies are their encoding/decoding schemes (including encoding functions, block length, rate, etc). Through the use of examples, we show that the rational outcomes of such network coding games are dependent on the particular network coding scheme implemented at intermediate nodes in the network. More specifically, we construct examples that show how careful construction of network coding schemes at intermediate nodes in the network can guarantee that efficient coding solutions will emerge as a rational outcome of the game, even when users are allowed complete freedom in choosing their coding schemes.
{"title":"A game-theoretic approach to coding for information networks","authors":"J. Price, T. Javidi","doi":"10.1109/ALLERTON.2008.4797724","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797724","url":null,"abstract":"Since its inception, network coding literature has, for the most part, assumed cooperation among users. In unicast applications where users have no inherent interest in providing (or concealing) their information to (or from) any destinations except for their unique one, this assumption must be reconsidered. In this paper, we examine the impact of selfish users on coding strategies by formulating network coding games, in which users strategies are their encoding/decoding schemes (including encoding functions, block length, rate, etc). Through the use of examples, we show that the rational outcomes of such network coding games are dependent on the particular network coding scheme implemented at intermediate nodes in the network. More specifically, we construct examples that show how careful construction of network coding schemes at intermediate nodes in the network can guarantee that efficient coding solutions will emerge as a rational outcome of the game, even when users are allowed complete freedom in choosing their coding schemes.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123718163","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}
Pub Date : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797625
Parv Venkitasubramaniam, A. Sahai
The review cycle for papers takes way too long in many disciplines. The problem is that while authors want to have their own papers reviewed fast, that are often unwilling to review the papers of others in a timely manner. This paper explores what would be required to incentivize fast reviews using a public reputation/scoring system that exploits the fact that the referees are drawn from the same pool as paper authors. The challenge in maintaining a public reputation system is to ensure that the identity of referees remain as anonymous as possible. A model is proposed in this work, wherein authors have an incentive to commit to reviewing papers and are rewarded for meeting this commitment in a manner that prioritizes their own papers for reviews. This ensures stability (bounded reviewing delays) for all fair contributors while freeloaders face a potentially unstable system. A naive implementation of the scoring system, however, leaks information that would allow authors to infer the likely identities of their referees. A distortion to the observed public score process is then studied, which is shown to enhance anonymity while preserving the incentives for timely refereeing.
{"title":"Incentivizing anonymous “peer-to-peer” reviews","authors":"Parv Venkitasubramaniam, A. Sahai","doi":"10.1109/ALLERTON.2008.4797625","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797625","url":null,"abstract":"The review cycle for papers takes way too long in many disciplines. The problem is that while authors want to have their own papers reviewed fast, that are often unwilling to review the papers of others in a timely manner. This paper explores what would be required to incentivize fast reviews using a public reputation/scoring system that exploits the fact that the referees are drawn from the same pool as paper authors. The challenge in maintaining a public reputation system is to ensure that the identity of referees remain as anonymous as possible. A model is proposed in this work, wherein authors have an incentive to commit to reviewing papers and are rewarded for meeting this commitment in a manner that prioritizes their own papers for reviews. This ensures stability (bounded reviewing delays) for all fair contributors while freeloaders face a potentially unstable system. A naive implementation of the scoring system, however, leaks information that would allow authors to infer the likely identities of their referees. A distortion to the observed public score process is then studied, which is shown to enhance anonymity while preserving the incentives for timely refereeing.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"942 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128597203","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}
Pub Date : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797707
A. Wierman, L. Andrew, A. Tang
Energy consumption in a computer system can be reduced by dynamic speed scaling, which adapts the processing speed to the current load. This paper studies the optimal way to adjust speed to balance mean response time and mean energy consumption, when jobs arrive as a Poisson process and processor sharing scheduling is used. Both bounds and asymptotics for the optimal speeds are provided. Interestingly, a simple scheme that halts when the system is idle and uses a static rate while the system is busy provides nearly the same performance as the optimal dynamic speed scaling. However, dynamic speed scaling which allocates a higher speed when more jobs are present significantly improves robustness to bursty traffic and mis-estimation of workload parameters.
{"title":"Stochastic analysis of power-aware scheduling","authors":"A. Wierman, L. Andrew, A. Tang","doi":"10.1109/ALLERTON.2008.4797707","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797707","url":null,"abstract":"Energy consumption in a computer system can be reduced by dynamic speed scaling, which adapts the processing speed to the current load. This paper studies the optimal way to adjust speed to balance mean response time and mean energy consumption, when jobs arrive as a Poisson process and processor sharing scheduling is used. Both bounds and asymptotics for the optimal speeds are provided. Interestingly, a simple scheme that halts when the system is idle and uses a static rate while the system is busy provides nearly the same performance as the optimal dynamic speed scaling. However, dynamic speed scaling which allocates a higher speed when more jobs are present significantly improves robustness to bursty traffic and mis-estimation of workload parameters.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128950142","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}
Pub Date : 2008-09-01DOI: 10.1109/allerton.2008.4797725
A. Akavia, R. Venkatesan
We present a new family of codes with good asymptotic properties. These codes are constructed from simple old codes using a new perturbation operator that we introduce. We provide an error reduction algorithm for these codes that uses only elementary operations with small precision. We also present a soft error reduction algorithm for the expander based codes of Alon-Bruck-Naor-Naor-Roth when concatenated with any binary code.
{"title":"Perturbation codes","authors":"A. Akavia, R. Venkatesan","doi":"10.1109/allerton.2008.4797725","DOIUrl":"https://doi.org/10.1109/allerton.2008.4797725","url":null,"abstract":"We present a new family of codes with good asymptotic properties. These codes are constructed from simple old codes using a new perturbation operator that we introduce. We provide an error reduction algorithm for these codes that uses only elementary operations with small precision. We also present a soft error reduction algorithm for the expander based codes of Alon-Bruck-Naor-Naor-Roth when concatenated with any binary code.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130527949","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}
Pub Date : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797529
B. Sadler, Ning Liu, Zhengyuan Xu, R. Kozick
We consider source geolocation based on range estimates from sensors with known coordinates. In a fading propagation environment, where a line-of-sight (LOS) path may be weak or essentially nonexistent, range estimates may have positive biases. We study this problem by considering a weighted least squares (WLS) location estimator, based on noisy range estimates, each of which is contaminated by additive Gaussian noise and possibly a positive bias. We derive the mean and mean-square error (MSE) of the WLS estimator, showing that in general the estimator produces biased estimates. The error expressions are developed via first-order perturbation analysis. They provide a means to study achievable localization performance, as a function of the measurement bias and variance, as well as the sensor network geometry.
{"title":"Range-based geolocation in fading environments","authors":"B. Sadler, Ning Liu, Zhengyuan Xu, R. Kozick","doi":"10.1109/ALLERTON.2008.4797529","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797529","url":null,"abstract":"We consider source geolocation based on range estimates from sensors with known coordinates. In a fading propagation environment, where a line-of-sight (LOS) path may be weak or essentially nonexistent, range estimates may have positive biases. We study this problem by considering a weighted least squares (WLS) location estimator, based on noisy range estimates, each of which is contaminated by additive Gaussian noise and possibly a positive bias. We derive the mean and mean-square error (MSE) of the WLS estimator, showing that in general the estimator produces biased estimates. The error expressions are developed via first-order perturbation analysis. They provide a means to study achievable localization performance, as a function of the measurement bias and variance, as well as the sensor network geometry.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130666101","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}
Pub Date : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797748
R. Tandon, S. Ulukus
We obtain a new upper bound on the capacity of a class of discrete memoryless relay channels. For this class of relay channels, the relay observes an i.i.d. sequence T, which is independent of the channel input X. The channel is described by a set of probability transition functions p(y|x, t) for all (x, t, y) isin X times T times Y. Furthermore, a noiseless link of finite capacity R0 exists from the relay to the receiver. Although the capacity for these channels is not known in general, the capacity of a subclass of these channels, namely when T = g(X, Y ), for some deterministic function g, was obtained in Kim (2008) and it was shown to be equal to the cut-set bound. Another instance where the capacity was obtained was in Aleksic et al. (2007), where the channel output Y can be written as Y = X oplus Z, where oplus denotes modulo-m addition, Z is independent of X, |X| = |Y| = m, and T is some stochastic function of Z. The compress-and-forward (CAF) achievability scheme (Cover and Gamal, 1979) was shown to be capacity achieving in both cases. Using our upper bound we recover the capacity results of Kim, and Aleksic et al. We also obtain the capacity of a class of channels which does not fall into either of the classes studied in Kim, and Aleksic et al. For this class of channels, CAF scheme is shown to be optimal but capacity is strictly less than the cut-set bound for certain values of R0. We further illustrate the usefulness of our bound by evaluating it for a particular relay channel with binary multiplicative states and binary additive noise for which the channel is given as Y = TX +N. We show that our upper bound is strictly better than the cut-set upper bound for certain values of R0 but it lies strictly above the rates yielded by the CAF achievability scheme.
得到了一类离散无记忆中继信道容量的一个新的上界。对于这类中继信道，中继观察到一个独立于信道输入x的iid序列T，对于x乘以T乘以y中的所有(x, T, y)，信道用一组概率转移函数p(y|x, T)来描述，并且从中继到接收端存在一个有限容量R0的无噪声链路。虽然这些通道的容量通常是未知的，但在Kim(2008)中获得了这些通道的一个子类的容量，即当T = g(X, Y)时，对于某些确定性函数g，它被证明等于切集界。另一个获得容量的例子是Aleksic et al.(2007)，其中通道输出Y可以写成Y = X oplus Z，其中oplus表示模m加法，Z与X无关，|X| = |Y| = m, T是Z的某个随机函数。压缩转发(CAF)可达性方案(Cover and Gamal, 1979)被证明在两种情况下都能实现容量。利用我们的上界，我们恢复了Kim和Aleksic等人的容量结果。我们还获得了一类通道的容量，它不属于Kim和Aleksic等人研究的任何一类。对于这类信道，证明了CAF方案是最优的，但对于某些R0值，容量严格小于切集界。我们通过对具有二进制乘性状态和二进制加性噪声的特定中继信道(其中信道给定为Y = TX +N)进行评估来进一步说明我们的界的有用性。我们证明，对于某些R0值，我们的上界严格优于切集上界，但它严格高于CAF可实现方案产生的率。
{"title":"A new upper bound on the capacity of a class of primitive relay channels","authors":"R. Tandon, S. Ulukus","doi":"10.1109/ALLERTON.2008.4797748","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797748","url":null,"abstract":"We obtain a new upper bound on the capacity of a class of discrete memoryless relay channels. For this class of relay channels, the relay observes an i.i.d. sequence T, which is independent of the channel input X. The channel is described by a set of probability transition functions p(y|x, t) for all (x, t, y) isin X times T times Y. Furthermore, a noiseless link of finite capacity R0 exists from the relay to the receiver. Although the capacity for these channels is not known in general, the capacity of a subclass of these channels, namely when T = g(X, Y ), for some deterministic function g, was obtained in Kim (2008) and it was shown to be equal to the cut-set bound. Another instance where the capacity was obtained was in Aleksic et al. (2007), where the channel output Y can be written as Y = X oplus Z, where oplus denotes modulo-m addition, Z is independent of X, |X| = |Y| = m, and T is some stochastic function of Z. The compress-and-forward (CAF) achievability scheme (Cover and Gamal, 1979) was shown to be capacity achieving in both cases. Using our upper bound we recover the capacity results of Kim, and Aleksic et al. We also obtain the capacity of a class of channels which does not fall into either of the classes studied in Kim, and Aleksic et al. For this class of channels, CAF scheme is shown to be optimal but capacity is strictly less than the cut-set bound for certain values of R0. We further illustrate the usefulness of our bound by evaluating it for a particular relay channel with binary multiplicative states and binary additive noise for which the channel is given as Y = TX +N. We show that our upper bound is strictly better than the cut-set upper bound for certain values of R0 but it lies strictly above the rates yielded by the CAF achievability scheme.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130785692","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}
Pub Date : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797750
M. Franceschetti, M. Migliore, P. Minero
It is shown from first principles and without relying on stochastic fading channel models that the number of spatial degrees of freedom of wireless networks can in principle grow linearly with the number of nodes, provided that the network is surrounded by a rich scattering environment. Hence, linear capacity scaling is physically possible in certain three dimensional geometries. However, it is also noted that these geometric configurations provide a physical possibility, but might be far from practical reality.
{"title":"The degrees of freedom of wireless networks: information-theoretic and physical limits","authors":"M. Franceschetti, M. Migliore, P. Minero","doi":"10.1109/ALLERTON.2008.4797750","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797750","url":null,"abstract":"It is shown from first principles and without relying on stochastic fading channel models that the number of spatial degrees of freedom of wireless networks can in principle grow linearly with the number of nodes, provided that the network is surrounded by a rich scattering environment. Hence, linear capacity scaling is physically possible in certain three dimensional geometries. However, it is also noted that these geometric configurations provide a physical possibility, but might be far from practical reality.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132157213","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：