JP4219366B2 - Method and system for constructing multipoint link interactive environment - Google Patents

Description

  The present invention relates to a wireless network system, and more particularly, to a method and system for building a multipoint link interactive environment in a point-to-point manner under a wireless network environment.

  Currently popular Internet virtual environments (eg, online games) are mainly built under a processing system of a client / server mechanism. The entire application system of the client / server system structure is divided into two main parts: an application program at the front end (that is, a client) and a server at the rear end, and the two are connected by the Internet or an intranet. Yes.

  FIG. 1 is a diagram showing a known client-server structure. This structure includes a server 110 and an application program (client) 130, and both are connected via the Internet or an intranet transmission medium (not shown). The user communicates with the application program 130 at the front end and the server 110 to provide the user with input or output operations such as search, correction, and printing. The rear-end server 110 is responsible for executing the command transmitted by the front-end application program 130 and transmits the processed result to the front-end application program 130 and displays the result for reference by the user.

  The processing of the client-server structure is extremely efficient, and the application program 130 at the front end presents a fine screen to the user by appropriate sharing processing, and the server at the rear end provides access to data, system management, and Dedicated to performing processing with higher efficiency, such as safety protection, to provide a flexible and highly efficient application environment.

  However, an access point must be used to construct the above-described connection Internet using a wireless link method. However, with the Internet constructed in such a manner, many clients access at the same time and use it as a server access point, which degrades the Internet quality. In addition, the transmission range of the wireless access point is limited, and clients outside the transmission range cannot participate in the wireless network.

  Therefore, the present invention provides a method for constructing a wireless network with a point-to-point connection method, and an object thereof is to overcome the above-described problems.

  In view of the foregoing, the present invention provides a method for constructing a multipoint link interactive environment in a wireless network environment, and constructs a hierarchical cluster network by a point-to-point link scheme. First, a first node is provided, and after waiting for an arbitrary time, the first node transmits information in a multicasting manner and detects a second node having a second logical address. The first node transmits participation information to the second node, and when the second node receives the participation information, returns confirmation information to the first node. The first node selects the first logical address based on the confirmation information, transmits the participation confirmation information to the second node, confirms that the first logical address has been acquired, and the hierarchical cluster network. Form.

  A method is provided for building a wireless network in a point-to-point connection scheme that ameliorates the shortcomings of the prior art.

  The present invention provides a method and system for constructing a multipoint link interactive environment under a wireless network environment, and constructs a hierarchical cluster structure using the multicasting characteristics of radio waves in the wireless network. In addition, the embodiment of the present invention has four parts such as node addressing, inter-node routing, node mobility, and group communication, which will be described in detail below.

  First, the addressing process of the node (mobile device) according to the embodiment of the present invention will be described. FIG. 2 is a diagram illustrating a structure of an ad hoc wireless network according to an embodiment of the present invention. Each node represents a mobile device, and each node has a transmission radius and utilizes the radio wave multicasting characteristics to generate a hierarchical tree structure as shown in FIG. In this Internet structure, each node has a unique logical address (Logical IP), each node can communicate information with this logical address and other nodes, and the logical address of the root node is 1.3. The child node logical address is 1.0. In the embodiment of the present invention, the data format of the logical address can be displayed in an arbitrary format, and the relationship between each node, its parent node, and child node only needs to be clearly shown. In addition, according to the embodiment of the present invention, the tree structure constructed by the Internet guarantees the existence of routing, and the problems of information routing and node movement can be solved by the characteristics of the tree structure. When a node joins or creates a tree structure, a unique logical address must be obtained and its addressing process is described below.

  FIG. 3 is a flowchart of an addressing process when a mobile device joins or generates a wireless network tree structure according to an embodiment of the present invention. First, when a node starts up (i.e., the mobile device is on) (step 11), it waits for a random time (step 12), and then sends information by multicasting to nodes with other logical addresses ( That is, it is detected whether or not the neighbor node is within the transmission range (step 13). If there is, step 14 is executed, and if not, step 15 is executed. If there is no neighbor node with a logical address in the transmission range, the node builds a tree structure itself, becomes the root node of the tree structure, defines a logical address (eg, 1.0), and The own media access control (MAC) address (that is, the MAC address of the mobile device) is used as the tree identification code (step 14). After the process 14 is completed, the process returns to the process 11, and another node (mobile device) overlaps the above process. If a neighbor node with a logical IP is within its transmission range, it indicates that a tree-structured wireless network already exists, then sends information via multicasting, and in all neighbor nodes, the root node It is detected whether it exists (step 15). If yes, execute step 16; otherwise, go to step 14.

  If there is a root node among all the neighbor nodes, the node transmits participation information to all the neighbor nodes (step 16), and when each neighbor node receives the participation information of this node, The node confirmation information is returned to notify the node's own logical address (step 17), and the neighbor node's own logical address is included in the confirmation information. If a reply from a neighbor node has not been received after a certain time, this node transmits participation information to all the neighbor nodes again. Subsequently, when receiving the confirmation information returned by each neighbor node, the node calculates a usable logical address based on the logical address included in all the confirmation information, and the shortest logical address. Is selected (step 18). For example, if the returned confirmation information includes two logical addresses 1.2.1 and 1.3, the usable logical addresses are 1.2.1.1 and 1.3.1. In order to further reduce the altitude of the tree, the node selects logical address 1.3.1.

  Subsequently, participation confirmation information is transmitted to the parent node (that is, the node whose logical address is 1.3) based on all the selected logical addresses (step 19), and the selected logical address is set to the logical address. At the same time, the communication with the parent node and the update operation are executed periodically (step 20).

  When a node chooses a parent node, if there are many possibilities of being a parent node, the parent node's signal strength takes into account the length of the parent node address, assuming that it exceeds a certain threshold value. When a node having a short address length is selected as a parent node, the hierarchy of the entire tree structure can be reduced, and the route is shortened. The assumption that the signal strength of the parent node must exceed a certain threshold value is that the signal between one node and the parent node is too weak, the node moves with a small width and loses the connection with the parent node. This is to avoid having to select a new parent node.

  Use of the addressing method described above can cause address collisions. For example, the distance between two nodes (mobile devices) is not within the signal transmission range of the other party, and these two nodes both acquire a logical address of 1.0 at startup, and then the other nodes Since participating, when a tree network where two nodes are located together, a situation occurs in which logical addresses overlap. Many strategies can be used to solve this problem. The simplest method is to start a merge process at the time of an address collision, and mainly use a tree network with a large number of nodes. A tree network with a small number of nodes is a new logical Merge these two tree networks into one according to the address.

  Next, the data route process between nodes according to the embodiment of the present invention will be described. The route package in the embodiment of the present invention knows that the next forwarding node has reached the target node by the route table maintained by each node itself. Each node includes a child table (not shown) and a neighbor table (not shown). The child table is in charge of recording the logical addresses and states of all the current child nodes, and confirms the current state of the child node by an operation of periodically contacting the child node. The neighbor table is responsible for recording the logical addresses and states of neighboring neighbor nodes, and due to the multicasting characteristics of the ad hoc wireless network environment, each node can store its neighbor node data as it transmits data. Can be collected. For example, information that the parent node and child node regularly contact can inform each node what nodes are nearby.

  Neighbor table helps to reduce route distance when data route. Due to the tree network constructed by the above method, when selecting a route, if there is no preferred control mechanism, a long route is selected and a delay occurs. Therefore, the embodiment of the present invention solves the above problem by the following three route shortening methods.

  In the first method, when a node receives a package, it performs a longest prefix match operation with the target node logical address stored in the package and the logical address recorded in its own route table. Find the node with the longest logical address length and then send this package to this node.

  For example, referring to FIG. 4, the node (source node) whose logical address is “1.1.1.1” transmits the package to the node (target node) whose logical address is “1.1.2.1”. The longest prefix match is made between the logical address of the target node and its own table. Based on the results of the comparison, the longest prefixes of node “1.1.1” and node “1.1.1.2” were both found to be 3, so the source node is arbitrarily Let one node be a “Forwarding” node. In this embodiment, the source node uses the node “1.1.1” as a forwarding node. When the package is transferred to the node “1.1.1”, the node “1.1.1” performs the longest prefix match once, and based on the comparison result, the node “1.1.2”. It is found that the longest prefix of "3" and the longest prefix of node "1.1" is 2, so that node "1.1.1" makes node "1.1.2" its forwarding node And By this method, the package is transferred to the target node.

  Another method makes the route more effective by making use of the characteristics of multicasting at the time of wireless package transfer in addition to the longest prefix match presented in the above method. In an ad hoc network environment, the node forwarding package method is a multicasting method, so when a node forwards a package to a node that is recorded in the table of its neighbor nodes, the neighbor node will voluntarily connect to this node. Announce this information. The node “1.1.1.1” wants to transmit the package to the node “1.1.2.1”. The node “1.1.1.2” is a neighbor node of the node “1.1.1.1”, and the node “1.1.2.1” is the node “1.1.1.2”. Accordingly, the correlation information of the node “1.1.2.1” is recorded in the node table of the node “1.1.1.2”, and thus the node “1.1.1”. .1 "wants to transmit the package to" 1.1.2.1 ", node" 1.1.1.2 "voluntarily announces to node" 1.1.1.1 ". , Node “1.1.2.1” is its neighbor node (indicated by an arrow in the direction from node “1.1.1.2” to node “1.1.1.1”). ).

  By way of example, referring to FIG. 5, node “1.1.1.1” has a node “1.1.2.1” along a route selected by a first kind of package. When the neighbor node “1.1.1.2” receives the package to be transmitted (multicasting characteristics) and discovers that the destination node that this package wants to reach is next to it, Thus, the node “1.1.1.1” announces that the node “1.1.2.1” can be reached via the node “1.1.1.2”. “1.1.1.1” can choose to transfer the package to node “1.1.2.1” via node “1.1.1.2”.

  The third type utilizes the routing cache mechanism and can be selected to have a smaller number of hops during the course of package transfer. When a package elapses from a certain node root, if the basic hierarchical root is not passed, this node records the destination node of the package and its selective forwarding node in the routing cache. After that, when another package passes through this node and reaches the target node of homology or the branch node (child node) of the target node, it searches the routing cache for information on the node to transfer, Transmit from the forwarding node to the destination node.

  For example, referring to FIG. 6, node “1.1.1.1.1” wants to transfer the package to node “1.2.1.1.1” (indicated by a solid arrow). When the package is transferred to the node “1.1.1.1”, the previous node “1.1.1.1” transmits the package to the node “1.1.2.1” (dotted line) And begins to cache data. In addition, the node “1.1.1.1” discovers that the address of the target node is “1.1.2.1.1”, and this address is the node “1.1.2.1”. "(The target node in the above method) is a child node, and it has been discovered that the hop count data is less than the hierarchical root, so node" 1.1.1.1 "is node" 1. It is selected that the package is transferred in the route of “1.1.1” → node “1.1.1.2” → node “1.1.2.1”.

  Next, a process of moving a node in the tree network according to an embodiment of the present invention will be described. In an ad hoc wireless network environment, the most important consideration is the mobility characteristics of the node. In an embodiment of the present invention, when a node moves, the problem of rear dressing must be considered and its purpose is achieved using periodic soft states, ie each child node is periodically The update operation must be performed with the parent node.

  For example, referring to FIG. 7A, considering one node P, the node A is originally requested to participate (indicated by (3)), and the node A is a parent node. When node P moves from within the transmission range of parent node A to within the transmission range of node B (node P may not move and node A may move), node B further When a preferred logical address is given (indicated by (4)), node P performs an address release operation to original parent node A (indicated by (5)), and a new parent node B and periodic update operation I do. However, node P moves to a position where it can only contact node B (as shown in FIG. 7B), and the original parent node A finds that the logical address of node P has not been updated for a long time. Then, the parent node A must voluntarily execute an operation of releasing the logical address of the original node P.

  Subsequently, a process of performing movement of a node in a tree network according to an embodiment of the present invention will be described. Referring to FIG. 8, as described above, when the node P is originally in the transmission range of the parent node A and wants to replace the parent node A or leaves the transmission range, the parent node (for example, The node B) transmits participation information (step 21), and determines whether or not the confirmation information returned by the node B has been received (step 22). If node B confirmation information has not been received, node P indicates that it is not yet within the transmission range of node B, and therefore performs the addressing process described above to obtain a new logical address (step 23). ). If node B confirmation information is received, it is checked whether the logical address length of the new parent node B is shorter than the logical address length of the original parent node A (step 24).

  When the length of the logical address of the parent node A is short, the process returns to step 21 and the node P newly transmits participation information to other nodes to search for a new parent node. If the logical address of the parent node B is short, the node P transmits information on the requested logical address to the parent node B (step 25) so that it becomes a child node of the parent node B. Subsequently, the parent node determines whether confirmation information has been returned (step 26). When the parent node B receives the information of the request logical address transmitted from the node P, it returns confirmation information to the node P. Thus, if node P has not received the confirmation information transmitted by parent node B, it indicates that node P or node B has moved, and node P leaves the transmission range of node B, thus Return to 21. Node P newly transmits participation information to other nodes to search for a new parent node. Subsequently, when the node P receives the confirmation information transmitted from the parent node B, the participation confirmation information is transmitted to the parent node B based on the usable logical address included in the confirmation information (step 27). Subsequently, the node P performs an address release operation to the original parent node A (step 28), and thereafter notifies all child nodes below the change of the logical address of the parent node and periodically Therefore, the registration update operation with the parent node A is executed (step 29), the process returns to step 21, and the operations of steps 21 to 29 are repeated.

  When the logical address of a node changes, all child nodes are voluntarily notified. At this time, the child node directly quotes the logical address newly acquired by the parent node and prefixes its own address ( Prefix). For example, the parent node logical address is originally “1.2.5” and is currently changed to “1.2”, and the child node logical address is the original address “1.2.5”. .X ”is directly converted to address“ 1.2.X ”, or a new node is searched for as the parent node. In addition, it is necessary to consider a situation where the root node or a child node close to the root node moves or leaves the tree structure. For example, referring to FIG. 6, taking the node “1.0” as an example, when considering the movement situation, at this time, some child nodes of the node “1.0” cannot be contacted, and these child nodes Asks if the node “1.0” exists using the neighbor node. If it exists, a new logical address is newly searched for by the above-described rear dressing process. If not, node “1.0” probably leaves the tree structure, so node “1.0” needs to be regenerated. However, to avoid generating many nodes “1.0” at the same time, this problem is solved by the following method. Among all the child nodes of the node “1.0” to be detached, one new node “1.0” is selected according to the priority level. The priority with which X becomes node “1.0” is greater than child node “1.X + 1”. For example, the priority of node “1.1” is greater than node “1.2”, the priority of node “1.2” is greater than node “1.3”, and a new node “1.0” is assigned. The same is true until the search.

  Subsequently, a process of group communication between nodes according to an embodiment of the present invention will be described, and it includes three parts: a node participation group (Join), a node leave group (Leave), and a data transfer (Forward).

  First, the execution process of the node participation group will be described. When a node wants to join a multicast group (the multicast group definition method is not within the scope of the present invention, it is omitted), a hash table is used to map the group address to join onto a certain logical address. Subsequently, while registering with the node having this logical address, other already registered logical addresses are acquired, and the data registration is maintained by the node. If the node does not exist, the parent node of this node is responsible for maintaining the data registration. For example, when the node P wants to join the multicast group A, the logical address included in the multicast group A is executed using the hash table, and the logical address obtained based on the map result is “1.3. 5 ". Thereby, the node P registers with the node “1.3.5”, but if the node “1.3.5” does not exist (has moved to another place or left the tree network), the node “1. 1.3 ”is responsible for maintaining data registration. If “1.3” does not exist, the node “1.0” is responsible for maintaining data registration.

  On the other hand, if a node responsible for maintaining data registration appears, the data must be transferred to this node. For example, in the above-described embodiment, the original node “1.3” replaces the node “1.3.5”, and the group A member data is maintained. Thereafter, one node joins this network, acquires the logical address “1.3.5”, and the node “1.3” needs to notify the node “1.3.5” of the data transfer. . In addition, a node that maintains a certain data registration leaves the tree network, the node leaves due to a human element (such as a mobile device shutdown) or a non-human element (such as a mobile device shutdown). You must consider the case. At this time, originally, the node responsible for maintaining the group data must notify the parent node that the parent node substitutes for data maintenance. To avoid the occurrence of the above situation, after node registration, periodically send confirmation information to the first registered node, and if the confirmation information is not returned, the node responsible for maintenance is invalid At this time, it is necessary to register again with the parent node in charge of the original node. Since this system is designed for a small group, the amount of data when the transition is required is not too large, and there is no worry of wasting a lot of bandwidth and time on the data transition.

  Subsequently, the execution process of the node detachment group will be described. When a node wants to leave a multicast group, it performs an operation of canceling the registration to the original registered node, and the execution process is similar to the process of the participation group described above. For example, since a member node M in a certain group A wants to leave this group, if the A map reaches a certain logical address using a hash table, and if it is “1.3.5”, the node M , Cancel the registration to the node “1.3.5”. Similarly, considering the situation where the node “1.3.5” does not exist, the information is always maintained from the parent node of the node “1.3.5”, and the node M has a tree structure. It must be derived in the direction of the route point, and always find the node of the data to maintain.

Next, the data transfer execution process will be described. After one node joins the multicast group, it performs data transmission and reception operations. Each node in the ad hoc Internet, besides having to process its own package, acts as a root node to help other nodes transfer packages. Therefore, to achieve effective package routing, minimizing the amount of packages in a situation where all members can receive data is a very important issue. In order to reduce the package amount, the object is achieved by the multicasting characteristics of data transmission in a wireless network based on a tree network according to an embodiment of the present invention. In addition, it is necessary to join some extra areas in the package.
(1) Up flag: If the up flag value is set to 1, it indicates that the parent node of the intermediate node transferring one package should process this package.
(2) Child node map: each bit indicates one child node of an intermediate node, and if a bit is set to 1, it indicates that the child node represented by this bit must transfer this package .
(3) Sequence number: In a multicasting environment, the same package may be forwarded by several different nodes and then received by the same node. You must determine if it was received.
(4) Intermediate node: Used to record a logical address for transferring this package.
(5) Member list: Record the addresses of members in the multicast group, hold the first bit in the address, and determine how to transfer the package.

  Based on the above-mentioned area, the calculation method is executed using the multicasting characteristics of the radio wave. When a member node sends out a package, member nodes within the transmission range can receive this package. In other words, these member nodes need only send the package once. Therefore, if it is determined which member is in the radio wave range and these nodes are excluded, the other nodes are transferred by the above-described hierarchical tree structure, and the package amount necessary for multicast can be saved. In the following, the rules necessary during the calculation method are explained.

First, there is a situation where a node that transfers a package is a transmitter.
Rule 1, if the member node is in the forwarding node's cache, set the first bit of the member node's logical address (the extra reserved) to 1.
Based on rule 2 and rule 1, if there is a child node belonging to the forwarding node other than the member node that sets the first bit to 1, the first bit of the child node address is set to 1 and the forwarding node In the child node image, the bit of the node representing this branch node is set to 1 in accordance with the branch node to which.
Rule 3, if there is still a member node whose first bit is not set to 1, set the up flag area to 1, and then record the forwarding node address in the intermediate node area Thereafter, the address of the forwarding node is recorded in the intermediate node area, and the package is sent out.

Subsequently, the situation is when the node of the transfer package is not the transmitter.
Rule 4, when the received package is transferred from the parent node (determined from the relay node area) and the bit of the node representing this branch node is set to 1 in the child node image by the branch node to which the transfer node belongs , A branch node having a child node belonging to the forwarding node and a member node not in the forwarding node cache among the member nodes having the first bit of 1 is calculated, and the node representing the branching node in the child node image is calculated. Set the bit to 1. Thereafter, the forwarding node address is recorded in the intermediate node area, and the package is sent out.
Rule 5, if the received package is transferred from the child node and the up flag is set to 1, calculate the member node whose first bit in the member list is not 1. The first bit located at the node in the cache is set to 1 and the node belonging to the child node of the forwarding node is not a node located in the cache, but the first bit is set to 1 and the child node image The bit of the node representing this branching node is set to 1. If any of the member nodes still have the first bit not set to 1, set the up flag to 1, otherwise set it to 0 and set the forwarding node address in the intermediate node area. Record and then send out the package.

  Based on the above rules, the multicast execution process will be described below by way of an example.

  Referring to FIG. 9 and FIG. 10, when the node “1.2” is a transmitter, the air-core node is a multicast member. Based on Rule 1, node “1.2” calculates which member node is in the cache. When the node “1.3.1” is in the cache of the node “1.2”, the first bit of the node “1.3.1” in the member list is set to 1 at this time. Subsequently, based on rule 2, the child nodes belonging to the node “1.2” in the member list, that is, the first of the nodes “1.2.1” and “1.2.1.1” Bit is set to 1. At this time, the node “1.2.1.1” is not in the cache of the node “1.2”, but is a child node, so a child node image is set. That is, if the node “1.2.1.1” is under the branch node of the node “1.2.1” and the node “1.2.1” is the first child node of the node “1.2” In the child node image, the first bit (node “1.2.1”) is set to 1. At this time, if there is a member list in which the first bit of the node “1.3.1.2” and the node “1.3.2” is not set to 1, according to rule 3, The up flag area is set to 1, and the logical address of the node “1.2” is recorded in the intermediate node area, and then the package is transmitted by the multicasting method.

  Next, referring to FIG. 9 and FIG. 11, after the package is sent out, the nodes of the received package indicate nodes “1.0”, “1.2.1”, and “1.3.1”. If so, based on rule 4, node "1.2.1" matches the defined rule. At this time, among the nodes whose first bit described in the member list is 1, the node “1.2.1” is cached and there is no child node, so the child node image is not set directly, The package can be sent out, and the package is received from the member node “1.2.1.1”.

  Based on rule 5, node “1.0” matches the defined rule. At this time, nodes whose first bit in the member list is not 1 are node “1.3.1.2” and node “1.3”. 1.3.2 ". These two nodes are not located in the cache of the node “1.0”, but both are child nodes, so the nodes “1.3.1.2” and “1.3. The first bit of 2 "is set to 1, the third bit of the child node image (representing node" 1.3 ") is set to 1, and then the package is sent out.

  An embodiment of the present invention uses a point-to-point transmission (ad hoc) scheme in a wireless network to establish a connection between many mobile devices without having to go through an access point. It is a hierarchical cluster type tree structure. By moving mobile devices in this tree network, it is possible to investigate the connection relationship between devices and to ensure that all devices in the tree network can exchange information with each other. There are no mobile devices in the tree network that serve as central control, and other mobile devices can join and leave the tree network at any time. In addition, the embodiments of the present invention support the multicasting function, reduce the flow of information in the connection network, and reduce the workload of the device.

  In the present invention, preferred embodiments have been disclosed as described above. However, the present invention is not limited to the present invention, and any person who is familiar with the technology can use various methods within the spirit and scope of the present invention. Variations and moist colors can be added, so the protection scope of the present invention is based on what is specified in the claims.

It is a figure which shows a well-known client server structure. 1 is a diagram illustrating a structure of a point-to-point transmission wireless network according to an embodiment of the present invention. FIG. 6 is a flowchart of an address process when a mobile device joins or generates a wireless network tree structure according to an embodiment of the present invention. It is a figure which shows the process of shortening the route | root by the Example of this invention. It is a figure which shows the process of shortening the route | root by the Example of this invention. It is a figure which shows the process of shortening the route | root by the Example of this invention. FIG. 6 is a diagram illustrating a process of performing participation of a mobile device or detachment of another mobile device according to an embodiment of the present invention. FIG. 6 is a diagram illustrating a process of performing participation of a mobile device or detachment of another mobile device according to an embodiment of the present invention. 5 is a flowchart of an execution process of joining a mobile device or detaching another mobile device according to an embodiment of the present invention. FIG. 4 is a diagram illustrating multicasting between mobile devices according to an embodiment of the present invention.

Explanation of symbols

110 Server 130 Application program
A, B, P node (1)-(5) operation

Claims (22)

A method for constructing a multipoint link interactive environment in a wireless network environment,
A point-to-point link method is used to construct a hierarchical cluster network.
Providing a first node;
The first node waits for an arbitrary time, transmits information in a multicasting manner, and detects a second node having a second logical address;
The first node transmits participation information to the second node;
When the second node receives the participation information, returning confirmation information to the first node;
The first node selects a first logical address based on the confirmation information, transmits participation confirmation information to the second node, confirms that the first logical address has been acquired, It consists of a step of forming a clustering network,
The step of transmitting the information by the first node in a multicasting manner further includes:
The first node transmits the information in a multicasting manner to detect whether there is a neighbor node having a logical address;
When there is no neighbor node having a logical address, the first node is defined as a root node of the hierarchical cluster network, a corresponding logical address is defined, and the media access control address of the first node is set as the hierarchical cluster network. The process of making the identification code of
If there is no other node having a logical address, the first node transmits information according to a multicasting scheme and detects whether a root node exists in the neighbor node;
When a root note exists in the neighbor node, the first node transmits a plurality of participation information to all the neighbor nodes;
After each of the neighbor nodes receives the participation information, each of the neighbor nodes returns confirmation information to the first node, and each of the neighbor nodes provides at least one logical address in the returned confirmation information. When,
The first node selects a third logical address provided by the third node based on the all confirmation information, and transmits participation confirmation information to the third node, It consists of a process to confirm that it has been acquired,
The third logical address is the shortest logical address obtained by comparing with the logical address provided by the other neighbor node;
To build a multipoint link interactive environment characterized by . The multipoint according to claim 1, wherein the third node is a parent node of the first node and is the root node of the hierarchical cluster network or a child node of the root node. How to build a link interaction environment. The method for constructing a multipoint link interactive environment according to claim 1, wherein each node in the hierarchical cluster network has a child table and a neighbor table. 4. The method for constructing a multipoint link interactive environment according to claim 3 , wherein a data package is transferred from a source node to a destination node based on the route method, the child table and the neighbor table of each node. . In the hierarchical cluster network, when the fourth node receives the data package from the source node, the longest is based on the logical address of the target node, the rules, and the logical addresses contained in the child table and the neighbor table. The method of constructing a multipoint link interactive environment according to claim 4 , wherein a prefix match operation is performed, and based on the comparison result, the data package is transferred to a node having the longest prefix. When the fourth node wants to transfer the data package to the destination node, and the fifth node that is a neighbor node of the fourth node has information on the destination node, the fifth node 6. The method of constructing a multipoint link interactive environment according to claim 5 , wherein information on a target node is notified to the fourth node.
The multi node according to claim 6 , wherein each of the nodes records the destination node and the route to which the data package is to be transmitted in a route cache (Cache), and then accesses the data package to be transferred. How to build a point link conversation environment. The method for constructing a multipoint link interactive environment according to claim 1, wherein the first and second logical addresses respectively display the identification codes of the first and second nodes. The second node is a parent node of the first node, and the first node periodically performs registration and update operations with the second node. To build a multipoint link interactive environment. The multipoint according to claim 9 , wherein when the first node wants to make the fifth node a parent node, the first node performs an address release operation on the second node and then registers with the fifth node. How to build a link interaction environment. When the first node has not performed the registration and update operations on the second node after a predetermined time has elapsed, the second node voluntarily executes the address release operation. The method of constructing a multipoint link interactive environment according to claim 10 . The hierarchical cluster network includes a multicast group, and a sixth node joins the multicast group,
Using a hash table, performing a map operation on the logical address included in the multicast group, and obtaining a logical address obtained by the map;
The sixth node is registered in the node having a logical address obtained by the map, and a node having a logical address obtained in the map includes the steps responsible for maintaining the registration data of the sixth node ,
The method of constructing a multipoint link interactive environment according to claim 1, comprising: The multipoint link interaction according to claim 12 , wherein if there is no node having a logical address obtained in the map, the parent node of the node is responsible for maintaining the registration data of the sixth node. How to build an environment. The registration data of the sixth node must be transferred from the parent node of the sixth node to the sixth node when a node having a logical address obtained in the map appears again. Item 14. A method for constructing a multipoint link interactive environment according to Item 13 . The step of the sixth node detaching the multicast group includes:
Using the hash table, executing a map operation on a logical address included in the multicast group, and obtaining a logical address obtained by the map;
The sixth node performs a deregistration operation on the parent node;
Registering the sixth node with a node having a logical address obtained in the map;
The method for constructing a multipoint link interactive environment according to claim 12 , comprising: During data package, up flag, child nodes image, a sequence number the intermediate node, and, to provide an area of member lists, and the sixth node, based on the area, in the multicast group, the data package The method of constructing a multipoint link interactive environment according to claim 12 , wherein: When the sixth node is a package transmission node, among the member nodes recorded in the member list, when any member node is recorded in the cache of the sixth node, the member nodes in the respective caches The method according to claim 12 , wherein the first bit is set to one. In addition to the member node to which the first bit is set, if there is a child node belonging to the forwarding node, the first bit of the logical address of the child node is set to 1 and the sixth bit belongs 18. The method of constructing a multipoint link interactive environment according to claim 17 , wherein a bit of a node representing the branch node is set to 1 in the child node image according to a branch node. If there is at least one member node whose first bit is not set to 1 in the member list, the up flag area is set to 1, and then, in the intermediate node, the sixth forwarding node 19. The method for constructing a multipoint link interactive environment according to claim 18 , wherein the address of the multipoint link is recorded. If the sixth node is not a package transfer node, the received package is transferred from the parent node of the sixth node, and this branch is determined based on the branch node to which the sixth node belongs in the child node image. When the bit of a node representing a node is set to 1, a branch node that is a member node that is not in the cache of the package transfer node and that has a child node of the package transfer in the member node whose first bit is 1 13. The node according to claim 12 , wherein the bit of the node representing the branch node is set to 1 in the child node image, and then the address of the package forwarding node is recorded in the intermediate node area. To build a multipoint link interactive environment. If the data package is transferred from a child node and the up flag is set to 1, then the member node in the member list is calculated with a first bit that is not 1 and located in the cache of the package transfer node The first bit of the node is set to 1 and the node belonging to the child node of the package transfer node is not a node located in the cache of the package transfer node, but sets the first bit to 1 and the child 21. The method according to claim 20 , wherein a bit of a node representing the child node branching node is set to 1 in a node image. If there is still a node whose first bit is not set to 1 in the member list, the up flag is set to 1, and the address of the package transfer node is recorded in the intermediate node area. A method for constructing a multipoint link interactive environment according to claim 21 .

Images