The problem of optimal placement of access points for the indoor positioning system Текст научной статьи по специальности «Компьютерные и информационные науки»

UDC 519.8

Вестник СПбГУ. Прикладная математика... 2017. Т. 13. Вып. 1

R. V. Voronov

THE PROBLEM OF OPTIMAL PLACEMENT OF ACCESS POINTS FOR THE INDOOR POSITIONING SYSTEM

Petrozavodsk State University, 33, Lenina pr., Petrozavodsk, 185910, Russian Federation

This paper deals with an indoor positioning system. The system is based on the use of wireless local area network access points. A location calculation engine is based on Bayesian algorithms. Location accuracy depends on the number and placement of access points. This paper considers the mathematical model and the method of solving the problem of optimal access point placement for indoor positioning system. The criteria for evaluating the quality of the access points placement is the mathematical expectation of the localization error. We consider two strategies for localization of a mobile object. It is demonstrated that, for some strategies, the addition of access points can possibly increases the expectation errors, for example, the strategy selecting the most probable zone. A strategy, guaranteeing that the addition of access points does not lead to an increase in the expectation errors is proposed. An algorithm for solving the optimization problem is developed. We present the result of testing the algorithm on real data. Refs 16. Fig. 1.

Keywords: indoor location, placement of access points.

Р. В. Воронов

ЗАДАЧА ОПТИМАЛЬНОГО РАЗМЕЩЕНИЯ ТОЧЕК ДОСТУПА СИСТЕМЫ ПОЗИЦИОНИРОВАНИЯ ОБЪЕКТОВ В ПОМЕЩЕНИИ

Петрозаводский государственный университет, Российская Федерация, 185910, г. Петрозаводск, пр. Ленина, 33

Статья посвящена системам определения местоположения мобильных объектов внутри помещений, основанным на использовании беспроводных сетей точек доступа. Метод расчета местоположения базируется на байесовском алгоритме. Точность определения местоположения зависит от числа и мест расположения точек доступа. Предлагаются математическая модель и метод решения задачи оптимального размещения точек доступа системы позиционирования мобильных объектов в помещении. Критерием оценивания качества размещения точек доступа служит математическое ожидание ошибки определения местоположения объекта. Рассмотрены две стратегии выбора алгоритмом позиционирования искомой позиции объекта. Показано, что для некоторых стратегий возможна ситуация, когда добавление точек доступа приводит к увеличению математического ожидания ошибки определения местоположения объекта. Такой стратегией является, например, выбор наиболее вероятной зоны. Разработана стратегия, для которой гарантируется, что добавление точек доступа не приводит к росту математического ожидания ошибки определения местоположения объекта. Построен алгоритм решения поставленной оптимизационной задачи. Приводится результат тестирования алгоритма на реальных данных. Библиогр. 16 назв. Ил. 1.

Ключевые слова: локация внутри помещений, расстановка точек доступа.

Introduction. The article considers the problem of mobile objects location inside a building. As examples of the application of the indoor positioning systems, we can specify monitoring of children in child care centers, goods search on the store stock,

Voronov Roman Vlo,d,imirovich — PhD of technical sciences, associate professor; rvoronov76@ gmail.com

Воронов Роман Владимирович — кандидат технических наук, доцент; [email protected] © Санкт-Петербургский государственный университет, 2017

locating medical equipment, personnel and elderly patients in the hospital, locating of the miners in the mines in the emergency situation, controlling position the group of law enforcement officers during the execution special operations, tracking firefighters inside a burning building, locating sniffer dogs searching for explosives, the definition frequented places in public buildings, in robotics [1, 2], etc.

Special positioning system is used where global navigation satellite systems is inadequate, for example, in buildings and indoor areas. Indoor positioning systems uses different technologies, including wireless sensor networks [3, 4]. For the construction of such systems various wireless technologies are used: Wi-Fi, ZigBee, nanoLOC, UWB, Bluetooth, etc. The access points of the network have been installed in the building. Each access point has its own coverage area. The location of the object is determined by processing the received signal characteristics (time of flight or signal strength). Sometimes the plan of building is initially divided into set of zones. Physically zones correspond to the small room of the rooms or corridors. As a rule, zones do not contain walls and partitions. During the installation of the location system signal strength map of access points is built [5, 6]. Typically, the signal strength of the access point map is formed from the average values of its signal strength in each zone ("fingerprinting"). When mobile object is broadcasting, it registers signals from all access points. This signal strength vector is compared to a map and zone, for which signal values the most similar to the registered values, is selected [3, 4, 6]. When this positioning quality significantly depends on the number and placement of stationary access points.

During the installation of positioning systems the always to reduce the number of used access points to minimize the cost of the equipment. Therefore, the following iterative scenario is often used. First, access points in some areas of the building is set. The next step is to hand-learn systems, calculate signal strength maps, and then if needed in different parts of the building add a few more access points, improving location accuracy. The disadvantage of this approach is the time required to conduct such an experiment. An alternative is to use mathematical modeling to estimate the quality of the access points placement and to make recommendations for its improvement.

It is assumed that we know the set of possible positions of installation of stationary wireless access points, and for each such position is known probability distribution of signal strength in all zones from the access point. Note that the parameters of the probability distribution of signal strength can be estimated on the basis of mathematical models of signal distribution in the buildings of [7-9].

It is proposed to estimate the quality of the positioning system using the mean error location, which is averaged distance between the actual object location and the location defined by positioning system. The main feature of the models is the use of the signal strength distribution in zones.

Related works. The paper [10] provides a method of combining maximum coverage space requirements and reducing errors in determining the location of mobile objects. A mathematical model for determining the error locations of mobile object based on the variability of the signal strength measurements. This model is based only on general assumptions about the work of localization algorithm used.

The overall expected error is determined by the formula

I SaxA d(x,x)P(x | x)w(x)dxdx where x — valid coordinates of region A; x — mobile object position; d(x, x) — the distance

E= — V ' у ' -, (1)

щ JA iv{x)dx

between points x and x; P(x | x) — conditional probability distribution; w(-) — weight coefficient.

Let t be the signal strength threshold, below which the signal is considered unacceptable. It defines the set AC of all zones in the networked area that receive sufficient coverage by at least one access point:

Ac = {x e A I p,(x) > t},

here jl(x) — the strongest signal from access points in zone x.

Size of AC is considered as a measure of coverage:

C = Iac I- (2)

Access points placements is determined by various criteria of optimization: minimizing localization error (1), maximizing coverage area C (2), combination of these two criteria. To find the placement of access points, which minimizes the average location error and maximizes coverage, it is suggested to use a combined objective function:

C' = E + 1^.

The authors experimentally determined constant value y = 2500. For each option, the placement of access points defined by the conditional probability distribution P(x | x) and average strength of the signal.

The authors have proposed different methods of solving the optimization problem. The most efficient method is local search algorithm with restrictions. In this algorithm is allowed the transition to the state with the worst value of the objective function, but it is prohibited to move the "recently" displaced access point.

A disadvantage of the proposed model is that for each zone only one, the most probable combination of signal strengths from the access points in this area is considered. It may lead to solutions, in which the access points are arranged too closely to each other. Note that, in practice, the access points are placed at a certain distance from each other. Thus, in placement models of access points for each zone the distribution of signal strength of combinations of access points must be considered, not only the most likely values.

The paper [11] considers the problem of optimal placement of access points. It is assumed that the distance from the mobile unit to the access point is determined by the time of arrival, or by the received signal strength. To solve this problem we apply the method of least squares. However, deterministic signal propagation model assumes.

In the works [12, 13] problem of optimal placement of access points is reduced to the problem of covering. The model is deterministic, excluding accidents. The paper [14] refers to the NP-complexity of the problem of choosing locations for access points. In this article deterministic signal propagation model assumes also.

In general it can be noted that the access points placement problem in locating system is a little studied. The majority of the works, such as [15] are dedicated to the problem of providing a given signal strength in areas.

Mathematical model. We introduce the notation for a mathematical model. Given a positioning system L = (V, d, I, S,u*D), where

• V — a set of zones, V = {v\,..., vn};

• d — metric on V;

• I — a index set of access points placements (we shall call, for brevity, set of access points);

• S — a set of signal strength values, S C Z;

• u*d — positioning function, D C I.

To simplify the notation, we assume that d(ji,j2) = d(vj1 ,vj2), here vj1,vj2 £ V. We introduce the random variables £, ni, i £ I, where

1) £ takes values from the set J = {1,...,n} and its value indicates the the zone number;

2) ni takes values from the set S that we will be interpreted the signal strength of the object sensor measurements from the access point with the number i.

Random variables n (i £ I) is assumed are mutually conditionally independent given the random variable £, i. e.

P (nil = sil ,...,Vi2 = si2 1 £ = j) =

= P (nil = Sil 1 £ = j) ... P(ni2 = si2 1 £ = j). Suppose that the probability

P(£ = j)= Pj, j £ J, P(ni = s I £ = j) = qijs, i £ I, s £ S, j £ J,

qijs = 1, i £ ^ j £ J.

ses

We introduce some additional notation:

• s — signal strength vector recorded by the mobile object from the set I access points, or any subset;

• S(D) — the set of all possible signal strength vectors from the subset of access points D C I.

Formally positioning is described by a family of functions {u*d(-)}DcI, assigning to each signal strength vector from access points some zone:

u*d : S(D) ^ V.

Next it will be considered two ways of zone selection when signal strength vector is received:

a) positioning function returns most likely zone;

b) positioning function returns the zone whith the minimum conditional expectation of errors positioning.

The values of the random variable d{v^,u*D{jj)) are called location error. The expectation of location error is

n

F(D) = M(d(vz,u*Dm) = E = SWv^uUs)).

ses(D)j=i

We will use F(D) as a criterion for comparing subsets D C I of access points. We will study the change of criteria in the case of adding a new access point. Now we formulate the optimization problem.

Problem P. Given a number of m. It is required to find a subset of the access points D C I, such that IDI = m and function F(D) takes a minimum value. Theorem 1. Problem P is NP-hard.

The proof is analogous to that NP-hard of problem presented in the article [16].

Selecting the most likely zone. Let D C I be a subset of the access points. Consider the case where the positioning function returns the zone with the maximum a posteriori probability:

u*D(s) = arg max {P(£ = j \fj = s)}. Let i'(s) be the set of the most likely zones for signal strength vector s G S(D):

