CN101951661B - Address distribution method in sensor network and sensor network node - Google Patents

Abstract

The embodiment of the invention discloses an address distribution method in a sensor network and a sensor network node. The method comprises the following steps of segmenting a total address space by taking address spaces, which can be distributed in the sensor network, as a unit to obtain a multi-segment address space containing a first section address space and a second section address space; and when running out of the first-section address space, distributing an address in the second section address space to a child node. The invention is suitable for address distribution in the sensor network.

Description

Address allocation method in sensor network and sensor network node

Technical Field

The present invention relates to the field of wireless communication technologies, and in particular, to an address allocation method in a sensor network and a sensor network node.

Background

A wireless sensor network is a self-organizing, task-oriented, data-centric wireless communication network consisting of a large number of sensor nodes distributed over a large area. At present, a common address allocation method provided by a wireless sensor network protocol is a distributed address allocation method. In a distributed address allocation method, some network parameters are first set by a network coordinator, such as: maximum number of child nodes C that a parent node may have_mMaximum number of child nodes having routing function R that parent node can possess_mMaximum depth of network L_m. Then, the parent node with depth d, the size C of the address space allocated to its child node_skip(d) Given by the following equation:

$C_{\mathrm{skip}}\left(d\right)=\left\{\begin{array}{c}1+C_m(L_m-d-1),R_m=1\\ \frac{1+C_m-R_m-C_m\×{R_m}^{(L_m-d-1)}}{1-R_m},R_m\≠1\end{array}\right\}$

meanwhile, the address of the child node of the parent node having the depth d is given by:

address A of child node having routing function_rComprises the following steps: a. the_r＝A_p+C_skip(d) X (m-1) +1, wherein m is 1. ltoreq. R_mM is the sequence of adding the child nodes with the routing function into the network;

address A of terminal child node_eComprises the following steps: a. the_e＝A_p+C_skip(d)×R_m+ n, wherein n is more than or equal to 1 and less than or equal to C_m-R_mN is a terminal sub-nodeThe order of joining the network;

wherein A is_pIs the parent node address.

From the above, when the network parameter C_m、R_m、L_mAfter the determination, the address that any parent node in the network can assign to its child node is determined accordingly. That is, a parent node is typically able to compute an assignment C for a child node_skip(d) An address. It is to be noted that, in the above address assignment method, C_m、R_m、L_mThe parameters are only some parameters introduced for the parent node to calculate the child node address, and the parameters do not limit the capability of the parent node. E.g. C_mThe maximum number of child nodes which can be owned by a parent node is just one parameter adopted when the parent node calculates and allocates addresses for the child nodes, the maximum number of child nodes which can be owned by the parent node is not really limited, and actually the number of child nodes which a parent node can own is probably greater than C_m. Also, the number of child nodes having a routing function actually owned by a parent node may be greater than R_mThe depth of the network may also be greater than L_m. Therefore, the number of child nodes that a parent node can carry can be so large as the capability allows, so that the number of addresses allocated by the above-mentioned set parameters cannot meet the requirement of the actual number of nodes. That is, due to the non-uniformity and uncertainty of the distribution of the sensor nodes, in the actual network operation, there may be a case where the address space of one parent node is used up and cannot provide service to a new node, and the address spaces of other parent nodes are still more abundant.

In order to solve the above problems, the prior art proposes two solutions:

scheme 1: setting priorities for father nodes and child nodes, wherein the priorities of the child nodes are set according to the number of potential father nodes, load conditions and the like, and the higher the number of potential father nodes is, the lower the load is, and the lower the priority is; the priority of a parent node is set according to the load condition, the depth and the like, and the deeper the depth and the larger the load, the lower the priority of the parent node. After the priority is determined, the child node and the father node select the father node to access the network according to the priority, or provide service for the child node, and carry out address allocation.

Scheme 2: when the address space of the father node is insufficient, idle address request information is sent to the network coordinator, the network coordinator broadcasts the whole network, then the node closest to the node path sending the idle address request information is selected as the node providing the idle address, and finally a path connecting the node providing the idle address and the node using the idle address is established.

In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:

when the scheme 1 is adopted for address allocation, extra expenses are brought to the establishment and maintenance of the priority; when the scheme 2 is adopted for address allocation, the position and routing direction of the node can not be judged according to the node address any more, and the message routing can be realized only by storing a corresponding routing table, so that the additional cost of address borrowing interaction can be brought. In summary, the prior art may increase the overhead of the system when solving the problem of insufficient local space.

Disclosure of Invention

Embodiments of the present invention provide an address allocation method in a sensor network and a sensor network node, which can implement expansion of an address space without increasing system overhead.

The embodiment of the invention adopts the technical scheme that:

an address allocation method in a sensor network, comprising:

segmenting the total address space by taking the address space which can be allocated in the sensor network as a unit to obtain a plurality of sections of address spaces including a first section of address space and a second section of address space;

and when the first section of address space is used up, allocating addresses in a second section of address space for the child nodes.

A sensor network node, comprising:

the segmentation module is used for segmenting the total address space by taking the address space which can be allocated in the sensor network as a unit to obtain a plurality of sections of address spaces including a first section of address space and a second section of address space;

and the distribution module is used for distributing the address in the second section of address space for the child node when the first section of address space is used up.

The address allocation method in the sensor network and the sensor network node in the embodiment of the invention segment the total address space by taking the address space which can be allocated in the sensor network as a unit to obtain a plurality of segments of address spaces including a first segment of address space and a second segment of address space, and allocate addresses in the second segment of address space to the child nodes when the first segment of address space is used up. Compared with the prior art, the method can realize the expansion of the address space while keeping the corresponding relation between the address and the position and keeping the existing routing protocol unchanged, and can realize the expansion of the address space while not increasing the additional overhead of the system.

Drawings

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.

FIG. 1 is a flowchart of a method provided in accordance with an embodiment of the present invention;

FIG. 2 is a flowchart of a method provided in a second embodiment of the present invention;

fig. 3 is a schematic structural diagram of a sensor network node according to a third embodiment of the present invention.

Detailed Description

The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

In order to make the advantages of the technical solutions of the present invention clearer, the present invention is described in detail below with reference to the accompanying drawings and examples.

Example one

The present embodiment provides an address allocation method in a sensor network, as shown in fig. 1, the method includes:

101. and segmenting the total address space by taking the address space which can be allocated in the sensor network as a unit to obtain a plurality of sections of address spaces including a first section of address space and a second section of address space.

In one example, the size of the address space S that can be allocated in the sensor network_skipComprises the following steps:

$S_{\mathrm{skip}}=R_m\×\left(\frac{1+C_m-R_m-C_m\×{R_m}^{L_m-1}}{1-R_m}\right)+C_m-R_m,$

wherein, C_mIs the maximum number of child nodes that a parent node can possess, R_mIs the maximum number of child nodes with routing function that a parent node can possess, L_mIs the maximum depth of the network, and C_m、R_mAnd L_mAnd (4) presetting. In addition, in all the examples of the present invention, C_m、R_mAnd L_mThe meaning of the parameter is not used to limit the capability of the parent node, and it can be referred to the description of the background art, and it is not expanded in detail here. S_skipWhen the address is calculated according to the certain parameter and the address is allocated, the size of the address space that can be allocated is not used for limiting the capability of the parent node, that is, the size of the address space that can be actually allocated by the parent node is not limited. It is understood that the multi-segment address space may include only the first segment address space and the second segment address space, and may further include other address segment spaces.

102. And when the first section of address space in the segmented address space is used up, allocating addresses in the second section of address space for the child nodes.

The first section of address space is a first section of address space in the multiple sections of address spaces, and the second section of address space is an expanded address space in the multiple sections of address spaces; or

The first section of address space and the second section of address space are respectively two sections of extended address spaces in the multi-section address spaces.

Wherein the second segment of address space is adjacent to or not adjacent to the first segment of address space in address space.

In this embodiment, the child node may be a child node with a routing function or a terminal child node.

The address allocation method in the sensor network of the embodiment of the invention is characterized in that the total address space is segmented by taking the address space which can be allocated in the sensor network as a unit to obtain a plurality of sections of address spaces including a first section of address space and a second section of address space, and when the first section of address space is used up, the address in the second section of address space is allocated to the child node. Compared with the prior art, the method can realize the expansion of the address space while keeping the corresponding relation between the address and the position and keeping the existing routing protocol unchanged, and can realize the expansion of the address space while not increasing the additional overhead of the system.

Example two

In this embodiment, an address allocation method in a sensor network is provided, where a first segment of address space is used first in a partitioned multiple-segment address space, and when the first segment of address space cannot meet a use requirement, each segment of address space after the first segment of address space may be sequentially expanded, and an address is allocated to a node using the expanded address space, where a specific allocation process may be as shown in fig. 2, and the method includes:

201. the father node segments the total address space by taking the address space which can be allocated in the sensor network as a unit to obtain a multi-segment address space comprising a first segment address space and a second segment address space, wherein the size S of the address space which can be allocated in the sensor network_skipComprises the following steps:

$S_{\mathrm{skip}}=R_m\×\left(\frac{1+C_m-R_m-C_m\×{R_m}^{(L_m-1)}}{1-R_m}\right)+C_m-R_m,$

wherein, C_mIs the maximum number of child nodes that a parent node can possess, R_mIs the maximum number of child nodes with routing function that a parent node can possess, L_mIs the maximum depth of the network, and C_m、R_mAnd L_mAnd (4) presetting.

Assuming that the available address space is 16 bits, i.e. a total of 65536 addresses can be allocated, then S can be used_skip65536 addresses are segmented for a unit.

202. When the first section of address space in the segmented address space is used up, the father node calculates according to the network parameters to obtain a first address, adds the first address and the offset of the second section of address space relative to the first section of address space in the multi-section address space to obtain a second address which is used as an address A in the second section of address space distributed to the child node with the routing function_rWherein

A_r＝A_sr×S_skip+A_p+C_skip(d)×(n_thr-1)+1；

wherein A is_p+C_skip(d)×(n_thr-1) +1 is the first address, A_sr×S_skipThe offset of the second section of address space relative to the first section of address space in the multi-section address space;

wherein A is_sr×S_skip＜65536，A_srThe number of times of address space expansion is required for allocating an address to a child node having a routing function, and

wherein,

is represented by C_rcurrentDivided by R_mRounding down the result of (1);

A_pis a parent node address;

C_skip(d) the size of the address space allocated to its child node for the parent node, an

$C_{\mathrm{skip}}\left(d\right)=\left\{\begin{array}{c}1+C_m(L_m-d-1),R_m=1\\ \frac{1+C_m-R_m-C_m\×{R_m}^{(L_m-d-1)}}{1-R_m},R_m\≠1\end{array}\right\},$

Wherein, C_mIs the maximum number of child nodes that a parent node can possess, R_mIs the maximum number of child nodes with routing function that a parent node can possess, L_mThe maximum depth of the network, d the depth of the father node;

n_thrthe order of adding the sub-nodes with routing function to the network, i.e. the nth address in the address allocation of the expansion_thrFor example, if 2 child nodes with routing functions have been added, the child node with routing function added this time is the 3 rd child node; and is

$n_{\mathrm{thr}}=\left\{\begin{array}{c}(C_{\mathrm{rcurrent}}+1)\%R_m,(C_{\mathrm{rcurrent}}+1){\%R}_m\≠0\\ R_m,(C_{\mathrm{rcurrent}}+1){\%R}_m=0\end{array}\right\},$ Wherein (C)_rcurrent+1)％C_mIs represented by (C)_rcurrent+1) divided by C_mTaking the rest of the results;

C_rcurrentthe number of child nodes with routing function currently owned by a father node is n which is more than or equal to 1_thr≤R_m。

203. When the first section of address space in the segmented address space is used up, the father node calculates according to the network parameters to obtain a first address, adds the first address and the offset of the second section of address space relative to the first section of address space in the multi-section address space to obtain a second address which is used as an address A in the second section of address space distributed for the terminal child node_eWherein

A_e＝A_se×S_skip+A_p+C_skip(d)×R_m+n_the；

wherein A is_p+C_skip(d)×R_m+n_theIs a first address, A_se×S_skipThe offset of the second section of address space relative to the first section of address space in the multi-section address space;

wherein,A_se×S_skip＜65536，A_sethe number of times of address space expansion is required for allocating addresses to the terminal child nodes, andwherein,

is represented by C_ecurrentIs divided by (C)_m-R_m) Rounding down the result of (1);

A_pis a parent node address;

C_skip(d) the size of the address space allocated to its child node for the parent node, an

$C_{\mathrm{skip}}\left(d\right)=\left\{\begin{array}{c}1+C_m(L_m-d-1),R_m=1\\ \frac{1+C_m-R_m-C_m\×{R_m}^{(L_m-d-1)}}{1-R_m},R_m\≠1\end{array}\right\},$

Wherein, C_mIs the maximum number of child nodes that a parent node can possess, R_mIs the maximum number of child nodes with routing function that a parent node can possess, L_mThe maximum depth of the network, d the depth of the father node;

n_thethe order of adding terminal sub-nodes to the network, i.e. the nth address in the address allocation of the expansion_theFor example, if 2 terminal sub-nodes have been added, the terminal sub-node added this time is the 3 rd terminal sub-node; and is $n_{\mathrm{the}}=\left\{\begin{array}{c}(C_{\mathrm{ecurrent}}+1)\%(C_m-R_m),(C_{\mathrm{ecurrent}}+1)\%(C_m-R_m)\≠0\\ C_m-R_m,(C_{\mathrm{ecurrent}}+1)\%(C_m-R_m)=0\end{array}\right\};$ Wherein (C)_ecurrent+1)％(C_m-R_m) Is represented by (C)_ecurrent+1) divided by C_m-R_mTaking the rest of the results;

C_ecurrentn is more than or equal to 1 and is the number of the current terminal child nodes owned by the father node_the≤C_m-R_m。

When A is used, it is to be noted that_r> 65536, or A_e> 65536, the address assignment is terminated and the child node is no longer serviced.

Wherein the order of steps 202 and 203 may not be limited thereto.

The address allocation method in the sensor network of the embodiment of the invention is characterized in that the total address space is segmented by taking the address space which can be allocated in the sensor network as a unit to obtain a plurality of sections of address spaces including a first section of address space and a second section of address space, and when the first section of address space is used up, addresses in the second section of address space are allocated to the child nodes with the routing function and the terminal child nodes. Compared with the prior art, the method can realize the expansion of the address space while keeping the corresponding relation between the address and the position under the condition of keeping the existing routing protocol unchanged, and can realize the expansion of the address space while not increasing the system overhead by distributing the address space for the child node with the routing function and the terminal child node.

It should be noted that the above-mentioned embodiments are illustrative, and are not intended to limit the invention. A parent node is typically able to compute and assign C to child nodes based on certain computation rules_skip(d) An address, and in C_skip(d) After the address is used up, the address space is further expanded to perform reallocation, and the reallocated address is added with a certain offset to indicate the currently allocated address. For example, if the total address space is allocated as N segments, N is an integer greater than 1The N address spaces are respectively represented by space 1, space 2, and space N. Space 1 may represent addresses 0 to S_skip1, space 2 can represent address S_skipTo (2 XS)_skip1), and so on, this example does not limit the specific numbers. When the address is allocated for the first time, the father node can allocate the address of the address space 1 according to a certain rule, and after the address allocation of the address space 1 is finished, the father node can continue to expand and allocate the address of the space 2. When allocating the address of space 2, the same rule is used to calculate the address and add the offset, i.e. the address size of space 1. Similarly, when calculating and allocating the address of the space m, the father node calculates the address according to the same rule, and adds the offset to the calculated address, namely the size of the address space before the space m, wherein m is more than 1 and less than or equal to N. It can be understood that, when the address space is expanded, if the address allocation of the space 1 is completed, other address spaces after the space 2 may also be directly expanded, for example, any space m, where 1 < m ≦ N, and the embodiment does not specifically limit the specific implementation and the calculation formula.

EXAMPLE III

The present embodiment provides a sensor network node, as shown in fig. 3, where the sensor network node includes:

a segmenting module 301, configured to segment a total address space by using an address space that can be allocated in the sensor network as a unit, so as to obtain a plurality of segments of address spaces including a first segment of address space and a second segment of address space;

an allocating module 302, configured to allocate an address in the second segment of address space to the child node when the first segment of address space is used up.

The first section of address space is a first section of address space in the multiple sections of address spaces, and the second section of address space is an expanded address space in the multiple sections of address spaces; or

The first section of address space and the second section of address space are respectively two sections of extended address spaces in the multi-section address spaces.

The second section of address space is adjacent to or not adjacent to the first section of address space in address space.

The allocating module 302 is specifically configured to calculate a first address according to a network parameter, add offsets of the first address and a second address space relative to a first address space in multiple address spaces, and obtain a second address, where the second address is used as an address in the second address space allocated to the child node.

Further, when the child node is a child node with a routing function, the allocating module 302 is specifically configured to calculate, based on the following manner, an address a in the second segment of address space allocated to the child node with a routing function_rWherein

A_r＝A_sr×S_skip+A_p+C_skip(d)×(n_thr-1)+1；

wherein A is_p+C_skip(d)×(n_thr-1) +1 is the first address, A_sr×S_skipThe offset of the second section of address space relative to the first section of address space in the multi-section address space;

wherein A is_srThe number of times of address space expansion is required for allocating the address to the child node having the routing function, and

wherein,is represented by C_rcurrentDivided by R_mRounding down the result of (1);

A_pis a parent node address;

C_skip(d) the size of the address space allocated to its child node for the parent node, an

$C_{\mathrm{skip}}\left(d\right)=\left\{\begin{array}{c}1+C_m(L_m-d-1),R_m=1\\ \frac{1+C_m-R_m-C_m\&times;{R_m}^{(L_m-d-1)}}{1-R_m},R_m\&NotEqual;1\end{array}\right\},$

S_skipIs the size of the address space that can be allocated in the sensor network, an

$S_{\mathrm{skip}}=R_m\&times;\left(\frac{1+C_m-R_m-C_m\&times;{R_m}^{(L_m-1)}}{1-R_m}\right)+C_m-R_m,$

Wherein, C_mIs the maximum number of child nodes that a parent node can possess, R_mIs the maximum number of child nodes with routing function that a parent node can possess, L_mThe maximum depth of the network, d the depth of the father node;

n_thran order of joining the network for the child node having the routing function, and

$n_{\mathrm{thr}}=\left\{\begin{array}{c}(C_{\mathrm{rcurrent}}+1)\%R_m,(C_{\mathrm{rcurrent}}+1){\%R}_m\&NotEqual;0\\ R_m,(C_{\mathrm{rcurrent}}+1){\%R}_m=0\end{array}\right\},$ wherein (C)_rcurrent+1)％C_mIs represented by (C)_rcurrent+1) divided by C_mTaking the rest of the results;

C_rcurrentthe number of child nodes with routing function currently owned by a father node is n which is more than or equal to 1_thr≤R_m。

Further, when the child node is a terminal child node, the allocating module 302 is specifically configured to calculate, based on the following manner, an address a in the second segment of address space allocated to the terminal child node_eWherein

A_e＝A_se×S_skip+A_p+C_skip(d)×R_m+n_the；

wherein A is_p+C_skip(d)×R_m+n_theIs a first address, A_se×S_skipThe offset of the second section of address space relative to the first section of address space in the multi-section address space;

wherein A is_seThe number of times of address space expansion is required for allocating addresses to the terminal child nodes, and

wherein,

is represented by C_ecurrentIs divided by (C)_m-R_m) Rounding down the result of (1);

A_pis a parent node address;

C_skip(d) the size of the address space allocated to its children for the parent node,and is

$C_{\mathrm{skip}}\left(d\right)=\left\{\begin{array}{c}1+C_m(L_m-d-1),R_m=1\\ \frac{1+C_m-R_m-C_m\&times;{R_m}^{(L_m-d-1)}}{1-R_m},R_m\&NotEqual;1\end{array}\right\},$

S_skipIs the size of the address space that can be allocated in the sensor network, an

$S_{\mathrm{skip}}=R_m\&times;\left(\frac{1+C_m-R_m-C_m\&times;{R_m}^{(L_m-1)}}{1-R_m}\right)+C_m-R_m,$

Wherein, C_mIs the maximum number of child nodes that a parent node can possess, R_mIs the maximum number of child nodes with routing function that a parent node can possess, L_mThe maximum depth of the network, d the depth of the father node;

n_theorder of joining the network for the terminal child nodes, and

$n_{\mathrm{the}}=\left\{\begin{array}{c}(C_{\mathrm{ecurrent}}+1)\%(C_m-R_m),(C_{\mathrm{ecurrent}}+1)\%(C_m-R_m)\&NotEqual;0\\ C_m-R_m,(C_{\mathrm{ecurrent}}+1)\%(C_m-R_m)=0\end{array}\right\},$ wherein,

(C_ecurrent+1)％(C_m-R_m) Is represented by (C)_ecurrent+1) divided by C_m-R_mTaking the rest of the results;

C_ecurrentn is more than or equal to 1 and is the number of the current terminal child nodes owned by the father node_the≤C_m-R_m。

In this embodiment, the sensor network node may be a parent node.

In the sensor network node according to the embodiment of the present invention, the total address space is segmented by using the address space that can be allocated in the sensor network as a unit, so as to obtain a plurality of segments of address spaces including a first segment of address space and a second segment of address space, and when the first segment of address space is used up, an address in the second segment of address space is allocated to a child node. Compared with the prior art, the method can realize the expansion of the address space while keeping the corresponding relation between the address and the position under the condition of keeping the existing routing protocol unchanged, and can realize the expansion of the address space while not increasing the system overhead by distributing the address space for the child node with the routing function and the terminal child node.

The sensor network node provided by the embodiment of the invention can realize the method embodiment provided by the invention. The address allocation method in the sensor network and the sensor network node provided by the embodiment of the invention can be applied to address allocation of the sensor node in the sensor network, but are not limited thereto.

It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like.

The above description is only for the specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are included in the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims (8)

1. An address allocation method in a sensor network, comprising:

segmenting the total address space by taking the address space distributed in the sensor network as a unit to obtain a plurality of sections of address spaces including a first section of address space and a second section of address space; wherein the size S of the address space allocated in the sensor network_skipComprises the following steps:

$S_{\mathrm{skip}}=R_m\&times;\left(\frac{1+C_m-R_m-C_m\&times;{R_m}^{L_m-1}}{1-R_m}\right)+C_m-R_m,$ wherein, the C_mThe maximum number of child nodes owned by a parent node, R_mMaximum number of child nodes having routing function owned by parent node, L_mIs the maximum depth of the network, and C_m、R_mAnd L_mPresetting;

when the address space of the father node in the first section of address space for allocating the father node to the child node is used up, allocating the address of the father node in the second section of address space for allocating the child node to the child node, wherein the size C of the address space of the father node in each section of address space of the plurality of sections of address spaces for allocating the child node to the father node is C_skip(d) Comprises the following steps:

$C_{\mathrm{skip}}\left(d\right)=\left\{\begin{array}{c}1+C_m(L_m-d-1),R_m=1\\ \frac{1+C_m-R_m-C_m\&times;{R_m}^{(L_m-d-1)}}{1-R_m},R_m\&NotEqual;1\end{array}\right\},$ d is the depth of a father node, and allocating the address of the father node in the second section of address space to the address space of the son node comprises the following steps: and calculating according to network parameters to obtain a first address, and adding the first address and the offset of the second section of address space relative to the first section of address space in the multiple sections of address spaces to obtain a second address, wherein the second address is the address in the second section of address space allocated by the child node.

2. The method of claim 1,

the first section of address space is a first section of address space in the multiple sections of address spaces, and the second section of address space is an expanded address space in the multiple sections of address spaces; or

The first section of address space and the second section of address space are respectively two sections of extended address spaces in the multi-section address spaces.

3. The method according to claim 1, wherein when the child node is a child node with a routing function, the calculating a first address according to the network parameter, and adding an offset of a second segment of address space relative to a first segment of address space in a plurality of segments of address space to obtain a second address, and the obtaining the second address as the address in the second segment of address space allocated to the child node comprises:

calculating the address A in the second segment of address space allocated to the routing-function child node based on_r：

A_r＝A_sr×S_skip+A_p+C_skip(d)×(n_thr-1)+1；

Wherein A is_p+C_skip(d)×(n_thr-1) +1 is the first address, A_sr×S_skipThe offset of the second section of address space relative to the first section of address space in the multi-section address space;

A_srthe number of times of address space expansion is required for allocating the address to the child node having the routing function, and

wherein,

is represented by C_rcurrentDivided by R_mRounding down the result of (1);

A_pis a parent node address;

n_thran order of joining the network for the child node having the routing function, and $n_{\mathrm{thr}}=\left\{\begin{array}{c}(C_{\mathrm{rcurrent}}+1)\%R_m,(C_{\mathrm{rcurrent}}+1){\%R}_m\&NotEqual;0\\ R_m,(C_{\mathrm{rcurrent}}+1){\%R}_m=0\end{array}\right\},$ wherein,% represents the remainder operation, C_rcurrentThe number of child nodes with routing function currently owned by a father node is n which is more than or equal to 1_thr≤R_m；

C_skip(d) The size of the address space allocated to its child node for the parent node, an

$C_{\mathrm{skip}}\left(d\right)=\left\{\begin{array}{c}1+C_m(L_m-d-1),R_m=1\\ \frac{1+C_m-R_m-C_m\&times;{R_m}^{(L_m-d-1)}}{1-R_m},R_m\&NotEqual;1\end{array}\right\};$

S_skipThe size of the address space allocated in the sensor network, and

