Tabu Search Heuristic for Competitive Base Station Location Problem
We consider the base stations location problem with sharing. New operator arrives the market and competes with an existing network of another operator. Latter one can share BS cites with new operator, receiving a rent payment from him. We propose new mode
- PDF / 103,648 Bytes
- 6 Pages / 439.37 x 666.142 pts Page_size
- 60 Downloads / 223 Views
1 System Model We consider the following location problem. New 5G networks are deployed by two competitive operators (called resp. O1 and O2 ), which we refer to as a leader and a follower due to their sequential entering the market. They compete to serve clients by installing and configuring base stations (BS). We assume that the leader had already made a decision and is operating a 5G network. Follower arrives at the market knowing the decision of the leader and set it’s own 5G network. Follower is able to set up his BSs on all the available sites. It is also possible to share the site with the leader. In the latter case follower pays leader an additional sharing price. Each client chooses the network considering the average quality of the service provided. The aim of the follower is to choose locations for his BS in order to maximize his profit.
1.1 Network and Propagation Model Let S be the set of all sites, where base stations can be installed. This set is made of three subsets: S = S f ∪ S1o ∪ S2o , where Sio is the set of sites having a 4G base station installed by Oi , i ∈ {1, 2}, and S f is a set of free sites for potential new installations. M. Coupechoux (B) · S. Iellamo Télécom ParisTech and CNRS LTCI, 6, rue Barrault, Paris, France e-mail: [email protected] S. Iellamo e-mail: [email protected] I. Davydov Sobolev Institute of Mathematics, Av.Koptyuga 4, Novosibirsk, Russia e-mail: [email protected] © Springer International Publishing Switzerland 2017 K.F. Dœrner et al. (eds.), Operations Research Proceedings 2015, Operations Research Proceedings, DOI 10.1007/978-3-319-42902-1_44
325
326
M. Coupechoux et al.
O1 have a subset S1n of new 5G base stations installed. His new BSs are installed among the free sites and the sites having old BSs of O1 : S1n ⊂ S f ∪ S1o . The rent price is set by O1 for every site with its BS, i.e. in the set S1n ∪ S1o . Now O2 is deploying its 5G network by choosing a set S2n for its 5G BSs. He has a choice among all the sites in S , i.e. S2n ⊂ S . If a 5G BS of O2 is placed on a site in S1n , he will have to pay the sharing price fixed by O1 . Otherwise, he will have to pay for maintenance. At the end of this phase, some users leave O1 and take a subscription with O2 . Now let consider a user located at x. Let define the channel gain between location x and BS b as gb (x) and let assume that the transmit power of b is Pb . Signal to interference and noise ratio (SINR) of the considered user in x with respect to b is given by: Pb gb (x) , (1) γb (x) = i=b Pi gi (x) + N where N is the thermal noise power in the band. User in x is said to be covered by b if γb (x) ≥ γmin for some threshold γmin . User in x is said to be served by b if he is covered and Pb gb (x) ≥ Pi gi (x) for all i = b. Note that at every location, users can be served by at most one BS from each operator. For a user located in x and served by station b, the physical data rate achievable by this user is denoted by cb (x), which is an increasing nonlinear function of γb (x) with c
Data Loading...
