2010 IEEE Global Telecommunications Conference GLOBECOM 2010最新文献_第9页

Neighbor-Cooperative Measurement of Network Path Quality 网络路径质量的邻居合作测量

2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5684138

R. Chang, W. Fok, Weichao Li, Edmond W. W. Chan, Xiapu Luo

引用次数: 3

Iterative Primal-Dual Scaled Gradient Algorithm with Dynamic Scaling Matrices for Solving Distributive NUM over Time-Varying Fading Channels 基于动态缩放矩阵的迭代原始-对偶缩放梯度算法求解时变衰落信道上的分布NUM

2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683847

Yong Cheng, V. Lau

引用次数: 3

Energy-Efficient Power Loading for a MIMO-SVD System and Its Performance in Flat Fading MIMO-SVD系统的节能负载及其平衰落性能

2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683485

R. Prabhu, B. Daneshrad

{"title":"Energy-Efficient Power Loading for a MIMO-SVD System and Its Performance in Flat Fading","authors":"R. Prabhu, B. Daneshrad","doi":"10.1109/GLOCOM.2010.5683485","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683485","url":null,"abstract":"In this paper we formulate a power loading problem for the spatial subchannels (parallel channels) of a single-carrier MIMO-SVD system. The power loading solution is designed to minimize the energy-per-goodbit (EPG) of the MIMO-SVD system. The optimum power loading obtained by solving a nonlinear fractional program, has a closed-form expression and is found by applying a water-filling procedure. It is observed that the optimum total transmit power (water level) depends not only on the MIMO channel realization, but also on the ratio of circuit power cost (which depends on the number of antennas) to transmit power cost (which depends on path loss and other factors). We study the statistical performance (using simulation) of the solution in Rayleigh and Rician flat-fading channels. Using outage EPG as a measure of performance, we determine the MIMO configuration (from a set of allowed configurations) that yields the minimum outage EPG. It is observed that the average number of spatial subchannels utilized (which indicates preference for diversity or multiplexing) depends on the ratio of circuit power cost to transmit power cost and fading type (Rayleigh or Rician). For both cases, the results show that both multiplexing and diversity obtained by MIMO systems are critical for energy efficiency.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"2 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83950077","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}

引用次数: 70

Flash Coding Scheme Based on Error-Correcting Codes 基于纠错码的Flash编码方案

2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683364

Qin Huang, Shu Lin, K. Abdel-Ghaffar

引用次数: 0

Anonymous Certification Services 匿名认证服务

2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5684246

Dijiang Huang

引用次数: 5

A Probabilistic Approach for Improving TCP Fairness across Multiple Contending WLANs 一种提高多个竞争wlan间TCP公平性的概率方法

2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5684170

Ming Zhang, S. Alam, Shigang Chen, Jianwei Liu

{"title":"A Probabilistic Approach for Improving TCP Fairness across Multiple Contending WLANs","authors":"Ming Zhang, S. Alam, Shigang Chen, Jianwei Liu","doi":"10.1109/GLOCOM.2010.5684170","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5684170","url":null,"abstract":"Contention among multiple nearby WLANs in urban areas may cause severe TCP unfairness, where some TCP flows can achieve very high throughput at the expense of starving others. This unfairness results from the fact that different physical nodes conveying TCP flows at a wireless bottleneck may have different channel observations and consequently they may provide inconsistent feedbacks to the TCP sources. Existing solutions to this problem try to synchronize channel observations of contending nodes by exchanging control messages among them. They rely on the assumption that these nodes are within each other''s transmission range, which however may not always hold. In this paper, we propose a new approach, called Wireless Probabilistic Drop (WPD), to improve TCP fairness without requiring direct communication among nodes. In WPD, when a node detects congestion, it probabilistically chooses to either drop some packets to resolve the congestion, or aggressively spread the congestion signal to other contending nodes. Each node makes the choice with a probability that is proportional to its flow rate. Henceforth, high-rate flows tend to perform rate reduction more often, and low-rate flows are more likely to increase their flow rates. Eventually, all flows passing the bottleneck are expected to get a fair share of the channel bandwidth. Extensive simulations in ns-2 demonstrate that WPD can significantly improve fairness among TCP flows across multiple contending WLANs.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"21 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82866990","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

Lifetime Extending Heuristic for Clustered Wireless Sensor Networks 集群无线传感器网络生命周期扩展启发式算法

2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683455

K. Law, Barnabas C. Okeke

引用次数: 8

Investigating Scaling Behavior of End-to-End Delay 端到端延迟的扩展行为研究

2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683107

Hanlin Sun, Yuehui Jin, Yidong Cui, Shiduan Cheng

引用次数: 0

Adaptive Multi-Code Chaos-Based CDMA with Unequal Error Protection Using Reduced Support Vector Machine 基于约简支持向量机的非等错误保护自适应多码混沌CDMA

2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683673

J. Kao, S. Berber, V. Kecman

引用次数: 2

Approximated Calculations of Connection Level Access Waiting Time Distribution in OFDMA-Based Wireless Cellular Systems with AMC 基于AMC的ofdma无线蜂窝系统连接级接入等待时间分布的近似计算

2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683133

Ruben P. Murillo-Perez, C. B. Rodríguez-Estrello, F. A. Cruz-Pérez

{"title":"Approximated Calculations of Connection Level Access Waiting Time Distribution in OFDMA-Based Wireless Cellular Systems with AMC","authors":"Ruben P. Murillo-Perez, C. B. Rodríguez-Estrello, F. A. Cruz-Pérez","doi":"10.1109/GLOCOM.2010.5683133","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683133","url":null,"abstract":"In this paper, two analytical approaches to approximately calculate the access (at connection level) waiting time distribution for an OFDMA-based wireless cellular system with finite buffering under First-Come, First-Served (FCFS) discipline and Adaptive Modulation and Coding (AMC) are proposed. It has been demonstrated in previous published works that access waiting time is a random sum of random variables with the same distribution but random mean. Therefore, the computational complexity for the numerical evaluation of the access waiting time probability distribution increases exponentially with the size of the buffer and the number of coverage regions. In order to reduce the computational complexity, the use of negative exponential distribution is proposed to approximate the whole access waiting time distribution for certain conditions of traffic load. Moreover, an efficient way to calculate its parameter through the Little's theorem is proposed. A more general approach is based on the central limit theorem (CLT). In particular, it considers that the conditional access waiting time of a service request queued in the a given position can be adequately approximated by a Gaussian distribution. The proposed approximation approaches are numerically evaluated and compared against the exact mathematical analysis in terms of the cumulative distribution function. Numerical results show that the maximum percentage error between the both approximated CDFs is smaller than 10% relative to the exact analysis under certain conditions.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"13 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86791640","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