927 research outputs found
Energy saving market for mobile operators
Ensuring seamless coverage accounts for the lion's share of the energy
consumed in a mobile network. Overlapping coverage of three to five mobile
network operators (MNOs) results in enormous amount of energy waste which is
avoidable. The traffic demands of the mobile networks vary significantly
throughout the day. As the offered load for all networks are not same at a
given time and the differences in energy consumption at different loads are
significant, multi-MNO capacity/coverage sharing can dramatically reduce energy
consumption of mobile networks and provide the MNOs a cost effective means to
cope with the exponential growth of traffic. In this paper, we propose an
energy saving market for a multi-MNO network scenario. As the competing MNOs
are not comfortable with information sharing, we propose a double auction
clearinghouse market mechanism where MNOs sell and buy capacity in order to
minimize energy consumption. In our setting, each MNO proposes its bids and
asks simultaneously for buying and selling multi-unit capacities respectively
to an independent auctioneer, i.e., clearinghouse and ends up either as a buyer
or as a seller in each round. We show that the mechanism allows the MNOs to
save significant percentage of energy cost throughout a wide range of network
load. Different than other energy saving features such as cell sleep or antenna
muting which can not be enabled at heavy traffic load, dynamic capacity sharing
allows MNOs to handle traffic bursts with energy saving opportunity.Comment: 6 pages, 2 figures, to be published in ICC 2015 workshop on Next
Generation Green IC
Multiobjective auction-based switching-off scheme in heterogeneous networks: to bid or not to bid?
©2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.The emerging data traffic demand has caused a massive deployment of network infrastructure, including Base Stations (BSs) and Small Cells (SCs), leading to increased energy consumption and expenditures. However, the network underutilization during low traffic periods enables the Mobile Network Operators (MNOs) to save energy by having their traffic served by third party SCs, thus being able to switch off their BSs. In this paper, we propose a novel market approach to foster the opportunistic utilization of the unexploited SCs capacity, where the MNOs, instead of requesting the maximum capacity to meet their highest traffic expectations, offer a set of bids requesting different resources from the third party SCs at lower costs. Motivated by the conflicting financial interests of the MNOs and the third party, the restricted capacity of the SCs that is not adequate to carry the whole traffic in multi-operator scenarios, and the necessity for energy efficient solutions, we introduce a combinatorial auction framework, which includes i) a bidding strategy, ii) a resource allocation scheme, and iii) a pricing rule. We propose a multiobjective framework as an energy and cost efficient solution for the resource allocation problem, and we provide extensive analytical and experimental results to estimate the potential energy and cost savings that can be achieved. In addition, we investigate the conditions under which the MNOs and the third party companies should take part in the proposed auction.Peer ReviewedPostprint (author's final draft
Profitable Task Allocation in Mobile Cloud Computing
We propose a game theoretic framework for task allocation in mobile cloud
computing that corresponds to offloading of compute tasks to a group of nearby
mobile devices. Specifically, in our framework, a distributor node holds a
multidimensional auction for allocating the tasks of a job among nearby mobile
nodes based on their computational capabilities and also the cost of
computation at these nodes, with the goal of reducing the overall job
completion time. Our proposed auction also has the desired incentive
compatibility property that ensures that mobile devices truthfully reveal their
capabilities and costs and that those devices benefit from the task allocation.
To deal with node mobility, we perform multiple auctions over adaptive time
intervals. We develop a heuristic approach to dynamically find the best time
intervals between auctions to minimize unnecessary auctions and the
accompanying overheads. We evaluate our framework and methods using both real
world and synthetic mobility traces. Our evaluation results show that our game
theoretic framework improves the job completion time by a factor of 2-5 in
comparison to the time taken for executing the job locally, while minimizing
the number of auctions and the accompanying overheads. Our approach is also
profitable for the nearby nodes that execute the distributor's tasks with these
nodes receiving a compensation higher than their actual costs
Mobile data and computation offloading in mobile cloud computing
Le trafic mobile augmente considérablement en raison de la popularité des appareils mobiles et des applications mobiles. Le déchargement de données mobiles est une solution permettant de réduire la congestion du réseau cellulaire. Le déchargement de calcul mobile peut déplacer les tâches de calcul d'appareils mobiles vers le cloud. Dans cette thèse, nous étudions d'abord le problème du déchargement de données mobiles dans l'architecture du cloud computing mobile. Afin de minimiser les coûts de transmission des données, nous formulons le processus de déchargement des données sous la forme d'un processus de décision de Markov à horizon fini. Nous proposons deux algorithmes de déchargement des données pour un coût minimal. Ensuite, nous considérons un marché sur lequel un opérateur de réseau mobile peut vendre de la bande passante à des utilisateurs mobiles. Nous formulons ce problème sous la forme d'une enchère comportant plusieurs éléments afin de maximiser les bénéfices de l'opérateur de réseau mobile. Nous proposons un algorithme d'optimisation robuste et deux algorithmes itératifs pour résoudre ce problème. Enfin, nous nous concentrons sur les problèmes d'équilibrage de charge afin de minimiser la latence du déchargement des calculs. Nous formulons ce problème comme un jeu de population. Nous proposons deux algorithmes d'équilibrage de la charge de travail basés sur la dynamique évolutive et des protocoles de révision. Les résultats de la simulation montrent l'efficacité et la robustesse des méthodes proposées.Global mobile traffic is increasing dramatically due to the popularity of smart mobile devices and data hungry mobile applications. Mobile data offloading is considered as a promising solution to alleviate congestion in cellular network. Mobile computation offloading can move computation intensive tasks and large data storage from mobile devices to cloud. In this thesis, we first study mobile data offloading problem under the architecture of mobile cloud computing. In order to minimize the overall cost for data delivery, we formulate the data offloading process, as a finite horizon Markov decision process, and we propose two data offloading algorithms to achieve minimal communication cost. Then, we consider a mobile data offloading market where mobile network operator can sell bandwidth to mobile users. We formulate this problem as a multi-item auction in order to maximize the profit of mobile network operator. We propose one robust optimization algorithm and two iterative algorithms to solve this problem. Finally, we investigate computation offloading problem in mobile edge computing. We focus on workload balancing problems to minimize the transmission latency and computation latency of computation offloading. We formulate this problem as a population game, in order to analyze the aggregate offloading decisions, and we propose two workload balancing algorithms based on evolutionary dynamics and revision protocols. Simulation results show the efficiency and robustness of our proposed methods
- …