CN113543203A - Method for communication resource allocation and communication node awakening - Google Patents
Method for communication resource allocation and communication node awakening Download PDFInfo
- Publication number
- CN113543203A CN113543203A CN202010290564.9A CN202010290564A CN113543203A CN 113543203 A CN113543203 A CN 113543203A CN 202010290564 A CN202010290564 A CN 202010290564A CN 113543203 A CN113543203 A CN 113543203A
- Authority
- CN
- China
- Prior art keywords
- node
- slave
- dormant
- slave node
- information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000004891 communication Methods 0.000 title claims abstract description 99
- 238000000034 method Methods 0.000 title claims abstract description 53
- 238000013468 resource allocation Methods 0.000 title claims description 13
- 230000005540 biological transmission Effects 0.000 claims abstract description 68
- 230000007958 sleep Effects 0.000 claims description 20
- 230000002618 waking effect Effects 0.000 claims description 13
- 238000012544 monitoring process Methods 0.000 claims description 5
- 230000005059 dormancy Effects 0.000 claims description 3
- 230000004044 response Effects 0.000 claims description 3
- 230000006386 memory function Effects 0.000 claims 1
- 230000002035 prolonged effect Effects 0.000 abstract description 4
- 230000006870 function Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 239000002699 waste material Substances 0.000 description 6
- 235000008694 Humulus lupulus Nutrition 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005611 electricity Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
Images
Classifications
-
- 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/0278—Traffic management, e.g. flow control or congestion control using buffer status reports
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0209—Power saving arrangements in terminal devices
- H04W52/0225—Power saving arrangements in terminal devices using monitoring of external events, e.g. the presence of a signal
- H04W52/0248—Power saving arrangements in terminal devices using monitoring of external events, e.g. the presence of a signal dependent on the time of the day, e.g. according to expected transmission activity
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/53—Allocation or scheduling criteria for wireless resources based on regulatory allocation policies
-
- 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 application discloses a method for allocating communication resources and awakening a communication node, which is applied to a communication network, wherein the communication network comprises a main node and a slave node, and the method comprises the following steps: the master node receives at least one of a cache status report and routing node information for data transmission sent by the slave node; determining whether the slave node is a dormant node according to the received information; if so, releasing the time-frequency domain resources allocated to the dormant node, and sending a dormant instruction to the dormant node to indicate the dormant node to enter a dormant state; and reallocating the time-frequency domain resources to slave nodes in the communication network that are not dormant nodes. Through the mode, the resource is effectively saved, and the working time of the equipment is prolonged.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a method for allocating communication resources and waking up a communication node.
Background
Wireless broadband mesh (mesh) networks are mostly applied to emergency, fire fighting and other scenes. And not all mesh nodes in the network have application requirements of simultaneously transmitting and receiving data, and a typical application scenario is as follows: in a certain time period, only a part of grid nodes need to receive and transmit data; after a while, another part of the mesh nodes need to transmit and receive data.
Grid nodes in a grid network are usually battery-powered, and grid node equipment which does not have the application requirement of data receiving and sending is still in a working state, so that the continuous consumption of the battery power can be caused, and the working time of the grid node equipment is reduced.
Disclosure of Invention
The technical problem mainly solved by the application is to provide a method for adjusting and allocating communication resources and waking up communication nodes, which can effectively save resources and prolong the working time of equipment.
In order to solve the technical problem, the application adopts a technical scheme that: there is provided a method of communication resource allocation, the method being applied to a communication network comprising a master node and a slave node, the method comprising: the master node receives at least one of the cache status report sent by the slave node and the routing node information used for data transmission; determining whether the slave node is a dormant node according to the received information; if so, releasing the time-frequency domain resources allocated to the dormant node, and sending a dormant instruction to the dormant node to indicate the dormant node to enter a dormant state; and re-allocating the time-frequency domain resources to slave nodes in the communication network that are not sleeping nodes.
Wherein the determining whether the slave node is a sleeping node according to the received information comprises: if the cache state reports sent by the slave nodes are all cache without sending within a preset time span, taking the slave nodes as dormant nodes; and/or if the routing node information for data transmission does not include the slave node in a preset time length, taking the slave node as a dormant node.
Before determining whether the slave node is a sleeping node according to the received information, the method further includes: and judging whether the slave node is a backbone node or not, if not, executing the step of determining whether the slave node is a dormant node or not according to the received information.
Wherein the method further comprises: setting at least one slave node as the backbone node according to the indication of a user; and/or calculating a transmission route from each slave node to the master node according to a preset routing algorithm, and taking the slave node through which the transmission route from the slave node to the master node passes as the backbone node.
In order to solve the above technical problem, another technical solution adopted by the present application is: there is provided a method of node wake-up, the method being applied to a communication network comprising a master node and a slave node, the method comprising: after the slave node enters the dormancy, judging whether the slave node needs to transmit data or not; if yes, exiting the dormant state and completing data transmission time synchronization with a superior node of the slave node; the superior node is a previous hop node positioned in the slave node in a transmission route between the slave node and the master node; and transmitting data by using the designated time frequency domain resources.
Wherein the completing of the data transmission time synchronization with the superior node of the slave node includes: sending an access signal to the superior node; receiving reception time information generated by the upper node in response to the access signal; and completing the time synchronization of the transmission data by utilizing the receiving time information.
Wherein, the judging whether the self needs to transmit data includes: the slave node detects whether data to be sent exist in the slave node; if yes, determining that data needs to be transmitted; and/or wake up from the dormant state periodically, monitor the paging information broadcast by the communication network; and judging whether the paging information is a paged object or not based on the paging information, and if so, determining that data needs to be transmitted.
Wherein the method further comprises: periodically waking up from a sleep state, monitoring network node information broadcasted by the communication network, and acquiring a transmission route of the communication network according to the network node information; measuring the communication state information of the superior node and other adjacent nodes, and judging whether the communication state information of the superior node meets a preset condition; if so, selecting one other adjacent node as a new superior node of the slave node by using the communication state information of the other adjacent node and the transmission route of the communication network; wherein the communication state information includes at least one of a reception time, a frequency offset, and a signal strength.
In order to solve the above technical problem, the present application adopts another technical solution: there is provided a network node comprising a processor, a memory and a communication circuit, the processor being coupled to the memory and the communication circuit, respectively, the processor controlling itself and the memory, the communication circuit implementing the steps of the method as described above when in operation.
In order to solve the above technical problem, the present application adopts another technical solution that: there is provided an apparatus having a storage function, storing program data executable to implement the steps in the method as described above.
The beneficial effect of this application is: different from the situation of the prior art, in the application, the master node receives at least one of the cache state report sent by the slave node and the routing node information used for data transmission, and judges whether the slave node is a dormant node according to the cache state report and/or the routing node information used for data transmission, if so, the time-frequency domain resource of the dormant node is released and allocated to the slave node which is not the dormant node for use, so that the resource waste is avoided, the consumption of the dormant state on electric quantity is low, and the use time of the equipment can be effectively prolonged.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts. Wherein:
fig. 1 is a flowchart illustrating a first embodiment of a communication resource allocation method provided in the present application;
fig. 2 is a schematic structural diagram of a communication network to which the method for communication resource allocation provided in the present application is applied;
fig. 3 is a flowchart illustrating a communication resource allocation method according to a second embodiment of the present application;
FIG. 4 is a flowchart illustrating an embodiment of a method for waking up a node provided herein;
fig. 5 is a schematic flowchart of an embodiment of a method for waking up a node and a step of determining whether the node needs to transmit data;
fig. 6 is a flowchart illustrating a method for waking up a node according to a second embodiment of the present application;
fig. 7 is a schematic structural diagram of an embodiment of a network node provided in the present application;
fig. 8 is a schematic structural diagram of a device with a storage function provided in the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Referring to fig. 1, fig. 1 is a flowchart illustrating a communication resource allocation method according to a first embodiment of the present application. The communication resource allocation method provided by the application comprises the following steps:
s101: and the master node receives at least one of the cache status report and the routing node information for data transmission sent by the slave node.
In a specific implementation scenario, please refer to fig. 2 in combination, and fig. 2 is a schematic structural diagram of a communication network to which the method for allocating communication resources provided in the present application is applied. In this implementation scenario, the communication network is a mesh network. In the communication network shown in fig. 2, node a is a master node of the communication network, and nodes B, C, D, E, F and G are slave nodes of the communication network.
In this implementation scenario, the slave node sends the cache status report and/or the routing node information for data transmission to the master node, where the slave node sends the information to the master node in 1 hop, for example, the slave node B sends the information to the master node a, and the slave node C sends the information to the master node a through the slave node B in multiple hops. The slave node may send the information to the master node periodically, or may send the information based on an event trigger, or in response to a request from the master node. The Buffer Status Report (Buffer Status Report) is used for indicating how much data is needed to be sent by the slave node currently, and the routing node information is used for indicating the information of the slave node passed by at least one transmission route through which the current node sends the information to the master node. The master node receives at least one of the cache status reports and routing node information for data transmission sent by the slave nodes.
S102: and determining whether the slave node is a dormant node according to the received information. If yes, go to step S103.
In a specific implementation scenario, the master node determines whether the slave node is a sleeping node according to the received cache status report. Specifically, within the preset time length, it is obtained that all the buffer status reports sent by the slave node are 0 (that is, there is no buffer to be sent), which indicates that the slave node has no data to be transmitted within the preset time length, and therefore, it is determined that the slave node is a dormant node. In the technical solution provided by the present application, a cache status report of 0 specifically means that a parameter used for indicating a size of data to be sent currently by a slave node in the cache status report is 0, that is, there is no cache data to be sent. In other implementation scenarios, the master node determines whether the slave node is a sleeping node according to the received routing node information for data transmission. Specifically, within a preset time length, the routing node information for data transmission does not include the slave node, which means that other slave nodes do not need to pass through the slave node when sending information to the master node, and the slave node is taken as a dormant node.
In other implementation scenarios, the master node may also determine whether the node is a sleeping node according to the received cache status report and the routing node information for data transmission, and the specific determination basis and determination method are substantially the same as those described above, and are not described here again.
S103: and releasing the time frequency domain resources allocated to the dormant node, and sending a dormant instruction to the dormant node to indicate the dormant node to enter a dormant state.
In a specific implementation scenario, the master node releases the time-frequency domain resources originally allocated to the sleeping node, and sends a sleeping instruction to the sleeping node to instruct the sleeping node to enter a sleeping state. When the dormant node enters the dormant state, the power consumption of the dormant node is reduced, and any time frequency domain resource is not occupied.
S104: reallocating the time-frequency domain resources to slave nodes in the communication network that are not dormant nodes.
In a specific implementation scenario, when the sleeping node enters the sleeping state, the time-frequency domain resources of the sleeping node are reallocated to the slave nodes which are not sleeping nodes in the communication network, so that the time-frequency domain resources are fully utilized. For example, a buffer status report of each slave node which is not a sleeping node may be acquired, and the time-frequency domain resource may be allocated to the slave node whose buffer status report is greater than a preset threshold. Or may be randomly assigned to any one or more slave nodes that are not sleeping nodes.
As can be seen from the above description, in this embodiment, by receiving at least one of the buffer status report sent by the slave node and the routing node information used for data transmission, and determining whether the slave node is a dormant node according to the buffer status report and/or the routing node information used for data transmission, if so, releasing the time-frequency domain resource of the dormant node and allocating the resource to the slave node that is not a dormant node for use, so as to avoid resource waste, and the consumption of the power by the dormant state is low, which can effectively prolong the service time of the device.
Referring to fig. 3, fig. 3 is a flowchart illustrating a communication resource allocation method according to a second embodiment of the present application. The communication resource allocation method provided by the application comprises the following steps:
s301: and the master node receives at least one of the cache status report and the routing node information for data transmission sent by the slave node.
In a specific implementation scenario, this step is substantially the same as step S101 of the first embodiment of the communication resource allocation method provided in this application, and details are not repeated here.
S302: and judging whether the slave node is a backbone node or not, and if not, executing the step S303.
In a specific implementation scenario, before determining whether a slave node is a sleeping node, it is determined whether the slave node is a backbone node, if the slave node is a backbone node, the slave node may not be a sleeping node, and if the slave node is not a backbone node, the slave node may be a sleeping node.
In this implementation scenario, the user may indicate one or more slave nodes as the backbone node, and the master node sets at least one slave node as the backbone node according to the indication of the user. In other implementation scenarios, the transmission route from each slave node to the master node may also be calculated according to a preset routing algorithm, and the slave node through which the transmission route from the slave node to the master node passes is used as the backbone node. The predetermined routing algorithm may be the shortest routing algorithm, the best signal routing algorithm, or other routing algorithm. It is not limited here, and only the same routing algorithm needs to be used for determination.
Specifically, please refer to fig. 2. According to a routing algorithm (e.g. shortest routing algorithm), the transmission from node C and node E to the master node a needs to pass through the slave node B, and the slave node B is a backbone node, the transmission from node F and node G to the master node a needs to pass through the slave node B and node C, and the slave node C is also a backbone node, and the slave node E is a non-backbone node.
S303: and determining whether the slave node is a dormant node according to the received information. If yes, go to step S304.
S304: and releasing the time frequency domain resources allocated to the dormant node, and sending a dormant instruction to the dormant node to indicate the dormant node to enter a dormant state.
S305: reallocating the time-frequency domain resources to slave nodes in the communication network that are not dormant nodes.
In a specific implementation scenario, steps S303 to S305 are substantially the same as steps S102 to S104 of the first embodiment of the communication resource allocation method provided in the present application, and are not described herein again.
As can be seen from the above description, in this embodiment, before determining whether a slave node is a sleeping node, it is determined whether the slave node is a backbone node, and if the slave node is a backbone node, the slave node is not used as a sleeping node, so that the normal operation of the communication network can be maintained, and the waste of resources is avoided.
Referring to fig. 4, fig. 4 is a flowchart illustrating a method for waking up a node according to an embodiment of the present disclosure. The node awakening method provided by the application comprises the following steps:
s401: and after the slave node enters the dormancy, judging whether the slave node needs to transmit data. If yes, go to step S402.
In a specific implementation scenario, after the slave node enters the sleep state, it is determined whether it needs to transmit data. Specifically, it may be to detect whether there is data to be transmitted, for example, if the user specifies that the slave node transmits data, the slave node needs to transmit data. Or the next level node of the slave node has data to transmit through the slave node, the slave node needs to transmit the data.
Referring to fig. 2, the upper node is a previous hop node of the transmission route between the slave node and the master node, and the lower node is a next hop node of the transmission route between the other slave nodes and the master node and including the slave node. For example, in fig. 2, the slave node C is a next hop node of the slave node B, and the slave node B is a previous hop node of the slave node C.
S402: and exiting the sleep state and completing the data transmission time synchronization with the superior node of the slave node.
In a specific implementation scenario, when the current slave node determines that it needs to transmit data, it exits from the sleep state and completes data transmission time synchronization with the upper node. In this implementation scenario, the current slave node sends an access signal to the upper node, and the upper node calculates time information (e.g., receiving time and/or delay) of receiving the access signal and sends the time information to the current slave node, so that the current slave node obtains the current route transmission delay according to the time information to complete data transmission time synchronization.
S403: and transmitting data by using the designated time frequency domain resources.
In a specific implementation scenario, after calculating the time and/or the time delay of receiving the access signal, the upper node of the current slave node sends the time and/or the time delay to the master node, so that the master node obtains the time delay of the transmission route of the current slave node, and allocates a time-frequency domain resource to the current slave node. And the current slave node transmits data by using the time frequency domain resources allocated by the master node.
As can be seen from the above description, in this embodiment, when the current slave node needs to transmit data, the slave node exits from the sleep state, completes data transmission time synchronization with the upper node, and transmits data by using the specified time-frequency domain resource, so that the data transmission function can be quickly recovered, and the utilization rate of the resource is effectively improved.
Referring to fig. 5, fig. 5 is a flowchart illustrating a method for node wake-up and a step of determining whether to transmit data. The present application and the superior node of the slave node completing data transmission time synchronization includes:
s501: and periodically waking up from a sleep state and monitoring paging information broadcast by the communication network.
In a specific implementation scenario, after the slave node enters the sleep state, the slave node periodically wakes up from the sleep state to monitor the paging information broadcast by the communication network, and in other implementation scenarios, the slave node also monitors the network node information broadcast by the communication network.
S502: and judging whether the paging information is a paged object or not based on the paging information. If yes, go to step S503.
In a specific implementation scenario, the slave node determines whether it has a data transmission requirement according to the paging information.
S503: it is determined that data needs to be transmitted.
Further, the paging message also includes the time-frequency domain resources allocated after the slave node wakes up. If the slave node is judged to have the requirement of transmitting data, the slave node wakes up from the sleep state and transmits the data transmitted by the band by adopting the time frequency domain resources which are allocated to the node and are included in the paging message.
As can be seen from the above description, in this embodiment, the slave node entering the sleep state wakes up from the sleep state periodically and determines whether there is a need to transmit data, and wakes up and transmits data when there is a need to transmit data, so as to avoid a problem of data transmission delay caused by the fact that the sleep slave node cannot transmit data, and fully utilize communication resources of the communication network.
Referring to fig. 6, fig. 6 is a flowchart illustrating a method for waking up a node according to a second embodiment of the present application. The node awakening method provided by the application comprises the following steps:
s601: and periodically waking up from a sleep state, and monitoring network node information broadcasted by the communication network.
In a specific implementation scenario, after the slave node enters the sleep state, the slave node periodically wakes up from the sleep state to monitor the network node information broadcast by the communication network. The network node message includes transmission routes in the communication network.
S602: and acquiring the transmission route of the communication network according to the network node information.
In a specific implementation scenario, the transmission route of the communication network is obtained according to the network node information, and the transmission route related to the slave node is obtained from the transmission route.
S603: and measuring the communication state information of the superior node and other adjacent nodes.
In a specific implementation scenario, communication state information of an upper node of the slave node and other neighboring nodes adjacent to the slave node is obtained from a transmission route related to the node, and the communication state includes at least one of a reception time, a frequency offset, and a signal strength.
S604: and judging whether the communication state information of the superior node meets a preset condition. If yes, go to step S605.
In a specific implementation scenario, whether the communication state information of the superordinate node meets a preset condition is determined according to the acquired communication state information of the superordinate node and the communication state information of other adjacent nodes. For example, the preset condition is that the signal strength of the upper node is lower than the signal strength of other adjacent nodes, or the preset condition is that the signal strength of the upper node is lower than a preset threshold.
S605: and selecting one other adjacent node as a new superior node of the slave node by using the communication state information of the other adjacent node and the transmission route of the communication network.
In a specific implementation scenario, if the communication status of the upper communication node satisfies a predetermined condition (the signal strength of the upper communication node is lower than a predetermined threshold and/or the signal strengths of other neighboring nodes), an appropriate one of the other neighboring nodes is selected as a new upper node by using the communication status information of the other neighboring nodes and the transmission route of the communication network. The one with the best signal strength can be selected from the other neighboring nodes as the new superior node.
In another implementation scenario, if the communication status information of the upper node does not satisfy the preset condition, the upper node is continuously used as the upper node of the slave node.
In this implementation scenario, after a new upper node of the slave node is determined, the slave node synchronizes (including synchronization frequency offset and/or time) with data transmission of the upper node according to the frequency offset and/or the receiving time (or the time delay calculated according to the receiving time) of obtaining the new upper node.
In other implementation scenarios, after the original upper node of the slave node is used as the upper node, the slave node synchronizes (including synchronizing frequency offset and/or time) with data transmission of the upper node according to the frequency offset and/or the receiving time (or the time delay calculated according to the receiving time) obtained from the original upper node.
As can be seen from the above description, in this embodiment, after the slave node in the sleep state wakes up, a suitable slave node is selected as the upper node of the slave node according to the communication state information of the upper node and other neighboring nodes, so that the communication quality of the communication network can be effectively ensured.
Referring to fig. 7, fig. 7 is a schematic structural diagram of an embodiment of a network node according to the present application, where the network node includes: a processor 71, a memory 72 and a communication circuit 73, the processor 71 being coupled to the memory 72 and the communication circuit 73, respectively, the processor 71 operatively controlling itself and the memory 72 and the communication circuit 73 to implement the following method.
When the network node is a master node, the communication circuit 73 receives at least one of a cache status report and routing node information for data transmission sent from the node. Processor 71 determines from the received information whether the slave node is a sleeping node. If yes, the processor 71 releases the time-frequency domain resources allocated to the sleeping node, and sends a sleeping instruction to the sleeping node through the communication circuit 73 to instruct the sleeping node to enter a sleeping state. The processor 71 reallocates the time-frequency domain resources to a slave node in the communication network that is not a sleeping node.
When the network node is a slave node, after the node goes to sleep, the processor 71 determines whether it needs to transmit data. If yes, the processor 71 controls the slave node to exit from the sleep state, and the processor 71 controls the communication circuit 73 to transmit data by using the specified time frequency domain resource in synchronization with the data transmission completion time of the upper node of the network node.
As can be seen from the above description, in the embodiment, the network node receives at least one of the buffer status report sent by the slave node and the routing node information used for data transmission, and determines whether the slave node is a dormant node according to the buffer status report and/or the routing node information used for data transmission, if so, the time-frequency domain resource of the dormant node is released and allocated to the slave node that is not the dormant node for use, so that resource waste is avoided, and the consumption of the power amount in the dormant state is low, which can effectively prolong the service time of the device.
Referring to fig. 8, fig. 8 is a schematic structural diagram of an embodiment of a device with a storage function provided in the present application. The means 80 with storage function has stored therein at least one program instruction 81, the program instruction 81 being for performing the method as shown in fig. 1-6. In one embodiment, the apparatus with storage function may be a storage chip in a device, a hard disk, or a removable hard disk or other readable and writable storage tool such as a flash disk, an optical disk, or the like, and may also be a server or the like.
As can be seen from the above description, the program or the instruction stored in the embodiment of the apparatus with storage function in this embodiment may be configured to receive at least one of a buffer status report sent by a slave node and routing node information used for data transmission, determine whether the slave node is a dormant node according to the buffer status report and/or the routing node information used for data transmission, if so, release time-frequency domain resources of the dormant node and allocate the resources to the slave node that is not a dormant node for use, so as to avoid resource waste, and the consumption of power by the dormant state is low, so that the use time of the device can be effectively prolonged.
Different from the prior art, the method and the device have the advantages that at least one of the cache state report sent by the slave node and the routing node information used for data transmission is received, whether the slave node is the dormant node or not is judged according to the cache state report and/or the routing node information used for data transmission, if yes, the time-frequency domain resource of the dormant node is released and distributed to the slave node which is not the dormant node for use, so that the resource waste is avoided, the consumption of the electricity quantity by the dormant state is low, and the service life of the device can be effectively prolonged.
The above description is only for the purpose of illustrating embodiments of the present application and is not intended to limit the scope of the present application, and all modifications of equivalent structures and equivalent processes, which are made by the contents of the specification and the drawings of the present application or are directly or indirectly applied to other related technical fields, are also included in the scope of the present application.
Claims (10)
1. A method of communication resource allocation, for use in a communication network comprising a master node and a slave node, the method comprising:
the master node receives at least one of a cache status report and routing node information for data transmission sent by the slave node;
determining whether the slave node is a dormant node according to the received information;
if so, releasing the time-frequency domain resources allocated to the dormant node, and sending a dormant instruction to the dormant node to indicate the dormant node to enter a dormant state; and
reallocating the time-frequency domain resources to the slave nodes in the communication network that are not dormant nodes.
2. The method of claim 1, wherein the determining whether the slave node is a sleeping node according to the received information comprises:
if the cache state reports sent by the slave nodes are all cache data which are not to be sent within a preset time span, taking the slave nodes as dormant nodes; and/or
And if the routing node information for data transmission does not include the slave node within a preset time length, taking the slave node as a dormant node.
3. The method of claim 1, wherein prior to said determining whether the slave node is a sleeping node according to the received information, further comprising:
and judging whether the slave node is a backbone node or not, if not, executing the step of determining whether the slave node is a dormant node or not according to the received information.
4. The method of claim 3, further comprising:
setting at least one slave node as the backbone node according to the indication of a user; and/or
And calculating the transmission route from each slave node to the master node according to a preset routing algorithm, and taking the slave node through which the transmission route from the slave node to the master node passes as the backbone node.
5. A method for waking up a node, the method being applied to a communication network including a master node and a slave node, the method comprising:
after the slave node enters the dormancy, judging whether the slave node needs to transmit data or not;
if yes, exiting the dormant state and completing data transmission time synchronization with a superior node of the slave node; the superior node is a previous hop node positioned in the slave node in a transmission route between the slave node and the master node;
and transmitting data by using the designated time frequency domain resources.
6. The method of claim 5, wherein the time synchronization of data transmission with the upper node of the slave node comprises:
sending an access signal to the superior node;
receiving reception time information generated by the upper node in response to the access signal;
and completing the time synchronization of the transmission data by utilizing the receiving time information.
7. The method of claim 5, wherein the determining whether the data transmission is required comprises:
the slave node detects whether data to be sent exist in the slave node; if yes, determining that data needs to be transmitted; and/or
Periodically waking up from a sleep state, and monitoring paging information broadcasted by the communication network; and judging whether the paging information is a paged object or not based on the paging information, and if so, determining that data needs to be transmitted.
8. The method of claim 5, further comprising:
periodically waking from a sleep state, monitoring network node information broadcast by the communication network,
acquiring a transmission route of the communication network according to the network node information;
measuring the communication state information of the superior node and other adjacent nodes, and judging whether the communication state information of the superior node meets a preset condition;
if so, selecting one other adjacent node as a new superior node of the slave node by using the communication state information of the other adjacent node and the transmission route of the communication network;
wherein the communication state information includes at least one of a reception time, a frequency offset, and a signal strength.
9. A network node comprising a processor, a memory, and a communication circuit, the processor being coupled to the memory and the communication circuit, respectively, the processor controlling itself and the memory, the communication circuit implementing the steps of the method of any of claims 1-4 or 5-8 when in operation.
10. An apparatus having a memory function, wherein program data is stored, the program data being executable to implement the steps in the method of any one of claims 1-4 or 5-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010290564.9A CN113543203B (en) | 2020-04-14 | 2020-04-14 | Communication resource allocation and communication node awakening method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010290564.9A CN113543203B (en) | 2020-04-14 | 2020-04-14 | Communication resource allocation and communication node awakening method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113543203A true CN113543203A (en) | 2021-10-22 |
| CN113543203B CN113543203B (en) | 2023-10-24 |
Family
ID=78088014
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010290564.9A Active CN113543203B (en) | 2020-04-14 | 2020-04-14 | Communication resource allocation and communication node awakening method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113543203B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023142845A1 (en) * | 2022-01-26 | 2023-08-03 | 华为技术有限公司 | Time-frequency resource allocation method and related device |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003037610A (en) * | 2001-07-23 | 2003-02-07 | Toshiba Kyaria Kk | Communication method and master node |
| CN101404602A (en) * | 2008-11-04 | 2009-04-08 | 南京航空航天大学 | DCF protocol node self-adapting dormancy mechanism suitable for multi-hop ad hoc network |
| CN102346472A (en) * | 2011-08-31 | 2012-02-08 | 奇瑞汽车股份有限公司 | CAN (Controller Area Network) and LIN (Local Interconnect Network) bus network based vehicle control system |
| CN102843758A (en) * | 2012-08-28 | 2012-12-26 | 苏州博联科技有限公司 | Method for data energy conservation transmission between nodes in wireless sensor network |
| US20130021927A1 (en) * | 2011-07-22 | 2013-01-24 | Fujitsu Limited | Wireless communication system, slave station device, master station device, and wireless communication system control method |
| CN103188736A (en) * | 2013-04-12 | 2013-07-03 | 南京熊猫电子制造有限公司 | ANT node power energy-saving method based on flow control |
| CN104284403A (en) * | 2013-07-12 | 2015-01-14 | 中南大学 | Low power consumption node design method for wireless sensor network |
| CN104703296A (en) * | 2015-03-19 | 2015-06-10 | 江苏物联网研究发展中心 | Link dormancy method for wireless communication multi-hop network link and tree topology structure |
| CN106304328A (en) * | 2015-06-01 | 2017-01-04 | 索尼公司 | Electronic equipment in wireless communication system and wireless communications method |
| JP2017046053A (en) * | 2015-08-24 | 2017-03-02 | 株式会社デンソー | Master node |
| CN107360072A (en) * | 2017-06-30 | 2017-11-17 | 惠州华阳通用电子有限公司 | It is a kind of can synchronous dormancy CAN network and its control method |
| CN107635269A (en) * | 2016-07-19 | 2018-01-26 | 华为技术有限公司 | Dispatching method, access point and website |
| CN109588059A (en) * | 2016-05-13 | 2019-04-05 | 瑞典爱立信有限公司 | The network architecture, method and apparatus for cordless communication network |
| US20200092832A1 (en) * | 2014-03-18 | 2020-03-19 | Smartrek Technologies Inc. | Mesh network system and techniques |
-
2020
- 2020-04-14 CN CN202010290564.9A patent/CN113543203B/en active Active
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003037610A (en) * | 2001-07-23 | 2003-02-07 | Toshiba Kyaria Kk | Communication method and master node |
| CN101404602A (en) * | 2008-11-04 | 2009-04-08 | 南京航空航天大学 | DCF protocol node self-adapting dormancy mechanism suitable for multi-hop ad hoc network |
| US20130021927A1 (en) * | 2011-07-22 | 2013-01-24 | Fujitsu Limited | Wireless communication system, slave station device, master station device, and wireless communication system control method |
| CN102346472A (en) * | 2011-08-31 | 2012-02-08 | 奇瑞汽车股份有限公司 | CAN (Controller Area Network) and LIN (Local Interconnect Network) bus network based vehicle control system |
| CN102843758A (en) * | 2012-08-28 | 2012-12-26 | 苏州博联科技有限公司 | Method for data energy conservation transmission between nodes in wireless sensor network |
| CN103188736A (en) * | 2013-04-12 | 2013-07-03 | 南京熊猫电子制造有限公司 | ANT node power energy-saving method based on flow control |
| CN104284403A (en) * | 2013-07-12 | 2015-01-14 | 中南大学 | Low power consumption node design method for wireless sensor network |
| US20200092832A1 (en) * | 2014-03-18 | 2020-03-19 | Smartrek Technologies Inc. | Mesh network system and techniques |
| CN104703296A (en) * | 2015-03-19 | 2015-06-10 | 江苏物联网研究发展中心 | Link dormancy method for wireless communication multi-hop network link and tree topology structure |
| CN106304328A (en) * | 2015-06-01 | 2017-01-04 | 索尼公司 | Electronic equipment in wireless communication system and wireless communications method |
| JP2017046053A (en) * | 2015-08-24 | 2017-03-02 | 株式会社デンソー | Master node |
| CN109588059A (en) * | 2016-05-13 | 2019-04-05 | 瑞典爱立信有限公司 | The network architecture, method and apparatus for cordless communication network |
| CN107635269A (en) * | 2016-07-19 | 2018-01-26 | 华为技术有限公司 | Dispatching method, access point and website |
| CN107360072A (en) * | 2017-06-30 | 2017-11-17 | 惠州华阳通用电子有限公司 | It is a kind of can synchronous dormancy CAN network and its control method |
Non-Patent Citations (2)
| Title |
|---|
| JEAN-BAPTISTE YAMINDI: ""The Approach of the New Downlink Control Information Design for Transmission Mode 10"", 《IEEE 2013》 * |
| 高森 张羲煌: ""可补充结点的无线传感器网络拓扑结构"" * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023142845A1 (en) * | 2022-01-26 | 2023-08-03 | 华为技术有限公司 | Time-frequency resource allocation method and related device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113543203B (en) | 2023-10-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107071874B (en) | Method for communicating in a mobile network implementing discontinuous reception | |
| KR100584446B1 (en) | Method for controlling operation mode of mobile terminal in broadband wireless access communication system | |
| JP5117568B2 (en) | Power management in portable communication devices based on wireless configuration version | |
| CN101488887B (en) | Method for supervising and supervising device | |
| US10716064B2 (en) | Distributed sleep management for battery powered multi-hop heterogeneous wireless network | |
| CN101960905B (en) | Wireless communication method, wireless communication system, base station, and terminal station | |
| KR20110024569A (en) | Communication method and system for sensor network | |
| WO2013120431A1 (en) | Method for determining neighboring station, station, access point and communication system | |
| US20210126850A1 (en) | Adaptive time slot allocation to reduce latency and power consumption in a time slotted channel hopping wireless communication network | |
| CN113543203B (en) | Communication resource allocation and communication node awakening method | |
| CN102119565A (en) | Near companion mode in a wireless communication system | |
| CN113133081B (en) | Energy-saving transmission method for wireless ad hoc network | |
| JP5634394B2 (en) | Method and device for determining at least one terminal that a relay has to relay signals transferred between at least one terminal and a base station of a wireless cellular telecommunication network | |
| CN101534517A (en) | Method, system and device for measuring receiving channel power | |
| KR100910033B1 (en) | Reservation based traffic controlling method of wireless sensor network system | |
| US10231262B2 (en) | Methods, access point and wireless device for contention-based access on radio channel | |
| KR100846351B1 (en) | System for transmitting data in wireless sensor network based on virtual backbone | |
| KR20140078328A (en) | System and method for providing of dynamic RRC inactive timer | |
| CN113055989B (en) | Communication control method, device and base station | |
| JP5506898B2 (en) | Frequency band allocating apparatus and frequency band allocating method | |
| KR100956408B1 (en) | Energy management method and system of wireless personal area network by considering traffic complication, and Recording medium using by the same | |
| CN113543198A (en) | Mesh network communication method and related device | |
| WO2012026308A1 (en) | Load control device, load control system, load control program, and load control method | |
| CN115968060A (en) | Data transmission method and device for nodes in ad hoc network and storage medium | |
| CN117412343A (en) | Network regulation and control method and device, storage medium and electronic equipment |
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 |