A Tree Network Address Method Based on Address Space

An address space, tree network technology, applied in the field of network communication, can solve the problems of incomplete preservation of "location-address" relationship, waste, optimization of network topology structure, etc.

Active Publication Date: 2021-01-05
SUZHOU UNIV
View PDF6 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0011] The implementation method of DAAM is relatively simple, and it has been widely researched and applied at present. However, the DAAM address allocation mechanism is not optimized for the topology of the network when assigning addresses to nodes, and the mechanism is difficult to implement in practice due to parameter setting problems. Part of the idle addresses cannot be used to form a waste, and lead to the generation of a large number of orphan nodes
[0012] In order to solve the problem of unbalanced address space utilization and improve the traditional address allocation algorithm, some people have proposed the algorithm of borrowing addresses. This type of algorithm applies to the coordinator for free addresses when the address space is insufficient, or the parent with insufficient address space Nodes send out applications and allocate free address space according to the priority of the remaining nodes, or send broadcasts to borrow addresses from routers with free addresses around them
These algorithms can improve the network access rate of nodes, but they cannot completely retain the original "location-address" relationship, and increase the redundant path of the tree network, so additional overhead will be added in the tree routing algorithm, and the node The corresponding address information needs to be stored
[0013] SLAR (single level address reorganization) algorithm scheme, the type of parent node of the routing node reduces the address offset Cskip(d) by increasing the depth d to increase the address space that can be allocated. Significantly increase the address space, but the networking delay and overhead have increased accordingly, and it is only suitable for deep networks

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Tree Network Address Method Based on Address Space
  • A Tree Network Address Method Based on Address Space
  • A Tree Network Address Method Based on Address Space

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0051] Suppose the coordinator node decides that the available address range is [0, 10000] and decides k=2, R max =3,E max After =2 three parameters, inquire whether the nodes that have not joined the network within one hop join the network, and ask these nodes to count and reply the number of nodes that have not joined the network within 2 hops of the node respectively. Assume that the set of nodes that have not joined the network within one hop of the coordinator node is {u 1 , u 2 ,...,u 7}, and u 1 [2]=9, u 2 [2]=6, u 3 [2]=5, u 4 [2]=4, u 5 [2]=4, u 6 [2]=3, u 7 [2]=2. Then the coordinator node allocates address space [9999, 9999] to node u according to the above method 6 , allocate address space [10000, 10000] to node u 7 . Then calculate c 1 =4500, c 2 =2999,c 3 = 2499, and assign address space [1, 4500] to node u 1 , allocate address space [4501, 7499] to node u 2 , allocate address space [7450, 9998] to node u 3 . Simultaneously k, R max , E max ...

Embodiment 2

[0053] Suppose the coordinator node decides that the available address range is [0, 10000] and decides k=2, R max =6,E max After =2 three parameters, inquire whether the nodes that have not joined the network within one hop join the network, and ask these nodes to count and reply the number of nodes that have not joined the network within 2 hops of the node respectively. Assume that the set of nodes that have not joined the network within one hop of the coordinator node is {u 1 , u 2 ,...,u 5}, and u 1 [2]=9, u 2 [2]=6, u 3 [2]=5, u 4 [2]=4, u 5 [2]=4. Then calculate c 1 =3217,c 2 =2142,c 3 =1785,c 4 =1428,c 5 = 1428, and assign address space [1, 3217] to node u 1 , assign address space [3218, 5359] to node u 2 , assign address space [5360, 7144] to node u 3 , allocate address space [7145, 8572] to node u 4 , allocate address space [8573, 10000] to node u 5 . Simultaneously k, R max ,E max Three parameters are sent to u 1 , u 2 ,...,u 5 , and set its ow...

Embodiment 3

[0055] Suppose the coordinator node decides that the available address range is [0, 10000] and decides k=2, R max =6,E maxAfter =2 three parameters, inquire whether the nodes that have not joined the network within one hop join the network, and ask these nodes to count and reply the number of nodes that have not joined the network within 2 hops of the node respectively. Assume that the set of nodes that have not joined the network within one hop of the coordinator node is {u 1 , u 2 ,...,u 7}, and u 1 [2]=9, u 2 [2]=6, u 3 [2]=5, u 4 [2]=4, u 5 [2]=4, u 6 [2]=3, u 7 [2]=2. Then the coordinator node allocates the address space [10000, 10000] to node u according to the above method 7 . Then calculate c 1 =2905,c 2 =1935,c 3 =1612,c 4 =1290,c 5 =1290, c 6 =967, and assign address space [1, 2905] to node u 1 , assign address space [2906, 4840] to node u 2 , allocate address space [4841, 6452] to node u 3 , assign address space [6453, 7742] to node u 4 , alloc...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses an address space-based tree-type network address allocation method, which includes: when the usable address space range allocated to a certain node is greater than or equal to 1, inquiring whether a node within one hop that has not joined the network joins the node Tree network, and notify these nodes to count and reply the number of nodes that have not joined the network within its k hops; Use the address space range, the maximum number of routing child nodes, and the sum of the maximum number of routing child nodes and the maximum number of terminal leaf nodes to compare in order to perform corresponding address space allocation. The invention improves the efficiency of address allocation among nodes, optimizes the network topology, eliminates isolated nodes in the network, and improves the success rate of new nodes entering the network. At the same time, the routing can be performed more quickly, and the time and storage space required for the establishment and maintenance of the routing table are reduced.

Description

technical field [0001] The invention relates to an address space-based tree-type network address allocation method, which belongs to the technical field of network communication. Background technique [0002] Today's world communication technology is advancing by leaps and bounds. With the rapid development of the Internet and the rapid growth of personal data communication needs, wireless, broadband and IP have become the three major trends in the technological development of the global communication industry. The market's demand for broadband networks stems from the continuous development of Internet services, so the number of broadband users has shown a very strong growth in the global development. The biggest bright spot in the communication technology market these years is the mobile communication technology in the wireless technology. Among so many broadband technologies, the mobile communication technology will be an important part of the future communication technolo...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): H04L12/753H04L12/741H04L12/733H04L45/122H04L45/74
CPCH04L45/20H04L45/48H04L45/74
Inventor 林政宽刘宁宁刘文军王岩
Owner SUZHOU UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap