CN112492057A - Address self-configuration method of fixed root node - Google Patents
Address self-configuration method of fixed root node Download PDFInfo
- Publication number
- CN112492057A CN112492057A CN202011277615.0A CN202011277615A CN112492057A CN 112492057 A CN112492057 A CN 112492057A CN 202011277615 A CN202011277615 A CN 202011277615A CN 112492057 A CN112492057 A CN 112492057A
- Authority
- CN
- China
- Prior art keywords
- node
- address
- message
- child
- neighbor
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/50—Address allocation
- H04L61/5007—Internet protocol [IP] addresses
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/50—Address allocation
- H04L61/5046—Resolving address allocation conflicts; Testing of addresses
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention discloses an address self-configuration method of a fixed root node, which is applied to the technical field of wireless ad hoc network networking and aims at the problem that the wireless ad hoc network needs low-cost address self-configuration; the method of the invention can reduce the consumption of network resources.
Description
Technical Field
The invention belongs to the technical field of wireless ad hoc networking, and particularly relates to a node address allocation and management technology.
Background
A wireless ad hoc network is a multi-hop wireless network consisting of a plurality of wireless nodes that does not rely on any infrastructure communication facilities. Before the wireless nodes communicate, a unique address must be configured, so that the problem of address configuration of the nodes is solved in the wireless ad hoc network. In a conventional network, an address configuration scheme is divided into two forms of stateful address configuration and stateless address configuration. The stateful address configuration scheme adopts a communication mode of a server/client to allocate addresses, namely, the nodes send requests for applying addresses to the server, and then the server allocates the addresses for the nodes in the network in a unified mode. Because the wireless ad hoc network has no infrastructure, the stateful address configuration scheme cannot be used in the wireless ad hoc network, and in the stateless address configuration scheme, each allocated address needs to be repeatedly detected in the whole network to ensure the uniqueness of the allocated address, so that a large amount of control packet overhead is caused, a large amount of network resources are consumed, and the stateful address configuration scheme is not suitable.
There is a need to establish a low overhead address self-configuration for wireless ad hoc networks.
Disclosure of Invention
In order to solve the above technical problems, the present invention provides an address self-configuration method for a fixed root node, which selects a distributed address allocation manner for the fixed root node, so that the consumed network resources are less and the consumed time is shorter.
The technical scheme adopted by the invention is as follows: a fixed root node address self-configuration method selects a node as a root node, and adopts an improved Cskip function to configure an address pool and an address, wherein the expression of the improved Cskip function is as follows:
wherein d represents the depth of the node, Cskip (d) represents the number of addresses owned by the parent node at different depths, Cm represents the maximum number of child nodes which the parent node can have, and Lm represents the maximum depth of the network.
The address allocation process of the new network access node comprises the following steps:
s1, the new network access node broadcasts an address discovery message in a one-hop range, the source address is 0.0.0.0, the destination address is 255.255.255, the destination MAC is FF, and generates a serial number to identify the address discovery message;
s2, when the neighbor node receives the address discovery message, if the neighbor node has the address that can be distributed, replying the message, wherein the replying message is accompanied with the configuration information: the tree depth of the neighbor, the IP address to be distributed, the depth of an address pool, the initial address of the address pool, the parameters Cm and Lm and the serial number of the address discovery message; if the neighbor has no address to be distributed, sending no address message to the new node;
s3, if the new network access node receives the reply message, identifying to whom the reply message is sent according to the MAC address field of the application layer, selecting the neighbor node with the minimum depth as a father node when the timer is overtime, then sending the address request message, and broadcasting the information in the reply message;
if the new network access node only receives the message without the address when the timer is overtime, the first received message without the address is selected to send the unicast request borrowing address; if no packet is received, after the timeout, resetting the time again and continuing to wait;
s4, if the neighbor node receives the address request message, judging whether the message is the identified message according to the IP field in the address request message, confirming the configuration information, and attaching the configuration information sent in S2 to the address confirmation message again; and the configuration information is stored by itself;
if the neighbor node receives the borrowing address message, the neighbor node directly forwards the borrowing address message to the father node and the child node of the neighbor node; if the father node and the child node of the neighbor node have no addresses to be distributed, the father node and the child node of the neighbor node continue to forward the borrowing address message until the addresses in the address pool of a certain node can be distributed, the node with the addresses to be distributed returns a unicast to reply according to the source IP in the received borrowing address message, and each node receiving the reply message records the route; the new network access node sends an address borrowing request message after receiving the reply message, and the borrowed node sends an address borrowing confirmation message after receiving the reply message;
the reply message comprises the tree depth of the node, the IP address to be distributed, the address pool depth, the initial address of the address pool, the parameters Cm and Lm and the serial number of the address discovery message;
and S5, the new network entry node configures an address pool and an address according to the improved Cskip function.
When the new network access node allocates the address, the method also comprises the following address recovery process:
a1, when the father node and the child node have the neighbor relation, periodically checking the neighbor table, and if the father node or the child node exists, updating the duration; if no parent node or child node is found, performing step A3;
a2, if the parent node and the child node have no neighbor relation, the child node needs to periodically send a unicast updating message for confirming the parent-child relation, and the parent node replies the updating confirmation message; if no parent node or child node is found, performing step A3;
a3, finding no parent node or child node is divided into two cases: in the first case: if the child node can not find the father node, the child node firstly sends a topology change message to the child node of the child node, then the node marks the child node as a new node again, and executes the address allocation process of the new network access node (namely, steps S1-S5); the node receiving the topology change message marks itself as a new node again, and executes the address allocation process of the new network access node (i.e. steps S1-S5);
in the second case: if the parent node can not find the child node, the address and the address pool are recovered.
The invention has the beneficial effects that: each node can obtain an address pool while obtaining the address, and the node also has the ability of allocating the address, particularly, by improving the Cskip function, the address and address pool allocation is carried out according to the function, and simultaneously, on the basis of the allocation mechanism, an address borrowing mechanism is added to supplement and perfect the situation that the address cannot be normally allocated, so that a set of interaction flow is designed, including how a new node accesses the network and how the address and the address pool are maintained after the address is taken; the method of the invention has the following advantages:
1. on the problem that the new node acquires the address, the scheme selects a fixed-root distributed address allocation mode, so that the consumed network resources are less, and the consumed time is shorter because the new node acquires the address from the neighbor;
2. in order to avoid address conflict, all nodes are configured to be divided into address pools, the addresses are unique, address conflict detection is not needed, and network resources during conflict detection are reduced;
3. because of the characteristic of fixed nodes and the adoption of a distributed address allocation mode, a low-overhead mode is adopted. The method is similar to the address allocation mode of zigbee in characteristics, wherein a Cskip function is referred, and the function is an address allocation mode used in a zigbee network, but in the method, only a tree-shaped address allocation network is designed, routing is not required to be limited, some parameters are simplified, address allocation is performed according to the improved Cskip function after simplification, each node can have an address pool, and a distributed address allocation mode is met;
4. aiming at the problem of isolated nodes, an address borrowing mechanism is added on the basis of the network access interaction process of the original new nodes, so that each new network access node can acquire an address;
5. aiming at the possible occurrence of various emergencies of the nodes to cause downtime, a set of address recovery interaction flow is designed to prevent all node address pools from being occupied by the downtime nodes.
Drawings
Fig. 1 is a step of accessing a new node to obtain an address according to an embodiment of the present invention;
fig. 2 is a flowchart of a new node accessing to a network to obtain an address according to an embodiment of the present invention;
FIG. 3 is a block diagram illustrating a node address recovery mechanism according to an embodiment of the present invention;
fig. 4 is a flowchart of a node address recovery mechanism according to an embodiment of the present invention.
Detailed Description
As shown in fig. 1, the present invention provides a method for self-configuring an address of a fixed root node, and the following describes implementation steps of the present invention in detail with reference to the accompanying drawings.
First the formula derivation procedure for the improved Cskip function is given.
The original Cskip function is:
the number of addresses each node owns at different depths can be determined by this function. Wherein d represents the depth of the node, Cskip (d) represents the number of addresses owned by the parent node at different depths, Cm represents the maximum number of child nodes which can be owned by the parent node, Lm represents the maximum depth of the network, and Rm represents the maximum number of child routing nodes which can be owned by the parent node.
In the present invention, Rm is equal to Cm, that is, each child node can perform routing, the Cskip function can be modified as follows:
therefore, when a root node is selected, two parameters of Lm and Cm need to be given, and specifically, how to select Lm and Cm needs to be determined according to the network scale, generally, the total number of addresses is preferably 2 times of the number of nodes, so that the problem of isolated nodes is not easy to occur, and even if the problem of isolated nodes occurs, the extra load generated by using borrowed addresses is not large.
The following describes a process of allocating a new node address, including an address borrowing process, and the specific implementation includes the following steps:
a1, broadcasting an address discovery message in a one-hop range, wherein the source address is 0.0.0.0, the destination address is 255.255.255, the destination MAC is FF, FF and FF, and a sequence number is generated by the MAC to identify the address request process.
A2, when the neighbor receives the address discovery message, if the neighbor has the address to be allocated, replying the message, the message needed to be attached is: the IP and the tree depth of the current node, the IP address to be distributed, the address pool depth, the initial address of the address pool, the parameters Cm and Lm of the Cskip function and the serial number of the address discovery message. And if no address can be allocated, sending no address message to the new node.
A3, if a new network access node receives a neighbor node reply message, identifying to which the reply message is sent according to the MAC address field of an application layer, selecting the neighbor node with the minimum depth as a parent node when a timer is overtime, then sending an address request message, and broadcasting the message (IP, tree depth, IP address to be distributed, address pool depth, initial address of the address pool, and parameters Cm and Lm of a Cskip function) in the reply message;
if the new node only receives the message without the address when the timer is overtime, the first received message without the address is selected to send the unicast request borrowing address; if no packet is received, after the waiting time is out, the time is reset again to continue waiting.
A4, after receiving the address request message, the neighbor node judges whether it is the identified message according to the IP field in the address request message, confirms the configuration information, and attaches the messages in the address confirmation message again; and the allocation information is saved by itself.
If the neighbor node receives the borrowing address message, the neighbor node directly forwards the borrowing address message to the father node and the child node of the neighbor node; if the parent node and the child node do not have addresses to continue forwarding, and the address pool of one node always has addresses capable of being distributed, the node returns a unicast to reply according to the source IP of the received message, and the reply content is the same as A2; each node receiving the reply message records a route; the new network access node sends an address borrowing request message after receiving the reply message, and the borrowed node sends an address borrowing confirmation message after receiving the reply message.
A5, when the node has allocated the address, it also includes the address recovery process, the address recovery is divided into two cases:
1) when the parent node and the child node have a neighbor relation, periodically checking a neighbor table, and if the parent node or the child node exists, updating the duration; if no parent node or child node is found, executing 3);
2) the parent node and the child node have no neighbor relation, the child node needs to periodically send a unicast updating message for confirming the parent-child relation, and the parent node replies the updating confirmation message. When the parent node or the child node is not found, executing 3);
3) if the node can not find the father node, firstly sending a topology change message to the child node of the node, then marking the node as a new node again, and repeating the operation of obtaining the address by the new node; the node receiving the topology change message marks the node as a new node again, and repeats the operation of acquiring the address by the new node; if the parent node can not find the child node, the parent node considers that the child node moves or other situations occur, and the address pool are retracted.
It will be appreciated by those of ordinary skill in the art that the embodiments described herein are intended to assist the reader in understanding the principles of the invention and are to be construed as being without limitation to such specifically recited embodiments and examples. Various modifications and alterations to this invention will become apparent to those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the scope of the claims of the present invention.
Claims (7)
1. A self-configuration method for address of fixed root node is characterized in that a node is selected as a root node, and an address pool and an address are configured by adopting an improved Cskip function, wherein the expression of the improved Cskip function is as follows:
wherein d represents the depth of the node, Cskip (d) represents the number of addresses owned by the parent node at different depths, Cm represents the maximum number of child nodes which the parent node can have, and Lm represents the maximum depth of the network.
2. The address self-configuration method of a fixed root node as claimed in claim 1, wherein all nodes use address pool, source address is 0.0.0.0, destination address is 255.255.255, destination MAC is FF: FF: FF: FF: FF: FF.
3. The address self-configuration method of a fixed root node according to claim 2, characterized in that a new network node broadcasts an address discovery message in a one-hop range, and configures an address pool and an address by adopting an improved Cskip function according to a reply message returned by a neighbor node with an assignable address; the reply message includes at least: the tree depth in which the neighbor itself is located, the IP address to be assigned, the pool depth, the starting address of the pool, the parameters Cm and Lm.
4. The address self-configuration method of a fixed root node as claimed in claim 3, wherein the new network entry node selects the neighbor node with the smallest depth as the parent node from all the neighbor nodes returning the reply message when the timer expires.
5. The address self-configuration method of a fixed root node according to claim 3, wherein if the neighbor node has no address to allocate, then returning no address message, and if the new network entry node only receives no address message when the timer is over, then selecting the first received no address message to send the unicast request borrowing address.
6. The address self-configuration method of a fixed root node as claimed in claim 5, wherein if the neighboring node receives the borrowing address message, it directly forwards the borrowing address message to the parent node and the child node of the neighboring node; if the parent node and the child node of the neighbor node have no addresses to allocate, the parent node and the child node of the neighbor node continue to forward the borrowing address message until addresses in an address pool of a certain node can be allocated.
7. The address self-configuration method of a fixed root node as claimed in claim 4 or 6, further comprising an address recovery procedure when the new network-accessing node allocates an address:
a1, when the father node and the child node have the neighbor relation, periodically checking the neighbor table, and if the father node or the child node exists, updating the duration; if no parent node or child node is found, performing step A3;
a2, if the parent node and the child node have no neighbor relation, the child node needs to periodically send a unicast updating message for confirming the parent-child relation, and the parent node replies the updating confirmation message; if no parent node or child node is found, performing step A3;
a3, finding no parent node or child node is divided into two cases: in the first case: if the child node can not find the father node, the child node firstly sends a topology change message to the child node of the child node, and then the node marks the child node as a new node; the node receiving the topology change message marks the node into a new node again;
the new node broadcasts an address discovery message in a one-hop range, and configures an address pool and an address by adopting an improved Cskip function according to a reply message returned by a node with an assignable address; the reply message includes at least: the tree depth of the node with the address and the allocable node, the IP address to be allocated, the address pool depth, the initial address of the address pool, and the parameters Cm and Lm;
in the second case: if the parent node can not find the child node, the address and the address pool are recovered.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011277615.0A CN112492057B (en) | 2020-11-16 | 2020-11-16 | Address self-configuration method of fixed root node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011277615.0A CN112492057B (en) | 2020-11-16 | 2020-11-16 | Address self-configuration method of fixed root node |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112492057A true CN112492057A (en) | 2021-03-12 |
| CN112492057B CN112492057B (en) | 2022-06-24 |
Family
ID=74930586
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011277615.0A Active CN112492057B (en) | 2020-11-16 | 2020-11-16 | Address self-configuration method of fixed root node |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112492057B (en) |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1723660A (en) * | 2003-02-21 | 2006-01-18 | 株式会社东芝 | Address autoconfiguration in ad hoc networks |
| CN101330529A (en) * | 2008-07-29 | 2008-12-24 | 杭州电子科技大学 | Method for distributing address of self-pruning type tree-shaped structure network |
| US20090268633A1 (en) * | 2008-04-23 | 2009-10-29 | Institute For Information Industry | Network address assigning and allocating method and routing method for long-thin wireless network |
| CN102014377A (en) * | 2011-01-06 | 2011-04-13 | 常熟理工学院 | Distributed wireless sensor network-based IPv6 address configuration implementing method |
| CN102143546A (en) * | 2011-04-02 | 2011-08-03 | 华南理工大学 | Method for reducing redundant routing packet in tree ZigBee network |
| CN102970392A (en) * | 2012-12-18 | 2013-03-13 | 重庆邮电大学 | Efficient and rapid address assignment method for LR-WPAN (low rate-wireless personal area network) Mesh network nodes |
| CN103167042A (en) * | 2013-04-07 | 2013-06-19 | 常熟理工学院 | Medical real-time monitoring system based on all IP (internet protocol) wireless sensor network |
| US20130198340A1 (en) * | 2011-12-21 | 2013-08-01 | Sensinode Oy | Method, apparatus and system for addressing resources |
| CN103297342A (en) * | 2013-03-01 | 2013-09-11 | 大连海洋大学 | Energy-saving ZigBee network tree topology formation method |
| CN103781144A (en) * | 2014-02-28 | 2014-05-07 | 东南大学 | Zigbee network tree-shaped routing method for neighbor table mode interaction |
| CN104641694A (en) * | 2012-09-07 | 2015-05-20 | 高通股份有限公司 | Systems, apparatus, and methods for association in multi-hop networks |
| CN107332777A (en) * | 2017-06-22 | 2017-11-07 | 北京中宸泓昌科技有限公司 | A kind of low-voltage power line bandwidth carrier constructing communication network method based on tree |
| CN107404745A (en) * | 2017-06-13 | 2017-11-28 | 广东广业开元科技有限公司 | A kind of fire detector remote detecting system based on MANET |
-
2020
- 2020-11-16 CN CN202011277615.0A patent/CN112492057B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1723660A (en) * | 2003-02-21 | 2006-01-18 | 株式会社东芝 | Address autoconfiguration in ad hoc networks |
| US20090268633A1 (en) * | 2008-04-23 | 2009-10-29 | Institute For Information Industry | Network address assigning and allocating method and routing method for long-thin wireless network |
| CN101330529A (en) * | 2008-07-29 | 2008-12-24 | 杭州电子科技大学 | Method for distributing address of self-pruning type tree-shaped structure network |
| CN102014377A (en) * | 2011-01-06 | 2011-04-13 | 常熟理工学院 | Distributed wireless sensor network-based IPv6 address configuration implementing method |
| CN102143546A (en) * | 2011-04-02 | 2011-08-03 | 华南理工大学 | Method for reducing redundant routing packet in tree ZigBee network |
| US20130198340A1 (en) * | 2011-12-21 | 2013-08-01 | Sensinode Oy | Method, apparatus and system for addressing resources |
| CN104641694A (en) * | 2012-09-07 | 2015-05-20 | 高通股份有限公司 | Systems, apparatus, and methods for association in multi-hop networks |
| CN102970392A (en) * | 2012-12-18 | 2013-03-13 | 重庆邮电大学 | Efficient and rapid address assignment method for LR-WPAN (low rate-wireless personal area network) Mesh network nodes |
| CN103297342A (en) * | 2013-03-01 | 2013-09-11 | 大连海洋大学 | Energy-saving ZigBee network tree topology formation method |
| CN103167042A (en) * | 2013-04-07 | 2013-06-19 | 常熟理工学院 | Medical real-time monitoring system based on all IP (internet protocol) wireless sensor network |
| CN103781144A (en) * | 2014-02-28 | 2014-05-07 | 东南大学 | Zigbee network tree-shaped routing method for neighbor table mode interaction |
| CN107404745A (en) * | 2017-06-13 | 2017-11-28 | 广东广业开元科技有限公司 | A kind of fire detector remote detecting system based on MANET |
| CN107332777A (en) * | 2017-06-22 | 2017-11-07 | 北京中宸泓昌科技有限公司 | A kind of low-voltage power line bandwidth carrier constructing communication network method based on tree |
Non-Patent Citations (2)
| Title |
|---|
| 姚玉坤等: "ZigBee网络中基于借地址的高效分布式地址分配算法", 《重庆大学学报》 * |
| 邱秀荣: "无线移动通信网络的IP地址自动分配方法", 《科技通报》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112492057B (en) | 2022-06-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101600156B (en) | Auto-allocation method of addresses of mobile ad hoc networks | |
| US7990891B2 (en) | Method for organizing a network of communicating objects and communicating object for the implementation of the method | |
| KR100825735B1 (en) | Method for Address Space Management about nodes incapable of communication over ZigBee Network | |
| US8797916B2 (en) | Network address allocation method | |
| Li et al. | A novel and efficient address configuration for MANET | |
| Fang et al. | A preemptive distributed address assignment mechanism for wireless sensor networks | |
| Kim et al. | AROD: An address autoconfiguration with address reservation and optimistic duplicated address detection for mobile ad hoc networks | |
| Singh et al. | Address allocation for MANET merge and partition using cluster based routing | |
| CN112492057B (en) | Address self-configuration method of fixed root node | |
| Wang et al. | A tree-based address configuration for a MANET | |
| Ye et al. | A survey of addressing algorithms for wireless sensor networks | |
| Taghiloo et al. | New approach for address auto-configuration in manet based on virtual address space mapping (vasm) | |
| Munjal et al. | Scalable hierarchical distributive auto-configuration protocol for manets | |
| CN109922442B (en) | Address resolution method for heterogeneous network of wireless multi-hop network and full-connection network | |
| Wang et al. | A distributed address configuration scheme for a MANET | |
| Zimmermann et al. | IP address assignment in wireless mesh networks | |
| US20150350022A1 (en) | A Method of Network Subscription in a Wireless Network | |
| Wang et al. | Research on IPv6 address configuration for wireless sensor networks | |
| Li et al. | LaConf: A localized address autoconfiguration scheme for wireless ad hoc networks | |
| Li et al. | Cluster-based autoconfiguration for mobile ad hoc networks | |
| CN107749900B (en) | Efficient Internet of things implementation method | |
| Yousef et al. | Lha: logical hierarchical addressing protocol for mobile ad-hoc networks | |
| KR101690787B1 (en) | Apparatus and method on assignment of short address for nodes in wireless networks, and method for processing received frame | |
| Bouk et al. | IPv6 autoconfiguration for hierarchical MANETs with efficient leader election algorithm | |
| Teng | Sequence Configuration With Self-Organized Function Structure for Networking of Smart Sensors |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |