CN102026417B - Method for selecting network node to join in network and communication equipment - Google Patents

Method for selecting network node to join in network and communication equipment Download PDF

Info

Publication number
CN102026417B
CN102026417B CN 200910190425 CN200910190425A CN102026417B CN 102026417 B CN102026417 B CN 102026417B CN 200910190425 CN200910190425 CN 200910190425 CN 200910190425 A CN200910190425 A CN 200910190425A CN 102026417 B CN102026417 B CN 102026417B
Authority
CN
China
Prior art keywords
network node
relative distance
gateway
distance minimum
network
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CN 200910190425
Other languages
Chinese (zh)
Other versions
CN102026417A (en
Inventor
李文俊
周元
张俊
王宝兵
贾小华
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN 200910190425 priority Critical patent/CN102026417B/en
Publication of CN102026417A publication Critical patent/CN102026417A/en
Application granted granted Critical
Publication of CN102026417B publication Critical patent/CN102026417B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The embodiment of the invention provides a method for selecting a network node to join in a network. The method comprises the following steps of: acquiring a network node having the minimum relative distance with a gateway; acquiring the maximum conflict load value which corresponds to the network node having the minimum relative distance with the gateway; comparing the acquired maximum conflict load value with maximum conflict load values which correspond to network nodes having the minimum relative distance with other gateways; and if determining that the acquired maximum conflict load value is minimum, allowing the network node having the minimum relative distance with the gateway to join in a routing tree of the gateway. The embodiment of the invention also provides communication equipment, which can realize a rational network topology and establish a better network topology.

Description

Select network node to add method and the communication equipment thereof of network
Technical field
The present invention relates to network technology, particularly a kind of method and communication equipment thereof of selecting network node to add network.
Background technology
At present, based on wireless mesh network (WMN, Wireless Mesh Networks) is because its potential application is paid close attention to by industry more and more, and its application comprises: internet terminal access, Real-time multimedia, network gaming etc.Wireless mesh network is comprised of Mesh node and gateway, and wherein, gateway and Internet have direct wired connection, and the Mesh node needs to pass through multi-hop by Radio Link and by gateway node, data is sent to the internet.
Main performance index in wireless mesh network is the throughput end to end of each node, and the big-and-middle prominent load of this throughput and network is inversely proportional to.The maximum collision load is the maximum of the load sum of all links of disturbing mutually with arbitrary link in network, so the problem of the throughput of maximization network can solve by the maximum collision load that minimizes in network.
The topology of common wireless mesh network is the set of the routing tree take each gateway as root.Topology by network is controlled, and namely constructs the routing tree of specific annexation, can effectively improve the throughput of network.The existing topology control method that can be used for wireless mesh network has the greedy method of minimum collision load.
But the inventor finds that the defective of prior art is in realizing process of the present invention: when adopting the greedy method of minimum collision load, if the position distribution of gateway in network is not very even, the performance of network depends on that to a great extent node adds the order of network, under this class scene, the network topology that adopts the method to form is unreasonable, and the overall performance of network is not high.
Summary of the invention
The embodiment of the present invention provides a kind of method and communication equipment thereof of selecting network node to add network, to realize rational network topology and to construct more excellent network topology.
According to an aspect of the present invention, provide a kind of method of selecting network node to add network, described method comprises:
Obtain the network node with the relative distance minimum of the first gateway;
Obtain the maximum collision load value corresponding to network node of described relative distance minimum;
The described maximum collision load value maximum collision load value corresponding with the network node of the relative distance minimum of other gateway that obtains compared;
If determine the described maximum collision load value that obtains hour, the network node of described relative distance minimum is added the routing tree of described the first gateway, to add described network.
According to a further aspect in the invention, also provide a kind of and be applied to select network node to add the communication equipment of network, described communication equipment comprises:
Acquiring unit is used for obtaining the network node with the relative distance minimum of the first gateway, and obtains the maximum collision load value corresponding to network node of described relative distance minimum;
Determining unit, the described maximum collision load value maximum collision load value corresponding with the network node of the relative distance minimum of other gateway that is used for obtaining compares, if determine that the described maximum collision load value that obtains hour, the routing tree that the network node of described relative distance minimum is added described the first gateway is to add described network.
The technical scheme that the embodiment of the present invention provides, by obtaining minimum with the relative distance of gateway and adding the network node of the maximum collision load value minimum that network produces, and this network node is added to the routing tree of this gateway, thereby can realize and to add network according to rational selective sequential network node, thereby realize rational network topology and construct more excellent network topology.
Description of drawings
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, during the below will describe embodiment, the accompanying drawing of required use is done to introduce simply, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain according to these accompanying drawings other accompanying drawing.
Fig. 1 is the flow chart that the selection network node of the embodiment of the present invention 1 adds the method for network;
Fig. 2 is the flow chart that the selection network node of the embodiment of the present invention 2 adds the method for network;
Fig. 3 is the flow chart that obtains the maximum collision load value of the embodiment of the present invention 2;
Fig. 4 is the flow chart that the node of the embodiment of the present invention 2 adds network;
Fig. 5 is the pie graph of the communication equipment of the embodiment of the present invention 3;
Fig. 6 is the pie graph of the acquiring unit of the embodiment of the present invention 4;
Fig. 7 is the pie graph of the determining unit of the embodiment of the present invention 4;
Fig. 8 is the schematic diagram of the network topology of the embodiment of the present invention 5;
Fig. 9 is the schematic diagram of the link interference of the embodiment of the present invention 5.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is only the present invention's part embodiment, rather than whole embodiment.Based on the embodiment in the present invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that obtains under the creative work prerequisite.
Embodiment 1
The embodiment of the present invention provides a kind of method of selecting network node to add network, as shown in Figure 1, the method comprises: because can there be a plurality of gateways in network, therefore, in the present embodiment, with one of them gateway in a plurality of gateways as an example, namely the first gateway, certain, in the present embodiment, there is no dividing of order between gateway, the first gateway can refer to any one gateway of a plurality of gateways.
Step 101 is obtained the network node with the relative distance minimum of the first gateway.
In the present embodiment, gateway can arrive the jumping figure information of all gateways and the jumping figure information that this first gateway arrives other gateways according to the network node adjacent with this first gateway that obtains in advance, calculates the network node adjacent with this first gateway to the relative distance of this first gateway; Select the network node of described relative distance minimum from the network node adjacent with described the first gateway.In the present embodiment, due to a plurality of gateways being arranged in network, therefore, can obtain the network node with the relative distance minimum of each gateway, the network node that namely each gateway in network can a corresponding relative distance minimum.
Step 102 is obtained the maximum collision load value that the network node of relative distance minimum adds network to bring; In the present embodiment, also can be understood as, obtain the maximum collision load value that the network node of a plurality of relative distance minimums adds network to bring.In the present embodiment, can each gateway can obtain the maximum collision load value that the network node of this relative distance minimum of its correspondence adds network to bring.In the present embodiment, can comprise the maximum collision load value that the network node of the relative distance minimum of obtaining local gateway adds network to bring, also comprise the maximum collision load value that the network node of the relative distance minimum of obtaining other gateway adds network to bring.
Step 103 compares this maximum collision load value maximum collision load value corresponding with the network node of the relative distance minimum of other gateway that obtains.In the present embodiment, also can be understood as, the network node of this relative distance minimum of its correspondence that each gateway is obtained adds the maximum collision load value that network brings to compare, to obtain the maximum collision load value of a plurality of maximum collision load value intermediate value minimums.In the present embodiment, other gateway is the gateway except the first gateway in a plurality of gateways.
Step 104 if determine that this maximum collision load value that obtains is minimum, adds the network node of this relative distance minimum the routing tree of this first gateway, to add described network.In the present embodiment, also can be understood as, with the network node corresponding to maximum collision load value of a plurality of maximum collision load value intermediate value minimums, join the routing tree of its corresponding gateway, to add described network.
In the present embodiment, this network can be based on wireless mesh network WMN, and this network node can be the Mesh node in based on wireless mesh network.But be not limited to this, this network also can be other any networks that needs topology to control.
In the present embodiment, this jumping figure information can obtain in advance, can obtain the jumping figure information of each network node to the jumping figure information of neighboring gateway and each gateway to other gateways by the announcement of each gateway broadcasts in this network frame.Like this, each network node can be saved in the jumping figure information of each gateway, and each gateway also can be saved in the jumping figure information of other gateways.But be not limited to this, also can adopt additive method to obtain this jumping figure information.
In the present embodiment, can calculate the network node adjacent with gateway to the relative distance of this gateway by this jumping figure information that obtains in advance.Like this, the network node that each gateway in this network can a corresponding relative distance minimum.
In the present embodiment, gateway can carry out alternately with the network node of corresponding relative distance minimum, and the network node that obtains this relative distance minimum adds the maximum collision load value that brings after this network.This gateway can the maximum collision load value corresponding with the network node of the relative distance minimum of other gateway compare this maximum collision load value that obtains, if determine the maximum collision load value minimum that this gateway obtains, this gateway notifies the network node of this relative distance minimum to add the routing tree of this gateway.
In the present embodiment, can select successively network node to add network according to said method after the beginning constructing network topology, until in this network, the all-network node adds network, like this, can build more excellent network topology.
By above-described embodiment as can be known, relative distance by considering network node and gateway and the maximum collision load information of network, determine minimum with the relative distance of gateway and add the network node of the maximum collision load value minimum that network produces, and this network node is added to this gateway, thereby can realize adding network according to rational selective sequential network node, thereby realize rational network topology and construct more excellent network topology.
Embodiment 2
The embodiment of the present invention provides a kind of method of selecting network node to add network, and as shown in Figure 2, the method comprises:
Step 201 is obtained jumping figure information.
In the present embodiment, before constructing network topology, can announce the frame jumping figure information of each network node to the jumping figure information of all gateways and each gateway to other gateways in collection network in advance by broadcasting.Like this, each network node can be saved in the jumping figure information of each gateway, and each gateway also can be saved in the jumping figure information of other gateways.
Step 202 is calculated relative distance according to this jumping figure information.
In the present embodiment, for each gateway, can calculate each network node adjacent with this gateway to the relative distance of this gateway.
For example, M gateway arranged in the assumed wireless mesh network, the set W={g of gateway 1, g 2..., g M, and certain node u in network is designated as h to the jumping figure of node v U, vFor certain Mesh node u, definable is at the jumping figure vector H of node u and gateway set uFor H u = < h u , g 1 , h u , g 2 , . . . , h u , g M > ; For certain gateway g i, the jumping figure vector of this gateway and gateway set
Figure G2009101904252D00062
For H g i = < h g i , g 1 , h g i , g 2 , . . . , h g i , g M > .
Node u and gateway g iBetween relative distance, in fact can pass through vector H uWith
Figure G2009101904252D00064
Between angle weigh.If vector H uWith
Figure G2009101904252D00065
Between angle less, represent node u and gateway g iMore " close ".Therefore, definable node u and gateway g iBetween relative distance d (u, g i) be
d ( u , g i ) = cos - 1 ( H u &CenterDot; H g i | H u | &CenterDot; | H g i | ) = cos - 1 ( &Sigma; g j &Element; W h u , g j h g i , g j &Sigma; g j &Element; W h u , g j 2 &CenterDot; &Sigma; g j &Element; W h g i , g j 2 )
Wherein, cos -1() is inverse cosine function.
Step 203, the network node of selection relative distance minimum.
In the present embodiment, gateway can select the network node of relative distance minimum as the both candidate nodes of this gateway from adjacent network node.In the present embodiment, each gateway can be selected the network node with its relative distance minimum.Take the first gateway as example, this step can be the network node of the first gateway selection with its relative distance minimum.
Step 204 is obtained the maximum collision load value corresponding to network node of this relative distance minimum.
In the present embodiment, gateway can carry out with the network node of this relative distance minimum alternately, and the network node that obtains this relative distance minimum adds the maximum collision load value that brings after network.In the present embodiment, each gateway can carry out with the network node of its relative distance minimum alternately.
Step 205, relatively this maximum collision load value.
In the present embodiment, gateway can the maximum collision load value corresponding with the network node of the relative distance minimum of other gateway compare this maximum collision load value that obtains, if the maximum collision load value that this obtains is minimum, turns step 206; Otherwise this process finishes.In the present embodiment, take the first gateway as example, the first gateway compares the maximum collision load value maximum collision load value corresponding with the network node of the relative distance minimum of other gateway that obtains, and namely each gateway maximum collision load value maximum collision load value corresponding with the network node of the relative distance minimum of other gateway that it can be obtained compares.
In the present embodiment, this each gateway can obtain the maximum collision load value corresponding to network node of the relative distance minimum of other gateways by sending message, but is not limited to this, can determine according to actual conditions.
Step 206, the routing tree of notifying the network node of this relative distance minimum to add this gateway is to add described network.That take the first gateway as example, the routing tree of notifying the network node of this relative distance minimum to add the first gateway is to add described network at the present embodiment.
In the present embodiment, if obtain by the result of step 205 maximum collision load value minimum that this obtains, this gateway is notified the routing tree that the network node of this relative distance minimum adds this gateway, to add described network; If the result by step 205 obtains this maximum collision load value that obtains not for minimum, this gateway is left intact, and is processed by the gateway that the maximum collision load value of minimum is corresponding.
For example, network node u is gateway g iThe network node of corresponding relative distance minimum, gateway g iThe maximum collision load value that the maximum collision load value that network node u is corresponding is corresponding with the network node of the relative distance minimum of other gateway compares.If the maximum collision load value that network node u is corresponding is minimum, gateway g iInforming network node u adds function Access Gateway g iRouting tree; If the maximum collision load value that network node u is corresponding is not minimum, but maximum collision load value minimum corresponding to network node v, network node v corresponding gateway g k, by gateway g kInforming network node v adds function Access Gateway g kRouting tree, gateway g iDo not process.
In the present embodiment, as shown in Figure 3, obtain the step of maximum collision load value corresponding to the network node of relative distance minimum in step 204, comprising:
Step 301, gateway sends the invitation message to the network node of this relative distance minimum.
In the present embodiment, this invitation message can be the Invite bag.When there was not intermediate node in the path between the network node of this gateway and this relative distance minimum, this gateway directly sent the invitation message to the network node of this relative distance minimum; When there is at least one intermediate node in the path between the network node of this gateway and this relative distance minimum, this gateway can be invited message to the network node transmission of this relative distance minimum by this path, this path can be shortest path, namely between the network node of this gateway and this relative distance minimum, jumping figure is minimum, thereby can make the expense of message repeating minimum.
Step 302, gateway receive joining message that the network node of this relative distance minimum sends.
In the present embodiment, after the network node of this relative distance minimum receives the invitation message of this gateway transmission, join message to this gateway transmission, this joins message and can be the Join bag.
In the present embodiment, when there was not intermediate node in the path between the network node of this gateway and this relative distance minimum, this gateway directly received this and joins message, the business load of this network node of comprising this relative distance minimum of joining message;
In the present embodiment, when there is at least one intermediate node in the path between the network node of this gateway and this relative distance minimum, this joins message by the intermediate node forwarded hop-by-hop on this path, the business load of this network node of comprising the relative distance minimum of joining message.
For example, as gateway g iAnd when there was intermediate node f in the path between the network node u of this relative distance minimum, network node u sent the Join bag along this path, and this Join comprises the business load l (u) of this network node u; After this intermediate node f receives this Join bag, upgrade self conflict load C ' (f)=C (f)+2l (u), wherein, C ' is (f) conflict load after this intermediate node f upgrades, C (f) is the conflict load before this intermediate node f upgrades, and l (u) is the business load of the included network node u of this Join bag that receives; Afterwards, this intermediate node f sends the Join bag along this path, and this Join comprises the business load of network node u.
In the present embodiment, the network node on this path can not listen to this Join bag yet.When this when the network node on this path does not listen to this Join bag, this not the network node on this path be interfered, can be called interfering nodes.Interfering nodes upgrades the conflict load of self, and obtains this network node information that joins message that sends.
In the present embodiment, interfering nodes can start timer when listening to the Join bag for the first time, scheduled time T2, and in scheduled time T2, this interfering nodes can listen to a plurality of Join bags.When the scheduled time expired, this interfering nodes can send to the source node of last transmission Join bag conflict load bag, and this conflict load bag carries the conflict load after this interfering nodes upgrades, and this conflict load bag can be the Collision_load bag.
For example, not after the network node v on this path listens to Join bag, upgrade self conflict load C ' (v)=C ' (v)+l (u); Wherein, C ' (v) is the conflict load (initial value of C ' (v) is C (v)) of this interfering nodes v of estimation.When T2 expired, to the source node transmission Collision_load bag of last transmission Join bag, this Collision_load bag carried C ' (v).
In the present embodiment, when the network node on this path is received the conflict load bag of one or more interfering nodes transmissions, network node on this path from these one or more conflict load bags the conflict load and the conflict load of self in select maximum, this maximum is saved as the maximum collision load value of the network node on this path, this maximum collision load value can be max_collision_load, and initial value can be the conflict load of self.
For example, when the network node f on this path receives the Collision_load bag that interfering nodes v sends, relatively C ' (v) and C ' (f), maximum is saved as the max_collision_load value of this network node f.
Step 303, gateway receive the conflict load bag of the network node transmission of this relative distance minimum.
In the present embodiment, after the network node of this relative distance minimum sends and joins message, after scheduled time T1, can send conflict load bag, this scheduled time T1＞T2 to this gateway.
In the present embodiment, when there is not intermediate node in the path between the network node of this gateway and this relative distance minimum, this gateway directly receives this conflict load bag, the maximum collision load value that adds network to be brought with the network node that obtains this relative distance minimum.Wherein, this conflict load bag comprises this maximum collision load value, the conflict load of the maximum in the conflict load of the network node that this maximum collision load value is this relative distance minimum and the load that conflicts of interfering nodes.
For example, after the network node u of this relative distance minimum transmission joins message, receive the conflict load bag that interfering nodes v sends.When the scheduled time, T1 expired, this network node u was included in the maximum in the conflict load C of itself conflict load C (u), interfering nodes ' (v) in the Collision_load bag, sends to this gateway.This gateway directly receives this conflict load bag, the maximum collision load value that adds network to be brought to obtain this network node u.
In the present embodiment, when there is at least one intermediate node in the path between the network node of this gateway and this relative distance minimum, this conflict load bag is by the intermediate node forwarded hop-by-hop on this path, this conflict load bag comprises the maximum collision load value, and this maximum collision load value is according to conflict load or the conflict load of the network node on this path and the conflict load hop-by-hop calculating of interfering nodes of the network node on this path.
For example, as gateway g iAnd when there was intermediate node f in the path between the network node u of this relative distance minimum, network node u sent the Collision_load bag along this path, and this Collision_load comprises the max_collision_load value; After this intermediate node f received this Collision_load bag, relatively whether the max_collision_load value in this Collision_load bag was greater than the max_collision_load value of this intermediate node f preservation.If greater than, the max_collision_load value of self preserving is updated to the max_collision_load value that this Collision_load comprises, then continue to send this Collision_load bag along this path.If be less than or equal to, do not carry out any operation.
In the present embodiment, as shown in Figure 4, notify the network node of this relative distance minimum to add the step of the routing tree of this gateway in step 206, comprising:
Step 401, gateway is accepted message to the network node transmission of this relative distance minimum; Take the first gateway as example, the first gateway is accepted message to the network node transmission of this relative distance minimum.
In the present embodiment, this is accepted message and can be the Accept bag.
Step 402 receives the confirmation message that the network node of this relative distance minimum sends, and the network node of determining this relative distance minimum adds the routing tree of this gateway.Take the first gateway as example, the network node of determining this relative distance minimum adds the routing tree of this first gateway
In the present embodiment, this confirmation message can be the Confirm bag, and the network node of this relative distance minimum receives this Accept message, sends the Confirm bag.This Confirm bag is along the path forwarded hop-by-hop, until this gateway receives this Confirm bag.After this gateway receives this Confirm bag, determine the network node of this relative distance minimum is added in routing tree.
By above-described embodiment as can be known, relative distance by considering network node and gateway and the maximum collision load information of network, determine minimum with the relative distance of gateway and add the network node of the maximum collision load value minimum that network produces, and this network node is added to this gateway, thereby can realize adding network according to rational selective sequential network node, thereby realize rational network topology and construct more excellent network topology; And, in building the process of network topology, by gateway and network node alternately, make each network node upgrade in time and feed back the conflict load information of self link, thereby providing foundation accurately for the decision-making of gateway.
Embodiment 3
The embodiment of the present invention provides a kind of and is applied to select network node to add the communication equipment of network, and as shown in Figure 5, this communication equipment comprises: computing unit 501, acquiring unit 502 and determining unit 503.Because can there be a plurality of gateways in network, therefore, in the present embodiment, with one of them gateway in a plurality of gateways as an example, namely the first gateway, certain, in the present embodiment, there is no dividing of order between gateway, the first gateway can refer to any one gateway of a plurality of gateways.
Wherein, this computing unit 501 is used for obtaining the network node with the relative distance minimum of the first gateway.In the present embodiment, computing unit 501 can calculate this network node to the relative distance of this first gateway to the jumping figure information of all gateways and this first gateway to the jumping figure information of other gateways according to the network node adjacent with the first gateway that obtains in advance; This acquiring unit 502 is connected with this computing unit 501, be used for obtaining the maximum collision load value that the network node of this relative distance minimum adds network to bring, in the present embodiment, because network has a plurality of gateways, the maximum collision load value that can each gateway can have the network node of this relative distance minimum corresponding with it to add network to bring.In the present embodiment, acquiring unit 502 can obtain the maximum collision load value that the network node of the relative distance minimum of the first gateway adds network to bring, and can also obtain the maximum collision load value that the network node of the relative distance minimum of other gateway adds network to bring; This determining unit 503 is connected with this acquiring unit 502, is used for the maximum collision load value maximum collision load value corresponding with the network node of the relative distance minimum of other gateway that obtains compared.In the present embodiment, the network node of this relative distance minimum of its correspondence that determining unit 503 can be obtained each gateway adds the maximum collision load value that network brings to compare, to obtain the maximum collision load value of a plurality of maximum collision load value intermediate value minimums.If determine that this maximum collision load value that obtains is minimum, determining unit 503 notifies the network node of this relative distance minimum to add the routing tree of this first gateway.
In the present embodiment, this network can be based on wireless mesh network WMN, and this network node can be the Mesh node in based on wireless mesh network.But be not limited to this, this network also can be other any networks that needs topology to control.
In the present embodiment, this communication equipment can integrate use with gateway.The workflow of this communication equipment can as described in Example 1, repeat no more herein.
By above-described embodiment as can be known, relative distance by considering network node and gateway and the maximum collision load information of network, determine minimum with the relative distance of gateway and add the network node of the maximum collision load value minimum that network produces, and this network node is added to this gateway, thereby can realize adding network according to rational selective sequential network node, thereby construct more excellent network topology.
Embodiment 4
For better describing the specific implementation of network topology, the embodiment of the present invention provides a kind of communication equipment, and this communication equipment comprises: computing unit 501, acquiring unit 502 and determining unit 503.
In the present embodiment, when this computing unit 501 calculates relative distance, can adopt following formula:
d ( u , g i ) = cos - 1 ( H u &CenterDot; H g i | H u | &CenterDot; | H g i | ) = cos - 1 ( &Sigma; g j &Element; W h u , g j h g i , g j &Sigma; g j &Element; W h u , g j 2 &CenterDot; &Sigma; g j &Element; W h g i , g j 2 ) ;
Wherein, g iBe gateway, u is the network node adjacent with this gateway, d (u, g i) be this network node u and this gateway g iRelative distance,
Figure G2009101904252D00122
For this network node u arrives this gateway g iJumping figure,
Figure G2009101904252D00123
Be this gateway g iTo gateway g jJumping figure, W is gateway set { g 1, g 2..., g M, H u = < h u , g 1 , h u , g 2 , . . . , h u , g M > Be this network node u and gateway set { g 1, g 2..., g MThe jumping figure vector, H g i = < h g i , g 1 , h g i , g 2 , . . . , h g i , g M > Be this gateway g iWith gateway set { g 1, g 2..., g MThe jumping figure vector.
In the present embodiment, as shown in Figure 6, when there be not intermediate node in the network node of relative distance minimum and the path between the first gateway, this acquiring unit 502 can comprise: the first transmitting element 601, the first receiving element 602 and the second receiving element 603.
Wherein, this first transmitting element 601 is used for sending the invitation message to the network node of this relative distance minimum; This first receiving element 602 is used for receiving joining message that the network node of this relative distance minimum sends, the business load of this network node of comprising the relative distance minimum of joining message; This second receiving element 603 is connected with this first receiving element 602, be used for after the first receiving element 602 receives the joining message of network node transmission of these relative distance minimums, receive the conflict load bag that the network node of this relative distance minimum sends, the maximum collision load value that adds network to be brought with the network node that obtains this relative distance minimum; Wherein, the network node of this relative distance minimum sends this conflict load bag when reaching Preset Time, this conflict load bag comprises this maximum collision load value, the conflict load of the maximum in the conflict load of the network node that this maximum collision load value is this relative distance minimum and the load that conflicts of interfering nodes.
In the present embodiment, as shown in Figure 6, when there were at least one intermediate node in the network node of relative distance minimum and the path between the first gateway, this acquiring unit 502 also can comprise: the second transmitting element 604, the 3rd receiving element 605 and the 4th receiving element 606.
Wherein, this second transmitting element 604 is used for gateway by the network node transmission invitation message of this path to this relative distance minimum; What the intermediate node of the network node that the 3rd receiving element 605 is used for receiving this relative distance minimum by this path forwarded joins message; Wherein, the business load of this network node of comprising this relative distance minimum of joining message; The 4th receiving element 606 is connected with the 3rd receiving element 605, after being used for the joining message of when network node that the 3rd receiving element 605 receives these relative distance minimums intermediate node forwarding by this path, the conflict load bag that the intermediate node of the network node that receives this relative distance minimum by this path forwards, the maximum collision load value that adds network to be brought with the network node that obtains this relative distance minimum; Wherein, after the network node of this relative distance minimum sends and joins message, the network node of this relative distance minimum sends this conflict load bag when reaching Preset Time, this conflict load bag comprises this maximum collision load value, and this maximum collision load value is according to conflict load or the conflict load of the network node on this path and the conflict load hop-by-hop calculating of interfering nodes of the network node on this path.
In the present embodiment, as shown in Figure 7, this determining unit 503 also comprises: the 3rd transmitting element 701 and add unit 702; Wherein, the 3rd transmitting element 701 is accepted message for gateway to the network node transmission of this relative distance minimum; The confirmation message that this network node that adds unit 702 to be used for receiving this relative distance minimum sends, the network node of determining this relative distance minimum adds the routing tree of this gateway.
In the present embodiment, this communication equipment can integrate use with gateway.The workflow of this communication equipment can as described in Example 2, repeat no more herein.
By above-described embodiment as can be known, the relative distance by considering network node and gateway and the maximum collision load information of network can add network according to rational selective sequential network node, thereby construct more excellent network topology; And, in building the process of network topology, by gateway and network node alternately, make each network node upgrade in time and feed back the conflict load information of self link, thereby providing foundation accurately for the decision-making of gateway.
Embodiment 5
The embodiment of the present invention provides a kind of method of selecting network node to add network, below in conjunction with Fig. 8, Fig. 9, adds the method for network to be elaborated by example to this selection network node.
As shown in Figure 8, have in this based on wireless mesh network two gateway G1, G2 and a plurality of network node A, B ....When beginning to build network topology, can obtain in advance jumping figure information.For example, the A node has been preserved the jumping figure of gateway G1, G2; Gateway G1, G2 have also preserved the other side's jumping figure.
At first, gateway G1 can calculate adjacent network node to the relative distance of this gateway G1 according to jumping figure information; Simultaneously, gateway G2 also can calculate adjacent network node to the relative distance of this gateway G2 according to jumping figure information.Can adopt inverse cosine function to calculate, as described in embodiment 2,4, repeat no more herein.
For example, the network node of the relative distance minimum that gateway G1 is corresponding is A, and the network node of the relative distance minimum that gateway G2 is corresponding is B.
Secondly, obtain respectively network node A, B for gateway G1, G2 and add the maximum load value that brings after network.
Now take describing as example alternately between G1 and A:
As shown in Figure 9, the path between G1 and A exists E, two intermediate nodes of H.At first G1 sends along G1-＞H-＞E-＞A and invites message; After A receives this invitation message, start timer, the scheduled time is T1, and transmission joins message, wherein, the business load l (A) that this joins message and comprises A, after E receives that this joins message, upgrade self conflict load C ' (E)=C ' (E)+2l (A), and forward this to H and join message, this joined message and comprised C ' (E) this moment, after H receives that this joins message, upgrade self conflict load C ' (H)=C ' (H)+2l (A), and forward this to G1 and join message, this joined message and comprised l (A) this moment.
Network node beyond path G1-＞H-＞E-＞A might listen to this and join message, for example, network node F listens to joining message that A sends, at this moment, F upgrade self conflict load C ' (F)=C ' (F)+l (A), and start simultaneously timer, the scheduled time is T2, and T2＜T1 is not when T2 also expires, F has listened to again joining message that E sends, F again upgrade self conflict load C ' (F)=C ' (F)+l (A).When T2 expired, F sent conflict load bag to E, and this conflict load bag comprises C ' (F), after E receives this conflict load bag, comparison C ' (E) and C ' (F), general wherein maximum saves as the max_collision_load value.
When A expires at T1, send conflict load bag along A-＞E-＞H-＞G1, this conflict load bag comprises maximum collision load value M (A); After this intermediate node E receives this conflict load bag, this M (A) max_collision_load value of whether preserving greater than this intermediate node E relatively.If greater than, the max_collision_load value of C being preserved is updated to M (A); If be less than or equal to, this M (A) is updated to the max_collision_load value that E preserves.Then the load bag that will conflict sends to H, continues same operation, until send to G1.Like this, gateway G1 can obtain network node A and adds the maximum load value M ' that brings after network (A).
Again, gateway G1 (A) (B) compares M ' with the corresponding maximum collision load value of the network node B M ' that gateway G2 obtains.If M ' (A)＜M ' (B), gateway G1 adds A the routing tree of G1; If M ' (A)＞M ' (B), gateway G1 does not do any operation, by gateway G2, B is added the routing tree of G2.
Like this, select successively network node to add network according to said method, until in this network, the all-network node adds network, can build more excellent network topology.
By above-described embodiment as can be known, relative distance by considering network node and gateway and the maximum collision load information of network, obtain minimum with the relative distance of gateway and add the network node of the maximum collision load value minimum that network produces, and this network node is added to the routing tree of this gateway, can add network according to rational selective sequential network node, thereby realize rational network topology and construct more excellent network topology; And, in building the process of network topology, by gateway and network node alternately, make each network node upgrade in time and feed back the conflict load information of self link, thereby providing foundation accurately for the decision-making of gateway.
Above-described embodiment; purpose of the present invention, technical scheme and beneficial effect are further described; institute is understood that; the above is only the specific embodiment of the present invention; the protection range that is not intended to limit the present invention; within the spirit and principles in the present invention all, any modification of making, be equal to replacement, improvement etc., within all should being included in protection scope of the present invention.

Claims (10)

1. a method of selecting network node to add network, is characterized in that, described method comprises:
Obtain the network node with the relative distance minimum of the first gateway;
Obtain the maximum collision load value corresponding to network node of described relative distance minimum; Wherein, the conflict load of the described maximum collision load value network node that is described relative distance minimum or be the conflict load of the maximum in the load that conflicts of the conflict load of the network node of described relative distance minimum and interfering nodes;
The described maximum collision load value maximum collision load value corresponding with the network node of the relative distance minimum of other gateway that obtains compared;
If determine the described maximum collision load value that obtains hour, the network node of described relative distance minimum is added the routing tree of described the first gateway, to add described network.
2. method according to claim 1, is characterized in that, the described step of obtaining with the network node of the relative distance minimum of the first gateway comprises:
Arrive the jumping figure information of all gateways and the jumping figure information that described the first gateway arrives other gateways according to the network node adjacent with described the first gateway that obtains in advance, calculate described network node to the relative distance of described the first gateway;
Select the network node of described relative distance minimum from the network node adjacent with described the first gateway.
3. method according to claim 1, it is characterized in that, when there be not intermediate node in the network node of described relative distance minimum and the path between described the first gateway, described maximum collision load value corresponding to network node that obtains described relative distance minimum comprised:
Network node to described relative distance minimum sends the invitation message;
When the network node that receives described relative distance minimum send join message after, receives the conflict load bag of the network node transmission of described relative distance minimum, with maximum collision load value corresponding to network node that obtains described relative distance minimum;
Wherein, the network node of described relative distance minimum sends described conflict load bag when reaching Preset Time, and described conflict load bag comprises described maximum collision load value.
4. method according to claim 1, it is characterized in that, when there were at least one intermediate node in the network node of described relative distance minimum and the path between described the first gateway, described maximum collision load value corresponding to network node that obtains described relative distance minimum comprised:
Invite message by described path to the network node transmission of described relative distance minimum;
Intermediate node when the network node that receives described relative distance minimum by described path forwards join message after, the conflict load bag that the intermediate node of the network node that receives described relative distance minimum by described path forwards, the maximum collision load value that adds network to be brought with the network node that obtains described relative distance minimum;
Wherein, the network node of described relative distance minimum sends described conflict load bag when reaching Preset Time, described conflict load bag comprises described maximum collision load value, and described maximum collision load value is according to conflict load or the conflict load of the network node on described path and the conflict load hop-by-hop calculating of interfering nodes of the network node on described path.
5. method according to claim 1, is characterized in that, described network node with described relative distance minimum adds the routing tree of described the first gateway, to add described network, comprising:
Message is accepted in network node transmission to described relative distance minimum;
Receive the confirmation message that the network node of described relative distance minimum sends, the network node of determining described relative distance minimum adds the routing tree of described the first gateway, to add described network.
6. one kind is applied to select network node to add the communication equipment of network, it is characterized in that, described communication equipment comprises:
Acquiring unit is used for obtaining the network node with the relative distance minimum of the first gateway, and obtains the maximum collision load value corresponding to network node of described relative distance minimum; Wherein, the conflict load of the described maximum collision load value network node that is described relative distance minimum or be the conflict load of the maximum in the load that conflicts of the conflict load of the network node of described relative distance minimum and interfering nodes;
Determining unit, the described maximum collision load value maximum collision load value corresponding with the network node of the relative distance minimum of other gateway that is used for obtaining compares, if determine that the described maximum collision load value that obtains hour, the routing tree that the network node of described relative distance minimum is added described the first gateway is to add described network.
7. communication equipment according to claim 6, is characterized in that, also comprises:
Computing unit calculates to the jumping figure information of other gateways the relative distance that described network node arrives described gateway for the jumping figure information that arrives all gateways according to the network node adjacent with the first gateway that obtains in advance and described the first gateway;
Described acquiring unit also is used for selecting from the network node adjacent with described gateway the network node of described relative distance minimum.
8. communication equipment according to claim 6, is characterized in that, when there be not intermediate node in the network node of described relative distance minimum and the path between described the first gateway, described acquiring unit comprised:
The first transmitting element is used for sending to the network node of described relative distance minimum and invites message;
The first receiving element is for joining message that the network node that receives described relative distance minimum sends;
The second receiving element, be used for after described the first receiving element receives described joining message, receive the conflict load bag that the network node of described relative distance minimum sends, the maximum collision load value that adds network to be brought with the network node that obtains described relative distance minimum;
Wherein, the network node of described relative distance minimum sends described conflict load bag when reaching Preset Time, and described conflict load bag comprises described maximum collision load value.
9. communication equipment according to claim 6, is characterized in that, when there were at least one intermediate node in the network node of described relative distance minimum and the path between described the first gateway, described acquiring unit also comprised:
The second transmitting element is used for inviting message by described path to the network node transmission of described relative distance minimum;
What the 3rd receiving element, the network node that is used for the receiving described relative distance minimum intermediate node by described path forwarded joins message;
The 4th receiving element, after being used for described the 3rd described the joining message of receiving element reception, the conflict load bag that the intermediate node of the network node that receives described relative distance minimum by described path forwards, the maximum collision load value that adds network to be brought with the network node that obtains described relative distance minimum;
Wherein, the network node of described relative distance minimum sends described conflict load bag when reaching Preset Time, described conflict load bag comprises described maximum collision load value, and described maximum collision load value is according to conflict load or the conflict load of the network node on described path and the conflict load hop-by-hop calculating of interfering nodes of the network node on described path.
10. communication equipment according to claim 6, is characterized in that, described determining unit comprises:
The 3rd transmitting element is used for sending to the network node of described relative distance minimum and accepts message;
Add the unit, be used for receiving the confirmation message that the network node of described relative distance minimum sends, the network node of determining described relative distance minimum adds the routing tree of described the first gateway, to add described network.
CN 200910190425 2009-09-14 2009-09-14 Method for selecting network node to join in network and communication equipment Expired - Fee Related CN102026417B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 200910190425 CN102026417B (en) 2009-09-14 2009-09-14 Method for selecting network node to join in network and communication equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 200910190425 CN102026417B (en) 2009-09-14 2009-09-14 Method for selecting network node to join in network and communication equipment

Publications (2)

Publication Number Publication Date
CN102026417A CN102026417A (en) 2011-04-20
CN102026417B true CN102026417B (en) 2013-11-06

Family

ID=43867084

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 200910190425 Expired - Fee Related CN102026417B (en) 2009-09-14 2009-09-14 Method for selecting network node to join in network and communication equipment

Country Status (1)

Country Link
CN (1) CN102026417B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110391981B (en) * 2018-04-20 2021-10-26 慧与发展有限责任合伙企业 Apparatus, method, and medium for establishing a source routing tree for gateway nodes in a mesh network
CN114501345A (en) * 2022-04-15 2022-05-13 希诺麦田技术（深圳）有限公司 Group call full duplex realization method, device and system
CN114553914B (en) * 2022-04-25 2022-07-15 江苏博瑞思信息技术有限公司 Data processing method and device suitable for Internet of things gateway

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101151852A (en) * 2005-05-31 2008-03-26 思科技术公司 Multiple wireless spanning tree protocol used in radio mesh network
CN101170578A (en) * 2007-11-30 2008-04-30 北京理工大学 Hierarchical peer-to-peer network structure and constructing method based on syntax similarity
WO2008110202A1 (en) * 2007-03-12 2008-09-18 Telefonaktiebolaget L M Ericsson (Publ) Arrangement and method relating to network management

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101151852A (en) * 2005-05-31 2008-03-26 思科技术公司 Multiple wireless spanning tree protocol used in radio mesh network
WO2008110202A1 (en) * 2007-03-12 2008-09-18 Telefonaktiebolaget L M Ericsson (Publ) Arrangement and method relating to network management
CN101170578A (en) * 2007-11-30 2008-04-30 北京理工大学 Hierarchical peer-to-peer network structure and constructing method based on syntax similarity

Also Published As

Publication number Publication date
CN102026417A (en) 2011-04-20

Similar Documents

Publication Publication Date Title
Chen et al. Harvest-then-cooperate: Wireless-powered cooperative communications
DE60315623T2 (en) A method, computer readable medium, and nodes for selecting reliable links between nodes in an ad hoc communication network
DE602005001250T2 (en) Packet transmission system, wireless base station and route optimization method for packet transmission
CN101796865B (en) Quality of service control in multiple hop wireless communication environments
CN104301984B (en) Poewr control method based on time domain half-duplex relay in D2D cellular networks
CN105493609A (en) Adaptive RTS/CTS in high-efficiency wireless communications
CN102083217A (en) Resource distribution method and device for multi-relay orthogonal frequency division multiplexing system
EP1942619A3 (en) Wireless communication system and method
CN104038946B (en) Partially-overlapped channel allocation method for multicast of wireless mesh network
Yu et al. Topology control in cooperative wireless ad-hoc networks
CN106454984A (en) Route method and apparatus
Johnson et al. Collaborative content distribution for vehicular ad hoc networks
CN101848524B (en) Method for relay selection and power distribution of wireless multi-relay cooperation transmission network
CN104244437A (en) Dynamic relaying incentive fair-share dispatching method for cooperative downlink transmission
CN102026417B (en) Method for selecting network node to join in network and communication equipment
CN105024797A (en) Half-duplex/full-duplex hybrid transmission method of cognitive relay network
Khorov et al. Flexibility of routing framework architecture in IEEE 802.11 s mesh networks
CN109982300A (en) The method of user equipment uplink minimum energy consumption based on D2D communication in NB-IoT
Osorio et al. Routing in LoRa for smart cities: A gossip study
CN110266435A (en) Fountain codes collaboration communication method under a kind of more relay scenes
CN109922441A (en) A kind of multihop network communication means, device and system
CN105049356B (en) Monitor the data multihop routing acquisition method based on QoS in network
CN106658647B (en) A kind of relay selection algorithm based on interference perception
JP2011055394A (en) Wireless communication apparatus and wireless communication program
CN103346986B (en) Channel estimation methods in a kind of wireless relay network

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20131106

Termination date: 20150914

EXPY Termination of patent right or utility model