WO2011140877A1 - 路由转发方法、路由节点及无线通信网络 - Google Patents

路由转发方法、路由节点及无线通信网络 Download PDF

Info

Publication number
WO2011140877A1
WO2011140877A1 PCT/CN2011/072667 CN2011072667W WO2011140877A1 WO 2011140877 A1 WO2011140877 A1 WO 2011140877A1 CN 2011072667 W CN2011072667 W CN 2011072667W WO 2011140877 A1 WO2011140877 A1 WO 2011140877A1
Authority
WO
WIPO (PCT)
Prior art keywords
information
node
broadcast
routing
radius
Prior art date
Application number
PCT/CN2011/072667
Other languages
English (en)
French (fr)
Inventor
刘培
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2011140877A1 publication Critical patent/WO2011140877A1/zh

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • Routing and forwarding method Routing and forwarding method, routing node and wireless communication network
  • the present invention relates to the field of communications technologies, and in particular, to a routing and forwarding method, a routing node, and a wireless communication network. Background technique
  • a flood routing and forwarding method in the prior art the source node transmits a copy of the data to each neighbor node, and each neighbor node transmits data to each node other than the node that sends the data until the data is transmitted to the target.
  • the node or the set data lifetime is zero. This flooding method is prone to broadcast storms, causing serious packet loss and excessive network energy consumption.
  • an on-demand routing forwarding method uses an Ad-hoc On-Demand Distance Vector (AOD V) protocol, and the source node needs to communicate with the destination node if it is in the routing. If the corresponding route already exists in the table, the data transmission is directly performed.
  • AOD V Ad-hoc On-Demand Distance Vector
  • the source node initiates a route discovery process to find the corresponding route by broadcasting the route request information, as shown in Figure 1A.
  • the routing request information arrives at the destination node itself or an intermediate node with a destination node route, the destination node and the intermediate node return a route reply message through the original path to determine the availability of the route to the source node, as shown in FIG. 1B.
  • This on-demand method has a certain delay and cannot guarantee that information is delivered to the destination node in time.
  • the sink node is a destination node, and the destination node broadcasts gradient diffusion information.
  • each routing node After receiving the gradient diffusion information, each routing node establishes a route to the destination node and periodically updates it.
  • the destination node periodically broadcasts the topology update message to obtain the topology information of the entire network.
  • the other routing nodes maintain the next hop routing entries whose gradients are smaller than the reachable destination node.
  • the route within the diffusion radius is a tree structure, and this structure is caused by the node.
  • the route is invalid due to factors such as movement and node death. Once the route is invalid, all the information passing through this node will be lost, so the reliability is not high.
  • the path selected by this method is not necessarily the shortest delay path, and the timeliness of information transmission cannot be guaranteed. Summary of the invention
  • the embodiments of the present invention provide a route forwarding method, a routing node, and a wireless communication network, which are used to improve the timeliness and reliability of information transmission from a source node to a destination node.
  • an embodiment of the present invention provides a route forwarding method, including:
  • the broadcast radius is decreased by 1 and it is determined whether the broadcast radius is greater than 0;
  • the next hop node is determined, and the information is forwarded to the next hop node by means of unicast transmission.
  • an embodiment of the present invention provides a routing node, including:
  • An obtaining module configured to obtain information broadcast by a previous routing node
  • the determining module includes: a judging unit and a processing unit; the judging unit is configured to determine a destination address type of the information acquired by the acquiring module, and if the destination address is a broadcast address, determine a broadcast radius minus one Whether the broadcast radius is greater than 0; the processing unit is configured to: if the determining unit determines that the broadcast radius is equal to 0, determine a next hop node;
  • the sending module is configured to: after the processing unit determines the next hop node, forward the information to the next hop node determined by the determining module by using a unicast sending manner; the sending module is further configured to: The determining unit determines that the broadcast radius is greater than 0, and broadcasts the information.
  • the embodiment of the present invention further provides a wireless communication network, including multiple routing nodes; the first routing node of the multiple routing nodes is used to broadcast information;
  • the second routing node of the plurality of routing nodes is configured to obtain information broadcast by the first routing node; determine a type of a destination address of the information; and if the destination address is a broadcast address, reduce a broadcast radius by one Then determining whether the broadcast radius is greater than 0; if the broadcast radius is greater than 0, then Broadcasting the information; if the broadcast radius is equal to 0, determining a next hop node, and forwarding the information to the next hop node by means of unicast transmission.
  • the route forwarding method, the routing node, and the wireless communication network provided by the embodiment of the present invention, after receiving the information broadcast by the previous routing node, the routing node in the network broadcasts the information or determines the next hop node according to the destination address, and the next hop The node unicasts this information.
  • the method of broadcasting the unicast first improves the timeliness and reliability of the information transmission, and ensures the low energy consumption of the network.
  • FIG. 1A is a flow chart of source node route discovery of an existing on-demand route forwarding method
  • FIG. 1B is a flow chart of route discovery of a destination node and an intermediate node in an existing on-demand route forwarding method
  • FIG. 2 is a schematic diagram of a network structure of an existing hybrid route forwarding method
  • FIG. 3 is a flowchart of a route forwarding method according to an embodiment of the present invention.
  • FIG. 4 is a flowchart of a route forwarding method according to another embodiment of the present invention.
  • FIG. 5 is a flowchart of a route forwarding method according to another embodiment of the present invention.
  • FIG. 6 is a flowchart of a route forwarding method according to still another embodiment of the present invention.
  • FIG. 7 is a schematic structural diagram of a network when a broadcast radius is 1 hop according to an embodiment of the present invention.
  • FIG. 8 is a schematic structural diagram of a network when a broadcast radius is 2 hops according to an embodiment of the present invention.
  • FIG. 9 is a schematic structural diagram of a routing node according to an embodiment of the present invention.
  • FIG. 10 is a schematic structural diagram of a routing node according to still another embodiment of the present invention.
  • FIG. 11 is a schematic structural diagram of a wireless communication network according to an embodiment of the present invention. detailed description
  • FIG. 3 is a flowchart of a route forwarding method according to an embodiment of the present invention. As shown in FIG. 3, the method includes:
  • the embodiments of the present invention are applicable to various types of networks, such as a Wireless Sensor Network (WSN) or a Mesh network.
  • the obtained information may be information that has high reliability requirements in the network, such as alarm information or other reporting information, or information transmitted between any two nodes in the network.
  • the WSN consists of a large number of inexpensive micro sensor nodes deployed in the monitoring area.
  • Each sensor node integrates a sensor device, a data processing unit and a communication module, and has certain communication and calculation. And storage capacity.
  • These sensor nodes are capable of sensing physical information such as temperature, humidity, light intensity, pressure, soil composition, size, speed and direction of moving objects in the surrounding environment.
  • these sensor nodes may be ordinary nodes or routing nodes, and these nodes have the function of monitoring the surrounding environment. Therefore, the alarm information can be generated either by a normal node or by a routing node.
  • the alarm information is sent by the source routing node and can be reported to a network node such as a specific target node, aggregation node, or information gathering node.
  • the generation of the alarm information may be based on a certain strategy, for example: the absolute value of a monitored value of the node is greater than a certain threshold, or the difference between the two monitored values is greater than a certain threshold to generate an alarm message. If the alarm information is generated by a common node, since the ordinary node does not prepare the routing capability, the ordinary node sends the alarm information to the routing node to which it belongs, and the routing node sends the alarm information.
  • the routing node When the routing node obtains the alarm information sent by the managed ordinary node or generates the alarm information by itself, the routing node acts as the source routing node, and sets the destination address of the alarm information as the broadcast address (OxFFFF), and the broadcast radius is set to the first Broadcast radius.
  • the broadcast radius is in units of hops, for example: the broadcast radius is 1 hop or 2 hops, and the broadcast radius is set at a specific position of the transmitted data frame frame header.
  • the broadcast radius may be specifically set according to different network types and different application scenarios in various networks or other specific situations.
  • the alarm information is broadcasted by broadcast within the radius of the broadcast. Specifically, after setting the broadcast address and the broadcast radius, the source routing node broadcasts the alarm information to the neighboring routing nodes.
  • the neighboring routing node After receiving the alarm information as an intermediate node, the neighboring routing node transmits the alarm information to the surrounding neighboring routing nodes according to the destination address of the alarm information, or determines the next destination according to the destination address of the alarm information.
  • the routing node is hopped, and the alarm information is forwarded unicast according to the original routing mechanism.
  • the destination address information in the alarm information is added to the alarm information frame when the alarm information is generated.
  • the original routing mechanism may be an on-demand routing mode or a gradient routing mode.
  • the original routing mode is usually a single path, but the original routing mode is usually a single path. Since the alarm information is first broadcasted in the unicast transmission mode, multiple paths are reached to the destination node.
  • the routing and forwarding method provided by the embodiment of the present invention broadcasts the information to the neighboring node when the source node obtains the information, and after receiving the broadcast information of the previous node, the intermediate node still sends the information in a broadcast manner, or according to the destination address of the information.
  • the information is forwarded unicast according to the original routing mechanism. Improve the timeliness and reliability of information transmission and ensure low energy consumption of the network.
  • FIG. 4 is a flowchart of a route forwarding method according to another embodiment of the present invention. As shown in FIG. 4, the method includes:
  • S402 Determine, according to the destination address of the information, a next hop node.
  • S403 Forward the information to the next hop node by using unicast transmission.
  • the information broadcasted by the previous node is also described as the alarm information, and the alarm information can be generated by the ordinary node or by the routing node. Therefore, the alarm information acquired by the source routing node may be generated by the managed common node, or may be generated by self-monitoring.
  • the alarm information is sent by the source routing node and can be sent to a specific target node, aggregation point or information collection point.
  • the source routing node After obtaining the alarm information, the source routing node sets the destination address of the alarm information as the broadcast address (OxFFFF), and sets the broadcast radius to the first broadcast radius at a specific position of the transmitted data frame header, and the broadcast radius is in units of hops. It can be set according to different application scenarios in different networks and the specific conditions of the application.
  • the alarm information is broadcast to neighboring routing nodes.
  • the intermediate routing node After receiving the alarm information broadcast by the previous node, the intermediate routing node transmits the alarm information to the surrounding neighboring routing nodes according to the destination address of the alarm information, or according to the report.
  • the destination address of the police information determines the next hop routing node, and unicasts the alarm information according to the original routing mechanism.
  • the source node broadcasts the obtained information to the neighboring node.
  • the intermediate node After receiving the broadcast information of the previous node, the intermediate node still sends the information in a broadcast manner, or determines the next hop according to the destination address of the information.
  • the node, and the original routing mechanism unicast forwarding information.
  • the first unicast transmission method improves the timeliness and reliability of information transmission and ensures low energy consumption of the network.
  • FIG. 5 is a flowchart of a route forwarding method according to another embodiment of the present invention. As shown in FIG. 5, the method includes:
  • the information obtained by the source node may be information generated by the source node or a common node managed by the source node, such as alarm information, or may be information that the source routing node or the managed common node needs to send to other nodes in the network.
  • a destination address of the information as a broadcast address, and set a broadcast radius to a first broadcast radius.
  • the destination address of the information is set as a broadcast address (OxFFFF), in the frame of the transmitted data frame.
  • the broadcast radius is set to the first broadcast radius at a specific location, and the broadcast radius is set in units of hops, which may be set according to different application scenarios of different networks and specific conditions of the application.
  • the source routing node sets the frame type in the network layer frame type sub-domain according to the type of the information, so that the intermediate routing node can obtain the frame type of the information after receiving the information, thereby The specific transmission method corresponding to the frame type is transmitted. For example: If the information is alarm information, the source routing node sets the frame type in the network layer frame type subfield to an alarm frame after generating the alarm information, and after receiving the information, the intermediate routing node is from the network layer frame type subfield. The information obtained in the frame type is alarm information, and thus is transmitted according to the transmission mode of the alarm frame.
  • the ordinary node after generating the information, the ordinary node first sets the frame type in the network layer frame type sub-domain according to the type of the information, and then sends the information to the associated routing node. After receiving the information sent by the ordinary node, the source routing node learns the type of the information through the frame type in the network layer frame type subfield.
  • S502 and S503 are not in sequential order, and the source routing node only needs to broadcast a message to the neighboring routing node. Do this before you can.
  • S504 Broadcast information to the neighboring routing node.
  • the source routing node After the source routing node sends the information, if the information arrives at the destination node smoothly, the destination node sends a confirmation message about the receipt of the information to the source routing node after receiving the information. However, the information may be lost during transmission, or the destination node may not discover the information in time. In this case, the source routing node will not receive the confirmation of the receipt of the information. In order to improve the timeliness of information transmission and reduce network delay, the source routing node can re-issue information.
  • the source routing node can reset the broadcast radius to The second broadcast radius re-broadcasts the information within the range of the second broadcast radius, and unicasts the information according to the destination address information of the information and the original routing mechanism outside the range of the second broadcast radius.
  • the second broadcast radius needs to be larger than the first broadcast radius of the previously transmitted information, that is, the source routing node further expands the broadcast range of the information to increase the reliability of the information transfer.
  • the intermediate routing node After receiving the information with the broadcast radius of the second broadcast radius, the intermediate routing node broadcasts the information again or determines the next hop node according to the destination address, and unicasts the information, and the process is related to receiving the information that the broadcast radius is the first broadcast radius. Similar, no longer repeat them.
  • the routing and forwarding method provided by the embodiment of the present invention, when the source node obtains the information, sets a certain broadcast radius to broadcast the information to the neighboring node, and after receiving the broadcast information of the previous node, the intermediate node broadcasts the information in a broadcast manner, or The next hop node is determined according to the destination address, and the information is unicasted according to the original routing mechanism.
  • the method of broadcasting first and then broadcasting improves the timeliness and reliability of the route and ensures the low energy consumption of the network. If the source node does not receive the acknowledgement message within a certain period of time, the source node expands the broadcast radius and transmits the broadcast transmission information again to increase the reliability of the information transmission and reduce the delay.
  • FIG. 6 is a flowchart of a route forwarding method according to still another embodiment of the present invention. As shown in FIG. 6, the method includes:
  • the information broadcast by the previous routing node may be information generated by a common node managed by the source node, or information generated by the source node itself, or information sent by the source routing node or the managed common node to other nodes in the network.
  • the intermediate node receives the frame broadcast by the previous routing node, and the frame includes the information;
  • the source routing node After obtaining the information, the source routing node sets the destination address of the information as the broadcast address (OxFFFF), and sets the broadcast radius to the first broadcast radius at a specific position of the transmitted data frame header.
  • the broadcast radius is in units of hops. Different application scenarios of different networks and specific conditions of the application are set.
  • the intermediate routing node When the intermediate routing node receives a certain information for the first time, it needs to record related information of the information, and the related information may be the source node information that sends the information and the sending serial number of the information at the source node, and may also Other relevant information that can distinguish this information from other information.
  • the intermediate node can uniquely determine a certain piece of information through relevant information. Therefore, the intermediate routing node determines whether the information related to the information has been received according to the information about the information. If the intermediate routing node has received the information, the subsequent received information is discarded to avoid the broadcast or unicast forwarding of the information, thereby saving network resources.
  • the destination address of the judgment information is a unicast address or a broadcast address; if it is a unicast address, execute S610; if it is a broadcast address, execute S606;
  • the broadcast radius is reduced by 1;
  • the frame type is changed from broadcast to unicast.
  • each intermediate node needs to view the destination address of the information when receiving the information. If the destination address is already a unicast address, the information is described. At least one intermediate node has passed, that is, it has passed the broadcast radius Broadcast transmission. In this case, the intermediate node that receives the unicast address unicasts the information according to the destination address information in the information and according to the original routing mechanism. If the destination address of the received information is a broadcast address, the intermediate node further determines whether the broadcast transmission information or the unicast transmission information is based on the broadcast radius.
  • the intermediate routing node determines whether the broadcast radius is greater than 0, and if the neighboring node is still within the broadcast radius, the information is broadcast to the neighboring node. If it is equal to 0, it indicates that the neighboring node is outside the broadcast radius, and the destination address of the information is set to unicast, and the information is forwarded unicast according to the destination address in the information and according to the original routing mechanism.
  • the source routing node may reset the broadcast radius to the second broadcast radius, and re-broadcast the information within the range of the second broadcast radius, outside the range of the second broadcast radius.
  • the destination address information in the information determines the next hop node, and the original routing mechanism unicasts the information.
  • the second broadcast radius needs to be larger than the first broadcast radius of the previously transmitted information, that is, the source routing node further expands the broadcast range of the information, thereby increasing the reliability of the information transmission.
  • the intermediate node After receiving the information that the broadcast radius is the second broadcast radius, the intermediate node still performs the steps of S601 ⁇ S610, and details are not described herein.
  • the routing and forwarding method provided by the embodiment of the present invention, when the source node obtains the information, sets a certain broadcast radius to broadcast the information to the neighboring node, and after receiving the broadcast information of the previous node, the intermediate node broadcasts the information in a broadcast manner, or The next hop node is determined according to the destination address, and the information is forwarded unicast according to the original routing mechanism.
  • the intermediate node also discards subsequent information with the same information to avoid the intermediate node repeatedly transmitting the information, thereby reducing network energy consumption.
  • the method of broadcasting first and then broadcasting improves the reliability and timeliness of the route. If the source node does not receive the reply message within a certain period of time, the broadcast radius is expanded and the information is sent again to increase the reliability of the information transmission and reduce the delay.
  • the common node s monitors the information in the responsible area.
  • the node s transmits the alarm information to the routing node A to which it belongs.
  • the routing node A is the source routing node.
  • the node type sets the frame type as an alarm frame in the network layer frame type subfield. Assuming that node A sets the broadcast radius to one hop, node A immediately broadcasts this alarm information to the neighboring routing nodes (B, C, D, E).
  • each intermediate node can record the alarm information that has been received within a certain period of time, and can uniquely identify the alarm information by the source node address that generates the alarm and the transmission sequence number at the source node. If the intermediate node receives multiple alarm information, it discards the subsequently received alarm information, such as the pictorial path to point A and point F in the figure, which can effectively avoid the excessive energy caused by flooding caused by flooding. Consumption.
  • the final alarm message will arrive at the destination node L along multiple paths.
  • the foregoing program may be stored in a computer readable storage medium, and the program is executed when executed.
  • the foregoing steps include the steps of the foregoing method embodiments; and the foregoing storage medium includes: a medium that can store program codes, such as a ROM, a RAM, a magnetic disk, or an optical disk.
  • FIG. 9 is a schematic structural diagram of a routing node according to an embodiment of the present invention.
  • the intermediate routing node includes: an obtaining module 91, a determining module 92, and a sending module 93;
  • the obtaining module 91 is configured to obtain information broadcast by the previous routing node, and the determining module 92 is configured to determine a next hop node according to the destination address of the information acquired by the obtaining module 91.
  • the sending module 93 is configured to send the unicast The way forwards the information to the next hop node determined by the determination module 92.
  • the destination address of the information is set to the broadcast address (OxFFFF).
  • the broadcast radius is set to the first broadcast radius at a specific position of the transmitted data frame header, and the broadcast radius is in units of hops.
  • the broadcast radius may be set according to different application scenarios of different networks and application specific conditions.
  • the source routing node After the source routing node sets the broadcast address and the broadcast radius, it broadcasts the information to neighboring routing nodes.
  • the neighboring routing node is the intermediate routing node
  • the obtaining module 91 of the intermediate routing node receives the information
  • the determining module 92 determines the next hop node according to the destination address information
  • the sending module 93 follows the original routing mechanism in the information. The node unicasts the information. If the destination address of the message is still a broadcast address, the transmitting module 93 continues to broadcast the message to the neighboring routing node.
  • the method for forwarding the route may refer to the foregoing routing forwarding method embodiment.
  • the routing node provided by the embodiment of the present invention broadcasts the information after receiving the information broadcast by the previous routing node, or determines the next hop node according to the destination address, and unicasts the information to the next hop node.
  • the method of broadcasting the unicast first improves the timeliness and reliability of information transmission, and ensures the low energy consumption of the network.
  • the routing node includes: an obtaining module 91, a determining module 92, and a sending module 93;
  • the obtaining module 91 is configured to obtain information broadcast by the previous routing node, and the determining module 92 is configured to determine a next hop node according to the destination address of the information acquired by the obtaining module 91.
  • the sending module 93 is configured to send the unicast The way forwards the information to the next hop node determined by the determination module 92.
  • the determining module 92 can include:
  • the determining unit 921 is configured to determine the destination address type of the information acquired by the obtaining module 91.
  • the processing unit 922 is configured to determine the next hop node if the determining unit 921 determines that the destination address is a unicast address;
  • the determining unit 921 determines that the destination address is a broadcast address, the determining unit 921 is further configured to determine whether the broadcast radius is greater than 0 after subtracting the broadcast radius by one;
  • the sending module 93 is further used to broadcast information; if the determining unit 921 determines that the broadcast radius is equal to 0, the processing unit 922 is further configured to determine the next hop node.
  • the routing node can also include:
  • the recording module 94 is configured to record related information of the information acquired by the obtaining module 91, where the related information is used to distinguish the information from other information;
  • the deleting module 95 is configured to discard another information if the acquiring module 91 receives another information related to the information in the set time;
  • the obtaining module 91 is specifically configured to receive a frame broadcast by the previous routing node, and the frame includes information.
  • the sending module 93 is specifically configured to change the type of the frame from broadcast to unicast, and unicast the frame to the next hop node.
  • the information obtained by the obtaining module 91 may be information generated by a common node managed by the source routing node, or information generated by the source routing node itself, or may be sent by the source routing node or the managed common node to other nodes in the network. information.
  • the source routing node sets the destination address of the information as the broadcast address (OxFFFF), and sets the broadcast radius to the first broadcast radius at a specific position of the transmitted data frame header.
  • the broadcast radius is in units of hops. Different application scenarios of different networks and specific conditions of the application are set.
  • the source routing node sets the frame type in the network layer frame type sub-domain according to the type of the information, so that the intermediate routing node can obtain the data frame type after receiving the information, and accordingly, according to the frame type.
  • the specific transmission method is transmitted.
  • the recording module 94 After the obtaining module 91 receives the certain information for the first time, the recording module 94 records the related information of the information to uniquely determine the information. When the obtaining module 91 receives another information with the same information again, the deleting module 95 performs the same. Discard the processing to avoid broadcasting or unicast forwarding information again, thereby saving network resources.
  • a plurality of intermediate nodes may be routed, and when the obtaining module 91 of each intermediate node receives the information, the determining unit 921 needs to determine the destination address of the information, if the purpose If the address is already a unicast address, it indicates that the information has passed at least one intermediate node, that is, the broadcast transmission within the range of the broadcast radius has elapsed. In this case, the processing unit 922 determines the next hop node according to the destination address, and sends the information. Module 93 unicasts the information to the next hop node.
  • the determination unit 921 determines whether the broadcast transmission information or the unicast transmission information is based on the broadcast radius. Specifically, the determining unit 921 determines whether the broadcast radius is greater than 0 by reducing the broadcast radius by one, and if the neighboring node is still within the broadcast radius, the information is broadcast to the adjacent node. If it is equal to 0, it indicates that the neighboring node is outside the broadcast radius, and the sending module 93 changes the frame type of the information from broadcast to unicast, and according to the original The routing mechanism forwards the information unicast to the next hop node.
  • the source routing node may reset the broadcast radius to the second broadcast radius, re-broadcast the information within the range of the second broadcast radius, and press outside the range of the second broadcast radius. The original routing mode of the information unicasts the information to the next hop node.
  • the second broadcast radius needs to be larger than the first broadcast radius of the previously sent information, that is, the source routing node further expands the broadcast range of the information, thereby increasing the reliability of the information transmission.
  • the routing node when the source node obtains information, sets a certain broadcast radius to broadcast information to the neighboring node, and after receiving the broadcast information of the previous node, the intermediate node broadcasts the information in a broadcast manner, or according to the purpose.
  • the address determines the next hop node and forwards the information unicast according to the original routing mechanism.
  • the intermediate node also discards the subsequent information with the same information to avoid the intermediate node repeatedly transmitting the information, which reduces the network energy consumption.
  • the method of broadcasting first and then broadcasting improves the reliability and timeliness of the route. If the source node does not receive the reply message within a certain period of time, the broadcast radius is expanded and the information is sent again to increase the reliability of the information transmission and reduce the delay.
  • FIG. 11 is a schematic structural diagram of a wireless communication network according to an embodiment of the present invention. As shown in FIG. 11, the wireless communication network includes multiple routing nodes.
  • the first routing node in the routing node is used to broadcast information.
  • the second routing node of the routing node is configured to obtain the information broadcast by the first routing node, determine a next hop node according to the destination address of the information, and forward the manner by using unicast transmission. Information to the next hop node.
  • the wireless communication network may be various types of networks such as a WSN or a Mesh network, and the information may be reported by a common node or a routing node in the wireless sensor network, such as alarm information; or may be an ordinary node or a routing node. Information passed by other nodes in the network.
  • the first node is the source routing node 1 and the second node is the intermediate routing node 2 as an example. Of course, the first node may also be an intermediate routing node 2 that broadcasts information.
  • the information is sent by the source routing node 1, after passing through multiple intermediate routing nodes 2, and finally reaches a specific A network node such as a target node, aggregation point, or information collection point.
  • the source routing node 1 obtains the information sent by the managed ordinary node, or the routing node itself generates the information by monitoring, and sets the destination address of the information to the broadcast address (OxFFFF), and the broadcast radius is set to the first broadcast radius.
  • the broadcast radius is in units of hops, for example: 1 hop or 2 hops, and the broadcast radius is set at a specific position of the transmitted data frame header.
  • the broadcast radius may be different according to different application scenarios of different networks and applications. Specific conditions to set.
  • the source routing node 1 After setting the broadcast address and the broadcast radius, the source routing node 1 broadcasts the information to neighboring routing nodes. After receiving the information as the intermediate routing node 2, the neighboring routing nodes still transmit the information to the surrounding neighboring routing nodes by means of broadcast, or determine the next hop node according to the destination address, and follow the original routing mechanism. Broadcast to forward this information.
  • the wireless sensor network provided by the embodiment of the present invention broadcasts the information to the neighboring node when the source node acquires the information, and after receiving the broadcast information of the previous node, the intermediate node still sends the information in a broadcast manner, or according to the destination address of the information.
  • the information is forwarded unicast according to the original routing mechanism. Improve the timeliness and reliability of information transmission and ensure low energy consumption of the network.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Description

路由转发方法、 路由节点及无线通信网络
本申请要求于 2010年 7月 8日提交中国专利局、申请号为 201010225202.8、 发明名称为"路由转发方法、路由节点及无线通信网络,,的中国专利申请的优先 权, 其全部内容通过引用结合在本申请中。 技术领域
本发明涉及通信技术领域,特别涉及一种路由转发方法、路由节点及无线 通信网络。 背景技术
随着网络技术的发展, 在各种类型网络的具体应用中, 对于数据传输的 实时性和可靠性都有着较高的要求。
现有技术的一种洪泛路由转发方法, 源节点将数据副本传送给每一个邻 居节点,每个邻居节点再将数据传送给各自的除发送数据的节点以外的其他节 点, 直到数据传送至目标节点或者设定的数据生存时间为零为止。这种洪泛路 由方法易导致广播风暴, 产生严重的丟包现象, 并且网络能耗过大。
现有技术的一种按需路由转发方法, 釆用自组织网络按需矢量 (Ad-hoc On-Demand Distance Vector ; 以下简称: AOD V )协议, 源节点需要和目的节 点通信时, 如果在路由表中已经存在了对应的路由, 则直接进行数据传输。 当 源节点需要和新的目的节点通信时, 则源节点会发起路由发现过程,通过广播 路由请求信息来查找相应路由, 参见图 1A。 当路由请求信息到达目的节点本 身, 或者具有目的节点路由的中间节点时, 目的节点和中间节点通过原路返回 一个路由回复信息来向源节点确定路由的可用性, 参见图 1B。 这种按需方法 具有一定的时延, 无法保证信息及时传递到目的节点。
现有技术的一种混合路由转发方法, 参见图 2, sink节点为目的节点, 目 的节点广播梯度扩散信息,各路由节点接收到梯度扩散信息后分别建立至目的 节点的路由并进行周期性更新。 目的节点周期性广播拓朴更新消息, 获取全网 拓朴信息。其他路由节点维护所有梯度小于自身可达目的节点的下一跳路由表 项。 这种混合路由方法中, 扩散半径内的路由为树状结构, 这种结构会因节点 移动、节点死亡等因素而造成路由失效,一旦路由失效则所有通过此节点的信 息将会全部丟失, 因此可靠性不高。且这种方法选取的路径不一定为最短时延 路径, 无法保证信息传递的及时性。 发明内容
本发明实施例提供一种路由转发方法、路由节点及无线通信网络, 用以提 高源节点到目的节点的信息传递的及时性和可靠性。
一方面, 本发明实施例提供一种路由转发方法, 包括:
获取前一路由节点广播的信息;
判断所述信息的目的地址的类型;
若所述目的地址为广播地址,则将广播半径减 1之后判断所述广播半径是 否大于 0;
若所述广播半径大于 0, 则广播所述信息;
若所述广播半径等于 0, 则确定下一跳节点, 并釆用单播发送的方式转发 所述信息至所述下一跳节点。
另一方面, 本发明实施例提供一种路由节点, 包括:
获取模块, 用于获取前一路由节点广播的信息;
确定模块, 包括: 判断单元和处理单元; 所述判断单元, 用于判断所述获 取模块获取的所述信息的目的地址类型,若所述目的地址为广播地址, 则将广 播半径减 1后判断所述广播半径是否大于 0; 所述处理单元, 用于若所述判断 单元判断出所述广播半径等于 0, 则确定下一跳节点;
所述发送模块, 用于在所述处理单元确定下一跳节点后, 釆用单播发送的 方式转发所述信息至所述确定模块确定的下一跳节点;所述发送模块还用于若 所述判断单元判断出所述广播半径大于 0, 则广播所述信息。
本发明实施例还提供了一种无线通信网络, 包括多个路由节点; 所述多个路由节点中的第一路由节点用于广播信息;
所述多个路由节点中的第二路由节点用于获取所述第一路由节点广播的 信息; 判断所述信息的目的地址的类型; 若所述目的地址为广播地址, 则将广 播半径减 1之后判断所述广播半径是否大于 0; 若所述广播半径大于 0, 则广 播所述信息; 若所述广播半径等于 0 , 则确定下一跳节点, 并釆用单播发送的 方式转发所述信息至所述下一跳节点。
本发明实施例提供的路由转发方法、路由节点及无线通信网络, 网络中的 路由节点收到前一路由节点广播的信息后,广播该信息或根据目的地址确定下 一跳节点, 向下一跳节点单播转发此信息。在源节点向目的节点发送信息的过 程中,先广播后单播的方式提高了信息传递的及时性和可靠性,保证了网络的 低能耗。 附图说明
为了更清楚地说明本发明实施例或现有技术中的技术方案,下面将对实施 例或现有技术描述中所需要使用的附图作简单地介绍,显而易见地, 下面描述 中的附图仅仅是本发明的一些实施例,对于本领域普通技术人员来讲,在不付 出创造性劳动性的前提下, 还可以根据这些附图获得其他的附图。
图 1 A为现有按需路由转发方法的源节点路由发现流程图;
图 1B为现有按需路由转发方法的目的节点和中间节点路由发现流程图; 图 2为现有混合路由转发方法的网络结构示意图;
图 3为本发明一个实施例提供的路由转发方法流程图;
图 4为本发明又一个实施例提供的路由转发方法流程图;
图 5为本发明另一个实施例提供的路由转发方法流程图;
图 6为本发明再一个实施例提供的路由转发方法流程图;
图 7为本发明实施例广播半径为 1跳时的网络结构示意图;
图 8为本发明实施例广播半径为 2跳时的网络结构示意图;
图 9为本发明一个实施例提供的路由节点结构示意图;
图 10为本发明又一个实施例提供的路由节点结构示意图;
图 11为本发明一个实施例提供的无线通信网络结构示意图。 具体实施方式
下面将结合本发明实施例中的附图,对本发明实施例中的技术方案进行清 楚、 完整地描述, 显然, 所描述的实施例仅仅是本发明一部分实施例, 而不是 全部的实施例。基于本发明中的实施例,本领域普通技术人员在没有作出创造 性劳动前提下所获得的所有其他实施例, 都属于本发明保护的范围。
图 3为本发明一个实施例提供的路由转发方法流程图,如图 3所示,该方 法包括:
S301、 获取信息, 将信息的目的地址设为广播地址, 广播半径设置为第一 广播半径;
S302、 向相邻路由节点广播信息。
本发明实施例适用于多种类型的网络,如无线传感器网络(Wireless Sensor Network, 简称: WSN )或 Mesh网络等。 获取的信息可以为网络中对可靠性 要求比较高的信息, 例如报警信息或其他上报信息等,也可以为网络中任意两 个节点间传送的信息。
以 WSN网络中传递报警信息为例, WSN中由大量廉价的部署在监测区 域内的微型传感器节点组成,每个传感器节点都集成了传感器件、数据处理单 元和通信模块, 具有一定的通信、 计算和存储能力。 这些传感器节点能够感知 周边环境中的温度、 湿度、 光强度、 压力、 土壤成分, 移动物体的大小、 速度 和方向等物理信息。 在 WSN中, 这些传感器节点可能是普通节点, 也可能是 路由节点, 这些节点均具有监测周围环境的作用。 因此, 报警信息既可以由普 通节点产生, 也可以由路由节点产生。 报警信息由源路由节点发出, 可上报给 特定的目标节点、 汇聚节点或信息釆集节点等网络节点。
报警信息的产生可以基于一定的策略, 例如: 节点的某项监测值的绝对值 大于某一阔值, 或两次监测值之差大于某一阔值时即可产生报警信息。如果报 警信息由普通节点产生, 由于普通节点不预备路由能力, 则普通节点将 警信 息发送给所属的路由节点, 由路由节点将报警信息发送出去。
当路由节点获得所管理的普通节点发送的报警信息或自身通过监测产生 报警信息后, 该路由节点作为源路由节点,将报警信息的目的地址设为广播地 址(OxFFFF ), 广播半径设置为第一广播半径。 其中, 广播半径以跳为单位, 例如: 广播半径为 1跳或 2跳等, 广播半径设置在传输的数据帧帧头的特定位 置处。其中, 广播半径具体可以根据不同的网络类型以及各种网络中不同的应 用场景或其他具体情况来设置。 报警信息在广播半径范围内釆用广播方式传播。具体的, 源路由节点设置 广播地址和广播半径后, 向周围相邻的路由节点广播该报警信息。周围相邻的 路由节点作为中间节点接收到该报警信息后,根据报警信息的目的地址, 仍釆 用广播的方式向周围相邻路由节点传送该报警信息,或者根据报警信息的目的 地址确定下一跳路由节点, 并按原有的路由机制单播转发该报警信息。 其中, 报警信息中的目的地址信息为报警信息产生时添加在报警信息帧中的,原有的 路由机制通常可以为按需路由方式、梯度路由方式等,原有路由方式通常为单 一路径,但由于报警信息釆用先广播在单播的发送方式, 实现多条路径到达目 的节点。
本发明实施例提供的路由转发方法, 当源节点获取信息时, 向邻居节点广 播该信息, 中间节点收到前一节点的广播信息后, 仍以广播方式发送该信息, 或根据信息的目的地址按原有的路由机制单播转发信息。提高了信息传递的及 时性和可靠性, 并保证了网络的低能耗。
图 4为本发明又一个实施例提供的路由转发方法流程图, 如图 4所示, 该 方法包括:
5401、 获取前一路由节点广播的信息;
5402、 根据所述信息的目的地址, 确定下一跳节点;
5403、 釆用单播发送的方式转发所述信息至所述下一跳节点。
仍以前一路节点广播的信息为报警信息进行说明,报警信息既可以由普通 节点产生, 也可以由路由节点产生。 因此, 源路由节点获取的报警信息可能是 所管理的普通节点产生,也可能是自身监测产生。报警信息由源路由节点发出, 可上 ^艮给特定的目标节点、 汇聚点或信息釆集点等网络节点。
源路由节点获得报警信息后, 将报警信息的目的地址设为广播地址 ( OxFFFF ), 在传输的数据帧帧头的特定位置处设置广播半径为第一广播半 径, 广播半径以跳为单位, 具体可根据不同网络中的不同的应用场景以及应用 的具体情况来设置。
源路由节点设置广播地址和广播半径后,向周围相邻的路由节点广播该报 警信息。 中间路由节点接收到前一节点广播的报警信息后,根据报警信息的目 的地址,仍釆用广播的方式向周围相邻路由节点传送该报警信息,或者根据报 警信息的目的地址确定下一跳路由节点,并按照原有的路由机制单播转发该报 警信息。
本发明实施例提供的路由转发方法, 源节点向邻居节点广播获取的信息, 中间节点收到前一节点的广播信息后, 仍以广播方式发送该信息,或根据信息 的目的地址确定下一跳节点, 并原有路由机制单播转发信息。先广播后单播的 传输方式提高了信息传递的及时性和可靠性, 并保证了网络的低能耗。
图 5为本发明另一个实施例提供的路由转发方法流程图, 如图 5所示, 该 方法包括:
5501、 获取信息;
源节点获取的信息可能为源节点或源节点所管理的普通节点产生的信息, 例如报警信息,还可以是源路由节点或所管理的普通节点需要向网络中其他节 点发送的信息。
5502、 将信息的目的地址设为广播地址, 广播半径设置为第一广播半径; 源路由节点获得信息后, 将该信息的目的地址设为广播地址 (OxFFFF ), 在传输的数据帧帧头的特定位置处设置广播半径为第一广播半径,广播半径以 跳为单位,具体可以根据不同网络的不同的应用场景以及应用的具体情况来设 置。
S503、 根据信息的类型设置网络层帧类型子域中的帧类型;
若信息为源路由节点自身产生的信息,则源路由节点根据信息的类型设置 网络层帧类型子域中的帧类型, 以便中间路由节点接收到信息后, 能够获知信 息的帧类型, 从而根据该帧类型对应的特定传输方式进行传输。 例如: 如果信 息为报警信息,则源路由节点在产生报警信息后将网络层帧类型子域中的帧类 型设置为报警帧, 中间路由节点接收到信息后, 从网络层帧类型子域中的帧类 型中获知信息为报警信息, 从而按照报警帧的传输方式进行传输。
需要说明的是, 如果信息由普通节点产生, 则普通节点在产生信息后, 首 先根据信息的类型设置网络层帧类型子域中的帧类型,再将信息发送给所属的 路由节点。 源路由节点接收到普通节点发送的信息后,通过网络层帧类型子域 中的帧类型获知信息的类型。
S502和 S503并没有先后顺序,源路由节点只要在向相邻路由节点广播信 息之前完成上述操作即可。
5504、 向相邻路由节点广播信息;
5505、 在设定时间内是否接收到信息的接收确认信息; 是, 则流程结束; 否则执行 S506;
S506、将信息的广播半径更改为第二广播半径, 第二广播半径大于第一广 播半径; 执行 S504。
源路由节点在发出信息后,如果信息顺利到达目的节点, 则目的节点在收 到信息后,会向源路由节点发出关于信息的接收确认信息。但信息在传输过程 中可能丟失, 或者目的节点没有及时发现信息, 在这种情况下, 源路由节点不 会接收到信息的接收确认信息。 为了提高信息传输的及时性, 减小网络时延, 源路由节点可以重新发出信息。 具体是: 如源路由节点在一定的时间内没有收 到信息的接收确认信息,很可能是信息并未到达目的节点, 或目的节点并未及 时发现信息, 那么源路由节点可以重新设置广播半径为第二广播半径, 在第二 广播半径的范围内重新广播信息,在第二广播半径的范围外根据信息的目的地 址信息、 按原有路由机制单播转发信息。 其中, 第二广播半径需大于在先发送 的信息的第一广播半径, 即源路由节点进一步扩大信息的广播范围, 以增加信 息传递的可靠性。
中间路由节点收到广播半径为第二广播半径的信息后,再次广播信息或根 据目的地址确定下一跳节点, 并单播转发信息, 该过程与收到广播半径为第一 广播半径的信息相类似, 不再赘述。
本发明实施例提供的路由转发方法, 当源节点获取信息时,设置一定的广 播半径向邻居节点广播该信息, 中间节点收到前一节点的广播信息后, 仍以广 播方式广播该信息, 或根据目的地址确定下一跳节点, 并按原有路由机制单播 转发信息。先广播后单播的方式提高了路由的及时性和可靠性, 并保证了网络 的低能耗。 若源节点在一定时间内没收到接收确认信息, 则源节点扩大广播半 径, 再次发送广播发送信息, 以增加信息传递的可靠性, 并减少时延。
图 6为本发明再一个实施例提供的路由转发方法流程图, 如图 6所示, 该 方法包括:
S601、 获取前一路由节点广播的信息; 前一路由节点广播的信息可以为源节点所管理的普通节点产生的信息,或 源节点自身监测产生的信息,或者是源路由节点或所管理的普通节点需要向网 络中其他节点发送的信息。 中间节点接收前一路由节点广播的帧, 帧内包括该 信息;
源路由节点获得信息后, 将信息的目的地址设为广播地址(OxFFFF ), 在 传输的数据帧帧头的特定位置处设置广播半径为第一广播半径,广播半径以跳 为单位, 具体可以根据不同网络的不同的应用场景以及应用的具体情况来设 置。
5602、 是否收到过相关信息相同的信息; 是, 则执行 S603; 否, 则执行 S604;
5603、 丟弃该信息;
5604、 对该信息的相关信息进行记录;
中间路由节点在第一次收到某一信息时, 要对该信息的相关信息进行记 录,这些相关信息可能是发出该信息的源节点信息以及该信息在源节点处的发 送序列号,还可以是其他一些能够使该信息区别于其他信息的相关信息。 中间 节点可以通过相关信息唯一地确定某一信息。 因此, 中间路由节点根据信息的 相关信息判断是否已经接收过相关信息相同的信息, 若接收过, 则丟弃后续接 收到的信息, 以避免再次将信息进行广播或单播转发, 节省网络资源。
5605、 判断信息的目的地址为单播地址或广播地址; 若为单播地址, 则执 行 S610; 若为广播地址, 则执行 S606;
5606、 将广播半径减 1 ;
5607、 判断广播半径是否大于 0; 是, 则执行 S608; 否, 则执行 S609;
5608、 向相邻节点广播信息;
5609、 将信息的目的地址设置为单播;
即将帧类型由广播改为单播。
S610、 根据目的地址单播转发信息。
在信息从源路由节点到目的节点的过程中,可能途径多个中间节点,每个 中间节点在收到信息时, 需查看信息的目的地址,如果目的地址已经为单播地 址, 则说明该信息至少已经经过一个中间节点, 即已经经过了广播半径范围内 的广播传输, 这种情况下, 收到单播地址的中间节点根据信息中的目的地址信 息、 按原路由机制单播转发该信息。 如果收到的信息的目的地址为广播地址, 则中间节点进一步根据广播半径判断广播发送信息还是单播发送信息。具体可 以为: 中间路由节点将广播半径减 1后判断广播半径是否大于 0,如果大于 0, 则说明相邻节点仍在广播半径范围内, 则向相邻节点广播信息。 如果等于 0, 则说明相邻节点在广播半径范围外, 则将信息的目的地址设置为单播, 并根据 信息中的目的地址、 按原有的路由机制单播转发信息。
另外, 源路由节点在发出信息后, 如果该信息顺利到达目的节点, 则目的 节点在收到该信息后,会向源路由节点发出关于该信息的接收确认信息。但该 信息在传输过程中可能丟失,或者目的节点没有及时发现该信息,这种情况下, 源路由节点不会接收到该信息的接收确认信息。 为了提高信息传输的及时性, 减小网络时延, 源路由节点可以重新设置广播半径为第二广播半径,在第二广 播半径的范围内重新广播该信息,在第二广播半径的范围外根据该信息中的目 的地址信息确定下一跳节点, 并原有路由机制单播转发信息。 其中, 第二广播 半径需大于在先发送的信息的第一广播半径,即源路由节点进一步扩大信息的 广播范围, 增加信息传递的可靠性。
中间节点收到广播半径为第二广播半径的信息后, 仍执行 S601~ S610的 步骤, 不再赘述。
本发明实施例提供的路由转发方法, 当源节点获取信息时,设置一定的广 播半径向邻居节点广播该信息, 中间节点收到前一节点的广播信息后, 仍以广 播方式广播该信息, 或根据目的地址确定下一跳节点, 并按原有路由机制单播 转发该信息。 中间节点还将相关信息相同的后续信息丟弃, 以避免中间节点重 复发送该信息,减少了网络能耗。先广播后单播的方式提高了路由的可靠性和 及时性。 若源节点在一定时间内没收到回复信息, 则扩大广播半径, 再次发送 该信息, 以增加信息传递的可靠性, 并减少时延。
以下举出一个具体例子:
以 WSN中发送 警信息为例, 参见图 7: 在 WSN中, 普通节点 s监测 负责区域内的信息, 当普通节点 s根据监测情况产生报警信息后, 由于普通节 点不具备路由能力, 因此, 普通节点 s将报警信息传送至所属路由节点 A, 该 路由节点 A即为源路由节点, 节点 A得知此信息为报警信息后, 在网络层帧 类型子域中将帧类型设为报警帧。假设节点 A将广播半径设为一跳,则节点 A 立即向相邻路由节点 (B、 C、 D、 E ) 广播此 4艮警信息。
邻居路由节点 B、 C、 D、 E接收到该报警信息后, 由于其广播半径为 1 跳, 于是 B、 C、 D、 E将不再对数据包进行广播, 而是根据报警信息中的目 的地址信息, 分别应用各自原有路由机制进行单播发送。 在 WSN中, 各节点 原有的路由机制通常为按需路由。其中,各中间节点可以在一定时间内记录曾 经接收过的报警信息 ,可通过产生报警的源节点地址和在源节点处的发送序列 号来唯一识别报警信息。如果中间节点接收到多份报警信息, 则丟弃后续接收 到的报警信息, 例如图中到 A点和 F点的画叉路径, 这样可有效地避免洪泛 引起的广播风暴带来的过度能耗。最终报警信息将沿着多条路径到达目的节点 L。
为了提高路由的可靠性, 可以将广播半径设置为多跳, 图 8所示为节点 A将广播半径设为 2跳的情况:
当邻居节点 B、 C、 D、 E接收到报警信息后, 由于其广播半径为 2跳, 则:8、 C、 D、 E先将广播半径减 1后, 仍然对相邻节点进行广播。 H、 J、 G、 L、 M在接收到广播后, 在将广播半径减 1 , 由于减 1后数值为零, 则 H、 J、 G、 L、 M将不再对报警信息进行广播, 而是根据报警信息中的目的地址信息, 分别应用各自的原有的路由机制进行单播。
本领域普通技术人员可以理解:实现上述方法实施例的全部或部分步骤可 以通过程序指令相关的硬件来完成,前述的程序可以存储于一计算机可读取存 储介质中, 该程序在执行时, 执行包括上述方法实施例的步骤; 而前述的存储 介质包括: ROM、 RAM, 磁碟或者光盘等各种可以存储程序代码的介质。
图 9为本发明一个实施例提供的路由节点结构示意图,如图 9所示, 中间 路由节点包括: 获取模块 91、 确定模块 92和发送模块 93;
其中, 获取模块 91 , 用于获取前一路由节点广播的信息; 确定模块 92, 用于根据获取模块 91获取的信息的目的地址, 确定下一跳节点; 发送模块 93 用于釆用单播发送的方式转发信息至确定模块 92确定的下一跳节点。
源路由节点获得信息后, 将信息的目的地址设为广播地址(OxFFFF ), 在 传输的数据帧帧头的特定位置处设置广播半径为第一广播半径,广播半径以跳 为单位,广播半径具体可以根据不同网络的不同的应用场景以及应用的具体情 况来设置。
源路由节点设置广播地址和广播半径后,向周围相邻的路由节点广播该信 息。 周围相邻的路由节点即中间路由节点, 中间路由节点的获取模块 91接收 到信息后,确定模块 92根据目的地址信息确定下一跳节点,发送模块 93按照 信息中原有的路由机制向下一跳节点单播转发该信息。如果信息的目的地址仍 为广播地址, 则发送模块 93继续向相邻的路由节点广播发送该信息。
本实施例提供的路由节点,其转发路由的方法可参照前述路由转发方法实 施例。
本发明实施例提供的路由节点,接收到前一路由节点广播的信息后, 广播 该信息, 或者根据目的地址确定下一跳节点, 向下一跳节点单播转发信息。 在 源节点向目的节点发送信息的过程中,先广播后单播的方式提高了信息传递的 及时性和可靠性, 保证了网络的低能耗。
图 10为本发明又一个实施例提供的路由节点结构示意图, 如图 10所示, 路由节点包括: 获取模块 91、 确定模块 92和发送模块 93 ;
其中, 获取模块 91 , 用于获取前一路由节点广播的信息; 确定模块 92, 用于根据获取模块 91获取的信息的目的地址, 确定下一跳节点; 发送模块 93 用于釆用单播发送的方式转发信息至确定模块 92确定的下一跳节点。
进一步的, 确定模块 92可以包括:
判断单元 921 , 用于判断获取模块 91获取的信息的目的地址类型; 处理单元 922 , 用于若判断单元 921判断出目的地址为单播地址, 则确定 下一跳节点;
若判断单元 921判断出目的地址为广播地址,则判断单元 921还用于将广 播半径减 1后判断广播半径是否大于 0;
若判断单元 921判断出所述广播半径大于 0, 则发送模块 93还用于广播 信息; 若判断单元 921判断出广播半径等于 0, 则处理单元 922还用于确定下 一跳节点。
路由节点还可以包括: 记录模块 94 , 用于记录获取模块 91获取的信息的相关信息, 相关信息用 于使所述信息区别于其他信息;
删除模块 95 , 用于若在设定时间内所述获取模块 91接收到相关信息与信 息相同的另一信息, 则丟弃另一信息;
获取模块 91具体用于接收前一路由节点广播的帧, 帧内包括信息; 发送 模块 93具体用于将帧的类型由广播改为单播, 并单播发送帧至下一跳节点。
获取模块 91 获取的信息可以为源路由节点所管理的普通节点产生的信 息, 或源路由节点自身监测产生的信息, 也可以是源路由节点或所管理的普通 节点需要向网络中其他节点发送的信息。 源路由节点获得信息后, 将信息的目 的地址设为广播地址(OxFFFF ), 在传输的数据帧帧头的特定位置处设置广播 半径为第一广播半径, 广播半径以跳为单位,具体可以根据不同网络的不同的 应用场景以及应用的具体情况来设置。 若信息由源路由节点产生, 则源路由节 点根据信息的类型设置网络层帧类型子域中的帧类型,以便中间路由节点接收 到信息后, 能够获知数据帧类型,从而根据该帧类型对应的特定传输方式进行 传输。
获取模块 91第一次接收到某一信息后,记录模块 94会记录该信息的相关 信息, 以便唯一地确定该信息, 当获取模块 91再次接收相关信息相同的另一 信息, 则删除模块 95进行丟弃处理, 以避免再次将信息进行广播或单播转发, 从而以节省网络资源。
在某一信息从源路由节点到目的节点的过程中, 可能途径多个中间节点, 每个中间节点的获取模块 91在收到该信息时, 判断单元 921需判断该信息的 目的地址,如果目的地址已经为单播地址, 则说明该该信息至少已经经过一个 中间节点, 即已经经过了广播半径范围内的广播传输, 这种情况下, 处理单元 922根据目的地址确定下一跳节点, 由发送模块 93将该信息单播转发给下一 跳节点。如果信息的目的地址为广播地址, 则判断单元 921进一步根据广播半 径判断广播发送信息还是单播发送信息。具体可以为: 判断单元 921将广播半 径减 1后判断广播半径是否大于 0 , 如果大于 0 , 则说明相邻节点仍在广播半 径范围内, 则向相邻节点广播信息。 如果等于 0, 则说明相邻节点在广播半径 范围外, 则发送模块 93将该信息的帧类型由广播更改为单播, 并根据原有的 路由机制将该信息单播转发给下一跳节点。
另外, 源路由节点在发出信息后, 如果信息顺利到达目的节点, 则目的节 点在收到信息后,会向源路由节点发出关于该信息的接收确认信息。但信息在 传输过程中可能丟失, 或者目的节点没有及时发现该信息。 为了提高信息传输 的及时性,减小网络时延,源路由节点可以重新设置广播半径为第二广播半径, 在第二广播半径的范围内重新广播该信息,在第二广播半径的范围外按信息的 原有路由方式单播转发信息至下一跳节点。其中, 第二广播半径需大于在先发 送的信息的第一广播半径, 即源路由节点进一步扩大信息的广播范围, 增加信 息传递的可靠性。 获取模块 91收到广播半径为第二广播半径的信息后, 执行 的步骤与接收到广播半径为第一广播半径的信息过程类似, 不再赘述。
本发明实施例提供的路由节点, 当源节点获取信息时,设置一定的广播半 径向邻居节点广播信息, 中间节点收到前一节点的广播信息后, 仍以广播方式 广播该信息, 或根据目的地址确定下一跳节点, 并按原有路由机制单播转发该 信息。 中间节点处还将相关信息相同的后续信息丟弃, 以避免中间节点重复发 送该信息, 减少了网络能耗。先广播后单播的方式提高了路由的可靠性和及时 性。 若源节点在一定时间内没收到回复信息, 则扩大广播半径, 再次发送该信 息, 以增加信息传递的可靠性, 并减少时延。
图 11为本发明一个实施例提供的无线通信网络结构示意图,如图 11所示, 该无线通信网络包括多个路由节点;
其中, 所述路由节点中的第一路由节点用于广播信息;
所述路由节点中的第二路由节点用于获取所述第一路由节点广播的所述 信息, 根据所述信息的目的地址, 确定下一跳节点; 并釆用单播发送的方式转 发所述信息至所述下一跳节点。
具体的, 该无线通信网络可以是 WSN、 Mesh网等各种类型的网络, 信息 可以是无线传感器网络中普通节点或路由节点产生的上报信息, 例如报警信 息; 也可以是普通节点或路由节点向网络中其他节点传递的信息。 以第一节点 为源路由节点 1 , 第二节点为中间路由节点 2为例进行说明。 当然, 第一节点 也可以是对信息进行广播的中间路由节点 2。
信息由源路由节点 1发出, 经过多个中间路由节点 2后, 最终到达特定的 目标节点、 汇聚点或信息釆集点等网络节点。 源路由节点 1获得所管理的普通 节点发送的信息, 或路由节点自身通过监测产生信息后,将信息的目的地址设 为广播地址(OxFFFF ), 广播半径设置为第一广播半径。 其中, 广播半径以跳 为单位, 例如: 可以为 1跳或 2跳等, 广播半径设置在传输的数据帧帧头的特 定位置处,广播半径具体可以根据不同网络的不同的应用场景以及应用的具体 情况来设置。
源路由节点 1设置广播地址和广播半径后,向周围相邻的路由节点广播该 信息。周围相邻的路由节点作为中间路由节点 2接收到信息后, 仍釆用广播的 方式向周围相邻路由节点传送该信息, 或根据目的地址确定下一跳节点, 并按 原有的路由机制单播转发该信息。
本发明实施例提供的无线传感器网络, 当源节点获取信息时, 向邻居节点 广播该信息,中间节点收到前一节点的广播信息后,仍以广播方式发送该信息, 或根据信息的目的地址按原有的路由机制单播转发信息。提高了信息传递的及 时性和可靠性, 并保证了网络的低能耗。
最后应说明的是: 以上实施例仅用以说明本发明的技术方案, 而非对其限 制; 尽管参照前述实施例对本发明进行了详细的说明, 本领域的普通技术人员 应当理解: 其依然可以对前述各实施例所记载的技术方案进行修改, 或者对其 中部分技术特征进行等同替换; 而这些修改或者替换, 并不使相应技术方案的 本质脱离本发明各实施例技术方案的精神和范围。所述方法适用于其它各种无 线通信网络中的路由节点的信息路由转发。

