The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We study the dynamic energy optimization problem in data centers. We formulate and solve the following offline problem: given a set of jobs to process, where the jobs are characterized by arrival instances, required processing time, and completion deadlines, and given the energy requirements of switching servers ON or OFF, in which time-slot which server has to be assigned to which job, and in which...
In this paper, we use a stochastic geometric approach in order to study the impact on energy consumption when base stations are switched OFF independently of each other. We present here both the uplink and downlink analysis based on the assumption that the base stations are distributed according to an independent stationary Poisson point process. This type of modeling allows us to make use of the...
This paper studies a significant problem in green networking called switching off base stations in case of cooperating service providers by means of stochastic geometric and coalitional game tools. The coalitional game herein considered is played by service providers who cooperate in switching off base stations. When they cooperate, any mobile is associated to the nearest BS of any service provider...
A matching theoretic approach to study the partner selection in cooperative relaying is followed. Partner selection is considered as a special stable roommate problem where each player ranks its partners by some criterion. Each agent aims here at finding a “good” partner in order to exploit efficiently the spatial diversity achieved with cooperation. We adapt Irving's algorithm [3] for determining...
The system model and protocol structure of the superposition modulated cooperative transmission in multiuser wireless networks is presented. The applicability of this model becomes difficult with increasing number of users. In this work, this problem is evaluated by the application of coalition formation games. In coalition formation games the stability of the coalitions is investigated. Nash stability...
We consider in this paper games related to the association problem of mobiles to an access point. It consists of deciding to which access point to connect. We consider the choice between two access points or more, where the access decisions may depend on the number of mobiles connected to each one of the access points. We obtain new results using elementary tools in congestion and crowding games.
We consider a common object (data) that each mobile in the medium is interested to receive, and which can be obtained from any base station transmitting the data. For example, the broadcast object could be streaming transmission of a sport or cultural event, or it could be some signaling such as a beacon for time synchronization or for power control purposes. This problem can be conceived as a coalition...
In this work, we consider downlink transmission in cellular networks where we target to reduce the energy consumption by switching off some base stations by such a way that the distribution of SINR remains unchanged. This is a mean of green networking in cellular networks in downlink consideration. This paper analyzes for line and plane cases, the gain in power consumption obtained after switching...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.