2009-12-16 23:31:10 +00:00
|
|
|
/* Handover Decision making for Inter-BTS (Intra-BSC) Handover. This
|
|
|
|
* only implements the handover algorithm/decision, but not execution
|
|
|
|
* of it */
|
|
|
|
|
|
|
|
/* (C) 2009 by Harald Welte <laforge@gnumonks.org>
|
|
|
|
*
|
|
|
|
* All Rights Reserved
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
2011-01-01 14:25:50 +00:00
|
|
|
* it under the terms of the GNU Affero General Public License as published by
|
|
|
|
* the Free Software Foundation; either version 3 of the License, or
|
2009-12-16 23:31:10 +00:00
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
2011-01-01 14:25:50 +00:00
|
|
|
* GNU Affero General Public License for more details.
|
2009-12-16 23:31:10 +00:00
|
|
|
*
|
2011-01-01 14:25:50 +00:00
|
|
|
* You should have received a copy of the GNU Affero General Public License
|
|
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
2009-12-16 23:31:10 +00:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <errno.h>
|
|
|
|
|
2011-03-22 15:47:59 +00:00
|
|
|
#include <osmocom/core/msgb.h>
|
2009-12-16 23:31:10 +00:00
|
|
|
#include <openbsc/debug.h>
|
|
|
|
#include <openbsc/gsm_data.h>
|
|
|
|
#include <openbsc/meas_rep.h>
|
|
|
|
#include <openbsc/signal.h>
|
2011-03-22 15:47:59 +00:00
|
|
|
#include <osmocom/core/talloc.h>
|
2009-12-16 23:31:10 +00:00
|
|
|
#include <openbsc/handover.h>
|
2011-03-22 15:47:59 +00:00
|
|
|
#include <osmocom/gsm/gsm_utils.h>
|
2009-12-16 23:31:10 +00:00
|
|
|
|
mscsplit: various preparations to separate MSC from BSC
Disable large parts of the code that depend on BSC presence. The code sections
disabled by #if BEFORE_MSCSPLIT shall be modified or dropped in the course of
adding the A-interface.
Don't set msg->lchan nor msg->dst.
Don't use lchan in libmsc.
Decouple lac from bts.
Prepare entry/exit point for MSC -> BSC and MSC -> RNC communication:
Add msc_ifaces.[hc], a_iface.c, with a general msc_tx_dtap() to redirect to
different interfaces depending on the actual subscriber connection.
While iu_tx() is going to be functional fairly soon, the a_tx() is going to be
just a dummy for some time (see comment).
Add Iu specific fields in gsm_subscriber_connection: the UE connection pointer
and an indicator for the Integrity Protection status on Iu (to be fully
implemented in later commits).
Add lac member to gsm_subscriber_connection, to allow decoupling from
bts->location_area_code. The conn->lac will actually be set in iu.c in an
upcoming commit ("add iucs.[hc]").
move to libcommon-cs: gsm48_extract_mi(), gsm48_paging_extract_mi().
libmsc: duplicate gsm0808 / gsm48 functions (towards BSC).
In osmo-nitb, libmsc would directly call the functions on the BSC level, not
always via the bsc_api. When separating libmsc from libbsc, some functions are
missing from the linkage.
Hence duplicate these functions to libmsc, add an msc_ prefix for clarity, also
add a _tx to gsm0808_cipher_mode():
* add msc_gsm0808_tx_cipher_mode() (dummy/stub)
* add msc_gsm48_tx_mm_serv_ack()
* add msc_gsm48_tx_mm_serv_rej()
Call these from libmsc instead of
* gsm0808_cipher_mode()
* gsm48_tx_mm_serv_ack()
* gsm48_tx_mm_serv_rej()
Also add a comment related to msc_gsm0808_tx_cipher_mode() in two places.
Remove internal RTP streaming code; OsmoNITB supported that, but for OsmoMSC,
this will be done with an external MGCP gateway.
Remove LCHAN_MODIFY from internal MNCC state machine.
Temporarily disable all paging to be able to link libmsc without libbsc.
Skip the paging part of channel_test because the paging is now disabled.
Employ fake paging shims in order for msc_vlr_tests to still work.
msc_compl_l3(): publish in .h, tweak return value. Use new libmsc enum values
for return val, to avoid dependency on libbsc headers. Make callable from
other scopes: publish in osmo_msc.h and remove 'static' in osmo_msc.c
add gsm_encr to subscr_conn
move subscr_request to gsm_subscriber.h
subscr_request_channel() -> subscr_request_conn()
move to libmsc: osmo_stats_vty_add_cmds()
gsm_04_08: remove apply_codec_restrictions()
gsm0408_test: use NULL for root ctx
move to libbsc: gsm_bts_neighbor()
move to libbsc: lchan_next_meas_rep()
move vty config for t3212 to network level (periodic lu)
remove unneccessary linking from some tests
remove handle_abisip_signal()
abis_rsl.c: don't use libvlr from libbsc
gsm_subscriber_connection: put the LAC here, so that it is available without
accessing conn->bts. In bsc_api.c, place this lac in conn for the sake of
transition: Iu and A will use this new field to pass the LAC around, but in a
completely separate OsmoBSC this is not actually needed. It can be removed
again from osmo-bsc.git when the time has come.
Siemens MRPCI: completely drop sending the MRPCI messages for now, they shall
be added in osmo-bsc once the A-Interface code has settled. See OS#2389.
Related: OS#1845 OS#2257 OS#2389
Change-Id: Id3705236350d5f69e447046b0a764bbabc3d493c
2017-05-08 13:12:20 +00:00
|
|
|
/* Get reference to a neighbor cell on a given BCCH ARFCN */
|
|
|
|
static struct gsm_bts *gsm_bts_neighbor(const struct gsm_bts *bts,
|
|
|
|
uint16_t arfcn, uint8_t bsic)
|
|
|
|
{
|
|
|
|
struct gsm_bts *neigh;
|
|
|
|
/* FIXME: use some better heuristics here to determine which cell
|
|
|
|
* using this ARFCN really is closest to the target cell. For
|
|
|
|
* now we simply assume that each ARFCN will only be used by one
|
|
|
|
* cell */
|
|
|
|
|
|
|
|
llist_for_each_entry(neigh, &bts->network->bts_list, list) {
|
|
|
|
/* FIXME: this is probably returning the same bts again!? */
|
|
|
|
if (neigh->c0->arfcn == arfcn &&
|
|
|
|
neigh->bsic == bsic)
|
|
|
|
return neigh;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-12-21 12:30:17 +00:00
|
|
|
/* issue handover to a cell identified by ARFCN and BSIC */
|
2009-12-16 23:31:10 +00:00
|
|
|
static int handover_to_arfcn_bsic(struct gsm_lchan *lchan,
|
2011-04-18 15:04:00 +00:00
|
|
|
uint16_t arfcn, uint8_t bsic)
|
2009-12-16 23:31:10 +00:00
|
|
|
{
|
|
|
|
struct gsm_bts *new_bts;
|
|
|
|
|
|
|
|
/* resolve the gsm_bts structure for the best neighbor */
|
|
|
|
new_bts = gsm_bts_neighbor(lchan->ts->trx->bts, arfcn, bsic);
|
|
|
|
if (!new_bts) {
|
2009-12-17 22:10:46 +00:00
|
|
|
LOGP(DHO, LOGL_NOTICE, "unable to determine neighbor BTS "
|
|
|
|
"for ARFCN %u BSIC %u ?!?\n", arfcn, bsic);
|
2009-12-16 23:31:10 +00:00
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* and actually try to handover to that cell */
|
|
|
|
return bsc_handover_start(lchan, new_bts);
|
|
|
|
}
|
|
|
|
|
2009-12-21 12:30:17 +00:00
|
|
|
/* did we get a RXLEV for a given cell in the given report? */
|
|
|
|
static int rxlev_for_cell_in_rep(struct gsm_meas_rep *mr,
|
2011-04-18 15:04:00 +00:00
|
|
|
uint16_t arfcn, uint8_t bsic)
|
2009-12-16 23:31:10 +00:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
2009-12-21 12:30:17 +00:00
|
|
|
for (i = 0; i < mr->num_cell; i++) {
|
|
|
|
struct gsm_meas_rep_cell *mrc = &mr->cell[i];
|
|
|
|
|
|
|
|
/* search for matching report */
|
|
|
|
if (!(mrc->arfcn == arfcn && mrc->bsic == bsic))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
mrc->flags |= MRC_F_PROCESSED;
|
|
|
|
return mrc->rxlev;
|
2009-12-18 10:49:20 +00:00
|
|
|
}
|
2009-12-21 12:30:17 +00:00
|
|
|
return -ENODEV;
|
|
|
|
}
|
2009-12-18 10:49:20 +00:00
|
|
|
|
2009-12-21 12:30:17 +00:00
|
|
|
/* obtain averaged rxlev for given neighbor */
|
|
|
|
static int neigh_meas_avg(struct neigh_meas_proc *nmp, int window)
|
|
|
|
{
|
|
|
|
unsigned int i, idx;
|
|
|
|
int avg = 0;
|
2009-12-16 23:31:10 +00:00
|
|
|
|
2009-12-21 12:30:17 +00:00
|
|
|
idx = calc_initial_idx(ARRAY_SIZE(nmp->rxlev),
|
|
|
|
nmp->rxlev_cnt % ARRAY_SIZE(nmp->rxlev),
|
|
|
|
window);
|
|
|
|
|
|
|
|
for (i = 0; i < window; i++) {
|
|
|
|
int j = (idx+i) % ARRAY_SIZE(nmp->rxlev);
|
|
|
|
|
|
|
|
avg += nmp->rxlev[j];
|
|
|
|
}
|
|
|
|
|
|
|
|
return avg / window;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* find empty or evict bad neighbor */
|
|
|
|
static struct neigh_meas_proc *find_evict_neigh(struct gsm_lchan *lchan)
|
|
|
|
{
|
|
|
|
int j, worst = 999999;
|
2011-04-18 15:16:56 +00:00
|
|
|
struct neigh_meas_proc *nmp_worst = NULL;
|
2009-12-21 12:30:17 +00:00
|
|
|
|
|
|
|
/* first try to find an empty/unused slot */
|
|
|
|
for (j = 0; j < ARRAY_SIZE(lchan->neigh_meas); j++) {
|
|
|
|
struct neigh_meas_proc *nmp = &lchan->neigh_meas[j];
|
|
|
|
if (!nmp->arfcn)
|
|
|
|
return nmp;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* no empty slot found. evict worst neighbor from list */
|
|
|
|
for (j = 0; j < ARRAY_SIZE(lchan->neigh_meas); j++) {
|
|
|
|
struct neigh_meas_proc *nmp = &lchan->neigh_meas[j];
|
|
|
|
int avg = neigh_meas_avg(nmp, MAX_WIN_NEIGH_AVG);
|
2011-04-18 15:16:56 +00:00
|
|
|
if (!nmp_worst || avg < worst) {
|
2009-12-21 12:30:17 +00:00
|
|
|
worst = avg;
|
|
|
|
nmp_worst = nmp;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return nmp_worst;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* process neighbor cell measurement reports */
|
|
|
|
static void process_meas_neigh(struct gsm_meas_rep *mr)
|
|
|
|
{
|
|
|
|
int i, j, idx;
|
|
|
|
|
|
|
|
/* for each reported cell, try to update global state */
|
|
|
|
for (j = 0; j < ARRAY_SIZE(mr->lchan->neigh_meas); j++) {
|
|
|
|
struct neigh_meas_proc *nmp = &mr->lchan->neigh_meas[j];
|
|
|
|
unsigned int idx;
|
|
|
|
int rxlev;
|
|
|
|
|
|
|
|
/* skip unused entries */
|
|
|
|
if (!nmp->arfcn)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
rxlev = rxlev_for_cell_in_rep(mr, nmp->arfcn, nmp->bsic);
|
|
|
|
idx = nmp->rxlev_cnt % ARRAY_SIZE(nmp->rxlev);
|
|
|
|
if (rxlev >= 0) {
|
|
|
|
nmp->rxlev[idx] = rxlev;
|
|
|
|
nmp->last_seen_nr = mr->nr;
|
|
|
|
} else
|
|
|
|
nmp->rxlev[idx] = 0;
|
|
|
|
nmp->rxlev_cnt++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* iterate over list of reported cells, check if we did not
|
|
|
|
* process all of them */
|
|
|
|
for (i = 0; i < mr->num_cell; i++) {
|
|
|
|
struct gsm_meas_rep_cell *mrc = &mr->cell[i];
|
|
|
|
struct neigh_meas_proc *nmp;
|
|
|
|
|
|
|
|
if (mrc->flags & MRC_F_PROCESSED)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
nmp = find_evict_neigh(mr->lchan);
|
|
|
|
|
|
|
|
nmp->arfcn = mrc->arfcn;
|
|
|
|
nmp->bsic = mrc->bsic;
|
|
|
|
|
|
|
|
idx = nmp->rxlev_cnt % ARRAY_SIZE(nmp->rxlev);
|
|
|
|
nmp->rxlev[idx] = mrc->rxlev;
|
|
|
|
nmp->rxlev_cnt++;
|
|
|
|
nmp->last_seen_nr = mr->nr;
|
|
|
|
|
|
|
|
mrc->flags |= MRC_F_PROCESSED;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* attempt to do a handover */
|
|
|
|
static int attempt_handover(struct gsm_meas_rep *mr)
|
|
|
|
{
|
|
|
|
struct gsm_network *net = mr->lchan->ts->trx->bts->network;
|
|
|
|
struct neigh_meas_proc *best_cell = NULL;
|
|
|
|
unsigned int best_better_db = 0;
|
|
|
|
int i, rc;
|
2009-12-19 20:29:19 +00:00
|
|
|
|
2009-12-16 23:31:10 +00:00
|
|
|
/* find the best cell in this report that is at least RXLEV_HYST
|
|
|
|
* better than the current serving cell */
|
2009-12-21 12:30:17 +00:00
|
|
|
|
|
|
|
for (i = 0; i < ARRAY_SIZE(mr->lchan->neigh_meas); i++) {
|
|
|
|
struct neigh_meas_proc *nmp = &mr->lchan->neigh_meas[i];
|
|
|
|
int avg, better;
|
|
|
|
|
|
|
|
/* skip empty slots */
|
|
|
|
if (nmp->arfcn == 0)
|
2009-12-16 23:31:10 +00:00
|
|
|
continue;
|
|
|
|
|
2009-12-21 12:30:17 +00:00
|
|
|
/* caculate average rxlev for this cell over the window */
|
|
|
|
avg = neigh_meas_avg(nmp, net->handover.win_rxlev_avg_neigh);
|
|
|
|
|
|
|
|
/* check if hysteresis is fulfilled */
|
|
|
|
if (avg < mr->dl.full.rx_lev + net->handover.pwr_hysteresis)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
better = avg - mr->dl.full.rx_lev;
|
2009-12-16 23:31:10 +00:00
|
|
|
if (better > best_better_db) {
|
2009-12-21 12:30:17 +00:00
|
|
|
best_cell = nmp;
|
2009-12-16 23:31:10 +00:00
|
|
|
best_better_db = better;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-12-21 12:30:17 +00:00
|
|
|
if (!best_cell)
|
2009-12-19 20:41:52 +00:00
|
|
|
return 0;
|
2009-12-16 23:31:10 +00:00
|
|
|
|
2009-12-21 12:30:17 +00:00
|
|
|
LOGP(DHO, LOGL_INFO, "%s: Cell on ARFCN %u is better: ",
|
|
|
|
gsm_ts_name(mr->lchan->ts), best_cell->arfcn);
|
|
|
|
if (!net->handover.active) {
|
2009-12-19 20:41:52 +00:00
|
|
|
LOGPC(DHO, LOGL_INFO, "Skipping, Handover disabled\n");
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2009-12-21 12:30:17 +00:00
|
|
|
rc = handover_to_arfcn_bsic(mr->lchan, best_cell->arfcn, best_cell->bsic);
|
|
|
|
switch (rc) {
|
|
|
|
case 0:
|
|
|
|
LOGPC(DHO, LOGL_INFO, "Starting handover\n");
|
|
|
|
break;
|
|
|
|
case -ENOSPC:
|
|
|
|
LOGPC(DHO, LOGL_INFO, "No channel available\n");
|
|
|
|
break;
|
|
|
|
case -EBUSY:
|
|
|
|
LOGPC(DHO, LOGL_INFO, "Handover already active\n");
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
LOGPC(DHO, LOGL_ERROR, "Unknown error\n");
|
|
|
|
}
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* process an already parsed measurement report and decide if we want to
|
|
|
|
* attempt a handover */
|
|
|
|
static int process_meas_rep(struct gsm_meas_rep *mr)
|
|
|
|
{
|
|
|
|
struct gsm_network *net = mr->lchan->ts->trx->bts->network;
|
2016-05-17 13:56:49 +00:00
|
|
|
enum meas_rep_field dlev, dqual;
|
2009-12-21 12:30:17 +00:00
|
|
|
int av_rxlev;
|
|
|
|
|
|
|
|
/* we currently only do handover for TCH channels */
|
|
|
|
switch (mr->lchan->type) {
|
|
|
|
case GSM_LCHAN_TCH_F:
|
|
|
|
case GSM_LCHAN_TCH_H:
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2016-05-17 13:56:49 +00:00
|
|
|
if (mr->flags & MEAS_REP_F_DL_DTX) {
|
|
|
|
dlev = MEAS_REP_DL_RXLEV_SUB;
|
|
|
|
dqual = MEAS_REP_DL_RXQUAL_SUB;
|
|
|
|
} else {
|
|
|
|
dlev = MEAS_REP_DL_RXLEV_FULL;
|
|
|
|
dqual = MEAS_REP_DL_RXQUAL_FULL;
|
|
|
|
}
|
|
|
|
|
2009-12-21 12:30:17 +00:00
|
|
|
/* parse actual neighbor cell info */
|
|
|
|
if (mr->num_cell > 0 && mr->num_cell < 7)
|
|
|
|
process_meas_neigh(mr);
|
|
|
|
|
2016-05-17 13:56:49 +00:00
|
|
|
av_rxlev = get_meas_rep_avg(mr->lchan, dlev,
|
2009-12-21 12:30:17 +00:00
|
|
|
net->handover.win_rxlev_avg);
|
|
|
|
|
|
|
|
/* Interference HO */
|
|
|
|
if (rxlev2dbm(av_rxlev) > -85 &&
|
2016-05-17 13:56:49 +00:00
|
|
|
meas_rep_n_out_of_m_be(mr->lchan, dqual, 3, 4, 5))
|
2009-12-21 12:30:17 +00:00
|
|
|
return attempt_handover(mr);
|
|
|
|
|
|
|
|
/* Bad Quality */
|
2016-05-17 13:56:49 +00:00
|
|
|
if (meas_rep_n_out_of_m_be(mr->lchan, dqual, 3, 4, 5))
|
2009-12-21 12:30:17 +00:00
|
|
|
return attempt_handover(mr);
|
|
|
|
|
|
|
|
/* Low Level */
|
|
|
|
if (rxlev2dbm(av_rxlev) <= -110)
|
|
|
|
return attempt_handover(mr);
|
|
|
|
|
|
|
|
/* Distance */
|
|
|
|
if (mr->ms_l1.ta > net->handover.max_distance)
|
|
|
|
return attempt_handover(mr);
|
|
|
|
|
|
|
|
/* Power Budget AKA Better Cell */
|
|
|
|
if ((mr->nr % net->handover.pwr_interval) == 0)
|
|
|
|
return attempt_handover(mr);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
2009-12-16 23:31:10 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int ho_dec_sig_cb(unsigned int subsys, unsigned int signal,
|
|
|
|
void *handler_data, void *signal_data)
|
|
|
|
{
|
2010-12-27 12:28:20 +00:00
|
|
|
struct lchan_signal_data *lchan_data;
|
2009-12-16 23:31:10 +00:00
|
|
|
|
|
|
|
if (subsys != SS_LCHAN)
|
|
|
|
return 0;
|
|
|
|
|
2010-12-27 12:28:20 +00:00
|
|
|
lchan_data = signal_data;
|
2009-12-16 23:31:10 +00:00
|
|
|
switch (signal) {
|
|
|
|
case S_LCHAN_MEAS_REP:
|
2010-12-27 12:28:20 +00:00
|
|
|
process_meas_rep(lchan_data->mr);
|
2009-12-16 23:31:10 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void on_dso_load_ho_dec(void)
|
|
|
|
{
|
2011-05-06 10:12:31 +00:00
|
|
|
osmo_signal_register_handler(SS_LCHAN, ho_dec_sig_cb, NULL);
|
2009-12-16 23:31:10 +00:00
|
|
|
}
|