$S_{\mathrm{skip}}=R_m\&times;\left(\frac{1+C_m-R_m-C_m\&times;{R_m}^{(L_m-1)}}{1-R_m}\right)+C_m-R_m;$

wherein, C_mMaximum number of child nodes, R, owned by a parent node_mMaximum number of child nodes with routing function, L, owned by a parent node_mIs the maximum depth of the network and d is the depth of the parent node.

4. The method according to claim 1, wherein when the child node is a terminal child node, the calculating according to the network parameter obtains a first address, and adding an offset of a second segment of address space relative to a first segment of address space in a plurality of segments of address spaces to obtain a second address, and the obtaining, as the address in the second segment of address space allocated to the child node, comprises:

calculating the address A in the second segment of address space allocated to the terminal child node based on the following mode_eWherein

A_e＝A_se×S_skip+A_p+C_skip(d)×R_m+n_the；

wherein A is_p+C_skip(d)×R_m+n_theIs a first address, A_se×S_skipThe offset of the second section of address space relative to the first section of address space in the multi-section address space;

wherein A is_seThe number of times of address space expansion is required for allocating addresses to the terminal child nodes, and

wherein,

is represented by C_ecurrentIs divided by (C)_m-R_m) Rounding down the result of (1);

A_pis a parent node address;

n_thethe order in which the terminal child nodes join the network, and $n_{\mathrm{the}}=\left\{\begin{array}{c}(C_{\mathrm{ecurrent}}+1)\%(C_m-R_m),(C_{\mathrm{ecurrent}}+1)\%(C_m-R_m)\&NotEqual;0\\ C_m-R_m,(C_{\mathrm{ecurrent}}+1)\%(C_m-R_m)=0\end{array}\right\},$ wherein,% represents the remainder operation, C_ecurrentN is more than or equal to 1 and is the number of the current terminal child nodes owned by the father node_the≤C_m-R_m；

C_skip(d) The size of the address space allocated to its child node for the parent node, an

$C_{\mathrm{skip}}\left(d\right)=\left\{\begin{array}{c}1+C_m(L_m-d-1),R_m=1\\ \frac{1+C_m-R_m-C_m\&times;{R_m}^{(L_m-d-1)}}{1-R_m},R_m\&NotEqual;1\end{array}\right\};$

S_skipThe size of the address space allocated in the sensor network, and

$S_{\mathrm{skip}}=R_m\&times;\left(\frac{1+C_m-R_m-C_m\&times;{R_m}^{(L_m-1)}}{1-R_m}\right)+C_m-R_m;$

wherein, C_mMaximum number of child nodes, R, owned by a parent node_mMaximum number of child nodes with routing function, L, owned by a parent node_mIs the maximum depth of the network and d is the depth of the parent node.

5. The method according to any of claims 1-2, wherein the second segment of address space is adjacent or non-adjacent in address space to the first segment of address space.

6. A sensor network node, comprising:

the segmentation module is used for segmenting the total address space by taking the address space distributed in the sensor network as a unit to obtain a plurality of sections of address spaces including a first section of address space and a second section of address space; wherein the size S of the address space allocated in the sensor network_skipComprises the following steps:

$S_{\mathrm{skip}}=R_m\&times;\left(\frac{1+C_m-R_m-C_m\&times;{R_m}^{L_m-1}}{1-R_m}\right)+C_m-R_m,$ wherein, the C_mMaximum of child nodes owned by a parent nodeNumber of said R_mMaximum number of child nodes having routing function owned by parent node, L_mIs the maximum depth of the network, and C_m、R_mAnd L_mPresetting;

an allocating module, configured to allocate, to a child node in the second segment of address space, an address of an address space that the parent node uses to allocate to its child node in the second segment of address space when the address space that the parent node uses to allocate to its child node in the first segment of address space is used up, where the size C of the address space that the parent node allocates to its child node in each segment of address space of the plurality of segments of address space is that of the parent node_skip(d) Comprises the following steps:

$C_{\mathrm{skip}}\left(d\right)=\left\{\begin{array}{c}1+C_m(L_m-d-1),R_m=1\\ \frac{1+C_m-R_m-C_m\&times;{R_m}^{(L_m-d-1)}}{1-R_m},R_m\&NotEqual;1\end{array}\right\},$ d is the depth of a father node, and allocating the address of the father node in the second section of address space to the address space of the son node comprises the following steps: and calculating according to network parameters to obtain a first address, and adding the first address and the offset of the second section of address space relative to the first section of address space in the multiple sections of address spaces to obtain a second address, wherein the second address is the address in the second section of address space allocated by the child node.

7. The sensor network node according to claim 6, wherein, when the child node is a routing-capable child node, the allocating module is specifically configured to calculate the address a in the second segment of address space allocated to the routing-capable child node based on the following manner_r：

A_r＝A_sr×S_skip+A_p+C_skip(d)×(n_thr-1)+1；

Wherein A is_p+C_skip(d)×(n_thr-1) +1 is the first address, A_sr×S_skipThe offset of the second section of address space relative to the first section of address space in the multi-section address space;

wherein A is_srThe number of times of address space expansion is required for allocating the address to the child node having the routing function, andwherein,

is represented by C_rcurrentDivided by R_mRounding down the result of (1);

A_pis a parent node address;

n_thran order of joining the network for the child node having the routing function, and $n_{\mathrm{thr}}=\left\{\begin{array}{c}(C_{\mathrm{rcurrent}}+1)\%R_m,(C_{\mathrm{rcurrent}}+1){\%R}_m\&NotEqual;0\\ R_m,(C_{\mathrm{rcurrent}}+1){\%R}_m=0\end{array}\right\},$ wherein,% represents the remainder operation, C_rcurrentThe number of child nodes with routing function currently owned by a father node is n which is more than or equal to 1_thr≤R_m；

C_skip(d) The size of the address space allocated to its child node for the parent node, an

$C_{\mathrm{skip}}\left(d\right)=\left\{\begin{array}{c}1+C_m(L_m-d-1),R_m=1\\ \frac{1+C_m-R_m-C_m\&times;{R_m}^{(L_m-d-1)}}{1-R_m},R_m\&NotEqual;1\end{array}\right\};$

S_skipThe size of the address space allocated in the sensor network, and

$S_{\mathrm{skip}}=R_m\&times;\left(\frac{1+C_m-R_m-C_m\&times;{R_m}^{(L_m-1)}}{1-R_m}\right)+C_m-R_m;$

wherein, C_mMaximum number of child nodes, R, owned by a parent node_mMaximum number of child nodes with routing function, L, owned by a parent node_mIs the maximum depth of the network and d is the depth of the parent node.

8. The sensor network node according to claim 6, wherein, when the child node is a terminal child node, the allocating module is specifically configured to calculate the address a in the second segment of address space allocated to the terminal child node based on the following manner_eWherein

A_e＝A_se×S_skip+A_p+C_skip(d)×R_m+n_the；

wherein A is_p+C_skip(d)×R_m+n_theIs a first address, A_se×S_skipThe offset of the second section of address space relative to the first section of address space in the multi-section address space;

wherein A is_seThe number of times of address space expansion is required for allocating addresses to the terminal child nodes, and

wherein,

is represented by C_ecurrentIs divided by (C)_m-R_m) Rounding down the result of (1);

A_pis a parent node address;

n_thethe order in which the terminal child nodes join the network, and $n_{\mathrm{the}}=\left\{\begin{array}{c}(C_{\mathrm{ecurrent}}+1)\%(C_m-R_m),(C_{\mathrm{ecurrent}}+1)\%(C_m-R_m)\&NotEqual;0\\ C_m-R_m,(C_{\mathrm{ecurrent}}+1)\%(C_m-R_m)=0\end{array}\right\},$ wherein,% represents the remainder operation, C_ecurrentN is more than or equal to 1 and is the number of the current terminal child nodes owned by the father node_the≤C_m-R_m；

C_skip(d) The size of the address space allocated to its child node for the parent node, an

$C_{\mathrm{skip}}\left(d\right)=\left\{\begin{array}{c}1+C_m(L_m-d-1),R_m=1\\ \frac{1+C_m-R_m-C_m\&times;{R_m}^{(L_m-d-1)}}{1-R_m},R_m\&NotEqual;1\end{array}\right\};$

S_skipThe size of the address space allocated in the sensor network, and

$S_{\mathrm{skip}}=R_m\&times;\left(\frac{1+C_m-R_m-C_m\&times;{R_m}^{(L_m-1)}}{1-R_m}\right)+C_m-R_m;$

wherein, C_mMaximum number of child nodes, R, owned by a parent node_mMaximum number of child nodes with routing function, L, owned by a parent node_mIs the maximum depth of the network and d is the depth of the parent node.

Images