2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)最新文献

筛选
英文 中文
Distributed online submodular maximization in resource-constrained networks 资源约束网络中的分布式在线子模块最大化
Andrew Clark, Basel Alomair, L. Bushnell, R. Poovendran
{"title":"Distributed online submodular maximization in resource-constrained networks","authors":"Andrew Clark, Basel Alomair, L. Bushnell, R. Poovendran","doi":"10.1109/WIOPT.2014.6850325","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850325","url":null,"abstract":"Maximization of submodular set functions arises in wireless applications such as scheduling, caching, and leader selection. For a centralized entity with oracle access to the submodular function, submodular maximization can be approximated up to a constant factor using polynomial-time algorithms; such an entity, however, may be unavailable in decentralized wireless networks. In this paper, we consider maximization of a time-varying submodular function by distributed, resource-constrained nodes. We present algorithms for unconstrained distributed submodular maximization, as well as monotone submodular maximization subject to cardinality constraints. For the unconstrained submodular maximization problem, our algorithm achieves an expected optimality gap of 1/3. For cardinality-constrained submodular maximization, our algorithm achieves an expected optimality gap of 1/2, while reducing the storage and communication overhead, as well as the computation requirements of the nodes, compared to existing techniques. We evaluate our approach through an experimental study using sensor scheduling data, and find that our approach is within ten percent of the best achievable utility in the unconstrained case and within five percent in the constrained case.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127038727","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
Cache-aware user association in backhaul-constrained small cell networks 回程约束小蜂窝网络中缓存感知的用户关联
Francesco Pantisano, M. Bennis, W. Saad, M. Debbah
{"title":"Cache-aware user association in backhaul-constrained small cell networks","authors":"Francesco Pantisano, M. Bennis, W. Saad, M. Debbah","doi":"10.1109/WIOPT.2014.6850276","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850276","url":null,"abstract":"Anticipating multimedia file requests via caching at the small cell base stations (SBSs) of a cellular network has emerged as a promising technique for optimizing the quality of service (QoS) of wireless user equipments (UEs). However, developing efficient caching strategies must properly account for specific small cell constraints, such as backhaul congestion and limited storage capacity. In this paper, we address the problem of devising a user-cell association, in which the SBSs exploit caching capabilities to overcome the backhaul capacity limitations and enhance the users' QoS. In the proposed approach, the SBSs individually decide on which UEs to service based on both content availability and on the data rates they can deliver, given the interference and backhaul capacity limitations. We formulate the problem as a one-to-many matching game between SBSs and UEs. To solve this game, we propose a distributed algorithm, based on the deferred acceptance scheme, that enables the players (i.e., UEs and SBSs) to self-organize into a stable matching, in a reasonable number of algorithm iterations. Simulation results show that the proposed cell association scheme yields significant gains, reaching up to 21% improvement compared to a traditional cell association techniques with no caching considerations.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125444865","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}
引用次数: 83
SSIM-based video admission control and resource allocation algorithms 基于sim卡的视频准入控制和资源分配算法
M. Zanforlin, D. Munaretto, A. Zanella, M. Zorzi
{"title":"SSIM-based video admission control and resource allocation algorithms","authors":"M. Zanforlin, D. Munaretto, A. Zanella, M. Zorzi","doi":"10.1109/WIOPT.2014.6850361","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850361","url":null,"abstract":"The exponential growth of video traffic in mobile networks calls for the deployment of advanced video admission control (VAC) and resource management (RM) techniques in order to provide the best quality of experience (QoE) to the end user according to the available network resources. The degradation of the QoE perceived by the user when reducing the source rate of a video typically depends on the content of the video itself. In this paper, we analyzed the QoE of a group of test video sequences encoded with H.264 advanced video codec at different rates, i.e., quality levels. The QoE is objectively expressed in terms of the average structural similarity (SSIM) index. Based on empirical results, we propose a 4-degree polynomial approximation of the SSIM as a function of the coded video rate. We hence propose to tag each video with these polynomial coefficients that provide a compact description of its specific SSIM behavior, and to use this information in VAC and RM algorithms to optimally manage a shared transmission medium. As a proof of concept, we report selected simulation results that compare QoE-aware and QoE-agnostic algorithms in a scenario with a single link shared by multiple concurrent video flows.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116079849","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}
引用次数: 28
Many-to-many matching games for proactive social-caching in wireless small cell networks 无线小型蜂窝网络中主动社交缓存的多对多匹配游戏
Kenza Hamidouche, W. Saad, M. Debbah
{"title":"Many-to-many matching games for proactive social-caching in wireless small cell networks","authors":"Kenza Hamidouche, W. Saad, M. Debbah","doi":"10.1109/WIOPT.2014.6850348","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850348","url":null,"abstract":"In this paper, we address the caching problem in small cell networks from a game theoretic point of view. In particular, we formulate the caching problem as a many-to-many matching game between small base stations and service providers' servers. The servers store a set of videos and aim to cache these videos at the small base stations in order to reduce the experienced delay by the end-users. On the other hand, small base stations cache the videos according to their local popularity, so as to reduce the load on the backhaul links. We propose a new matching algorithm for the many-to-many problem and prove that it reaches a pairwise stable outcome. Simulation results show that the number of satisfied requests by the small base stations in the proposed caching algorithm can reach up to three times the satisfaction of a random caching policy. Moreover, the expected download time of all the videos can be reduced significantly.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123836278","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}
引用次数: 120
Impact of channel state information on energy efficient transmission in interference channels 信道状态信息对干扰信道节能传输的影响
G. Nguyen, S. Kompella, C. Kam, J. Wieselthier, A. Ephremides
{"title":"Impact of channel state information on energy efficient transmission in interference channels","authors":"G. Nguyen, S. Kompella, C. Kam, J. Wieselthier, A. Ephremides","doi":"10.1109/WIOPT.2014.6850335","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850335","url":null,"abstract":"We study the energy-efficient transmission problem for a time-varying interference channel. Assume that each source transmits in each time slot according to a transmission probability, which is a continuous value between 0 and 1. Our goal is to determine the values of the transmission probabilities and the transmission power levels so that the network energy efficiency is maximized. We show that the energy efficiency is maximized when the transmission probabilities are either 0 or 1. We also show that simultaneous transmissions reduce energy efficiency. We then address the impact of the accuracy and timeliness of channel state information (CSI) on energy efficiency. The following cases are considered: perfect CSI, erroneous CSI, delayed CSI, and unknown CSI.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132002783","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
Resource allocation and sharing in cooperative networks 合作网络中的资源配置与共享
F. Baccar, I. Kammoun, A. Cipriano
{"title":"Resource allocation and sharing in cooperative networks","authors":"F. Baccar, I. Kammoun, A. Cipriano","doi":"10.1109/WIOPT.2014.6850296","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850296","url":null,"abstract":"In this paper, we investigate the selection of cooperative relays in a cellular mobile network. We take into account the effect of the resource sharing of each relay by its served users on the relay selection strategy. At first, we propose a novel selection strategy of one cooperative relay considering both Amplify and Forward (AF) and Decode and Forwards (DF) protocols. Then, we extend our study to the case of selection of two cooperative relays in an attempt to improve the spatial diversity gain. The performances of the proposed selection algorithms are analyzed in terms of number of users assisted by cooperation and residual powers at the relays.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133045260","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
Trade information, not spectrum: A novel TV white space information market model 交易信息,而不是频谱:一种新的电视空白空间信息市场模型
Yuan Luo, Lin Gao, Jianwei Huang
{"title":"Trade information, not spectrum: A novel TV white space information market model","authors":"Yuan Luo, Lin Gao, Jianwei Huang","doi":"10.1109/WIOPT.2014.6850326","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850326","url":null,"abstract":"In this paper, we propose a novel information market for TV white space networks, where the spectrum database operator sells the information regarding TV white space to secondary users. Different from the traditional spectrum market, the information market processes the unique property of positive externality, as more users purchasing the information service will increase the value of the service to each buyer. We systematically characterize the market equilibrium and the database operator's optimal information pricing strategy. Specifically, we first study how the market share dynamically evolves over time and eventually converge to a market equilibrium. We show that the market equilibrium increases with the initial market share, and there exist several tipping points of the initial market share, around which a slight change will lead to a significant change on the emerging market equilibrium. Based on the market equilibrium analysis, we further study the impact of the database operator's information pricing strategy on the market equilibrium, and derive the optimal information price that maximizes the database operator's revenue. Theoretical analysis and numerical result indicate that this is a promising business model for creating incentives for the database operator in TV white space networks.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116262510","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}
引用次数: 17
Adaptive transmit policies for cost-efficient power allocation in multi-carrier systems 多载波系统中经济高效的功率分配自适应传输策略
Salvatore D’oro, P. Mertikopoulos, A. L. Moustakas, S. Palazzo
{"title":"Adaptive transmit policies for cost-efficient power allocation in multi-carrier systems","authors":"Salvatore D’oro, P. Mertikopoulos, A. L. Moustakas, S. Palazzo","doi":"10.1109/WIOPT.2014.6850271","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850271","url":null,"abstract":"In this paper, we examine the problem of cost/energy-efficient power allocation in uplink multi-carrier orthogonal frequency-division multiple access (OFDMA) wireless networks. In particular, we consider a set of wireless users who seek to maximize their transmission rate subject to pricing limitations and we show that the resulting non-cooperative game admits a unique equilibrium for almost every realization of the system's channels. We also propose a distributed exponential learning scheme which allows users to converge to the game's equilibrium exponentially fast by using only local channel state information (CSI) and signal to interference-plus-noise ratio (SINR) measurements. Given that such measurements are often imperfect in practical scenarios, a major challenge occurs when the users' information is subject to random perturbations. In this case, by using tools and ideas from stochastic convex programming, we show that the proposed learning scheme retains its convergence properties irrespective of the magnitude of the observational errors.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"1166 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123348550","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}
引用次数: 7
Asymptotic bounds on the Optimum Multiuser Efficiency of randomly spread CDMA 随机分布CDMA最优多用户效率的渐近界
M. A. Sedaghat, R. Müller, F. Marvasti
{"title":"Asymptotic bounds on the Optimum Multiuser Efficiency of randomly spread CDMA","authors":"M. A. Sedaghat, R. Müller, F. Marvasti","doi":"10.1109/WIOPT.2014.6850353","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850353","url":null,"abstract":"We derive some bounds on the Optimum Asymptotic Multiuser Efficiency (OAME) of randomly spread CDMA as extensions of the result by Tse and Verdú. To this end, random Gaussian and random binary antipodal spreading are considered. Furthermore, the input signal is assumed to be Binary Phase Shift Keying (BPSK). It is shown that in a CDMA system with K-user and N chips when K and N → 8 and the loading factor, K over N, grows logarithmically with K, the OAME converges to 1 almost surely under some condition. It is also shown that a Gaussian randomly spread CDMA system has a performance close to the single user system at high Signal to Noise Ratio (SNR) when the loading factor is kept less than log3 K over 2. Moreover, for random binary antipodal matrices, we show that the loading factor cannot grow faster than equation.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"322 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126131392","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
Game theoretic anti-jamming dynamic frequency hopping and rate adaptation in wireless systems 无线系统中的博弈论抗干扰动态跳频与速率自适应
M. Hanawal, Mohammad J. Abdel-Rahman, M. Krunz
{"title":"Game theoretic anti-jamming dynamic frequency hopping and rate adaptation in wireless systems","authors":"M. Hanawal, Mohammad J. Abdel-Rahman, M. Krunz","doi":"10.1109/WIOPT.2014.6850306","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850306","url":null,"abstract":"Wireless transmissions are inherently broadcast and are vulnerable to jamming attacks. Frequency hopping (FH) and transmission rate adaptation (RA) have been used to mitigate jamming. However, recent works have shown that using either FH or RA (but not both) is inefficient against smart jamming. In this paper, we propose mitigating jamming by jointly optimizing the FH and RA techniques. We consider a power constrained “reactive-sweep” jammer who aims at degrading the goodput of a wireless link. We model the interaction between the legitimate transmitter and jammer as a zero-sum Markov game, and derive the optimal defense strategy. Numerical investigations show that the new scheme improves the average goodput and provides better jamming resiliency.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125926529","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}
引用次数: 43
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信