2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)最新文献_第10页

Fair distributed user-traffic association in cache equipped cellular networks 配备高速缓存的蜂窝网络中的公平分布式用户流量关联

2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) Pub Date : 2016-10-12 DOI: 10.23919/WIOPT.2017.7959862

J. Krolikowski, A. Giovanidis, M. Renzo

{"title":"Fair distributed user-traffic association in cache equipped cellular networks","authors":"J. Krolikowski, A. Giovanidis, M. Renzo","doi":"10.23919/WIOPT.2017.7959862","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959862","url":null,"abstract":"Caching of popular content on wireless nodes is recently proposed as a means to reduce congestion in the backbone of cellular networks and to improve Quality of Service. From a network point of view, the goal is to offload as many users as possible from the backbone network to the wireless caches while at the same time offering good service to cache-unrelated users. Aggressive offloading can lead to an unbalanced user association. Some wireless nodes can be overloaded by cache-related traffic while the resources of others remain underused. Given a fixed content placement, this work proposes an efficient distributed algorithm to control and balance the association of cache-related traffic among cellular cache memories. The algorithm allows the network to achieve the globally optimal solution and can be executed on base stations using a limited amount of information exchange between them. It is based on a novel algorithm we call Bucket-filling. The solution limits the cache-users per node by balancing the total load among the nodes in a fair way. The improvement compared to common user assignment policies is highlighted for single-as well as for multi-tier random networks.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"28 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2016-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73447056","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}

引用次数: 6

Backlog-based random access in wireless networks: Fluid limits and instability issues 无线网络中基于积压的随机访问:流体限制和不稳定性问题

2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) Pub Date : 2012-05-14 DOI: 10.1109/CISS.2012.6310763

Javad Ghaderiy, Sem Borstz, Phil Whitingz

{"title":"Backlog-based random access in wireless networks: Fluid limits and instability issues","authors":"Javad Ghaderiy, Sem Borstz, Phil Whitingz","doi":"10.1109/CISS.2012.6310763","DOIUrl":"https://doi.org/10.1109/CISS.2012.6310763","url":null,"abstract":"Backlog-based wireless access schemes are simple and inherently distributed, yet provide a striking capability to match the optimal throughput performance of centralized scheduling mechanisms in a wide range of scenarios. Unfortunately, the type of activation rules for which throughput optimality has been established, may result in excessive backlogs and delays. The use of more aggressive/persistent access schemes than these can improve the delay performance, but does not offer any universal maximum-stability guarantees. Motivated by the above issues, we use fluid limits to explore the (in)stability properties of backlog-based random-access algorithms. Such fluid limits have varying qualitative properties, dependent on the specific scenario, ranging from ones with smooth deterministic features, to others which exhibit random oscillatory characteristics. It turns out that more aggressive access schemes continue to provide maximum stability in some networks, e.g. complete interference graphs. As we show however, in other topologies such schemes can drive the system into inefficient states and thus cause instability. Simulation experiments are conducted to illustrate and validate the analytical results.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"1 1","pages":"15-22"},"PeriodicalIF":0.0,"publicationDate":"2012-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73439953","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}

引用次数: 9

Throughput optimal switching in multi-channel WLANs 多信道无线局域网的吞吐量最优交换

2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) Pub Date : 2011-05-09 DOI: 10.1109/WIOPT.2011.5930049

Qingsi Wang, M. Liu

引用次数: 5

Cooperation at the network level 网络层面的合作

2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) Pub Date : 2009-06-23 DOI: 10.1109/WIOPT.2009.5291555

A. Ephremides

引用次数: 0

Where is the action in information theory 信息论中的行动在哪里

2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) Pub Date : 2009-06-23 DOI: 10.1109/WIOPT.2009.5291550

T. Weissman

引用次数: 0

Lifting the curse of dimensionality: a random matrix-theoretic approach 解除维数的诅咒:一种随机矩阵理论方法

2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) Pub Date : 2009-06-23 DOI: 10.1109/WIOPT.2009.5291553

T. Marzetta

{"title":"Lifting the curse of dimensionality: a random matrix-theoretic approach","authors":"T. Marzetta","doi":"10.1109/WIOPT.2009.5291553","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291553","url":null,"abstract":"The ubiquity of inexpensive sensors implies that we can measure vector-valued data of ever increasing dimension. But the number of independent measurements of the data vector is limited so the sample covariance matrix is usually singular. The traditional remedy for singularity is diagonal loading - the addition of a small identity matrix to make the covariance estimate invertible. An alternative to diagonal loading is to reduce the dimension of the data vectors to be smaller than the number of independent observations through an ensemble of isotropically random (Haar measure) unitary matrices. For every member of the unitary ensemble, the shortened data vectors yield a statistically meaningful, invertible covariance estimate from which we can compute an estimate for the ultimate desired quantity. The final step is to take the expectation of this estimate with respect to the unitary ensemble. For a class of applications that includes adaptive spectral estimation, the design of a linear estimator, and supervised learning the random matrix approach results in an estimate for the inverse covariance matrix which preserves the eigenvectors of the sample covariance matrix, but alters the eigenvalues in a nontrivial manner. A closed-form expression for the expectation over the unitary ensemble eludes us, but we have obtained a tractable asymptotic expression. Preliminary numerical results indicate considerable promise for this approach.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"70 3 1","pages":"1-2"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80309110","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

Towards client-assisted management in large-scale wireless networks 面向大规模无线网络的客户端辅助管理

2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) Pub Date : 2009-06-23 DOI: 10.1109/WIOPT.2009.5291552

Suman Banerjee

引用次数: 0

Using redundancy to enable interactive communication for moving vehicles 利用冗余实现移动车辆的交互通信

2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) Pub Date : 2009-06-23 DOI: 10.1109/WIOPT.2009.5291549

Ratul Mahajan

引用次数: 0

Time and space averages in large wireless networks 大型无线网络中的时间和空间平均值

2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) Pub Date : 2009-06-23 DOI: 10.1109/WIOPT.2009.5291551

F. Baccelli

引用次数: 2

Recent progress in multiuser information theory with correlated sources 关联源多用户信息理论研究进展

2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) Pub Date : 2009-06-23 DOI: 10.1109/WIOPT.2009.5291557

V. Anantharam

引用次数: 0