Abstract
The paper addresses the problem of strategic base stations placement in cognitive radio networks. We consider a primary user, operating on the frequency channels of a primary network, and an operator (a leader) facing the competition of a second operator (a follower). These operators are willing to exploit the unused capacity of the primary network and maximize their profits derived from operating the base stations installed and clients served. The leader is aware of the future arrival of the follower, who is able to capture clients by placing its own base stations. It has also to limit the interference power at some measurement points defined by the primary user. We formulate the problem as a bi-level location problem and develop a matheuristic where a mixed integer program derived from the follower’s problem is solved by CPLEX software. We prove that the follower’s problem is NP-hard and the leader’s problem is \(\varSigma _2^P\)-hard. Our computational experiments confirm the value of competition for the strategic planning in cognitive radio networks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
It means that every client has either a rotating directional antenna as assumed in Kim and Shin (2010) or a second omni-directional antenna used for measurements.
In the United States, for instance, we are talking about the VHF channels \(2,5,6,7-13,14-20\) and the UHF channels \(14-20\).
When two or more channels in the frequency domain are available, if these channels are contiguous with each other, they could be bonded as one client channel. Otherwise they could be aggregated meaning that multiple channels at different frequencies are assembled as a common channel.
\(F(X,Y)\) represents the spatial and temporal relationship of the TV signal propagation as specified in [15]. It represents the field strength that would exceed a certain threshold at X% of locations for Y% of time.
References
Alekseeva E, Kochetov Y (2013) Matheuristics and exact methods for the discrete (\(r|p\))-centroid problem. In: Talbi E-G (ed) Metaheuristics for bi-level optimization. Springer, Berlin, pp 189–219
Alekseeva E, Kochetova N, Kochetov Y, Plyasunov A (2010) Heuristic and exact methods for the discrete (\(r|p\))-centroid problem. In: Evolutionary computation in combinatorial optimization, ser. lecture notes in computer science. Springer, Berlin, 6022:11–22
Altman E, Kumar A, Singh C, Sundaresan R (2009) Spatial SINR games combining base station placement and mobile association. In: Proceedings of the IEEE conference on computer communications (INFO-COM), Rio de Janeiro, Brazil
Amaldi E, Capone A, Malucelli F (2008) Radio planning and coverage optimization of 3G cellular networks. Springer Wirel Netw 14(4):435–447
Bard J, Moore J (1990) A branch and bound algorithm for the bilevel programming problem. SIAM J Sci Stat Comput 11(2):281–292
Beresnev VL, Melnikov AA (2011) Approximate algorithms for the competitive facility location problem. J Appl Ind Math 5(2):180–190
Boschetti M, Maniezzo V, Roffilli M, Rohler A (2009) Matheuristics: optimization, simulation and control. In: Hybrid metaheuristics, ser. lecture notes in computer science. Springer, Berlin, 5818: 171–177
Brewer J (2012) TV white space technology for rural telecommunications. Telco2
Davydov I, Kochetov Y, Plyasunov A (2014) On the complexity of the (\(r|p\))centroid problem in the plane. TOP 22(2):614–623
Deb S, Srinivasan V, Maheshwari R (2009) Dynamic spectrum access in DTV whitespaces: design rules, architecture and algorithms. In: Proceedings of the ACM international conference on mobile computing and networking (MOBICOM), Beijing, China, pp 1–12
DeNegre S, Ralphs T (2009) A branch-and-cut algorithm for integer bilevel linear programs. In: Proceedings of the INFORMS computing society meeting, Charleston, USA
Gerami C (2011) Design methodology for backhaul and distribution networks using TV white spaces. Masters thesis, Rutgers, The State University of New Jersey, New Brunswick, New Jersey
Glover F, Laguna M (1997) Tabu search. Kluwer, Boston
Hansen P, Jaumard B, Savard G (1992) New branch and bound rules for linear bilevel programming. SIAM J Sci Stat Comput 13(5):1194–1247
ITU-R (2009) Method for point-to-area predictions for terrestrial services in the frequency range 30–3 000 MHz. Recommandation, pp 15–46
Kim H, Shin K (2010) Asymmetry-aware real-time distributed joint resource allocation in IEEE 802.22 WRANs. In: Proceedings of the IEEE international conference on computer communications (INFOCOM), San Diego, USA
Kochetov YA (2011) Facility location: discrete models and local search methods. In: Chvatal V (ed) Combinatorial optimization. Methods and applications. IOS Press, Amsterdam, pp 97–134
Kononov AV, Kochetov YuA, Plyasunov AV (2009) Competitive facility location models. Comput Math Math Phys 49(6):994–1009
Kress D, Pesch E (2012) Sequential competitive location on networks. Eur J Oper Res 217(3):483–499
Küçükaydin H, Aras N, Altinel I (2011) Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution. Eur J Oper Res 208(3):206–220
Legillon F, Liefoogh A, Talbi E (2011) A parallel metaheuristic for bilevel optimization. In: Proceedings of metaheuristic international conference (MIC), Udine, Italy
Liang Y-C et al. (2005) System description and operation principles for IEEE 802.22 WRANs. doc.: IEEE 802.22-05/0093r0
Maqbool M, Coupechoux M, Godlewski P (2008) Comparison of various frequency reuse patterns for WiMAX Networks with adaptive beamforming. In: Proceedings of IEEE vehicular technology conference (VTC Spring), Singapore
Megiddo N, Supowit K (1984) On the complexity of some common geometric location problems. SIAM J Comput 13(1):182–196
Mériaux F, Lasaulce S, Kieffer M (2011) More about base station location games, CoRR abs/1105.2243
Nekovee M (2009) Quantifying the availability of TV white spaces for cognitive radio operation in the UK. In: Proceedings of IEEE international conference on communications workshops (ICC), Dresden, Germany
Niyato D, Hossain E, Han Z (2009) Dynamic spectrum access in IEEE 802.22-based cognitive wireless networks: a game theoretic model for competitive spectrum bidding and pricing. IEEE Wirel Commun 16(2):16–23
Oldoni M, Macchiarella G, Seyfert F (2014) Synthesis and modelling techniques for microwave filters and diplexers: advances in analytical methods with applications to design and tuning. Scholars’ Press
Schaefer M, Umans C (2002) Completeness in the polynomial-time hierarchy: a compendium. SIGACT News 33(3):32–49
Shankar N, Cordeiro C (2008) Analysis of aggregated interference at DTV receivers in TV bands. In: Proceedings of the international conference on cognitive radio oriented wireless networks and communications (CrownCom), Singapore
Sofer E, Segal Y, Leiba Y (2006) Deployment of OFDMA based solution in 802.22 scenarios. Runcom, doc.: IEEE 802.22-06/0002r0
Ye L, Wei Z, Du H, Xie H, Sang L, Yang D (2011) Accumulative interference modeling of cellular CR network to DTV system. In: Proceedings of the IEEE vehicular technology conference (VTC Fall), San Francisco, USA
Author information
Authors and Affiliations
Corresponding author
Additional information
The research of the second and the fifth authors was partially supported by RFBR grants 12-01-00077 and 13-07-00016.
Rights and permissions
About this article
Cite this article
Iellamo, S., Alekseeva, E., Chen, L. et al. Competitive location in cognitive radio networks. 4OR-Q J Oper Res 13, 81–110 (2015). https://doi.org/10.1007/s10288-014-0268-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-014-0268-1