Desmond W. H. Cai, Tony Q. S. Quek, C. Tan, S. Low
{"title":"Max-min weighted SINR in coordinated multicell MIMO downlink","authors":"Desmond W. H. Cai, Tony Q. S. Quek, C. Tan, S. Low","doi":"10.1109/WIOPT.2011.5930029","DOIUrl":"https://doi.org/10.1109/WIOPT.2011.5930029","url":null,"abstract":"This paper studies the optimization of a multicell multiple-input-single-output (MISO) downlink system in which each base station serves multiple users, and each user is served by only one base station. First, we consider the problem of maximizing the minimum weighted signal-to-interference-plus-noise ratio (SINR) of all users subject to a single weighted-sum power constraint, where the weights can represent relative power costs of serving different users in each cell. We apply concave Perron-Frobenius theory to propose a joint power control and linear beamforming algorithm which converges geometrically fast to the optimal solution. As a by-product, we resolve an open problem of convergence of a previously proposed algorithm by Wiesel, Eldar, and Shamai in 2006. Next, we study the max-min weighted SINR problem subject to multiple weighted-sum power constraints and we show that it can be decoupled into its associated single-constrained subproblems.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129502715","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":"Distributed function computation in networks: A joint delay-energy perspective","authors":"N. Karamchandani, M. Franceschetti","doi":"10.1109/WIOPT.2011.5930069","DOIUrl":"https://doi.org/10.1109/WIOPT.2011.5930069","url":null,"abstract":"This paper considers the following network computation problem: n nodes are placed on a √n×√n grid, each node is connected to every other node within distance r(n) from itself, and is given an arbitrary input bit. Nodes communicate with each other so that finally a designated sink node can compute a target function f of the input bits. We focus on computing the identity function and the class of symmetric functions under two different communication models. We first consider a noiseless model where links are independent and noise-free, suitable for modeling wired networks. Next, we study a noisy broadcast model in which when a node transmits a bit, each of its neighbors receives a noisy copy of the bit. This is a simple model for wireless communications, originally proposed by El Gamal (1987). We use the protocol model for interference and nodes which do not share neighbors are allowed to transmit simultaneously. For every connection radius r(n), we present lower bounds on the minimum number of transmissions and the minimum number of time slots required to compute f. We then describe efficient protocols which can match both these lower bounds up to a constant factor.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122698857","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":"Joint routing, scheduling, and network coding for wireless multihop networks","authors":"S. Shabdanov, C. Rosenberg, P. Mitran","doi":"10.1109/WIOPT.2011.5930037","DOIUrl":"https://doi.org/10.1109/WIOPT.2011.5930037","url":null,"abstract":"This paper presents a study on achievable throughput in wireless multihop networks with unicast flows that use XOR-like network coding. A joint routing, scheduling, and network coding problem is formulated under a realistic signal to interference plus noise ratio interference model. This formulation provides a mathematical framework to study the achievable throughput of a given wireless network for a given utility function. We optimally solve it for max-min throughput in small to medium size networks by developing an efficient computation tool. Our numerical results show that throughput gains can be obtained at low transmission powers by using simple XOR-like network coding in a mesh-like network provided it is optimally configured in terms of routing, scheduling, and network coding but that they are only significant (i.e., greater than 15%) for some special cases. We also compute max-min throughput by restricting network coding to some key nodes or flows to quantify key conditions that provide a significant portion of gains.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122686103","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":"Ergodic spatial throughput of wireless ad hoc networks with Markovian fading channels","authors":"Chun-Hung Liu, J. Andrews","doi":"10.1109/WIOPT.2011.5930042","DOIUrl":"https://doi.org/10.1109/WIOPT.2011.5930042","url":null,"abstract":"Most work on wireless network throughput ignore the temporal correlation inherent to wireless channels, due to trouble with tractability. In order to better capture the temporal variations of wireless network throughput, this paper introduces the metric of ergodic spatial throughput (EST), which includes spatial and temporal ergodicity. All transmitters in the network form a stationary Poisson point process and all channels are modeled by a finite state Markov chain. The bounds on EST are characterized, and their scaling behaviors for a sparse and dense network are discussed. From these results, we show that the EST can be characterized by the inner product of the channel state vector and the invariant probability vector of the Markov chain. This indicates that channel-aware opportunistic transmission (CAOT) may not always increase the EST.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124014462","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":"Random access in coded wireless packet networks: Feasibility and distributed optimization","authors":"Maximilian Riemensberger, W. Utschick","doi":"10.1109/WIOPT.2011.5930001","DOIUrl":"https://doi.org/10.1109/WIOPT.2011.5930001","url":null,"abstract":"We study the throughput region of random access in coded wireless packet networks. We propose a distributed and robust fixed point algorithm that determines whether given coded information flow requirements are feasible with random access and computes the minimal required attempt probabilities supporting these requirements. Combined with linear coding subgraph and flow optimization, this yields a distributed algorithm for joint network coding and random access optimization for multicast networks. Numerical examples show that the proposed method reduces the gap of existing approaches to the optimal solution significantly.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126459082","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":"Competition and cooperation in wireless access misbehavior","authors":"I. Koutsopoulos","doi":"10.1109/WIOPT.2011.5930027","DOIUrl":"https://doi.org/10.1109/WIOPT.2011.5930027","url":null,"abstract":"With the proliferation of access points and terminals, wireless access misbehavior emerges as important means of protocol misuse, whereby network entities aim at obtaining higher channel share than the one in legitimate operation. We consider the instantiation of misbehavior in the back-off mechanism in IEEE 802.11. First, we study the competition between two malicious entities that affect each other. Each entity has some private target gain in terms of access probability and attempts to misuse the protocol to its benefit so as to prolong the time until detection. We derive conditions for existence of the unique Nash Equilibrium Point (NEP). This is influenced by attacker gains and topology parameters that capture the level of contention from neighboring nodes. These quantities need to be small in order for the NEP to exist. Next, we consider simple types of cooperation between attackers that aim at alleviating the contention caused to each other.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116859394","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":"Spatial inefficiency of MaxWeight scheduling","authors":"P. Ven, S. Borst, Lei Ying","doi":"10.1109/WIOPT.2011.5930066","DOIUrl":"https://doi.org/10.1109/WIOPT.2011.5930066","url":null,"abstract":"MaxWeight scheduling has gained enormous popularity as a powerful paradigm for achieving queue stability and maximum throughput in a wide variety of scenarios. The maximum-stability guarantees however rely on the fundamental premise that the system consists of a fixed set of flows with stationary ergodic traffic processes. In the present paper we examine networks where the population of active flows varies over time, as flows eventually end while new flows occasionally start. We show that MaxWeight policies may fail to provide maximum stability due to persistent inefficient spatial reuse. The intuitive explanation is that these policies tend to serve flows with large backlogs, even when the resulting spatial reuse is not particularly efficient, and fail to exploit maximum spatial reuse patterns involving flows with smaller backlogs. These results indicate that instability of MaxWeight scheduling can occur due to spatial inefficiency in networks with fixed transmission rates, which is fundamentally different from the inability to fully exploit time-varying rates shown in prior work. We discuss how the potential instability effects can be countered by spatial traffic aggregation, and describe some of the associated challenges and performance trade-offs.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114636084","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":"Iterative equalization enhanced high data rate in wireless communication networks","authors":"G. Oletu, P. Rapajic, T. Eneh, K. Anang","doi":"10.1109/WIOPT.2011.5930044","DOIUrl":"https://doi.org/10.1109/WIOPT.2011.5930044","url":null,"abstract":"There has been a demand for high data rate for wireless communication system devices, mainly mobile multimedia applications. This paper investigates the suitability of Turbo Equalization as a means of achieving low bit error rate in the future high data communication systems. Turbo equalization is an approach to coded data transmission over channels with Inter-symbol interference (ISI) which can yield additional improvement in bit error rate. The paper demonstrates that at higher modulation scheme using iterative equalization method, high date rate can be achieved. The performance evaluation shows that turbo equalization is beneficial for higher modulation and thereby increase data rate with a reasonable complexity.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114970728","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}
Yi Jiang, Yan Zhou, Mohit Anand, Farhad Meshkati, V. Chande, Norman Ko, M. Yavuz
{"title":"Benefits of transmit and receive diversity in enterprise femtocell deployments","authors":"Yi Jiang, Yan Zhou, Mohit Anand, Farhad Meshkati, V. Chande, Norman Ko, M. Yavuz","doi":"10.1109/WIOPT.2011.5930063","DOIUrl":"https://doi.org/10.1109/WIOPT.2011.5930063","url":null,"abstract":"In this paper, we study the benefits of transmit and receive diversity for enterprise UMTS femtocell deployments. Indoor enterprise femtocell deployments face a single-path slow fading wireless environment that may lead to frequent hard handovers in the boundary region of neighboring femtocells and consequent degradation in the voice quality experienced by the users. In the absence of soft-handover (SHO) support, transmit diversity at the femtocell can combat single-path fading channel. We demonstrate through over-the-air tests that transmit diversity is very effective in reducing the number of hard handovers and therefore results in significant improvement in voice quality for enterprise users. On the uplink, we study system stability using an analytical approach. We derive analytical conditions for system stability with and without receive diversity at the femtocells. Using this analytical framework, benefits of receive diversity in maintaining system stability and preventing uplink power racing between neighboring femtocells are quantified. It is shown that, in the absence of SHO, receive diversity is very effective in maintaining system stability by preventing potential uplink power racing caused by inter-femto interference.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"394 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115568284","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":"Impact of time-correlated arrivals on the performance of backpressure-based stochastic network control","authors":"Jeongho Jeon, A. Ephremides","doi":"10.1080/15427951.2012.665782","DOIUrl":"https://doi.org/10.1080/15427951.2012.665782","url":null,"abstract":"In this paper, we consider the backpressure-based control for wireless multihop networks with time-correlated arrivals. The arrival process considered in this work is fairly general in the sense that it may exhibit long-range dependence depending on the asymptotic shape of the autocorrelation function. We first show that the original backpressure policy is still throughput-optimal even with correlated arrivals if the autocorrelation functions are monotonically decreasing. The resulting upper bound on average network delay is expressed in terms of the autocorrelation parameters. After that, we extend our model to include the case where the arrival rate vector is possibly outside the stability region and take the method of joint flow control and backpressure policy that is known to perform arbitrarily close to the utility-optimal throughput point with a corresponding tradeoff in average network delay. The effect of correlated arrivals appears again in the tradeoff in terms of the autocorrelation parameters.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121065775","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}