= | jeJ = j \ rj=s) = max{P(i = j' \ jj = I)} J .

Let A (j, s) be the distance between the zone j G J (where in fact the object is located) and the farthest of the most likely zones for s G S(D):

A(j,s) = max: {d(vj, vf)} .

j'ef(s)

Let i/(j, s) be the zone farthest from the zone of j G J of the most likely zones for s G S(D):

s) = arg max {d(Vj, vf)} .

j'ef(s)

So A(j,s) — the distance between the zones Vj and i/(j,s). It's obvious that

d{vj;u*D{s)) < A(j,s). Hence the expectation of determining object location error is bounded from above:

ses(D)jeJ

Let us find the conditions under which the addition of access points results in a lack of increase of the upper bound of the objective function F(D). We will start with the simplest case. Let D = 0.

Let ^(0) be the set of numbers most likely zones, i. e. zones with the maximum a priori probability of the mobile object location:

*(0) = {J e J P(€ = j) = mJP(Z = j')}} -

Let A(j) be the maximum distance between the zone vj and the most likely zone:

A(j)= max {d(vj,vj,)} . j'e^W

The expectation of the distance between a randomly selected zone (in accordance with their a priori probabilities) and the farthest from it the most likely zone is

f ' = E p (z=j)A(j).

jeJ

Suppose that there is only one access point (to be specific with number 1).

Lemma 1. If for all s G S exists j G J wherein

P(£ = j I Vi = s) >

then

n = s, t=j)A(j,s) <ep(t=j)A(j)-

sesjeJ jeJ

P r o o f. It is obvious that the conditions of lemma, it follows that for any s G S done \^(s)\ = 1, that is, for any signal strength, there is exactly one most likely zone. But then the value v(j, s) are independent of j, denote them v(s) = v(j, s). It's obvious that

EE P (ni = s, t = j)A(j, s) = EE P (ni = s)P (t = j \ m = s)A(j, s) =

ses jeJ sesjeJ

= E E P(ni = s)P(t = j \ ni = s)A(j, s) +

ses jeJ\{v(s)}

+ E P (ni = s)P (t = v(s) \ ni = s)A(v(s), s). (3)

ses

As v(v(s), s) = v(s) then A(v(s), s) = 0. Consequently,

E P (ni = s)P (t = v (s) \ ni = s)A(v (s), s) = 0. (4)

ses

Let v* G ^(9) be is selected zone. Given the triangle inequality

d(j, v(s)) < d(j, v*)+d(v*,v(s)),

we get

E E p (ni = s)p a=j i ni = s)A(j,

sES jEJ\{v(s)}

= E E P(ni = s)P(t, = j | П1 = s)d(j, v(s)) <

sES jEJ\{v(s)}

^ E E P(ni = s)P(£ = j I ni = s)(d(j, v*) +d(v*,v(s))) =

sES jEJ\{v(s)}

= EE P(ni = s)P(Z = j I П1 = s)(d(j, v*) + d(v* ,v(s))) -

sES jEJ

- 2 E P(ni = s)P(£ = V(s) I ni = s)d(v*,v(s)). (5)

sES

Considering (3)-(5), and

d(j, v*) < A(j),

we get

Y.Y.P(ni = s, e = j)A(j,s) <EEP(ni = s)P(€ = j I ni = s)(d(j, V*) +

sES jEJ sESjEJ

+ d(v*,v(s))) - 2^ P(ni = s)P(i = v(s) | ni = s)d(v*,v(s)) <

ses

< EEP(ni = s)P(i = j I ni = s)(A(j)+d(v*,v(s))) -sesjeJ

- 2 E P(ni = s)P(i = v(s) I ni = s)d(v* ,v(s)) =

ses

= EE P (ni = s)P (i = j I ni = s)A(j)+EE P (ni = s)P (i = j I П1 = s)d(v* ,v(s)) -

ses jeJ ses jeJ

- 2^ P (ni = s)P (i = v(s) I ni = s)d(v* ,v(s)) = P (ni = s)P (i = j | ni = s) x

ses sesjeJ

x A(j) + E P(ni = s)d(v*,v(s)) (E P(i = j I ni = s) - 2P(i = v(s) I ni = s) I .

ses jeJ

The first term in the resulting sum is simplified as follows:

EE P (ni = s)P (i = j I ni = s)A(j) = EE P (ni = s)P (i = j I ni = s)A(j) =

ses jeJ jeJ ses

= E A(j) E P(ni = s)P(i = j I ni = s) = E P(i = j)A(j) = F'.

jeJ ses jeJ

Considering

Y,p(i=j I ni = s) = i,

jeJ

we get

EEp (ni = s, i = j)A(j,s) < F' + E P (ni = s)d(v* ,v(s))(1 - 2P (i = v (s) I ni = s)).

ses jeJ ses

Since all s e S

P(Z = v(s) I m = s) >

then

1 - 2P(i = v(s) I ni = s) < 0,

and

Y,P(ni = s)d(v*, v(s))(l - 2P(i = v(s) I ni = s)) < 0.

ses

Consequently

J2Y.P(ni = s, i = j)A(j,s) < F'.

ses jeJ

The lemma is proved. □

Here is an example in which the conditions of Lemma 1 are not met. Suppose there are three zones (vi,v2), one access point and two signal strength values (si,s2). Let the distance between the zones be

d(vi ,v2) = 10, d(v2,V3) = 10, d(vi,v3) = 20.

Let the a priori probability zones are as follows:

p(e = 1) = о.з, p(e = 2) = 0.4, p(e = з) = о.з.

Assume that the conditional probability of the signal strength in the zones are

P(ni = si | e =1)=0.75, P(ni = si I e = 2) = 0.5, P(ni = si | e = 3) = 0.25,

P(ni = s2 I e =1)=0.25, P(ni = s2 I e = 2) = 0.5, P(ni = s2 I e = 3) = 0.75.

It is easy to verify that in this case, F' = 6, F(D) = 7 and F' < F(D), that is, the use of access points reduces the accuracy of the location. Let us turn to the case when D = 0.

Theorem 2. Let DcI,ieI,i£D and for all ~s £ S(D U {«}) exist j £ {1,..., n}, that P(£ = j \ г] = ~s) ^ 7j then

sES(DU{i}) jEJ sES(D) jEJ

Proof. Let the signal strength vector s £ S(D) from access points of set D С I is fixed.

We denote P'(A) = P(A | rj = s) the conditional probability of some event A given signal strength vector s from access points of set D. Let i be index added access point.

Suppose that for all s e S there is a zone v = v'(s), which satisfies P'(e = j I ni =

Let A'(j) be the distance between the zone vj and the outermost zone vj* with the maximum probability value P'(e = j'), A'(j, s) — the distance between the zone vj and zone v'(s).

Then, according to the Lemma 1,

E E p '(m = s,e = j)A' (j, s) < e p '(e = j)A'(j).

sESjEJ jEJ

Multiply the inequality by P(rj = ~s), we get

EEp,(^ ===< ==

sESjEJ jEJ

Given that

P'(m = £ = j)P(v = s) = p(m = = j \v = s)P(v = Ю = p(v = m = = j)

and

= з)Р(й =s) = = j\v = 8)Р(й =s) = P(v = s,Z= j),

we have the inequality

EEp(^=* = s^=J)a'(J> vi = s) < E =^=яд'ш-

sESjEJ jEJ

Since = j) = P^ = j\r} = Ti), that A'(j) = A(j,s). Seeing

= J I m = s) = P(£ = j I ?? = s, щ = s) 68 Вестник СПбГУ. Прикладная математика. Информатика... 2017. Т. 13. Вып. 1

we get A'(j, s) = A(j, (?; = s, m = s)) and

EEp(^ = s, m = 8, z = j)AU, (s, 8)) < = = (6)

sesjeJ jeJ

Inequality (6) holds for any s G S(D), hence

sgs(D)s£s j£j s£s(D)j£J

or the same

]T E,P(ri=s,Z = j)A(j,s)<; J2 = =

ses(DU{i})j£J seS(D) jeJ

This proves the theorem. □

Lemma 1 is a special case of Theorem 2. To show this is sufficient to put in the theorem D = 0.

It can be concluded that the way, when the positioning function returns most likely zone, has the following disadvantage. Expectation of location error may increase, when the new access point is added.

Selecting the zone with a minimum expectation errors. Let positioning function returns the zone for which will be the minimum conditional expectation of errors positioning:

u*D(s) = arg min VP(£ = j \ rj = s)ci(fj, vk) I .

j ' ' Kk=i )

In this case, the task of finding the point Up(s) is called Fermat—Torricelli—Steiner problem.

Introduce the zone designation, for which will be the minimum expectation to randomly selected zones:

= arg min I E P(€ = j)d(u> Vj) f •

uev

jeJ

Lemma 2. For all D С I

ses(D)jeJ jeJ

Proof. Using elementary calculations, we get

ses(d)jeJ jes(d) jeJ

= E (■= ^ E= j\ ~1 = s)d(Vj, u*D(s)) ] < ses(D) \ jeJ

< E =

ses(D) \ jeJ J

Вестник СПбГУ. Прикладная математика. Информатика... 2017. Т. 13. Вып. 1 69

*

u

= E 52P(Ji=s)P(Z=3\v = s)d(vj,u*) =

ses(D) jeJ

= E E p^=J)p(Ji=s\^=mvj,u*) =

jeJses(D)

= E E

jeJ \ ses(D) J jeJ

The lemma is proved. □

Substantially Lemma 2 means, that the average value of the error location determination of the object will not be greater if the system uses the location data received from the access points.

We now show that when adding new access points expectation determining object location error does not increase.

Theorem 3. Let D C I, i e I, i / D and

u*D{s) = arg min I = j I = s)d{vj;u) > ,

ueV *—'

[jeJ )

ses(Du{i}) jeJ jes(d) jeJ

Proof. Let the signal strength vector s G S(D) from access points of set D C / is fixed.

Let P'(A) = P(A 11] = s) be the conditional probability of any event A given signal strength vector s from access points of set D. Let i be index added access point. We introduce the notation

u'(s) = nig min I E P'(t = j I Vi = s)d(u, Vj)

uV

[jeJ

and

' = arg min I EP'(€ = j)d(u, vj) f •

uev

{jeJ

Then, according to the Lemma 2,

EEp'n = s, e=j)d(Vj,u(s)) < ep'(t=j)d(vju). (7)

sesjeJ jeJ

Multiply the inequality (7) by P{jj = s), we get

EEP'^ = s^=j)P(T1 = -s)d{vh v'(s)) < EP'(i = j)P(n = ^)d(vhv!). ses jeJ jeJ

u

Given that

P'im = £ = j)P{ii = s) = P{m = = j I v = s)P(v = s) = piv = m = £ = j) P'id = J)P(V =8)= P(Z = j \rj = s)P{rj = l) = Pin =8,Z= j),

we have

sesjeJ jeJ

Since P'(£ = j) = P(£ = j | j; = s), then u' = u*D(s). It's obvious that u'(s) = 'ucu{!}(s.s) and

EEP^ = 5',?i = = j)d{vj,u*Du{i}(s,s)) < EP(Ji=s,£ = j)d{vj,u*D{s)). (8)

ses jeJ jeJ

The inequality (8) holds for any s G S(D), so

E E E = = s' ^ = j)d{vj, u*DU{i}(s, s)) <

sgs(d)sesjeJ

ses(D)jeJ

or the same

ses(Du{i}) jeJ jes(d) jeJ

The theorem is proved. □

Solution algorithm. NP-difficult problem of choosing locations for access points means that it is necessary to apply practical solutions heuristics. For many combinatorial optimization problems solution method is based on the sequential execution of the greedy algorithm and local search. The following algorithm is an adaptation of this method for solving the problem of locating positioning system access points.

Greedy algorithm. At the beginning we search an optimal location of a single access point. This position is fixed and is not changed. Then, given the location of the first access point, we search an optimal position of the second access point. This position is also fixed, and so it goes on, until we have found the location of all access points. Thus, in the greedy algorithm locations of all access points are consistently determined. Steps of greedy algorithm are: STEP 0. Let Do = 0. Go to STEP 1.

STEP k. We find an access point i G I, for which the minimum value of the objective function F(Dk-1 U {i}). Let

Dk = Dk-i U{i}.

If k = m, then let D = Dk and STOP; else otherwise go to STEP k +1.

Local search. With a greedy algorithm we search a combination of locations for m access points. Then we change placements each access point trying to improve the value

of the objective function. This continues for as long as the change in the position of each access point will not lead to an improvement in the objective function. Local search steps are:

STEP 1. Initial placement of m access points D0 we form using a greedy algorithm. Let k = 0. Go to STEP 2.

STEP 2. Let k' = k, D' = Dk. Loop through all access points i' e D'. For all i' loop over all i e I. Thus, if

