Tabu search for dynamic spectrum allocation in cellular networks
نویسندگان
چکیده
In this paper, we present and analyze a Tabu Search (TS) algorithm for Dynamic Spectrum Allocation (DSA) in cellular networks. We study a case where an operator is providing packet services to the endusers. The objective of the cellular operator is to maximize its reward while taking into account the trade-off between the spectrum cost and the revenues obtained from end-users. These revenues are modeled here as an increasing function of the achieved throughput. The cost is proportional to the bandwidth of the spectrum leased to the regulator or some spectrum broker. Results show that the algorithm allows the operator to increase its reward by taking advantage of the spatial and temporal heterogeneities of the traffic in the network, rather than assuming homogeneous traffic for its radio resource allocation. Our TS-based DSA algorithm is efficient in terms of the required memory space and convergence speed. Results show that the algorithm is fast enough to suit a dynamic context. Copyright c © 2xxx AEIT
منابع مشابه
Tabu Search for Dynamic Spectrum Allocation (DSA) in Cellular Networks†
In this paper, we present and analyze a Tabu Search (TS) algorithm for Dynamic Spectrum Allocation (DSA) in cellular networks. We study a case where an operator is providing packet services to the endusers. The objective of the cellular operator is to maximize its reward while taking into account the trade-off between the spectrum cost and the revenues obtained from end-users. These revenues ar...
متن کاملCapacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search
The goals of hub location problems are finding the location of hub facilities and determining the allocation of non-hub nodes to these located hubs. In this work, we discuss the multi-modal single allocation capacitated p-hub covering problem over fully interconnected hub networks. Therefore, we provide a formulation to this end. The purpose of our model is to find the location of hubs and the ...
متن کاملMeta-heuristic Techniques for Dynamic Channel Allocation (DCA) in Mobile Cellular Networks
The scarcity of radio channel is the main bottleneck in the enhancement of system capacity while maintaining quality of service in mobile cellular networks. A channel allocation scheme which can adapt the varying load of a network may help to overcome that bottleneck to some extent. Thus, dynamic channel allocation (DCA) is an important problem in the mobile cellular networks. In this paper, we...
متن کاملThe Role of Regulatory in Price Control and Spectrum Allocation to Competing Wireless Access Networks
With the rapid growth of wireless access networks, various providers offer their services using different technologies such as Wi-Fi, Wimax, 3G, 4G and so on. These networks compete for the scarce wireless spectrum. The spectrum is considered to be a scarce resource moderated by the spectrum allocation regulatory (“regulatory” for short) which is the governance body aiming to maximize the socia...
متن کاملA Tabu Search Based Solution Approach to the Competitive Multiple Allocation Hub Location Problem
The hub location problems (HLP) constitute an important class of facility location problems that have been addressed by numerous operations researchers in recent years. HLP is a strategic problem frequently encountered in designing logistics and transportation networks. Here, we address the competitive multiple allocation HLP in a duopoly market. It is assumed that an incumbent firm (the leader...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Trans. Emerging Telecommunications Technologies
دوره 23 شماره
صفحات -
تاریخ انتشار 2012