TWI493932B - Routing method and node for data broadcasting in a wireless network - Google Patents

Description

Routing method and routing node for wireless network data broadcasting

The disclosure relates to a routing method and routing node for wireless network data broadcasting.

With the popularity of broadband networks, the application of wireless networks is becoming more widespread. In multi-hop wireless networks, the Distance Vector Routing Protocol has been widely used in data transfer applications. This protocol uses a routing table to record the next neighbor node that the packet to be delivered to a destination node should forward. Proactive routing protocols are represented by the Destination-Sequenced Distance Vector (DSDV). In the DSDV routing protocol, the node periodically exchanges and updates the path information between each other, and stores the path information in the routing table. Each routing item in the routing table corresponds to a destination node from the node to the network. Path information, the routing item includes a metric field, a next hop field, and a sequence number field, where the metric field usually indicates the path that the path needs to pass. The number of nodes used to determine the age of the information to avoid loops. During the operation of the network, each node continuously maintains routing items in its routing table, whereby when the network topology changes, the node updates its path information to each node accordingly. The first figure is an example of a routing table for a node in a DSDV routing protocol. Taking the routing table 100 of the node A as an example, the routing item 113 in the routing table 100 records the path from the node A to the node C. The number of metrics passed is 2, and on this path, the next transit node of node A is node B.

Passive routing protocols are represented by Ad hoc On-Demand Distance Vector (AODV). In the AODV routing protocol, the path between the two nodes is established when a data needs to be transmitted between two nodes in the network. Each node on the path records the next transit node that the node needs to pass through to the destination node in the routing table.

In IEEE 802.11 wireless networks, nodes generally use the Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) mechanism for data transmission. This mechanism includes two modes: Distributed Coordination Function (DCF) and Point Coordination Function (PCF). In the DCF mode, the node needs to compete with other neighboring nodes before transmitting data to obtain the right to use the wireless medium, and the node may have a data collision and a low bandwidth usage rate during the competition process. For example, the context of the hidden terminal collision in Figure 2A and the situation of the exposed terminal problem in Figure 2B. The scenario of the second A picture is that the transmission range of the node A includes the node B but does not include the node C, and the transmission range of the node C includes the node B but does not include the node A. Therefore, node A and node C cannot directly know whether the other party is transmitting data. When node A and node C simultaneously transmit data to node B, a data collision occurs at node B. The scenario of the second B diagram is that the transmission range of the node A includes the node B and the node C, and the transmission range of the node C includes the node A and the node D. When node A transmits When the data is sent to the node B, if the node C wants to transmit the data to the node D, the node C mistakenly thinks that it will interfere with the data transmission of the node A, and thus does not transmit the data to the node D, which results in a decrease in the wide usage rate. In fact, node C can transmit data at this time, and will not cause data collision at node B.

When data transmission is performed using the PCF mode, the transmission time can be allocated by the radio base station (AP) to ensure transmission quality. However, when a large number of nodes simultaneously download wireless media content, they will face the problem of insufficient coverage. In this case, it is necessary to use a multi-step hopping transmission method to transmit wireless media data through path selection and establishment between mobile devices.

There is a hierarchical wireless network automatic routing technology that uses the information provided by neighboring nodes to automatically configure hierarchical network routing messages and automatically maintain network routing configurations. The method performs one or more tasks on each node, including discovering neighboring routing nodes, maintaining a neighboring node list as a candidate parent node, selecting a neighboring node as a parent node of the hierarchical routing system, and broadcasting routing metrics to neighboring nodes. (including signal attribute information (such as SNR) and routing information (such as hop count)), and a list of neighbors that maintain bad routes. The technique also uses the signal-to-noise ratio (SNR) parameter of the antenna to calculate the data structure table of the neighboring node and to adjust the hierarchical structure of the routing node.

There is a technique for configuring bandwidth based on node requirements and region status to exchange and collect traffic metrics, such as queue sizes, for each node and neighboring nodes. Node based on itself and proximity The difference in the traffic metric of the node is used to calculate the link weight. The node configures the bandwidth of its data channel according to the connection weight, such as channel duration and frequency. The link quality factor can be considered in the calculation of the connection weight.

In the above or existing technologies for wireless network data broadcasting, some technologies use more complicated routing metrics and control messages to improve the reliability of routing, and some technologies are allocated according to traffic metrics between nodes and their neighboring nodes. The bandwidth of the data channel does not disclose the reduction of data collision probability and the increase of bandwidth usage by reducing the number of nodes participating in the transfer of data, and ensuring that all network nodes communicating with the source node path can receive broadcast content. Achieve the same radio coverage as all nodes participate in the broadcast.

The disclosed embodiments may provide a routing method and routing node for wireless network data broadcasting.

One disclosed embodiment relates to a routing method for wireless network data broadcasting, which is applied to a wireless network in which a source node and a plurality of receiving nodes operate in the wireless network. This routing method includes actions in a path setup phase and actions in a data transfer phase. In the path setting phase, a routing message corresponding to the source node transmitted by the second node is received by a first receiving node, where the second node is the source node and a second receiving node. One of them, based on this road Determining, by the first receiving node, a relationship between the first receiving node and the second node in a routing tree corresponding to the source node, the relationship between the message and the path record corresponding to the source node Recorded in the path record, and when the relationship is that the first receiving node is a child of the second node, the routing message is forwarded by the first receiving node; and in the data transmission phase, When the first receiving node receives a broadcast data generated by the source node, determining, according to the relationship recorded in the path record, determining a role of the first receiving node in the routing tree, when the role is an intermediate This broadcast material is forwarded when the node is a node.

Another embodiment disclosed is directed to a routing node for wireless network data broadcasting, wherein a source node, a first routing node, and a second routing node operate in a wireless network. The first routing node includes a transceiver and a processor. The transceiver receives a routing message from a second node corresponding to the source node, wherein the second node is one of the source node and a second receiving node. The processor determines, according to the routing message and a path record corresponding to the source node, a relationship between the first routing node and the second node in a routing tree corresponding to the source node, and records the relationship in the relationship In the path record, and when the relationship is that the first routing node is a child of the second node, the transceiver is driven to forward the routing message. When the transceiver receives a broadcast data generated by the source node, the processor determines, according to the relationship recorded in the path record, a role of the first routing node in the routing tree, and After determining that the role is an intermediate node, the transceiver is driven to forward the broadcast data.

The above and other advantages of the present invention will be described in detail below with reference to the following drawings, detailed description of the embodiments, and claims.

The disclosed embodiments provide a routing technology for wireless network data broadcasting. This routing technique uses a distance vector method to set the data broadcast path, which is similar to the traditional distance vector routing protocol, such as message type and routing tree topology. A routing table different from the traditional distance vector routing protocol includes a next delivery node (NextHop) field for reference when the node transmits data. The disclosed embodiment refers to setting a parent node field in the path record to provide a reference for receiving data by the node. . Moreover, the data transfer direction different from the traditional distance vector routing protocol is from the leaf node to the root node (r oot), which is opposite to the message transmission direction; the data transfer direction of the embodiment is from the root node (root) To the leaf node, the same direction as the message. The disclosed embodiment also selects necessary nodes to participate in data broadcasting from all network nodes, including, for example, a node can determine its role in the routing tree, and does not transmit broadcast data after transmitting the role as a leaf node, and transmits broadcast data. After the number of nodes is reduced, the wireless broadcast range can still cover the entire network. In the embodiment of the disclosure, in the process of establishing the routing tree, two settings are completed at each node, one of which is to provide the previous level node of the broadcast data of the node, and the setting is determined according to the parent node field of the path record; One is whether the node is responsible for transmitting broadcast data. This setting is determined by the child node field of the path record.

The principle principle of the routing technology of the wireless network data broadcasting in the embodiment is to establish a routing tree in the process of routing message propagation by using the distance vector method, and to infer that the leaf node does not need to transfer data, thereby reducing the number of nodes participating in the data broadcasting. number. The routing tree takes the source node as the root node and covers all network nodes. Except for the source node, each node has one of the intermediate nodes or leaf nodes in the routing tree. The network node does not need to rely on the leaf node to obtain the characteristics of the broadcast data, and the node participating in the data transmission is reduced from the original network node to only the intermediate node, and the wireless broadcast range can still cover the entire network.

