[go: up one dir, main page]

WO2017020619A1 - Procédé et dispositif d'acheminement - Google Patents

Procédé et dispositif d'acheminement Download PDF

Info

Publication number
WO2017020619A1
WO2017020619A1 PCT/CN2016/080917 CN2016080917W WO2017020619A1 WO 2017020619 A1 WO2017020619 A1 WO 2017020619A1 CN 2016080917 W CN2016080917 W CN 2016080917W WO 2017020619 A1 WO2017020619 A1 WO 2017020619A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
message
routing
time
neighbor
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2016/080917
Other languages
English (en)
Chinese (zh)
Inventor
王海
李智敏
董超
于卫波
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Publication of WO2017020619A1 publication Critical patent/WO2017020619A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/04—Arrangements for maintaining operational condition
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/248—Connectivity information update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/30—Connectivity information management, e.g. connectivity discovery or connectivity update for proactive routing

Definitions

  • This paper relates to the field of communications, and in particular to a method and apparatus for routing in a heterogeneous wireless network.
  • Wireless Mesh (mesh) network is a new type of broadband wireless network structure. It inherits the main features of Ad Hoc (self-organizing) network multi-hop and self-organization. It consists of Mesh (mesh network) backbone network and Mesh access network. The goal of building a mesh network is to provide a high-capacity, high-rate, reliable, and self-organizing distributed network.
  • a wireless Mesh network can be seen as a combination of a traditional WLAN (Wireless Local Area Network) network and an Ad Hoc network. It combines the characteristics of both, while at the same time has its own characteristics. Its main features are as follows:
  • the wireless Mesh network is simple to set up and deployed quickly, which can support the free joining and evacuation of nodes.
  • the number of wireless channels is abundant.
  • the communication node can simultaneously send and receive data using a plurality of different types of wireless interface devices, thereby greatly improving network throughput.
  • the mesh topology of the wireless Mesh network can expand the network coverage and application scenarios to achieve non-line-of-sight transmission.
  • wireless mesh networks have better scalability. It can support hundreds or even thousands of nodes to communicate, while a typical Ad Hoc network supports only a few dozen nodes.
  • the nodes in the wireless mesh network can be configured with multiple wireless interface devices, when the link of an interface is disconnected, the node can select other interfaces for data transmission and reception, and therefore, the redundancy of the network. Increase, reliability will also increase accordingly.
  • Wireless Mesh networks differ greatly from Ad Hoc networks in terms of topology and number of channels. These differences make the wireless mesh network have more and more complex requirements for routing protocols. If the traditional Ad Hoc routing protocol is directly applied to the wireless Mesh network, the network performance will be greatly reduced, and the network may not be used. Therefore, the Ad Hoc routing protocol needs to be improved. Multi-channel routing is one of the hotspots of wireless Mesh network routing protocols, as shown in Figure 1. Multi-channel transmission can make full use of network resources, thereby improving the overall performance of the network, such as throughput and delay. At present, the wireless Mesh network multi-channel routing protocol can be divided into a single interface multi-channel routing protocol and a multi-interface multi-channel routing protocol.
  • Single-interface multi-channel mode means that each node in the network has only one transceiver.
  • the switching of the nodes through the channel causes the transceiver to work on different frequencies in a time-sharing manner, and both parties must ensure that they operate on the same frequency.
  • the advantage of this method is that the spectrum utilization is improved and the inter-node interference is reduced.
  • the disadvantage is that the channel switching time is relatively long, and the scheduling algorithm of the channel switching is also complicated.
  • the multi-interface multi-channel mode refers to that each node has multiple transceiver devices, and each transceiver device operates on a different channel, and can simultaneously transmit and receive data without interference.
  • the OLSR (Optimal Link State Routing) protocol uses the idea of multipoint relay. By reducing the number of repeated forwarding of the same control message in the same area, the number of broadcast messages in the network is significantly reduced, and it can also support multiple
  • the integrated network of interfaces is applicable to networks with large network scales, dense node distribution, and frequent communication between nodes.
  • the protocol also has the advantage of finding a small routing delay, and is currently a highly accepted wireless mesh network routing method.
  • applying the multi-interface OLSR protocol directly to heterogeneous wireless networks will create the following problems:
  • the multi-interface OLSR protocol sends the same control message size and transmission interval on each interface, treating all interfaces equally, without considering the bandwidth difference between different channels.
  • IP address is occupied more
  • each node can have multiple interfaces.
  • the OLSR protocol assigns an IP address to each interface, and each node will occupy multiple IP addresses. Assign multiple nodes to each node
  • the practice of IP addresses is a great waste of limited IP address resources, creating obstacles for large-scale networking.
  • the multi-interface OLSR protocol does not support channel selection, and the dominant channel cannot be selected from multiple channels according to the difference in channel quality. In fact, choosing to use a high speed channel can achieve higher throughput.
  • Routing control message is repeatedly sent
  • the multi-interface OLSR protocol will repeatedly transmit the same TC (Topology Control) message in multiple subnets. Repeated transmission on a low bandwidth channel will increase the load of the low bandwidth channel and increase unnecessary routing overhead.
  • TC Topic Control
  • the current multi-interface OLSR protocol uses a minimum hop as a routing criterion.
  • the minimum hop count does not take into account the impact of the packet loss rate and channel bandwidth on the routing.
  • the optimal routing cannot be selected, resulting in a decrease in network performance.
  • the embodiment of the invention provides a method and a device for routing, which can provide energy-efficient routing for heterogeneous wireless network communication and improve communication efficiency of the heterogeneous wireless network.
  • the embodiment of the invention provides a routing method, which is applied to a heterogeneous wireless network, and includes:
  • the node receives the hello message and the topology control TC message
  • the node establishes a route according to the Hello message and the TC message, where the Hello message carries a unique IP address of each neighbor node, and the designated bit on the IP address is used to indicate that the local node and the corresponding neighbor node are in all channels. Adjacency relationship on.
  • the foregoing method further has the following feature: after receiving the Hello message, the node further includes:
  • the node periodically calculates an expected transmission time ETT of all channels between the local node and all neighbor nodes according to the Hello message, and the ETT is calculated according to the following formula:
  • p f represents the forward transmission success rate
  • p r represents the backward transmission success rate
  • Size is the size of the transmitted data packet
  • B is the bandwidth of the transmission channel.
  • the forward transmission success rate p f and the backward transmission success rate p r are calculated according to the following formula:
  • recv_count(t- ⁇ , t) represents the number of probe packets received by neighboring nodes from time t- ⁇ to time t
  • sent_count(t- ⁇ , t) represents the time from t- ⁇ time to time t. The number of probe packets sent by the node
  • recv_count(t- ⁇ , t) represents the number of probe packets actually received by the node from time t- ⁇ to time t
  • sent_count(t- ⁇ , t) represents time from t- ⁇ to time t. Number of probe packets sent by neighbor nodes
  • the TC message is periodically generated and sent, and the TC message includes: a minimum value of the ETT values of all channels between the local node and the destination node, as a downstream The routing criteria of the node.
  • the above method also has the following features:
  • the TC message further includes: an address of the destination node reachable by the node, and an address of a next hop node that needs to pass to reach the destination node address.
  • the foregoing method further has the following feature: the sending, by the node, the TC message is implemented by:
  • the node uses a greedy algorithm to select a set of high rate channels to transmit the TC message.
  • the foregoing method further has the following feature: after receiving the Hello message, the node further includes:
  • the node establishes a link list of the node to the neighbor node according to the received Hello message
  • a partial node is selected as a multipoint relay node from the one-hop neighbor node, and the multi-point relay node can send the Hello message sent by the local node to all the two-hop neighbor nodes.
  • the foregoing method further has the following features:
  • the node periodically sends a Hello message, and the parameters in the Hello message include the local node.
  • the IP address of each neighbor node in the Hello message includes the number of Hello messages sent by the node to the neighbor node and the local node and the neighbor node on all channels. Link information.
  • the foregoing method further has the following feature: the establishing, by the node, the routing according to the Hello message and the TC message is implemented by:
  • the node simultaneously uses a routing strategy combining proactive routing and reactive routing to establish a route.
  • the foregoing method further has the following feature: the establishing, by the node, the routing according to the Hello message and the TC message is implemented by:
  • the node establishes a route based on weak multipath coverage.
  • the foregoing method further has the following feature: the node establishes a route based on the weak multipath coverage, including:
  • the node receives the homing response message, and records the upstream node, the path information, and the hop count according to the homing response message;
  • the backup routing path is advertised to the upstream node by the seek request message.
  • the embodiment of the invention further provides a routing device, including:
  • a receiving module configured to receive a hello message and a topology control TC message
  • Establishing a module configured to establish a route according to the Hello message and the TC message, where the Hello message carries a unique IP address of each neighbor node, and the specified bit on the IP address is used to indicate that the local node and the corresponding neighbor node are Adjacency on all channels.
  • the routing device further has the following features:
  • a calculating module configured to periodically calculate, according to the Hello message, a desired transmission time ETT of all channels between the local node and all neighboring nodes, where the ETT is calculated according to the following formula: Where p f represents the forward transmission success rate, p r represents the backward transmission success rate, Size is the size of the transmitted data packet, B is the bandwidth of the transmission channel, and the forward transmission success rate p f and the backward transmission success rate p r is calculated according to the following formula:
  • recv_count(t- ⁇ , t) represents the number of probe packets received by neighboring nodes from time t- ⁇ to time t, and sent_count(t- ⁇ , t) represents the time from t- ⁇ time to time t.
  • recv_count(t- ⁇ , t) represents the number of probe packets actually received by the node from time t- ⁇ to time t
  • sent_count(t- ⁇ , t) The number of probe packets sent by neighboring nodes from time t- ⁇ to time t
  • Generating a module configured to periodically generate a TC message if the node is selected as a multipoint relay node by the upstream node, where the TC message includes: a minimum value of ETT values of all channels between the node and the destination node , as the routing criterion of the downstream node, and the address of the destination node reachable by the node and the address of the next hop node that needs to pass to reach the destination node address;
  • the sending module is configured to periodically send the TC message.
  • the routing device further has the following feature: the sending module is configured to use the greedy algorithm to select a high rate channel set to send the TC message.
  • the routing device further has the following features:
  • the establishing module is further configured to: establish a node-to-neighbor node list according to the received Hello message; select a partial node as a multi-point relay node from the one-hop neighbor node, and the multi-point relay node may send the node to send The Hello message arrives at all two-hop neighbor nodes.
  • the routing device further has the following features:
  • the sending module is further configured to periodically send a Hello message, where the parameters in the Hello message include the number of probe packets received by the local node and the number of probe packets sent by the local node, and each neighbor node in the Hello message.
  • the IP address includes the number of Hello messages sent by the node to the neighbor node and the link information of the local node and the neighbor node on all channels.
  • the routing device further has the following features:
  • the establishing module is configured to establish a route by using a routing strategy combining proactive routing and reactive routing.
  • the routing device further has the following features:
  • the establishing module is configured to establish a route based on the weak multipath coverage, including: receiving the seek And responding to the message, recording the upstream node, the path information, and the hop count according to the homing response message; and listening to the request message; and recording the path information and the intercepted request message in the request message
  • the path information is used to establish a backup routing path different from the path in the request request message; the backup routing path is advertised to the upstream node by using the seek request message.
  • the embodiments of the present invention provide a method and apparatus for routing, aiming at channel differences in a heterogeneous wireless network, so that routing messages are transmitted on a high-speed channel as much as possible, and low-speed channels transmit or not transmit routes as little as possible. data pack.
  • the transmission of routing messages on part of the channel reduces the routing overhead of the entire network, while the low-rate channels can use their valuable bandwidth resources for traffic data transmission, improving the utilization of low-rate channels and network throughput.
  • 1 is a schematic diagram of multi-channel selection of the related art
  • FIG. 2 is a flowchart of a method for routing according to an embodiment of the present invention
  • FIG. 3 is a schematic diagram of a data structure of a TC message according to an embodiment of the present invention.
  • FIG. 4 is a schematic diagram of a modified Hello message format according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of an apparatus for routing according to an embodiment of the present invention.
  • FIG. 2 is a flowchart of a method for routing according to an embodiment of the present invention. As shown in FIG. 2, the method in this embodiment includes:
  • Step 11 The node receives a Hello message and a TC (Topology Control) message;
  • Step 12 The node establishes a route according to the Hello message and the TC message, where the Hello message carries a unique IP address of each neighbor node, and the specified bit on the IP address is used to indicate The adjacency relationship between this node and the corresponding neighbor node on all channels.
  • a method for routing according to the embodiment of the present invention uses a route advertisement mechanism based on joint metric coding to remove multi-interface description information and reduce routing overhead.
  • the method of this embodiment is based on the multi-interface OLSR protocol, by redesigning the routing criteria, optimizing the TC message broadcast channel, reducing the routing overhead, the routing strategy combining the proactive and reactive modes, and the multipath routing based on the weak multipath coverage.
  • the method in this embodiment may specifically include the following steps:
  • Step 101 The node periodically sends a Hello message, and selects a set of its own MPR nodes according to the received Hello message.
  • the Hello message is sent out in the node period.
  • the Hello message contains the IP address of the neighbor node obtained by itself, the number of Hello packets sent and received by the neighbor, and the number of Hello packets sent and received by itself.
  • the node establishes its own to the neighbor node list according to the Hello information it receives, and selects some nodes from the one-hop neighbor node, so that the Hello message sent by itself can reach all the two-hop neighbor nodes.
  • the selected part of the node A collection is called an MPR collection.
  • Step 102 The node periodically calculates the expected transmission time (ETT, Expected Transmission Time) of the neighbor node; after calculating the ETT, it is placed in the TC message, and is propagated outward by the node and the MPR node.
  • ETT Expected Transmission Time
  • the calculation criterion of the expected routing time ETT of the routing criterion adopted is:
  • p f represents the forward transmission success rate
  • p r represents the backward transmission success rate
  • Size is the size of the transmitted data packet
  • B is the bandwidth of the transmission channel.
  • recv_count(t- ⁇ , t) represents the number of probe packets received by neighboring nodes from time t- ⁇ to time t
  • sent_count(t- ⁇ , t) represents the time from t- ⁇ time to time t. The number of probe packets sent by the node.
  • recv_count(t- ⁇ , t) represents the number of probe packets actually received by the node from time t- ⁇ to time t
  • sent_count(t- ⁇ , t) represents time from t- ⁇ to time t. Number of probe packets sent by neighbor nodes.
  • the Hello message and the TC message of the OLSR protocol need to be modified, as follows:
  • the Hello message is used as a probe packet to measure the packet loss rate between nodes.
  • the node adds two parameters "the number of probe packets received by the node" and "the number of probe packets sent by the node" in the Hello message.
  • the Hello message stores the adjacency relationship between the local node and all neighbor nodes. After the IP address of each neighbor node in the Hello message, the "number of Hello messages sent by the node to the neighbor" is stored, and then the link information of the node and the neighbor node on all channels is stored.
  • the node takes the corresponding parameters and saves them in the neighbor table, and periodically calculates the ETTs of all interfaces of the node to all neighbor nodes.
  • the calculation period ⁇ set in this embodiment is 20 seconds.
  • the OLSR protocol uses TC messages to provide network topology information.
  • the node periodically broadcasts TC messages.
  • the node that receives the TC message determines whether the network topology changes according to the message, thereby triggering the update of the routing table.
  • the TC message includes, in addition to the source node address that generates the TC message, the destination node address reachable by the node and the address of the next hop node that needs to pass to reach the destination node address.
  • the node puts the minimum value of the ETT values of all channels between the destination node and the local node into the TC when generating the TC message. interest.
  • the node updates to the ETT of the destination node while updating its own topology table.
  • the data format of the TC message is shown in Figure 3.
  • a fixed bit channel identification is used in the Hello message to indicate the channel connection relationship between adjacent nodes.
  • Each channel is represented by a fixed 2-bit binary number identifier, 00 indicates that it is not a neighbor on the channel, 01 indicates an asymmetric neighbor, 10 indicates a symmetric neighbor, and 11 indicates an MPR neighbor. If there are K channels connected between two nodes, 2K bits are used to indicate all channel connection relationships between the two neighbors. Sorted by channel bandwidth, the highest two bits represent the channel with the lowest bandwidth, and so on, with the lowest two bits representing the channel with the highest bandwidth.
  • only one IP address is assigned to multiple interfaces of each node in the network.
  • a 4-bit channel is added after the IP address of each neighbor node of the Hello message.
  • the identifier is used to indicate the adjacency relationship between this node and the neighbor node on all channels.
  • the channel identifier of the node transmitting the Hello message and the neighbor node 2 is 1100, indicating that the two nodes are not neighbors on channel one, and are MPR neighbors on channel two. Since the two nodes are not neighbors on the channel 1, the Hello message may not add the link information of the two nodes on the channel one. This also reduces the size of the Hello message and reduces the routing overhead.
  • the advantage of assigning a unique IP address to all interfaces of a node is that the MID (Multiple Interface Declaration) message is removed, which significantly reduces the routing overhead.
  • Another benefit of this approach is that it reduces the use of IP addresses and saves limited IP address resources.
  • Step 103 The node selected as the MPR periodically generates a TC broadcast message, and selects a high rate channel set to send the TC message outward.
  • All nodes need to calculate the ETT of all interfaces of their own hop neighbor nodes, and only MPR nodes need to generate and forward TC messages.
  • Each node will select the MPR node in its own one-hop neighbor, so the TC generated by the MPR can establish the route of the whole network node.
  • a greedy algorithm is used to optimize the sending policy of the TC message, so that the TC message is as far as possible. Broadcast on high bandwidth channels and minimize total number of broadcasts.
  • the node Before sending the TC message, the node will call the ChannelSelect() function to select the channel to be sent by the TC message.
  • the formal algorithm is described as follows:
  • NumberofChannel represents the number of channels in the network
  • NumberofNeighbor represents the number of all neighbor nodes of the node
  • k represents the number of marked neighbor nodes.
  • all channels are first sorted according to the channel bandwidth from high to low (line 1); then all neighbors (3-6 lines) are checked in order from the high bandwidth channel to the low bandwidth channel, if one
  • the neighbor is marked, and the number k of the marked neighbor nodes is incremented by 1, and the channel channel[i] (9-17 lines) is recorded.
  • the number of marked neighbors is equal to the total number of neighbors, the channel of the node and all neighbors has been recorded.
  • the function exits and returns all recorded channels (lines 18-19).
  • the return value of this function is the channel to be broadcast by the TC message.
  • the method can control the TC message in a subnet with a high channel bandwidth, and reduce the broadcast of the TC message in the low bandwidth subnet, thereby reducing the load of the low bandwidth subnet.
  • the method in this embodiment selects a high-bandwidth channel according to the bandwidth of the channel and combines the MPR (multipoint relay) flooding method to propagate and diffuse the routing control message, and belongs to the proactive routing method.
  • the method can effectively reduce the wireless network routing overhead and improve the utilization of the low bandwidth channel, thereby improving network throughput and energy efficiency performance.
  • Step 104 The intermediate node updates the topology information according to the TC message, and the MPR node needs to forward the TC message.
  • the TC message is flooded to the entire network through the MPR set. That is, only the MPR node is responsible for forwarding the received TC message.
  • the non-MPR node only updates its own topology table according to the received TC message, and does not forward the TC message.
  • the TC message carries the expected transmission time ETT sent to the corresponding neighbor node, and the intermediate node needs to store the routing criterion according to the IP address of the node.
  • the MPR node also uses the channel selection algorithm to select the high rate channel set to send the TC message.
  • Step 105 All nodes calculate routes to all possible destination nodes according to the topology information acquired by the nodes.
  • the proactive route is used, and the node calculates the route to the possible destination node according to the topology information collected by the node.
  • Each node can calculate the routes in the two ranges according to the Hello message received by the node.
  • the node can calculate the route to the node beyond the two hops.
  • the node establishes a routing table to all nodes. When a new Hello or TC message arrives, the node needs to decide whether to recalculate the routing table according to the topology change.
  • the weak multipath coverage method can establish a robust multi-route backup with low overhead in the route discovery process. Once the node moves, the node fails, etc., the route fails, and the node that finds the route is invalid can quickly switch to the backup route to continue communication.
  • the weak multipath coverage method can largely avoid the route re-establishment process after route failure, and improve the urgency and availability of network routing.
  • the method allows the discovery of a route-failed node to locally switch routes without requiring the source node to participate in route switching, which further improves the flexibility of using multiple routing policies and the efficiency of route recovery.
  • a routing strategy combining proactive routing and reactive routing is adopted.
  • the routing information is not routed or the route is incorrect because of the large interval, the local reactive route inquiry is used to establish the route as needed.
  • “Weak multipath coverage” belongs to the proactive route. If multipath coverage is established, multiple lines will be established. Route backup, when a route fails, the node can quickly switch to the backup route without rerouting.
  • the weak multipath coverage of this embodiment is combined with the related mature Ad Hoc routing protocol DSR (Dynamic Source Routing) to improve on the basis of the protocol prototype.
  • DSR Dynamic Source Routing
  • the DSR algorithm belongs to the reactive routing algorithm (Reactive Routing), which utilizes the source point routing technology and has the monitoring capability, and can put the useful routing information into the local cache entry in time.
  • the locating process of the DSR algorithm can be divided into two phases. The first is to find the request phase, and the request message RREQ (Routing Request) is broadcasted in the network in the form of broadcast, and the intermediate node forwards the RREQ message, and The node information is recorded; after receiving the RREP (Routing Reply) message, the destination node enters the response phase. The destination node sends the seek response message RREP to the source node in unicast form.
  • the RREP listening mechanism is added to the DSR.
  • the node In weak multipath coverage, the node not only receives the RREP sent to itself, but also handles the RREP that the intercepted destination address is not its own. It is by analyzing and processing the path information of the detected RREP that the weak multipath coverage method establishes multiple different routing paths.
  • the node Process the received RREQ and the intercepted RREP, and generate a new route by path separation and path combination.
  • the node records information such as the upstream node, path, and hop count when it receives the RREQ.
  • the node detects the RREP, it establishes a backup routing path different from the path in the RREP according to the recorded path information of the RREQ and the path information in the intercepted RREP, and advertises the backup routing path to its upstream node through the RREP.
  • the route is improved in the harsh environment, the route convergence speed is improved, the network-wide route flapping caused by the local link fault is prevented, and the network routing maintenance overhead is reduced.
  • the embodiment of the invention further provides a computer storage medium, wherein the computer storage medium stores computer executable instructions, and the computer executable instructions are used to execute the above method.
  • FIG. 5 is a schematic diagram of an apparatus for routing according to an embodiment of the present invention.
  • the apparatus for routing in this embodiment includes:
  • a receiving module configured to receive a Hello message and a TC message
  • Establishing a module configured to establish a route according to the Hello message and the TC message, where the Hello message carries a unique IP address of each neighbor node, and the specified bit on the IP address is used to indicate that the local node and the corresponding neighbor node are Adjacency on all channels.
  • the routing device may further include:
  • a calculating module configured to periodically calculate, according to the Hello message, a desired transmission time ETT of all channels between the local node and all neighboring nodes, where the ETT is calculated according to the following formula: Where p f represents the forward transmission success rate, p r represents the backward transmission success rate, Size is the size of the transmitted data packet, B is the bandwidth of the transmission channel, and the forward transmission success rate p f and the backward transmission success rate p r is calculated according to the following formula:
  • recv_count(t- ⁇ , t) represents the number of probe packets received by neighboring nodes from time t- ⁇ to time t, and sent_count(t- ⁇ , t) represents the time from t- ⁇ time to time t.
  • recv_count(t- ⁇ , t) represents the number of probe packets actually received by the node from time t- ⁇ to time t
  • sent_count(t- ⁇ , t) The number of probe packets sent by neighboring nodes from time t- ⁇ to time t
  • Generating a module configured to periodically generate a TC message if the node is selected as a multipoint relay node by the upstream node, where the TC message carries an ETT of all channels between the node and the destination node a minimum value of the value, as a routing criterion of the downstream node, the TC message further includes: an address of the destination node reachable by the node, and an address of a next hop node that needs to pass to reach the destination node address;
  • the sending module is configured to periodically send the TC message.
  • the sending module is configured to select a high rate channel set to send the TC message using a greedy algorithm.
  • the establishing module is further configured to: establish a local node to a neighbor node list according to the received Hello message; select a partial node as a multipoint relay node from the one hop neighbor node, the multiple point The relay node can send the Hello message sent by the local node to all the two-hop neighbor nodes.
  • the sending module is further configured to periodically send a Hello message, where the parameters in the Hello message include the number of probe packets received by the node and the number of probe packets sent by the node,
  • the IP address of each neighbor node in the Hello message includes the number of Hello messages sent by the node to the neighbor node and the link information of the local node and the neighbor node on all channels.
  • the establishing module is configured to establish a route by using a routing policy combining proactive routing and reactive routing.
  • the establishing module is configured to establish a route based on the weak multipath coverage, including: receiving a homing response message, recording the upstream node, the path information, and the hop according to the homing response message. And detecting a request message; and establishing a backup routing path different from the path in the request request message according to the path information recorded and the path information in the search request message being intercepted And advertise the backup routing path to the upstream node by using the seek request message.
  • the above technical solution enables routing messages to be transmitted on the high speed channel as much as possible, while the low speed channel transmits or does not transmit routing data packets as little as possible, which reduces the routing overhead of the entire network, and the low rate channel can use their valuable bandwidth resources for the service.
  • Data transmission improves the utilization of low-rate channels and network throughput.

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)

Abstract

L'invention concerne un procédé et un dispositif d'acheminement. Le procédé est applicable à un réseau hétérogène sans fil et comporte les étapes consistant à: faire recevoir, par un nœud, un message "hello" et un message de commande de topologie (TC); et établir un itinéraire d'après le message "hello" et le message de TC, le message "hello" transportant une adresse IP unique de chaque nœud voisin, et un bit désigné de l'adresse IP indiquant des relations de voisinage entre le nœud et un nœud voisin correspondant dans tous les canaux. La solution technique ci-dessus permet à un message d'acheminement d'être émis dans une partie des canaux, réduisant ainsi les surcharges d'acheminement d'un réseau tout entier. De plus, un canal à basse vitesse peut utiliser une ressource précieuse de bande passante pour émettre des données de service, accroissant ainsi l'utilisation du canal à basse vitesse et le débit du réseau.
PCT/CN2016/080917 2015-08-04 2016-05-03 Procédé et dispositif d'acheminement Ceased WO2017020619A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201510472816.9 2015-08-04
CN201510472816.9A CN106454984B (zh) 2015-08-04 2015-08-04 一种路由的方法及装置

Publications (1)

Publication Number Publication Date
WO2017020619A1 true WO2017020619A1 (fr) 2017-02-09

Family

ID=57943478

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/080917 Ceased WO2017020619A1 (fr) 2015-08-04 2016-05-03 Procédé et dispositif d'acheminement

Country Status (2)

Country Link
CN (1) CN106454984B (fr)
WO (1) WO2017020619A1 (fr)

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112543488A (zh) * 2019-09-20 2021-03-23 瑞达凯特科技(加拿大)有限公司 一种中继路由方法及设备
CN112910779A (zh) * 2021-03-03 2021-06-04 盐城工学院 一种基于Ad Hoc网络的跨层路由优化协议
CN113473464A (zh) * 2021-07-08 2021-10-01 东莞市锐易电子科技有限公司 一种基于分布式的组网技术
US20220123994A1 (en) * 2019-06-28 2022-04-21 Huawei Technologies Co., Ltd. System and Method for Abstracting an IGP Zone
CN114520960A (zh) * 2022-01-25 2022-05-20 中国船舶重工集团公司第七二四研究所 一种多子网无线网络的mpr集合选择方法
CN114599018A (zh) * 2020-12-04 2022-06-07 西蒙电气（中国）有限公司 一种基于自动信道调度的蓝牙Mesh网络路由方法
CN114614883A (zh) * 2022-03-17 2022-06-10 中国人民解放军国防科技大学 一种动态异轨复杂星座星间链路路由方法
CN115529266A (zh) * 2022-09-08 2022-12-27 深圳市有方科技股份有限公司 一种路由选择方法、装置及设备
CN115622650A (zh) * 2022-09-08 2023-01-17 中国人民解放军国防科技大学 一种窄带自组网时间同步与路由维护方法及装置
CN115714999A (zh) * 2022-11-15 2023-02-24 江苏怀业信息技术股份有限公司 多信道自组网的多跳信道复用方法
CN116261200A (zh) * 2023-03-30 2023-06-13 哈尔滨工业大学 一种用于多无人机飞行自组网中的基于链路传输质量的mpolsr协议优化方法
CN117375854A (zh) * 2023-12-08 2024-01-09 广州优刻谷科技有限公司 一种边缘计算数据转发方法、系统、存储介质及设备

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108449776B (zh) * 2018-02-27 2023-09-05 深圳市亚特联科技有限公司 网络路径规划方法、节点设备及计算机存储介质
CN109510769B (zh) * 2018-10-10 2021-07-23 中国电子科技集团公司第七研究所 一种适合于宽窄结合网络的融合路由系统及其方法
CN109803342B (zh) * 2018-10-31 2023-12-26 南京大学 一种面向能量均衡的无人机自组织网络路由方法
CN114845336B (zh) * 2022-03-25 2025-02-25 上海微波技术研究所（中国电子科技集团公司第五十研究所） Olsr路由协议消息压缩方法及系统
CN116016328B (zh) * 2022-12-02 2024-01-05 南京航空航天大学 一种基于多无线电的快速路由恢复方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103369579A (zh) * 2013-07-20 2013-10-23 西安电子科技大学 一种空中自组织网络拓扑感知与维护方法
CN104080112A (zh) * 2014-07-17 2014-10-01 重庆邮电大学 一种提高无线自组织网络业务可靠性的方法
US20150023214A1 (en) * 2012-05-16 2015-01-22 Fujitsu Limited Node apparatus and communication method
CN104410985A (zh) * 2014-10-20 2015-03-11 杭州华三通信技术有限公司 一种拓扑控制报文的处理方法和装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150023214A1 (en) * 2012-05-16 2015-01-22 Fujitsu Limited Node apparatus and communication method
CN103369579A (zh) * 2013-07-20 2013-10-23 西安电子科技大学 一种空中自组织网络拓扑感知与维护方法
CN104080112A (zh) * 2014-07-17 2014-10-01 重庆邮电大学 一种提高无线自组织网络业务可靠性的方法
CN104410985A (zh) * 2014-10-20 2015-03-11 杭州华三通信技术有限公司 一种拓扑控制报文的处理方法和装置

Cited By (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20220123994A1 (en) * 2019-06-28 2022-04-21 Huawei Technologies Co., Ltd. System and Method for Abstracting an IGP Zone
US12513074B2 (en) * 2019-06-28 2025-12-30 Huawei Technologies Co., Ltd. System and method for abstracting an IGP zone
CN112543488A (zh) * 2019-09-20 2021-03-23 瑞达凯特科技(加拿大)有限公司 一种中继路由方法及设备
CN114599018A (zh) * 2020-12-04 2022-06-07 西蒙电气（中国）有限公司 一种基于自动信道调度的蓝牙Mesh网络路由方法
CN112910779A (zh) * 2021-03-03 2021-06-04 盐城工学院 一种基于Ad Hoc网络的跨层路由优化协议
CN112910779B (zh) * 2021-03-03 2023-10-13 盐城工学院 一种基于Ad Hoc网络的跨层路由优化协议的实现方法
CN113473464A (zh) * 2021-07-08 2021-10-01 东莞市锐易电子科技有限公司 一种基于分布式的组网技术
CN114520960A (zh) * 2022-01-25 2022-05-20 中国船舶重工集团公司第七二四研究所 一种多子网无线网络的mpr集合选择方法
CN114520960B (zh) * 2022-01-25 2024-03-19 中国船舶集团有限公司第七二四研究所 一种多子网无线网络的mpr集合选择方法
CN114614883B (zh) * 2022-03-17 2023-06-13 中国人民解放军国防科技大学 一种动态异轨复杂星座星间链路路由方法
CN114614883A (zh) * 2022-03-17 2022-06-10 中国人民解放军国防科技大学 一种动态异轨复杂星座星间链路路由方法
CN115622650A (zh) * 2022-09-08 2023-01-17 中国人民解放军国防科技大学 一种窄带自组网时间同步与路由维护方法及装置
CN115529266B (zh) * 2022-09-08 2023-09-05 深圳市有方科技股份有限公司 一种路由选择方法、装置及设备
CN115529266A (zh) * 2022-09-08 2022-12-27 深圳市有方科技股份有限公司 一种路由选择方法、装置及设备
CN115714999B (zh) * 2022-11-15 2024-02-23 江苏怀业信息技术股份有限公司 多信道自组网的多跳信道复用方法
CN115714999A (zh) * 2022-11-15 2023-02-24 江苏怀业信息技术股份有限公司 多信道自组网的多跳信道复用方法
CN116261200A (zh) * 2023-03-30 2023-06-13 哈尔滨工业大学 一种用于多无人机飞行自组网中的基于链路传输质量的mpolsr协议优化方法
CN117375854A (zh) * 2023-12-08 2024-01-09 广州优刻谷科技有限公司 一种边缘计算数据转发方法、系统、存储介质及设备
CN117375854B (zh) * 2023-12-08 2024-03-19 广州优刻谷科技有限公司 一种边缘计算数据转发方法、系统、存储介质及设备

Also Published As

Publication number Publication date
CN106454984A (zh) 2017-02-22
CN106454984B (zh) 2021-05-04

Similar Documents

Publication Publication Date Title
WO2017020619A1 (fr) Procédé et dispositif d'acheminement
CN102027795B (zh) 网状网络中的信道分配过程
US8050196B2 (en) Method and apparatus for controlling packet transmissions within wireless networks to enhance network formation
CN106686659B (zh) 一种基于aomdv的能量感知节点不相交多路径路由算法
CN108337166B (zh) 一种面向航空集群网络的低时延高可靠路由方法
US20080101244A1 (en) Data routing method and apparatus
CN102202333B (zh) 用于小卫星星座通信的无线自组织网络路由方法
JP2006519515A (ja) アドホック接続を用いて拡張されるセルラ無線通信システムにおける情報の伝送のための方法及び基地局
Kulkarni et al. On demand routing protocols for mobile ad hoc networks: A review
CN112040528B (zh) 一种无线自组网中心控制节点的选择方法
CN102984781A (zh) 用于无线自组织网络路由的邻居节点判定方法
CN111526557A (zh) 一种无线自组网路由信息获取方法
So et al. Routing and channel assignment in multi-channel multi-hop wireless networks with single network interface
CN106850436A (zh) 基于虚拟势能场的矿井混合无线mesh网络路由协议
JP2009260720A (ja) 経路制御方法、通信システムおよび通信装置
JP4767329B2 (ja) ネットワークシステムおよび通信方法
Le et al. An efficient hybrid routing approach for hybrid wireless mesh networks
US11457506B2 (en) Adaptive multipath routing failure recovery in a wireless network
Raju et al. ZRP versus aodv and dsr: A comprehensive study on zrp performance on manets
So et al. Load-balancing routing in multichannel hybrid wireless networks with single network interface
Avallone et al. Layer-2.5 routing in multi-radio wireless mesh networks
Kamble et al. A survey on wired, wireless, and internet of things routing protocols
SreeRangaRaju et al. ZRP versus AODV and DSR: a comprehensive study on ZRP performance using QualNet simulator
Mirza et al. Reliable multipath multi-channel route migration over multi link-failure in wireless ad hoc networks
Sruthy et al. Variants of AODV routing protocol: A review

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: 16832108

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: 16832108

Country of ref document: EP

Kind code of ref document: A1