CN116233904B - Cluster-based low-power-consumption wide area network recovery method - Google Patents

Cluster-based low-power-consumption wide area network recovery method Download PDF

Info

Publication number
CN116233904B
CN116233904B CN202310510324.9A CN202310510324A CN116233904B CN 116233904 B CN116233904 B CN 116233904B CN 202310510324 A CN202310510324 A CN 202310510324A CN 116233904 B CN116233904 B CN 116233904B
Authority
CN
China
Prior art keywords
cluster
layer
nodes
node
cluster head
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
CN202310510324.9A
Other languages
Chinese (zh)
Other versions
CN116233904A (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.)
Hong Kong University Of Science And Technology Guangzhou
Shenzhen University
China Mobile Information Technology Co Ltd
Original Assignee
Hong Kong University Of Science And Technology Guangzhou
Shenzhen University
China Mobile Information Technology Co Ltd
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 Hong Kong University Of Science And Technology Guangzhou, Shenzhen University, China Mobile Information Technology Co Ltd filed Critical Hong Kong University Of Science And Technology Guangzhou
Priority to CN202310510324.9A priority Critical patent/CN116233904B/en
Publication of CN116233904A publication Critical patent/CN116233904A/en
Application granted granted Critical
Publication of CN116233904B publication Critical patent/CN116233904B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W24/00Supervisory, monitoring or testing arrangements
    • H04W24/04Arrangements for maintaining operational condition
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/24Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/248Connectivity information update
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/18Self-organising networks, e.g. ad-hoc networks or sensor networks
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Abstract

The application provides a cluster-based low-power consumption wide area network recovery method, which comprises the following steps: when a gateway in the low-power-consumption wide area network fails, a server in the low-power-consumption wide area network sends a beacon to inform a first-layer cluster head node in the first-layer cluster group to switch to a Class B mode, and communication between the first-layer cluster head node in the first-layer cluster group and all CM nodes in the first-layer cluster group is restored; the server transmits beacons layer by layer to inform cluster head nodes in other layers of cluster groups to switch to a Class B mode, and communication between the cluster head nodes in the other layers of cluster groups and all CM nodes of each layer of cluster groups is restored layer by layer; the cluster head node of each layer of cluster group receives and compresses the data sent by each layer of CM node, and the compressed data is sequentially sent to the cluster head node or gateway of the previous layer until the server receives the data and returns a confirmation frame through a downlink. The scheme provides a brand new topological structure and a data transmission scheme for emergency communication, and improves the fault tolerance of the low-power-consumption wide area network.

Description

Cluster-based low-power-consumption wide area network recovery method
Technical Field
The application belongs to the technical field of sensor networks, and particularly relates to a cluster-based low-power consumption wide area network recovery method.
Background
The low power wide area network (Low Power Wide Area Network, LPWAN) has the characteristics of low power consumption and long distance. The LPWAN is widely used in intelligent meter reading, intelligent parking, intelligent agriculture, intelligent cities and the like due to its excellent characteristics in power consumption and transmission distance.
In a practical industrial deployment, one LPWAN gateway is often responsible for the transmission of hundreds or thousands of LPWAN nodes. Because of the simple protocol design and network topology structure of the LPWAN, when a gateway breaks down due to factors such as natural disasters, malicious attacks or traffic overload, nodes in the coverage area of the gateway are disconnected from the server, and more serious, when the nodes cannot obtain an ACK (acknowledgement) frame from the LPWAN server, the nodes continuously resend data packets, and finally the energy consumption of the nodes is caused. At present, the existing research or patent cannot solve the problem well.
The LPWAN provides three different modes of LPWAN node working mechanisms aiming at different application scenes. Wherein Class a adopts a low power mode, and a terminal of Class a opens two receive windows for receiving downlink data packets only for a short time after uplink. Class B uses Beacon (Beacon) mechanism on a Class a basis to provide an additional receive window of fixed period for the terminal to turn on reception in a period that can be met. Class C always opens the receive window except for a short time when it is sent.
In a wireless sensor network, heinzelman et al propose a network protocol for improving the survival time of the wireless sensor network, namely a low-power consumption self-adaptive cluster layering protocol (Low Energy Adaptive Clustering Hierar cluster head y, LEA cluster head), and the clustering thought is proposed first: and randomly selecting Cluster heads (Cluster heads) according to 'round', wherein other nodes select Cluster heads closest to the Cluster heads to enter clusters, so that intra-Cluster communication is realized, and the Cluster heads are utilized to transmit data to a base station, thereby reducing energy consumption.
Although the above protocol can establish a topology structure from the sensor node to the base station, since different nodes in the LPWAN may be in different modes, the conventional cluster-based protocol cannot be directly applied to the LPWAN network.
Disclosure of Invention
An object of the embodiments of the present disclosure is to provide a cluster-based low-power consumption wide area network recovery method.
In order to solve the technical problems, the embodiment of the application is realized by the following steps:
the application provides a cluster-based low-power consumption wide area network recovery method, which comprises the following steps:
when a gateway in the low-power-consumption wide area network fails, a server in the low-power-consumption wide area network sends a beacon to inform a first-layer cluster head node in the first-layer cluster group to switch to a Class B mode, and communication between the first-layer cluster head node in the first-layer cluster group and all CM nodes in the first-layer cluster group is restored;
the server transmits beacons layer by layer to inform cluster head nodes in other layers of cluster groups to switch to a Class B mode, and communication between the cluster head nodes in the other layers of cluster groups and all CM nodes of each layer of cluster groups is restored layer by layer;
the cluster head node of each layer of cluster group receives and compresses the data sent by each layer of CM node, and the compressed data is sequentially sent to the cluster head node or gateway of the previous layer until the server receives the data and returns a confirmation frame through a downlink;
the first layer cluster head nodes and the cluster head nodes in other layer cluster groups are determined before the gateway fails; each cluster includes a cluster head node and a CM node.
In one embodiment, the determining of the first layer cluster head node and the cluster head nodes in the other layer cluster group includes:
the server selects an alternative cluster head node according to the received historical data packet;
screening out nodes meeting the conditions from the candidate cluster head nodes to serve as first-layer cluster head nodes;
and screening out nodes meeting the conditions from the CM nodes of the first-layer cluster group according to the first-layer cluster head nodes, and taking the nodes as cluster head nodes in other-layer cluster groups.
In one embodiment, the server selects an alternative cluster head node according to the received historical data packet, including:
and the server selects nodes in the gateway coverage intersection area according to the received historical data packet, and initializes the nodes in the gateway coverage intersection area to alternative cluster head nodes.
In one embodiment, the screening the nodes meeting the conditions from the candidate cluster head nodes as the first-layer cluster head nodes includes:
the server sets a first CAD sensitivity threshold for the alternative cluster head node through a downlink;
the node which receives the first CAD sensitivity threshold detects CAD on the channel, determines the coverage area of each node, analyzes the received data packet and forms a cluster member list corresponding to each alternative cluster head node;
and each alternative cluster head node transmits the corresponding cluster member list to the server through an uplink, and the server screens redundant alternative cluster head nodes according to all the cluster member lists by using a widest coverage principle or a least cluster group principle to obtain a final first-layer cluster head node and sends a beacon to the first-layer cluster head node.
In one embodiment, the screening of the nodes meeting the conditions from the CM nodes of the first-layer cluster group according to the first-layer cluster head node as the cluster head nodes in the other-layer cluster group includes:
the server sets a second CAD sensitivity threshold for the CM nodes of the first-layer cluster according to the cluster member list of the first-layer cluster head node;
the CM node which receives the second CAD sensitivity threshold detects CAD on the channel, determines the respective coverage area, analyzes the intercepted data packet and forms a cluster member list corresponding to each CM node;
each CM node transmits the corresponding cluster member list to a server through an uplink, and the server screens redundant CM nodes according to all the cluster member lists by using a widest coverage principle or a least cluster principle to obtain cluster head nodes of a cluster group of the next layer;
the server checks whether all the nodes belong to one of the cluster groups, if the nodes do not join the cluster groups, the server repeatedly screens the nodes meeting the conditions from the CM nodes of the first-layer cluster group, and generates the cluster head nodes of the next-layer cluster group until all the nodes join the cluster group.
In one embodiment, a server in a low-power wide area network sends a beacon to inform a first-layer cluster head node in a first-layer cluster group to switch to a Class B mode, and resumes communication between the first-layer cluster head node in the first-layer cluster group and all CM nodes in the first-layer cluster group, including:
the server sends a beacon to inform a first layer cluster head node in the first layer cluster group to switch to a Class B mode;
the first layer cluster head node is switched to a Class B mode, and the number of receiving windows is set to be the number of nodes in the first layer cluster;
the first-layer cluster head node uses a default Date Rate channel to periodically broadcast a 'hello_I_am_CH' message in the first-layer cluster group so as to restore communication with all CM nodes in the first-layer cluster group; until the first layer cluster head node contacts all CM nodes in the first layer cluster.
In one embodiment, the first layer cluster head node periodically broadcasts a "hello_i_am_ch" message within the first layer cluster using a default Date Rate channel to resume communication with all CM nodes in the first layer cluster, comprising:
the first-layer cluster head node uses a default Date Rate channel to periodically broadcast a 'hello_I_am_CH' message in the first-layer cluster, and the CM node which receives the 'hello_I_am_CH' message sends the 'hello_I_am_CM' message to the first-layer cluster head node by using the default Date Rate channel;
the first layer cluster head node which receives the Hello_I_am_CM information distributes the spare receiving window to the corresponding CM node and sends the control frame to the corresponding CM node;
and the CM node which receives the control frame sends data to the first layer cluster head node at the moment of sending time according to the allocated receiving window.
In one embodiment, the control frame includes a local time, a time at which the receive window period of the present round begins, a spreading factor, a bandwidth, a center frequency, a sequence number assigned to the CM node receive window, a number of receive windows per beacon period, and a CRC check bit.
In one embodiment, the time of transmissionDetermined according to the following formula:
wherein, the liquid crystal display device comprises a liquid crystal display device,for the time of one beacon period +.>Receiving a sequence number for a window assigned to the CM node; />The number of members within the cluster; />For the time at which the receive window period starts for the present round.
In one embodiment, when the CM node in the first-layer cluster does not receive the acknowledgement frame sent by the server after retransmitting the acknowledgement frame for a preset number of times, the corresponding CM node switches to a default Date Rate channel to perform CAD functions, so as to receive the "hello_i_am_ch" message sent by the first-layer cluster first node.
The technical scheme provided by the embodiment of the present specification can be seen from the following scheme: by combining the cluster thought and the characteristics of the LPWAN, a brand new topological structure and a data transmission scheme for emergency communication are provided, and the fault tolerance of the LPWAN is improved.
Drawings
In order to more clearly illustrate the embodiments of the present description or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described below, it being obvious that the drawings in the following description are only some of the embodiments described in the present description, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic flow chart of a cluster-based low-power consumption wide area network recovery method provided by the application;
fig. 2 is a schematic diagram of an LPWAN server provided by the present application selecting an alternative CH node;
FIG. 3 is a schematic diagram of determining coverage of CH nodes of each layer of clusters through CAD;
fig. 4 is a schematic diagram of an LPWAN network topology structure based on cluster groups according to the present application;
fig. 5 is a control frame format diagram of a CH node sending a CM node according to the present application;
fig. 6 is a schematic diagram of a CH node according to the present application assigning ping_slots to different CM nodes.
Detailed Description
In order to make the technical solutions in the present specification better understood by those skilled in the art, the technical solutions in the embodiments of the present specification will be clearly and completely described below with reference to the drawings in the embodiments of the present specification, and it is obvious that the described embodiments are only some embodiments of the present specification, not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are intended to be within the scope of the present disclosure.
In the following description, for purposes of explanation and not limitation, specific details are set forth such as the particular system architecture, techniques, etc., in order to provide a thorough understanding of the embodiments of the present application. It will be apparent, however, to one skilled in the art that the present application may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present application with unnecessary detail.
It will be apparent to those skilled in the art that various modifications and variations can be made in the specific embodiments of the application described herein without departing from the scope or spirit of the application. Other embodiments will be apparent to those skilled in the art from consideration of the specification of the present application. The specification and examples of the present application are exemplary only.
As used herein, the terms "comprising," "including," "having," "containing," and the like are intended to be inclusive and mean an inclusion, but not limited to.
Currently, when the LPWAN network suddenly crashes in the gateway, a large number of LPWAN nodes cannot reestablish communication with the network server, so that the whole LPWAN network is paralyzed. The key problem faced by this is how, after the gateway is disconnected, the individual end nodes establish connections between each other, construct a new network topology and find the gateway in the vicinity of working, offloading the communication tasks of the failed gateway to the problem of the neighbouring other gateways.
Therefore, the application designs a cluster-based low-power consumption wide area network recovery method, which can ensure that subordinate LPWAN nodes can still communicate with an LPWAN server when an LPWAN gateway is abnormal.
The application is described in further detail below with reference to the drawings and examples.
Referring to fig. 1, a flow chart of a cluster-based low-power wide area network recovery method according to an embodiment of the present application is shown.
It will be appreciated that prior to failure of the LPWAN, a cluster-based LPWAN network topology needs to be established between the LPWAN server (which may be referred to as a server) and the LPWAN end node (which may be referred to as a node) for emergency communication in the event of failure of the LPWAN.
First, selecting an alternative cluster head node.
There are multiple LPWAN gateways (may be simply referred to as gateways) in the LPWAN network scenario, and there may be a part of the gateways disconnected from the LPWAN server due to external factors (such as natural disasters, malicious attacks, etc.) or internal factors (power supply system disconnection, own hardware failure, etc.). The LPWAN server distinguishes nodes in the gateway coverage intersection area according to local historical data packets (the data packets are node-to-gateway data packets, namely uplink data packets), and the nodes (namely nodes in the gateway coverage intersection area) can still communicate with the LPWAN server through other LPWAN gateways. The LPWAN server initializes these nodes to alternative cluster head nodes (alternative CH nodes), as shown in fig. 2.
And screening out nodes meeting the conditions from the candidate cluster head nodes to serve as first-layer cluster head nodes.
The LPWAN server sets a first CAD sensitivity threshold for an alternative CH node through a downlinkReceive the first CAD sensitivity threshold +.>CAD (Channel detection mechanism ) detects on the channel, attempts to acquire the data packet transmitted by the nearby node to determine its coverage, analyzes the received data packet, and fills the radio parameters such as corresponding node ID, center Frequency, BW (BandWidth), SF (spreading factor), SNR (Signal-to-noise ratio), RSSI (Received Signal Strength Indication ), ping_slot Number (Number of receiving windows) into Cluster_Member_List (Cluster Member List, as shown in Table 1), expressed as%>,/>Is the first cluster group->Is the +.f. in the first layer cluster>Each of the candidate CH nodes, wherein a, …, B is a node within the coverage area of the candidate CH node, which may be referred to as CM (ClusterMember) node.
Watch 1 Cluster_Member_List
Node_ID CF BW SF SNR RSSI ping_slot Number
A 433MHz 250KHz 10 0dB -20dB NULL
B 433MHz 125KHz 12 2dB -10dB NULL
After a specified period of time, each candidate CH node transmits its corresponding latest cluster_member_list to the LPWAN server through an uplink, and the LPWAN server screens out redundant candidate CH nodes according to all the cluster_member_list using the widest coverage principle or the least Cluster principle to obtain a final first-layer CH node, and informs the node through a Beacon.
Illustratively, the following formula is the broadest coverage principle formula:
wherein, the liquid crystal display device comprises a liquid crystal display device,representing the number of CM nodes in the cluster_membrane_list.
And after the first layer CH node receives the Beacon frame, switching to a Class B mode. And then, setting the ping slot period of the first-layer CH node by combining the Cluster_Member_List of the first-layer CH node, so as to ensure that the times of opening the receiving window by the first-layer CH node is consistent with the number of members in a Cluster. Illustratively, the Beacon frame is 128ms, the number of ping_slots is 5, and the ping_slot period is 128 ms/5=25.6 ms.
And screening out nodes meeting the conditions from CM nodes of the first-layer cluster group according to the first-layer cluster head nodes, and taking the nodes as cluster head nodes in other-layer cluster groups.
The LPWAN server sets a second CAD sensitivity threshold for the CM node (ClusterMember node) in the first layer Cluster according to the Cluster_Member_List of the first layer CH node determined by the stepsThe CM node which has acquired the threshold value carries out CAD detection on the channel, determines the coverage of the CM node and analyzes the received data packet to form a Cluster_Member_List of the CM node, which is expressed as +.>(/>Is->The clusters of the layers are arranged in a cluster,i≠0,/>is->The>The number of alternative CH nodes), which forms a corresponding cluster_member_list with the alternative Cluster head nodes in the first layer Cluster group, which will not be described herein.
Each CM node then submits the Cluster_Member_List to the LPWAN server via the first tier CH node, which receivesAfter that, firstly remove->The first layer CH node in the tree is obtained by screening redundant CM nodes according to the principle of the widest coverage or the principle of the least cluster groupThe cluster head node of the cluster group of the next layer, exemplarily, uses the formula +.>iNot equal to 0, the CH node of the cluster of the next layer is selected. Finally, the LPWAN server checks whether all nodes are already belonged to a certain cluster group, if the nodes do not join the cluster group, the screening of the nodes meeting the conditions from the CM nodes of the first-layer cluster group is repeated, and the cluster head node of the next-layer cluster group is generated until all the nodes join the cluster group. A schematic diagram of determining coverage of CH nodes of each layer by CAD is shown in fig. 3.
The cluster-based LPWAN network topology established according to the above embodiment is shown in fig. 4.
As shown in fig. 1, the cluster-based low-power consumption wide area network recovery method may include:
s110, when a gateway in the low-power-consumption wide area network fails, a server in the low-power-consumption wide area network sends a beacon to inform a first-layer cluster head node in the first-layer cluster group to switch to a Class B mode, and communication between the first-layer cluster head node in the first-layer cluster group and all CM nodes in the first-layer cluster group is restored.
Specifically, when certain gateways in the LPWAN network fail (or are abnormal), the LPWAN server senses and notifies the first CH node to switch to emergency mode to start emergency communication.
In one embodiment, S110 may specifically include:
the server sends a beacon to inform a first layer cluster head node in the first layer cluster group to switch to a Class B mode;
the first layer cluster head node is switched to a Class B mode, and the number of receiving windows is set to be the number of nodes in the first layer cluster;
the first-layer cluster head node uses a default Date Rate channel to periodically broadcast a 'hello_I_am_CH' message in the first-layer cluster group so as to restore communication with all CM nodes in the first-layer cluster group; until the first layer cluster head node contacts all CM nodes in the first layer cluster.
When the CM node in the first-layer cluster still does not receive the confirmation frame sent by the server after retransmitting the preset times, the corresponding CM node is switched to a default Date Rate channel to perform the CAD function so as to receive the 'hello_I_am_CH' message sent by the first-layer cluster.
The first layer cluster head node uses a default Date Rate channel to periodically broadcast a hello_i_am_ch message in the first layer cluster group so as to restore communication with all CM nodes in the first layer cluster group, including:
the first-layer cluster head node uses a default Date Rate channel to periodically broadcast a 'hello_I_am_CH' message in the first-layer cluster, and the CM node which receives the 'hello_I_am_CH' message sends the 'hello_I_am_CM' message to the first-layer cluster head node by using the default Date Rate channel;
the first layer cluster head node which receives the Hello_I_am_CM information distributes the spare receiving window to the corresponding CM node and sends the control frame to the corresponding CM node; the control frame comprises local time, time for starting a period of a receiving window of the current round, a spread spectrum factor, bandwidth, center frequency, sequence numbers allocated to the receiving windows of the CM node, the number of the receiving windows of each beacon period and CRC check bits;
and the CM node which receives the control frame sends data to the first layer cluster head node at the moment of sending time according to the allocated receiving window.
Specifically, the notified first layer CH node switches to the Class B mode, and sets the number of ping_slots of the first layer CH node to the number of cluster members in the cluster. Next, the CH node periodically broadcasts a "hello_i_am_ch" message within the first layer cluster using a default Date Rate channel (e.g., sf=7, bw=250 KHz) until all CM nodes are contacted. When the CM node has not received an ACK (acknowledgement) frame from the LPWAN server after retransmitting the < Nbtrans > times (i.e. a preset number of times, which may be set according to actual requirements), and is still invalid after attempting to switch the different Date Rate schemes, it is acknowledged that the CM node has been out of connection with the LPWAN server, and then switches to a default Date Rate channel to perform CAD functions, in an attempt to receive a "hello_i_am_ch" message from the first-layer CH node.
The CM node that received the hello_i_am_ch message sends the hello_i_am_cm message to the first layer CH node at a default Date Rate.
The first layer CH node that receives the hello_i_am_cm message allocates the spare ping_slot to that CM node. Then, the first CH node transmits a control frame to the CM node, where the control frame includes a local Time (Time), a Time at which a ping_slot cycle starts (beacon_time), a spreading factor SF, a bandwidth BW, a Center Frequency (center_frequency), a sequence Number (ping_slot Number) allocated to the CM node, a ping_slot Number (i.e., the Number of members in a cluster group, ping nb) per Beacon cycle, and a CRC check bit (CRC), as shown in fig. 5.
Finally, as shown in FIG. 6, the CM node calculates the transmit time from the received control frame bySubsequently at +.>And sending data to the first layer CH node at any time.
Wherein, the liquid crystal display device comprises a liquid crystal display device,122.88s in the LPWAN for the time of one beacon period; />Sequence numbers assigned to the CM node pingslots; />The number of members within the cluster; />Is the time at which the ping slot cycle starts for this round.
S120, the server transmits beacons layer by layer to inform cluster head nodes in other layers of cluster groups to switch to a Class B mode, and communication between the cluster head nodes in the other layers of cluster groups and all CM nodes of each layer of cluster group is restored layer by layer;
s130, the cluster head node of each layer of cluster group receives the data sent by the CM node of each layer, compresses the data, and sends the compressed data to the cluster head node or gateway of the previous layer in sequence until the server receives the data and returns a confirmation frame through a downlink;
the first layer cluster head nodes and the cluster head nodes in other layer cluster groups are determined before the gateway fails; each cluster includes a cluster head node and a CM node. The cluster head nodes in the first-layer cluster group are first-layer cluster head nodes.
Specifically, when the first-layer cluster group resumes intra-cluster communication, the intra-cluster communication of the other-layer cluster groups is resumed layer by layer according to the pre-established cluster group-based LPWAN network topology structure.
After the CH nodes of each layer of cluster group pass through a round of ping_slot period, the data of all the nodes in the cluster are compressed through a data compression algorithm and then are delivered to the CH node or gateway of the last layer until the LPWAN server receives the data and returns an ACK frame, and all the LPWAN nodes are finished to resume communication with the LPWAN server. It can be understood that the first layer CH node compresses data and gives it up to the gateway, while the CH nodes of other layer clusters give it up to the last layer CH node.
By adopting the cluster-based low-power consumption wide area network recovery method provided by the embodiment of the application, when the LPWAN gateway is abnormal, subordinate LPWAN nodes can still communicate with the LPWAN server.
The cluster-based low-power-consumption wide area network recovery method provided by the embodiment of the application combines the cluster thought and the characteristics of the LPWAN, provides a brand-new topological structure and a data transmission scheme for emergency communication, and improves the fault tolerance of the LPWAN.
It should 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 one … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises an element.
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for system embodiments, since they are substantially similar to method embodiments, the description is relatively simple, as relevant to see a section of the description of method embodiments.

Claims (10)

1. A cluster-based low-power wide area network recovery method, the method comprising:
when a gateway in a low-power-consumption wide area network fails, a server in the low-power-consumption wide area network sends a beacon to inform a first-layer cluster head node in a first-layer cluster group to switch to a Class B mode, and communication between the first-layer cluster head node in the first-layer cluster group and all CM nodes in the first-layer cluster group is restored;
the server transmits beacons layer by layer to inform cluster head nodes in other layers of cluster groups to switch to a Class B mode, and communication between the cluster head nodes in the other layers of cluster groups and all CM nodes of each layer of cluster group is restored layer by layer;
the cluster head node of each layer of cluster group receives and compresses the data sent by each layer of CM node, and the compressed data is sequentially sent to the cluster head node or gateway of the previous layer until the server receives the data and returns a confirmation frame through a downlink;
wherein, the first layer cluster head node and the cluster head nodes in other layer clusters are determined before the gateway fails; each cluster includes a cluster head node and a CM node.
2. The method of claim 1, wherein the determining of the first layer cluster head node and the cluster head nodes in the other layer clusters comprises:
the server selects alternative cluster head nodes according to the received historical data packets;
screening out nodes meeting the conditions from the alternative cluster head nodes to serve as the first-layer cluster head nodes;
and screening out nodes meeting the conditions from the CM nodes of the first-layer cluster group according to the first-layer cluster head nodes, and taking the nodes as cluster head nodes in other-layer cluster groups.
3. The method of claim 2, wherein the server selects the alternative cluster head node based on the received historical data packets, comprising:
and the server selects nodes in the gateway coverage intersection area according to the received historical data packet, and initializes the nodes in the gateway coverage intersection area to the alternative cluster head nodes.
4. The method according to claim 2, wherein the screening out the nodes meeting the condition from the candidate cluster head nodes as the first-layer cluster head nodes includes:
the server sets a first CAD sensitivity threshold for the alternative cluster head node through a downlink;
performing CAD detection on the channel by the node which receives the first CAD sensitivity threshold, determining the coverage area of each node, analyzing the received data packet, and forming a cluster member list corresponding to each candidate cluster head node;
and each candidate cluster head node transmits the corresponding cluster member list to a server through an uplink, and the server screens redundant candidate cluster head nodes according to all the cluster member lists by using a widest coverage principle or a least cluster group principle to obtain a final first-layer cluster head node and sends a beacon to the first-layer cluster head node.
5. The method of claim 4, wherein the screening the nodes meeting the condition from the CM nodes of the first layer cluster according to the first layer cluster head node as cluster head nodes in other layer clusters comprises:
the server sets a second CAD sensitivity threshold for the CM node of the first-layer cluster according to the cluster member list of the first-layer cluster head node;
performing CAD detection on the channels by the CM nodes which receive the second CAD sensitivity threshold, determining respective coverage areas, analyzing intercepted data packets, and forming a cluster member list corresponding to each CM node;
each CM node transmits a corresponding cluster member list to a server through an uplink, and the server screens redundant CM nodes according to all cluster member lists by using a widest coverage principle or a least cluster principle to obtain cluster head nodes of a cluster of the next layer;
and the server checks whether all the nodes belong to one of the cluster groups, if the nodes are not added into the cluster group, repeatedly screening the nodes meeting the conditions from the CM nodes of the first-layer cluster group, and generating the cluster head nodes of the next-layer cluster group until all the nodes are added into the cluster group.
6. The method of claim 1, wherein the server in the low power wide area network sends a beacon to inform a first layer cluster head node in a first layer cluster group to switch to a Class B mode, and wherein restoring communication between the first layer cluster head node in the first layer cluster group and all CM nodes in the first layer cluster group comprises:
the server sends a beacon to inform a first layer cluster head node in the first layer cluster group to switch to a Class B mode;
the first layer cluster head node is switched to a Class B mode, and the number of receiving windows is set to be the number of nodes in the first layer cluster;
the first-layer cluster head node uses a default Date Rate channel to periodically broadcast a hello_I_am_CH message in a first-layer cluster group so as to restore communication with all CM nodes in the first-layer cluster group; until the head layer cluster head node contacts all CM nodes in the head layer cluster.
7. The method of claim 6, wherein the head-layer cluster head node periodically broadcasts a "hello_i_am_ch" message within a head-layer cluster using a default Date Rate channel to resume communication with all CM nodes in the head-layer cluster, comprising:
the first-layer cluster head node uses a default Date Rate channel to periodically broadcast a 'hello_I_am_CH' message in a first-layer cluster group, and a CM node which receives the 'hello_I_am_CH' message sends the 'hello_I_am_CM' message to the first-layer cluster head node by using the default Date Rate channel;
the first layer cluster head node which receives the Hello_I_am_CM message distributes the spare receiving window to the corresponding CM node and sends a control frame to the corresponding CM node;
and the CM node which receives the control frame sends data to the first layer cluster head node at the moment of sending time according to the allocated receiving window.
8. The method of claim 7 wherein the control frame includes a local time, a time at which a current receive window period begins, a spreading factor, a bandwidth, a center frequency, a sequence number assigned to the CM node receive window, a number of receive windows per beacon period, and a CRC check bit.
9. The method of claim 8, wherein the transmission timeDetermined according to the following formula:
wherein->For the time of one beacon period +.>Receiving a sequence number for a window assigned to the CM node; />The number of members within the cluster;for the time at which the receive window period starts for the present round.
10. The method of claim 6, wherein when the CM node in the first-layer cluster does not receive the acknowledgement frame sent by the server after retransmitting the acknowledgement frame for a preset number of times, the corresponding CM node switches to a default Date Rate channel to perform CAD functions, so as to receive a "hello_i_am_ch" message sent by the first-layer cluster head node.
CN202310510324.9A 2023-05-08 2023-05-08 Cluster-based low-power-consumption wide area network recovery method Active CN116233904B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310510324.9A CN116233904B (en) 2023-05-08 2023-05-08 Cluster-based low-power-consumption wide area network recovery method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310510324.9A CN116233904B (en) 2023-05-08 2023-05-08 Cluster-based low-power-consumption wide area network recovery method

