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}
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}
{"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}
{"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}
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}
{"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}
Mahdi Ben Ghorbel, M. Guenach, Mohamed-Slim Alouini
{"title":"Reduced-dimension power allocation over clustered channels in cognitive radios system under co-channel interference","authors":"Mahdi Ben Ghorbel, M. Guenach, Mohamed-Slim Alouini","doi":"10.1109/WIOPT.2014.7130897","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.7130897","url":null,"abstract":"The objective of this paper is to propose a reduceddimension resource allocation scheme in the context of cognitive radio system in presence of co-channel interference between users. We assume a multicarrier transmission for both the primary and secondary systems. Instead of optimizing the powers over all sub-carriers, the sub-carriers are grouped into clusters of sub-carriers, where the power of each sub-carrier is directly related to the power of the correspondent cluster. The power optimization is done only over the set of clusters instead of all sub-carriers which can significantly reduce the complexity of the resource allocation problem. The performance loss of the reduced dimension solution with respect to the optimal solution, where the optimization is carried over all active sub-carriers, allows trading-off complexity versus performance. Numerical evaluation indeed revealed that a limited performance loss occurs by optimizing over a reduced set of clusters instead of the full optimization in the context of cognitive radio systems.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"13 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":"132104316","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":"Power control policies for a wireless link with energy harvesting transmitter and receiver","authors":"Tingjun Chen, Sheng Zhou, Wei Chen, Z. Niu","doi":"10.1109/WIOPT.2014.6850333","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850333","url":null,"abstract":"This paper addresses the outage minimization problem for a wireless link where both the transmitter and the receiver are powered by harvested energy, and the energy arrival processes of both nodes are correlated. We propose three power control policies to minimize the outage probability, including threshold-based On-Off policy, joint scheduling policy, and linear power levels policy. With infinite battery capacity, we analyze the optimality of the thresholds with different correlations between energy arrivals at the transmitter and the receiver. With finite battery capacity, we use finite state Markov chain (FSMC) to obtain the optimality of our policies and also numerically evaluate their performance. The optimal thresholds for minimum outages are derived according to the average energy arrival rate and the system parameters. The numerical results show the performance gains using different policies, as well as the tradeoff between the minimum outage probabilities and the average transmission times.","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":"2014-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133026781","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":"Resource optimization over DVB-RCS satellite links through the use of SPDY","authors":"A. Salam, M. Luglio, C. Roseti, F. Zampognaro","doi":"10.1109/WIOPT.2014.6850280","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850280","url":null,"abstract":"SPDY is a recent Web technology aimed to improve webpages load time and resource utilization, through the implementation of: multiplexing and prioritization of webpage objects, header compression, resource pushing and encryption. Most of these techniques are already implemented in Performance Enhancing Proxies (PEPs), which are adopted in geostationary satellite systems to optimize TCP-based application performance. Thus, SPDY is expected to provide benefits for satellite communications resource management. This paper provides a careful assessment of SPDY performance over satellite links, compliant to DVB-RCS standard, with return link resources assigned on demand through a Demand Assignment Multiple Access (DAMA) method. Such a reference scenario constitutes a challenging communication environment due to both the limited return link bandwidth and the relatively high latency. Performance evaluation has been carried out through a satellite network emulator, which reproduces physical layer satellite impairments, while running real implementations of both TCP/IP stack and SPDY.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"19 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":"133029753","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":"Performance evaluation of censoring-enabled systems for sequential detection in large wireless sensor networks","authors":"Mohammed Karmoose, Karim G. Seddik, Ahmed Sultan","doi":"10.1109/WIOPT.2014.6850284","DOIUrl":"https://doi.org/10.1109/WIOPT.2014.6850284","url":null,"abstract":"In this paper, we consider a sequential binary hypothesis testing framework in wireless sensor networks. We study the effect of sensor censoring on network performance in terms of the average error probability and average number of observations required until a global decision is made. The detection process is mathematically modeled as a random walk process with two absorbing barriers. We resort to Chernoff bound in order to find upper bounds on the error probabilities and the average stopping time. The main contribution of this paper is to prove that in a sequential binary hypothesis network where sensors send their hard decisions to the fusion center, censoring can enhance the network performance in comparison to non-censoring networks in certain SNR regimes. Numerical evaluation is provided to illustrate the gains achieved through censoring.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"105 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":"116510271","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}