1,689 research outputs found
Joint Downlink Base Station Association and Power Control for Max-Min Fairness: Computation and Complexity
In a heterogeneous network (HetNet) with a large number of low power base
stations (BSs), proper user-BS association and power control is crucial to
achieving desirable system performance. In this paper, we systematically study
the joint BS association and power allocation problem for a downlink cellular
network under the max-min fairness criterion. First, we show that this problem
is NP-hard. Second, we show that the upper bound of the optimal value can be
easily computed, and propose a two-stage algorithm to find a high-quality
suboptimal solution. Simulation results show that the proposed algorithm is
near-optimal in the high-SNR regime. Third, we show that the problem under some
additional mild assumptions can be solved to global optima in polynomial time
by a semi-distributed algorithm. This result is based on a transformation of
the original problem to an assignment problem with gains , where
are the channel gains.Comment: 24 pages, 7 figures, a shorter version submitted to IEEE JSA
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
Auction-based Bandwidth Allocation Mechanisms for Wireless Future Internet
An important aspect of the Future Internet is the efficient utilization of
(wireless) network resources. In order for the - demanding in terms of QoS -
Future Internet services to be provided, the current trend is evolving towards
an "integrated" wireless network access model that enables users to enjoy
mobility, seamless access and high quality of service in an all-IP network on
an "Anytime, Anywhere" basis. The term "integrated" is used to denote that the
Future Internet wireless "last mile" is expected to comprise multiple
heterogeneous geographically coexisting wireless networks, each having
different capacity and coverage radius. The efficient management of the
wireless access network resources is crucial due to their scarcity that renders
wireless access a potential bottleneck for the provision of high quality
services. In this paper we propose an auction mechanism for allocating the
bandwidth of such a network so that efficiency is attained, i.e. social welfare
is maximized. In particular, we propose an incentive-compatible, efficient
auction-based mechanism of low computational complexity. We define a repeated
game to address user utilities and incentives issues. Subsequently, we extend
this mechanism so that it can also accommodate multicast sessions. We also
analyze the computational complexity and message overhead of the proposed
mechanism. We then show how user bids can be replaced from weights generated by
the network and transform the auction to a cooperative mechanism capable of
prioritizing certain classes of services and emulating DiffServ and time-of-day
pricing schemes. The theoretical analysis is complemented by simulations that
assess the proposed mechanisms properties and performance. We finally provide
some concluding remarks and directions for future research
- …