Claims

权 利 要 求
1、 一种路由转发方法, 其特征在于, 包括:
获取前一路由节点广播的信息;
判断所述信息的目的地址的类型;
若所述目的地址为广播地址,则将广播半径减 1之后判断所述广播半径是 否大于 0;
若所述广播半径大于 0, 则广播所述信息;
若所述广播半径等于 0, 则确定下一跳节点, 并釆用单播发送的方式转发 所述信息至所述下一跳节点。
2、 根据权利要求 1所述的方法, 其特征在于, 还包括:
记录所述信息的相关信息, 所述相关信息用于使所述信息区别于其他信 息;
若在设定时间内接收到相关信息与所述信息相同的另一信息,则丟弃所述 另一信息。
3、 根据权利要求 1或 2所述的方法, 其特征在于,
所述获取前一路由节点广播的信息包括: 接收前一路由节点广播的帧, 所 述帧内包括所述信息;
所述釆用单播发送的方式转发所述信息至所述下一跳节点包括:将所述帧 的类型由广播改为单播, 并单播转发该帧至所述下一跳节点。
4、 根据权利要求 3所述的方法, 其特征在于, 所述信息为无线传感器网 络中的报警信息。
5、 一种路由节点, 其特征在于, 包括:
获取模块, 用于获取前一路由节点广播的信息;
确定模块, 包括: 判断单元和处理单元; 所述判断单元, 用于判断所述获 取模块获取的所述信息的目的地址类型,若所述目的地址为广播地址, 则将广 播半径减 1后判断所述广播半径是否大于 0; 所述处理单元, 用于若所述判断 单元判断出所述广播半径等于 0, 则确定下一跳节点;
所述发送模块, 用于在所述处理单元确定下一跳节点后, 釆用单播发送的 方式转发所述信息至所述确定模块确定的下一跳节点;所述发送模块还用于若 所述判断单元判断出所述广播半径大于 0, 则广播所述信息。
6、 根据权利要求 5所述的路由节点, 其特征在于, 还包括:
记录模块, 用于记录所述获取模块获取的所述信息的相关信息, 所述相关 信息用于使所述信息区别于其他信息;
删除模块,用于若在设定时间内所述获取模块接收到相关信息与所述信息 相同的另一信息, 则丟弃所述另一信息。
7、 一种无线通信网络, 其特征在于, 包括多个路由节点;
所述多个路由节点中的第一路由节点用于广播信息;
所述多个路由节点中的第二路由节点用于获取所述第一路由节点广播的 信息; 判断所述信息的目的地址的类型; 若所述目的地址为广播地址, 则将广 播半径减 1之后判断所述广播半径是否大于 0; 若所述广播半径大于 0, 则广 播所述信息; 若所述广播半径等于 0 , 则确定下一跳节点, 并釆用单播发送的 方式转发所述信息至所述下一跳节点。
PCT/CN2011/072667 2010-07-08 2011-04-12 路由转发方法、路由节点及无线通信网络 WO2011140877A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201010225202.8 2010-07-08
CN201010225202A CN101873273A (zh) 2010-07-08 2010-07-08 路由转发方法、路由节点及无线通信网络

Publications (1)

Publication Number Publication Date
WO2011140877A1 true WO2011140877A1 (zh) 2011-11-17

Family

ID=42997941

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/072667 WO2011140877A1 (zh) 2010-07-08 2011-04-12 路由转发方法、路由节点及无线通信网络

Country Status (2)

Country Link
CN (1) CN101873273A (zh)
WO (1) WO2011140877A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111954262A (zh) * 2019-05-17 2020-11-17 三星电子株式会社 无线通信系统中用于控制分组传输以减少时延的方法和装置

Families Citing this family (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2959635B1 (fr) * 2010-04-30 2012-11-02 Sagemcom Energy & Telecom Sas Procede de propagation d?un evenement survenant sur un dispositif d'un reseau de communication radiofrequence structure
CN101873273A (zh) * 2010-07-08 2010-10-27 华为技术有限公司 路由转发方法、路由节点及无线通信网络
CN102740247B (zh) * 2011-04-15 2015-07-01 中国移动通信集团山东有限公司 一种告警信息的生成方法及装置
CN102291798A (zh) * 2011-09-29 2011-12-21 中国电子科技集团公司第五十四研究所 一种基于无线多跳传感器网络的路由方法
CN103379445B (zh) * 2012-04-25 2016-09-14 华为技术有限公司 一种事故消息的发送方法、控制多播范围的方法及装置
CN103929357A (zh) * 2013-01-11 2014-07-16 浙江大华技术股份有限公司 一种数据传输方法及网络设备
CN105532038B (zh) * 2013-08-27 2020-07-07 索尼公司 信息处理设备和信息处理方法
WO2018117924A1 (en) * 2016-12-23 2018-06-28 Telefonaktiebolaget Lm Ericsson (Publ) A node and a method performed by the node operable in a mesh communication network for routing a received packet towards a destination
CN106789651B (zh) * 2016-12-27 2020-03-10 郑州云海信息技术有限公司 一种防止云服务器网络产生广播风暴的方法及系统
CN106878182B (zh) * 2016-12-29 2020-11-06 深圳华立视通科技有限公司 一种数据传输方法及设备
CN108881014B (zh) * 2017-05-12 2021-10-01 北京猎户星空科技有限公司 一种数据发送系统及方法
CN107453996A (zh) * 2017-07-19 2017-12-08 西安奇妙电子科技有限公司 消息应答方法、消息转发方法及通信装置
CN107248955A (zh) * 2017-07-19 2017-10-13 西安奇妙电子科技有限公司 通信方法及通信装置
CN107196859B (zh) * 2017-07-19 2020-11-06 西安奇妙电子科技有限公司 消息转发方法、广播方法、消息应答方法及通信设备
CN108173927A (zh) * 2017-12-26 2018-06-15 中国水利水电科学研究院 一种无线数据通讯方法及系统
CN108990127B (zh) * 2018-09-17 2021-11-12 广州市特沃能源管理有限公司 基于Thread协议的网状网络的通信方法
CN111757413B (zh) * 2020-06-12 2022-04-19 广州安凯微电子股份有限公司 无线Mesh网络中的广播与路由混合传输方法及系统

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1788208A (zh) * 2003-05-13 2006-06-14 基永有限公司 用于有线或无线网络的边界扫描测试的系统和方法
CN1806413A (zh) * 2003-06-11 2006-07-19 皇家飞利浦电子股份有限公司 配置无线电网络以用于选择性广播
US20090040957A1 (en) * 2007-08-10 2009-02-12 Thomas Anschutz Prepositioning Data For Wireless Applications
CN101815287A (zh) * 2010-03-11 2010-08-25 北京交通大学 基于树状网的无线传感网路由方法及路由系统
CN101873273A (zh) * 2010-07-08 2010-10-27 华为技术有限公司 路由转发方法、路由节点及无线通信网络

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005079026A1 (en) * 2004-02-09 2005-08-25 Packethop, Inc. Reliable message distribution with enhanced emfc for ad hoc mesh networks
TWI392274B (zh) * 2005-03-10 2013-04-01 Interdigital Tech Corp 要求、報告及收集標的節點為基礎之測量及路徑為基礎之測量之多節點通信系統及方法
JP4487948B2 (ja) * 2006-02-17 2010-06-23 パナソニック株式会社 パケット送信方法、中継ノード、および受信ノード

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1788208A (zh) * 2003-05-13 2006-06-14 基永有限公司 用于有线或无线网络的边界扫描测试的系统和方法
CN1806413A (zh) * 2003-06-11 2006-07-19 皇家飞利浦电子股份有限公司 配置无线电网络以用于选择性广播
US20090040957A1 (en) * 2007-08-10 2009-02-12 Thomas Anschutz Prepositioning Data For Wireless Applications
CN101815287A (zh) * 2010-03-11 2010-08-25 北京交通大学 基于树状网的无线传感网路由方法及路由系统
CN101873273A (zh) * 2010-07-08 2010-10-27 华为技术有限公司 路由转发方法、路由节点及无线通信网络

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111954262A (zh) * 2019-05-17 2020-11-17 三星电子株式会社 无线通信系统中用于控制分组传输以减少时延的方法和装置
CN111954262B (zh) * 2019-05-17 2024-03-15 三星电子株式会社 无线通信系统中用于控制分组传输以减少时延的方法和装置

Also Published As

Publication number Publication date
CN101873273A (zh) 2010-10-27

Similar Documents

Publication Publication Date Title
WO2011140877A1 (zh) 路由转发方法、路由节点及无线通信网络
US8064416B2 (en) Route selection in wireless networks
KR101423331B1 (ko) 하드웨어 주소를 기반으로 한 이동 애드 혹 네트워크라우팅 시스템, 방법 및 컴퓨터 판독 가능한 매체
JP5231634B2 (ja) ローカルピアグループ(lpg)間ルーティング方法
US20020145978A1 (en) Mrp-based hybrid routing for mobile ad hoc networks
WO2017020619A1 (zh) 一种路由的方法及装置
JP2005168020A (ja) 無線マルチホップネットワークの通信経路制御方法及び通信端末
CN103118412B (zh) Ad Hoc网络中基于信任的按需多路径矢量路由算法
JP5287622B2 (ja) 通信システム、ノード、通信制御方法、およびプログラム
Okazaki et al. Ant-based dynamic hop optimization protocol: A routing algorithm for mobile wireless sensor networks
CN104902530B (zh) 一种应用于无线Mesh网中的位置辅助路由方法
Khalaf et al. New efficient velocity-aware probabilistic route discovery schemes for high mobility Ad hoc networks
Mu An improved AODV routing for the zigbee heterogeneous networks in 5G environment
Herberg et al. Study of multipoint-to-point and broadcast traffic performance in the “IPv6 Routing Protocol for Low Power and Lossy Networks”
Chintawar et al. Performance analysis of ad-hoc on demand multipath distance vector routing protocol with accessibility and link breakage prediction
JPWO2008114327A1 (ja) アドレス解決方法
Sukanesh et al. Energy efficient malicious node detection scheme in wireless networks
Kavitha et al. An energy efficient fault tolerant multipath (EEFTM) routing protocol for wireless sensor networks
US11457506B2 (en) Adaptive multipath routing failure recovery in a wireless network
CN109788522B (zh) 一种路由发现方法、装置
Zhang et al. A Novel Road Topology-aware Routing in VANETs
CA2817659C (en) Route selection in wireless networks
Kim et al. An enhanced broadcasting algorithm in wireless ad-hoc networks
CA2896911C (en) Route selection in wireless networks
Thenmozhi et al. Routing Overhead in MANET-Minimization with Multipath Local Route Discovery Routing Protocol

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11780098

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 11780098

Country of ref document: EP

Kind code of ref document: A1