As shown in the example of the third figure, the routing technique of the disclosed embodiment reduces the broadcast node from all nodes in the network (represented by the hollow small circle in the broadcast range 310) to the intermediate node (the hollow in the broadcast range 320). Small circles indicate) where small arrows represent data being transferred from one node to another. In the broadcast range 320, it can be seen that leaf nodes (ie, solid small circles) in the broadcast range 320 do not need to participate in data transfer. Accordingly, the broadcast range 320 can cover the entire network. The above intermediate node refers to the source node routing information provided by the downstream child node using the node; the leaf node means that no node uses the source node routing information provided by the node. Thus, in the disclosed embodiment, all nodes in the network except the source node need to be able to recognize their role in the routing tree.

The routing technology according to the embodiments of the present disclosure may be implemented in two phases, namely a path setting phase and a data transfer phase. In the path setting phase, the parent node is set by the distance vector method (the data of the previous level comes Source) and determine the role of the node. In the data transfer phase, the data sent by the parent node is received, and whether the data is transferred is determined according to the role of the node. The following is to first define the data structure of the routing information and path record of the wireless communication network. The fourth figure is a data structure for defining a routing message and a path record according to an embodiment of the present disclosure.

Referring to the fourth figure, a routing message 410 may include a source node field 411, a message relay node (Relay) field (referred to as relay node field 412), and a message parent node (Parent) field. (referred to as parent node field 413), a metric field (referred to as metric field 414), and a message number (SeqNo) field (abbreviated as number field 415). The source node field 411 is used to record the identifier of the source node. The relay node field 412 is used to record the identification code of the own node (the sending node of the message). The parent node field 413 is used to record the identifier of the parent node of the node. The metric field 414 is used to record the path length from the source node to the local node. This metric field is usually represented by the number of hops that the source node needs to pass through to the shortest path of the node. The serial number field 415 is used to identify the old and new levels of the message version. Generally, the comparison method between the old and new levels of the two messages is that the serial number of the serial number field is larger, indicating that the corresponding version is a new version. In the data structure of the above routing message, the routing message should at least include the relay node field and the parent node field.

A path record 420 can include a source node field 421, a path parent node field (referred to as the parent node field 422), a path child node (Children field) (a sub-node field 423), and a path metric field. Bit (referred to as measurement field 424), and a path number field (referred to as serial number field 425). Source section The point field 421 records the identification code of the source node. The parent node field 422 records the identification code of the previous data transfer node. The child node field 423 records the identification code of the next-level data receiving node (child node), which is used to determine the role of the node in a routing tree. The metric field 424 is used to record the path length from the source node to the local node. This metric field is usually represented by the hop count of the source node to the shortest path of the node. The sequence number field 425 is used to identify the degree of oldness of the route information. In the data structure of the above path record, the path record should include at least this parent node field and this child node field.

Based on the data structure of the route information and the path record of the fourth figure, the fifth to fifth and the sixth and sixth and sixth and sixth and sixth and sixth Network construction process. In the examples of the fifth A to the fifth B, the two nodes connected by the solid arrow represent that there is a parent-child relationship in the routing tree formed by the source node S. In the data transmission phase, the broadcast of the source node S The data is transmitted from the parent node to the child node; the dotted arrow represents the transmission path of the source node S broadcast data, the path may span one or more nodes; the two nodes connected by the solid line represent the adjacent nodes, that is, the two The coverage of nodes in each other's wireless transmission. As shown in FIG. 5A, it is assumed that the routing message 505 of the source node S reaches the node A via the node P, wherein the source node field of the routing message 505 is set to S, and the relay node field is set to node P. At this time, it is assumed that the node A has no path record corresponding to the source node S (the node A has not received the routing message of the source node S), and then the node A establishes a path record 510 corresponding to the source node S, wherein the path The source node field of record 510 is set to S, The parent node field is set to node P. That is to say, the node A adopts the routing information of the source node S provided by the node P, and thus the node P is determined to be the parent node, and a routing message 555 is correspondingly transmitted.

As shown in FIG. 5B, node A sends a routing message 555, in which the source node field of routing message 555 is set to S, the relay node field is set to node A, and the parent node field is set to node P. The routing message 555 sent by the node A is received by the node P, the node Q, and the node B, respectively. After determining that the parent node field of the routing message 555 is the node P, the node P knows that it is the parent node of the node A, and then adds the child node field corresponding to the path record 560 of the source node S to the A. When the parent node field setting of the path record 510 and the child node field setting of the path record 560 are set, a parent-child relationship is established between the node P and the node A (as shown by node P in the routing tree 550 → node A). . After determining the sequence number field and the measurement field of the routing message 555, the node B determines to be a child node of the node A, and then sets the parent node field of the path record 580 corresponding to the source node S as the node A. The node Q discards the packet of the routing message 555 after determining that it is a general neighboring node of the node A (not the parent node of the node A or the child node of the node A) according to the sequence number field and the metric field of the routing message 555. Do not do anything.

In the example of Figure 6A, the examples of Figures 5A-5B are taken, and it is assumed that another routing message 605 of the source node S arrives at node A via node Q. Previously, a parent-child relationship has been established between node P and node A. At this time, node A takes out the route record 510 to compare it with the route message 605. After the sequence number field and the measurement field, it is decided to change the node Q as the parent node. For example, the node A judges that the version of the routing message 605 is newer, or the node A determines that the source node S has a shorter path length from the node Q to the node A, so Node A changes the parent node field of path record 510, which originally corresponds to source node S, to node Q, as indicated by path record 610, and correspondingly sends a routing message 655.

As shown in FIG. 6B, node A sends a routing message 655, in which the source node field of the routing message 655 is set to S, the relay node field is set to node A, and the parent node field is set to node Q. The routing message 655 sent by the node A is received by the node P, the node Q, and the node B, respectively. After the node P determines that the parent node field of the routing message 655 is Q, it knows that it is no longer the parent node of the node A, but becomes the general neighbor node of the node A, and then the node A is originally corresponding to the source node. The sub-node field of path record 560 of S is removed, as indicated by path record 660. After determining that the parent node field of the routing message 655 is Q, the node Q knows that it changes from the general neighbor node of the node A to the parent node, and then adds the child node field corresponding to the path record of the source node S to the node A. As shown in path record 670. Based on the routing message 655, the Node B discards the packet of the routing message 655 and does not perform any processing after determining that the relationship with respect to the node A is unchanged.

In the above, the seventh figure is a routing method for wireless network data broadcasting according to an embodiment of the disclosure. The routing method is applied to a wireless network, wherein a source node and a plurality of receiving nodes operate on the wireless network in. The so-called source node and the receiving node are defined according to the role of each network node in the data broadcasting application. When a node generates and broadcasts data to the outside, the node is the source node, and other network nodes are opposite to the source node. Receive node. Referring to the seventh figure, the routing method includes a path setting phase 710 and a data transfer phase 720. In the path setting phase 710, a first receiving node receives a routing message corresponding to the source node transmitted by the second node (step 712), where the second node may be the source node or a second A receiving node that periodically sends a routing message. In addition, the source node may also send a routing message when it detects that a new network node is added, a network node disappears, or the network topology changes. According to the routing message and a path record corresponding to the source node, the first receiving node determines, in a routing tree corresponding to the source node, a relationship of the first receiving node relative to the second node, The relationship is recorded in the path record (step 714), wherein the relationship is that the first receiving node is a parent node of the second node, the first receiving node is a child node of the second node, and the first The receiving node is a neighboring node of the second node, and one of the foregoing three relationships. When the relationship is that the first receiving node is a child of the second node, the routing message is forwarded by the first receiving node (step 716). As described above, in step 714, after determining that the first receiving node is a parent node relationship of the second node, the first receiving node adds the identifier of the second node to the child in the path record. In the node field, after determining that the first receiving node is a child node relationship of the second node, the first receiving node records the parent node field in the path record as the second node. In the data transfer phase 720, when the first receiving node receives a broadcast data generated by the source node Determining, according to the relationship recorded in the path record, a role of the first receiving node in the routing tree (step 722), wherein the role may be an intermediate node and a leaf node, the two roles one of them. And after determining that the role is an intermediate node, the broadcast material is forwarded (step 724). As described above, in step 722, when the first receiving node determines that the child node field of the path record is empty, it determines that its role in the routing tree is a leaf node; otherwise, the first receiving node determines that When the child node field of the path record is not empty, the role in the routing tree is determined to be an intermediate node.

The eighth figure is a flow chart of a corresponding message processing and path setting procedure after a routing node receives a routing message according to an embodiment of the present disclosure. It is assumed that a routing node B receives a routing message from a node A to a source node S. Referring to the eighth figure, the routing node B fetches the path record corresponding to the source node S, and compares the routing message with the field value of the path record (step 800). The result of the comparison is based on the following four cases for the corresponding message processing and path setting procedure. In the first case, the routing node B does not have the path record, or the sequence number field value in the routing message is greater than the sequence number field value in the path record. In the second case, the sequence number field value in the routing message is equal to the sequence number field value of the path record, and the metric field value in the route message represents a preferred path. Usually, the metric field value is based on the source node. It is determined by the number of nodes through which a shortest path of the routing node B passes, and the smaller the number of nodes, the better the preferred path. In the third case, the sequence number field value in the route message is equal to the sequence number field value of the path record, and the parent node field of the route message is Record the identification code B of the routing node. In the fourth case, the sequence number field value in the route message is equal to the sequence number field value of the path record, and the measurement field value of the route message does not represent the preferred path, and the parent node field of the route message is not recorded. The identification code B of this routing node. The above four cases cover that the serial number field value of the routing message is greater than or equal to the serial number field value in the path record. When the comparison result is not one of the four cases, the sequence number of the routing message is smaller. , indicating that the routing information in this routing message is older. At this time, the routing node B discards the routing message and ends the processing.

In the case that if the route node B does not have the path record originally, a path record corresponding to the source node S is newly created, and the newly created or originally existing child node field of the path record is cleared, and the routing message is based on the route information. The sequence number field value of the path record is set (step 810). At this time, the routing node B is a child node of the node A, and thus the child node setting program is executed (step 812). The child node setting program includes setting the parent node field of the path record as node A, and updating the metric field value in the path record according to the routing message. Then, the routing message of the source node S is transferred (step 814), and the processing procedure is terminated.

In case 2, it is indicated that the routing node B finds a shorter path from the source node S to the local node via the routing message, and the routing node B determines whether the node A exists in the child node field of the path record, if If yes, node A is removed from the sub-node field of the path record (step 820). Similar to case 1, the routing node B is a child of node A, because After performing step 812 and step 814, the processing routine ends.

In case three, it is indicated that the node A regards the routing node B as a parent node, and therefore the routing node B executes the parent node setting program (step 830), and ends the processing procedure. The parent node setting program includes determining whether the node A exists in the child node field of the path record. If not, the node A is added to the child node field of the path record.

In case four, it is indicated that the routing node B is a general neighboring node of the node A. Therefore, after performing the step 820, the routing node B ends the processing procedure.

As described above, in a data structure of a routing message, the routing message should include at least a relay node field and a parent node field; and in a path record data structure, the path record should include at least one The parent node field and a child node field. For example, when the data broadcast application environment adopts a single and fixed source node, the routing node does not need to identify the source node corresponding to the routing information, and thus the routing message and the source node field of the path record may be omitted. For example, if the source node periodically sends a routing message, and the sending period is longer than the time required for the routing message to propagate to all routing nodes, the routing node may determine the routing message according to the time interval between the last time and the last received routing message. The newness and the oldness, when the time interval exceeds a predetermined value, it is determined that the version of the routing message is a new version, and thus the routing message and the sequence number field of the path record can be omitted. For another example, the routing node can assume that among the same version of the routing message, the first received routing message represents The best path from the source node to the routing node, so the routing message and the metric field of this path record can be omitted.

In the data transmission phase, each node in the wireless network receives the broadcast data generated by the source node from the parent node, and decides whether to forward the broadcast data according to the role of the node. The ninth figure is a flow chart for further processing a broadcast node by a routing node according to an embodiment of the present disclosure. Referring to the ninth figure, after the routing node receives a broadcast data generated by the source node from the parent node, the routing node takes out a path record corresponding to the source node (step 910), and determines whether the child node field in the path record is If it is not empty (step 920), if it is not empty, it indicates that the routing node is an intermediate node in the routing tree of the corresponding source node, so the downstream child node needs to rely on the routing node to obtain the broadcast data, and at this time, the routing node forwards the broadcast data. The broadcast data of the source node (step 930); if it is empty, it indicates that the routing node is a leaf node in the routing tree of the corresponding source node. At this time, the routing node does not forward the broadcast data, and ends the processing procedure.

In the above, according to an embodiment of the disclosure, a plurality of routing nodes can be used for data broadcasting of a wireless network, wherein a source node, a first routing node, and a second routing node operate in the wireless network. The first routing node can include a transceiver and a processor. The transceiver receives a routing message from a second node corresponding to the source node, where the second node can be the source node or the second routing node. The processor determines, according to the routing message and a path record corresponding to the source node, that the first routing node is relative to a routing tree corresponding to the source node. A relationship of the second node records the relationship in the path record. When the relationship is that the first routing node is a child of the second node, the transceiver is driven to forward the routing message. When the transceiver receives a broadcast data generated by the source node, the processor determines, according to the relationship recorded in the path record, a role of the first routing node in the routing tree, and After determining that the role is an intermediate node, the transceiver is driven to forward the broadcast data.

The routing node may further include a storage device, such as a memory, for storing a routing message and a path record data structure. The data structure and characteristics of the routing message and the path record are as described in the foregoing fourth embodiment and the disclosed embodiment; after the routing node receives a routing message, the corresponding message processing and path setting procedure is as shown in the foregoing figure 8 and The flow of processing the broadcast data by the routing node is as set forth in the foregoing ninth embodiment and the disclosed embodiment. The routing node completes two settings at each node in the process of establishing the routing tree, one of which is to provide the previous level node of the broadcast data of the node, and the setting is determined according to the parent node field of the path record; One is whether the node is responsible for transmitting broadcast data. This setting is determined by the sub-node field of the path record. Therefore, the routing node can determine the role of itself in a routing tree, and after determining that its role is a leaf node, the broadcast data is not transmitted, and the number of nodes transmitting the broadcast data is reduced, the wireless broadcast range can still cover the entire network.

In summary, the disclosed embodiments provide a routing method and routing node for wireless network data broadcasting. Its technology refers to the distance vector method to set The data broadcast path is set in the path record to set the parent node field to provide reference information when the node receives the data, and the data transfer direction is from the root node to the leaf node, which is the same as the message transmission direction. In the process of establishing the routing tree, the parent node field of the path record is set to identify the previous level node that provides the broadcast data; and the child node field of the path record is set to determine whether the node needs to be responsible for transmitting the data. The disclosed embodiment selects the necessary nodes from all the network nodes to participate in the data broadcast, and after the number of nodes transmitting the broadcast data is reduced, the wireless broadcast range can still cover the entire network.

The above is only the embodiment of the disclosure, and the scope of the disclosure is not limited thereto. That is, the equivalent changes and modifications made by the scope of the present invention should remain within the scope of the present invention.

100‧‧‧ routing table

113‧‧‧ routing project

A, B, C‧‧‧ nodes

A, B, C, D‧‧‧ nodes

310, 320‧‧‧Wireless broadcast range

410‧‧‧ routing message

411‧‧‧Source node field

412‧‧‧Relay node field

413‧‧ ‧ parent node field

414‧‧‧Measurement field

415‧‧‧ sequence field

420‧‧‧Path record

421‧‧‧ source node field

422‧‧ ‧ parent node field

423‧‧‧Child node field

424‧‧‧Measurement field

425‧‧‧ sequence field

500, 550‧‧‧ routing tree

505, 555‧‧ ‧ routing messages

510, 560, 570, 580‧ ‧ path path record

S‧‧‧ source node

Q, P, A, B‧‧‧ routing nodes

600, 650‧‧‧ routing tree

605, 655‧‧ ‧ routing messages

610, 660, 670‧‧ ‧ path record

S‧‧‧ source node

Q, P, A, B‧‧‧ routing nodes

710‧‧‧Path setting phase

720‧‧‧data transfer phase

712‧‧‧ A first receiving node receives a routing message corresponding to a source node transmitted by a second node

714 ‧ ‧ according to the routing message and a path record corresponding to the source node, where the first receiving node determines, in a routing tree corresponding to the source node, a first receiving node relative to the second node Relationship, record this relationship in this path record

716‧‧‧ When the relationship is that the first receiving node is a child of the second node, the routing message is forwarded by the first receiving node

722‧‧‧ When the first receiving node receives a broadcast data generated by the source node, determining a role of the first receiving node in the routing tree according to the relationship recorded in the path record

724‧‧‧ When the role is an intermediate node, the broadcast material is forwarded

800‧‧‧Node B takes the path record corresponding to the source node S and compares the routing message with the field value of the path record

810‧‧‧If there is no such path record, a new path record corresponding to the source node is created, and the newly created or originally existing sub-node field of the path record is deleted, and the path record is set according to the routing message. Serial number field value

812‧‧‧Execution subnode setup procedure

814‧‧‧Transfer routing message from source node S

820‧‧‧Remove node A from the sub-node field of the path record

830‧‧‧Execution of the parent node setup program

910‧‧‧Retrieve the path record corresponding to the source node

920‧‧‧Determination of whether the sub-node field in this path record is empty

930‧‧‧Transfer the broadcast material of the source node

The first figure is an example of a routing table for a node in a DSDV routing protocol.

Figure 2A is a schematic diagram of an example of a hidden terminal collision scenario.

The second B diagram is an exemplary diagram of the context of an exposed terminal problem.

The third figure is a schematic diagram illustrating an example in which a broadcast node can be reduced from all nodes in the network to intermediate nodes according to an embodiment of the present disclosure.

The fourth figure is a data structure for defining a routing message and a path record according to an embodiment of the present disclosure.

The fifth to fifth embodiments are a first example of the network construction process in the path setting phase according to an embodiment of the present disclosure.

6A-6B are a second example of a network construction process in the path setting phase according to an embodiment of the present disclosure.

The seventh figure illustrates a method for routing a wireless network data broadcast according to an embodiment of the present disclosure.

The eighth figure is a flow chart of a corresponding message processing and path setting procedure after a routing node receives a routing message according to an embodiment of the present disclosure.

The ninth figure illustrates a flow of processing a broadcast data by a routing node according to an embodiment of the present disclosure.

710‧‧‧Path setting phase

720‧‧‧data transfer phase

712‧‧‧ A first receiving node receives a routing message corresponding to the source node transmitted by the second node

714 ‧ ‧ according to the routing message and a path record corresponding to the source node, where the first receiving node determines a routing tree corresponding to the source node a relationship of the first receiving node with respect to the second node, and recording the relationship in the path record

716‧‧‧ When the relationship is that the first receiving node is a child of the second node, the routing message is forwarded by the first receiving node

722‧‧‧ When the first receiving node receives a broadcast data generated by the source node, determining a role of the first receiving node in the routing tree according to the relationship recorded in the path record

724‧‧‧ When the role is an intermediate node, the broadcast material is forwarded

Claims (24)

A routing method for wireless network data broadcasting is applied to a wireless network, wherein a source node and a plurality of receiving nodes operate in the wireless network, and the routing method includes: an action in a path setting phase, In the path setting phase, a first receiving node receives a routing message corresponding to the source node and is sent by the second node, where the second node is the source node and a second receiving node. And determining, according to the routing message and a path record corresponding to the source node, a relationship between the first receiving node and the second node in a routing tree corresponding to the source node at the first receiving node Recording the relationship in the path record, and when the relationship is that the first receiving node is a child node of the second node, forwarding the routing message by the first receiving node; and transmitting data in a The action in the stage, in the data transfer phase, when the first receiving node receives a broadcast data generated by the source node, according to the record recorded in the path record Determining, by the first receiving node, a role in the routing tree, when the role is an intermediate node, forwarding the broadcast data; wherein the routing message includes a message relay node field and a message parent node column Bit; the path record includes a path parent node field and a path child node field. The routing method of claim 1, wherein the source node periodically sends the routing message. A routing method for wireless network data broadcasting, applied to a wireless network a path, wherein a source node and a plurality of receiving nodes operate in the wireless network, the routing method comprising: an action in a path setting phase, in the path setting phase, receiving by a first receiving node a routing message corresponding to the source node transmitted by the second node, wherein the second node is one of the source node and a second receiving node, according to the routing message and a corresponding to the source node a path record, at the first receiving node, determining a relationship of the first receiving node with respect to the second node in a routing tree corresponding to the source node, recording the relationship in the path record, and when the relationship When the first receiving node is a child node of the second node, the routing message is forwarded by the first receiving node; and the action in a data transmission phase, in the data transmission phase, when the When receiving, by a receiving node, a broadcast data generated by the source node, determining, according to the relationship recorded in the path record, determining a role of the first receiving node in the routing tree, When the character is an intermediate node forwarding the broadcast information; wherein the source node to the receiving node detects a new, disappears when a receiving node topology, or change the wireless network transmits the message routing. The routing method of claim 1, wherein the relationship is that the first receiving node is a parent node of the second node, the first receiving node is the child node of the second node, and the first A receiving node is a general neighboring node of the second node, and one of the foregoing three relationships. The routing method according to claim 1, wherein the The first receiving node, the recording the relationship in the path record further includes: after determining that the relationship is that the first receiving node is the child node of the second node, at the first receiving node, the path parent node The field record is an identification code of the second node. The routing method of claim 4, wherein, in the first receiving node, the recording the relationship in the path record further comprises: determining that the relationship is that the first receiving node is the second node After the parent node, an identifier of the second node is added to the path child node field at the first receiving node. The routing method of claim 4, wherein, in the first receiving node, the recording the relationship in the path record further comprises: determining that the relationship is that the first receiving node is the second node After the neighboring node is generally located, at the first receiving node, an identification code of the second node is removed from the path sub-node field. The routing method of claim 4, wherein, at the first receiving node, determining the relationship further comprises: when the message parent node field is recorded as an identification code of the first receiving node, determining the The first receiving node is the parent node of the second node. The routing method of claim 4, wherein the routing message further comprises a message metric field, and the path record further comprises a path metric field. The routing method of claim 9, wherein the content of the message metric field and the content of the path metric field are based on a node through which the source node reaches a shortest path of the first receiving node. The number is determined. The routing method of claim 9, wherein the determining, at the first receiving node, the determining further comprises: determining, according to a comparison result of the message metric field and the path metric field, determining the first receiving node Is the child node of the second node or the general neighbor node of the second node. The routing method of claim 5, wherein the first receiving node receives the broadcast data transmitted by the second node according to the identification code of the second node recorded in the parent node field of the path. The routing method according to claim 1, wherein the role is one of the roles of the intermediate node and a leaf node. The routing method according to claim 13, wherein in the first receiving node, determining that the role further comprises: when the path sub-node field is not empty, determining that the role is the intermediate node, when the path is When the node field is empty, it is determined that the role is a leaf node. The routing method of claim 14, wherein when the first receiving node determines that the role is the leaf node, the first receiving node does not forward the broadcast data. A routing node for wireless network data broadcasting, wherein a source node, a first routing node, and a second routing node operate in a wireless network, the first routing node includes: a transceiver, receiving from a second a routing message sent by the node corresponding to the source node, where the second node is the source node and a One of the second routing nodes; and a processor determining, according to the routing message and a path record corresponding to the source node, that the first routing node is relative to the first routing node in the routing tree corresponding to the source node a relationship between the two nodes, the relationship is recorded in the path record, and when the relationship is that the first routing node is a child node of the second node, the transceiver is driven to forward the routing message; wherein, when When the transceiver receives a broadcast data generated by the source node, the processor determines a role of the first routing node in the routing tree according to the relationship recorded in the path record, and determines that the role is After an intermediate node, the transceiver is driven to forward the broadcast data; wherein the routing message includes a message relay node field and a message parent node field; the path record includes a path parent node field and a path Node field. The routing node of claim 16, wherein the first routing node further comprises a storage device for storing the routing message and the data structure of the path record. The routing node according to claim 16, wherein the first routing node further determines the second node according to the content of the parent node field of the message, after determining that it is a parent node of the second node. An identification code is added to the path sub-node field. The routing node of claim 16, wherein the routing message further includes a message metric field, and the path record further includes a path metric field. The routing node of claim 19, wherein the content of the message metric field and the content of the path metric field are based on the number of nodes through which the source node reaches a shortest path of the first routing node. And decided. The routing node according to claim 19, wherein the first routing node determines, according to a comparison result of the message metric field and the path metric field, after determining that the child node is the child node of the second node, The path parent node field is recorded as an identification code of the second node. The routing node according to claim 19, wherein the first routing node determines, according to a comparison result of the message metric field and the path metric field, that after determining that it is a general node of the second node, An identification code of the second node is removed from the path sub-node field. The routing node of claim 16, wherein the first routing node sets the parent node field of the path to identify a previous level node that provides the broadcast data during the establishment of the routing tree. The routing node of claim 16, wherein the first routing node sets the path sub-node field during the establishment of the routing tree to determine whether the first routing node is responsible for transmitting data.