CN113938418A - Method, device, system and storage medium for node automatic standby updating path - Google Patents
Method, device, system and storage medium for node automatic standby updating path Download PDFInfo
- Publication number
- CN113938418A CN113938418A CN202111248817.7A CN202111248817A CN113938418A CN 113938418 A CN113938418 A CN 113938418A CN 202111248817 A CN202111248817 A CN 202111248817A CN 113938418 A CN113938418 A CN 113938418A
- Authority
- CN
- China
- Prior art keywords
- node
- information
- data
- sensor
- base station
- 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
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0823—Errors, e.g. transmission errors
- H04L43/0847—Transmission error
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0852—Delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/121—Shortest path evaluation by minimising delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/70—Routing based on monitoring results
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The embodiment of the invention discloses a method and a device for automatically and standby updating a path of a node, sensor node equipment and a storage medium. The method comprises the following steps: the base station of the sensor network carries out layering and clustering on the sensor nodes according to the position information of the sensor nodes; the method comprises the following steps that the determination of a transmission path is realized through information transmission by sensors in each cluster and specific sensor nodes among the clusters, the data transmission in the clusters is finally realized, a first node adds a corresponding routing node to a routing table among the clusters, and the first node has standby switching; the first node receives node data of the sensor nodes in the cluster to which the first node belongs, selects a routing node with the minimum transmission cost from a routing table as a relay node, and sends the node data to the relay node; and the relay node selects the routing node with the minimum transmission cost from the corresponding routing table as the relay node and forwards the node data until the node data is sent to the base station. The scheme realizes the optimization of energy consumption in the wireless sensor network.
Description
Technical Field
The embodiment of the invention relates to the technical field of networks, in particular to a method, a device, a system and a storage medium for automatically and standby updating a path of a node.
Background
A Wireless Sensor Network (WSN) is a distributed sensing network whose distal end is a Sensor that can sense and inspect the outside world. The sensors in the WSN communicate in a wireless mode, so that the network setting is flexible, the position of equipment can be changed at any time, and the equipment can be connected with the Internet in a wired or wireless mode. In general, a wireless sensor network can be regarded as a multi-hop ad hoc network formed by wireless communication.
The inventor finds that, in the process of applying the wireless sensor network, when a large number of wireless sensor nodes exist in the wireless sensor network, the summarized transmission of data from the wireless sensor network to the data processing center causes higher energy consumption.
Disclosure of Invention
The invention provides a method, a device, a system and a storage medium for automatically and standby updating a path of a node, which aim to solve the technical problem of high energy consumption of data summarization in a wireless sensor network in the prior art.
In a first aspect, an embodiment of the present invention provides a method for automatically backup and updating a path for a node, where the method includes:
the base station of the sensor network carries out layering and clustering on the sensor nodes according to the position information of the sensor nodes;
the base station broadcasts reference information to the sensor nodes, wherein the reference information comprises layering information and clustering information, and the clustering information is assigned with a first node and a standby first node;
in each data transmission period, a first node sends migration information to a standby first node, and broadcasts running state information of the first node to the sensor network to obtain feedback information of the first nodes in other clusters, wherein the migration information is used for designating the standby first node as a first node of the next data transmission period, and the first node is a head node of the current migration period;
the first node adds a routing node to a routing table, wherein the routing node is the first node of a cluster positioned at the next layer in the feedback information;
the first node receives node data of the sensor nodes in the cluster to which the first node belongs, selects a routing node with the minimum transmission cost from the routing table as a relay node, and sends the node data to the relay node;
the first node switches itself to a standby first node;
and the relay node selects the routing node with the minimum transmission cost from the corresponding routing table as the relay node and forwards the node data until the node data is sent to the base station.
Further, before the base station of the sensor network stratifies and clusters the sensor nodes according to the location information of the sensor nodes, the method further includes:
and the base station broadcasts an information acquisition notice to the sensor nodes to acquire the position information of the sensor nodes.
Further, the migration information and the operational state information are broadcast at a constant power.
Further, the cost between the relay node and the first node is calculated by a minimum cost function.
In a second aspect, an embodiment of the present invention further provides a device for automatically standby and updating a path for a node, where the device includes:
the hierarchical clustering unit is used for layering and clustering the sensor nodes by a base station of the sensor network according to the position information of the sensor nodes;
a first broadcasting unit, configured to broadcast, by the base station, reference information to the sensor node, where the reference information includes hierarchical information and clustering information, and the clustering information specifies a first node and a standby first node;
a second broadcasting unit, configured to send, by a first node, migration information to the standby first node in each data transmission period, and broadcast running state information of the first node to the sensor network to obtain feedback information of the first nodes in other clusters, where the migration information is used to designate the standby first node as a first node in a next data transmission period, and the first node is a head node in a current migration period;
a node adding unit, configured to add, by the first node, a routing node to a routing table, where the routing node is a first node of a cluster located in a next layer in the feedback information;
a data sending unit, configured to receive, by the first node, node data of a sensor node in a cluster to which the first node belongs, select a routing node with a minimum transmission cost from the routing table as a relay node, and send the node data to the relay node;
the node switching unit is used for switching the first node into a standby first node;
and the data forwarding unit is used for the relay node to select the routing node with the minimum transmission cost from the corresponding routing table as the relay node and forward the node data until the node data is sent to the base station.
Further, the apparatus further includes:
an information request unit, configured to broadcast, by the base station, an information acquisition notification to the sensor node to acquire location information of the sensor node.
Further, the migration information and the operational state information are broadcast at a constant power.
Further, the cost between the relay node and the first node is calculated by a minimum cost function.
In a third aspect, an embodiment of the present invention further provides a wireless sensor network system, including a base station and a plurality of wireless sensors, where the base station and the plurality of wireless sensors each include:
one or more processors;
a memory for storing one or more programs;
when executed by the one or more processors, cause the wireless sensor network to implement the node automatic backup update path method of any of the first aspects.
In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the node automatic backup update path method according to the first aspect.
The node automatic standby path updating method, the device, the network system and the storage medium are adopted, and the base station of the sensor network carries out layering and clustering on the sensor nodes according to the position information of the sensor nodes; the base station broadcasts reference information to the sensor nodes, wherein the reference information comprises layering information and clustering information, and the clustering information is assigned with a first node and a standby first node; in each data transmission period, a first node sends migration information to a standby first node, and broadcasts running state information of the first node to the sensor network to obtain feedback information of the first nodes in other clusters, wherein the migration information is used for designating the standby first node as a first node of the next data transmission period, and the first node is a head node of the current migration period; the first node adds a routing node to a routing table, wherein the routing node is the first node of a cluster positioned at the next layer in the feedback information; the first node receives node data of the sensor nodes in the cluster to which the first node belongs, selects a routing node with the minimum transmission cost from the routing table as a relay node, and sends the node data to the relay node; the first node switches itself to a standby first node; and the relay node selects the routing node with the minimum transmission cost from the corresponding routing table as the relay node and forwards the node data until the node data is sent to the base station. According to the scheme, energy consumption optimization in the data gathering process of a large number of wireless sensor nodes in the wireless sensor network to the data processing center is achieved, and the scheme of mutually serving as standby nodes can achieve a certain degree of energy balance and improve path planning efficiency and path stability.
Drawings
Fig. 1 is a flowchart of a method for automatically updating a path by a node backup according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of an apparatus for automatically backup updating a path for a node according to a second embodiment of the present invention;
fig. 3 is a schematic structural diagram of a sensor node device according to a third embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are for purposes of illustration and not limitation. It should be further noted that, for the convenience of description, only some of the structures related to the present invention are shown in the drawings, not all of the structures.
It should be noted that, for the sake of brevity, this description does not exhaust all alternative embodiments, and it should be understood by those skilled in the art after reading this description that any combination of features may constitute an alternative embodiment as long as the features are not mutually inconsistent.
The following examples are described in detail.
Example one
Fig. 1 is a flowchart of a method for automatically updating a path by a node backup according to an embodiment of the present invention. The node automatic backup update path method provided in the embodiment may be performed by various operation devices for the node automatic backup update path, where the operation devices may be implemented by software and/or hardware, and the operation devices may be formed by two or more physical entities or may be formed by one physical entity.
The application scene specifically aimed at by the scheme is a large-scale wireless sensor network, in particular to a queuing network formed by the wireless sensor network. Currently, such a wireless sensor network generally adopts a clustering structure, taking two clusters as an example, an arrival node, a transmission node and a sink node may exist in each cluster, wherein the sink node is responsible for communication between a sensing node in the cluster and a sink node in another cluster.
Specifically, referring to fig. 1, the method for automatically updating the path by the node as a backup specifically includes:
step S101: and the base station of the sensor network carries out layering and clustering on the sensor nodes according to the position information of the sensor nodes.
In the scheme, the layering and clustering of the sensor nodes are confirmed by the base station based on the position information of each sensor node. Generally, a base station itself also has location information and other basic signal parameters, a physical distance between each device can be obtained based on the respective location information, the base station divides all nodes into a plurality of layers according to the distance from the base station itself, that is, all sensor nodes are layered in a manner similar to that of division of a circular ring with the base station as a center, and clusters are divided in each layer according to the number and/or distance relationship of the sensor nodes in the layer.
In the first implementation of this embodiment, the position information is implemented by a preamble action, that is, before step S101, the method further includes:
step S100: and the base station broadcasts an information acquisition notice to the sensor nodes to acquire the position information of the sensor nodes.
Of course, it may also be that each time a sensor node in the sensor network changes, for example, when a new addition, a deletion, or a movement occurs, data updating is directly performed in the background according to the change condition, and the base station directly obtains data of all the sensor nodes from the background to obtain corresponding location information, and correspondingly performs a subsequent data transmission process.
In subsequent implementation, data transmission of the sensor network may be directly performed according to the location information obtained in the initial implementation of the solution, and if necessary, for example, when a new sensor node is added or a sensor node is disconnected and a need to reconfirm the wireless sensor network exists, step S100 is performed again to obtain the latest network state information in the wireless sensor network.
Step S102: the base station broadcasts reference information to the sensor nodes, the reference information comprises layering information and clustering information, and the clustering information is assigned with a first node and a standby first node.
And the base station broadcasts reference information to the sensor nodes, and the reference information is used for confirming the corresponding cluster distribution state by each sensor node. The reference information may be rough information or precise information. The rough information is only to record the radius range of each layer, the range of each cluster in each layer and the corresponding cluster identification in the reference information, the sensor node confirms the cluster and the corresponding cluster identification according to the relevant range, whether the same cluster belongs to the same cluster or not is confirmed through the cluster identification, the accurate information is the cluster corresponding to each layer and the sensor node corresponding to each cluster already determined in the reference information, and each sensor node can confirm the clustering result of the sensor node by directly reading the reference information. In the subsequent processing process, the first node and the standby first node are in periodic rotation and are standby mutually, and the efficiency of path planning before data transmission can be effectively improved.
In a specific implementation process, step S102 may include step S1021 and step S1022:
step S1021: the base station confirms the node density and the node number of the sensor network according to the position information;
step S1022: and the base station calculates the hierarchical information and the clustering information of the sensor network based on the node density and the node number.
Generally, layering and clustering need to be determined according to parameters such as the scale, the node density, the total number of nodes and the like of the sensor network, and the data transmission quantity of the sensor nodes needs to be referred to when necessary. In the specific clustering and layering processing process, firstly, the number of layers and the radius of the layers are confirmed, then the number of clusters corresponding to each layer is calculated, in the scheme, the number of sensor nodes in each cluster is different, and an uneven clustering mode is adopted integrally to balance the flow loads in different layers as much as possible. The clustering is further completed to obtain specific clustering information on the basis of the scale, the node density, the total number of nodes and the clustering number of the sensor network, and during specific implementation, the clustering in the scheme is realized on the basis of a centralized clustering algorithm, namely the clustering information is confirmed according to the centralized clustering algorithm.
Step S103: in each data transmission period, the first node sends migration information to the standby first node, and broadcasts running state information of the first node to the sensor network to obtain feedback information of the first nodes in other clusters, wherein the migration information is used for designating the standby first node as a first node of a next data transmission period, and the first node is a head node of the current migration period.
When data transmission is specifically realized, the first node load of each cluster is used for data summarization of sensor nodes in the cluster and data forwarding of base stations outside the cluster. In order to implement the above summarizing and forwarding processes, the transmission path needs to be confirmed by broadcasting related information. For the intra-cluster, each sensor node in the cluster directly sends data to the first node to complete data summarization, and for the extra-cluster, how to realize data transmission to the base station through the first nodes in other clusters needs to be planned.
In the scheme, the balance between the connection path stability and the transmission speed stability of the data transmission path is carried out in a data transmission period mode. In a data transmission period, data is not directly transmitted, but a next sensor node in a process of sending data to a base station in a current data transmission period and a first node in a next data transmission period cluster are confirmed in a broadcasting mode. The next sensor node in the data transmission process needs feedback of sensor nodes in other clusters, and the first node in the next data transmission period cluster directly informs, and the spare first node is directly determined to be the first node in the next period in the scheme, so that the path planning efficiency is improved under the application scene with small data transmission amount, and the data transmission effect is ensured.
In the specific processing process, the migration information and the running state information are broadcasted at constant power, so that the arrival rate of the broadcast signals and the stability of path planning are improved as much as possible.
Step S104: and the first node adds a routing node to a routing table, wherein the routing node is the first node of the cluster positioned at the next layer in the feedback information.
On the basis of the preorder processing process, the scheme actually carries out layered processing by taking the base station as a circle center, namely, each layer carries out data transmission to the center of the sensor network, and a first node of a certain outer layer cluster can add first nodes of a plurality of clusters close to one layer adjacent to the base station into a routing table to be used as a routing node. As long as the first nodes can perform corresponding feedback after receiving the broadcast, indicating that they can perform subsequent transmission to the base station.
Steps S101 to S107 described in this embodiment are not a transmission process of one cluster or one first node, and all nodes in each cluster are executed according to steps S101 to S107, so that each first node can obtain at least one first node in the next layer as a routing node. And the first node of the cluster of the upper layer and the first node of the cluster of the lower layer are connected layer by layer and are sequentially transmitted, and finally, the data transmission from the first node of any one cluster to the base station is realized.
Step S105: and the first node receives node data of the sensor nodes in the cluster to which the first node belongs, selects a routing node with the minimum transmission cost from the routing table as a relay node, and sends the node data to the relay node.
Step S106: the first node switches itself to a standby first node.
The sensor node corresponding to the node identifier determines that the first node of the next data transmission period is only the mark of the current data transmission period responding to the migration information, and does not affect the actual transmission process in the current data transmission period, and only in the next data transmission period, under the condition that the layering and clustering are not changed, the step S103 is executed from the sensor node. That is, if there is an execution of step S101 after the current data transmission period, the acknowledgement to the first node in step S104 does not contribute to the actual transmission process, and the acknowledgement is invalid.
Step S107: and the relay node selects the routing node with the minimum transmission cost from the corresponding routing table as the relay node and forwards the node data until the node data is sent to the base station.
And selecting the routing node with the minimum transmission cost in the routing table as the relay node, selecting the next relay node by the relay node in the same way, and finally sending the node data to the base station. Overall, energy consumption in each cluster is effectively balanced by a mode of first node transfer in the cluster and a mode of selecting a relay node based on transmission cost among the clusters, and adaptive balancing is performed according to deviation capable of energy consumption, so that dynamic updating of a data transmission path is realized. In a specific processing procedure, the cost between the relay node and the first node is calculated by a minimum cost function.
In addition, during specific implementation, the first node and the standby first node may maintain the relevant path information within a certain number of cycles, and the path information is re-confirmed and correspondingly transmitted according to the scheme after being used for a certain time.
The base station of the sensor network performs layering and clustering on the sensor nodes according to the position information of the sensor nodes; the base station broadcasts reference information to the sensor nodes, wherein the reference information comprises layering information and clustering information, and the clustering information is assigned with a first node and a standby first node; in each data transmission period, a first node sends migration information to a standby first node, and broadcasts running state information of the first node to the sensor network to obtain feedback information of the first nodes in other clusters, wherein the migration information is used for designating the standby first node as a first node of the next data transmission period, and the first node is a head node of the current migration period; the first node adds a routing node to a routing table, wherein the routing node is the first node of a cluster positioned at the next layer in the feedback information; the first node receives node data of the sensor nodes in the cluster to which the first node belongs, selects a routing node with the minimum transmission cost from the routing table as a relay node, and sends the node data to the relay node; the first node switches itself to a standby first node; and the relay node selects the routing node with the minimum transmission cost from the corresponding routing table as the relay node and forwards the node data until the node data is sent to the base station. According to the scheme, energy consumption optimization in the data gathering process of a large number of wireless sensor nodes in the wireless sensor network to the data processing center is achieved, and the scheme of mutually serving as standby nodes can achieve a certain degree of energy balance and improve path planning efficiency and path stability.
Example two
Fig. 2 is a schematic structural diagram of an apparatus for automatically backup updating a path for a node according to a second embodiment of the present invention. Referring to fig. 2, the node automatic backup update path apparatus includes: a hierarchical clustering unit 210, a first broadcasting unit 220, a second broadcasting unit 230, a node adding unit 240, a data transmitting unit 250, a node switching unit 260, and a data forwarding unit 270.
The hierarchical clustering unit 210 is configured to, by a base station of a sensor network, perform hierarchical clustering on sensor nodes according to location information of the sensor nodes; a first broadcasting unit 220, configured to broadcast, by the base station, reference information to the sensor node, where the reference information includes hierarchical information and clustering information, and the clustering information specifies a first node and a standby first node; a second broadcasting unit 230, configured to, in each data transmission period, send migration information to the standby first node by the first node, and broadcast running state information of the first node to the sensor network to obtain feedback information of the first nodes in other clusters, where the migration information is used to designate the standby first node as a first node in a next data transmission period, and the first node is a head node in a current migration period; a node adding unit 240, configured to add, by the first node, a routing node to a routing table, where the routing node is a first node of a cluster located in a next layer in the feedback information; a data sending unit 250, configured to receive node data of a sensor node in a cluster to which the first node belongs, select a routing node with a minimum transmission cost from the routing table as a relay node, and send the node data to the relay node; a node switching unit 260, configured to switch the first node to a standby first node; a data forwarding unit 270, configured to select, by the relay node, a routing node with the smallest transmission cost from a corresponding routing table as a relay node, and forward the node data until the node data is sent to the base station.
On the basis of the above embodiment, the apparatus further includes:
an information request unit, configured to broadcast, by the base station, an information acquisition notification to the sensor node to acquire location information of the sensor node.
On the basis of the above embodiment, the migration information and the operation state information are broadcast at a constant power.
On the basis of the above embodiment, the cost between the relay node and the first node is calculated by a minimum cost function.
The node automatic backup path updating device provided by the embodiment of the invention is included in the node automatic backup path updating device, can be used for executing the method for automatically updating the backup path updating of any node provided by the first embodiment, and has corresponding functions and beneficial effects.
It should be noted that, in this embodiment, each unit/module is not completely implemented in the same device, but is distributed to devices with different function definitions in a wireless sensor network system, and performs corresponding processing on signals transmitted between the devices, and each unit/module forms a complete complex through the corresponding processing of the transmitted signals, thereby finally achieving the design objective.
EXAMPLE III
Fig. 3 is a schematic structural diagram of a sensor node device according to a third embodiment of the present invention, as shown in fig. 3, the terminal device includes a processor 310, a memory 320, an input device 330, an output device 340, and a communication device 350; the number of the processors 310 in the terminal device may be one or more, and one processor 310 is taken as an example in fig. 3; the processor 310, the memory 320, the input device 330, the output device 340 and the communication device 350 in the terminal equipment may be connected by a bus or other means, and the connection by the bus is taken as an example in fig. 3.
The memory 320 serves as a computer-readable storage medium, and may be used to store software programs, computer-executable programs, and modules, such as program instructions/modules corresponding to the node automatic backup update path method in the embodiment of the present invention (for example, the hierarchical clustering unit 210, the first broadcasting unit 220, the second broadcasting unit 230, the node adding unit 240, the data transmitting unit 250, the node switching unit 260, and the data forwarding unit 270 in the node automatic backup update path apparatus). The processor 310 executes various functional applications and data processing of the terminal device by executing software programs, instructions and modules stored in the memory 320, that is, the above-described node automatic backup update path method is implemented.
The memory 320 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application program required for at least one function; the storage data area may store data created according to the use of the terminal device, and the like. Further, the memory 320 may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some examples, memory 320 may further include memory located remotely from processor 310, which may be connected to the terminal device via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The input device 330 may be used to receive input numeric or character information and generate key signal inputs related to user settings and function control of the terminal apparatus. The output device 340 may include a display device such as a display screen.
The terminal equipment comprises a node automatic standby updating path device, can be used for executing any node automatic standby updating path method, and has corresponding functions and beneficial effects.
Example four
Embodiments of the present invention further provide a storage medium containing computer-executable instructions, which when executed by a computer processor, are configured to perform operations related to the method for automatically backup updating a path for a node provided in any of the embodiments of the present application, and have corresponding functions and advantages.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product.
Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein. The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks. These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks. These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory. The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). The memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in the process, method, article, or apparatus that comprises the element.
It is to be noted that the foregoing is only illustrative of the preferred embodiments of the present invention and the technical principles employed. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, although the present invention has been described in greater detail by the above embodiments, the present invention is not limited to the above embodiments, and may include other equivalent embodiments without departing from the spirit of the present invention, and the scope of the present invention is determined by the scope of the appended claims.
Claims (10)
1. A method for automatically updating a path with a backup for a node is characterized by comprising the following steps:
the base station of the sensor network carries out layering and clustering on the sensor nodes according to the position information of the sensor nodes;
the base station broadcasts reference information to the sensor nodes, wherein the reference information comprises layering information and clustering information, and the clustering information is assigned with a first node and a standby first node;
in each data transmission period, a first node sends migration information to a standby first node, and broadcasts running state information of the first node to the sensor network to obtain feedback information of the first nodes in other clusters, wherein the migration information is used for designating the standby first node as a first node of the next data transmission period, and the first node is a head node of the current migration period;
confirming that the layering and clustering of the sensor nodes do not change after the current data transmission period, wherein the first node adds a routing node to a routing table, and the routing node is the first node of a cluster positioned at the next layer in the feedback information;
the first node receives node data of the sensor nodes in the cluster to which the first node belongs, selects a routing node with the minimum transmission cost from the routing table as a relay node, and sends the node data to the relay node;
the first node switches itself to a standby first node;
and the relay node selects the routing node with the minimum transmission cost from the corresponding routing table as the relay node and forwards the node data until the node data is sent to the base station.
2. The method of claim 1, wherein before the base station of the sensor network performs layering and clustering on the sensor nodes according to the location information of the sensor nodes, the method further comprises:
and the base station broadcasts an information acquisition notice to the sensor nodes to acquire the position information of the sensor nodes.
3. The method of claim 1, wherein the migration information and the operational state information are broadcast at a constant power.
4. The method of claim 1, wherein the cost between the relay node and the first node is calculated by a minimum cost function.
5. An apparatus for node automatic backup update path, comprising:
the hierarchical clustering unit is used for layering and clustering the sensor nodes by a base station of the sensor network according to the position information of the sensor nodes;
a first broadcasting unit, configured to broadcast, by the base station, reference information to the sensor node, where the reference information includes hierarchical information and clustering information, and the clustering information specifies a first node and a standby first node;
a second broadcasting unit, configured to send, by a first node, migration information to the standby first node in each data transmission period, and broadcast running state information of the first node to the sensor network to obtain feedback information of the first nodes in other clusters, where the migration information is used to designate the standby first node as a first node in a next data transmission period, and the first node is a head node in a current migration period;
a node adding unit, configured to determine that layering and clustering of the sensor nodes do not change after a current data transmission period, where the first node adds a routing node to a routing table, and the routing node is a first node of a cluster located in a next layer in the feedback information;
a data sending unit, configured to receive, by the first node, node data of a sensor node in a cluster to which the first node belongs, select a routing node with a minimum transmission cost from the routing table as a relay node, and send the node data to the relay node;
the node switching unit is used for switching the first node into a standby first node;
and the data forwarding unit is used for the relay node to select the routing node with the minimum transmission cost from the corresponding routing table as the relay node and forward the node data until the node data is sent to the base station.
6. The apparatus of claim 5, further comprising:
an information request unit, configured to broadcast, by the base station, an information acquisition notification to the sensor node to acquire location information of the sensor node.
7. The apparatus of claim 5, wherein the migration information and the operational state information are broadcast at a constant power.
8. The apparatus of claim 5, wherein the cost between the relay node and the first node is calculated by a minimum cost function.
9. A wireless sensor network system comprising a base station and a plurality of wireless sensors, each of the base station and the plurality of wireless sensors comprising:
one or more processors;
a memory for storing one or more programs;
when executed by the one or more processors, cause the wireless sensor network to implement the node automatic backup update path method of any of claims 1-4.
10. A computer-readable storage medium, on which a computer program is stored which, when executed by a processor, implements the node automatic backup upgrade path method according to any one of claims 1 to 4.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2020114247113 | 2020-12-08 | ||
| CN202011424711.3A CN112583665A (en) | 2020-12-08 | 2020-12-08 | Network data multi-path transmission method, device, system and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113938418A true CN113938418A (en) | 2022-01-14 |
| CN113938418B CN113938418B (en) | 2023-08-04 |
Family
ID=75128281
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011424711.3A Withdrawn CN112583665A (en) | 2020-12-08 | 2020-12-08 | Network data multi-path transmission method, device, system and storage medium |
| CN202111248817.7A Active CN113938418B (en) | 2020-12-08 | 2021-10-26 | Node automatic standby update path method, device, system and storage medium |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011424711.3A Withdrawn CN112583665A (en) | 2020-12-08 | 2020-12-08 | Network data multi-path transmission method, device, system and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN112583665A (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101094189A (en) * | 2007-08-10 | 2007-12-26 | 中控科技集团有限公司 | System of wireless sensor network, and cluster routing method based on the system |
| CN101183486A (en) * | 2007-12-05 | 2008-05-21 | 浙江林学院 | Reliability design method for wireless data acquisition of timber drying process |
| CN101808382A (en) * | 2010-01-20 | 2010-08-18 | 西安电子科技大学 | Data communication method of wireless sensor network |
| CN103874163A (en) * | 2014-04-02 | 2014-06-18 | 赵永翼 | Method for clustering wireless sensor network based on energy consumption balance |
| CN107787021A (en) * | 2016-08-26 | 2018-03-09 | 扬州大学 | The radio sensing network Routing Protocol of Uneven Cluster multi-hop based on balancing energy |
| CN108966239A (en) * | 2018-01-18 | 2018-12-07 | 北京交通大学 | A method of relay node is disposed based on Energy volution degree |
| CN109511152A (en) * | 2018-12-29 | 2019-03-22 | 国网辽宁省电力有限公司沈阳供电公司 | A kind of balanced cluster-dividing method of terminaloriented communication access net perception monitoring |
-
2020
- 2020-12-08 CN CN202011424711.3A patent/CN112583665A/en not_active Withdrawn
-
2021
- 2021-10-26 CN CN202111248817.7A patent/CN113938418B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101094189A (en) * | 2007-08-10 | 2007-12-26 | 中控科技集团有限公司 | System of wireless sensor network, and cluster routing method based on the system |
| CN101183486A (en) * | 2007-12-05 | 2008-05-21 | 浙江林学院 | Reliability design method for wireless data acquisition of timber drying process |
| CN101808382A (en) * | 2010-01-20 | 2010-08-18 | 西安电子科技大学 | Data communication method of wireless sensor network |
| CN103874163A (en) * | 2014-04-02 | 2014-06-18 | 赵永翼 | Method for clustering wireless sensor network based on energy consumption balance |
| CN107787021A (en) * | 2016-08-26 | 2018-03-09 | 扬州大学 | The radio sensing network Routing Protocol of Uneven Cluster multi-hop based on balancing energy |
| CN108966239A (en) * | 2018-01-18 | 2018-12-07 | 北京交通大学 | A method of relay node is disposed based on Energy volution degree |
| CN109511152A (en) * | 2018-12-29 | 2019-03-22 | 国网辽宁省电力有限公司沈阳供电公司 | A kind of balanced cluster-dividing method of terminaloriented communication access net perception monitoring |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112583665A (en) | 2021-03-30 |
| CN113938418B (en) | 2023-08-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Mundada et al. | A study on energy efficient routing protocols in wireless sensor networks | |
| JP5804504B2 (en) | Route control method for multi-hop wireless network | |
| Zhang et al. | Dynamic proxy tree-based data dissemination schemes for wireless sensor networks | |
| US10419231B2 (en) | Multi-network operation for multicast groups | |
| CN109257319B (en) | Internet of things, and routing and identifier distribution method, device, equipment and medium thereof | |
| Zhang et al. | An adaptive clustering algorithm for dynamic heterogeneous wireless sensor networks | |
| US20190165962A1 (en) | Multi-network operation with member node for multicast groups | |
| Titouna et al. | FDRA: Fault detection and recovery algorithm for wireless sensor networks | |
| CN105430598A (en) | Layered data transmission method and device of wireless sensor network | |
| Parsavand et al. | Controlling congestion in wireless sensor networks through imperialist competitive algorithm | |
| Hassan et al. | A survey on extending the lifetime for wireless sensor networks in real-time applications | |
| Mohapatra et al. | Topological localization approach for efficient energy management of WSN | |
| EP3384695B1 (en) | Handling of devices based on group membership | |
| SB et al. | Sector based multi-hop clustering protocol for wireless sensor networks | |
| CN113938418A (en) | Method, device, system and storage medium for node automatic standby updating path | |
| CN113938967B (en) | Node switching method, device and system based on migration information and storage medium | |
| CN112583666A (en) | Sensor network data transmission method, device, system and storage medium | |
| Zhu et al. | BTDGS: Binary-tree based data gathering scheme with mobile sink for wireless multimedia sensor networks | |
| CN112584459A (en) | Path confirmation method, device and system based on residual energy and storage medium | |
| Khanouche et al. | Energy efficient Multi-hops Routing protocol based on Clusters Reorganization for wireless sensor networks | |
| CN112511434A (en) | Internet of things node access path planning method, device, equipment and storage medium | |
| CN106899926B (en) | Role distribution parameter determination method and device for wireless sensor network | |
| JP6663868B2 (en) | Network system, network management method and device | |
| Kumar et al. | Optimal multipath routing using BFS for wireless sensor networks | |
| Dang et al. | Mobility support and service discovery for industrial process monitoring |
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 | ||
| CB02 | Change of applicant information |
Address after: Room 401, Building A1, Qingyun Building, No. 266, Puyun Road, Jiangbei New District, Nanjing, Jiangsu Province, 210000 Applicant after: Technology Image Technology (Nanjing) Co.,Ltd. Address before: 314000 Room 101, floor 1, building 17, No. 70, Longyuan Road, Wuzhen Town, Tongxiang City, Jiaxing City, Zhejiang Province Applicant before: Jixiang Technology (Zhejiang) Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |