CN102739817A - RFID (Radio Frequency Identification Devices) routing node address allocation method - Google Patents

Abstract

The invention discloses an RFID (Radio Frequency Identification Devices) routing node address allocation method. The method comprises the following processes of establishing an adjacency list, determining a set membership between nodes, and allocating a node address value. The method is characterized in that node weights are introduced to reflect the heterogeneity of node distribution; and the sizes of node address blocks are dynamically allocated according to different node weights. The method sufficiently considers the heterogeneity of the node distribution, can better improve the allocation success rate of node addresses, and can reduce the average communication cost.

Description

A kind of RFID routing node address distribution method

Technical field

The present invention relates to the distribution technique of node address in the cordless communication network, relate to a kind of RFID routing node address distribution method.

Background technology

In cordless communication network, the network address that node must have oneself just can communicate.The RFID wireless sensor network uses the distributed address distribution mechanism of acquiescence to distribute the address as node, owing to do not consider the heterogeneity of network topology structure, causes the waste of network node address resource easily.

In the reality wireless RF ID network environment because the random motion meeting of the random distribution property of node and existence causes the non-uniform Distribution of node, the situation that the part of nodes address space is rich, the part of nodes address space is not enough appears.For head it off, existing method is following:

SLAR (Single Level Address Reorganization) algorithm, the problem that address space is not enough during as father node to routing node proposes: reduce address offset amount C through increasing depth parameter d (d=d+1) _Skip(d) thus the scheme that the father node address space is increased.

Borrow address scheme: the existing address algorithm of borrowing mainly is divided into three kinds: when 1) the father node address space was not enough, the informing network telegon was borrowed the address and is distributed the idle address of borrowing; 2) father node that address space is not enough sends by means of application IP addresses according to the priority that the address space left node is arranged and distributes idle address.

The shortcoming of above the whole bag of tricks is respectively:

The method that the SLAR algorithm exchanges width for the degree of depth can be improved the not enough situation of routing node address space, but the whole network degree of depth is diminished, and the address reconfiguration operation makes networking expense and increase consuming time, so be applicable to the network that the degree of depth is big.

The network address that node is provided and uses node of borrowing the address algorithm need write down idle address is so that the correct route packet.The existing address algorithm of borrowing can improve node networking rate; But there is not control to borrow the scope of address; Destroyed " position-address " relation of sensing network; Increase the redundant path of tree network, can increase the extra routing cost and the storage overhead of node in that bunch tree routing algorithm is in service, hang down expense with sensing network and do not conform to characteristics cheaply.

Summary of the invention

The objective of the invention is to overcome the above-mentioned deficiency that prior art exists, a kind of RFID routing node address distribution method is provided, this method can improve node address well and be distributed into power, reduces the average communication expense, and concrete technical scheme is following.

A kind of RFID routing node address distribution method; Be characterized in introducing the heterogeneity that the node weights reflect that node distributes; The size of node address piece is distributed according to the Different Dynamic of node weights, and this method comprises that adjacency list sets up set membership deterministic process and node-address value assigning process between process, node.

In above-mentioned a kind of RFID routing node address distribution method, said adjacency list is set up process and is started by telegon, specifically comprises:

(1) telegon sends a broadcasting command Broad, initiates adjacency list and sets up process, and the tree depth D epth initial value of neighbor device is 0 among the broadcasting command Broad;

(2) neighbors will be done following the processing after receiving broadcasting command Broad:

1. will in its neighbor table, set up corresponding record by this broadcasting command Broad if receive the first time, the Depth value is Depth value+1 in the broadcasting command of receiving in this neighbor table record; Otherwise will judge Depth value+1 in the broadcasting command whether less than corresponding Depth value in the existing neighbor table record, as if less than then replacing it, otherwise be left intact;

2. according to the address of the broadcasting command of receiving, send a commands in return Ack to target; Destination node is set up one child node entry record table according to the ACK order of receiving, its sub-mark position is false;

3. if neighbors is a routing node, then continue to transmit broadcasting; If terminal node is not then transmitted broadcasting.

In above-mentioned a kind of RFID routing node address distribution method, the set membership deterministic process comprises between said node:

(1) node of Depth value minimum sends child node application order Son-Request as its father node to father node in the node selection neighbor table clauses and subclauses; It is that the Ex_address1 node sends the request as its child node to the address for the Ex_address2 node that said application order Son-Request is used for the address, the device type De_type of report simultaneously oneself, the son node number Unode_number that has under its command;

(2) father node is received child node application order Son-Request, in child node entry record table, inquires about, and is true with its sub-mark position, and will has the node number under its command and be revised as new value;

(3) if the child node numerical value that a node has under its command changes, it will send out child node application order Son-Request again to its father node;

(4) through 2*L _mThe individual adjacent node message transmission time, the set membership of adjacent node is definite basically; Telegon and routing node will calculate its affiliated shared weights Weight of each route child node.

In above-mentioned a kind of RFID routing node address distribution method, said node-address value assigning process comprises:

Definition C _mAnd R _mBe respectively maximum node number and routing node number that the full-function device of network can distribute, L _mBe the depth capacity of network, then the network degree of depth by the routing node of d ability addresses distributed piece C _Skip(d) value is:

$C_{\mathrm{skip}}\left(d\right)=\left\{\begin{array}{cc}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.---\left(1\right);$

The network address, position (Net_address) of telegon is made as 0, and the child node network address (Net_address) distribution in its affiliated area is carried out according to following strategy,

If the child node type is a routing node, distribute the address according to formula (2) for this child node,

If the child node type is a terminal node, this child node distributes the address to be:

Wherein: A _Son-zExpression null terminator Null address of node, A _Son-1The address of representing the 1st route child node, A _Son-iThe address of representing i route child node, w _ParentThe weights of expression father node, w _I-1The weights of representing the i-1 node, n are represented n route child node, and span is 1≤n≤C _m-R _m

In above-mentioned a kind of RFID routing node address distribution method, it is that the node of Ex_address1 is that the node of Ex_address2 sends a response message to the address that said ACK order is used for the address.

Compared with prior art, the present invention has following advantage and technique effect:

RFID routing node address distribution method of the present invention is introduced the heterogeneity that the node weights reflect that node distributes; The size of node address piece is distributed according to the Different Dynamic of node weights; Taken into full account the heterogeneity that node distributes, can improve node address well and be distributed into power, reduce the average communication expense.

Description of drawings

Fig. 1 sets up the process sketch map for adjacency list in the RFID routing node address assignment of the present invention.

Embodiment

Below in conjunction with accompanying drawing practical implementation of the present invention is described further, but enforcement of the present invention and protection range are not limited thereto.

The RFID routing address distribution method of this instance is divided into three phases: the distribution of set membership between node, node-address value is set up, confirmed to adjacency list.

1, adjacency list is set up process, and is as shown in Figure 1:

At first have one to inquire after each other to understand its process of neighbor node state on every side between the node, this time is approximately 2*L _mThe individual adjacent node message transmission time.Detailed process is following:

(1) telegon sends a broadcasting command Broad, initiates adjacency list and sets up process; Its Depth initial value is 0.

(2) neighbors will be done following the processing after receiving broadcasting command:

1. if receive the broadcasting command of this address node for the first time, will set up corresponding neighbor table clauses and subclauses for it, its Depth value is Depth value+1 in the broadcasting command of receiving; Will do you otherwise judge that its Depth value+1 is less than corresponding Depth value in the existing clauses and subclauses? If less than then will revising it, otherwise be left intact;

2. according to the broadcast address of receiving, send a commands in return Ack to target; Destination node is set up possible child node entry record according to the ACK order of receiving;

If 3. routing node then continues to transmit broadcasting; If terminal node is not then transmitted broadcasting.

2, confirm set membership, comprise the steps:

(1) node of Depth value minimum sends child node application order Son-Request as its father node to it in the node selection neighbor table clauses and subclauses;

(2) node is received child node application order, in possible child node entry record table, inquires about, and finding its sub-mark position is true, has the node number under its command and is revised as new value;

(3), send out child node application order again to father node if the child node numerical value that node has under its command changes.

(4) through about 2*L _mThe individual adjacent node message transmission time, the set membership of adjacent node is definite basically.Telegon and routing node will calculate its affiliated shared weights Weight of each route child node.

3, the assigning process of node-address value is following:

Definition C _mAnd R _mBe respectively maximum node number and routing node number that the full-function device of network can distribute, L _mBe the depth capacity of network, then the network degree of depth by the routing node of d ability addresses distributed piece C _Skip(d) value is:

$C_{\mathrm{skip}}\left(d\right)=\left\{\begin{array}{cc}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.---\left(1\right);$

16 network addresss (Net_address) of telegon are made as 0, and the child node network address (Net_address) distribution in its affiliated area is carried out according to following strategy.

If the child node type is a routing node, distribute the address for this child node according to formula (2).

If the child node type is a terminal node, distribute the address for this child node according to formula (3):

Wherein: A _Son-zExpression null terminator Null address of node (A _Son-1The address of representing the 1st route child node, A _Son-iThe address of representing i route child node), w _ParentThe weights of expression father node, w _I-1The weights of representing the i-1 node, 1≤n≤C _m-R _m

Above node address distribution method is introduced the heterogeneity that the node weights reflect that node distributes; The size of node address piece is distributed according to the Different Dynamic of node weights; Taken into full account the heterogeneity that node distributes, thereby can improve node address well and be distributed into power, reduce the average communication expense.

Related definition that relates in this instance and order are as follows.

1 related definition

1.1 neighbor table

Neighbor table (BTR table) is used for the information of each equipment in the storage transmission scope, and its form is as shown in table 1.

Table 1 neighbor table catalogue format

1.2 child node entry record table

Child node table (STR table) is preserved the information of the sub node equipment of this node, and its form is as shown in table 2.

Table 2 child node entry record form

1.3 related command

Definition related command form is following:

(1) broadcasting command Broad (comprising Ex_address, De_type, Depth): be used for node and broadcast 64 device addresses, type and the residing degree of depth of oneself towards periphery.

(2) commands in return Ack (comprising Ex_address1, Ex_address2): being used for the address is that the Ex_address1 node sends a response message to the address for the Ex_address2 node.

(3) child node application order Son-Request (comprising Ex_address1, Ex_address2, De_type, Unode_number): being used for the address is that the Ex_address1 node sends the request as its child node to the address for the Ex_address2 node, the device type of report simultaneously oneself, the son node number that has under its command.

Claims (4)

1. RFID routing node address distribution method; Comprise that adjacency list sets up set membership deterministic process and node-address value assigning process between process, node; It is characterized in that introducing the heterogeneity that the node weights reflect that node distributes; The size of node address piece is distributed according to the Different Dynamic of node weights, and said node-address value assigning process comprises:

Definition C _mAnd R _mBe respectively maximum node number and routing node number that the full-function device of network can distribute, L _mBe the depth capacity of network, then the network degree of depth by the routing node of d ability addresses distributed piece C _Skip(d) value is:

$C_{\mathrm{skip}}\left(d\right)=\left\{\begin{array}{cc}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.---\left(1\right);$

The network address of telegon is made as 0, and the child node network address distribution in its affiliated area is carried out according to following strategy, if the child node type is a routing node, is that this child node is distributed the address according to formula (2),

If the child node type is a terminal node, this child node distributes the address to be:

Wherein: A _Son-zExpression null terminator Null address of node, A _Son-1The address of representing the 1st route child node, A _Son-iThe address of representing i route child node, w _ParentThe weights of expression father node, w _I-1The weights of representing the i-1 node, n are represented n route child node, and span is 1≤n≤C _m-R _m

2. a kind of RFID routing node address distribution method according to claim 1 is characterized in that said adjacency list sets up process and started by telegon, specifically comprises:

(1) telegon sends a broadcasting command Broad, initiates adjacency list and sets up process, and the tree depth D epth initial value of neighbor device is 0 among the broadcasting command Broad;

(2) neighbors will be done following the processing after receiving broadcasting command Broad:

1. will in its neighbor table, set up corresponding record by this broadcasting command Broad if receive the first time, the Depth value is Depth value+1 in the broadcasting command of receiving in this neighbor table record; Otherwise will judge Depth value+1 in the broadcasting command whether less than corresponding Depth value in the existing neighbor table record, as if less than then replacing it, otherwise be left intact;

2. according to the address of the broadcasting command of receiving, send a commands in return Ack to target; Destination node is set up one child node entry record table according to the ACK order of receiving, its sub-mark position is false;

3. if neighbors is a routing node, then continue to transmit broadcasting; If terminal node is not then transmitted broadcasting.

3. a kind of RFID routing node address distribution method according to claim 2 is characterized in that it is that the node of Ex_address1 is that the node of Ex_address2 sends a response message to the address that said ACK order is used for the address.

4. a kind of RFID routing node address distribution method according to claim 2 is characterized in that the set membership deterministic process comprises between said node:

(1) node of Depth value minimum sends child node application order Son-Request as its father node to father node in the node selection neighbor table clauses and subclauses; It is that the Ex_address1 node sends the request as its child node to the address for the Ex_address2 node that said application order Son-Request is used for the address, the device type De_type of report simultaneously oneself, the son node number Unode_number that has under its command;

(2) father node is received child node application order Son-Request, in child node entry record table, inquires about, and is true with its sub-mark position, and will has the node number under its command and be revised as new value;

(3) if the child node numerical value that a node has under its command changes, it will send out child node application order Son-Request again to its father node;

(4) through 2*L _mThe individual adjacent node message transmission time, the set membership of adjacent node is definite basically; Telegon and routing node will calculate its affiliated shared weights Weight of each route child node.

Images