F(Dk\{i'}U{i}) <F(Dk),

then assign

Dk+i = Dk\{i'} U {i},

and let k = k + 1.

STEP 3. If k' = k, then let D = Dk and STOP; else go to STEP 2. This approach lies at the basis of the developed software system. We tested the developed algorithm and software system on real data. Part of second floors of IT-park of Petrozavodsk State University with an area of 550 m2 was divided into 80 zones. Figure shows five access points placements that have been determined by developed algorithm.

Placement of five access points on the floor of the IT-park of Petrozavodsk State University

Testing location system showed that the resulting placement of access points provided in the 85% of the error in the detection of mobile objects not exceeding two meters. Such precision location was recognized quite valid and confirmed the practical applicability of the developed algorithm.

Conclusion. The proposed approach of determining the locations of the access points may be used in indoor positioning systems based on the signal strength map of the access points, for example, Wi-Fi, ZigBee, Bluetooth, nanoLOC, and generalized by using other types of sensors.

In addition, the proposed methods can be used to identify zones of the building in which the mobile object positioning error is greatest. From a practical point of view, it generates a recommendations on how to add the access point to improve the accuracy of mobile objects positioning. Described approaches and algorithms have been applied in the development of the indoor positioning technology RealTrac.

References

1. Morozova N. S. Virtual'nye formacii i virtual'nye lidery v zadache o dvizhenii stroem gruppy robotov [Virtual formations and virtual leaders in formation control problem for group of robots]. Vestnik

of Saint Petersburg University. Series 10. Applied mathematics. Computer science. Control processes, 2015, issue 1, pp. 135-148. (In Russian)

2. Sotnikova M. V. Algoritm avtomaticheskogo uderzhaniya kolesnogo robota na vizual'no zadannoj linii [Algorithm for visual path following by wheeled fully actuated mobile robot]. Vestnik of Saint Petersburg University. Series 10. Applied mathematics. Computer science. Control processes, 2016, issue 1, pp. 99-108. (In Russian)

3. Chandrasekaran G., Ergin M., Yang J., Lui S., Chen Y., Gruteser M., Martin R. Empirical evaluation of the limits of localization using signal strength: Beyond Cramer—Rao bounds. Processing of IEEE SECON, 2004, pp. 406-414.

4. Elnahrawy E., Li X., Martin R. The limits of localization using signal strength: A comparative study. Processing of IEEE SECON, 2004, pp. 406-414.

5. Galov A., Moschevikin A. Bayesian filters for ToF and RSS measurements for indoor positioning of a mobile object. Processing of the Intern. Conference on Indoor Positioning and Indoor Navigation (IPIN-2013). Montbeliard, France, October 28-31, 2013, pp. 310-317.

6. Galov A. S., Moschevikin A. P., Voronov R. V. Combination of RSS localization and ToF ranging for increasing positioning accuracy indoors. Processing of the 11th Intern. Conference on ITS Telecommunications (ITST), 2011, pp. 299-304.

7. Ata O. W., Ala'Eddin M. S., Jawadeh M. I., Amro A. I. An indoor propagation model based on a novel multi wall attenuation loss formula at frequencies 900 MHz and 2.4 GHz. Wireless Personal Communications, 2013, vol. 69, no. 1, pp. 23-36.

8. Chrysikos T., Georgopoulos G., Kotsopoulos S. Site-specific validation of ITU indoor path loss model at 2.4 GHz. IEEE Intern. Symposium on a World of Wireless, Mobile and Multimedia Networks & Workshops, 2009, pp. 1-6.

9. Molisch A. F., Balakrishnan K., Chong C. C., Emami S., Fort A., Karedal J., Schantz H., Schuster U. IEEE 802.15.4a channel model-final report. Technical Report, Document IEEE 802.1504-0062-02-004a, 2005.

10. Battiti R., Brunato M., Delai A. Optimal wireless access point placement for location-dependent services. Technical Report, 2003. Available at: http://eprints.biblio.unitn.it/489/1/DIT-03-052-withCover.pdf (accessed: 30.11.2016).

11. Chen Y., Francisco J. A., Trappe W., Martin R. P. A practical approach to landmark deployment for indoor localization. Sensor and Ad Hoc Communications and Networks, 2006. SECON'06. 3rd Annual IEEE Communications Society on IEEE, 2006, vol. 1, pp. 365-373.

12. Gondran A., Caminada A., Fondrevelle J., Baala O. Wireless LAN planning: a didactical model to optimise the cost and effective payback. Intern. Journal of Mobile Network Design and Innovation, 2007, vol. 2, no. 1, pp. 13-25.

13. Kim T., Shin J., Tak S. Cell planning for indoor object tracking based on RFID. Mobile Data Management: Systems, ¡Services and Middleware, MDM'09. Tenth Intern. Conference on IEEE, 2009, pp. 709-713.

14. Farkas K., Huszâk A., Godor G. Optimization of Wi-Fi access point placement for indoor localization. Journal IIT (Informatics & IT Today), 2013, vol. 1, no. 1, pp. 28-33.

15. Vilovic I., Burum N. Location optimization of WLAN access points based on a neural network model and evolutionary algorithms. Automatika: casopis za automatiku, mjerenje, elektroniku, racunarstvo i komunikacije [Automatika: Journal for control, measurement, electronics, computing and communications], 2015, vol. 55, no. 3, pp. 317-329.

16. Voronov R. V., Moschevikin A. P. Primenenie uslovnoj jentropii pri formirovanii rekomendacij po razmeshheniju bazovyh stancij v lokal'nyh sistemah pozicionirovanija [Use of conditional entropy for optimal disposition of base stations in local positioning systems]. Information Technology, 2014, no. 10, pp. 11-16. (In Russian)

For citation: Voronov R. V. The problem of optimal placement of access points for the indoor positioning system. Vestnik of Saint Petersburg University. Applied mathematics. Computer science. Control processes, 2017, volume 13, issue 1, pp. 61-73. DOI: 10.21638/11701/spbu10.2017.106

Статья рекомендована к печати проф. А. П. Жабко. Статья поступила в редакцию 11 декабря 2016 г. Статья принята к печати 19 января 2017 г.