CN113543203B - Communication resource allocation and communication node awakening method - Google Patents
Communication resource allocation and communication node awakening method Download PDFInfo
- Publication number
- CN113543203B CN113543203B CN202010290564.9A CN202010290564A CN113543203B CN 113543203 B CN113543203 B CN 113543203B CN 202010290564 A CN202010290564 A CN 202010290564A CN 113543203 B CN113543203 B CN 113543203B
- Authority
- CN
- China
- Prior art keywords
- node
- dormant
- slave node
- slave
- 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.)
- Active
Links
- 238000004891 communication Methods 0.000 title claims abstract description 99
- 238000000034 method Methods 0.000 title claims abstract description 56
- 238000013468 resource allocation Methods 0.000 title claims abstract description 13
- 230000005540 biological transmission Effects 0.000 claims abstract description 70
- 230000007958 sleep Effects 0.000 claims description 22
- 230000006870 function Effects 0.000 claims description 6
- 238000012544 monitoring process Methods 0.000 claims description 5
- 230000004044 response Effects 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 6
- 239000002699 waste material Substances 0.000 description 6
- 230000002618 waking effect Effects 0.000 description 5
- 230000002035 prolonged effect Effects 0.000 description 3
- 230000005059 dormancy Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006386 memory function Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
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 communication resource allocation and communication node awakening method, which is applied to a communication network, wherein the communication network comprises a master node and a slave node, and the method comprises the following steps: the method comprises the steps that a master node receives at least one of a buffer status report sent by a slave node and routing node information used for data transmission; determining whether the slave node is a dormant node according to the received information; if yes, releasing time-frequency domain resources allocated to the dormant node, and sending a dormant instruction to the dormant node to instruct 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 application effectively saves resources and prolongs the working time of equipment.
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 often used in emergency, fire and other scenarios. Moreover, not all grid nodes in the network have application requirements for receiving and transmitting data at the same time, and typical application scenarios are as follows: only a part of grid nodes need to transmit and receive data in a certain time period; and after a period of time, another part of grid nodes need to transmit and receive data.
Grid nodes in the grid network are usually battery powered, and grid node equipment which is not required by application of receiving and transmitting data is still in a working state, so that continuous consumption of battery power can be caused, and the working time of the grid node equipment is shortened.
Disclosure of Invention
The application mainly solves the technical problem of providing a method for adjusting and distributing 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 problems, 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 a buffer 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 yes, releasing time-frequency domain resources allocated to the dormant node, and sending a dormant instruction to the dormant node to instruct the dormant node to enter a dormant state; and reassigning the time-frequency domain resources to slave nodes in the communication network that are not dormant nodes.
Wherein the determining whether the slave node is a sleep node according to the received information includes: if the buffer status reports sent by the slave node are all buffer without transmission in the preset time length, the slave node is used as a dormant node; and/or if the routing node information for data transmission does not comprise the slave node within the preset time length, taking the slave node as a dormant node.
Wherein before determining whether the slave node is a sleep node according to the received information, the method further comprises: judging whether the slave node is a backbone node, if not, executing the step of determining whether the slave node is a dormant node according to the received information.
Wherein the method further comprises: setting at least one slave node as the backbone node according to the instruction of a user; and/or 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.
In order to solve the technical problems, the application adopts another technical scheme that: there is provided a method of node wakeup, the method being applied to a communication network comprising a master node and a slave node, the method comprising: after the slave node enters dormancy, judging whether the slave node needs to transmit data or not; if yes, the sleep state is exited, and the data transmission time synchronization is completed with the upper node of the slave node; the upper node is a last-hop node located on the slave node in the transmission route between the slave node and the master node; and transmitting data by using the designated time-frequency domain resources.
The step of completing data transmission time synchronization with the upper node of the slave node comprises the following steps: sending an access signal to the upper 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 data transmission is needed includes: the slave node detects whether data to be sent exist or not; if yes, determining that data need 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 paging object or not based on the paging information, if so, determining that data needs to be transmitted.
Wherein the method further comprises: periodically awakening from a dormant 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 communication state information of the superior node and other adjacent nodes, and judging whether the communication state information of the superior node meets preset conditions or not; if yes, selecting one other adjacent node as a new superior node of the slave node by using the communication state information of the other adjacent nodes and the transmission route of the communication network; wherein the communication status information includes at least one of a reception time, a frequency offset, and a signal strength.
In order to solve the technical problems, the application adopts another technical scheme that: 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 in the method as described above, when in operation.
In order to solve the technical problems, the application adopts a further technical scheme 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 effects of the application are as follows: in the application, the master node receives at least one of the buffer status report sent by the slave node and the routing node information used for data transmission, judges whether the slave node is a dormant node according to the buffer status report and/or the routing node information of the data transmission, if so, releases the time-frequency domain resource of the dormant node and distributes the time-frequency domain resource to the slave node which is not the dormant node for use, thereby avoiding resource waste, reducing the consumption of electric quantity by the dormant state and effectively prolonging the service time of the equipment.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present application, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art. Wherein:
fig. 1 is a schematic flow chart of a first embodiment of a communication resource allocation method provided by the present application;
fig. 2 is a schematic structural diagram of a communication network to which the method for allocating communication resources provided by the present application is applied;
fig. 3 is a flow chart of a second embodiment of a communication resource allocation method provided by the present application;
FIG. 4 is a flow chart of an embodiment of a method for node wakeup provided by the present application;
FIG. 5 is a flowchart illustrating an embodiment of a method for node wakeup and a step of determining whether data transmission is needed;
FIG. 6 is a flow chart of a second embodiment of a method for node wakeup provided by the present application;
fig. 7 is a schematic structural diagram of an embodiment of a network node according to the present application;
fig. 8 is a schematic structural diagram of a device with a storage function according to the present application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present application, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
Referring to fig. 1, fig. 1 is a flowchart of a first embodiment of a communication resource allocation method according to 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 buffer 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, fig. 2 is a schematic structural diagram of a communication network to which the method for allocating communication resources according to the present application is applied. In this implementation scenario, the communication network is a mesh (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 slaves of the communication network.
In this implementation scenario, the slave node sends the buffer status report and/or the routing node information for data transmission to the master node, which may be 1-hop, for example, the slave node B sends the information to the master node a, or relay multi-hop, for example, the slave node C sends the information to the master node a through the slave node B. The slave node may send the information to the master node periodically, may be triggered by an event, or may send the information in response to a request from the master node. The buffer status report (Buffer Status Report) is used to indicate how much data the slave node currently has to send, and the routing node information is used to indicate information of the slave node through which the current node sends information to at least one transmission route of the master node. The master node receives at least one of the buffer status reports and the 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 one specific implementation scenario, the master node determines whether the slave node is a dormant node according to the received buffer status report. Specifically, the buffer status report sent by the slave node is obtained to be 0 (i.e. no buffer to be sent) within the preset time length, which indicates that the slave node has no data to be transmitted within the preset time length, so that the slave node is determined to be a dormant node. In the technical scheme provided by the application, the buffer status report being 0 specifically means that a parameter used for indicating the current size of data to be sent from a node in the buffer status report is 0, that is, no buffer data to be sent. In other implementations, the master node determines whether the slave node is a dormant node based on the received routing node information for data transmission. Specifically, in the preset time length, the routing node information for data transmission does not include the slave node, which means that other slave nodes send information to the master node without passing through the slave 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 dormant node according to the received buffer status report and the routing node information for data transmission, where the specific determination basis and the determination method are basically consistent with those described above, and no detailed description is given here.
S103: releasing time-frequency domain resources allocated to the dormant node, and sending a dormant instruction to the dormant node to instruct the dormant node to enter a dormant state.
In one specific implementation scenario, a master node releases time-frequency domain resources originally allocated to the dormant node and sends a dormant instruction to the dormant node to instruct the dormant node to enter a dormant 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 any more.
S104: and reassigning the time-frequency domain resource to a slave node which is not a dormant node in the communication network.
In a specific implementation scenario, when the dormant node enters a dormant state, the time-frequency domain resources of the dormant node are reallocated to a slave node in the communication network that is not a dormant node, so that the time-frequency domain resources are fully utilized. For example, a buffer status report of each slave node that is not a dormant node may be obtained, 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 dormant nodes.
As can be seen from the foregoing description, in this embodiment, by receiving at least one of the buffer status report and the routing node information for data transmission sent by the slave node, whether the slave node is a dormant node is determined according to the buffer status report and/or the routing node information for data transmission, if yes, 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, which avoids resource waste, and the consumption of the power consumption by the dormant state is also low, so that the service time of the device can be effectively prolonged.
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 buffer status report and the routing node information for data transmission sent by the slave node.
In a specific implementation scenario, this step is substantially identical to step S101 of the first embodiment of the communication resource allocation method provided in the present application, and will not be described herein.
S302: and judging whether the slave node is a backbone node, and if not, executing step S303.
In a specific implementation scenario, before determining whether a slave node is a dormant 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 dormant node, and if the slave node is not a backbone node, the slave node may be a dormant node.
In this implementation scenario, the user may instruct one or more slave nodes to be backbone nodes, and the master node sets at least one slave node as the backbone node according to the instruction 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 may be used as the backbone node. The preset routing algorithm may be a shortest-path routing algorithm, an optimal signal routing algorithm, or other routing algorithm. The present application is not limited thereto, and it is only necessary to determine that only the same routing algorithm is used.
Specifically, please refer to fig. 2. According to one routing algorithm (e.g., shortest route algorithm), slave node C and slave node E need to pass through slave node B, which is then the backbone node, and slave node F and slave node G need to pass through slave node B and slave node C, which is then the backbone node, and slave node E is then the 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: releasing time-frequency domain resources allocated to the dormant node, and sending a dormant instruction to the dormant node to instruct the dormant node to enter a dormant state.
S305: and reassigning the time-frequency domain resource to a slave node which is not a dormant node in the communication network.
In a specific implementation scenario, steps S303 to S305 are substantially identical to steps S102 to S104 of the first embodiment of the communication resource allocation method provided in the present application, and will not be described herein.
As can be seen from the above description, in this embodiment, whether a slave node is a backbone node is determined before determining whether the slave node is a sleep node, and if the slave node is a backbone node, the slave node is not used as the sleep node, so that normal operation of the communication network can be maintained, and resource waste 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 application. The node awakening method provided by the application comprises the following steps:
s401: and after the slave node enters dormancy, judging whether the slave node needs to transmit data. If yes, go to step S402.
In one 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 itself, for example, if the user designates that the slave node transmits data, the slave node needs to transmit data. Or the next node of the slave node has data to be transmitted through the slave node, the slave node needs to transmit the data.
Referring to fig. 2 in combination, the upper node is a node located at a previous hop of the slave node in the transmission route between the slave node and the master node, and the lower node is a node located at a next hop of the slave node in the transmission route between other slave nodes and the master node and including the slave node. For example, in fig. 2, the slave node C is the next-hop node of the slave node B, and the slave node B is the last-hop node of the slave node C.
S402: and exiting the dormant state and completing data transmission time synchronization with the upper node of the slave node.
In a specific implementation scenario, when the current slave node determines that the slave node needs to transmit data, the slave node 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 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, and completes data transmission time synchronization.
S403: and transmitting data by using the designated time-frequency domain resources.
In a specific implementation scenario, after the upper node of the current slave node calculates the time and/or time delay of receiving the access signal, the time and/or time delay is sent to the master node, so that the master node obtains the time delay of the transmission route of the current slave node, and allocates time-frequency domain resources to the current slave node. The current slave node utilizes the time-frequency domain resources allocated by the master node to transmit data.
As can be seen from the above description, in this embodiment, when a current slave node needs to transmit data, the slave node exits from a sleep state, completes time synchronization of data transmission with its upper node, and transmits data by using a 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 an embodiment of a method for waking up a node and a step of determining whether the node needs to transmit data according to the present application. The application completes the time synchronization of data transmission with the superior node of the slave node, which comprises the following steps:
s501: periodically awakening from the dormant state, and monitoring paging information broadcast by the communication network.
In one specific implementation scenario, after the slave node goes to sleep, it wakes up periodically from sleep state to monitor paging information broadcast by the communication network, and in other implementations, the slave node also monitors 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, step S503 is executed.
In a specific implementation scenario, the slave node determines whether itself has a need to transmit data according to the paging information.
S503: it is determined that data needs to be transmitted.
Further, the paging message further includes time-frequency domain resources allocated after the slave node wakes up. If the slave node is judged to have a requirement for transmitting data, the slave node wakes up from a dormant state and transmits the data with transmission by using time-frequency domain resources allocated to the node, which 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 for transmitting data, wakes up and transmits data when there is a need for transmitting data, so that the problem of delay in data transmission caused by the failure of the sleep slave node to transmit data can be avoided, and the communication resources of the communication network are fully utilized.
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 awakening from the dormant state, and monitoring network node information broadcast by the communication network.
In one specific implementation scenario, after the slave node goes to sleep, it wakes up periodically from 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, a transmission route of the communication network is obtained according to the network node information, and a transmission route related to the slave node is obtained from the transmission route.
S603: and measuring communication state information of the superior node and other adjacent nodes.
In one particular implementation scenario, communication state information of a superior node of the slave node and other neighboring nodes adjacent to the slave node is obtained from a transmission route associated with the node, where 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 upper node meets a preset condition or not. If yes, go to step S605.
In a specific implementation scenario, whether the communication state information of the upper node meets a preset condition is judged according to the acquired communication state information of the upper node and the communication state information of other adjacent nodes. For example, the preset condition is that the signal intensity of the upper node is lower than that of other adjacent nodes, or the preset condition is that the signal intensity 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 state of the upper level communication node meets a preset condition (the signal strength of the upper level communication node is lower than a preset threshold value and/or the signal strength of other neighboring nodes), a suitable slave node is selected from the other neighboring nodes as a new upper level node by using the communication state information of the other neighboring nodes and the transmission route of the communication network. The one with the best signal strength from other adjacent nodes can be selected as the new upper node.
In other implementation scenarios, if the communication status information of the upper node does not meet the preset condition, the upper node is continuously used as the upper node of the slave node.
In this implementation scenario, after determining a new upper node of the slave node, the slave node synchronizes with data transmission of the upper node (including synchronization frequency offset and/or time) according to the obtained frequency offset and/or reception time (or the time delay calculated according to the reception time) of the new upper node.
In other implementation scenarios, after the previous upper node of the slave node is adopted as the upper node, the slave node is synchronized with data transmission of the upper node (including synchronization frequency offset and/or time) according to the obtained frequency offset and/or receiving time (or time delay calculated according to the receiving time) of the previous 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, the network node includes: processor 71, memory 72 and communication circuit 73, processor 71 is coupled to memory 72 and communication circuit 73, respectively, and processor 71 in operation controls itself and memory 72 and 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 buffer 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 dormant node. If so, the processor 71 releases the time-frequency domain resources allocated to the dormant node and sends a dormant instruction to the dormant node through the communication circuit 73 to instruct the dormant node to enter a dormant state. The processor 71 reallocates the time-frequency domain resources to slave nodes in the communication network that are not dormant nodes.
When the network node is a slave node, the processor 71 determines whether or not it needs to transmit data after the node has put to sleep. If so, the processor 71 controls the slave node to exit from the sleep state, and the data transmission time synchronization processor 71, which completes data transmission with the upper node of the network node, controls the communication circuit 73 to transmit data by using the designated time-frequency domain resource.
As can be seen from the above description, the network node in this embodiment 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 yes, the time-frequency domain resource of the dormant node is released, and is allocated to the slave node that is not the dormant node for use, which avoids resource waste, and the dormant state has low consumption of electric quantity, so that the service time of the device can be effectively prolonged.
Referring to fig. 8, fig. 8 is a schematic structural diagram of an embodiment of a device with a memory function according to the present application. The memory-enabled device 80 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 device with the storage function may be a storage chip, a hard disk, a mobile hard disk, a flash disk, an optical disk or other tools capable of reading and writing in storage in the device, 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 a storage function in this embodiment may be used to receive at least one of the buffer status report sent by the slave node and the routing node information used for data transmission, and 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 yes, release the time-frequency domain resource of the dormant node, and allocate the time-frequency domain resource to the slave node that is not the dormant node for use, which avoids resource waste, and the consumption of the power by the dormant state is also very low, so as to effectively prolong the service time of the device.
Compared with the prior art, the method and the device have the advantages that at least one of the buffer status 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 buffer status 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 the time-frequency domain resource is distributed to the slave node which is not the dormant node for use, so that resource waste is avoided, the consumption of electric quantity by the dormant state is low, and the service time of equipment can be effectively prolonged.
The foregoing description is only of embodiments of the present application, and is not intended to limit the scope of the application, and all equivalent structures or equivalent processes using the descriptions and the drawings of the present application or directly or indirectly applied to other related technical fields are included in the scope of the present application.
Claims (9)
1. 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 a buffer status report and routing node information for data transmission sent by the slave node; the buffer status report is used for indicating the current size of the buffer data to be sent by the slave node, and the routing node information is used for indicating the information of the slave node through which the slave node sends information to at least one transmission route of the master node;
determining whether the slave node is a dormant node according to the received information, including: if the buffer status reports sent by the slave node are all buffer data which are not to be sent within the preset time length, the slave node is used as a dormant node; and/or if the routing node information for data transmission does not include the slave node within the preset time length, taking the slave node as a dormant node;
if yes, releasing time-frequency domain resources allocated to the dormant node, and sending a dormant instruction to the dormant node to instruct the dormant node to enter a dormant state; and
and reallocating the time-frequency domain resources to the slave node which is not a dormant node in the communication network.
2. The method of claim 1, further comprising, prior to said determining from said received information whether said slave node is a dormant node:
judging whether the slave node is a backbone node, if not, executing the step of determining whether the slave node is a dormant node according to the received information.
3. The method according to claim 2, wherein the method further comprises:
setting at least one slave node as the backbone node according to the instruction 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.
4. A method of node wakeup, the method being applied to a communication network comprising a master node and a slave node, the method comprising:
after the slave node goes to sleep, judging whether the slave node needs to transmit data or not, wherein the slave node goes to a sleep state according to receiving a sleep instruction sent by the master node in the steps of any one of claims 1-3;
if yes, the sleep state is exited, and the data transmission time synchronization is completed with the upper node of the slave node; the upper node is a last-hop node located on the slave node in the transmission route between the slave node and the master node;
and transmitting data by using the designated time-frequency domain resources.
5. The method of claim 4, wherein said synchronizing with said slave node's superordinate node to complete data transmission time comprises:
sending an access signal to the upper 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.
6. The method of claim 4, wherein determining whether data is required to be transmitted by itself comprises:
the slave node detects whether data to be sent exist or not; if yes, determining that data need to be transmitted; and/or
Periodically awakening from a dormant state, and monitoring paging information broadcasted by the communication network; and judging whether the paging information is a paging object or not based on the paging information, if so, determining that data needs to be transmitted.
7. The method according to claim 4, wherein the method further comprises:
periodically awakening from a dormant 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 communication state information of the superior node and other adjacent nodes, and judging whether the communication state information of the superior node meets preset conditions or not;
if yes, selecting one other adjacent node as a new superior node of the slave node by using the communication state information of the other adjacent nodes and the transmission route of the communication network;
wherein the communication status information includes at least one of a reception time, a frequency offset, and a signal strength.
8. 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 in operation controlling itself and the memory, the communication circuit implementing the steps in the method according to any of claims 1-3 or 4-7.
9. An apparatus having a storage function, characterized in that program data are stored, which program data are executable to implement the steps of the method according to any of claims 1-3 or 4-7.
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 CN113543203A (en) | 2021-10-22 |
| CN113543203B true 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) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116567834A (en) * | 2022-01-26 | 2023-08-08 | 华为技术有限公司 | Time-frequency resource allocation method and related equipment |
Citations (12)
| 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 |
| 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 |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5834580B2 (en) * | 2011-07-22 | 2015-12-24 | 富士通株式会社 | Wireless communication system, slave station apparatus, and wireless communication system control method |
| CA2856027A1 (en) * | 2014-03-18 | 2015-09-18 | Smartrek Technologies Inc. | Mesh network system and techniques |
-
2020
- 2020-04-14 CN CN202010290564.9A patent/CN113543203B/en active Active
Patent Citations (12)
| 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 |
| 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 |
| 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 |
|---|
| "The Approach of the New Downlink Control Information Design for Transmission Mode 10";Jean-Baptiste YAMINDI;《IEEE 2013》;全文 * |
| 高森 张羲煌."可补充结点的无线传感器网络拓扑结构".《传感器与仪器仪表》.2008,全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113543203A (en) | 2021-10-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107071874B (en) | Method for communicating in a mobile network implementing discontinuous reception | |
| KR101642998B1 (en) | Apparatus for preserving battery life for a mobile station and systme thereof | |
| JP5711829B2 (en) | Method for reducing power consumption of a base station in a wireless communication system | |
| KR100584446B1 (en) | Method for controlling operation mode of mobile terminal in broadband wireless access communication system | |
| 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 | |
| WO2013120431A1 (en) | Method for determining neighboring station, station, access point and communication system | |
| JP2011024243A (en) | Apparatus, system, and method for managing reverse link communication resource in distributed communication system | |
| JPH11196478A (en) | Method and system for managing mobile station | |
| US20150351125A1 (en) | Apparatus and method for allocating resource | |
| JP5309405B2 (en) | Dormant base station selection system, network side device, control method, and program | |
| US20230155915A1 (en) | Adaptive time slot allocation to reduce latency and power consumption in a time slotted channel hopping wireless communication network | |
| JP2002335266A (en) | Communication terminal containing apparatus | |
| US20170318592A1 (en) | D2D Interference Coordination Methods and Apparatuses, Base Station and User Equipment | |
| Verma et al. | Survey of MAC protocol for wireless sensor networks | |
| WO2016045568A1 (en) | Method and device for d2d resource allocation | |
| CN113543203B (en) | Communication resource allocation and communication node awakening method | |
| CN113133081B (en) | Energy-saving transmission method for wireless ad hoc network | |
| CN102119565A (en) | Near companion mode in a wireless communication system | |
| KR100871866B1 (en) | System for controlling data transmission in wireless sensor network | |
| Qin et al. | ZigBee-assisted power saving for more efficient and sustainable ad hoc networks | |
| 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 | |
| JP2014036283A (en) | Radio communication system | |
| KR20140078328A (en) | System and method for providing of dynamic RRC inactive timer |
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 |