Publications (2)

Publication Number Publication Date
CN116233904A CN116233904A (en) 2023-06-06
CN116233904B true CN116233904B (en) 2023-08-18

Family

ID=86569891

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310510324.9A Active CN116233904B (en) 2023-05-08 2023-05-08 Cluster-based low-power-consumption wide area network recovery method

Country Status (1)

Country Link
CN (1) CN116233904B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108173620A (en) * 2016-12-08 2018-06-15 南京海道普数据技术有限公司 WSN abnormal datas based on compression network coding find network system realization
CN110166933A (en) * 2019-04-30 2019-08-23 南京邮电大学 The method for building up of cluster head location model in forest environment monitoring based on difference algorithm
CN113630838A (en) * 2021-07-15 2021-11-09 天津(滨海)人工智能军民融合创新中心 Method for constructing three-dimensional space bee colony networking architecture based on similar heterogeneous cellular network
CN115022838A (en) * 2022-05-31 2022-09-06 中国电子科技集团公司信息科学研究院 Network coding communication method and device based on layered network architecture

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI326859B (en) * 2007-03-30 2010-07-01 Ind Tech Res Inst System and method for intelligent traffic control using wireless sensor and actuator networks
US8547982B2 (en) * 2011-11-23 2013-10-01 King Fahd University Of Petroleum And Minerals Wireless sensor network with energy efficient protocols
WO2021141770A1 (en) * 2020-01-06 2021-07-15 Intel Corporation Intelligent transport system vulnerable road user clustering, user profiles, and maneuver coordination mechanisms

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108173620A (en) * 2016-12-08 2018-06-15 南京海道普数据技术有限公司 WSN abnormal datas based on compression network coding find network system realization
CN110166933A (en) * 2019-04-30 2019-08-23 南京邮电大学 The method for building up of cluster head location model in forest environment monitoring based on difference algorithm
CN113630838A (en) * 2021-07-15 2021-11-09 天津(滨海)人工智能军民融合创新中心 Method for constructing three-dimensional space bee colony networking architecture based on similar heterogeneous cellular network
CN115022838A (en) * 2022-05-31 2022-09-06 中国电子科技集团公司信息科学研究院 Network coding communication method and device based on layered network architecture

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
用于电力塔远程监控的无线传感器网络装置;陈少华;郑紫微;茅;;电力自动化设备(第07期);全文 *

Also Published As

Publication number Publication date
CN116233904A (en) 2023-06-06

Similar Documents

Publication Publication Date Title
EP1708439B1 (en) Wireless communication apparatus and wireless communication system for changing transmission interval of a common broadcast signal
Li et al. A cone-based distributed topology-control algorithm for wireless multi-hop networks
US6058289A (en) Method and apparatus for low power mobile unit for cellular communications system
US7706340B2 (en) Reliable neighbor node discovery
US8194571B2 (en) Protocol for reliable, self-organizing, low-power wireless network for security and building automation systems
US7920887B2 (en) System and method for setting up P2P communication group in cellular system, and P2P communication system and method using P2P communication group
EP1743495B1 (en) Routing protocol within hybrid-cellular networks
Sharma et al. Topological Broadcasting Using Parameter Sensitivity-Based Logical Proximity Graphs in Coordinated Ground-Flying Ad Hoc Networks.
US10462844B2 (en) Dynamic packet relay apparatus and method for sensor network
CN103858372A (en) System and method for communication system with multiple point transmission
CN115669089A (en) DRX-based method and device for side link communication
CN116233904B (en) Cluster-based low-power-consumption wide area network recovery method
WO2009014278A1 (en) System and method for setting up p2p communication group in cellular system, and p2p communication system and method using p2p communication group
Shan-Shan et al. Energy efficient multipath routing using network coding in wireless sensor networks
WO2007120127A2 (en) Reliable neighbor node discovery
CN103313141A (en) Cooperative node selection establishment method for distribution type wireless multicast
CN116158141A (en) DRX-based side link communication method and device
CN111628922A (en) Network communication method, bridge device node, and network communication system
CN108696942B (en) MCS (modulation and coding scheme) adjusting method in trunking communication system
Tan et al. Long-term time-share guarantees are necessary for wireless lans
CN109413689A (en) A kind of Radio Link pull-off network detecting method
Egbogah et al. Scalable team oriented reliable multicast routing protocol for tactical mobile ad hoc networks
US11653287B2 (en) Apparatus and method for a radio access network
Daniel et al. An energy efficient system for wireless sensor networks
WO2023001216A1 (en) Method and device used in wireless communication

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
CP03 Change of name, title or address
CP03 Change of name, title or address

Address after: No. 1, Duxue Road, Nansha District, Guangzhou, Guangdong 511466

Patentee after: Hong Kong University of Science and Technology (Guangzhou)

Patentee after: SHENZHEN University

Patentee after: CHINA MOBILE INFORMATION TECHNOLOGY CO.,LTD.

Address before: 518060 No. 3688 Nanhai Road, Shenzhen, Guangdong, Nanshan District

Patentee before: SHENZHEN University

Patentee before: Hong Kong University of Science and Technology (Guangzhou)

Patentee before: CHINA MOBILE INFORMATION TECHNOLOGY CO.,LTD.