METHOD AND APPARATUS FOR WIRELESS NETWORK DEPLOYMENT AND TERMINAL DEVICE

Abstract

Embodiments of this disclosure provide a method and apparatus for wireless network deployment and terminal device. The method includes: selecting a node needing to be currently deployed according to planned network information and deployed network information; calculating deployment quality of the node needing to be currently deployed at multiple test positions; and selecting a test position of highest deployment quality as a deployment position of the node needing to be currently deployed. With the embodiments of this disclosure, deployment quality of an actual deployment position of a wireless network node may be evaluated, such that actual deployment satisfies a requirement on network planning.

Claims

1. An apparatus for wireless network deployment, comprising: a first storage unit configured to store planned network information; a second storage unit configured to store deployed network information; a deployment node selecting unit configured to select a node needing to be currently deployed according to the planned network information and the deployed network information; a deployment quality calculating unit configured to calculate deployment quality of the node needing to be currently deployed at multiple test positions; and a deployment position selecting unit configured to select a test position of highest deployment quality as a deployment position of the node needing to be currently deployed.

2. The apparatus according to claim 1, wherein, the planned network information is information on a planned network and comprises a node address, a deployment position and connection relationships; and the deployed network information is information on a deployed node and comprises a node address, a deployment position and connection relationships.

3. The apparatus according to claim 1, wherein the deployment node selecting unit comprises: a calculating module configured to calculate planned connection levels between each undeployed node and all deployed nodes; and a selecting module configured to select a node of a maximum planned connection level with the deployed nodes from undeployed nodes as the node needing to be currently deployed.

4. The apparatus according to claim 3, wherein the planned connection level refers to a sum of the number of nodes in all the deployed nodes having a planned connection relationship with each undeployed node.

5. The apparatus according to claim 1, wherein the deployment quality is inversely proportional to a difference between link quality in a planned network and link quality in a deployed network, and/or the deployment quality is proportional to the number of deployed neighboring nodes in planned neighboring nodes.

6. The apparatus according to claim 5, wherein the deployment quality calculating unit calculates the deployment quality of the node needing to be currently deployed at each test position according to a formula below: $Q_{i} = \frac{.Math. B_{i} .Math. B_{i}^{'} .Math.}{\underset{N_{j} \in N^{'}}{.Math.} .Math. .Math. k_{j} .Math. d (L_{i, j}, L_{i, j}^{'})};$ where, Q.sub.i is deployment quality of a node N.sub.i at a test position, N′ is a set of all the deployed nodes, B.sub.i is a set of neighboring nodes of the node N.sub.i the planned network, B.sub.i′ is a set of neighboring nodes of the node N.sub.i in the deployed network, L.sub.i,j is quality of a link between the node N.sub.i and a node N.sub.j in the planned network, L.sub.i,j′ is quality of a link between the node N.sub.i and the node N.sub.j in the deployed network, d( ) is a function for calculating a distance, |.Math.| is the number of elements in a set, and k.sub.j is a weight, k.sub.j≧0.

7. The apparatus according to claim 6, wherein the apparatus further comprises: a third storage unit configured to store a calculation result of the deployment quality calculating unit, the calculation result comprising: an address of the node needing to be currently deployed, multiple test positions corresponding to the node needing to be currently deployed, and deployment quality of the node needing to be currently deployed at each test position.

8. Terminal device, comprising the apparatus as claimed in claim 1.

9. A method for wireless network deployment, comprising: selecting a node needing to be currently deployed according to planned network information and deployed network information; calculating deployment quality of the node needing to be currently deployed at multiple test positions; and selecting a test position of highest deployment quality as a deployment position of the node needing to be currently deployed.

10. The method according to claim 9, wherein the planned network information is information on a planned network and includes a node address, a deployment position and connection relationships; and the deployed network information is information on a deployed node and includes a node address, a deployment position and connection relationships.

11. The method according to claim 9, wherein the calculating deployment quality of the node needing to be currently deployed at multiple test positions includes: calculating planned connection levels between each undeployed node and all deployed nodes; and selecting a node of a maximum planned connection level with the deployed nodes from undeployed nodes as the node needing to be currently deployed.

12. The method according to claim 11, wherein the planned connection level refers to a sum of the number of nodes in all the deployed nodes having a planned connection relationship with each undeployed node.

13. The method according to claim 9, wherein the deployment quality is inversely proportional to a difference between link quality in a planned network and link quality in a deployed network, and/or the deployment quality is proportional to the number of deployed neighboring nodes in planned neighboring nodes.

14. The method according to claim 13, wherein the deployment quality of the node needing to be currently deployed at each test position is calculated according to a formula below: $Q_{i} = \frac{.Math. B_{i} .Math. B_{i}^{'} .Math.}{\underset{N_{j} \in N^{'}}{.Math.} .Math. .Math. k_{j} .Math. d (L_{i, j}, L_{i, j}^{'})};$ where, Q.sub.i is deployment quality of a node N.sub.i at a test position, N′ is a set of all the deployed nodes, B.sub.i is a set of neighboring nodes of the node N.sub.i in the planned network, B.sub.i′ is a set of neighboring nodes of the node N.sub.i in the deployed network, L.sub.i,j is quality of a link between the node N.sub.i and a node N.sub.j in the planned network, L.sub.i,j′ is quality of a link between the node N.sub.i and the node N.sub.j in the deployed network, d( ) is a function for calculating a distance, |.Math.| is the number of elements in a set, and k.sub.j is a weight, k.sub.j≧0.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0023] The drawings are included to provide further understanding of this disclosure, which constitute a part of the specification and illustrate the exemplary embodiments of this disclosure, and are used for setting forth the principles of this disclosure together with the description. It is clear and understood that the accompanying drawings in the following description are some embodiments of this disclosure, and for those of ordinary skills in the art, other accompanying drawings may be obtained according to these accompanying drawings without making an inventive effort. In the drawings:

[0024] FIG. 1 is a schematic diagram of an apparatus for wireless network deployment of Embodiment 1;

[0025] FIG. 2 is a schematic diagram of an example of a planned network;

[0026] FIG. 3 is a schematic diagram of an example of a deployed network;

[0027] FIG. 4 is a schematic diagram of an example of a deployment node selecting unit;

[0028] FIG. 5 is a schematic diagram of an example of calculating deployment quality;

[0029] FIG. 6 is a schematic diagram of an example of selecting a deployment node;

[0030] FIG. 7 is a schematic diagram of an example of a deployment process;

[0031] FIG. 8 is a schematic diagram of a terminal device of Embodiment 2;

[0032] FIG. 9 is a schematic diagram of a systematic diagram of the terminal device of Embodiment 2; and

[0033] FIG. 10 is a schematic diagram of a method for wireless network deployment of Embodiment 3.

DETAILED DESCRIPTION OF THE DISCLOSURE

[0034] These and further aspects and features of the present disclosure will be apparent with reference to the following description and attached drawings. In the description and drawings, particular embodiments of the disclosure have been disclosed in detail as being indicative of some of the ways in which the principles of the disclosure may be employed, but it is understood that the disclosure is not limited correspondingly in scope. Rather, the disclosure includes all changes, modifications and equivalents coming within the terms of the appended claims.

[0035] The embodiments of this disclosure shall be described below with reference to the accompanying drawings.

Embodiment 1

[0036] An embodiment of this disclosure provides an apparatus for wireless network deployment. FIG. 1 is a schematic diagram of the apparatus. Referring to FIG. 1, the apparatus 100 includes: a first storage unit 101, a second storage unit 102, a deployment node selecting unit 103, a deployment quality calculating unit 104 and a deployment position selecting unit 105. The first storage unit 101 is configured to store planned network information, the second storage unit 102 is configured to store deployed network information, the deployment node selecting unit 103 is configured to select a node needing to be currently deployed according to the planned network information and the deployed network information, the deployment quality calculating unit 104 is configured to calculate deployment quality of the node needing to be currently deployed at multiple test positions, and the deployment position selecting unit 105 is configured to select a test position of highest deployment quality as a deployment position of the node needing to be currently deployed.

[0037] In this embodiment, the planned network information stored by the first storage unit 101 is a design result of the wireless network. The second storage unit 102 stores information on network after deployment. A wireless network contains multiple nodes, and in deploying the network, the nodes need to be respectively deployed and mounted in a certain order. The deployment node selecting unit 103 selects a node needing to be currently deployed according to the planned network information and the deployed network information. The deployment quality calculating unit 104 evaluates deployment quality of the node at multiple positions. And the deployment position selecting unit 105 selects an optimal deployment position of the node according to deployment quality of the node at the positions.

[0038] With the apparatus of this embodiment, the deployment quality of the actual deployment position of the wireless network node may be evaluated, such that the actual deployment satisfies a requirement on network planning.

[0039] The components of the apparatus 100 for wireless network deployment of this embodiment shall be described below respectively.

[0040] In this embodiment, the first storage unit 101 stores planed information on network, briefly referred to as planned network information, and the planned network information is information on a network expected to be deployed. Before network deployment, according to information on demands of users, a deployment environment, and a node performance, etc., the planned network information is generated by manually designing the network or automatically planning the network by planning software, the planned network information may include an address, a position, and connection relationships, etc., of a node in the network. The address of the node is an index used for uniquely identifying the node. The position of the node is used for indicating an expected position of node deployment, which may be an accurate position coordinate, or several alternative position coordinates, or a deployment range. The connection relationships of the node are requirements on performance of wireless links between a node and other nodes in a process of network planning. A connection relationship between a node and another node may be expressed by quality of a link between them, or a packet reception ratio of a wireless link between them, or other single or complex indices. Table 1 shows an example of the planned network information.

TABLE-US-00001 TABLE 1 Deployment Neighboring Node address position node address Link quality N.sub.i P.sub.i NN.sub.i, 1 L.sub.i, 1 NN.sub.i, 2 L.sub.i, 2 . . . . . . NN.sub.i, m L.sub.i, m

[0041] As shown in Table 1, the planned network information includes a node address, a deployment position, a neighboring node address, and link quality, etc., where, P.sub.i is a coordinate of a deployment position of a node N.sub.i, NN.sub.i,j is a neighboring node of the node Ni, and 1≦j≦m, m being the number of planned neighboring nodes of the node N.sub.i. Quality of link between nodes in Table 1 is used to express a connection relationship therebetween; where, L.sub.i,j is quality of a link between the node N.sub.i and its neighboring node NN.sub.i,j.

[0042] FIG. 2 is an example of the planned network. As shown in FIG. 2, the planned network consists of six nodes, connection lines between the nodes denoting that the nodes are mutually neighboring nodes, that is, they may communicate directly. Hence, in FIG. 2, neighboring nodes of node 1 are node 0 and node 2, neighboring nodes of node 2 are node 0, node 1, node 3 and node 4, and so on. Table 2 is an example of planned network information of node 4 in FIG. 2.

TABLE-US-00002 TABLE 2 Deployment Neighboring Node address position node address Link quality 4 P.sub.4 2 L.sub.4, .sub.2 3 L.sub.4, 3 5 L.sub.4, 5

[0043] As shown in Table 2, the address of the node is 4, the deployment position is P.sub.4, its neighboring nodes are nodes 2, 3 and 5, and quality of links between it and its neighboring nodes is L.sub.4,2, L.sub.4,3 and L.sub.4,5, respectively.

[0044] In this embodiment, the second storage unit 102 stores and administrates information on deployed nodes in the network, briefly referred to as deployed network information. Actually measured qualities of links, between a node after deployment and other deployed nodes, etc., belong to the deployed network information. Table 3 shows an example of the deployed network information.

TABLE-US-00003 TABLE 3 Deployment Neighboring Node address position node address Link quality N.sub.i P′.sub.i NN′.sub.i, 1 L′.sub.i, 1 NN′.sub.i, 2 L′.sub.i, 2 . . . . . . NN′.sub.i, m′ L′.sub.i, m′

[0045] Similar to Table 2, Table 3 includes a node address, a deployment position, a neighboring node address, and link quality. However, Table 2 is a table of the planned network information, in which the information is obtained by designing and planning, and is a target of network deployment. Table 3 is a table of the deployed network information, in which the information is obtained by actual measurement after the network node deployment, and is a result after the network deployment. In Table 3, N.sub.i is the address of the node, P.sub.i′ is the deployment position of the node, NN.sub.i,j′ is an address of a neighboring node of the node, and L.sub.i,j′ is quality of a link between the node and the neighboring node; where, 1≦j≦m′, m′ being the number of neighboring nodes of the node N.sub.i after the deployment.

[0046] FIG. 3 is an example of the deployed network, which corresponds to the planned network in FIG. 2. The number of the nodes in the deployed network shown in FIG. 3 is less than that of the nodes in the planned network shown in FIG. 2, because the process of network deployment has not been finished completely, and node 4 and node 5 need to be deployed. As the deployed network is limited by an actual environment, and there possibly exist differences between connection relationships between nodes in the deployed network and that in a planned network. For example, in the planned network shown in FIG. 2, node 0 and node 2 are mutually neighboring nodes, and may communicate directly; however, in the deployed network shown in FIG. 3, node 0 and node 2 cannot communicate directly. It is normal in network deployment that there exist differences between connection relationships between nodes in a planned network and that in a deployed network. In a case where a planned network and a deployed network have different connection relationships, it needs to ensure that the planned network and the deployed network have identical performance, such as a packet reception ratio.

[0047] Table 4 is an example of the deployment information of node 2 in the deployed network shown in FIG. 3. As shown in FIG. 3, node 2 has two neighboring nodes, which are node 1 and node 3, respectively. Quality of a link between node 2 and node 1 is L′.sub.2,1, and quality of a link between node 2 and node 3 is L′.sub.2,3.

TABLE-US-00004 TABLE 4 Deployment Neighboring Node address position node address Link quality 2 P′.sub.2 1 L′.sub.2, 1 3 L′.sub.2, 3

[0048] According to FIG. 3, deployment information of other nodes (node 0, node 1 and node 3) may be obtained, description of which being omitted herein.

[0049] In this embodiment, as a wireless network contains multiple nodes, in deploying the network, the nodes need to be respectively deployed and mounted in a certain order. The deployment node selecting unit 103 may select a node needing to be currently deployed according to the planned network information and the deployed network information. FIG. 3 shows a deployed network corresponding to the planned network shown in FIG. 2, in which deployment of node 4 and node 5 has not been finished. The deployment node selecting unit 103 may select a node for deployment from the nodes of which deployment has not been finished. Hence, for the networks shown in FIGS. 2 and 3, the deployment node selecting unit 103 will determine an order of deployment of node 4 and node 5.

[0050] In an implementation, the deployment node selecting unit 103 selects a node of a maximum planned connection level with the deployed nodes from undeployed nodes as the node needing to be currently deployed. The planned connection level here refers to a sum of the number of nodes in all the deployed nodes having a planned connection relationship with each undeployed node.

[0051] FIG. 4 is a schematic diagram of an implementation of the deployment node selecting unit 103. As shown in FIG. 4, in this implementation, the deployment node selecting unit 103 includes a calculating module 401 and a selecting module 402. The calculating module 401 calculates planned connection levels between each undeployed node and all deployed nodes, and the selecting module 402 selects a node of a maximum planned connection level with the deployed nodes from undeployed nodes as the node needing to be currently deployed.

[0052] In this implementation, the calculating module 401 may calculate the planned connection levels between each undeployed node and all deployed nodes according to formula (1) below, and the selecting module 402 may select the node of a maximum planned connection level with the deployed nodes from the undeployed nodes as the node needing to be currently deployed according to formula (2) below:

[00001] $\begin{matrix} D_{i} = \underset{N_{j} \in N^{'}}{.Math.} .Math. .Math. l_{i, j}, & (1) \\ N_{x} = \underset{N_{i} \in N / N^{'}}{argmax} .Math. D_{i} . & (2) \end{matrix}$

[0053] In formulae (1) and (2), N is a set of all the planned nodes, N′ is a set of all the deployed nodes, N/N′ is a set of all the undeployed nodes, l.sub.i,j is a planned connection relationship between a node N.sub.i and a node N.sub.j, D.sub.i is a planned connection level between the node N.sub.i and all the deployed nodes (a deployed network N′), and N.sub.x is the node needing to be currently deployed.

[0054] In an implementation, if the node N.sub.i and the node N.sub.j are neighboring nodes in the planned network, l.sub.i,j is 1; otherwise, l.sub.i,j is 0. Taking the planned network shown in FIG. 2 and the deployed network shown in FIG. 3 as examples, in the networks to which FIG. 2 and FIG. 3 correspond, the set of all the planned nodes is N={0,1,2,3,4,5}, the set of all the deployed nodes is N′={0,1,2,3}, and the set of all the undeployed nodes is N/N′={4,5}. According to the calculation of the calculating module 401, the connection level between the node 4 and the deployed nodes is D.sub.4=2, since the node 4 and the deployed nodes 2 and 3 are neighboring nodes in the planned network; and the connection level between the node 5 and the deployed nodes is D.sub.5=1, since the node 5 and the deployed node 3 are neighboring nodes in the planned network. Hence, the selecting module 402 may select a node of a maximum planned connection level with the deployed nodes from the nodes 4 and 5, hence, N.sub.x=4, that is, the node needing to be currently deployed is the node 4.

[0055] In another implementation, l.sub.i,j=min(L.sub.i,j/L.sub.stable, 1); where, L.sub.i,j denotes quality of a link between the node N.sub.i and the node N.sub.j, and L.sub.stable is link quality of a stable link. That is, in calculating the planned connection relationship l.sub.i,j between the node N.sub.i and the node N.sub.j, link quality of a wireless link is taken into account.

[0056] In this embodiment, after the node needing to be currently deployed is determined, the deployment quality calculating unit 104 may calculate the deployment quality of the node at multiple test positions. For example, for each test position, the deployment quality calculating unit 104 may evaluate deployment quality of the node at the test position by comparing a difference between deployment information of the node at the test position and planned information of the node. At a certain test position, the closer the deployment information of the node and its planned information is, the higher the deployment quality of the node at this test position is; otherwise, the lower the deployment quality is.

[0057] In this embodiment, the deployment quality is inversely proportional to a difference between the link quality in the planned network and the link quality in the deployed network, or the deployment quality is proportional to the number of deployed neighboring nodes in the planned neighboring nodes; or the deployment quality is inversely proportional to the difference between the link quality in the planned network and the link quality in the deployed network, and is proportional to the number of deployed neighboring nodes in the planned neighboring nodes.

[0058] In an implementation, the deployment quality calculating unit 104 may calculate a weighted sum of distances between the planned quality of the links between the node and all the deployed nodes and the deployed quality of the links between the node and all the deployed nodes, and divide the number of the deployed neighboring nodes in the planned neighboring nodes by the weighted sum of the distances, so as to obtain the deployment quality of the node at the current test position, which is as shown in formula (3) below:

[00002] $Q_{i} = \frac{.Math. B_{i} .Math. B_{i}^{'} .Math.}{\underset{N_{j} \in N^{'}}{.Math.} .Math. .Math. k_{j} .Math. d (L_{i, j}, L_{i, j}^{'})};$

[0059] In formula (3), Q; is deployment quality of a node N.sub.i at a position, the larger a value of Q.sub.i is, the higher the deployment quality is, otherwise, the smaller a value of Q.sub.i is, the lower the deployment quality is. N′ is a set of all the deployed nodes, B.sub.i is a set of neighboring nodes of the node N.sub.i in the planned network, that is, the set of the planned neighboring nodes of the node N.sub.i, B.sub.i′ is a set of neighboring nodes of the node N.sub.i in the deployed network, that is, the set of the deployed neighboring nodes of the node N.sub.i, L.sub.i,j is the quality of the link between the node N.sub.i and the node N.sub.j in the planned network, L.sub.i,j′ is the quality of the link between the node N.sub.i and the node N.sub.j in the deployed network, d( ) is a function for calculating a distance, |.Math.| is the number of elements in a set, and k.sub.j is a weight, k.sub.j≧0. When two nodes are not neighboring nodes, quality of a link between them needs to be processed specially. For example, if a packet reception ratio is used to evaluate quality of a link, a packet reception ratio between nonneighboring nodes is 0; and if a signal strength is used to evaluate quality of a link, a signal strength between nonneighboring nodes is a value less than a reception sensitivity.

[0060] According to formula (3), the deployment quality calculating unit 104 may obtain the deployment quality of the node needing to be currently deployed at each test position through calculation.

[0061] FIG. 5 is an example of calculating the deployment quality, a planned network to which it corresponds being the planned network shown in FIG. 2. As shown in FIG. 5, the node 0, node 1, node 2 and node 3 are deployed nodes, hence, the set of deployment nodes is N′={0,1,2,3,}. The node 4 is a node that is being deployed, and deployment quality of this node at the current position needs to be calculated. According to FIG. 2 and Table 2, in the planned network, the neighboring nodes of the node 4 are the node 2, node 3 and node 5, that is, B.sub.4={2,3,5}, and corresponding quality of links is L.sub.4,2, L.sub.4,3 and L.sub.4,5, respectively; and according to FIG. 5, in the deployed network, the neighboring nodes of the node 4 are the node 2 and node 3, that is, B.sub.4′={2,3}, and corresponding quality of links is L′.sub.4,2 and L′.sub.4,3, respectively. The deployment quality of the node 4 obtained according to formula (3) is:

[00003] $\begin{matrix} Q_{4} = \frac{2}{k_{0} .Math. d (L_{4, 0}, L_{4, 0}^{'}) + k_{1} .Math. d (L_{4, 1}, L_{4, 1}^{'}) + k_{2} .Math. d (L_{4, 2}, L_{4, 2}^{'}) + k_{3} .Math. d (L_{4, 3}, L_{4, 3}^{'})} . & (4) \end{matrix}$

[0062] As the node 4 and the nodes 0 and 1 are nonneighboring nodes both in the planned network and the deployed network, in formula (4), d(L.sub.4,0, L′.sub.4,0)=0, and d(L.sub.4,1, L′.sub.4,1)=0.

[0063] In this embodiment, after the deployment quality calculating unit 104 evaluates the deployment quality of the node needing to be currently deployed at multiple test positions, the deployment position selecting unit 105 may select an optimal position from these test positions and take it as the deployment position of the node. In an implementation, the deployment position selecting unit 105 may select a test position of highest deployment quality from the multiple test positions as the deployment position of the node.

[0064] FIG. 6 is an example of selecting the deployment position, a planned network to which it corresponds being the planned network shown in FIG. 2. As shown in FIG. 6, the node 4 is a node that is being deployed, and deployment quality is evaluated respectively at a test position P and a test position P.sub.4.sup.2; at the test position P.sub.4.sup.1, the deployment quality of the node 4 is Q.sub.4.sup.1=0.5, and at the test position P.sub.4.sup.2, the deployment quality of the node 4 is Q.sub.4.sup.2=0.2. Hence, the deployment position selecting unit 105 selects a test position of highest deployment quality, i.e. P.sub.4.sup.1, as the deployment position of the node 4.

[0065] In this embodiment, deployment quality of the node at different test positions may be stored. As shown in FIG. 1, the apparatus 100 may further include:

[0066] a third storage unit 106 configured to store a calculation result of the deployment quality calculating unit 104, the calculation result including: an address of the node needing to be currently deployed, multiple test positions corresponding to the node needing to be currently deployed, and deployment quality of the node needing to be currently deployed at each test position.

[0067] In this embodiment, in deploying the network, deployment quality of the node needs to be evaluated at different test positions, and the third storage unit 106 may store the deployment quality of the node at different test positions. Hence, the deployment position selecting unit 105 may select the deployment position for the node needing to be currently deployed according to information stored in the third storage unit 106.

[0068] Table 5 is an example of the deployment quality stored in the third storage unit 106.

TABLE-US-00005 TABLE 5 Node address Test position Deployment quality N.sub.i P.sub.i.sup.1 Q.sub.i.sup.1 . . . . . . P.sub.i.sup.n Q.sub.i.sup.n

[0069] As shown in Table 5, N.sub.i is an address of a node, P.sub.i.sup.k is a test position where the node N.sub.i is attempted to be deployed, 1≦k≦n, and Q.sub.i.sup.k is deployment quality of the node N.sub.i at the test position P.sub.i.sup.k,1≦k≦n, the deployment quality being obtained by the deployment quality calculating unit 104 through calculation.

[0070] The apparatus 100 of this embodiment shall be described below with reference to a process of deployment of a node.

[0071] FIG. 7 is a schematic diagram of an example of a process of deployment of a node by using the apparatus 100 of this embodiment. As shown in FIG. 7, the process includes:

[0072] step 701: planned information and deployed information are acquired;

[0073] step 702: a node needing to be deployed is selected;

[0074] step 703: deployment quality of the node at a certain position is calculated;

[0075] step 704: information on deployment quality is stored; and

[0076] step 705: a deployment position is selected for the node.

[0077] In step 701, the planned information and deployed information of the network are acquired first respectively from the first storage unit 101 and the second storage unit 102. The planned network information is information on the number of nodes expected to be deployed, and connection relationships between nodes, etc. (refer to Table 1 for details), and the deployed network information is information on a deployed network (refer to Table 3 for details), and if the network has not been deployed, the deployed network information is empty.

[0078] In step 702, the deployment node selecting unit 103 selects a node N.sub.x for deployment from undeployed nodes according to the planned network information and the deployed network information.

[0079] In deploying the node, deployment quality of the node N.sub.x needs to be tested at multiple test positions P.sub.i, P.sub.i ε {P.sub.1, . . . , P.sub.n}.

[0080] In step 703, for each test position P.sub.i, P.sub.i ε {P.sub.1 . . . , P.sub.n}, the deployment quality calculating unit 104 may calculate the deployment quality Q.sub.i of the node N.sub.x at the test position, i being from 1 to n.

[0081] In step 704, the third storage unit 106 may store a calculation result of the deployment quality calculating unit 104, that is, the deployment quality Q.sub.i of the node N.sub.x at each test position P.sub.i, including N.sub.x, P.sub.i and Q.sub.i (refer to Table 5 for details).

[0082] In step 705, the deployment position selecting unit 105 may select a test position of highest deployment quality from the multiple test positions, according to the information on the deployment quality stored in the third storage unit 106, as the deployment position of the node N.sub.x.

[0083] With the apparatus of the embodiment of this disclosure, the deployment quality of an actual deployment position of the wireless network node may be evaluated, such that actual deployment satisfies a requirement on network planning.

Embodiment 2

[0084] An embodiment of this disclosure provides a terminal device, including the apparatus for wireless network deployment described in Embodiment 1.

[0085] FIG. 8 is a schematic diagram of the terminal device. As shown in FIG. 8, the terminal device 800 includes an apparatus 100 for wireless network deployment, the apparatus 100 being configured to: select a node needing to be currently deployed according to planned network information and deployed network information; calculate deployment quality of the node needing to be currently deployed at multiple test positions; and select a test position of highest deployment quality as a deployment position of the node needing to be currently deployed. As the apparatus 100 for wireless network deployment has been described in detail in Embodiment 1, its contents are incorporated herein, which shall not be described herein any further.

[0086] FIG. 9 is a schematic diagram of a systematic diagram of the terminal device of this embodiment. As shown in FIG. 9, the terminal device 900 may include a central processing unit 901 and a memory 902, the memory 902 being coupled to the central processing unit 901. It should be noted that this figure is illustrative only, and other types of structures may also be used, so as to supplement or replace this structure and achieve a telecommunications function or other functions.

[0087] In an implementation, the functions of the apparatus 100 for wireless network deployment described in Embodiment 1 may be integrated into the central processing unit 901. For example, the central processing unit 901 may be configured to: select a node needing to be currently deployed according to planned network information and deployed network information; calculate deployment quality of the node needing to be currently deployed at multiple test positions; and select a test position of highest deployment quality as a deployment position of the node needing to be currently deployed.

[0088] In another implementation, the apparatus 100 for wireless network deployment described in Embodiment 1 and the central processing unit 901 may be configured separately. For example, the apparatus 100 may be configured as a chip connected to the central processing unit 901, with its functions being realized under control of the central processing unit 901.

[0089] As shown in FIG. 9, the terminal device 900 may further include a communication module 903, an input unit 904, an audio processor 905, a display 906 and a power supply 907. It should be noted that the terminal device 900 does not necessarily include all the parts shown in FIG. 9, and furthermore, the terminal device 900 may include parts not shown in FIG. 9, and the prior art may be referred to.

[0090] As shown in FIG. 9, the central processing unit 901 is sometimes referred to as a controller or control, and may include a microprocessor or other processor devices and/or logic devices. The central processing unit 901 receives input and controls operations of every components of the terminal device 900.

[0091] In this embodiment, the memory 902 may be, for example, one or more of a buffer memory, a flash memory, a hard drive, a mobile medium, a volatile memory, a nonvolatile memory, or other suitable devices, which may store the above planned network information and deployed network information, and may further store a program executing related information. And the central processing unit 901 may execute the program stored in the memory 902, so as to realize information storage or processing, etc. Functions of other parts are similar to those of the prior art, which shall not be described herein any further. The parts of the terminal device 900 may be realized by specific hardware, firmware, software, or any combination thereof, without departing from the scope of the present disclosure.

[0092] With the terminal device of the embodiment of this disclosure, the deployment quality of an actual deployment position of the wireless network node may be evaluated, such that actual deployment satisfies a requirement on network planning.

Embodiment 3

[0093] An embodiment of this disclosure provides a method for wireless network deployment. As principles of the method for solving problems are similar to that of the apparatus of Embodiment 1, the implementation of the apparatus of Embodiment 1 may be referred to for implementation of the method, with identical contents being not going to be described herein any further.

[0094] FIG. 10 is a flowchart of an implementation of the method for wireless network deployment of this embodiment. Referring to FIG. 10, the method includes:

[0095] step 1001: a node needing to be currently deployed is selected according to planned network information and deployed network information;

[0096] step 1002: deployment quality of the node needing to be currently deployed at multiple test positions is calculated; and

[0097] step 1003: a test position of highest deployment quality is selected as a deployment position of the node needing to be currently deployed.

[0098] In this embodiment, the planned network information is information on a planned network and includes a node address, a deployment position and connection relationships, and the deployed network information is information on a deployed network, and includes a node address, a deployment position and connection relationships. Embodiment 1 may be referred to for details, which shall not be described herein any further.

[0099] In this embodiment, in step 1001, planned connection levels between each undeployed node and all deployed nodes may be calculated first, and then a node of a maximum planned connection level with the deployed nodes is selected from undeployed nodes as the node needing to be currently deployed. In this embodiment, the planned connection level refers to a sum of the number of nodes in all the deployed nodes having a planned connection relationship with each undeployed node.

[0100] In this embodiment, the deployment quality is inversely proportional to a difference between link quality in a planned network and link quality in a deployed network, and/or the deployment quality is proportional to the number of deployed neighboring nodes in planned neighboring nodes.

[0101] In an implementation of step 1002, the deployment quality of the node needing to be currently deployed at each test position may be calculated according to a formula below:

[00004] $Q_{i} = \frac{.Math. B_{i} .Math. B_{i}^{'} .Math.}{\underset{N_{j} \in N^{'}}{.Math.} .Math. .Math. k_{j} .Math. d (L_{i, j}, L_{i, j}^{'})};$

where, Q.sub.i is deployment quality of a node N.sub.i at a test position, N′ is a set of all the deployed nodes, B.sub.i is a set of neighboring nodes of the node N.sub.i in the planned network, B.sub.i′ is a set of neighboring nodes of the node N.sub.i in the deployed network, L.sub.i,j is quality of a link between the node N.sub.i and a node N.sub.j in the planned network, L.sub.i,j′ is quality of a link between the node N.sub.i and the node N.sub.j in the deployed network, d( ) is a function for calculating a distance, |.Math.| is the number of elements in a set, and k.sub.j is a weight, k.sub.j≧0.

[0102] In this embodiment, the above planned network information, deployed network information and the above information on deployment quality may be stored in a storing unit.

[0103] With the method of the embodiment of this disclosure, the deployment quality of an actual deployment position of the wireless network node may be evaluated, such that actual deployment satisfies a requirement on network planning.

[0104] An embodiment of the present disclosure further provides a computer readable program code, which, when executed in terminal device, will cause the terminal device to carry out the method as described in Embodiment 3.

[0105] An embodiment of the present disclosure further provides a computer readable medium, including a computer readable program code, which will cause terminal device to carry out the method as described in Embodiment 3.

[0106] The above apparatuses and methods of the present disclosure may be implemented by hardware, or by hardware in combination with software. The present disclosure relates to such a computer-readable program that when the program is executed by a logic device, the logic device is enabled to carry out the apparatus or components as described above, or to carry out the methods or steps as described above. The present disclosure also relates to a storage medium for storing the above program, such as a hard disk, a floppy disk, a CD, a DVD, and a flash memory, etc.

[0107] The present disclosure is described above with reference to particular embodiments. However, it should be understood by those skilled in the art that such a description is illustrative only, and not intended to limit the protection scope of the present disclosure. Various variants and modifications may be made by those skilled in the art according to the spirits and principle of the present disclosure, and such variants and modifications fall within the scope of the present disclosure.

[0108] For implementations of the present disclosure containing the above embodiments, following supplements are further disclosed.

[0109] Supplement 1. An apparatus for wireless network deployment, comprising:

[0110] a first storage unit configured to store planned network information;

[0111] a second storage unit configured to store deployed network information;

[0112] a deployment node selecting unit configured to select a node needing to be currently deployed according to the planned network information and the deployed network information;

[0113] a deployment quality calculating unit configured to calculate deployment quality of the node needing to be currently deployed at multiple test positions; and

[0114] a deployment position selecting unit configured to select a test position of highest deployment quality as a deployment position of the node needing to be currently deployed.

[0115] Supplement 2. The apparatus according to supplement 1, wherein,

[0116] the planned network information is information on a planned network and includes a node address, a deployment position and connection relationships;

[0117] and the deployed network information is information on a deployed node and includes a node address, a deployment position and connection relationships.

[0118] Supplement 3. The apparatus according to supplement 1, wherein the deployment node selecting unit includes:

[0119] a calculating module configured to calculate planned connection levels between each undeployed node and all deployed nodes; and

[0120] a selecting module configured to select a node of a maximum planned connection level with the deployed nodes from undeployed nodes as the node needing to be currently deployed.

[0121] Supplement 4. The apparatus according to supplement 3, wherein the planned connection level refers to a sum of the number of nodes in all the deployed nodes having a planned connection relationship with each undeployed node.

[0122] Supplement 5. The apparatus according to supplement 1, wherein the deployment quality is inversely proportional to a difference between link quality in a planned network and link quality in a deployed network, and/or the deployment quality is proportional to the number of deployed neighboring nodes in planned neighboring nodes.

[0123] Supplement 6. The apparatus according to supplement 5, wherein the deployment quality calculating unit calculates the deployment quality of the node needing to be currently deployed at each test position according to a formula below:

[00005] $Q_{i} = \frac{.Math. B_{i} .Math. B_{i}^{'} .Math.}{\underset{N_{j} \in N^{'}}{.Math.} .Math. .Math. k_{j} .Math. d (L_{i, j}, L_{i, j}^{'})};$

[0124] where, Q.sub.i is deployment quality of a node N.sub.i at a test position, N′ is a set of all the deployed nodes, B.sub.i is a set of neighboring nodes of the node N.sub.i in the planned network, B.sub.i′ is a set of neighboring nodes of the node N.sub.i in the deployed network, L.sub.i,j is quality of a link between the node N.sub.i and a node N.sub.j in the planned network, L.sub.i,j′ is quality of a link between the node N.sub.i and the node N.sub.j in the deployed network, d( ) is a function for calculating a distance, |.Math.| is the number of elements in a set, and k.sub.j is a weight, k.sub.j≧0.

[0125] Supplement 7. The apparatus according to supplement 6, wherein the apparatus further includes:

[0126] a third storage unit configured to store a calculation result of the deployment quality calculating unit, the calculation result including: an address of the node needing to be currently deployed, multiple test positions corresponding to the node needing to be currently deployed, and deployment quality of the node needing to be currently deployed at each test position.

[0127] Supplement 8. Terminal device, including the apparatus as described in supplement 1.

[0128] Supplement 9. A method for wireless network deployment, including:

[0129] selecting a node needing to be currently deployed according to planned network information and deployed network information;

[0130] calculating deployment quality of the node needing to be currently deployed at multiple test positions; and

[0131] selecting a test position of highest deployment quality as a deployment position of the node needing to be currently deployed.

[0132] Supplement 10. The method according to supplement 9, wherein the planned network information is information on a planned network and includes a node address, a deployment position and connection relationships; and the deployed network information is information on a deployed node and includes a node address, a deployment position and connection relationships.

[0133] Supplement 11. The method according to supplement 9, wherein the calculating deployment quality of the node needing to be currently deployed at multiple test positions includes:

[0134] calculating planned connection levels between each undeployed node and all deployed nodes; and

[0135] selecting a node of a maximum planned connection level with the deployed nodes from undeployed nodes as the node needing to be currently deployed.

[0136] Supplement 12. The method according to supplement 11, wherein the planned connection level refers to a sum of the number of nodes in all the deployed nodes having a planned connection relationship with each undeployed node.

[0137] Supplement 13. The method according to supplement 9, wherein the deployment quality is inversely proportional to a difference between link quality in a planned network and link quality in a deployed network, and/or the deployment quality is proportional to the number of deployed neighboring nodes in planned neighboring nodes.

[0138] Supplement 14. The method according to supplement 13, wherein the deployment quality of the node needing to be currently deployed at each test position is calculated according to a formula below:

[00006] $Q_{i} = \frac{.Math. B_{i} .Math. B_{i}^{'} .Math.}{\underset{N_{j} \in N^{'}}{.Math.} .Math. .Math. k_{j} .Math. d (L_{i, j}, L_{i, j}^{'})};$

[0139] where, Q.sub.i is deployment quality of a node N.sub.i at a test position, N′ is a set of all the deployed nodes, B.sub.i is a set of neighboring nodes of the node N.sub.i in the planned network, B.sub.i′ is a set of neighboring nodes of the node N.sub.i in the deployed network, L.sub.i,j is quality of a link between the node N.sub.i and a node N.sub.j in the planned network, L.sub.i,j′ is quality of a link between the node N.sub.i and the node N.sub.j in the deployed network, d( ) is a function for calculating a distance, |.Math.| is the number of elements in a set, and k.sub.j is a weight, k.sub.j≧0.

METHOD AND APPARATUS FOR WIRELESS NETWORK DEPLOYMENT AND TERMINAL DEVICE

Assignee

Inventors

Cpc classification

Classification Explorer

H04W24/02

ELECTRICITY

Classification Explorer

H04W24/08

ELECTRICITY

Classification Explorer

H04W84/18

ELECTRICITY

Classification Explorer

H04W16/18

ELECTRICITY

Classification Explorer

H04W16/20

ELECTRICITY

Classification Explorer

H04W8/26

ELECTRICITY

International classification

Classification Explorer

H04W16/18

ELECTRICITY

Classification Explorer

H04W24/02

ELECTRICITY

Classification Explorer

H04W24/08

ELECTRICITY

Classification Explorer

H04W8/26

ELECTRICITY

Abstract

Claims

Description