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

筛选
英文 中文
Power aware wireless file downloading: A constrained restless bandit approach 电力感知无线文件下载:一个受约束的不安宁的强盗方法
Xiaohan Wei, M. Neely
{"title":"Power aware wireless file downloading: A constrained restless bandit approach","authors":"Xiaohan Wei, M. Neely","doi":"10.1109/WIOPT.2014.6850336","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850336","url":null,"abstract":"This paper treats power-aware throughput maximization in a multi-user file downloading system. Each user can receive a new file only after its previous file is finished. The file state processes for each user act as coupled Markov chains that form a generalized restless bandit system. First, an optimal algorithm is derived for the case of one user. The algorithm maximizes throughput subject to an average power constraint. Next, the one-user algorithm is extended to a low complexity heuristic for the multi-user problem. The heuristic uses a simple online index policy and its effectiveness is shown via simulation. For simple 3-user cases where the optimal solution can be computed offline, the heuristic is shown to be near-optimal for a wide range of parameters.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114991600","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}
引用次数: 3
Self-optimizing mechanisms for EMF reduction in heterogeneous networks 异构网络中EMF降低的自优化机制
Habib B. A. Sidi, Z. Altman, Abdoulaye Tall
{"title":"Self-optimizing mechanisms for EMF reduction in heterogeneous networks","authors":"Habib B. A. Sidi, Z. Altman, Abdoulaye Tall","doi":"10.1109/WIOPT.2014.6850318","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850318","url":null,"abstract":"This paper focuses on the exposure to Radio Frequency (RF) Electromagnetic Fields (EMF) and on optimization methods to reduce it. Within the FP7 LEXNET project, an Exposure Index (EI) has been defined that aggregates the essential components that impact exposure to EMF. The EI includes, among other, downlink (DL) exposure induced by the base stations (BSs) and access points, the uplink (UL) exposure induced by the devices in communication, and the corresponding exposure time. Motivated by the EI definition, this paper develops stochastic approximation based self-optimizing algorithm that dynamically adapts the network to reduce the EI in a heterogeneous network with macro- and small cells. It is argued that the increase of the small cells' coverage can, to a certain extent, reduce the EI, but above a certain limit, will deteriorate DL QoS. A load balancing algorithm is formulated that adapts the small cell' coverage based on UL loads and a DL QoS indicator. The proof of convergence of the algorithm is provided and its performance in terms of EI reduction is illustrated through extensive numerical simulations.","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-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128775621","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}
引用次数: 10
Self organizing strategies for enhanced ICIC (eICIC) 增强ICIC的自组织策略(eICIC)
Abdoulaye Tall, Z. Altman, E. Altman
{"title":"Self organizing strategies for enhanced ICIC (eICIC)","authors":"Abdoulaye Tall, Z. Altman, E. Altman","doi":"10.1109/WIOPT.2014.6850315","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850315","url":null,"abstract":"Small cells have been identified as an effective solution for coping with the important traffic increase that is expected in the coming years. But this solution is accompanied by additional interference that needs to be mitigated. The enhanced Inter Cell Interference Coordination (eICIC) feature has been introduced to address the interference problem. eICIC involves two parameters which need to be optimized, namely the Cell Range Extension (CRE) of the small cells and the ABS ratio (ABSr) which defines a mute ratio for the macro cell to reduce the interference it produces. In this paper we propose self-optimizing algorithms for the eICIC. The CRE is adjusted by means of load balancing algorithm. The ABSr parameter is optimized by maximizing a proportional fair utility of user throughputs. The convergence of the algorithms is proven using stochastic approximation theorems. Numerical simulations illustrate the important performance gain brought about by the different algorithms.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124685982","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}
引用次数: 60
A pricing-based cooperative spectrum sharing stackelberg game 基于定价的合作频谱共享stackelberg博弈
Ramy E. Ali, Karim G. Seddik, M. Nafie, F. Digham
{"title":"A pricing-based cooperative spectrum sharing stackelberg game","authors":"Ramy E. Ali, Karim G. Seddik, M. Nafie, F. Digham","doi":"10.1109/WIOPT.2014.6850303","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850303","url":null,"abstract":"In this paper, we study the problem of cooperative spectrum sharing among a primary user (PU) and multiple secondary users (SUs) under quality of service (QoS) constraints. The SUs network is controlled by the PU through a relay which gets a revenue for amplifying and forwarding the SUs' signals to their respective destinations. The relay charges each SU a different price depending on its received signal-to-interference-and-noise ratio (SINR). The primary relay controls the SUs network and maximize any desired PU utility function. The PU utility function represents its QoS, which is affected by the SUs access, and its gained revenue to allow the access of the SUs. The problem of maximizing the primary utility is formulated as a Stackelberg game and solved through three different approaches, namely, the optimal, the heuristic and the suboptimal algorithms.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116009246","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}
引用次数: 10
Not always sparse: Flooding time in partially connected mobile ad hoc networks 并非总是稀疏:部分连接的移动自组织网络中的泛洪时间
L. Maggi, F. Pellegrini
{"title":"Not always sparse: Flooding time in partially connected mobile ad hoc networks","authors":"L. Maggi, F. Pellegrini","doi":"10.1109/WIOPT.2014.6850327","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850327","url":null,"abstract":"In this paper we study mobile ad hoc wireless networks by using the notion of evolving connectivity graphs. In such systems, the connectivity changes over time due to the intermittent contacts of mobile terminals. In particular, we are interested in studying the expected flooding time when full connectivity cannot be ensured at each point in time. Even in this case, due to finite contact times durations, connected components may appear in the connectivity graph. Hence, this represents the intermediate case between extreme cases of fully mobile ad hoc networks and fully static ad hoc networks. By using a generalization of edge-Markovian graphs, we extend the existing models based on sparse scenarios to this intermediate case and calculate the expected flooding time. We also propose bounds that have reduced computational complexity.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129110034","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
A game theoretic analysis for energy efficient heterogeneous networks 节能异构网络的博弈论分析
Majed Haddad, P. Więcek, Oussama Habachi, Y. Hayel
{"title":"A game theoretic analysis for energy efficient heterogeneous networks","authors":"Majed Haddad, P. Więcek, Oussama Habachi, Y. Hayel","doi":"10.1109/WIOPT.2014.6850305","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850305","url":null,"abstract":"Smooth and green future extension/scalability (e.g., from sparse to dense, from small-area dense to large-area dense, or from normal-dense to super-dense) is an important issue in heterogeneous networks. In this paper, we study energy efficiency of heterogeneous networks for both sparse and dense (two-tier and multi-tier) small cell deployments. We formulate the problem as a hierarchical (Stackelberg) game in which the macro cell is the leader whereas the small cell is the follower. Both players want to strategically decide on their power allocation policies in order to maximize the energy efficiency of their registered users. A backward induction method has been used to obtain a closed-form expression of the Stackelberg equilibrium. It is shown that the energy efficiency is maximized when only one sub-band is exploited for the players of the game depending on their channel fading gains. Simulation results are presented to show the effectiveness of the proposed scheme.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114176364","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
Cooperative access in cognitive radio networks: stable throughput and delay tradeoffs 认知无线网络中的合作接入:稳定吞吐量和延迟权衡
M. Ashour, A. El-Sherif, T. Elbatt, Amr M. Mohamed
{"title":"Cooperative access in cognitive radio networks: stable throughput and delay tradeoffs","authors":"M. Ashour, A. El-Sherif, T. Elbatt, Amr M. Mohamed","doi":"10.1109/WIOPT.2014.6850308","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850308","url":null,"abstract":"In this paper, we study and analyze fundamental throughput-delay tradeoffs in cooperative multiple access for cognitive radio systems. We focus on the class of randomized cooperative policies, whereby the secondary user (SU) serves either the queue of its own data or the queue of the primary user (PU) relayed data with certain service probabilities. The proposed policy opens room for trading the PU delay for enhanced SU delay. Towards this objective, stability conditions for the queues involved in the system are derived. Furthermore, a moment generating function approach is employed to derive closed-form expressions for the average delay encountered by the packets of both users. Results reveal that cooperation expands the stable throughput region of the system and significantly reduces the delay at both users. Moreover, we quantify the gain obtained in terms of the SU delay under the proposed policy, over conventional relaying that gives strict priority to the relay queue.","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":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121375149","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}
引用次数: 14
How user throughput depends on the traffic demand in large cellular networks 在大型蜂窝网络中,用户吞吐量如何依赖于流量需求
B. Błaszczyszyn, Miodrag Jovanovic, M. Karray
{"title":"How user throughput depends on the traffic demand in large cellular networks","authors":"B. Błaszczyszyn, Miodrag Jovanovic, M. Karray","doi":"10.1109/WIOPT.2014.6850355","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850355","url":null,"abstract":"We assume a space-time Poisson process of call arrivals on the infinite plane, independently marked by data volumes and served by a cellular network modeled by an infinite ergodic point process of base stations. Each point of this point process represents the location of a base station that applies a processor sharing policy to serve users arriving in its vicinity, modeled by the Voronoi cell, possibly perturbed by some random signal propagation effects. User service rates depend on their signal-to-interference-and-noise ratios with respect to the serving station. Little's law allows to express the mean user throughput in any region of this network model as the ratio of the mean traffic demand to the steady-state mean number of users in this region. Using ergodic arguments and the Palm theoretic formalism, we define a global mean user throughput in the cellular network and prove that it is equal to the ratio of mean traffic demand to the mean number of users in the steady state of the “typical cell” of the network. Here, both means account for double averaging: over time and network geometry, and can be related to the per-surface traffic demand, base-station density and the spatial distribution of the signal-to-interference-and-noise ratio. This latter accounts for network irregularities, shadowing and cell dependence via some cell-load equations. Inspired by the analysis of the typical cell, we propose also a simpler, approximate, but fully analytic approach, called the mean cell approach. The key quantity explicitly calculated in this approach is the cell load. In analogy to the load factor of the (classical) M/G/1 processor sharing queue, it characterizes the stability condition, mean number of users and the mean user throughput. We validate our approach comparing analytical and simulation results for Poisson network model to real-network measurements.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124832373","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}
引用次数: 36
Asymmetric-valued spectrum auction and competition in wireless broadband services 无线宽带服务的非对称价值频谱拍卖和竞争
S. Jung, S. Yu, Seong-Lyun Kim
{"title":"Asymmetric-valued spectrum auction and competition in wireless broadband services","authors":"S. Jung, S. Yu, Seong-Lyun Kim","doi":"10.1109/WIOPT.2014.6850339","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850339","url":null,"abstract":"We study bidding and pricing competition between two spiteful mobile network operators (MNOs) with considering their existing spectrum holdings. Given asymmetric-valued spectrum blocks are auctioned off to them via a first-price sealed-bid auction, we investigate the interactions between two spiteful MNOs and users as a three-stage dynamic game and characterize the dynamic game's equilibria. We show an asymmetric pricing structure and different market share between two spiteful MNOs. Perhaps counter-intuitively, our results show that the MNO who acquires the less-valued spectrum block always lowers his service price despite providing double-speed LTE service to users. We also show that the MNO who acquires the high-valued spectrum block, despite charing a higher price, still achieves more market share than the other MNO. We further show that the competition between two MNOs leads to some loss of their revenues. By investigating a cross-over point at which the MNOs' profits are switched, it serves as the benchmark of practical auction designs.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126038074","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}
引用次数: 5
Degrees of freedom per communication node 每个通信节点的自由度
M. Khojastepour, K. Sundaresan, Mohammad Farajzadeh-Tehrani, S. Rangarajan
{"title":"Degrees of freedom per communication node","authors":"M. Khojastepour, K. Sundaresan, Mohammad Farajzadeh-Tehrani, S. Rangarajan","doi":"10.1109/WIOPT.2014.6850368","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850368","url":null,"abstract":"The classical definition of degrees of freedom (DoF) deals with the degrees of a communication channel or multiple communication channels in the limit of high SNR. This can be interpreted as the number of independent streams that can be sent in each communication channel in the high SNR regime. We introduce the concept of DoF per communication node where at a transmitting node the DoF is the number of independent dimensions that can be used for transmission and at each receiver node the DoF is the number of independent dimensions that can be used for receiving data signals. In general the communication channels or links in a network can be divided into two sets: the interfering channels and the intended channels; hence, the network may be considered as an overlay of two networks, respectively: the interfering network and data-intended network. In the classical form, DoF is defined for channels in the data-intended network. We illustrate a new interpretation of DoF that depends only on the interfering network and can be formalized in full generality based on degrees of freedom per node in the network. While the classical DoF has been studied generally in the context of interference and X-channels, the per node DoF concept generalizes the idea to other possible networks. Using this generalized notion of DoF, this paper provides new results on DoF for different networks and also makes a connection to the classical definition of DoF defined in interference and X-channels.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117042848","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}
引用次数: 1
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学术官方微信