Pub Date : 2017-05-15DOI: 10.23919/WIOPT.2017.7959873
G. Haßlinger, Mahmoud Kunbaz, Frank Hasslinger, T. Bauschert
Wikipedia is one of the most popular information platforms on the Internet. The user access pattern to Wikipedia pages depends on their relevance in the current worldwide social discourse. We use publically available statistics about the top-1000 most popular pages on each day to estimate the efficiency of caches for support of the platform. While the data volumes are moderate, the main goal of Wikipedia caches is to reduce access times for page views and edits. We study the impact of most popular pages on the achievable cache hit rate in comparison to Zipf request distributions and we include daily dynamics in popularity.
{"title":"Web caching evaluation from Wikipedia request statistics","authors":"G. Haßlinger, Mahmoud Kunbaz, Frank Hasslinger, T. Bauschert","doi":"10.23919/WIOPT.2017.7959873","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959873","url":null,"abstract":"Wikipedia is one of the most popular information platforms on the Internet. The user access pattern to Wikipedia pages depends on their relevance in the current worldwide social discourse. We use publically available statistics about the top-1000 most popular pages on each day to estimate the efficiency of caches for support of the platform. While the data volumes are moderate, the main goal of Wikipedia caches is to reduce access times for page views and edits. We study the impact of most popular pages on the achievable cache hit rate in comparison to Zipf request distributions and we include daily dynamics in popularity.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"66 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89597575","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}
Pub Date : 2017-05-15DOI: 10.23919/WIOPT.2017.7959902
Jean-Bernard Eytard, M. Akian, M. Bouhtou, S. Gaubert
We propose a model of incentives for data pricing in large mobile networks, in which an operator wishes to balance the number of connexions (active users) of different classes of users in the different cells and at different time instants, in order to ensure them a sufficient quality of service. We assume that each user has a given total demand per day for different types of applications, which he may assign to different time slots and locations, depending on his own mobility, on his preferences and on price discounts proposed by the operator. We show that this can be cast as a bilevel programming problem with a special structure allowing us to develop a polynomial time decomposition algorithm suitable for large networks. First, we determine the optimal number of connexions (which maximizes a measure of balance); next, we solve an inverse problem and determine the prices generating this traffic. Our results exploit a recently developed application of tropical geometry methods to mixed auction problems, as well as algorithms in discrete convexity (minimization of discrete convex functions in the sense of Murota). We finally present an application on real data provided by Orange and we show the efficiency of the model to reduce the peaks of congestion.
{"title":"A bilevel optimization model for load balancing in mobile networks through price incentives","authors":"Jean-Bernard Eytard, M. Akian, M. Bouhtou, S. Gaubert","doi":"10.23919/WIOPT.2017.7959902","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959902","url":null,"abstract":"We propose a model of incentives for data pricing in large mobile networks, in which an operator wishes to balance the number of connexions (active users) of different classes of users in the different cells and at different time instants, in order to ensure them a sufficient quality of service. We assume that each user has a given total demand per day for different types of applications, which he may assign to different time slots and locations, depending on his own mobility, on his preferences and on price discounts proposed by the operator. We show that this can be cast as a bilevel programming problem with a special structure allowing us to develop a polynomial time decomposition algorithm suitable for large networks. First, we determine the optimal number of connexions (which maximizes a measure of balance); next, we solve an inverse problem and determine the prices generating this traffic. Our results exploit a recently developed application of tropical geometry methods to mixed auction problems, as well as algorithms in discrete convexity (minimization of discrete convex functions in the sense of Murota). We finally present an application on real data provided by Orange and we show the efficiency of the model to reduce the peaks of congestion.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"34 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85070741","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}
Pub Date : 2017-05-15DOI: 10.23919/WIOPT.2017.7959894
Yicong Wang, G. Veciana
Wireless channels in millimeter wave based wearable networks are particularly susceptible to environmental blockages and dynamics when there are humans/objects in motion. Such dynamics imply, not only physical layer overheads to discover and track viable transmission paths, but also MAC overheads to keep track of neighboring interferers, perform clustering and enable proper scheduling of transmissions. We shall focus on overheads at timescale associated with the latter. This paper introduces a stochastic geometric model to study the impact of mobility on overheads in such networks. We provide a complete characterization of the temporal dynamics of strong interference channels resulting from blocking in networks comprising both fixed and mobile nodes. We show the state of a channel, Line-of-Sight(LOS)/Non-LOS(NLOS), follows an on/off renewal process and derive the associated distributions. Our model further enables us to evaluate how the overall rate of change for the set of strong LOS interferers seen by a fixed user scales with user density and proportion of mobile users. The overhead to track the interference environment may in fact be limited with user density but increases with proportion of mobile users. In a highly mobile environment, the changes in channels are frequent and the overheads for coordination become high, with distant and/or mobile users requiring more overheads. Based on our results, we suggest fixed users may coordinate with close by neighbors while mobile users are better off resorting to simpler ad hoc MACs.
{"title":"Temporal dynamics of mobile blocking in millimeter wave based wearable networks","authors":"Yicong Wang, G. Veciana","doi":"10.23919/WIOPT.2017.7959894","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959894","url":null,"abstract":"Wireless channels in millimeter wave based wearable networks are particularly susceptible to environmental blockages and dynamics when there are humans/objects in motion. Such dynamics imply, not only physical layer overheads to discover and track viable transmission paths, but also MAC overheads to keep track of neighboring interferers, perform clustering and enable proper scheduling of transmissions. We shall focus on overheads at timescale associated with the latter. This paper introduces a stochastic geometric model to study the impact of mobility on overheads in such networks. We provide a complete characterization of the temporal dynamics of strong interference channels resulting from blocking in networks comprising both fixed and mobile nodes. We show the state of a channel, Line-of-Sight(LOS)/Non-LOS(NLOS), follows an on/off renewal process and derive the associated distributions. Our model further enables us to evaluate how the overall rate of change for the set of strong LOS interferers seen by a fixed user scales with user density and proportion of mobile users. The overhead to track the interference environment may in fact be limited with user density but increases with proportion of mobile users. In a highly mobile environment, the changes in channels are frequent and the overheads for coordination become high, with distant and/or mobile users requiring more overheads. Based on our results, we suggest fixed users may coordinate with close by neighbors while mobile users are better off resorting to simpler ad hoc MACs.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"11 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87523679","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}
Pub Date : 2017-05-15DOI: 10.23919/WIOPT.2017.7959942
Abdulrahman Alabbasi, C. Cavdar
As a potential candidate architecture for 5G systems, cloud radio access network (CRAN) enhances the system's capacity by centralizing the processing and coordination at the central cloud. However, this centralization imposes stringent bandwidth and delay requirements on the fronthaul segment of the network that connects the centralized baseband processing units (BBUs) to the radio units (RUs). Hence, hybrid CRAN is proposed to alleviate the fronthaul bandwidth requirement. The concept of hybrid CRAN supports the proposal of splitting/virtualizing the BBU functions processing between the central cloud (central office that has large processing capacity and efficiency) and the edge cloud (an aggregation node which is closer to the user, but usually has less efficiency in processing). In our previous work, we have studied the impact of different split points on the system's energy and fronthaul bandwidth consumption. In this study, we analyze the delay performance of the end user's request. We propose an end-to-end (from the central cloud to the end user) delay model (per user's request) for different function split points. In this model, different delay requirements enforce different function splits, hence affect the system's energy consumption. Therefore, we propose several research directions to incorporate the proposed delay model in the problem of minimizing energy and bandwidth consumption in the network. We found that the required function split decision, to achieve minimum delay, is significantly affected by the processing power efficiency ratio between processing units of edge cloud and central cloud. High processing efficiency ratio (≈1) leads to significant delay improvement when processing more base band functions at the edge cloud.
{"title":"Delay-aware green hybrid CRAN","authors":"Abdulrahman Alabbasi, C. Cavdar","doi":"10.23919/WIOPT.2017.7959942","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959942","url":null,"abstract":"As a potential candidate architecture for 5G systems, cloud radio access network (CRAN) enhances the system's capacity by centralizing the processing and coordination at the central cloud. However, this centralization imposes stringent bandwidth and delay requirements on the fronthaul segment of the network that connects the centralized baseband processing units (BBUs) to the radio units (RUs). Hence, hybrid CRAN is proposed to alleviate the fronthaul bandwidth requirement. The concept of hybrid CRAN supports the proposal of splitting/virtualizing the BBU functions processing between the central cloud (central office that has large processing capacity and efficiency) and the edge cloud (an aggregation node which is closer to the user, but usually has less efficiency in processing). In our previous work, we have studied the impact of different split points on the system's energy and fronthaul bandwidth consumption. In this study, we analyze the delay performance of the end user's request. We propose an end-to-end (from the central cloud to the end user) delay model (per user's request) for different function split points. In this model, different delay requirements enforce different function splits, hence affect the system's energy consumption. Therefore, we propose several research directions to incorporate the proposed delay model in the problem of minimizing energy and bandwidth consumption in the network. We found that the required function split decision, to achieve minimum delay, is significantly affected by the processing power efficiency ratio between processing units of edge cloud and central cloud. High processing efficiency ratio (≈1) leads to significant delay improvement when processing more base band functions at the edge cloud.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"1 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78466974","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}
Pub Date : 2017-05-15DOI: 10.23919/WIOPT.2017.7959878
Hajar Elhammouti, R. E. Azouzi, F. Pellegrini, Essaid Sabir, L. Echabbi
Cooperative sensing enables secondary users to combine individual sensing results in order to attain sensing accuracies beyond those achieved by consumer RF devices. However, due to sensing costs, secondary users may prefer not to cooperate to the sensing task, leading to higher false alarm probability. In this paper, we study how information about the presence of cooperators affects the dynamics of cooperative sensing schemes. We consider two scenarios, namely the case when SUs cannot detect the presence of other potential cooperators, and the case when SUs have prior information on the presence of other SUs in radio range. Using an evolutionary game framework, we demonstrate that protocols delivering such type of information to SUs reduce cooperation and ultimately lead to degraded network performance. Finally, a learning process based on the replicator dynamics is proposed which is capable to drive the system to the evolutionary stable solution. The results of the paper are illustrated through numerical simulations.
{"title":"Evolutionary dynamics of cooperative sensing in cognitive radios under partial system state information","authors":"Hajar Elhammouti, R. E. Azouzi, F. Pellegrini, Essaid Sabir, L. Echabbi","doi":"10.23919/WIOPT.2017.7959878","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959878","url":null,"abstract":"Cooperative sensing enables secondary users to combine individual sensing results in order to attain sensing accuracies beyond those achieved by consumer RF devices. However, due to sensing costs, secondary users may prefer not to cooperate to the sensing task, leading to higher false alarm probability. In this paper, we study how information about the presence of cooperators affects the dynamics of cooperative sensing schemes. We consider two scenarios, namely the case when SUs cannot detect the presence of other potential cooperators, and the case when SUs have prior information on the presence of other SUs in radio range. Using an evolutionary game framework, we demonstrate that protocols delivering such type of information to SUs reduce cooperation and ultimately lead to degraded network performance. Finally, a learning process based on the replicator dynamics is proposed which is capable to drive the system to the evolutionary stable solution. The results of the paper are illustrated through numerical simulations.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"29 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83318660","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}
Pub Date : 2017-05-15DOI: 10.23919/WIOPT.2017.7959893
L. Hanschke, Leo Krüger, T. Meyerhoff, C. Renner, A. Timm‐Giel
On-board commercial passenger aircraft Wireless Sensor Networks (WSNs) are anticipated to be used for implementing machine-to-machine communication also referred to as Wireless Avionics Intra-Communications (WAIC). These systems enable safety-related wireless avionics and aim to reduce electrical wiring harness contributing by 5% of the total weight of an aircraft. The globally harmonized frequency band designated for WAIC usage is shared with aeronautical Radio Altimeters (RAs). Literature lacks consideration of the impact of on-board RAs on WAIC systems; thus, we close this gap by performing a detailed study and propose two mitigation techniques based on channel hopping. Our simulations show that harmful RA signals infer doubled to tripled delays as well as packet error rates up to 90% when WAIC systems use the frequency band without applying appropriate techniques for increasing communication robustness. With the developed mitigation techniques, we show delays can be kept at levels comparable to non-interfered performance while increasing the usable spectrum by 50% simultaneously. Our evaluations show that the presented mitigation techniques enable reliable usage of WAIC systems in commercial aircraft allowing increased spectrum usage.
{"title":"Radio altimeter interference mitigation in wireless avionics intra-communication networks","authors":"L. Hanschke, Leo Krüger, T. Meyerhoff, C. Renner, A. Timm‐Giel","doi":"10.23919/WIOPT.2017.7959893","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959893","url":null,"abstract":"On-board commercial passenger aircraft Wireless Sensor Networks (WSNs) are anticipated to be used for implementing machine-to-machine communication also referred to as Wireless Avionics Intra-Communications (WAIC). These systems enable safety-related wireless avionics and aim to reduce electrical wiring harness contributing by 5% of the total weight of an aircraft. The globally harmonized frequency band designated for WAIC usage is shared with aeronautical Radio Altimeters (RAs). Literature lacks consideration of the impact of on-board RAs on WAIC systems; thus, we close this gap by performing a detailed study and propose two mitigation techniques based on channel hopping. Our simulations show that harmful RA signals infer doubled to tripled delays as well as packet error rates up to 90% when WAIC systems use the frequency band without applying appropriate techniques for increasing communication robustness. With the developed mitigation techniques, we show delays can be kept at levels comparable to non-interfered performance while increasing the usable spectrum by 50% simultaneously. Our evaluations show that the presented mitigation techniques enable reliable usage of WAIC systems in commercial aircraft allowing increased spectrum usage.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"44 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76764972","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}
Pub Date : 2017-05-15DOI: 10.23919/WIOPT.2017.7959924
Z. Tang, Yuexian Zhou, Wenping Deng, Baosheng Wang
At present, the well-known LISP-MN protocol for LISP mobility can only support end-host IP mobility, and need to implement lightweight version of LISP's ITR/ETR functionality on mobile nodes. Because of this, the LISP-MN protocol is hard for deployment, and lack of the support for network mobility. In this paper, we present LISP-HNM, a network-based end-host and network mobility support protocol in LISP networks. With LISP-HNM, end-hosts and networks mobility are controlled through the same access register protocol, while the core network provides the fast mobility support with a extensional mapping push operation. All end-hosts and hosts in mobile networks are assigning unchangeable IP addresses regardless of their network attachment points. This paper describes the protocol and presents a modelling performance comparison between LISP-HNM and LISP-MN.
{"title":"LISP-HNM: Integrated fast host and network mobility control in LISP networks","authors":"Z. Tang, Yuexian Zhou, Wenping Deng, Baosheng Wang","doi":"10.23919/WIOPT.2017.7959924","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959924","url":null,"abstract":"At present, the well-known LISP-MN protocol for LISP mobility can only support end-host IP mobility, and need to implement lightweight version of LISP's ITR/ETR functionality on mobile nodes. Because of this, the LISP-MN protocol is hard for deployment, and lack of the support for network mobility. In this paper, we present LISP-HNM, a network-based end-host and network mobility support protocol in LISP networks. With LISP-HNM, end-hosts and networks mobility are controlled through the same access register protocol, while the core network provides the fast mobility support with a extensional mapping push operation. All end-hosts and hosts in mobile networks are assigning unchangeable IP addresses regardless of their network attachment points. This paper describes the protocol and presents a modelling performance comparison between LISP-HNM and LISP-MN.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"6 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74482073","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}
Pub Date : 2017-05-15DOI: 10.23919/WIOPT.2017.7959933
A. Ansari, B. Jaumard, C. Cavdar
Energy optimization in cellular networks has been studied using different perspectives in the literature: sleep patterns, network interference, association of users and base stations, resource allocation of resources (bandwidth and power), etc. All these means have been discussed individually in previous works. However, none of the existing works has succeeded in proposing an exact mathematical model that takes into account several of these parameters simultaneously. In this article, we propose a first exact modelling of several network parameters and their interaction in order to minimize the energy consumption in a LTE cellular network. The optimization model guarantees to satisfy all the users with a minimum quality of service (data rate). Its exact solution allows energy savings of up to 50% in a moderately loaded network, which leads to energy savings up to twice that of the heuristic proposed by Piunti et al., (2015). Various numerical results are presented on hexagonal and randomly generated cellular networks.
{"title":"Energy optimization of a cellular network with minimum bit-rate guarantee","authors":"A. Ansari, B. Jaumard, C. Cavdar","doi":"10.23919/WIOPT.2017.7959933","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959933","url":null,"abstract":"Energy optimization in cellular networks has been studied using different perspectives in the literature: sleep patterns, network interference, association of users and base stations, resource allocation of resources (bandwidth and power), etc. All these means have been discussed individually in previous works. However, none of the existing works has succeeded in proposing an exact mathematical model that takes into account several of these parameters simultaneously. In this article, we propose a first exact modelling of several network parameters and their interaction in order to minimize the energy consumption in a LTE cellular network. The optimization model guarantees to satisfy all the users with a minimum quality of service (data rate). Its exact solution allows energy savings of up to 50% in a moderately loaded network, which leads to energy savings up to twice that of the heuristic proposed by Piunti et al., (2015). Various numerical results are presented on hexagonal and randomly generated cellular networks.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"19 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85910725","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}
Pub Date : 2017-05-15DOI: 10.23919/WIOPT.2017.7959881
Chao Zhang, Nizar Khalfet, S. Lasaulce, V. Varma, S. Tarbouriech
In many resource allocation problems, optimal allocation strategies must be determined when only a quantized version of the relevant parameters are available, for instance, power allocation in wireless communications. The contribution of this work is threefold. First, the quantization problem is revisited and a framework which encompasses the classical problem of quantization is proposed. Instead of minimizing the distortion, the goal is to minimize the gap between the maximum of a general payoff function (which would be reached by knowing all parameters of the function) and what is effectively reached when only the quantized version of the parameters is available. Then, to determine such a quantizer, the well-known Lloyd-Max algorithm is generalized. At last, we show how this framework can be applied to the problem of power control in wireless communications; the obtained numerical results clearly show the potential of such a framework.
{"title":"Payoff-oriented quantization and application to power control","authors":"Chao Zhang, Nizar Khalfet, S. Lasaulce, V. Varma, S. Tarbouriech","doi":"10.23919/WIOPT.2017.7959881","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959881","url":null,"abstract":"In many resource allocation problems, optimal allocation strategies must be determined when only a quantized version of the relevant parameters are available, for instance, power allocation in wireless communications. The contribution of this work is threefold. First, the quantization problem is revisited and a framework which encompasses the classical problem of quantization is proposed. Instead of minimizing the distortion, the goal is to minimize the gap between the maximum of a general payoff function (which would be reached by knowing all parameters of the function) and what is effectively reached when only the quantized version of the parameters is available. Then, to determine such a quantizer, the well-known Lloyd-Max algorithm is generalized. At last, we show how this framework can be applied to the problem of power control in wireless communications; the obtained numerical results clearly show the potential of such a framework.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"3 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86882691","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}
Pub Date : 2017-05-15DOI: 10.23919/WIOPT.2017.7959869
Parth Thaker, Aditya Gopalan, R. Vaze
Motivated by applications in competitive WiFi sensing, and competition to grab user attention in social networks, the problem of when to arrive at/sample a shared resource/server platform with multiple players is considered. Server activity is intermittent, with the server switching between ON and OFF periods alternatively. Each player spends a certain cost to sample the server state, and the per-player payoff is inversely proportional to the number of simultaneously connected/arrived players. The objective of each player is to arrive/sample the server as soon as any ON period begins while incurring minimal sensing cost and to avoid having many other players overlap in time with itself. For this competition model, we propose a distributed randomized learning algorithm (strategy to sample the server) for each player, which is shown to converge to a unique non-trivial fixed point. The fixed point is moreover shown to be a Nash equilibrium of a game, where each player's utility function is demonstrated to possess all the required selfish tradeoffs.
{"title":"When to arrive in a congested system: Achieving equilibrium via learning algorithm","authors":"Parth Thaker, Aditya Gopalan, R. Vaze","doi":"10.23919/WIOPT.2017.7959869","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959869","url":null,"abstract":"Motivated by applications in competitive WiFi sensing, and competition to grab user attention in social networks, the problem of when to arrive at/sample a shared resource/server platform with multiple players is considered. Server activity is intermittent, with the server switching between ON and OFF periods alternatively. Each player spends a certain cost to sample the server state, and the per-player payoff is inversely proportional to the number of simultaneously connected/arrived players. The objective of each player is to arrive/sample the server as soon as any ON period begins while incurring minimal sensing cost and to avoid having many other players overlap in time with itself. For this competition model, we propose a distributed randomized learning algorithm (strategy to sample the server) for each player, which is shown to converge to a unique non-trivial fixed point. The fixed point is moreover shown to be a Nash equilibrium of a game, where each player's utility function is demonstrated to possess all the required selfish tradeoffs.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"19 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81878905","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：