CN112822751A - Hybrid wireless network routing method - Google Patents
Hybrid wireless network routing method Download PDFInfo
- Publication number
- CN112822751A CN112822751A CN202110068630.2A CN202110068630A CN112822751A CN 112822751 A CN112822751 A CN 112822751A CN 202110068630 A CN202110068630 A CN 202110068630A CN 112822751 A CN112822751 A CN 112822751A
- Authority
- CN
- China
- Prior art keywords
- message
- node
- route
- routing
- service
- 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.)
- Granted
Links
Images
Classifications
-
- 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
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0289—Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/10—Flow control between communication endpoints
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
The invention relates to a hybrid wireless network routing method, and belongs to the technical field of wireless communication. The method comprises the following steps: s1: the central node establishes an initial routing relation; s2: the station establishes a routing relation; s3: the central node and the site update the routing relation; s4: the node sends a message; s5: the node carries out a route repair request; s6: carrying out congestion detection on the nodes; s7: and the node carries out service distribution. The invention simplifies the routing relation, dynamically adapts to the change of the wireless environment, reduces the network overhead and improves the transmission efficiency of the service message; meanwhile, when part of sites are busy, the service flow can be dynamically transferred, and the bandwidth utilization rate is improved.
Description
Technical Field
The invention belongs to the technical field of wireless communication, and relates to a hybrid wireless network routing method.
Background
The existing network technology consists of wired and Wireless technologies, the wired network technology comprises power line carriers and the like, and the Wireless network technology comprises Wireless Mesh, Zigbee, Bluetooth, Wi-Fi, WiMAX and the like.
The intelligent meter reading technology also comprises a wired network and a wireless network, data transmission in the wired network is limited by wiring, and the wiring cost is increased. The wireless transmission networking is more flexible, and the self-adaptive self-organization of the network is improved.
Routing techniques in wireless networks include proactive routing and reactive routing. The proactive routing requires that each node stores the routing relation of all nodes of the whole network, the service speed of the service is high, but a large amount of message overhead is needed to maintain the routing stability, and global message flooding is needed once for the routing modification of a certain node each time; the post-response type routing needs to broadcast a request message once when the message transmission is required, so that the bandwidth requirement is low, the service response time is slow, and the service capacity is poor;
most routing schemes in the current wireless network adopt a tree topology, networking is performed layer by layer, and a central node controls the topology and routing relation of the whole network. The networking scheme has the following defects: 1) the central node controls the routing of the station, the distance between the central node and the station is far, the dynamic change of the wireless network environment around the station cannot be sensed, and the routing information cannot change in real time according to the wireless network environment; 2) each time the site modifies the routing tree topology, the site needs to report to the central node, and the site can change the routing tree topology through the agreement of the central node, so that the channel overhead and the time overhead are increased in the process; 3) the station can not optimize the routing of the station according to the messages of the nearby stations, the information utilization rate is poor, and the hop count of the messages is increased; 4) the site routing has no error repair mechanism, once a certain site routing has errors, the message routing passing through the site is wrongly filled for a long time and cannot reach the destination node.
Based on the above problems, a new routing method is needed to adapt to a real-time dynamically changing wireless network environment.
Disclosure of Invention
In view of the above, the present invention is directed to a hybrid wireless network routing method.
In order to achieve the purpose, the invention provides the following technical scheme:
a method of hybrid wireless network routing, the method comprising the steps of:
s1: the central node establishes an initial routing relation;
s2: the station establishes a routing relation;
s3: the central node and the site update the routing relation;
s4: the node sends a message;
s5: the node carries out a route repair request;
s6: carrying out congestion detection on the nodes;
s7: and the node carries out service distribution.
Optionally, the S1 specifically includes:
s11: after the central node is powered on, acquiring an MAC address, configuring a white list, broadcasting a beacon frame and starting to receive a network access request of a site;
s12: after receiving a network access request message of a station, a central node verifies an MAC address of the station, allocates a unique ID number for the station, analyzes and stores an initial routing relation, sends a network access confirmation message to the station and arranges a beacon time slot for the node;
s13: after a node accesses the network, the central node starts organizing the network maintenance frame and broadcasts the frame to the surrounding nodes.
Optionally, the S2 specifically includes:
s21: after a station is electrified, an MAC address is obtained, a nearby signal is monitored, a network access request frame is sent after a network is found, and confirmation is waited;
s22: after receiving a network access confirmation message of a central node, a site analyzes and stores a unique ID number and an initial routing relation allocated by the central node, and sends a beacon in a scheduled beacon time slot;
s23: after the site accesses the network, a route establishment request message is sent to a nearby node and a response is received, after the processing is finished, a network maintenance frame is organized, and the frame is broadcasted to surrounding nodes.
Optionally, the S3 specifically includes:
s31: the node receives the network maintenance frame of the nearby node, analyzes the routing relation contained in the network maintenance frame, sequentially inquires the destination node in each routing relation in the routing table of the node, and if the routing relation does not exist, the step goes to S2; if so, go to S3;
s32: checking the hop count and quality in the new routing relation, and if the hop count is less than 15 hops and the communication quality reaches a threshold value, storing the routing relation;
s33: comparing the next hop ID of the arriving node in the table, and if the next hop ID is the same, updating the hop count and the communication quality; if not, comparing with the stored route relation, and storing the N routes with less hop number and good quality in sequence;
s34: the nodes periodically check whether the routing table is changed, if so, the nodes organize the network maintenance message, only fill the routing relation for sending the change, and broadcast and inform the nearby nodes.
Optionally, the fields of the network maintenance packet include: the station ID of 12 bits, the hop count from the station of 4 bits to the central node, the broadcast period of 8 bits, the destination node ID of the routing coefficient N, N × 12 bits contained in the message of 16 bits, the hop count from N × 4 bits to the destination node and the quality of the routing relation of N × 8 bits;
the ID of the central node is default to 1, the IDs of other sites are uniformly distributed by the central node and are unique in the network, the broadcast period is default to 2 routing periods, the field can be configured, the hop number indicates the number of messages which are forwarded to a destination node through the node and need to pass through other nodes, and the quality of the routing relationship is defined by the following formula:
link_quality＝1/(hm+1)*snr+(hm-1)/(hm+1)*quality_in_beacon
wherein link _ quality represents the link quality calculated by the node, hm represents the hop number carried in the message, snr represents the signal-to-noise ratio of the received message, and quality _ in _ beacon represents the link quality carried in the message;
the node maintains a routing table, and the structure is as follows:
each node occupies 3 × N +2 bytes of storage space, each entry stores N routes, the 1 st route is a main route, the rest are standby routes, and the size of N can be configured and adjusted according to storage conditions.
Optionally, the S4 specifically includes:
s41: the service message is sent or forwarded to provide a destination site ID, and a routing relation is requested to the routing service;
s42: the routing service inquires a routing table according to the original destination node ID provided by the service message, if the destination node is inquired in the table, the S44 is switched to, if the destination node can not be inquired in the table, the S43 is switched to,
s43: performing a routing link request process, if a reliable routing relation is obtained, turning to S44, if the reliable routing relation is obtained, giving up the message forwarding and reporting the service;
s44: and sending the message to a destination node, starting a timer, waiting for a message confirmation frame of the destination node, informing the service that the message is successfully sent if the message confirmation frame is received before the timer is finished, and sequentially trying other nodes meeting the hop count requirement in the route to send the message if the message is failed to send until the confirmation message is received or all the nodes fail to send the message, and reporting the failure to send to the service.
Optionally, the service packet has a corresponding acknowledgement packet corresponding thereto, and is used to inform the sending node that the packet has been sent, where the packet should include a 12-bit sending node ID, a 12-bit destination node ID, and a 16-bit packet serial number, the receiving node should immediately reply the acknowledgement packet after receiving the service packet, and if the sending service packet node does not receive the acknowledgement packet within a specified time, the sending service packet node considers that the packet has failed to be sent, and needs to reselect a forwarding station for forwarding.
Optionally, the S5 specifically includes: when the service message has a service request routing relation, the routing table does not have the required table entry of the original destination node, and a route repair process is performed to obtain a link, wherein the process is as follows:
s51: a service request routing relation, if the destination node ID routing table entry cannot be inquired in the routing table, triggering a route repair request flow and informing the service that the message needs to be sent;
s52: a node broadcasts a route repair message, the message carries a 12-bit initiating node ID, a 12-bit destination node ID, a 4-bit limited hop count and a 16-bit link request serial number, and a route repair timer is started; the route repairing message is a broadcast message and does not need to respond to a confirmation message;
s53: the adjacent nodes receive the route repairing message, firstly, whether the link request of the link request serial number is processed or not is judged, if the link request of the link request serial number is processed, the message is discarded, if the message is received for the first time, a route table is inquired according to the ID of the destination node, if the message is in the table, a route repairing confirmation message is replied to the initiating node, if the message is not inquired, the route repairing message is continuously broadcasted, and the ID of the node is added in the message to be used as one hop in the link;
s54: the nearby node receives the route repairing message, and repeats the step of S53 until the route is inquired, the hop count is exhausted or the route repairing message is sent to the destination node;
s55: the destination node receives the link repairing message, starts a timer, waits for route repairing messages from different links, selects the link with the least hop number from the collected multiple links as a transmission link after the timer is over, assembles the link into a route repairing confirmation message, and reversely sends the link to the node initiating the route repairing request according to the selected link, and the link confirmation reply message sends the message needing to be confirmed for confirmation;
s56: the node in the link receives the route repair confirmation message, firstly forwards the message, then analyzes the message, extracts the route relation contained in the message, and fills the route relation into a route table of the node;
s57: and the node initiating the route repair request receives the route repair confirmation message, analyzes the message, extracts the routing relation contained in the message, fills the routing relation into a routing table of the node, restarts a service message sending process and closes the route repair waiting timer.
Optionally, when a node in the network has a service requirement, it is detected that the service of the forwarding node is busy, and another path is adaptively selected as a forwarding site to implement service offloading, where the node performs congestion detection, including the following steps:
s61: each station maintains a sending and forwarding task queue, the capacity of the queue is N, the node detects the number of tasks in the current queue, when a message needs to be sent or forwarded, a task is added to the tail of the queue, meanwhile, the number of the task queues is increased by one, when a sending task is finished, the next task is taken out from the head of the queue to be executed, and meanwhile, the number of the task queues is decreased by one;
s62: if the number of the tasks in the queue reaches 3/4 of the total number, the node is judged to be in a congestion state, a congestion notification message is sent to a nearby node, and a congestion detection timer is started;
s63: and (4) when the timer is overtime, detecting the number of the current queue again, if the occupied number in the task queue still reaches 3/4, sending the congestion notification message again, restarting the congestion detection timer, and sequentially circulating until the congestion state is eliminated.
Optionally, the service offloading process performed by the node is as follows:
s71: the method comprises the steps that a site receives a congestion notification message of a nearby site, marks the node as a congestion node in a routing table, and reduces a data branch flow value Y of the node to 75% of an original value;
s72: when a service message needs to be forwarded by a site with a congestion mark, searching a standby route of the route, if the standby route also has a congestion mark, carrying out forward to the next standby route, and if the standby route does not have the congestion mark, extracting message traffic value Y data in a routing table and forwarding (100-Y)% of the message forwarded by the site to the standby route;
s73: waiting for a period of time, and if no new congestion message is received, indicating that the load is balanced; if the congestion message is still received, judging whether the congestion message is the congestion message on the main route, if so, turning to S71, and if so, turning to S74;
s74: the 1/2Y packet size of Y ═ 100-Y% of the packet size allocated on the backup route is returned to the main path, and the process jumps to S73.
The invention has the beneficial effects that: the invention simplifies the routing relation, dynamically adapts to the change of the wireless environment, reduces the network overhead and improves the transmission efficiency of the service message; meanwhile, when part of sites are busy, the service flow can be dynamically transferred, and the bandwidth utilization rate is improved.
Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objectives and other advantages of the invention may be realized and attained by the means of the instrumentalities and combinations particularly pointed out hereinafter.
Drawings
For the purposes of promoting a better understanding of the objects, aspects and advantages of the invention, reference will now be made to the following detailed description taken in conjunction with the accompanying drawings in which:
FIG. 1 is a schematic diagram of a wireless network topology according to an embodiment of the present invention;
FIG. 2 is a flow chart of hybrid route setup update according to an embodiment of the present invention;
FIG. 3 is a flow chart of a method for sending a message query route in an embodiment of the present invention;
fig. 4 is a flowchart of a route repair initiating node in the embodiment of the present invention;
fig. 5 is a flow chart of a route repair response node in the embodiment of the present invention;
fig. 6 is a flow chart of congestion diversion in an embodiment of the present invention.
Detailed Description
The embodiments of the present invention are described below with reference to specific embodiments, and other advantages and effects of the present invention will be easily understood by those skilled in the art from the disclosure of the present specification. The invention is capable of other and different embodiments and of being practiced or of being carried out in various ways, and its several details are capable of modification in various respects, all without departing from the spirit and scope of the present invention. It should be noted that the drawings provided in the following embodiments are only for illustrating the basic idea of the present invention in a schematic way, and the features in the following embodiments and examples may be combined with each other without conflict.
Wherein the showings are for the purpose of illustrating the invention only and not for the purpose of limiting the same, and in which there is shown by way of illustration only and not in the drawings in which there is no intention to limit the invention thereto; to better illustrate the embodiments of the present invention, some parts of the drawings may be omitted, enlarged or reduced, and do not represent the size of an actual product; it will be understood by those skilled in the art that certain well-known structures in the drawings and descriptions thereof may be omitted.
The same or similar reference numerals in the drawings of the embodiments of the present invention correspond to the same or similar components; in the description of the present invention, it should be understood that if there is an orientation or positional relationship indicated by terms such as "upper", "lower", "left", "right", "front", "rear", etc., based on the orientation or positional relationship shown in the drawings, it is only for convenience of description and simplification of description, but it is not an indication or suggestion that the referred device or element must have a specific orientation, be constructed in a specific orientation, and be operated, and therefore, the terms describing the positional relationship in the drawings are only used for illustrative purposes, and are not to be construed as limiting the present invention, and the specific meaning of the terms may be understood by those skilled in the art according to specific situations.
Referring to fig. 1 to 6, a broadband micropower wireless intelligent meter reading network is taken as an example to describe the technical solution of the present invention, and the topology of the broadband micropower wireless intelligent meter reading network is as shown in fig. 1, and the network topology is a tree topology and includes central control nodes (CCOs), proxy stations (PCO1, PCO2), stations (STA1, STA2, STA3, STA4, STA5, STA6, and STA 7). The broadband micropower wireless intelligent meter reading network in fig. 1 is only used to illustrate the networking and network maintenance method of the intelligent meter reading network of the present invention, and is not a limitation to the application scenario of the present invention, and it should be obvious to those skilled in the art that the technical solution of the present invention is applied to the power grid intelligent meter reading network, regardless of the communication mode, the number of sites, the number of network layer levels, and the like of the intelligent meter reading network.
Example 1: the embodiment is a preferred implementation of the routing method of the broadband micropower wireless intelligent meter reading network. Referring to fig. 2, the routing method of the present embodiment includes:
1) after the central node is powered on, acquiring an MAC address, configuring a white list, broadcasting a beacon frame and starting to receive a network access request of a site;
2) the central node receives a network access request message of a station, verifies an MAC address of the station, distributes a unique ID number for the station, analyzes and stores an initial routing relation, sends a network access confirmation message to the station and arranges a beacon time slot for the node;
3) after a node accesses the network, the central node starts to organize a network maintenance frame and broadcasts the frame to surrounding nodes;
4) after a station is electrified, an MAC address is obtained, a nearby signal is monitored, a network access request frame is found after a network is found, and confirmation is waited;
5) after receiving a network access confirmation message of the central node, the station analyzes and stores the unique ID number and the initial routing relation of the station distribution, and sends a beacon in a scheduled beacon time slot;
6) after a site accesses a network, sending a route establishment request message to a nearby node, receiving a response, organizing a network maintenance frame after the processing is finished, and broadcasting the frame to surrounding nodes;
7) the node receives the network maintenance frame of the nearby node, analyzes the routing relation contained in the network maintenance frame, sequentially inquires the destination node in each routing relation in the routing table of the node, and if the routing relation does not exist, the step 2 is carried out; if yes, go to step 3;
8) checking the number and quality of the new routing relation, and if the hop number is less than 15 hops and the communication quality reaches a threshold value, storing the routing relation;
9) comparing the next hop ID of the arriving node in the table, and if the next hop ID is the same, updating the hop count and the communication quality; if not, comparing with the stored route relation, and storing the N routes with less number and good quality in sequence;
10) the nodes periodically check whether the routing table is changed, if so, the nodes organize the network maintenance message, only fill the routing relation for sending the change, and broadcast and inform the nearby nodes;
example 2: the embodiment is a preferred embodiment of the invention, in which a broadband micropower wireless intelligent meter reading node sends a message. Referring to fig. 3, the routing method of the present embodiment includes:
1): the service message sends or forwards the ID of the forwarding site needing to request the routing relation to the routing service;
2): the routing service inquires a routing table according to an original destination node provided by the service message, if the destination node is inquired in the table, the step 4 is switched to, if the destination node cannot be inquired in the table, the step 3 is switched to,
3): performing a routing link request process, if a reliable routing relation is obtained, turning to step 4, and if the reliable routing relation is failed, giving up the message forwarding and reporting the service;
4): sending the message to a destination node, starting a timer, waiting for a message confirmation frame of the destination node, if the message confirmation frame is received before the timer is finished, informing the service that the message is successfully sent, and if the message is failed to be sent, sequentially trying other nodes meeting the hop count requirement in the route to send the message until the confirmation message is received or all the nodes fail to be sent, and reporting the failure to be sent to the service;
example 3: this embodiment is a preferred embodiment of route repair for broadband micropower wireless intelligent meter reading according to the present invention, and refer to fig. 4 and 5.
1) If the service requests the routing relation, but the destination node ID routing table entry cannot be inquired in the routing table, triggering a route repair request process and informing the service that the message needs to be sent;
2) the node broadcasts a route repair message, the message carries an initiating node ID (12bit), a destination node ID (12bit), a limited hop count (4bit), a link request serial number, and a route repair timer is started. The route repairing message is a broadcast message and does not need to respond to a confirmation message;
3) if the message is received for the first time, inquiring a routing table according to the ID of the destination node, if the message is in the table, replying a routing repair confirmation message to the initiating node, if the message is not inquired, continuously broadcasting the routing repair message, and adding the ID of the node in the message as a hop in the link;
4) and (4) the adjacent nodes receive the route repairing message, and repeat the step (3) until the route is inquired, the hop count is exhausted or the route repairing message is sent to the destination node.
5) The destination node receives the link repairing message, starts a timer, waits for route repairing messages from different links, selects the link with the least hop number from the collected multiple links as a transmission link after the timer is over, assembles the link into a route repairing confirmation message, and reversely sends the link to the node initiating the route repairing request according to the selected link, and the link confirmation reply message sends the message needing to be confirmed for confirmation;
6) the node in the link receives the route repair confirmation message, firstly forwards the message, then analyzes the message, extracts the route relation contained in the message, and fills the route relation into a route table of the node;
7) the node initiating the route repair request receives the route repair confirmation message, analyzes the message, extracts the routing relation contained in the message, fills the routing table of the node, restarts the service message sending process and closes the route repair waiting timer;
example 4: this embodiment is a preferred embodiment of congestion shunting for broadband micropower wireless intelligent meter reading according to the present invention, and is shown in fig. 6.
1) Each station maintains a sending and forwarding task queue, the capacity of the queue is N, the node detects the number of tasks in the current queue, when a message needs to be sent or forwarded, a task is added to the tail of the queue, meanwhile, the number of the task queues is increased by one, when a sending task is finished, the next task is taken out from the head of the queue to be executed, and meanwhile, the number of the task queues is decreased by one;
2) if the number of the tasks in the queue reaches 3/4 of the total number, the node is judged to be in a congestion state, a congestion notification message is sent to a nearby node, and a congestion detection timer is started;
3) when the timer is overtime, the number of the current queue is detected again, if the occupied number in the task queue still reaches 3/4, the congestion notification message is sent again, the congestion detection timer is restarted, and the steps are circulated in sequence until the congestion state is eliminated;
4) the nearby site receives the congestion notification message of the nearby site, marks the node as a congested node in a routing table, and reduces the data branch flow value Y of the node to 75% of the original value;
5) when a service message needs to be forwarded by a site with a congestion mark, searching a standby route of the route, if the standby route also has a congestion mark, carrying out forward to the next standby route, and if the standby route does not have the congestion mark, extracting message traffic value Y data in a routing table and forwarding (100-Y)% of the message forwarded by the site to the standby route;
6) waiting for a period of time, and if no new congestion message is received, indicating that the load is balanced; if the congestion message is still received, judging whether the congestion message is the congestion message on the main route, if so, turning to the step 4, and if the congestion message is the congestion message on the standby route, turning to the step 7;
7) and returning 1/2Y message quantity of the message quantity of which the Y is equal to (100-Y)% of the message quantity distributed on the standby route to the main path, and jumping to the step 4.
Finally, the above embodiments are only intended to illustrate the technical solutions of the present invention and not to limit the present invention, and although the present invention has been described in detail with reference to the preferred embodiments, it will be understood by those skilled in the art that modifications or equivalent substitutions may be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions, and all of them should be covered by the claims of the present invention.
Claims (10)
1. A hybrid wireless network routing method, characterized by: the method comprises the following steps:
s1: the central node establishes an initial routing relation;
s2: the station establishes a routing relation;
s3: the central node and the site update the routing relation;
s4: the node sends a message;
s5: the node carries out a route repair request;
s6: carrying out congestion detection on the nodes;
s7: and the node carries out service distribution.
2. A hybrid wireless network routing method as recited in claim 1, wherein: the S1 specifically includes:
s11: after the central node is powered on, acquiring an MAC address, configuring a white list, broadcasting a beacon frame and starting to receive a network access request of a site;
s12: after receiving a network access request message of a station, a central node verifies an MAC address of the station, allocates a unique ID number for the station, analyzes and stores an initial routing relation, sends a network access confirmation message to the station and arranges a beacon time slot for the node;
s13: after a node accesses the network, the central node starts organizing the network maintenance frame and broadcasts the frame to the surrounding nodes.
3. A hybrid wireless network routing method as recited in claim 1, wherein: the S2 specifically includes:
s21: after a station is electrified, an MAC address is obtained, a nearby signal is monitored, a network access request frame is sent after a network is found, and confirmation is waited;
s22: after receiving a network access confirmation message of a central node, a site analyzes and stores a unique ID number and an initial routing relation allocated by the central node, and sends a beacon in a scheduled beacon time slot;
s23: after the site accesses the network, a route establishment request message is sent to a nearby node and a response is received, after the processing is finished, a network maintenance frame is organized, and the frame is broadcasted to surrounding nodes.
4. A hybrid wireless network routing method as recited in claim 1, wherein: the S3 specifically includes:
s31: the node receives the network maintenance frame of the nearby node, analyzes the routing relation contained in the network maintenance frame, sequentially inquires the destination node in each routing relation in the routing table of the node, and if the routing relation does not exist, the step goes to S2; if so, go to S3;
s32: checking the hop count and quality in the new routing relation, and if the hop count is less than 15 hops and the communication quality reaches a threshold value, storing the routing relation;
s33: comparing the next hop ID of the arriving node in the table, and if the next hop ID is the same, updating the hop count and the communication quality; if not, comparing with the stored route relation, and storing the N routes with less hop number and good quality in sequence;
s34: the nodes periodically check whether the routing table is changed, if so, the nodes organize the network maintenance message, only fill the routing relation for sending the change, and broadcast and inform the nearby nodes.
5. The method of claim 4, wherein: the fields of the network maintenance message include: the station ID of 12 bits, the hop count from the station of 4 bits to the central node, the broadcast period of 8 bits, the destination node ID of the routing coefficient N, N × 12 bits contained in the message of 16 bits, the hop count from N × 4 bits to the destination node and the quality of the routing relation of N × 8 bits;
the ID of the central node is default to 1, the IDs of other sites are uniformly distributed by the central node and are unique in the network, the broadcast period is default to 2 routing periods, the field can be configured, the hop number indicates the number of messages which are forwarded to a destination node through the node and need to pass through other nodes, and the quality of the routing relationship is defined by the following formula:
link_quality＝1/(hm+1)*snr+(hm-1)/(hm+1)*quality_in_beacon
wherein link _ quality represents the link quality calculated by the node, hm represents the hop number carried in the message, snr represents the signal-to-noise ratio of the received message, and quality _ in _ beacon represents the link quality carried in the message;
the node maintains a routing table, and the structure is as follows:
each node occupies 3 × N +2 bytes of storage space, each entry stores N routes, the 1 st route is a main route, the rest are standby routes, and the size of N can be configured and adjusted according to storage conditions.
6. A hybrid wireless network routing method as recited in claim 1, wherein: the S4 specifically includes:
s41: the service message is sent or forwarded to provide a destination site ID, and a routing relation is requested to the routing service;
s42: the routing service inquires a routing table according to the original destination node ID provided by the service message, if the destination node is inquired in the table, the S44 is switched to, if the destination node can not be inquired in the table, the S43 is switched to,
s43: performing a routing link request process, if a reliable routing relation is obtained, turning to S44, if the reliable routing relation is obtained, giving up the message forwarding and reporting the service;
s44: and sending the message to a destination node, starting a timer, waiting for a message confirmation frame of the destination node, informing the service that the message is successfully sent if the message confirmation frame is received before the timer is finished, and sequentially trying other nodes meeting the hop count requirement in the route to send the message if the message is failed to send until the confirmation message is received or all the nodes fail to send the message, and reporting the failure to send to the service.
7. The method of claim 6, wherein: the service messages all have a corresponding confirmation message corresponding to the service message, and are used for informing the sending node that the message has been sent, the message should include a sending node ID of 12 bits, a destination node ID of 12 bits and a message serial number of 16 bits, the receiving node should immediately reply the confirmation message after receiving the service message, and if the service message sending node does not receive the confirmation message within a specified time, the message sending node considers that the message is failed to send, and a forwarding site needs to be selected again for forwarding.
8. The method of claim 7, wherein: the S5 specifically includes: when the service message has a service request routing relation, the routing table does not have the required table entry of the original destination node, and a route repair process is performed to obtain a link, wherein the process is as follows:
s51: a service request routing relation, if the destination node ID routing table entry cannot be inquired in the routing table, triggering a route repair request flow and informing the service that the message needs to be sent;
s52: a node broadcasts a route repair message, the message carries a 12-bit initiating node ID, a 12-bit destination node ID, a 4-bit limited hop count and a 16-bit link request serial number, and a route repair timer is started; the route repairing message is a broadcast message and does not need to respond to a confirmation message;
s53: the adjacent nodes receive the route repairing message, firstly, whether the link request of the link request serial number is processed or not is judged, if the link request of the link request serial number is processed, the message is discarded, if the message is received for the first time, a route table is inquired according to the ID of the destination node, if the message is in the table, a route repairing confirmation message is replied to the initiating node, if the message is not inquired, the route repairing message is continuously broadcasted, and the ID of the node is added in the message to be used as one hop in the link;
s54: the nearby node receives the route repairing message, and repeats the step of S53 until the route is inquired, the hop count is exhausted or the route repairing message is sent to the destination node;
s55: the destination node receives the link repairing message, starts a timer, waits for route repairing messages from different links, selects the link with the least hop number from the collected multiple links as a transmission link after the timer is over, assembles the link into a route repairing confirmation message, and reversely sends the link to the node initiating the route repairing request according to the selected link, and the link confirmation reply message sends the message needing to be confirmed for confirmation;
s56: the node in the link receives the route repair confirmation message, firstly forwards the message, then analyzes the message, extracts the route relation contained in the message, and fills the route relation into a route table of the node;
s57: and the node initiating the route repair request receives the route repair confirmation message, analyzes the message, extracts the routing relation contained in the message, fills the routing relation into a routing table of the node, restarts a service message sending process and closes the route repair waiting timer.
9. A hybrid wireless network routing method as recited in claim 1, wherein: when the node has a service demand, detecting that the service of the forwarding node is busy, and adaptively selecting other paths as forwarding sites to realize service distribution, wherein the node carries out congestion detection and comprises the following steps:
s61: each station maintains a sending and forwarding task queue, the capacity of the queue is N, the node detects the number of tasks in the current queue, when a message needs to be sent or forwarded, a task is added to the tail of the queue, meanwhile, the number of the task queues is increased by one, when a sending task is finished, the next task is taken out from the head of the queue to be executed, and meanwhile, the number of the task queues is decreased by one;
s62: if the number of the tasks in the queue reaches 3/4 of the total number, the node is judged to be in a congestion state, a congestion notification message is sent to a nearby node, and a congestion detection timer is started;
s63: and (4) when the timer is overtime, detecting the number of the current queue again, if the occupied number in the task queue still reaches 3/4, sending the congestion notification message again, restarting the congestion detection timer, and sequentially circulating until the congestion state is eliminated.
10. A hybrid wireless network routing method as recited in claim 1, wherein: the node performs the service distribution process as follows:
s71: the method comprises the steps that a site receives a congestion notification message of a nearby site, marks the node as a congestion node in a routing table, and reduces a data branch flow value Y of the node to 75% of an original value;
s72: when a service message needs to be forwarded by a site with a congestion mark, searching a standby route of the route, if the standby route also has a congestion mark, carrying out forward to the next standby route, and if the standby route does not have the congestion mark, extracting message traffic value Y data in a routing table and forwarding (100-Y)% of the message forwarded by the site to the standby route;
s73: waiting for a period of time, and if no new congestion message is received, indicating that the load is balanced; if the congestion message is still received, judging whether the congestion message is the congestion message on the main route, if so, turning to S71, and if so, turning to S74;
s74: the 1/2Y packet size of Y ═ 100-Y% of the packet size allocated on the backup route is returned to the main path, and the process jumps to S73.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110068630.2A CN112822751B (en) | 2021-01-19 | 2021-01-19 | Hybrid wireless network routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110068630.2A CN112822751B (en) | 2021-01-19 | 2021-01-19 | Hybrid wireless network routing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112822751A true CN112822751A (en) | 2021-05-18 |
| CN112822751B CN112822751B (en) | 2022-04-22 |
Family
ID=75870172
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110068630.2A Active CN112822751B (en) | 2021-01-19 | 2021-01-19 | Hybrid wireless network routing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112822751B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113923748A (en) * | 2021-11-12 | 2022-01-11 | 重庆邮电大学 | Method for forming cluster network based on proxy change |
| CN114585041A (en) * | 2022-03-01 | 2022-06-03 | 海能达通信股份有限公司 | Routing protocol method, mobile ad hoc network, station and storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130094597A1 (en) * | 2011-10-18 | 2013-04-18 | Texas Instruments Incorporated | Joining Process for G3 Networks |
| CN104010343A (en) * | 2014-06-11 | 2014-08-27 | 沈阳中科博微自动化技术有限公司 | Wireless network optimization method for intelligent meter reading system |
| WO2016010920A1 (en) * | 2014-07-14 | 2016-01-21 | International Technological University | Smart meter system architecture |
| CN106358261A (en) * | 2016-09-09 | 2017-01-25 | 南方电网科学研究院有限责任公司 | Building method and system of wireless self-organizing network |
| CN107316451A (en) * | 2017-07-06 | 2017-11-03 | 武汉盛帆智能科技有限公司 | Cluster type networks meter register method and device based on wireless meter |
| US20180094948A1 (en) * | 2016-09-30 | 2018-04-05 | Aclara Technologies Llc | Meter reading schema to enhance system functionality |
| CN111031544A (en) * | 2019-12-24 | 2020-04-17 | 重庆邮电大学 | Multi-network coexisting multi-frequency-point wireless communication networking method |
-
2021
- 2021-01-19 CN CN202110068630.2A patent/CN112822751B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130094597A1 (en) * | 2011-10-18 | 2013-04-18 | Texas Instruments Incorporated | Joining Process for G3 Networks |
| CN104010343A (en) * | 2014-06-11 | 2014-08-27 | 沈阳中科博微自动化技术有限公司 | Wireless network optimization method for intelligent meter reading system |
| WO2016010920A1 (en) * | 2014-07-14 | 2016-01-21 | International Technological University | Smart meter system architecture |
| CN106358261A (en) * | 2016-09-09 | 2017-01-25 | 南方电网科学研究院有限责任公司 | Building method and system of wireless self-organizing network |
| US20180094948A1 (en) * | 2016-09-30 | 2018-04-05 | Aclara Technologies Llc | Meter reading schema to enhance system functionality |
| CN107316451A (en) * | 2017-07-06 | 2017-11-03 | 武汉盛帆智能科技有限公司 | Cluster type networks meter register method and device based on wireless meter |
| CN111031544A (en) * | 2019-12-24 | 2020-04-17 | 重庆邮电大学 | Multi-network coexisting multi-frequency-point wireless communication networking method |
Non-Patent Citations (2)
| Title |
|---|
| FAN YANG 等: "A low-cost and low-power wireless automatic meter reading node network routing algorithm", 《2014 IEEE 5TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND SERVICE SCIENCE》 * |
| 段平刚 等: "基于无线智能燃气抄表物联网的能量感知路由", 《计算机工程与设计》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113923748A (en) * | 2021-11-12 | 2022-01-11 | 重庆邮电大学 | Method for forming cluster network based on proxy change |
| CN113923748B (en) * | 2021-11-12 | 2023-06-02 | 重庆邮电大学 | Method for forming cluster network based on proxy change |
| CN114585041A (en) * | 2022-03-01 | 2022-06-03 | 海能达通信股份有限公司 | Routing protocol method, mobile ad hoc network, station and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112822751B (en) | 2022-04-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111031544B (en) | Multi-network coexisting multi-frequency-point wireless communication networking method | |
| EP1856853B1 (en) | Hybrid routing protocol for a network with mesh topology | |
| CN103119898B (en) | The equipment optimized for the delay of the end-to-end data packet transfer in wireless network and method | |
| JP4425863B2 (en) | Packet transfer system and radio base station | |
| US10397823B2 (en) | Device and method for scheduling data packet transmission in wireless networks | |
| US9526030B2 (en) | Device and method for load balancing for data packet transmissions in wireless networks | |
| US8259635B2 (en) | Automatic clustering of wireless network nodes toward selected mesh access points | |
| AU2017203559B2 (en) | Peer-to-peer communications in AMI with source-tree routing | |
| CN112822751B (en) | Hybrid wireless network routing method | |
| AU2018442113B2 (en) | Model based path selection in a bluetooth low energy, BLE, mesh network | |
| CN113572691B (en) | Method for realizing hybrid routing protocol based on time pulse source | |
| CN111510982B (en) | Data transmission method and device | |
| CN101729135B (en) | Transmission method, communication device and communication system of wireless mesh networks | |
| CN110831006A (en) | Ad hoc network system and data transmission method thereof | |
| CN110996266B (en) | Multicast group data transmission method of ad hoc network system | |
| CN116319530A (en) | Method, device, system and storage medium for message multipath routing | |
| CN115002863A (en) | Wireless network routing method and storage medium suitable for large-scale network | |
| CN111132058A (en) | Data transmission method based on transmission line sensing network and sensing network thereof | |
| CN116939678B (en) | Networking method and communication equipment | |
| CN102025707A (en) | Method, system and apparatus for data sending | |
| CN112003786A (en) | Wireless transmission routing method and device | |
| EP4059312A1 (en) | Systems and methods for operating tree-based wireless networks | |
| CN115802440A (en) | Topology discovery and route issuing method combining wireless ad hoc network and SDN | |
| Shan et al. | An Improvement of AODV Algorithm in a Large-Scale Outdoor Area for ZigBee Networks | |
| JPH08265844A (en) | Method for mobile node to form communication link with network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |