Method for scheduling resources of distributed ad hoc network services

Abstract

The application provides a distributed ad hoc network service resource scheduling method, wherein the service resource scheduling method applied to an authorized node comprises the following steps: receiving a request message sent by a request node, wherein the request message comprises a request time slot table of the request node itself and a time slot demand quantity; determining a resource scheduling time slot table according to an authorized time slot table of the authorized node itself, the request time slot table and the time slot demand quantity; sending the resource scheduling time slot table to the request node; and receiving a service data message sent by the request node, wherein the authorized node can receive two messages sent by using different powers in the same time slot. The distributed ad hoc network service resource scheduling method provided by the application avoids message collision at the same node, reduces resource scheduling time delay; and the application adds a power domain non-orthogonal technology, which avoids communication interference between adjacent nodes, improves network capacity, time slot multiplexing degree and network resource utilization rate.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of network communication technology, and in particular to a distributed ad hoc network service resource scheduling method. BACKGROUND

[0002] Distributed wireless ad hoc network is a network with high coverage, easy to set up, low cost, large capacity, multi-hop, high speed, stable and reliable, which is widely used in various occasions. In the distributed wireless ad hoc network, each node is completely equal, and the nodes need to negotiate with the surrounding neighbor nodes to allocate resources, and each node transmits data according to the agreed scheduling scheme, so as to avoid collision.

[0003] In order to ensure the communication efficiency, time slot multiplexing communication mode is usually used in the distributed wireless ad hoc network. Time slot multiplexing is to use the same time period of the same physical connection to transmit different signals, so as to achieve the purpose of multi-transmission. However, considering the interference between nodes, the distributed wireless ad hoc network only allows two-hop and beyond nodes to use time slot multiplexing. When the network size is large and the service demand is high, there may be a situation that a node receives messages from multiple adjacent nodes at the same time, resulting in collision of messages at the node, and further causing resource scheduling failure. SUMMARY

[0004] Therefore, the purpose of the present application is to provide a distributed ad hoc network service resource scheduling method.

[0005] In order to achieve the above purpose, the present application provides a distributed ad hoc network service resource scheduling method applied to an authorized node, wherein the authorized node can receive two messages sent by different powers in the same time slot, and the method comprises the following steps: receiving a request message sent by a request node, wherein the request message comprises a request time slot table of the request node itself and a time slot demand quantity; determining a resource scheduling time slot table according to an authorized time slot table of the authorized node itself, the request time slot table and the time slot demand quantity; sending the resource scheduling time slot table to the request node; receiving a service data message fed back by the request node according to the resource scheduling time slot table.

[0006] Optionally, the request time slot table and the authorized time slot table each comprise a plurality of time slots and a state corresponding to each time slot, and the state comprises an idle state, a single power receiving state and an occupied state.

[0007] Optionally, the determining the resource scheduling time slot table according to the authorization time slot table of the authorization node itself, the request time slot table and the time slot quantity required comprises: in response to the number of idle time slots being greater than or equal to the time slot quantity required, selecting the same number of time slots as the time slot quantity required from the idle time slots and adding the time slots to the resource scheduling time slot table, wherein the idle time slots are time slots whose states in the request time slot table and the authorization time slot table are both idle.

[0008] Optionally, the determining the resource scheduling time slot table according to the authorization time slot table of the authorization node itself, the request time slot table and the time slot quantity required comprises: in response to the number of idle time slots being less than the time slot quantity required and the number of idle time slots plus the number of semi-idle time slots being greater than or equal to the time slot quantity required, adding all the idle time slots and part of the semi-idle time slots to the resource scheduling time slot table, wherein the number of all time slots added to the resource scheduling time slot table is equal to the time slot quantity required, the idle time slots are time slots whose states in the request time slot table and the authorization time slot table are both idle, and the semi-idle time slots are time slots whose state in the request time slot table is idle and whose state in the authorization time slot table is single-power receiving.

[0009] Optionally, the adding the semi-idle time slots to the resource scheduling time slot table comprises: adding the semi-idle time slots and the corresponding authorization transmission power of the semi-idle time slots to the resource scheduling time slot table.

[0010] Optionally, the determining the resource scheduling time slot table according to the authorization time slot table of the authorization node itself, the request time slot table and the time slot quantity required comprises: in response to the number of idle time slots plus the number of semi-idle time slots being less than the time slot quantity required, adding conflict time slots to the resource scheduling time slot table, wherein the idle time slots are time slots whose states in the request time slot table and the authorization time slot table are both idle, the semi-idle time slots are time slots whose state in the request time slot table is idle and whose state in the authorization time slot table is single-power receiving, and the conflict time slots are time slots whose state in the request time slot table is single-power receiving or occupied.

[0011] Based on the same inventive concept, the application further provides a distributed ad hoc network service resource scheduling method applied to a requesting node, comprising: sending a request message to an authorized node, wherein the request message comprises a request time slot table of the requesting node itself and a time slot demand quantity, the authorized node can receive two messages sent using different powers in the same time slot; receiving a resource scheduling time slot table sent by the authorized node; in response to the absence of a conflict time slot in the resource scheduling time slot table, sending a service data message to the authorized node according to the resource scheduling time slot table; or, in response to the presence of the conflict time slot in the resource scheduling time slot table, re-sending the request message to the authorized node, wherein: the request time slot table comprises a plurality of time slots and a state corresponding to each time slot, the state comprises an idle state, a single-power receiving state and an occupied state, and the conflict time slot is a time slot whose state in the request time slot table is the single-power receiving state or the occupied state.

[0012] Based on the same inventive concept, the application further provides a distributed ad hoc network service resource scheduling device applied to an authorized node, the authorized node can receive two messages sent using different powers in the same time slot, and the device comprises: a request receiving unit configured to receive a request message sent by a requesting node, wherein the request message comprises a request time slot table of the requesting node itself and a time slot demand quantity; a resource scheduling unit configured to determine a resource scheduling time slot table according to an authorized time slot table of the authorized node itself, the request time slot table and the time slot demand quantity; an authorized sending unit configured to send the resource scheduling time slot table to the requesting node; and a service resource receiving unit configured to receive a service data message fed back by the requesting node according to the resource scheduling time slot table.

[0013] Based on the same inventive concept, the application further provides a distributed ad hoc network service resource scheduling device applied to a requesting node, comprising: a request sending unit configured to send a request message to an authorized node, wherein the request message comprises a request time slot table of the requesting node itself and a time slot demand quantity, the authorized node can receive two messages sent using different powers in the same time slot; an authorized receiving unit configured to receive a resource scheduling time slot table sent by the authorized node; and a service resource sending unit configured to, in response to the absence of a conflict time slot in the resource scheduling time slot table, send a service data message to the authorized node according to the resource scheduling time slot table; or, in response to the presence of the conflict time slot in the resource scheduling time slot table, re-send the request message to the authorized node, wherein: the request time slot table comprises a plurality of time slots and a state corresponding to each time slot, the state comprises an idle state, a single-power receiving state and an occupied state, and the conflict time slot is a time slot whose state in the request time slot table is the single-power receiving state or the occupied state.

[0014] Based on the same inventive concept, the application further provides an electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the method according to any one of the preceding embodiments when executing the program.

[0015] As can be seen from the above, the distributed ad hoc network service resource scheduling method provided by the application comprises the following steps of: receiving a request message sent by a request node, wherein the request message comprises a request time slot table of the request node itself and a time slot demand quantity; determining a resource scheduling time slot table according to an authorized time slot table of the authorized node itself, the request time slot table, and the time slot demand quantity; sending the resource scheduling time slot table to the request node; and receiving a service data message fed back by the request node according to the resource scheduling time slot table, wherein the authorized node can receive two messages sent by using different powers in the same time slot. The distributed ad hoc network service resource scheduling method provided by the application is based on a reservation mechanism, and the transmission time slots are reserved in advance between the request node and the authorized node, so as to avoid message collision at the same node and reduce resource scheduling delay. In addition, the power domain non-orthogonal technology is added, so as to avoid communication interference between adjacent nodes, improve network capacity, time slot multiplexing degree, and network resource utilization rate, and the like. BRIEF DESCRIPTION OF DRAWINGS

[0016] In order to more clearly illustrate the technical solutions in the application or related art, the following will briefly introduce the drawings needed to be used in the embodiments or related art description. Obviously, the drawings in the following description are only embodiments of the application, and for those skilled in the art, other drawings can also be obtained without creative labor on the basis of these drawings.

[0017] Figure 1 The flowchart of the distributed ad hoc network service resource scheduling method applied to the authorized node of the embodiment of the application;

[0018] Figure 2 The flowchart of the method for determining the resource scheduling time slot table applied to the authorized node of the embodiment of the application;

[0019] Figure 3 The flowchart of the distributed ad hoc network service resource scheduling method applied to the request node of the embodiment of the application;

[0020] Figure 4 The structural diagram of the distributed ad hoc network service resource scheduling device applied to the authorized node of the embodiment of the application;

[0021] Figure 5A structure schematic diagram of a distributed ad hoc network service resource scheduling device applied to a request node in an embodiment of the present application;

[0022] Figure 6 An electronic device hardware structure schematic diagram of an embodiment of the present application. DETAILED DESCRIPTION

[0023] To make the objectives, technical solutions and advantages of the present application clearer, the present application is further described in detail below with reference to the embodiments and the accompanying drawings.

[0024] It should be noted that, unless otherwise defined, the technical terms or scientific terms used in the embodiments of the present application should be understood as the common meanings understood by those with ordinary skills in the art to which the present application belongs. The terms "first", "second", and similar terms used in the embodiments of the present application do not represent any order, number, or importance, but are only used to distinguish different components. The terms "include", "contain", and similar terms mean that the components or objects before the terms encompass the components or objects listed after the terms and their equivalents, without excluding other components or objects. The terms "connect" or "connected" and similar terms do not mean physical or mechanical connections, but can include electrical connections, whether direct or indirect. The terms "upper", "lower", "left", "right", and the like only represent relative positional relationships, which can change when the absolute positions of the described objects change.

[0025] One embodiment of the present application provides a distributed ad hoc network service resource scheduling method applied to an authorized node. The method is based on time slot multiplexing technology. The authorized node can receive two messages sent using different powers in the same time slot. In one specific embodiment, the two messages sent using different powers in the same time slot are service data messages, as shown in the following table. Figure 1 The method comprises the following steps:

[0026] In step S101, a request message sent by a request node is received. The request message includes a request time slot table of the request node itself and a time slot quantity required. The time slot tables of all nodes in the network are the same, i.e., the time slots in the time slot table of each node can correspond to the time slots in the time slot table of other nodes. In one specific embodiment, for each piece of service data, the node that needs to send the service data is the request node, and the node that needs to receive the service data is the authorized node. A node in the network can be the request node or the authorized node in different resource allocation.

[0027] The power domain non-orthogonal refers to that a node can receive two messages respectively sent by two other nodes with different powers in a same time slot. On the basis of time slot multiplexing, the time slot multiplexing rate can be further improved. Moreover, the requesting node and the authorized node are one-hop nodes capable of directly communicating with each other. By using the power domain non-orthogonal, communication interference between adjacent nodes can be avoided, and the problem that the distributed wireless ad hoc network in the related art only allows nodes two hops and beyond to perform time slot multiplexing can be solved.

[0028] In step S102, a resource scheduling time slot table is determined according to the authorized time slot table of the authorized node, the requesting time slot table, and the number of time slots required.

[0029] In a specific embodiment, the authorized node determines an available time slot set S1 according to the authorized time slot table of the authorized node and the requesting time slot table of the requesting node, and then determines a resource scheduling time slot table according to the available time slot set.

[0030] In step S103, the resource scheduling time slot table is sent to the requesting node, and the authorized time slot table of the authorized node is updated according to the resource scheduling time slot table, so as to be used in the next service resource scheduling.

[0031] In step S104, a service data message fed back by the requesting node according to the resource scheduling time slot table is received. The requesting node determines whether the resource scheduling is successful according to the resource scheduling time slot table. If the resource scheduling is successful, the service data message is fed back to the authorized node. If the resource scheduling fails, the requesting node sends the above-mentioned request message to the authorized node again, and the authorized node repeats step S101. However, only when the authorized node proceeds to step S104, the service resource scheduling is completed. Therefore, steps S101 to S104 are regarded as a service resource scheduling method applied to the authorized node in the embodiment of the present application. Moreover, since the states of the time slots in the requesting time slot table and the authorized time slot table are different each time when the service resource scheduling is required, the results of the same requesting node and the authorized node in different service resource scheduling are also different, and the service resource scheduling is not always failed. Therefore, the method provided in the embodiment of the present application can be executed circularly to achieve the purpose of successfully performing the service resource scheduling. In the embodiment, other situations in which the authorized node or the requesting node needs to start the resource scheduling again are the same, and will not be described herein again.

[0032] The service resource scheduling method provided in the present application is based on a reservation mechanism. The transmission time slots between the requesting node and the authorized node are reserved in advance, so as to avoid message collision at a same node and reduce the resource scheduling delay. Moreover, the power domain non-orthogonal technology is added in the present application. The communication interference between adjacent nodes is avoided, and the network capacity, the time slot multiplexing degree, and the network resource utilization rate are improved.

[0033] It should be noted that the above embodiments do not limit that only the authorized node can receive two messages sent with different power based on power domain non-orthogonal in the same time slot, in some embodiments, the requesting node can also receive two messages sent with different power based on power domain non-orthogonal in the same time slot, which are also within the protection scope of the embodiments of the present application.

[0034] For the convenience of understanding, the mechanism of the requesting node sending the above request message will be briefly described below to assist in further explaining the process of the authorized node receiving the request message and sending the resource scheduling time slot table.

[0035] The requesting node and the authorized node are nodes within one hop that can directly communicate with each other, and the request message includes not only the request time slot table and the number of time slot requirements of the requesting node itself, but also the service source node ID, the service destination node ID, and the next hop node ID. In a specific embodiment, the ID of the next hop node is the ID of the authorized node. The requesting node broadcasts the request message to all nodes within one hop from the requesting node. After receiving the request message, the node parses the message to obtain the next hop node ID. If the next hop node ID is the same as the ID of the node itself, the node determines itself as the authorized node in the above embodiments and implements the above service resource scheduling method, otherwise, the node ignores the message.

[0036] In a specific embodiment, the step S103 further includes: replying to the requesting node with a resource scheduling authorization message, the resource scheduling authorization message including the resource scheduling time slot table, and also including the source node ID and the service destination node ID.

[0037] In some embodiments, the request time slot table and the authorized time slot table each include a plurality of time slots and the corresponding state of each time slot, and the state includes an idle state, a single power receiving state, and an occupied state. In a specific embodiment, for a node based on power domain non-orthogonal, the corresponding state of each time slot is an idle state, a single power receiving state, or an occupied state. For a normal node, the corresponding state of each time slot is an idle state (neither receiving nor sending any message) or an occupied state (receiving or sending a message).

[0038] In a more specific embodiment, the state corresponding to each time slot of the node based on power domain non-orthogonal includes: 1) the idle state, indicating that the request / grant node neither sends nor receives a message in the time slot; 2) the single-power receiving state, indicating that the request / grant node does not send a message but receives a message sent by another node using one power in the time slot, and the request / grant node in the single-power receiving state can also receive a message sent by another node using another power; 3) the occupied state, further including a large-power sending state, a small-power sending state, and a state of simultaneously receiving two different power service data messages, and due to technical limitations, the same node cannot simultaneously send or receive a message or simultaneously send two messages using two different powers in the same time slot, so the above-mentioned large-power sending state and small-power sending state both indicate that the request / grant node has been completely occupied in the time slot.

[0039] In a specific embodiment, the grant node determines the available time slot set S1 according to the grant time slot table of the grant node and the request time slot table of the request node, and further includes: first adding the time slot with an idle state in the request time slot table to the S1, and then adding the time slot with an idle state and a single-power receiving state in the grant time slot table to the S1, while recording the current message receiving power of the time slot in the single-power receiving state.

[0040] Since the transmission direction of the service message is from the request node to the grant node during service resource scheduling, a time slot with the sending message capability of the request node needs to be selected, and when the request node is a normal node, the time slot with an idle state is first added to the S1; if the request node is a node based on power domain non-orthogonal, according to the above description of the state of the time slot, the time slot in the single-power receiving state does not have the sending message capability but only has the receiving message capability, so the time slot with an idle state in the request time slot table needs to be first added to the S1. For the grant node, a time slot with the receiving message capability can be selected, so the time slot with an idle state and a single-power receiving state in the grant time slot table is added to the S1.

[0041] In some embodiments, as shown in Figure 2 The step S102 includes:

[0042] In response to the number of idle time slots being greater than or equal to the number of required time slots, a same number of time slots as the number of required time slots are randomly selected from the idle time slots and added to the resource scheduling time slot table, wherein:

[0043] The idle time slots are time slots with an idle state in the request time slot table and the grant time slot table.

[0044] The priority use state of the time slot is idle, which can further improve the time slot multiplexing degree and further avoid communication interference between nodes.

[0045] It should be noted that, since the principle of power domain non-orthogonality is that one node can receive two messages respectively sent by two other nodes in the same time slot using different powers, the two different powers must have a size difference, so the large power and the small power here are "large" and "small" of the two powers relative to each other, and are not limited to large power being a power with a larger numerical value or small power being a power with a smaller numerical value. Those skilled in the art can determine the specific numerical values of "large power" and "small power" in the embodiments of the present application according to the specific implementation environment, which are not limited here. The "large power" and "small power" appearing in other parts of the embodiments of the present application are the same as here, and will not be repeated.

[0046] In some embodiments, as shown in Figure 2 The step S102 further includes:

[0047] In response to the number of idle time slots being less than the number of time slot requirements, and the number of idle time slots plus the number of semi-idle time slots being greater than or equal to the number of time slot requirements, all the idle time slots and part of the semi-idle time slots are added to the resource scheduling time slot table, wherein:

[0048] The number of all time slots added to the resource scheduling time slot table is equal to the number of time slot requirements, the idle time slots are time slots whose states in the request time slot table and the authorized time slot table are both idle, and the semi-idle time slots are time slots whose state in the request time slot table is idle and whose state in the authorized time slot table is single-power receiving.

[0049] In the related art, if the idle time slots cannot meet the time slot requirements of resource scheduling, the resource scheduling will fail. The method provided in the embodiments of the present application uses the power domain non-orthogonal technology to supplement the time slot requirements of resource scheduling by using semi-idle time slots when the idle time slots cannot meet the time slot requirements, thereby improving the success rate of resource scheduling and further improving the network capacity and network resource utilization.

[0050] In a specific embodiment, the request time slot table and the authorized time slot table further include the current receiving power and the receivable power of each single-power receiving state time slot, and in some embodiments, adding the semi-idle time slots to the resource scheduling time slot table includes:

[0051] The semi-idle time slots and the corresponding authorized sending power of the semi-idle time slots in the authorized time slot table are added to the resource scheduling time slot table. In a specific embodiment, the authorized sending power is the above-mentioned receivable power.

[0052] In a specific implementation, the single-power receiving state indicates that the time slot has a message sent by other nodes using a power, which is the current receiving power, and also has a message sent by other nodes using another power, which is the receivable power. For example, node 1 is receiving a message sent by other nodes using a large power, and the current receiving power of node 1 is the large power, and the receivable power and the authorized sending power are small powers. After receiving the resource scheduling time slot table, the requesting node can know how to send a service message to the authorized node in the semi-idle time slot.

[0053] In some embodiments, as shown in Figure 2 The step S102 further includes:

[0054] In response to the number of idle time slots and semi-idle time slots being less than the time slot demand quantity, a conflict time slot is added to the resource scheduling time slot table, wherein the idle time slot is a time slot having an idle state in the request time slot table and the authorized time slot table, the semi-idle time slot is a time slot having an idle state in the request time slot table and a single-power receiving state in the authorized time slot table, and the conflict time slot is a time slot having a single-power receiving state or an occupied state in the request time slot table.

[0055] When the number of idle time slots and semi-idle time slots is less than the time slot demand quantity, it indicates that all time slots between the requesting node and the authorized node cannot meet the time slot demand of the resource scheduling, and at this time, the authorized node returns a conflict time slot to the requesting node, and the requesting node can reinitiate a resource scheduling request message according to the conflict time slot, so that the method provided by the application can continuously run.

[0056] In a specific embodiment, in order to maintain the consistency of the message format, in response to the number of idle time slots and semi-idle time slots being less than the time slot demand quantity, the same number of time slots as the time slot demand quantity including the conflict time slot are added to the resource scheduling time slot table.

[0057] In a more specific embodiment, in order to maintain the consistency of the message format, in response to the number of idle time slots and semi-idle time slots being less than the time slot demand quantity, all idle time slots and part of the conflict time slots are added to the resource scheduling time slot table, wherein the number of all time slots added to the resource scheduling time slot table is equal to the time slot demand quantity.

[0058] In a specific embodiment, in response to the existence of an idle time slot, the step S103 further includes:

[0059] The first time slot in the idle state in the authorization time slot table is selected, and the resource scheduling time slot table is sent in the time slot with high power to ensure the reliability of message sending and receiving. It should be noted that when the resource scheduling time slot table is sent, the time slot is in the occupied state in the authorization time slot table, and after sending all the resource scheduling time slot table, the time slot returns to the idle state in the authorization time slot table, so that the time slot can be used by the requesting node to send service messages to the authorized node.

[0060] In response to the absence of the idle time slot, it is indicated that the authorized node has no capability of sending messages, at this time, the authorized node can return to step S101 to wait for the request message, and if the requesting node side does not receive any message returned by the authorized node within a certain time, the resource scheduling request message will be re-initiated, so that the method provided by the application can continuously run.

[0061] Based on the same inventive concept, the application also provides a distributed ad hoc network service resource scheduling method applied to a requesting node, as shown in Figure 3 The method comprises the following steps of:

[0062] In step S201, a request message is sent to an authorized node, wherein the request message comprises a request time slot table of the requesting node itself and a time slot quantity required, and the authorized node can receive two messages sent with different powers in the same time slot.

[0063] In step S202, a resource scheduling time slot table sent by the authorized node is received.

[0064] In response to the absence of a conflict time slot in the resource scheduling time slot table, step S203 is performed: service data messages are sent to the authorized node according to the resource scheduling time slot table, and the request time slot table of the requesting node itself is updated according to the resource scheduling time slot table; or, in response to the presence of the conflict time slot in the resource scheduling time slot table, step S201 is returned to: the request message is re-sent to the authorized node, wherein:

[0065] The request time slot table comprises a plurality of time slots and a state corresponding to each time slot, the state comprises an idle state, a single-power receiving state and an occupied state, and the conflict time slot is a time slot in the request time slot table with the state of the single-power receiving state or the occupied state.

[0066] The service resource scheduling method provided by the application is based on a reservation mechanism, the transmission time slots between the requesting node and the authorized node are pre-agreed, message collisions at the same node are avoided, and the resource scheduling delay is reduced; and the power domain non-orthogonal technology is added, communication interference between adjacent nodes is avoided, and the network capacity, time slot multiplexing degree and network resource utilization rate are improved.

[0067] For the convenience of understanding, the mechanism of the authorized node receiving the request message will be briefly described below to assist in further explaining the process of the request node sending the request message and receiving the resource scheduling time slot table.

[0068] The request node and the authorized node are nodes within one hop of direct communication with each other. The request message includes not only the request time slot table and the number of time slot requirements of the request node itself, but also the service source node ID, the service destination node ID, and the next hop node ID. In a specific embodiment, the ID of the next hop node is the ID of the authorized node. The request node broadcasts the request message to all nodes within one hop of the request node. After receiving the request message, the node parses the message to obtain the next hop node ID. If the next hop node ID is the same as the ID of the node itself, the node determines itself as the authorized node in the above embodiment and implements the service resource scheduling method applied to the authorized node. Otherwise, the node ignores the message.

[0069] In a specific embodiment, the request node receives a service transmission primitive issued by the network layer and starts the resource scheduling process before service transmission, and performs the step S201. The step S201 further includes:

[0070] The first time slot in the idle state in the request time slot table is selected, and the request message is sent in the time slot with high power to ensure the reliability of message sending and receiving.

[0071] Considering that the time slot for sending the request message by the request node can be in the occupied state in the authorized time slot table, or the authorized node has no time slot in the idle state, the service resource scheduling method applied to the request node further includes:

[0072] Step S204: In response to not receiving the resource scheduling time slot table sent by the authorized node within a period of time, returning to perform step S201. The specific duration of the period of time can be determined by those skilled in the art according to actual conditions, which is not limited here.

[0073] It should be noted that the same technical features in the service resource scheduling method applied to the request node in the above embodiments of the present application have the beneficial effects of the corresponding embodiments, which will not be described here.

[0074] It should be noted that the method of the embodiments of the present application can be executed by a single device, for example, a computer or a server, etc. The method of the embodiments can also be applied to a distributed scenario, and be completed by multiple devices cooperating with each other. In the case of such a distributed scenario, one of the multiple devices can only execute one or more steps in the method of the embodiments of the present application, and the multiple devices can interact with each other to complete the method.

[0075] It should be noted that some embodiments of the present application have been described above. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recited in the claims can be performed in a different order than that described above and still achieve desirable results. Additionally, the processes depicted in the figures do not necessarily require the particular order shown, or sequential order, to achieve the desired results. In certain implementations, multitasking and parallel processing can be advantageous.

[0076] Based on the same inventive concept, the present application also provides a distributed ad hoc network service resource scheduling device applied to an authorized node, which can receive two messages sent using different powers in the same time slot, such as Figure 4 As shown in the figure, the device comprises:

[0077] The request receiving unit 10 is configured to receive a request message sent by a request node, wherein the request message comprises a request time slot table of the request node itself and a time slot demand quantity;

[0078] The resource scheduling unit 20 is configured to determine a resource scheduling time slot table according to the authorized time slot table of the authorized node itself, the request time slot table and the time slot demand quantity;

[0079] The authorization sending unit 30 is configured to send the resource scheduling time slot table to the request node;

[0080] The service resource receiving unit 40 is configured to receive a service data message fed back by the request node according to the resource scheduling time slot table.

[0081] The service resource scheduling device provided by the present application is based on a reservation mechanism, and the transmission time slots between the request node and the authorized node are reserved in advance to avoid message collision at the same node and reduce resource scheduling delay. In addition, the power domain non-orthogonal technology is added to avoid communication interference between adjacent nodes while improving network capacity, time slot multiplexing degree and network resource utilization.

[0082] In some embodiments, the request time slot table and the authorization time slot table each include a plurality of time slots and a corresponding state of each time slot, and the state includes an idle state, a single power receiving state and an occupied state.

[0083] In some embodiments, the resource scheduling unit 20 is further configured to:

[0084] In response to the number of idle time slots being greater than or equal to the number of time slot requirements, selecting the same number of time slots as the number of time slot requirements from the idle time slots and adding the time slots to the resource scheduling time slot table, wherein:

[0085] The idle time slots are time slots with an idle state in both the request time slot table and the authorization time slot table.

[0086] In response to the number of idle time slots being less than the number of time slot requirements, and the number of idle time slots plus the number of semi-idle time slots being greater than or equal to the number of time slot requirements, adding all the idle time slots and part of the semi-idle time slots to the resource scheduling time slot table, wherein:

[0087] The number of all time slots added to the resource scheduling time slot table is equal to the number of time slot requirements, the idle time slots are time slots with an idle state in both the request time slot table and the authorization time slot table, and the semi-idle time slots are time slots with an idle state in the request time slot table and a single power receiving state in the authorization time slot table.

[0088] In some embodiments, adding the semi-idle time slots to the resource scheduling time slot table includes:

[0089] Adding the semi-idle time slots and the corresponding authorized transmission power of the semi-idle time slots to the resource scheduling time slot table.

[0090] In some embodiments, the resource scheduling unit 20 is further configured to:

[0091] In response to the number of idle time slots plus the number of semi-idle time slots being less than the number of time slot requirements, adding a conflict time slot to the resource scheduling time slot table, wherein the idle time slots are time slots with an idle state in both the request time slot table and the authorization time slot table, the semi-idle time slots are time slots with an idle state in the request time slot table and a single power receiving state in the authorization time slot table, and the conflict time slots are time slots with a single power receiving state or an occupied state in the request time slot table.

[0092] Based on the same inventive concept, the application also provides a distributed ad hoc network service resource scheduling device applied to a request node, as shown in Figure 5 The device includes:

[0093] The request sending unit 50 is configured to send a request message to an authorized node, wherein the request message comprises a request time slot table of the request node itself and a number of time slot requirements, and the authorized node can receive two messages sent using different powers in the same time slot;

[0094] The authorization receiving unit 60 is configured to receive a resource scheduling time slot table sent by the authorized node;

[0095] The service resource sending unit 70 is configured to send a service data message to the authorized node according to the resource scheduling time slot table in response to the absence of a conflict time slot in the resource scheduling time slot table, or re-send the request message to the authorized node in response to the presence of the conflict time slot in the resource scheduling time slot table, wherein:

[0096] The request time slot table comprises a plurality of time slots and a state corresponding to each time slot, the state comprises an idle state, a single-power receiving state and an occupied state, and the conflict time slot is a time slot in which the state in the request time slot table is a single-power receiving state or an occupied state.

[0097] The service resource scheduling device provided by the application is based on a reservation mechanism, and a transmission time slot is reserved between a request node and an authorized node, so as to avoid message collision at the same node and reduce resource scheduling delay. In addition, the application adds a power domain non-orthogonal technology, so as to avoid communication interference between adjacent nodes, improve network capacity, time slot multiplexing degree and network resource utilization rate.

[0098] For the convenience of description, the above device is described in various modules in terms of functions. Of course, the functions of the modules can be implemented in one or more software and / or hardware in the implementation of the application.

[0099] The device of the above embodiment is used to implement the distributed ad hoc network service resource scheduling method applied to the authorized node or the request node in any of the above embodiments, and has the beneficial effects of the corresponding method embodiments, which will not be described here.

[0100] Based on the same inventive concept, the application also provides an electronic device corresponding to the method of any of the above embodiments, comprising a memory, a processor and a computer program stored in the memory and executable on the processor, and the processor implements the distributed ad hoc network service resource scheduling method applied to the authorized node or the request node according to any of the above embodiments when executing the program.

[0101] Figure 6A more specific electronic device hardware structure schematic diagram provided by the embodiment is shown, and the device can include: a processor 1010, a memory 1020, an input / output interface 1030, a communication interface 1040, and a bus 1050. The processor 1010, the memory 1020, the input / output interface 1030, and the communication interface 1040 are connected to each other through the bus 1050 for internal communication.

[0102] The processor 1010 can be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an ASIC (Application Specific Integrated Circuit), or one or more integrated circuits, and is used to execute related programs to implement the technical solutions provided by the embodiments of the present specification.

[0103] The memory 1020 can be implemented by a ROM (Read Only Memory), a RAM (Random Access Memory), a static storage device, a dynamic storage device, etc. The memory 1020 can store an operating system and other application programs. When the technical solutions provided by the embodiments of the present specification are implemented by software or firmware, the related program codes are stored in the memory 1020 and are called and executed by the processor 1010.

[0104] The input / output interface 1030 is used to connect input / output modules to realize information input and output. The input / output modules can be configured as components in the device (not shown in the figure) or externally connected to the device to provide corresponding functions. The input device can include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output device can include a display, a speaker, a vibrator, an indicator light, etc.

[0105] The communication interface 1040 is used to connect a communication module (not shown in the figure) to realize the communication interaction between the device and other devices. The communication module can realize communication through a wired manner (such as USB, network cable, etc.) or a wireless manner (such as mobile network, WIFI, Bluetooth, etc.).

[0106] The bus 1050 includes a channel for transmitting information between various components (such as the processor 1010, the memory 1020, the input / output interface 1030, and the communication interface 1040) of the device.

[0107] It should be noted that although the above device only shows the processor 1010, the memory 1020, the input / output interface 1030, the communication interface 1040 and the bus 1050, in the specific implementation process, the device can also include other components necessary for normal operation. In addition, those skilled in the art can understand that the above device can also only contain components necessary to implement the embodiments of the present application, and does not necessarily contain all the components shown in the figure.

[0108] The electronic device of the above embodiment is used to implement the distributed ad hoc network service resource scheduling method applied to the authorized node or the request node in any of the preceding embodiments, and has the beneficial effects of the corresponding method embodiments, which are not repeated here.

[0109] Based on the same inventive concept, corresponding to the method of any of the above embodiments, the present application also provides a non-transitory computer readable storage medium storing computer instructions for causing the computer to execute the distributed ad hoc network service resource scheduling method applied to the authorized node or the request node as described in any of the above embodiments.

[0110] The computer readable medium of the present embodiment includes permanent and non-permanent, removable and non-removable media, which can be implemented by any method or technology to store information. The information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassette, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information accessible by a computing device.

[0111] The computer instructions stored in the storage medium of the above embodiment are used to cause the computer to execute the distributed ad hoc network service resource scheduling method applied to the authorized node or the request node as described in any of the above embodiments, and have the beneficial effects of the corresponding method embodiments, which are not repeated here.

[0112] Those of ordinary skill in the art will realize that the foregoing discussion of any of the embodiments has been presented for the purpose of illustration and description and is not intended to be exhaustive or to limit the application to the precise forms described, and that various adaptations and modifications are possible within the scope and spirit of the application. For example, while the embodiments discussed above are described in the context of a memory device, other memory architectures (e.g., dynamic RAM (DRAM)) can use the embodiments discussed.

[0113] In addition, to simplify the description and discussion, and so as not to make the embodiments of the application difficult to understand, the well-known power / ground connections to integrated circuit (IC) chips and other components can or can not be shown in the provided drawings. Further, devices can be shown in block diagram form so as not to make the embodiments of the application difficult to understand, and this also takes into account the fact that details regarding implementation of these block diagram devices are highly dependent on the platform in which the embodiments of the application are to be implemented (i.e., these details should be well within the understanding of one of ordinary skill in the art). Where specific details (e.g., circuitry) are set forth in order to describe an illustrative embodiment of the application, it should be apparent to one of ordinary skill in the art that the embodiments of the application can be practiced without or with variation of these specific details. Thus, the description should not be viewed as limiting, but rather as merely descriptive.

[0114] While the application has been described in connection with specific embodiments thereof, it will be understood that many modifications, variations and alternatives will be apparent to those skilled in the art as a result of the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) can use the embodiments discussed.

[0115] It is therefore intended that the embodiments of the application embrace all such alternatives, modifications and variations as falling within the broad scope of the appended claims. Accordingly, any and all departures from the above described embodiments are included within the scope of the present application.

Claims

1. A distributed self-organizing network service resource scheduling method applied to an authorized node, characterized in that, The authorization node receives two messages sent using different powers in the same time slot, and the method comprises: receiving a request message sent by a request node, wherein the request message comprises a request time slot table of the request node itself and a time slot demand number; determining a resource scheduling time slot table according to an authorization time slot table of the authorization node itself, the request time slot table and the time slot demand number, comprising: in response to the number of idle time slots being less than the time slot demand number and the number of idle time slots plus the number of semi-idle time slots being greater than or equal to the time slot demand number, adding all the idle time slots and part of the semi-idle time slots to the resource scheduling time slot table, wherein: the number of all time slots added to the resource scheduling time slot table is equal to the time slot demand number, the idle time slots are time slots in the idle state in the request time slot table and the authorization time slot table, and the semi-idle time slots are time slots in the idle state in the request time slot table and in the single-power receiving state in the authorization time slot table; sending the resource scheduling time slot table to the request node; receiving a service data message fed back by the request node according to the resource scheduling time slot table.

2. The method of claim 1, wherein, The request time slot table and the authorization time slot table each comprise a plurality of time slots and a corresponding state of each time slot, and the state comprises an idle state, a single-power receiving state and an occupied state.

3. The method of claim 2, wherein, The determining of the resource scheduling time slot table according to the authorization time slot table of the authorization node itself, the request time slot table and the time slot demand number comprises: in response to the number of idle time slots being greater than or equal to the time slot demand number, selecting the same number of time slots as the time slot demand number from the idle time slots and adding them to the resource scheduling time slot table, wherein: the idle time slots are time slots in the idle state in the request time slot table and the authorization time slot table.

4. The method of claim 1, wherein, The adding of the semi-idle time slots to the resource scheduling time slot table comprises: adding the semi-idle time slots and the corresponding authorization sending power of the semi-idle time slots to the resource scheduling time slot table.

5. The method of claim 2, wherein, The determining of the resource scheduling time slot table according to the authorization time slot table of the authorization node itself, the request time slot table and the time slot demand number comprises: in response to the number of idle time slots plus the number of semi-idle time slots being less than the time slot demand number, adding a conflict time slot to the resource scheduling time slot table, wherein: the idle time slots are time slots in the idle state in the request time slot table and the authorization time slot table, the semi-idle time slots are time slots in the idle state in the request time slot table and in the single-power receiving state in the authorization time slot table, and the conflict time slot is a time slot in the single-power receiving state or the occupied state in the request time slot table.

6. A distributed ad hoc network service resource scheduling method applied to a requesting node, characterized in that, comprising: sending a request message to an authorization node, wherein the request message comprises a request time slot table of the request node itself and a time slot demand number, and the authorization node receives two messages sent using different powers in the same time slot; receiving a resource scheduling time slot table sent by the authorization node; in response to the absence of the conflict time slot in the resource scheduling time slot table, sending a service data message to the authorized node according to the resource scheduling time slot table; or, in response to the presence of the conflict time slot in the resource scheduling time slot table, re-sending the request message to the authorized node, wherein: the request time slot table comprises a plurality of time slots and a corresponding state of each time slot, the state comprises an idle state, a single power receiving state and an occupied state, and the conflict time slot is a time slot whose state in the request time slot table is the single power receiving state or the occupied state.

7. A distributed ad hoc network service resource scheduling apparatus applied to an authorized node, characterized in that, the authorized node receives two messages sent using different powers in the same time slot, and the apparatus comprises: a request receiving unit configured to receive a request message sent by a request node, wherein the request message comprises a request time slot table of the request node itself and a number of time slot requirements; a resource scheduling unit configured to determine a resource scheduling time slot table according to an authorized time slot table of the authorized node itself, the request time slot table and the number of time slot requirements, comprising: in response to the number of idle time slots being less than the number of time slot requirements and the number of idle time slots plus the number of semi-idle time slots being greater than or equal to the number of time slot requirements, adding all the idle time slots and part of the semi-idle time slots to the resource scheduling time slot table, wherein: the number of all time slots added to the resource scheduling time slot table is equal to the number of time slot requirements, the idle time slot is a time slot whose state in the request time slot table and the authorized time slot table is the idle state, and the semi-idle time slot is a time slot whose state in the request time slot table is the idle state and whose state in the authorized time slot table is the single power receiving state; an authorized sending unit configured to send the resource scheduling time slot table to the request node; a service resource receiving unit configured to receive a service data message fed back by the request node according to the resource scheduling time slot table.

8. A distributed ad hoc network service resource scheduling apparatus applied to a requesting node, characterized in that, comprises: a request sending unit configured to send a request message to an authorized node, wherein the request message comprises a request time slot table of the request node itself and a number of time slot requirements, and the authorized node receives two messages sent using different powers in the same time slot; an authorized receiving unit configured to receive a resource scheduling time slot table sent by the authorized node; a service resource sending unit configured to, in response to the absence of a conflict time slot in the resource scheduling time slot table, send a service data message to the authorized node according to the resource scheduling time slot table; or, in response to the presence of the conflict time slot in the resource scheduling time slot table, re-send the request message to the authorized node, wherein: the request time slot table comprises a plurality of time slots and a corresponding state of each time slot, the state comprises an idle state, a single power receiving state and an occupied state, and the conflict time slot is a time slot whose state in the request time slot table is the single power receiving state or the occupied state.

9. An electronic device comprising a memory, a processor, and a computer program stored on the memory and running on the processor, characterized in that, The processor implements the method of any one of claims 1 to 6 when executing the program.

Images