{"title":"Diversity and Multiplexing Tradeoff in General Fading Channels","authors":"Lei Zhao, W. Mo, Yao Ma, Zhengdao Wang","doi":"10.1109/TIT.2007.892777","DOIUrl":"https://doi.org/10.1109/TIT.2007.892777","url":null,"abstract":"The optimal tradeoff between diversity gain and multiplexing gain for multiple-input multiple-output (MIMO) channels has been studied recently under the independently identically distributed (i.i.d) Rayleigh fading assumption. In this paper, we extend the results and derive the optimal tradeoff performance for a general fading channel setup with generic probability density functions for channel coefficients, which includes many known models as special cases. The effects of non-identical distribution, correlation and non-zero channel means are also treated.","PeriodicalId":219370,"journal":{"name":"2006 40th Annual Conference on Information Sciences and Systems","volume":"46 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121002143","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}
{"title":"Energy Aware Power Allocation strategies for Multihop-Cooperative transmission schemes","authors":"S. Savazzi, U. Spagnolini","doi":"10.1109/JSAC.2007.070208","DOIUrl":"https://doi.org/10.1109/JSAC.2007.070208","url":null,"abstract":"This paper deals with a cooperative decoded relaying scheme in multihop wireless network and the corresponding transmitters power allocation strategies for nodes belonging to a single primary route towards a destination. The proposed transmission strategy is referred as multihop cooperative transmission chain (MCTC). The MCTC is based on the relays of the same message by multiple previous terminals along the route and on their linear combination at the receiver to maximize the multihop diversity. Power allocations among transmitting nodes in the route can be obtained according to the average (not instantaneous) node-to-node attenuation using a recursive power assignment that can be employed locally with minimal signalling exchange among nodes. In this paper the MCTC with selection combining strategy at receivers and power assignment that maximize the minimum spread of received power (min-max strategy) is able to better exploit the multihop diversity. In addition, for ad hoc network where the energy of each node is an issue, the MCTC considerably increases the network lifetime when compared to non-cooperative multihop schemes.","PeriodicalId":219370,"journal":{"name":"2006 40th Annual Conference on Information Sciences and Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129748071","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}
{"title":"Network Protocols Designed for Optimizability","authors":"J. Rexford","doi":"10.1109/CISS.2006.286491","DOIUrl":"https://doi.org/10.1109/CISS.2006.286491","url":null,"abstract":"Designing a communication network is a challenging task that requires selecting a network topology, as well as specific protocols and mechanisms, to meet current and future demands. Equally daunting, managing the network requires tuning these protocols and mechanisms over time in response to changing constraints and conditions. However, the protocols underlying today's data networks, such as the Internet, were not designed with manageability in mind. As a result, managing these networks is, at best, a black art practiced by an increasingly overwhelmed community of engineers. Optimization tools can help the operators tune the protocol configuration and diagnose performance problems, based on measurements of the underlying network. However, many of the existing protocols were not designed with optimization in mind, leading to computationally difficult optimization problems even for the simplest of objective functions. In this position paper, we argue that future protocols should be designed with optimization in mind from the beginning, to simplify the process of configuring the protocols and diagnosing performance problems.","PeriodicalId":219370,"journal":{"name":"2006 40th Annual Conference on Information Sciences and Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116772415","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}
{"title":"Scheduling with Rate and Duty-Cycle Constraints for Wireless Networks over an Interference Channel","authors":"R. Kannan, Shuangqing Wei","doi":"10.1109/CISS.2006.286680","DOIUrl":"https://doi.org/10.1109/CISS.2006.286680","url":null,"abstract":"We consider the problem of finding a minimum energy transmission schedule for duty-cycle and rate constrained nodes transmitting over a AWGN interference channel. Since traditional optimization methods using Lagrange multipliers do not work well and are computationally expensive given the non-convex constraints, we develop polynomial time approximation schemes for finding optimal rate and duty-cycle constrained energy schedule by considering a restricted version of the problem using discrete power levels. We first show a simple dynamic programming solution that optimally solves the restricted problem using two fixed power levels. We then find a 2-factor approximation to the problem of finding the optimal fixed power level that generates the optimal (minimum) energy schedule. We then develop a (2,beta)-FPAS (fully polynomial time approximation scheme) for the problem that approximates the optimal power consumption and rate constraints to within factors of 2 and arbitrarily close beta, respectively. The running time of the FPAS is polynomial in 1/beta.","PeriodicalId":219370,"journal":{"name":"2006 40th Annual Conference on Information Sciences and Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117028589","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}
A. Fletcher, S. Rangan, V. K. Goyal, K. Ramchandran
{"title":"Causal and Strictly Causal Estimation for Jump Linear Systems: An LMI Analysis","authors":"A. Fletcher, S. Rangan, V. K. Goyal, K. Ramchandran","doi":"10.1109/CISS.2006.286665","DOIUrl":"https://doi.org/10.1109/CISS.2006.286665","url":null,"abstract":"Jump linear systems are linear state-space systems with random time variations driven by a finite Markov chain. These models are widely used in nonlinear control, and more recently, in the study of communication over lossy channels. This paper considers a general jump linear estimation problem of estimating an unknown signal from an observed signal, where both signals are described as outputs of a jump linear system. A bound on the minimum achievable estimation error in terms of linear matrix inequalities (LMIs) is presented, along with a simple jump linear estimator that achieves this bound. While previous analysis has considered only the strictly causal estimation problem, this work presents both strictly causal and causal solutions.","PeriodicalId":219370,"journal":{"name":"2006 40th Annual Conference on Information Sciences and Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125927788","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}
{"title":"On Randomly Evolving Email Networks","authors":"Chaopin Zhu, A. Kuh","doi":"10.1109/CISS.2006.286593","DOIUrl":"https://doi.org/10.1109/CISS.2006.286593","url":null,"abstract":"In this paper we study randomly evolving Email networks. We extend previous work where we analyzed Email networks with deterministic parameter settings to the case where these parameters are now random variables. These new models are analyzed using Markov chains with random transition probabilities. When each link of every node has the same random parameter settings and independent Poisson traffic the in-degree distribution and the out-degree distribution of this network behave similarly to random graph networks and scale-free networks respectively. These results show that our models of evolving networks provide good models for real networks and exhibit properties of random graph networks and scale-free networks.","PeriodicalId":219370,"journal":{"name":"2006 40th Annual Conference on Information Sciences and Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123276378","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}
Michael Bailey, Evan Cooke, F. Jahanian, Andrew Myrick, Sushant Sinha
{"title":"Practical Darknet Measurement","authors":"Michael Bailey, Evan Cooke, F. Jahanian, Andrew Myrick, Sushant Sinha","doi":"10.1109/CISS.2006.286376","DOIUrl":"https://doi.org/10.1109/CISS.2006.286376","url":null,"abstract":"The Internet today is beset with constant attacks targeting users and infrastructure. One popular method of detecting these attacks and the infected hosts behind them is to monitor unused network addresses. Because many Internet threats propagate randomly, infection attempts can be captured by monitoring the unused spaces between live addresses. Sensors that monitor these unused address spaces are called darknets, network telescopes, or blackholes. They capture important information about a diverse range of threats such as Internet worms, denial of services attacks, and botnets. In this paper, we describe and analyze the important measurement issues associated with deploying darknets, evaluating the placement and service configuration of darknets, and analyzing the data collected by darknets. To support the discussion, we leverage 4 years of experience operating the Internet motion sensor (IMS), a network of distributed darknet sensors monitoring 60 distinct address blocks in 19 organizations over 3 continents.","PeriodicalId":219370,"journal":{"name":"2006 40th Annual Conference on Information Sciences and Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123296803","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}
{"title":"A Wiring-Efficient, High-Throughput Low Density Parity Check Decoder Design","authors":"R. Zarubica, S. G. Wilson","doi":"10.1109/CISS.2006.286580","DOIUrl":"https://doi.org/10.1109/CISS.2006.286580","url":null,"abstract":"A high-throughput 1020-bit rate-1/2 low density parity check (LDPC) decoder design is proposed that matches the coding gain of current LDPC decoders. The decoder features wiring-efficient code design and an unwrapping technique that allows us to trade between size and the throughput of a decoder.","PeriodicalId":219370,"journal":{"name":"2006 40th Annual Conference on Information Sciences and Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123436101","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}
{"title":"Nested codes with multiple interpretations","authors":"Lei Xiao, T. Fuja, J. Kliewer, D. Costello","doi":"10.1109/CISS.2006.286586","DOIUrl":"https://doi.org/10.1109/CISS.2006.286586","url":null,"abstract":"This paper proposes a new approach to channel code design for wireless network applications. The resulting nested codes can be decoded at different effective rates by different receivers-rates that depend on the prior knowledge possessed by each receiver; we say these codes have multiple interpretations. We have identified several applications in wireless networks where this property is useful. Specific nested code constructions as well as efficient soft and hard decision decoding algorithms are described. The concept of a nested code with multiple interpretations provides flexibility in the design of error protection schemes for multi-terminal wireless networks.","PeriodicalId":219370,"journal":{"name":"2006 40th Annual Conference on Information Sciences and Systems","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125402542","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}
{"title":"QoS-Driven Power and Rate Adaptation for Multicarrier Communications Over Mobile Wireless Networks","authors":"Jia Tang, Xi Zhang","doi":"10.1109/CISS.2006.286486","DOIUrl":"https://doi.org/10.1109/CISS.2006.286486","url":null,"abstract":"We propose a quality-of-service (QoS) driven power and rate adaptation scheme for multicarrier communications systems over mobile wireless networks. By integrating information theory with the concept of effective capacity, our proposed scheme aims at maximizing the system throughput subject to a given delay-QoS constraint. Under the framework of convex optimization, we develop the optimal adaptation algorithms. Our analytical analyses identify an important fact that when the QoS constraint becomes loose, the optimal power-control policy converges to the well-known water-filling scheme, where the Shannon capacity can be achieved. On the other hand, when the QoS constraint gets stringent, the optimal policy converges to the scheme which operates at a constant-rate, where, by using only a limited number of subchannels, the above constant-rate is close to the Shannon capacity. This observation implies that in contrast to single-channel transmission, which trades off the throughput for the QoS provisioning, the multicarrier communications can realize both the high throughput and the stringent QoS at the same time. For instance, our simulation results indicate that by using 64 independent subchannels, our proposed algorithms can achieve more than 99% of the Shannon capacity, while guaranteeing a constant-rate transmission.","PeriodicalId":219370,"journal":{"name":"2006 40th Annual Conference on Information Sciences and Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121865176","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}