CN102739817B - RFID (Radio Frequency Identification Devices) routing node address allocation method - Google Patents
RFID (Radio Frequency Identification Devices) routing node address allocation method Download PDFInfo
- Publication number
- CN102739817B CN102739817B CN201210133466.XA CN201210133466A CN102739817B CN 102739817 B CN102739817 B CN 102739817B CN 201210133466 A CN201210133466 A CN 201210133466A CN 102739817 B CN102739817 B CN 102739817B
- Authority
- CN
- China
- Prior art keywords
- node
- address
- child node
- child
- son
- 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
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
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
Technical field
The present invention relates to the distribution technique of node address in 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.RFID wireless sensor network is used the distributed address assignment mechanism mechanism of acquiescence for node distributes address, owing to not considering the heterogeneity of network topology structure, easily causes the waste of network node address resource.
In reality wireless RF ID network environment, due to the random distribution of node and the random motion meeting that exists, cause the non-uniform Distribution of node, occur that part of nodes address space is rich, the situation of part of nodes address space deficiency.For head it off, existing method is as follows:
SLAR (Single Level Address Reorganization) algorithm, the problem that address space is inadequate during as father node for routing node proposes: by increasing depth parameter d (d=d+1), reduce address offset amount C
skip(d) thus the scheme that father node address space is increased.
Borrow address scheme: the existing address algorithm of borrowing is mainly divided into three kinds: when 1) father node address space is not enough, informing network telegon is borrowed address and distributed the idle address of borrowing; 2) father node of address space deficiency is according to there being the priority of address space left node send by means of application IP addresses and distribute idle address.
The shortcoming of above the whole bag of tricks is respectively:
The method that SLAR algorithm exchanges width for the degree of depth can be improved the situation of routing node address space deficiency, but must make the whole network degree of depth diminish, and address reconfiguration operation makes networking expense and increase consuming time, so be applicable to the network that the degree of depth is large.
The network address that node is provided and uses node of borrowing address algorithm need to record idle address, so that correct route packet.The existing address algorithm of borrowing can improve node networking rate, but there is no to control the scope of borrowing address, destroyed " position-address " relation of sensing network, increase the redundant path of tree network, can increase extra routing cost and the storage overhead of node bunch tree routing algorithm is in service, not conform to feature cheaply with the low expense of sensing network.
Summary of the invention
The object of the invention is to overcome prior art above shortcomings, a kind of RFID routing node address distribution method is provided, the method can improve well node address and be distributed into power, reduces average communication expense, and concrete technical scheme is as follows.
A kind of RFID routing node address distribution method, be characterized in introducing the heterogeneity that node weights reflect that node distributes, the size of node address piece is distributed according to the Different Dynamic of node weights, and the method comprises set membership deterministic process and node-address value assigning process between adjacency list process of establishing, node.
In above-mentioned a kind of RFID routing node address distribution method, described adjacency list process of establishing is started by telegon, specifically comprises:
(1) telegon sends a broadcasting command Broad, initiates adjacency list process of establishing, and in broadcasting command Broad, the tree depth D epth initial value of neighbor device is 0;
(2) neighbors will be done following processing after receiving broadcasting command Broad:
If 1. receive for the first time this broadcasting command Broad, will in its neighbor table, set up corresponding record, in this neighbor table record, Depth value is Depth value+1 in the broadcasting command of receiving; Otherwise will judge that whether Depth value+1 in broadcasting command is less than corresponding Depth value in existing neighbor table record, replaces it if be less than, otherwise is left intact;
2. according to the address of the broadcasting command of receiving, to target, send a commands in return Ack; Destination node, according to the ACK order of receiving, is set up the child node entry record table of, and its sub-mark position is false;
If 3. neighbors is routing node, continue to forward broadcast; If terminal node, does not forward broadcast.
In above-mentioned a kind of RFID routing node address distribution method, between described node, set membership deterministic process comprises:
(1) node selects the minimum node of Depth value in neighbor table entry as its father node, to father node, sends child node application order Son-Request; Described application order Son-Request is that Ex_address1 node is that Ex_address2 node sends the request as its child node to address for address, device type De_type, the son node number Unode_number having under its command of report simultaneously oneself;
(2) father node is received child node application order Son-Request, in child node entry record table, inquires about, and is true, and is revised as new value by having nodes under its command by its sub-mark position;
(3), if the child node numerical value that a node has under its command changes, it sends out child node application order Son-Request again by the father node to it;
(4) through 2*L
mthe individual adjacent node communication time, the set membership of adjacent node is substantially definite; Telegon and routing node will calculate the shared weights Weight of each route child node under it.
In above-mentioned a kind of RFID routing node address distribution method, described 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
mfor the depth capacity of network, the address block C that the routing node that is d in the network degree of depth can distribute
skip(d) value is:
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 child node type is routing node, according to formula (2), be this child node distribution address,
If child node type is terminal node, this child node distributes address to be:
Wherein: A
son-zrepresent null terminator Null address of node, A
son-1the address that represents the 1st route child node, A
son-ithe address that represents i route child node, w
parentthe weights that represent father node, w
i-1the weights that represent i-1 child node, n represents n route child node, span is 1≤n≤C
m-R
m.
In above-mentioned a kind of RFID routing node address distribution method, the node that described ACK order is Ex_address1 for address is that the node of Ex_address2 sends a response message to address.
Compared with prior art, tool of the present invention has the following advantages and technique effect:
RFID routing node address distribution method of the present invention is introduced the heterogeneity that 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 well node address and be distributed into power, reduce average communication expense.
Accompanying drawing explanation
Fig. 1 is adjacency list process of establishing schematic diagram in RFID routing node address assignment of the present invention.
Embodiment
Below in conjunction with accompanying drawing, specific embodiment of the invention is described further, but enforcement of the present invention and protection range are not limited to this.
The RFID routing address distribution method of this example is divided into three phases: the distribution of set membership between node, node-address value is set up, determined to adjacency list.
1, adjacency list process of establishing, as shown in Figure 1:
First between node, have one mutually to inquire after to understand its process of neighbor node state around, this time is approximately 2*L
mthe individual adjacent node communication time.Detailed process is as follows:
(1) telegon sends a broadcasting command Broad, initiates adjacency list process of establishing; Its Depth initial value is 0.
(2) neighbors will be done following processing after receiving broadcasting command:
If 1. receive for the first time the broadcasting command of this address node, will set up corresponding neighbor table entry 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 existing entry? if be less than and will revise it, otherwise be left intact;
2. according to the broadcast address of receiving, to target, send a commands in return Ack; Destination node, according to the ACK order of receiving, is set up possible child node entry record;
If 3. routing node, continues to forward broadcast; If terminal node, does not forward broadcast.
2, determine set membership, comprise the steps:
(1) node selects the minimum node of Depth value in neighbor table entry as its father node, to it, sends child node application order Son-Request;
(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 nodes under its command and is revised as new value;
(3) if the child node numerical value that node has under its command changes, to father node, again send out child node application order.
(4) through about 2*L
mthe individual adjacent node communication time, the set membership of adjacent node is substantially definite.Telegon and routing node will calculate the shared weights Weight of each route child node under it.
3, the assigning process of node-address value is as follows:
Definition C
mand R
mbe respectively maximum node number and routing node number that the full-function device of network can distribute, L
mfor the depth capacity of network, the address block C that the routing node that is d in the network degree of depth can distribute
skip(d) value is:
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 child node type is routing node, according to formula (2), be this child node distribution address.
If child node type is terminal node, according to formula (3), be this child node distribution address:
Wherein: A
son-zrepresent null terminator Null address of node (A
son-1the address that represents the 1st route child node, A
son-ithe address that represents i route child node), w
parentthe weights that represent father node, w
i-1the weights that represent i-1 child node, 1≤n≤C
m-R
m.
Above node address distribution method is introduced the heterogeneity that 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 well node address and be distributed into power, reduce average communication expense.
The related definition relating in this example and order are as follows.
1 related definition
1.1 neighbor table
Neighbor table (BTR table) is for storing the information of each equipment in transmission range, and its form is as shown in table 1.
Table 1 neighbor table catalogue format
1.2 child node entry record tables
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 table catalogue format
1.3 related command
Definition related command form is as follows:
(1) broadcasting command Broad (comprising Ex_address, De_type, Depth): 64 device addresses, type and the residing degree of depth of broadcasting towards periphery oneself for node.
(2) commands in return Ack (comprising Ex_address1, Ex_address2): be that Ex_address1 node is that Ex_address2 node sends a response message to address for address.
(3) child node application order Son-Request (comprising Ex_address1, Ex_address2, De_type, Unode_number): for address, be that Ex_address1 node is that Ex_address2 node sends the request as its child node to address, the device type of report simultaneously oneself, the son node number having under its command.
Claims (2)
1. a RFID routing node address distribution method, comprise set membership deterministic process and node-address value assigning process between adjacency list process of establishing, node, it is characterized in that introducing the heterogeneity that node weights reflect that node distributes, the size of node address piece is distributed according to the Different Dynamic of node weights, and described 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
mfor the depth capacity of network, the address block C that the routing node that is d in the network degree of depth can distribute
skip(d) value is:
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 child node type is routing node, according to formula (2), is that this child node is distributed address,
If child node type is terminal node, this child node distributes address to be:
Wherein: A
son-zrepresent null terminator Null address of node, A
son-1the address that represents the 1st route child node, A
son-ithe address that represents i route child node, w
parentthe weights that represent father node, w
i-1the weights that represent i-1 child node, n represents n route child node, span is 1≤n≤C
m-R
m;
Described adjacency list process of establishing is started by telegon, specifically comprises:
(1) telegon sends a broadcasting command Broad, initiates adjacency list process of establishing, and in broadcasting command Broad, the tree depth D epth initial value of neighbor device is 0;
(2) neighbors will be done following processing after receiving broadcasting command Broad:
If 1. receive for the first time this broadcasting command Broad, will in its neighbor table, set up corresponding record, in this neighbor table record, Depth value is Depth value+1 in the broadcasting command of receiving; Otherwise will judge that whether Depth value+1 in broadcasting command is less than corresponding Depth value in existing neighbor table record, replaces it if be less than, otherwise is left intact;
2. according to the address of the broadcasting command of receiving, to target, send a commands in return Ack; Destination node, according to the ACK order of receiving, is set up a child node entry record table, and the mark position of its child node is false;
If 3. neighbors is routing node, continue to forward broadcast; If terminal node, does not forward broadcast;
Between described node, set membership deterministic process comprises:
(1) node selects the minimum node of Depth value in neighbor table entry as its father node, to father node, sends child node application order Son-Request; Described application order Son-Request is that Ex_address1 node is that Ex_address2 node sends the request as its child node to address for address, device type De_type, the son node number Unode_number having under its command of report simultaneously oneself;
(2) father node is received child node application order Son-Request, in child node entry record table, inquires about, and is true, and is revised as new value by having nodes under its command by the mark position of child node;
(3), if the child node numerical value that a node has under its command changes, it sends out child node application order Son-Request again by the father node to it;
(4) through 2*L
mthe individual adjacent node communication time, the set membership of adjacent node is determined; Telegon and routing node will calculate the shared weights Weight of each route child node under it.
2. a kind of RFID routing node address distribution method according to claim 1, is characterized in that the node that described ACK order is Ex_address1 for address is a response message of node transmission of Ex_address2 to address.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210133466.XA CN102739817B (en) | 2012-04-28 | 2012-04-28 | RFID (Radio Frequency Identification Devices) routing node address allocation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210133466.XA CN102739817B (en) | 2012-04-28 | 2012-04-28 | RFID (Radio Frequency Identification Devices) routing node address allocation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102739817A CN102739817A (en) | 2012-10-17 |
| CN102739817B true CN102739817B (en) | 2014-10-01 |
Family
ID=46994587
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210133466.XA Expired - Fee Related CN102739817B (en) | 2012-04-28 | 2012-04-28 | RFID (Radio Frequency Identification Devices) routing node address allocation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102739817B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102970392B (en) * | 2012-12-18 | 2016-05-11 | 重庆邮电大学 | Efficiently LR-WPAN Mesh network node address distribution method fast of one |
| CN104010335B (en) * | 2014-05-12 | 2017-08-25 | 华南师范大学 | A kind of RFID routing algorithms oriented based on honeycomb and coordinate |
| CN106341250B (en) * | 2015-07-10 | 2019-11-22 | 南宁富桂精密工业有限公司 | Network equipment and network address initialize distribution method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101536472A (en) * | 2006-11-17 | 2009-09-16 | 皇家飞利浦电子股份有限公司 | Method and apparatus for assigning addresses to nodes of a communication network tree structure |
| CN101951661A (en) * | 2010-09-28 | 2011-01-19 | 华为技术有限公司 | Address distribution method in sensor network and sensor network node |
| CN102364970A (en) * | 2011-11-29 | 2012-02-29 | 常熟理工学院 | Implementation method for automatically configuring address of mobile ad hoc network |
-
2012
- 2012-04-28 CN CN201210133466.XA patent/CN102739817B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101536472A (en) * | 2006-11-17 | 2009-09-16 | 皇家飞利浦电子股份有限公司 | Method and apparatus for assigning addresses to nodes of a communication network tree structure |
| CN101951661A (en) * | 2010-09-28 | 2011-01-19 | 华为技术有限公司 | Address distribution method in sensor network and sensor network node |
| CN102364970A (en) * | 2011-11-29 | 2012-02-29 | 常熟理工学院 | Implementation method for automatically configuring address of mobile ad hoc network |
Non-Patent Citations (3)
| Title |
|---|
| A borrowed address assignment algorithm based on inheritance relation for ZigBee networks;Yukun Yao;《Computational Problem-Solving(ICCP)》;20111023;第454～457页 * |
| Yukun Yao.A borrowed address assignment algorithm based on inheritance relation for ZigBee networks.《Computational Problem-Solving(ICCP)》.2011,第454～457页. |
| 班艳丽，等.基于能量均衡的ZigBee网络树路由算法.《计算机应用》.2008,第28卷(第11期),第2791～2794页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102739817A (en) | 2012-10-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103533529B (en) | A kind of method of resource multiplex improving D2D system energy efficiency and system | |
| CN100450201C (en) | Distributed adaptive dynamic channel dispatching method | |
| CN106162684A (en) | Based on ZigBee-network data transmission method, Apparatus and system | |
| CN103491590B (en) | A kind of implementation method of wireless sensor network route of future generation | |
| CN102291448B (en) | Automatic IP (Internet protocol) address allocation method based on geographical position in mobile ad hoc network | |
| CN103220724B (en) | Cellular and dimension to dimension (D2D) user frequency spectrum accessing method in D2D communication mixing system | |
| US20090023460A1 (en) | System and method for setting up P2P communication group in cellular system, and P2P communication system and method using P2P communication group | |
| CN104244426A (en) | Resource distribution method and device for data radio bear (DRB) | |
| CN105430751A (en) | Device to Device (D2D) resource distribution method of Internet of Vehicles terminal and related device | |
| CN107710826B (en) | Method and device for establishing wireless backhaul connection | |
| CN102547871A (en) | Method and device for consulting resource in D2D (Device To Device) communication | |
| CN101127714B (en) | A route management method and device for wireless mesh network | |
| KR101658736B1 (en) | Wsn clustering mehtod using of cluster tree structure with low energy loss | |
| CN102333118A (en) | Automatic Internet protocol version 6 (IPv6) address configuration method for vehicular network | |
| CN102395126B (en) | Mobile Ad hoc network address configuration realization method based on tree structure | |
| CN101442789A (en) | Access control method and apparatus of mobile communication system layered network | |
| CN103747431A (en) | Method and device for realizing rapid roaming based on neighbor detection | |
| CN103973387A (en) | Method and device for maintaining time slot state information | |
| CN104158867A (en) | Information multi-hop forwarding method based on WAVE (wireless access in vehicular environments) protocol | |
| CN102739817B (en) | RFID (Radio Frequency Identification Devices) routing node address allocation method | |
| CN101489221B (en) | Data sending, transmitting, receiving method and apparatus, local area network establishing method and apparatus | |
| CN105828404A (en) | Clustering routing method based on channel access heterogeneous wireless sensor network | |
| CN106604398B (en) | Resource allocation method and device | |
| CN104754589B (en) | Dynamic networking method based on traffic aware | |
| CN101657040B (en) | Method, device and system for finding wireless network topology |
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: 20141001 Termination date: 20190428 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |