CN108769941B - Method and device for collecting reliable data of wireless sensor network based on logic nodes - Google Patents

Method and device for collecting reliable data of wireless sensor network based on logic nodes Download PDF

Info

Publication number
CN108769941B
CN108769941B CN201810532402.4A CN201810532402A CN108769941B CN 108769941 B CN108769941 B CN 108769941B CN 201810532402 A CN201810532402 A CN 201810532402A CN 108769941 B CN108769941 B CN 108769941B
Authority
CN
China
Prior art keywords
node
nodes
logical
child
logic
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.)
Active
Application number
CN201810532402.4A
Other languages
Chinese (zh)
Other versions
CN108769941A (en
Inventor
唐晓岚
柴明璐
谢华
陈文龙
蒋鹤峻
陈潇然
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Dongguan Pengbo Information Technology Co ltd
Guangdong Sanyi Technology Co ltd
Original Assignee
Capital Normal University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Capital Normal University filed Critical Capital Normal University
Priority to CN201810532402.4A priority Critical patent/CN108769941B/en
Publication of CN108769941A publication Critical patent/CN108769941A/en
Application granted granted Critical
Publication of CN108769941B publication Critical patent/CN108769941B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/30—Services specially adapted for particular environments, situations or purposes
    • H04W4/38—Services specially adapted for particular environments, situations or purposes for collecting sensor information
    • 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/08—Load balancing or load distribution
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • 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 invention discloses a method and a device for collecting reliable data of a wireless sensor network based on logic nodes, wherein the method comprises the following steps: setting network level information to perform level marking on all nodes in the wireless sensor network; constructing candidate logic nodes according to the nodes marked by the levels; selecting a logic node according to the candidate logic node; and load balancing the logic nodes to collect the target data. The method can remove invalid logic nodes and redundant logic nodes, ensure that as many nodes as possible have backup forwarding nodes, reduce the control overhead of the logic nodes, improve the self-healing capability of the network, improve the reliability and robustness of the network, balance energy consumption and prolong the service life of the network.

Description

Method and device for collecting reliable data of wireless sensor network based on logic nodes
Technical Field
The invention relates to the technical field of wireless sensor networks, in particular to a method and a device for reliably collecting data of a wireless sensor network based on logic nodes.
Background
In a wireless sensor network, sensor nodes are often densely distributed in a field natural environment, the nodes are powered by a battery carried by the nodes, the energy is limited, the nodes are invalid due to the reasons of node energy exhaustion, self damage, data uploading incapability and the like, and data collection in the wireless sensor network is influenced.
In the prior art, the failure of a sensor node is an important factor for interfering the data collection of a wireless sensor network. The existing common solution is to improve the robustness and self-healing capability of the wireless sensor network through route optimization, and the method does not need to change the network topology and upgrade hardware.
The route optimization strategy generally comprises a central point redundancy strategy and a multi-path redundancy strategy, wherein the central point redundancy strategy is to arrange a plurality of central points in a network to prevent the network from being damaged due to energy exhaustion or failure of the central points. The multi-path redundancy strategy is to establish a plurality of redundant paths between a source node and a sink node, and once a node on the path fails, other paths can be selected for data transmission. Although the above strategies all alleviate the problem of energy failure of the sensor node to some extent, the above strategies are limited in generality, complex to control and do not pay more attention and optimize to node load balancing.
Disclosure of Invention
The present invention is directed to solving, at least to some extent, one of the technical problems in the related art.
Therefore, one objective of the present invention is to provide a method for reliably collecting data of a wireless sensor network based on a logic node, which has the advantages of improving the self-healing capability of the network, improving the reliability and robustness of the network, balancing energy consumption, and prolonging the service life of the network.
Another objective of the present invention is to provide a reliable data collection device for a wireless sensor network based on logical nodes.
In order to achieve the above object, an embodiment of the present invention provides a method for reliable data collection of a wireless sensor network based on a logical node, including the following steps: setting network level information to perform level marking on all nodes in the wireless sensor network; constructing candidate logic nodes according to the nodes marked by the levels; selecting a logic node according to the candidate logic node; and load balancing the logic nodes to collect target data.
According to the method for reliably collecting data of the wireless sensor network based on the logic nodes, disclosed by the embodiment of the invention, the logic nodes are further selected by constructing candidate logic nodes by carrying out hierarchical marking on all nodes in the wireless sensor network, so that the load balance is achieved, the aim of collecting target data is further fulfilled, invalid logic nodes and redundant logic nodes can be removed, the control overhead of the logic nodes is reduced while the nodes as many as possible have backup forwarding nodes, the self-healing capability of the network can be improved, the reliability and robustness of the network are improved, the energy consumption is balanced, and the service life of the network is prolonged.
In addition, the method for reliably collecting data of the wireless sensor network based on the logical nodes according to the above embodiments of the present invention may further have the following additional technical features:
further, in an embodiment of the present invention, the setting network hierarchy information further includes: initializing a hierarchical mark of a sink node to be 0, initializing a hierarchical mark of a sensor node to be infinite, initializing a child node set of the sink node to be empty, and initializing a parent node set and a child node set of the sensor node to be empty; enabling the sink node to broadcast the level message 0 of the sink node to surrounding nodes; marking the updating level of the node receiving the level message 0 as 1, recording the sink node into the father node set of the sink node, and returning a response to the sink node; after the sink node receives the response, the response sender is recorded into a child node set CL of the response sendersink(ii) a Causing the node with the level mark 1 to continue broadcasting its level message 1; judging whether the level mark of the node receiving the level message is 1 is larger than 2, if so, updating the level mark of the node to be 2, recording the level message sender into a parent node set of the node, returning a response to the level message sender, otherwise, continuously broadcasting the level message 2 by the node with the level mark of 2 until all the nodes in the wireless sensor network have the level marks, and using L to indicate that L indicates the level mark of all the nodes in the wireless sensor networkjRepresenting a physical node vjThe hierarchical marking of (2); when the sensor node receives the response, the response sender is recorded into the child node set.
Further, in one embodiment of the present invention, all nodes in the wireless sensor network are initialized to be non-leaf nodes and non-logical nodes; according to the recorded node father node set and the node child set, if the node vmIf the set of child nodes is empty, node vmThe is _ leaf attribute of (1) is set to true; from the bottommost non-leaf node vkStart, vkTo its parent node viSending child node set information, and ascending layer by layer; at the parent node viAll the seeds are collectedAfter the child node set information sent by the node, the parent node v is sentiComplete child node set CLiPerforming full combination of every two to obtain a candidate logical node set C _ LNi(ii) a For physical node v in candidate logical nodejAnd physical node vkChild node set CL ofjAnd child node set CLkComparing to obtain a common child node set and the number of elements; and if the number of the elements is zero, the elements are invalid logical nodes, and the invalid logical nodes are removed.
Further, in one embodiment of the invention, a logical node set LN is initializediIs an empty set; selecting the candidate logical node CLN with the largest element number valuej,kAs a logical node and updates a logical node set LNiWhen a plurality of candidate logical nodes with the largest element number exist, the candidate logical nodes formed by non-logical node members are preferentially selected; let the parent node viTo physical nodes v constituting a logical nodejAnd physical node vkSending ln _ confirm _ message to enable the physical node to set the self is _ ln attribute as true after receiving the message and record the identification of each other; updating SCLl,m＝SCLl,m-SCLj,k(ii) a If SCLl,mWhen size is 0, CLNl,mIs a redundant logical node and is selected from the set of candidate logical nodes C _ LNiDeleting; updating the set of candidate logical nodes C _ LNi＝C_LNi-CLNj,kUp to the set of candidate logical nodes C _ LNiIs empty.
Further, in an embodiment of the present invention, the load balancing the logical nodes to collect target data further includes:
for logical node LNA,BNode vaResidual energy of (D) is recorded as AEANode vbResidual energy of (D) is recorded as AEB(ii) a Noting the energy consumption for transmitting a single piece of data as e, node vaThe energy serving the common child node in the remaining energy is noted as LEANode vbThe energy serving the common child node in the remaining energy is noted as LEB(ii) a Node v2,v3,v4To logical node LNA,BThe upload data volume is recorded as TE2,TE3,TE4Node v1To node vaThe upload data volume is recorded as TE1Then in the logical node LNA,BMiddle node vaIs/are as follows
LEA＝AEA-TE1X e, node vbLE ofB＝AEB；
Updating LEA>LEBAnd TE2>TE3>TE4Then v is2Selection of vaUpdating LE for next hop forwarding nodeA＝LEA-TE2E; compare LEAAnd LEBSelecting the larger of them, for LEA>LEBThen v is3Selection of vaUpdating LE for next hop forwarding nodeA＝LEA-TE3E; compare LEAAnd LEBChoose the larger one, for LEA<LEBThen v is4Selection of vbUpdating LE for next hop forwarding nodeB＝LEB-TE4E; the residual energy of the two physical nodes in the logic node is compared, so that the physical node with large residual energy bears the data forwarding task of the child node with large transmission overhead, and the load balance in the logic node is realized.
In order to achieve the above object, another embodiment of the present invention provides a device for collecting reliable data of a wireless sensor network based on logical nodes, including: the setting module is used for setting network hierarchy information so as to carry out hierarchy marking on all nodes in the wireless sensor network; the building module is used for building candidate logic nodes according to the nodes marked by the levels; a selection module for selecting a logical node according to the candidate logical node; and the collection module is used for carrying out load balancing on the logic nodes so as to collect target data.
According to the reliable data collection device of the wireless sensor network based on the logic nodes, disclosed by the embodiment of the invention, the logic nodes are further selected by constructing candidate logic nodes by carrying out hierarchical marking on all nodes in the wireless sensor network, so that the load balance is achieved, the aim of collecting target data is further fulfilled, invalid logic nodes and redundant logic nodes can be removed, the control overhead of the logic nodes is reduced while the nodes as many as possible have backup forwarding nodes, the self-healing capability of the network can be improved, the reliability and robustness of the network are improved, the energy consumption is balanced, and the service life of the network is prolonged.
In addition, the wireless sensor network reliable data collection device based on the logical nodes according to the above embodiment of the present invention may further have the following additional technical features:
further, in an embodiment of the present invention, the setting module further includes: the conversion unit is used for initializing the hierarchical mark of the sink node to 0, initializing the hierarchical mark of the sensor node to infinity, initializing the child node set of the sink node to be null, and initializing the father node set and the child node set of the sensor node to be null; a first broadcasting unit, configured to enable the sink node to broadcast its hierarchical message 0 to surrounding nodes; the updating unit is used for marking the updating level of the node receiving the level message 0 as 1, recording the sink node into a parent node set of the sink node, and returning a response to the sink node; a first recording unit, configured to record a response sender in a child node set CL of the sink node after the sink node receives the responsesink(ii) a A second broadcasting unit, configured to enable the node with the level flag of 1 to continue broadcasting its level message of 1; a judging unit, configured to judge whether a level flag of a node receiving the level message 1 is greater than 2, if so, update the level flag to be 2, and record a level message sender in a parent node set of the node, and return a response to the level message sender, otherwise, the node having the level flag 2 continues to broadcast the level message 2 until all nodes in the wireless sensor network have the level flag, and use L to judge whether the level flag of the node is greater than 2, where if so, the node having the level flag to be 2 continues to broadcast the level message 2 until all nodes in thejRepresenting a physical node vjThe hierarchical marking of (2); and the second recording unit is used for recording the response sender into the child node set when the sensor node receives the response.
Further, in one embodiment of the present inventionIn an embodiment, the building block is further configured to: initializing all nodes in the wireless sensor network into non-leaf nodes and non-logic nodes; according to the recorded node father node set and the node child set, if the node vmIf the set of child nodes is empty, node vmThe is _ leaf attribute of (1) is set to true; from the bottommost non-leaf node vkStart, vkTo its parent node viSending child node set information, and ascending layer by layer; at the parent node viAfter the child node set information sent by all child nodes is collected, the father node v is subjected toiComplete child node set CLiPerforming full combination of every two to obtain a candidate logical node set C _ LNi(ii) a For physical node v in candidate logical nodejAnd physical node vkChild node set CL ofjAnd child node set CLkComparing to obtain a common child node set and the number of elements; and if the number of the elements is zero, the elements are invalid logical nodes, and the invalid logical nodes are removed.
Further, in an embodiment of the present invention, the selecting module is further configured to: initializing a logical node set LNiIs an empty set; selecting the candidate logical node CLN with the largest element number valuej,kAs a logical node and updates a logical node set LNiWhen a plurality of candidate logical nodes with the largest element number exist, the candidate logical nodes formed by non-logical node members are preferentially selected; let the parent node viTo physical nodes v constituting a logical nodejAnd physical node vkSending ln _ confirm _ message to enable the physical node to set the self is _ ln attribute as true after receiving the message and record the identification of each other; updating SCLl,m＝SCLl,m-SCLj,k(ii) a If SCLl,mWhen size is 0, CLNl,mIs a redundant logical node and is selected from the set of candidate logical nodes C _ LNiDeleting; updating the set of candidate logical nodes C _ LNi＝C_LNi-CLNj,kUp to the set of candidate logical nodes C _ LNiIs empty.
Further, in an embodiment of the present invention, the collecting module is further configured to:
for logical node LNA,BNode vaResidual energy of (D) is recorded as AEANode vbResidual energy of (D) is recorded as AEB(ii) a Noting the energy consumption for transmitting a single piece of data as e, node vaThe energy serving the common child node in the remaining energy is noted as LEANode vbThe energy serving the common child node in the remaining energy is noted as LEB(ii) a Node v2,v3,v4To logical node LNA,BThe upload data volume is recorded as TE2,TE3,TE4Node v1To node vaThe upload data volume is recorded as TE1Then in the logical node LNA,BMiddle node vaIs/are as follows
LEA＝AEA-TE1X e, node vbLE ofB＝AEB；
Updating LEA>LEBAnd TE2>TE3>TE4Then v is2Selection of vaUpdating LE for next hop forwarding nodeA＝LEA-TE2E; compare LEAAnd LEBSelecting the larger of them, for LEA>LEBThen v is3Selection of vaUpdating LE for next hop forwarding nodeA＝LEA-TE3E; compare LEAAnd LEBChoose the larger one, for LEA<LEBThen v is4Selection of vbUpdating LE for next hop forwarding nodeB＝LEB-TE4E; the residual energy of the two physical nodes in the logic node is compared, so that the physical node with large residual energy bears the data forwarding task of the child node with large transmission overhead, and the load balance in the logic node is realized.
Additional aspects and advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.
Drawings
The foregoing and/or additional aspects and advantages of the present invention will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:
fig. 1 is a flowchart of a method for reliable data collection of a wireless sensor network based on logical nodes according to an embodiment of the present invention;
FIG. 2 is a logic node diagram of a method for reliable data collection in a wireless sensor network based on logic nodes according to an embodiment of the present invention;
FIG. 3 is a flow chart of a candidate logical node construction of a method for reliable data collection in a wireless sensor network based on logical nodes according to an embodiment of the present invention;
FIG. 4 is a flow chart of candidate logical node selection for a method for reliable data collection in a wireless sensor network based on logical nodes according to an embodiment of the present invention;
FIG. 5 is a new flow chart of a set of identical child nodes of a candidate logical node of a method for reliable data collection in a wireless sensor network based on logical nodes according to an embodiment of the present invention;
FIG. 6 is a flow chart of logic node construction of a method for reliable data collection of a wireless sensor network based on logic nodes according to an embodiment of the present invention
Fig. 7 is a schematic structural diagram of a reliable data collection device of a wireless sensor network based on logical nodes according to an embodiment of the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the drawings are illustrative and intended to be illustrative of the invention and are not to be construed as limiting the invention.
The following describes a method and an apparatus for reliable data collection of a wireless sensor network based on logical nodes according to an embodiment of the present invention with reference to the accompanying drawings, and first, a method for reliable data collection of a wireless sensor network based on logical nodes according to an embodiment of the present invention will be described with reference to the accompanying drawings.
Fig. 1 is a flowchart of a method for reliable data collection of a wireless sensor network based on logical nodes according to an embodiment of the present invention.
As shown in fig. 1, the method for reliable data collection of a logic node-based wireless sensor network comprises the following steps:
before this, the meaning of each node is defined, specifically:
logical Node (LN): in the network routing process, an abstract node formed by n (n is more than or equal to 2) same-layer physical nodes with common father nodes and common child nodes is called a logic node. The method is discussed with n as 2 and using LNj,kRepresentation by physical node vjAnd vkConstituent logical nodes, and physical node vjAnd vkAt the same level.
Candidate Logical Node (CLN): nodes obtained by performing pairwise full-combination calculation on all child nodes by a parent node are called candidate logical nodes. Node viIs designated as C _ LNi(ii) a When the parent node viAnd if t child nodes exist below, the number of elements in the candidate logical node set is t (t-1)/2.
Invalid Logical Node (ILN): when the physical nodes forming the candidate logical node do not have the common child node, the candidate logical node is called an invalid logical node.
Redundant Logical Node (RLN): when the child node of the candidate logical node is covered by the selected logical node, the candidate logical node is called a redundant logical node.
In step S101, network hierarchy information is set to hierarchically label all nodes within the wireless sensor network.
In an embodiment of the invention, firstly, in the construction of the wireless sensor network, the hierarchical mark of the sink node is initialized to 0, and the hierarchical mark of the sensor node is initialized to infinity; initializing a child node set of the sink node to be empty, and initializing a father node set and a child node set of the sensor node to be empty;
further, the sink node broadcasts the level message 0 to the surrounding nodes;
further, the node receiving the layer message 0 updates the layer mark thereof to be 1, records the sink node into the father node set thereof, and returns a response to the sink node;
further, after the sink node receives the response, the response sender is recorded in the child node set CL of the sink nodesink；
Further, the node marked with level 1 continues to broadcast its level message 1;
further, the node receiving the level message 1 judges whether the level mark of the node is larger than 2, if so, the level mark is updated to be 2, the level message sender is recorded into the parent node set of the node, and a response is returned to the level message sender;
further, when the sensor node receives the response, the response sender is recorded into the child node set of the sensor node;
further, the node labeled level 2 continues to broadcast its level message 2. And so on until all nodes in the wireless sensor network have hierarchical marks, which are marked by LjRepresenting a physical node vjThe hierarchical marking of (2).
In step S102, candidate logical nodes are constructed from the hierarchically labeled nodes.
As shown in fig. 2, in one embodiment of the present invention, first, nodes in the wireless sensor network are initialized to be non-leaf nodes and non-logical nodes, i.e., the is _ leaf attribute and the is _ ln attribute are default to false.
Further, according to the node father node set and the node son node set recorded in the step one, if the node vmIf the set of child nodes is empty, node vmThe is _ leaf attribute of (1) is set to true.
Further, from the bottommost non-leaf node vk(is_leaf＝false，Lk>0) Start, vkTo its parent node viAnd sending child node set information ch _ table _ message layer by layer upwards.
Further, a parent node viAfter the ch _ table _ message sent by all child nodes is collected, v is processediComplete child node set CLiPerforming full combination of every two to obtain a candidate logic node set C _ LNiIf the number of the candidate logical nodes in the candidate logical node set is CLi_size(CLi_size-1)/2。
Further, for two physical nodes v in the candidate logical nodejAnd vkChild node set CL ofjAnd CLkComparing, recording their common child node set SCLj,k＝CLj∩CLkAnd the number of elements SCLj,k_size。
Further, if SCLj,kIf _ size is 0, the candidate logical node is an invalid logical node, and the combination is directly removed, i.e., the invalid logical node is removed.
In step S103, a logical node is selected according to the candidate logical node.
As shown in FIG. 3, in one embodiment of the invention, first, a logical node set LN is initializediIs an empty set.
Further, SCL is first selectedj,kCandidate logical node CLN with largest size valuej,kAs a logical node, update LNi＝LNi∪{CLNj,k}; when there are multiple SCLsj,kAnd the candidate logical node with the largest size value is selected preferentially.
Further, a parent node viTo two physical nodes v constituting a logical nodejAnd vkAnd sending ln _ confirm _ message, setting the self is _ ln attribute as true after the physical node receives the message, and recording the identifications of the self is _ ln attribute and the self is _ ln attribute as true.
Further, due to SCLj,kThe node in (1) is covered by the selected logic node, and other candidate logic nodes CLNl,mDeleting self-common child node set SCLl,mIn the SCLj,kElement of (1), i.e. updating the SCLl,m＝SCLl,m-SCLj,k(ii) a If SCLl,mWhen size is 0, CLNl,mFor redundant logical nodes, from a set of candidate logical nodes C _ LNiDeletion in, i.e. C _ LNi＝C_LNi-CLNl,m。
Further, a candidate logical node set C _ LN is updatedi＝C_LNi-CLNj,k. This process is repeated until the candidate logical node set C _ LNiEmpty, when the common child nodes have all been covered, logical node set LNiAll selected logical nodes are recorded.
In step S104, the logical nodes are load balanced to collect target data.
In one embodiment of the invention, first, the logical node LN is as shown in FIG. 4A,BFor example, node vaResidual energy of (D) is recorded as AEANode vbResidual energy of (D) is recorded as AEB. At the same time, let the energy consumption for transmitting a single unit of data be recorded as e, node vaThe energy serving the common child node in the remaining energy is noted as LEANode vbThe energy serving the common child node in the remaining energy is noted as LEB. Node v2,v3,v4To logical node LNA,BThe upload data volume is recorded as TE2,TE3,TE4Node v1To node vaThe upload data volume is recorded as TE1Then in the logical node LNA,BMiddle node vaLE ofA＝AEA-TE1X e, node vbLE ofB＝AEB。
Further, let LE be assumedA>LEBAnd TE2>TE3>TE4V is then2Selection of vaUpdating LE for next hop forwarding nodeA＝LEA-TE2×e。
Further, LE is then comparedAAnd LEBSelecting the larger of them, here still LEA>LEBFor example, then v3Selection of vaUpdating LE for next hop forwarding nodeA＝LEA-TE3×e。
Further, LE is comparedAAnd LEBThe larger of which is selected, here by LEA<LEBFor example, then v4Selection of vbUpdating LE for next hop forwarding nodeB＝LEB-TE4And (x e). By comparing the residual energy of the two physical nodes in the logic node, the physical node with large residual energy undertakes the data forwarding task of the child node with large transmission overhead, thereby realizing the load balance in the logic node.
With reference to fig. 5 and fig. 6, the construction and optimization process of the logical node is described in detail, and the is _ leaf and is _ ln attributes of all nodes are initialized to false. FIG. 6(a) is a network transmission hierarchy diagram in which node v1、v2、v3、v4、v5、v6The subsets are null, so all are leaf nodes, is _ leaf is set to true, and logical nodes cannot be formed. And CLA＝{v1、v2、v3、v4}，CLB＝{v2、v3、v4、v5、v6}，CLC＝{v4、v5、v6}，CLD＝{v5、v6From vA、vB、vC、vDThe logical node is started to be constructed. Node vA、vB、vC、vDTo its parent node v0Transmitting child node set information ch _ table _ message, node v0After ch _ table _ messages sent by all child nodes are received, pairwise combination is carried out on the 4 child nodes to obtain 6 candidate logical nodes, namely a node v0Candidate logical node set C _ LN of0＝{CLNA,B，CLNA,C，CLNA,D，CLNB,C，CLNB,D，CLNC,DAs shown in fig. 6 (b).
Next, C _ LN is compared and stored0And the child node set of the inner candidate logical node and the number of elements of the inner candidate logical node. SCLA,B＝{v2、v3、v4}，SCLA,B_size＝3；SCLA,C＝{v4}，SCLA,C_size＝1；
Figure BDA0001677492270000081
SCLA,D_size＝0；SCLB,C＝{v4、v5、v6}，SCLB,C_size＝3；SCLB,D＝{v5、v6}，SCLB,D_size＝2；SCLC,D＝{v5、v6}，SCLC,DThe dashed line in fig. 6(b) indicates a possible path related to the logical node. Judging the number of elements in the child node set of the candidate logical node because of the SCL A,D0, so CLNA,DDeleting the logic node for the invalid logic node to obtain C _ LN0＝{CLNA,B，CLNA,C，CLNB,C，CLNB,D，CLNC,D}。SCLA,BSize and SCLB,CThe values of _ size are all 3, and are all the largest of the candidate logical nodes, CLNA,BAnd CLNB,CMay be selected as a logical node. The CLN is selected hereA,BBeing logical nodes, LNs0＝{CLNA,B}，C_LN0＝{CLNA,C，CLNB,C，CLNB,D，CLNC,D}. Node v0To node vA、vBSending ln _ confirm _ message, vAAnd vBUpon receiving the message, the attribute is _ ln ═ true is set.
Due to the SCLA,B＝{v2、v3、v4And updating the child node sets of other candidate logical nodes and the number of elements thereof,
Figure BDA0001677492270000091
SCLA,C_size＝0；SCLB,C＝{v5、v6}，SCLB,C_size＝2；SCLB,D＝{v5、v6}，SCLB,D_size＝2；SCLC,D＝{v5、v6}，SCLC,Dthe result graph is shown in fig. 6 (c). The redundant logic node CLN is also removed firstA,CAt this time, C _ LN0＝{CLNB,C，CLNB,D，CLNC,DThe number of elements in the child node set of 3 candidate logical nodes is 2, but the node vBIs already a logical node CLNA,BSo that the CLN is selectedC,DBeing logical nodes, LNs0＝{CLNA,B，CLNC,D}，C_LN0＝{CLNB,C，CLNB,D}，SCLC,D＝{v5、v6And the updating is continued to be carried out,
Figure BDA0001677492270000092
SCLB,C_size＝0；
Figure BDA0001677492270000093
SCL B,D0 is formed; the redundant logic node is CLNB,CAnd CLNB,DDeleting redundant logical nodes to obtain
Figure BDA0001677492270000094
To this end, the logical node has been determined, i.e. LN0＝{CLNA,B，CLNC,DAnd the final result is shown in fig. 6 (d).
According to the method for reliably collecting data of the wireless sensor network based on the logic nodes, disclosed by the embodiment of the invention, the logic nodes are further selected by constructing candidate logic nodes by carrying out hierarchical marking on all nodes in the wireless sensor network, so that the load balance is achieved, the aim of collecting target data is further fulfilled, invalid logic nodes and redundant logic nodes can be removed, the control overhead of the logic nodes is reduced while the nodes as many as possible have backup forwarding nodes, the self-healing capability of the network can be improved, the reliability and robustness of the network are improved, the energy consumption is balanced, and the service life of the network is prolonged.
Next, a reliable data collection device of a wireless sensor network based on logical nodes according to an embodiment of the present invention is described with reference to the accompanying drawings.
Fig. 7 is a schematic structural diagram of a reliable data collection device of a wireless sensor network based on logical nodes according to an embodiment of the present invention.
As shown in fig. 7, the device 10 for collecting reliable data of a wireless sensor network based on logical nodes includes: a setup module 100, a build module 200, a selection module 300, and a collection module 400.
The setting module 100 is configured to set network level information to perform level marking on all nodes in the wireless sensor network. The construction module 200 is configured to construct candidate logical nodes according to the nodes after the hierarchical marking. The selection module 300 is configured to select a logical node according to the candidate logical node. The collection module 400 is used to load balance the logical nodes to collect the target data. The device has the advantages of improving the self-healing capability of the network, improving the reliability and robustness of the network, balancing energy consumption and prolonging the service life of the network.
Further, in an embodiment of the present invention, the setting module 100 further includes: the conversion unit is used for initializing the hierarchical mark of the sink node to 0, initializing the hierarchical mark of the sensor node to infinity, initializing the child node set of the sink node to be null, and initializing the father node set and the child node set of the sensor node to be null; a first broadcasting unit, configured to enable a sink node to broadcast its hierarchical message 0 to surrounding nodes; the updating unit is used for marking the updating level of the node receiving the level message 0 as 1, recording the sink node into the father node set of the node, and returning a response to the sink node; a first recording unit, configured to record the sender of the response into the child node set CL of the sink node after the sink node receives the responsesink(ii) a A second broadcasting unit, configured to enable the node with the level flag of 1 to continue broadcasting its level message of 1; a judging unit, configured to judge whether the level flag of the node receiving the level message 1 is greater than 2, if so, update the level flag of the node, and record the level message sender in its parent node set, and return a response to the level message sender, otherwise, the node having the level flag of 2 continues to broadcast the level message 2 until all nodes in the wireless sensor network have the level flag, and L is used for indicating that all nodes in the wireless sensor network have the level flagjRepresenting a physical node vjThe hierarchical marking of (2); and the second recording unit is used for recording the response sender into the child node set when the sensor node receives the response.
Further, in an embodiment of the present invention, the building module 200 is further configured to: initializing all nodes in a wireless sensor network to be non-leaf nodes and non-logic nodes(ii) a According to the recorded node father node set and the node son node set, if the node vmIf the set of child nodes is empty, node vmThe is _ leaf attribute of (1) is set to true; from the bottommost non-leaf node vkStart, vkTo its parent node viSending child node set information, and ascending layer by layer; at parent node viAfter child node set information sent by all child nodes is collected, father nodes v are subjected to information processingiComplete child node set CLiPerforming full combination of every two to obtain a candidate logical node set C _ LNi(ii) a For physical node v in candidate logical nodejAnd physical node vkChild node set CL ofjAnd child node set CLkComparing to obtain a common child node set and the number of elements; if the number of the elements is zero, the elements are invalid logic nodes, and the invalid logic nodes are removed.
Further, in an embodiment of the present invention, the selecting module 300 is further configured to: initializing a logical node set LNiIs an empty set; selecting the candidate logical node CLN with the largest element number valuej,kAs a logical node and updates a logical node set LNiWhen a plurality of candidate logical nodes with the largest element number exist, the candidate logical nodes formed by non-logical node members are preferentially selected; let the parent node viTo physical nodes v constituting a logical nodejAnd physical node vkSending ln _ confirm _ message to enable the physical node to set the self is _ ln attribute as true after receiving the message and record the identification of each other; updating SCLl,m＝SCLl,m-SCLj,k(ii) a If SCLl,mWhen size is 0, CLNl,mIs a redundant logical node and is selected from a candidate logical node set C _ LNiDeleting; updating candidate set of logical nodes C _ LNi＝C_LNi-CLNj,kUp to candidate logical node set C _ LNiIs empty.
Further, in an embodiment of the present invention, the collecting module 400 is further configured to:
for logical node LNA,BNode vaResidual energy of (D) is recorded as AEANode vbIs left overResidual energy is recorded as AEB(ii) a Noting the energy consumption for transmitting a single piece of data as e, node vaThe energy serving the common child node in the remaining energy is noted as LEANode vbThe energy serving the common child node in the remaining energy is noted as LEB(ii) a Node v2,v3,v4To logical node LNA,BThe upload data volume is recorded as TE2,TE3,TE4Node v1To node vaThe upload data volume is recorded as TE1Then in the logical node LNA,BMiddle node vaIs/are as follows
LEA＝AEA-TE1X e, node vbLE ofB＝AEB；
Updating LEA>LEBAnd TE2>TE3>TE4Then v is2Selection of vaUpdating LE for next hop forwarding nodeA＝LEA-TE2E; compare LEAAnd LEBSelecting the larger of them, for LEA>LEBThen v is3Selection of vaUpdating LE for next hop forwarding nodeA＝LEA-TE3E; compare LEAAnd LEBChoose the larger one, for LEA<LEBThen v is4Selection of vbUpdating LE for next hop forwarding nodeB＝LEB-TE4E; the residual energy of the two physical nodes in the logic node is compared, so that the physical node with large residual energy bears the data forwarding task of the child node with large transmission overhead, and the load balance in the logic node is realized.
It should be noted that the foregoing explanation on the embodiment of the method for collecting reliable data of a wireless sensor network based on a logic node is also applicable to the device for collecting reliable data of a wireless sensor network based on a logic node in this embodiment, and is not repeated here.
According to the reliable data collection device of the wireless sensor network based on the logic nodes, all nodes in the wireless sensor network are subjected to hierarchical marking to construct candidate logic nodes, and the logic nodes are further selected, so that load balance is achieved, the purpose of collecting target data is further completed, invalid logic nodes and redundant logic nodes can be removed, the control overhead of the logic nodes is reduced while the nodes as many as possible have backup forwarding nodes, the self-healing capability of the network can be improved, the reliability and robustness of the network are improved, the energy consumption is balanced, and the service life of the network is prolonged.
Furthermore, the terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In the description of the present invention, "a plurality" means at least two, e.g., two, three, etc., unless specifically limited otherwise.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
Although embodiments of the present invention have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present invention, and that variations, modifications, substitutions and alterations can be made to the above embodiments by those of ordinary skill in the art within the scope of the present invention.

Claims (2)

1. A method for reliably collecting data of a wireless sensor network based on a logic node is characterized by comprising the following steps:
setting network level information to perform level marking on all nodes in the wireless sensor network; the setting of the network hierarchy information further comprises:
initializing a hierarchical mark of a sink node to be 0, initializing a hierarchical mark of a sensor node to be infinite, initializing a child node set of the sink node to be empty, and initializing a parent node set and a child node set of the sensor node to be empty;
enabling the sink node to broadcast the level message 0 of the sink node to surrounding nodes;
marking the updating level of the node receiving the level message 0 as 1, recording the sink node into the father node set of the sink node, and returning a response to the sink node;
after the sink node receives the response, the response sender is recorded into a child node set CL of the response sendersink；
Causing the node with the level mark 1 to continue broadcasting its level message 1;
judging whether the level mark of the node receiving the level message is 1 is larger than 2, if so, updating the level mark of the node to be 2, recording the level message sender into a parent node set of the node, returning a response to the level message sender, otherwise, continuously broadcasting the level message 2 by the node with the level mark of 2 until all the nodes in the wireless sensor network have the level marks, and using L to indicate that L indicates the level mark of all the nodes in the wireless sensor networkjRepresenting a physical node vjThe hierarchical marking of (2);
when the sensor node receives the response, the response sender is recorded into the child node set;
constructing candidate logic nodes according to the nodes marked by the levels; the constructing of the candidate logical node according to the hierarchically labeled node further includes:
initializing all nodes in the wireless sensor network into non-leaf nodes and non-logic nodes;
according to the recorded node father node set and the node child set, if the node vmIf the set of child nodes is empty, then the nodevmThe is _ leaf attribute of (1) is set to true;
from the bottommost non-leaf node vkStart, vkTo its parent node viSending child node set information, and ascending layer by layer;
at the parent node viAfter the child node set information sent by all child nodes is collected, the father node v is subjected toiComplete child node set CLiPerforming full combination of every two to obtain a candidate logical node set C _ LNi；
For physical node v in candidate logical nodejAnd physical node vkChild node set CL ofjAnd child node set CLkComparing to obtain a common child node set and the number of elements;
if the number of the elements is zero, the elements are invalid logic nodes, and the invalid logic nodes are removed;
selecting a logic node according to the candidate logic node; said selecting a logical node according to said candidate logical node, further comprising:
initializing a logical node set LNiIs an empty set;
selecting the candidate logical node CLN with the largest element number valuej，kAs a logical node and updates a logical node set LNiWhen a plurality of candidate logical nodes with the largest element number exist, the candidate logical nodes formed by non-logical node members are preferentially selected;
let the parent node viTo physical nodes v constituting a logical nodejAnd physical node vkSending ln _ confirm _ message to enable the physical node to set the self is _ ln attribute as true after receiving the message and record the identification of each other;
updating SCLl，m＝SCLl，m-SCLj，k(ii) a If SCLl，mWhen size is 0, CLNl，mIs a redundant logical node and is selected from the set of candidate logical nodes C _ LNiDeleting;
updating the set of candidate logical nodes C _ LNi＝C_LNi-CLNj，kUp to the set of candidate logical nodes C _ LNiIs empty; and
load balancing the logic nodes to collect target data; the load balancing the logical nodes to collect target data further comprises:
for logical node LNA，BNode vaResidual energy of (D) is recorded as AEANode vbResidual energy of (D) is recorded as AEB(ii) a Noting the energy consumption for transmitting a single piece of data as e, node vaThe energy serving the common child node in the remaining energy is noted as LEANode vbThe energy serving the common child node in the remaining energy is noted as LEB(ii) a Node v2，v3，v4To logical node LNA，BThe upload data volume is recorded as TE2，TE3，TE4Node v1To node vaThe upload data volume is recorded as TE1Then in the logical node LNA，BMiddle node vaLE ofA＝AEA-TE1X e, node vbLE ofB＝AEB；
Updating LEA＞LEBAnd TE2＞TE3＞TE4Then v is2Selection of vaUpdating LE for next hop forwarding nodeA＝LEA-TE2×e；
Compare LEAAnd LEBSelecting the larger of them, for LEA＞LEBThen v is3Selection of vaUpdating LE for next hop forwarding nodeA＝LEA-TE3×e；
Compare LEAAnd LEBChoose the larger one, for LEA＜LEBThen v is4Selection of vbUpdating LE for next hop forwarding nodeB＝LEB-TE4×e；
The residual energy of the two physical nodes in the logic node is compared, so that the physical node with large residual energy bears the data forwarding task of the child node with large transmission overhead, and the load balance in the logic node is realized.
2. A device for reliably collecting data of a wireless sensor network based on logic nodes comprises:
the setting module is used for setting network hierarchy information so as to carry out hierarchy marking on all nodes in the wireless sensor network; the setting module further comprises:
the conversion unit is used for initializing the hierarchical mark of the sink node to 0, initializing the hierarchical mark of the sensor node to infinity, initializing the child node set of the sink node to be null, and initializing the father node set and the child node set of the sensor node to be null;
a first broadcasting unit, configured to enable the sink node to broadcast its hierarchical message 0 to surrounding nodes;
the updating unit is used for marking the updating level of the node receiving the level message 0 as 1, recording the sink node into a parent node set of the sink node, and returning a response to the sink node;
a first recording unit, configured to record a response sender in a child node set CL of the sink node after the sink node receives the responsesink；
A second broadcasting unit, configured to enable the node with the level flag of 1 to continue broadcasting its level message of 1;
a judging unit, configured to judge whether a level flag of a node receiving the level message 1 is greater than 2, if so, update the level flag to be 2, and record a level message sender in a parent node set of the node, and return a response to the level message sender, otherwise, the node having the level flag 2 continues to broadcast the level message 2 until all nodes in the wireless sensor network have the level flag, and use L to judge whether the level flag of the node is greater than 2, where if so, the node having the level flag to be 2 continues to broadcast the level message 2 until all nodes in thejRepresenting a physical node vjThe hierarchical marking of (2);
the second recording unit is used for recording the response sender into the child node set when the sensor node receives the response;
the building module is used for building candidate logic nodes according to the nodes marked by the levels; the building module is further configured to:
initializing all nodes in the wireless sensor network into non-leaf nodes and non-logic nodes;
according to the recorded node father node set and the node child set, if the node vmIf the set of child nodes is empty, node vmThe is _ leaf attribute of (1) is set to true;
from the bottommost non-leaf node vkStart, vkTo its parent node viSending child node set information, and ascending layer by layer;
at the parent node viAfter the child node set information sent by all child nodes is collected, the father node v is subjected toiComplete child node set CLiPerforming full combination of every two to obtain a candidate logical node set C _ LNi；
For physical node v in candidate logical nodejAnd physical node vkChild node set CL ofjAnd child node set CLkComparing to obtain a common child node set and the number of elements;
if the number of the elements is zero, the elements are invalid logic nodes, and the invalid logic nodes are removed;
a selection module for selecting a logical node according to the candidate logical node; the selection module is further configured to:
initializing a logical node set LNiIs an empty set;
selecting the candidate logical node CLN with the largest element number valuej，kAs a logical node and updates a logical node set LNiWhen a plurality of candidate logical nodes with the largest element number exist, the candidate logical nodes formed by non-logical node members are preferentially selected;
let the parent node viTo physical nodes v constituting a logical nodejAnd physical node vkSending ln _ confirm _ message to enable the physical node to set the self is _ ln attribute as true after receiving the message and record the identification of each other;
updating SCLl，m＝SCLl，m-SCLj，k(ii) a If SCLl，mWhen size is 0, CLNl，mIs a redundant logical node and is logically ordered from the candidate nodesEdit node set C _ LNiDeleting;
updating the set of candidate logical nodes C _ LNi＝C_LNi-CLNj，kUp to the set of candidate logical nodes C _ LNiIs empty; and
the collection module is used for carrying out load balancing on the logic nodes so as to collect target data; the collection module is further configured to:
for logical node LNA，BNode vaResidual energy of (D) is recorded as AEANode vbResidual energy of (D) is recorded as AEB(ii) a Noting the energy consumption for transmitting a single piece of data as e, node vaThe energy serving the common child node in the remaining energy is noted as LEANode vbThe energy serving the common child node in the remaining energy is noted as LEB(ii) a Node v2，v3，v4To logical node LNA，BThe upload data volume is recorded as TE2，TE3，TE4Node v1To node vaThe upload data volume is recorded as TE1Then in the logical node LNA，BMiddle node vaLE ofA＝AEA-TE1X e, node vbLE ofB＝AEB；
Updating LEA＞LEBAnd TE2＞TE3＞TE4Then v is2Selection of vaUpdating LE for next hop forwarding nodeA＝LEA-TE2×e；
Compare LEAAnd LEBSelecting the larger of them, for LEA＞LEBThen v is3Selection of vaUpdating LE for next hop forwarding nodeA＝LEA-TE3×e；
Compare LEAAnd LEBChoose the larger one, for LEA＜LEBThen v is4Selection of vbUpdating LE for next hop forwarding nodeB＝LEB-TE4×e；
The residual energy of the two physical nodes in the logic node is compared, so that the physical node with large residual energy bears the data forwarding task of the child node with large transmission overhead, and the load balance in the logic node is realized.
CN201810532402.4A 2018-05-29 2018-05-29 Method and device for collecting reliable data of wireless sensor network based on logic nodes Active CN108769941B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810532402.4A CN108769941B (en) 2018-05-29 2018-05-29 Method and device for collecting reliable data of wireless sensor network based on logic nodes

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810532402.4A CN108769941B (en) 2018-05-29 2018-05-29 Method and device for collecting reliable data of wireless sensor network based on logic nodes

Publications (2)

Publication Number Publication Date
CN108769941A CN108769941A (en) 2018-11-06
CN108769941B true CN108769941B (en) 2020-12-04

Family

ID=64003690

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810532402.4A Active CN108769941B (en) 2018-05-29 2018-05-29 Method and device for collecting reliable data of wireless sensor network based on logic nodes

Country Status (1)

Country Link
CN (1) CN108769941B (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101394321A (en) * 2008-09-25 2009-03-25 重庆邮电大学 Non-uniform clustering method for cluster wireless sensor network based on energy balance
CN102025611A (en) * 2010-10-30 2011-04-20 华南理工大学 Data transmission method of wireless sensor network
CN102892189A (en) * 2012-09-28 2013-01-23 北京航空航天大学深圳研究院 Energy consumption balance-based method for constructing data fusion tree of wireless sensor network
CN103209436A (en) * 2013-01-28 2013-07-17 南开大学 Multi-parameter information fusion sparse model based on compressive sensing theory
CN103347288A (en) * 2013-06-08 2013-10-09 哈尔滨工程大学 Wireless sensor network different-width hierarchical routing protocol method
WO2017037193A1 (en) * 2015-09-02 2017-03-09 Telefonaktiebolaget Lm Ericsson (Publ) Methods and network nodes for scalable top-of-chain selection in mobile service chaining

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101394321A (en) * 2008-09-25 2009-03-25 重庆邮电大学 Non-uniform clustering method for cluster wireless sensor network based on energy balance
CN102025611A (en) * 2010-10-30 2011-04-20 华南理工大学 Data transmission method of wireless sensor network
CN102892189A (en) * 2012-09-28 2013-01-23 北京航空航天大学深圳研究院 Energy consumption balance-based method for constructing data fusion tree of wireless sensor network
CN103209436A (en) * 2013-01-28 2013-07-17 南开大学 Multi-parameter information fusion sparse model based on compressive sensing theory
CN103347288A (en) * 2013-06-08 2013-10-09 哈尔滨工程大学 Wireless sensor network different-width hierarchical routing protocol method
WO2017037193A1 (en) * 2015-09-02 2017-03-09 Telefonaktiebolaget Lm Ericsson (Publ) Methods and network nodes for scalable top-of-chain selection in mobile service chaining

Also Published As

Publication number Publication date
CN108769941A (en) 2018-11-06

Similar Documents

Publication Publication Date Title
JP5825100B2 (en) Sensor data collection system
US7769848B2 (en) Method and systems for copying data components between nodes of a wireless sensor network
US7869349B2 (en) Method and system for deducing network routes by querying routers
US7660320B2 (en) Communication network, a method of routing data packets in such communication network and a method of locating and securing data of a desired resource in such communication network
US7782882B2 (en) Method and apparatus for distributing dynamic auto-summarization of internet protocol reachable addresses
US8842520B2 (en) Apparatus and method for identifying optimal node placement to form redundant paths around critical nodes and critical links in a multi-hop network
CA2676416C (en) System and method for automatically segmenting and merging routing domains within networks
US20050111375A1 (en) Method and apparatus for computing metric information for abstracted network links
CN102111912B (en) Centralized construction method for Zigbee homogeneous tree-type wireless sensor network
JP2009529846A (en) Tree-guided distributed link-state routing method
US7773609B2 (en) Overlay network system which constructs and maintains an overlay network
US20090073993A1 (en) Method and apparatus for network routing between a tactical network and a satellite network
WO2018080559A1 (en) Reducing flooding of link state changes in networks
WO2004004252A1 (en) Management node device, node device, network configuration management system, network configuration management method, node device control method, management node device control method
CN105430598A (en) Layered data transmission method and device of wireless sensor network
CN106814972A (en) The rollback method and device of the snapshot node of distributed block storage
CN103078796A (en) Routing calculation method and equipment
CN108769941B (en) Method and device for collecting reliable data of wireless sensor network based on logic nodes
Wang et al. Cluster maintenance in mobile ad-hoc networks
CN108011730B (en) Method and device for automatically changing ring network resources in network management system
CN103460759B (en) Communicator and method for searching path
Sharaf et al. Genetic algorithm based clustering techniques in wireless sensor networks: a comprehensive study
JP2006067377A (en) Information integration system of distributed network
JP2007156700A (en) Information retrieval method, information registration method and network service information retrieval system
KR20130068051A (en) Identifiers management apparatus and identifiers management method thereof

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
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20231205

Address after: Room 601, Unit 1, Building 6, Tian'an Digital City, No.1 Huangjin Road, Nancheng Street, Dongguan City, Guangdong Province, 523000

Patentee after: Guangdong Sanyi Technology Co.,Ltd.

Address before: Room 1109, No. 31, Nancheng Section, Guantai Road, Nancheng Street, Dongguan City, Guangdong Province, 523000

Patentee before: Dongguan Pengbo Information Technology Co.,Ltd.

Effective date of registration: 20231205

Address after: Room 1109, No. 31, Nancheng Section, Guantai Road, Nancheng Street, Dongguan City, Guangdong Province, 523000

Patentee after: Dongguan Pengbo Information Technology Co.,Ltd.

Address before: 100037 No. 105 West Third Ring Road North, Beijing, Haidian District

Patentee before: Capital Normal University