WO2014036901A1

WO2014036901A1 - Slot state maintaining method and apparatus

Info

Publication number: WO2014036901A1
Application number: PCT/CN2013/082370
Authority: WO
Inventors: 房家奕; 冯媛; 李凤; 赵丽; 赵毅
Original assignee: 电信科学技术研究院
Priority date: 2012-09-07
Filing date: 2013-08-27
Publication date: 2014-03-13
Also published as: CN103687031B; CN103687031A

Abstract

Disclosed are a slot state maintaining method and apparatus, which support multiple slots and are used for solving the information transmission problem when one node occupies multiple slots. The method comprises: a first node maintaining a slot state vector corresponding to each slot used by the first node, the slots used by the first node comprising self-occupied slots or/and applied slots; and the first node sending F1 to other nodes on the self-occupied slots in each frame period, receiving, on the non-self-occupied slots in each frame period, F1 sent by other nodes, and independently updating, according to the received F1, the slot state vector corresponding to each slot and maintained locally. The technical solutions of the present application can solve the information processing problem for multiple slots when one node occupies multiple time slots, thereby providing a high-layer business with a transmission service more flexibly and more effectively.

Description

The present invention claims the priority of the Chinese patent application filed on September 7, 2012, the Chinese Patent Application No. 201210331559.3, entitled "Slot Time Maintenance Method and Apparatus" The entire contents of which are incorporated herein by reference. Technical field

The present invention relates to the field of network management, and in particular, to a method and apparatus for maintaining slot state support for multiple slots. Background technique

With the development of the car/road cooperative communication system and the gradual maturity of the mobile ad hoc network technology, in order to realize the real-time, dynamic and intelligent management of the vehicle, the internationally developed dedicated short-range communication for the Internet of Vehicles (Dedicated Short Range Communications) , DSRC) agreement. Through two-way transmission of information, DSRC organically connects vehicles with vehicles, vehicles and roadside information gathering devices to support point-to-point and point-to-multipoint communication.

The Mobile Slotted Aloha (MS-ALOHA) mechanism is a DSRC Media Access Control (MAC) layer access and resource allocation mechanism based on time-sharing. The resource allocation is based on the frame structure to slot. (time slot) is a unit. Referring to Figure 1, each N slots form a frame (denoted as Frame), and the slot number in each frame is 0 N-1, which cycles back and forth between frames. Only one vehicle is allowed to transmit in each slot, that is, the time division multiple access (TDMA) mode between the vehicles. The vehicle not only transmits the data of the application layer in the occupied time slot, but also needs to send frame information (Fi), and the FI indicates the occupation status of each slot in a frame.

The basic idea of the MS-AL0HA mechanism is: When any node (for example, a vehicle) joins the network, it needs to occupy one time slot by using the idle time slot resource in the listening frame. If the node does not actively give up the occupied time slot resource, then Data can always be transmitted using occupied time slots during which other nodes cannot use the time slot. On the occupied time slot, the node needs to periodically send the FI, and the information carried by the node in the FI that is occupied by the node within two hops of the node occupies the time slot, and indicates the occupancy status information of each time slot perceived by the node. The information about the occupation status of the time slot for each time slot includes: time slot occupation status information, a Temporary Resource Identifier (STI) corresponding to the node occupying the time slot, or may be referred to as a node identifier, occupying a time slot. The priority status of the node (which can also be considered as the priority status corresponding to the data sent by the time slot node in the time slot); wherein the time slot occupation status information can express the four occupied states of the time slot: (00) The time slot is idle, (10) indicates that the time slot has been occupied by other nodes that are one hop away from the node (the cylinder is called a hop node) or the node is occupied, and (11) indicates that the time slot has been separated from the node. The other nodes of the two hops are occupied (the cylinder is called the two-hop node), and (01) indicates that the time slot has been occupied by two or more other nodes, that is, the collision state; Time slots, each node by listening to transmitting nodes FI-hop neighbor, can be It is determined that each node in the adjacent three-hop range occupies a time slot. When the time slot resource occupied by the node is found to collide with resources used by other nodes, a new idle time slot is reserved. To facilitate the subsequent description, the present invention uses the following description for the FI and its internal information content:

The node sends frame information (FI ) called: FI message, which can also be called FI;

The occupation status information corresponding to each time slot indicated in the FI is called: the time slot information field corresponding to each time slot in the FI message;

The three types of information (ie, slot occupancy status, STI, and priority information) given in the occupancy status information corresponding to each time slot in the FI are respectively called: time slots included in the slot information field of each slot. Occupied state subdomain, STI subdomain, priority subdomain;

It should be noted that the above description is only for the convenience of the subsequent description, and other descriptions may be used.

When a node receives an FI message in a time slot, it always overwrites the content recorded before one frame period with the slot information content carried in the newly received FI message. The node generates and sends an FI message in the time slot occupied by the node. Each field (domain) needs to be filled according to certain rules, including the slot occupation status sub-domain, the STI sub-domain, and the priority sub-domain. After the transmission is completed, the node will clear the transmitted FI information.

Under the state update ALOHA (State Update Aloha, SU-ALOHA) mechanism, the transmission mode of the FI, and the processing method of the slot information content of the local maintenance time slot by the node according to the slot information content carried in the FI message, in the MS - The improvement of the ALOHA mechanism has been improved. Specifically, under the SU-ALOHA mechanism, the node saves the FI information in an iterative manner, that is, the node only stores a vector about the current occupied state of each time slot, which is called a slot state vector (also referred to as a slot state table). Subsequently referred to as a slot state vector (table), when a node has only one slot used by itself, the node only stores the slot state vector (table) corresponding to the slot used by itself. After receiving the FI sent by the other node, the node updates the slot information unit corresponding to each slot in the locally stored slot state vector (table) according to the slot information field corresponding to each slot in the newly received FI. When the node needs to send its own FI, it will generate the FI to be sent according to the information in the saved slot state vector (table).

The occupancy status information corresponding to each time slot indicated in the slot status vector (table) is referred to as: the slot information unit corresponding to each slot in the slot status vector (table).

The information given in the occupancy status information corresponding to each time slot in the slot status vector (table) (ie: slot occupancy status, STI) is called: the time slot included in the slot information unit of each slot. Occupancy status sub-unit (here, the content in the slot occupancy status sub-unit does not need to be exactly the same as the sub-area occupancy status sub-area in the FI, but a mapping relationship is required, such as: "The slot status table saved for the node can be set" Self-occupation, and "one-hop node occupancy" two states to indicate the occupancy status of the time slot, and the node maps the information content in the saved time slot status table to the FI message to be sent, two states in FI The slot occupancy status subfields in the slot information field corresponding to the slot can be mapped to "10". After receiving the FI, the other nodes judge the corresponding location of the slot information field (whether it is a detection domain or a non-detection domain). Time slot The "10" in the time slot occupation status subfield of the information field refers to whether the transmitting node is occupied by the hop node of the transmitting node or the STI subunit.

In the prior art, there is only a processing scheme in which a node uses a single slot. When a node needs to use more than one time slot at the same time, that is, when one node needs to transmit multiple services concurrently, the node uses more than one time slot at the same time to satisfy High-level business needs. In the prior art, when a node occupies multiple time slots, how to process the information between the time slots used by the node is not solved by the technical solution. Summary of the invention

Embodiments of the present invention provide a method and a device for maintaining a slot state in a multi-slot, which are used to solve the problem in the prior art that when a node needs to use more than one slot at the same time, it cannot be used between the slots used by the node. The problem of processing information.

The specific technical solutions provided by the embodiments of the present invention are as follows:

A method for maintaining a slot state in a multi-slot, comprising:

The first node maintains a corresponding slot state vector for each slot used by the first node, where the slot used by the first node itself includes a self-occupied slot or/and an application slot;

The first node transmits the frame information FI to the other nodes on the self-occupied time slot in each frame period, and receives the FI sent by the other node on the non-self-occupying time slot in each frame period, and according to the received FI The slot state vectors corresponding to each time slot maintained locally are updated separately.

A slot state maintenance device supporting multiple slots includes:

a maintenance unit, configured to maintain, by the first node, a corresponding time slot state vector for each time slot used by the first node, where the time slot used by the first node itself includes a self-occupied time slot or/and an application time slot;

An update unit, configured to: send, by the first node, frame information FI to other nodes on a self-occupied time slot in each frame period, and receive FI sent by other nodes on a non-self-occupying time slot in each frame period, and The slot state vector corresponding to each time slot maintained locally is updated according to the received FI.

In the embodiment of the present invention, the first node maintains a corresponding slot state vector for each slot used by the first node, where the slot used by the first node itself includes a self-occupied slot or/and an application slot; The first node sends the FI to the other nodes on the self-occupied time slots in each frame period, and receives the FIs sent by the other nodes on the non-self-occupying time slots in each frame period, and locally according to the received FI pairs. The slot state vectors corresponding to each time slot maintained are updated separately. The technical solution of the present invention can solve the problem of information processing for multiple time slots when a node occupies multiple time slots, thereby providing a transmission service for higher-level services more flexibly and efficiently. DRAWINGS

1 is a schematic diagram of a frame structure in the prior art; 2 is a structural diagram of a slot state maintenance apparatus supporting multiple slots in an embodiment of the present invention;

FIG. 3 is a flowchart of time slot state maintenance supporting multiple slots in an embodiment of the present invention; FIG.

4 is a flowchart of establishing a slot state vector (table) corresponding to an application slot for a node A according to an embodiment of the present invention; FIG. 5 is a time slot corresponding slot state vector used by an update node A according to an embodiment of the present invention; Flow chart of (table);

6 is a flowchart of a process in which a time slot used by a node A itself collides with a time slot used by another node in the embodiment of the present invention;

FIG. 7 is a flowchart of a node A transmitting FI to other nodes in its own time slot according to an embodiment of the present invention. detailed description

In order to solve the problem in the prior art that when a node needs to use more than one time slot at the same time, the information between the time slots used by the node cannot be processed. In the embodiment of the present invention, the first node maintains a corresponding slot state vector for each slot used by the first node, where the slot used by the first node itself includes a self-occupied time slot or/and an application slot; The first node transmits the frame information FI to the other nodes on the self-occupied time slot in each frame period, and receives the FI sent by the other node on the non-self-occupying time slot in each frame period, and according to the received FI The slot state vectors corresponding to each time slot maintained locally are updated separately. The technical solution of the present invention can solve the problem of information processing for multiple time slots when a node occupies multiple time slots, thereby providing a transmission service for higher-level services more flexibly and efficiently.

When a node (hereinafter referred to as a first node) occupies a plurality of time slots at the same time, in order to facilitate resource management, in the embodiment of the present invention, the first node internally occupies different time slots, regardless of whether the first node occupies several time slots at the same time. A slot status vector (table) is separately maintained to process the received message and the sent message.

In the slot state vector (table), the slot state information corresponding to each slot is stored as a slot information unit, denoted as Unit, and stores various types of information required in the process of receiving and transmitting.

The self-occupied time slot refers to the time slot in which the first node sends the FI to other nodes. For example, the current frame period includes 10 time slots, that is, time slot 0 to time slot 9, the first node sends FI to other nodes in time slot 5, and time slot 5 in the time slot after time slot 5 of the frame period. As a self-occupied time slot of the first node. Moreover, when the first node does not collide in the time slot 5 in a subsequent frame period, the time slot 5 is a self-occupied time slot of the first node. The application time slot means that the first node selects a certain time slot n in the current frame period as a transmission time slot for transmitting FI to other nodes, and plans to send FI to other nodes in the above time slot n, but does not reach the time of transmitting FI. Time slot n. For example, the current frame period includes 10 time slots, that is, time slot 0 to time slot 9, and the first node selects time slot 4 as the transmission time slot of the transmitting FI in the time slot 0, then before the first node reaches the time slot 4 Slot 1, Slot 2, and Slot 3 all use slot 4 as the application slot for the first node. The self-occupied time slot can be converted from the application time slot. For example, in the above frame period, when the FI is sent to the time slot 4, the time slot 4 is converted into a self-occupied time slot, and in the subsequent frame period, if A node does not collide in time slot 4, then time slot 4 It will always be the self-occupied time slot of the first node.

Preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings.

Referring to FIG. 2, in the embodiment of the present invention, a slot state maintenance device supporting multiple slots includes a maintenance unit 20 and an update unit 21, where

The maintenance unit 20 is configured to maintain, by the first node, a corresponding time slot state vector for each time slot used by the first node, where the time slot used by the first node itself includes a self-occupied time slot or/and an application time slot;

The updating unit 21 is configured to: the first node sends the frame information FI to the other nodes in the self-occupied time slot in each frame period, and receives the FI sent by the other node on the non-self-occupying time slot in each frame period, And according to the received FI, the slot state vector corresponding to each time slot maintained locally is updated separately.

Other nodes send frame information FI, and receive other nodes to send on non-self-occupied time slots in each frame period.

FI, and according to the received FI, respectively update the slot state vector corresponding to each time slot maintained locally.

Based on the foregoing technical solution, referring to FIG. 3, in the embodiment of the present invention, the detailed process of maintaining the time slot state of a plurality of time slots occupied by one node is as follows:

Step 300: The first node maintains a corresponding slot state vector for each slot used by itself.

In the embodiment of the present invention, the time slot used by the first node itself includes a self-occupied time slot or/and an application time slot. In the current frame period, when the application time slot of the first node is reached, the application time slot of the node is converted into a self-occupied time slot.

If the first node uses at least one self-occupied time slot, and the first node applies for another time slot, the first node selects one idle time slot as the application time slot in one frame period, and after determining the number of the pre-application time slot, A slot state vector (table) corresponding to the application slot of the first node is established.

In the embodiment of the present invention, the process of creating a time slot state vector (table) corresponding to the application time slot of the first node is: occupying any one of the at least one self-occupied time slot of the first node (such as a time slot) n) corresponding slot state vector (table) is copied to generate an initial slot state vector (table) corresponding to the application slot of the first node; and the first node in the initial state vector corresponding to the application slot is self-occupied The slot state information corresponding to the time slot (such as slot n) is modified to be idle, and the slot state vector (table) corresponding to the application slot is established. For example, when the first node has a self-occupied time slot, that is, the first-self-occupied time slot, a time slot is applied as an application time slot, and the time slot state vector (table) corresponding to the first self-occupied time slot can be copied. Establishing an initial slot state vector (table) corresponding to the application slot; modifying the slot state information corresponding to the first self-occupied slot in the initial slot state vector (table), and changing "self-occupied" to "idle" " Status. After the above process, a slot state vector (table) corresponding to the application slot of the first node is established.

In the embodiment of the present invention, when the time slot used by the first node is multiple, the first node establishes a corresponding slot state vector (table) for each time slot used by itself, and uses the first node itself to use a single slot. The method of implementing the process is convenient.

The slot state record (table) corresponding to the first node is established according to the slot state information in the slot state vector (table) corresponding to all slots used by the first node itself. The time slot status record (table) includes the corresponding self of the first node. Represents a set of time slots and a set of application slots. The slot state record (table) of the foregoing first node includes multiple forms. For example, the self-occupied slot set and the application slot set may be respectively displayed in a list form.

Step 310: The first node sends the FI to the other node in the self-occupied time slot in each frame period, and receives the FI sent by the other node on the non-self-occupying time slot in each frame period, and according to the received The FI independently updates the slot state vector (table) corresponding to each time slot maintained locally.

The first node updates the slot state vector (table) corresponding to each time slot maintained locally according to the FI sent by other nodes. When updating the slot state vector (table) corresponding to each slot maintained by the first node, the slot state vector (table) corresponding to each slot is independently updated, that is, the slot corresponding to the different slot. Changes in state vectors (tables) do not affect each other.

After updating the slot state vector (table) corresponding to each time slot maintained by the local node according to the FI sent by the other node, the updated slot state vector (table) corresponding to the application slot of the first node may be used. Whether the slot state of the application slot of the first node collides, and if it is a collision, delete the slot state vector corresponding to the application slot. In addition, the first node may comprehensively determine that the slot state of the self-occupied time slot of the first node is a collision according to the slot status vector corresponding to the time slot used by the other node and the first node itself. The slot state vector corresponding to the self-occupied time slot.

In the embodiment of the present invention, the slot state record of the established first node is updated according to the updated slot state vector (table) corresponding to the time slot used by the first node itself. For example, after the first node collides in an application time slot and deletes the slot state vector (table) corresponding to the application slot, the first node corresponds to the first node in the slot state record (table) of the first node. The corresponding application slot is deleted in the application slot list.

The above process is a process in which the first node receives the FI sent by other nodes on a time slot that is not used by itself. When the first node is in the time slot used by itself, the process of transmitting the FI to the other node is: according to the slot state vector (table) corresponding to the current self-occupied time slot of the first node, obtaining the first FI by mapping; The slot status record (table) corresponding to the first node determines whether the first node has other self-occupied time slots. If the first node has other self-occupied time slots, the time slot status information corresponding to other self-occupied time slots is updated. The first FI, that is, the time slot status information of the other self-occupied time slots in the first FI is modified to be self-occupied, and the second FI is obtained. If the first node does not have other self-occupied time slots, the first FI is directly used as Second FI; The first node sends a second FI to other nodes on its own time slot.

Determining, according to the slot state record corresponding to the first node, that the first node has other time slots used by itself other than the current self-occupied time slot, and using the second FI as the input information of other time slots used by the first node, According to the second FI, the slot state vectors corresponding to each other time slot used by the first node are independently updated.

According to the above technical solution, the following describes the slot state maintenance process supporting one node using multiple slots in combination with specific scenarios: Assume that one frame period includes five slots, numbered from slot 1 to slot 5, respectively. The length of the time slot is lms. In the communication range, there are two nodes, node A and node B, respectively, and node A and node B are one-hop neighbors. Embodiment 1

Referring to FIG. 4, when the time slot used by the node A itself includes a self-occupied time slot time slot 1 and the time slot used by the node B itself is the self-occupied time slot time slot 2, the process of applying for the new time slot 5 is:

Step 400: Node A maintains a corresponding slot state vector (table) for the self-occupied slot slot 1.

The slot state vector (table) corresponding to the self-occupied slot slot 1 of node A is shown in Table 1. The self-occupied time slot and the application time slot corresponding to each table are recorded as associated time slots of the table. For example, in Table 1, the current self-occupied time slot time slot 1 of the node A is the associated time slot of the node A. .

Step 410: Copy the slot state vector (table) corresponding to the slot 1 of the self-occupied slot of the node A, and generate an initial slot state vector (table) corresponding to the slot 5 of the application slot.

The initial slot state vector (table) corresponding to the application slot slot 5 of node A is identical to the slot state vector (table) corresponding to the self-occupied slot slot 1 of node A.

Step 420: Modify the slot state information corresponding to the self-occupied slot slot 1 of the node A in the slot state vector (table) corresponding to the slot 10 of the application slot, and establish the slot state corresponding to the slot 5 of the application slot. Vector (table).

Since the node A has the self-occupied time slot 1 , the time slot status vector (table) corresponding to the time slot 1 of the occupied time slot is copied, and the initial time slot status vector (table) corresponding to the application time slot 5 is obtained. 1 is shown. In the initial slot state vector (table) corresponding to the application slot of the node A, the application slot 5 is the associated slot of the node A, and the slot state information of the slot A of the slot A of the node A is modified to " "Idle", you can get the slot status vector corresponding to the application slot 5

(Table), as shown in Table 2.

Table 2

Node A has a self-occupied time slot 1 and an application time slot 5, and the self-occupied time slot 1 corresponds to the time slot status vector (table) shown in Table 1, and the application time slot 5 corresponds to Table 2 The slot state vector (table), that is, node A establishes independent slot state vectors (tables) for maintenance for a plurality of slots used by it.

Embodiment 2

Referring to FIG. 5, when the self-occupied time slot of node A is time slot 1 and time slot 5, the self-occupied time slot of node B is time slot 2, and the time slot status information corresponding to time slot 3 and time slot 4 is idle. In the state, node A is based on the FI sent by the receiving node B. The process of separately updating the slot state vector (table) corresponding to the slotted time slot 1 and the slot state vector (table) corresponding to the slotted time slot 5 is:

Step 500: Node A receives the FI sent by Node B on the non-self-used time slot in the above frame period. In the embodiment of the present invention, it is assumed that the FI transmitted by the Node B on the self-occupied time slot 2 is as shown in Table 3.

table 3

In the slot occupancy status column of Table 3, 00 indicates an idle state, and 10 indicates an occupied state. According to the FI sent by the Node B, the self-occupied time slot of the Node B is the time slot 2; the self-occupied time slot of the node A is the time slot 1 and the time slot 5, that is, the node A has two self-occupied time slots; The slot status information of the other slots in the idle state is idle, that is, it is not used by any node.

Step 510: Node A independently updates the slot state vector (table) corresponding to the time slot used by the UE according to the received FI.

The slot state vector corresponding to the self-occupied slot slot 1 of node A before the node A receives the FI sent by node B.

(Table) As shown in Table 1, the slot state vector (table) corresponding to the self-occupied slot slot 5 of the node A is as shown in Table 4.

Table 4

Based on the FI sent by the Node B, the node A updates the slot state vector (table) corresponding to the self-occupied slot slot 1 of the node A according to the state jump rule, that is, Table 1; The slot state vector (table) corresponding to slot 5, that is, Table 4 is updated. The above-mentioned jump rule is a rule for the node A to jump to the slot state in the slot state vector (table) corresponding to the slot used by the node A according to the FI sent by the other node.

From the above steps, the updated slot state vector (table) corresponding to the self-occupied slot slot 1 of the node A is obtained, as shown in Table 5, the updated post corresponding to the self-occupied slot slot 5 of the node A. The slot status vector (table) is shown in Table 6.

table 5

Slot number 1 (associated time slot) 2 3 4 5 Slot state self-occupied 1 hop neighbor idle idle 2 hop STI node STI Node A STI Node B STI N/AN/A Node A STI Slot number 1 2 3 4 5 (associated time slot) Slot state 2 hop neighbor 1 hop neighbor idle idle self-occupied STI Node S STI Node B STI N/AN/A Node S STI After the slot state vector (table) is updated, when the slot state information of the slot state vector (table) corresponding to a certain slot used by the node A itself is a collision, the time slot associated with the table is collided. At this point, the slot status vector (table) needs to be deleted.

In the embodiment of the present invention, the node A itself uses two time slots, and takes the FI sent by the node B as an input, according to the state jump rule, in the slot state vector (table) corresponding to the two self-occupied time slots of the node A. The slot status information is updated independently. For the slot state vector (table) corresponding to each self-occupied slot of node A, it is considered that the node A uses only one slot, and the other slots used by node A are treated as 2-hop neighbors. The above-mentioned processing scheme for using a plurality of time slots for one node itself uses a processing scheme in which one node in the prior art occupies a single time slot, and the solution is simple and easy to implement.

Embodiment 3

Referring to FIG. 6, the self-occupied time slot of node A is time slot 1, the self-occupied time slot of node B is time slot 2, and the time slot status information of other time slots of the frame period is idle state, when node A When slot 5 is to be used as the application slot, node C uses slot 5 as the self-occupied slot. In this case, the processing of each slot used by node A for itself is:

Step 600: Node A maintains its corresponding slot state vector (table) for the self-occupied slot slot 1, and node A maintains its corresponding slot state vector (table) for the application slot slot 5.

The time slot status vector (table) corresponding to the self-occupied time slot 1 of node A is shown in Table 1. The time slot status vector (table) corresponding to the application time slot of node A is shown in Table 2.

Step 610: Node A receives the FI sent by the Node B, and updates the slot state vector (table) corresponding to the slot slot 1 of the slot and the slot state vector corresponding to the slot slot 5 of the application slot according to the received FI. ).

In the embodiment of the present invention, according to the set scenario, the FI sent by the Node B in its own slot slot 2 is as shown in the table ₍

As can be seen from Table 7, slot 5 in this frame period has been used by node C. The FI sent by the Node B is taken as an input, and according to the state jump rule, the node A updates the slot state vector (table) corresponding to the slot 1 of the occupied slot, as shown in Table 8, and corresponding to the update request slot 5 The slot state vector (table) is shown in Table 9. Slot number 1 (associated time slot) 2 3 4 5 Slot occupancy status Self-occupied 1 hop adjacent idle idle 2 hops STI of the occupied node STI of node A STI N/AN/A STI of node C Table 9

Slot number 1 2 3 4 5 (associated time slot) Slot occupancy state 2 hop neighbor 1 hop neighbor idle idle 2 hop neighbor occupant node STI Node A STI Node B STI N/AN/A Node S STI step 620: Determine that the slot state information in the slot state vector (table) corresponding to the application slot slot 5 of the node A is a collision, and delete the slot state vector (table) corresponding to the application slot slot 5.

According to the updated slot state vector (table) of the application slot slot 5 of the node A, the slot state information of the slot 5 is non-idle and used by the node C. Therefore, when the node A still uses the time slot 5 as the application time slot, a collision will occur on the time slot 5. At this time, the node A will delete the time slot state vector (table) corresponding to the time slot 5, and the node A can apply. The other idle time slots in the frame period serve as application slots.

In the embodiment of the present invention, for the slot state vector (table) corresponding to each slot used by the node A, it is considered that the node A uses only one slot, and the other slots used by the node A serve as the 2-hop neighbor. deal with. The above-mentioned processing scheme for using a plurality of time slots for one node itself uses a processing scheme in which one node in the prior art occupies a single time slot, and the solution is simple and easy to implement.

Embodiment 4

Referring to FIG. 7, the self-occupied time slot of node A is time slot 1 and time slot 5, and the self-occupied time slot of node B is time slot 2, and the slot state information corresponding to other time slots of the frame period is idle. State, the process for node A to send FI to other nodes in self-occupied time slot 5 is:

Step 700: According to the slot state vector (table) corresponding to the slot A of the self-occupied slot of the node A, the mapping is initially obtained.

FI.

The two slot status vectors (tables) maintained by node A before transmitting the FI in the slot 5 of the self-occupied slot are shown in Table 5 and Table 6, respectively, wherein Table 5 is the self-occupied slot slot 1 of the node A. Corresponding slot state vector (table), Table 6 is the slot state vector (table) corresponding to the self-occupied slot slot 5 of node A. According to the slot state vector (table) corresponding to the self-occupied time slot 5 shown in Table 6, the initial FI transmitted by the node A to the other nodes in the self-occupied time slot 5 is obtained by mapping, as shown in Table 10.

Table 10

Slot number 1 2 3 4 5 Slot occupancy status 00 10 00 00 10 STI of the occupied node S/N/A/A Node B STI N/AN/A Node A STI It can be seen from Table 10 that the initial FI obtained by the slot state vector (table) corresponding to the self-occupied slot slot 5 of the node A is only It is shown that time slot 5 is used by node A, and time slot 2 is used by node B, and does not reflect that slot 1 is used by node A.

Step 710: Update the initial FI according to the slot state vector (table) corresponding to the slot A of the slot A of the node A, and obtain the final FI.

Node A detects whether there is a slot state vector (table) corresponding to slot A of slot A of node A. If it exists, it indicates that slot A of slot A of node A is not on the slot with other nodes. In the event of a collision, the initial FI is updated according to the slot state information in the slot state vector (table) corresponding to the slot A of the slot A of the node A, and the slot state information of other nodes in the initial FI is modified to be If the slot state vector (table) corresponding to the slot A of the self-occupied slot of the node A is not present, it indicates that the slot 1 of the self-occupied slot of the node A is on the slot with other nodes. A collision occurs, and the slot state vector (table) corresponding to the self-occupied slot slot 1 of the node A is deleted. At this time, the initial FI can be used as the final FI without modification.

In the embodiment of the present invention, there is a slot state vector (table) corresponding to the self-occupied slot slot 1 of the node A, and according to the slot state information corresponding to the slot A of the self-occupied slot of the node A shown in Table 5, Update the initial FI to get the final FI, as shown in Table 11.

Table 11

It can be seen from Table 11 that for the slot state vector (table) corresponding to each slot used by the node A, it is considered that the node A uses only one slot, and the other slots used by the node A are treated as the 2-hop neighbor node. However, in the generated final FI, all the time slots occupied by the node A are still directly indicated to be used by the node A. The above-mentioned processing scheme for transmitting a FI to a node by using a plurality of time slots in a certain self-occupied time slot is based on the processing scheme in which one node in the prior art occupies a single time slot, and takes into consideration The node occupies the indication of multiple time slots, and the solution is simple and easy to implement.

Step 720: Send the foregoing final FI to the Node B in the self-occupied time slot 5 of the node A.

In the above embodiment, in the first embodiment, the corresponding node A establishes a slot state record (table), as shown in Table 12 as a slot state record (table) in the form of a list.

In the third embodiment, according to the slot state vector (table) corresponding to the slot corresponding to the slot used by the node A itself, since the node A collides in the application slot 5, the slot state of the node A is updated. Record (table), as shown in Table 13.

Table 13

In the embodiment of the present invention, the first node maintains a corresponding slot state vector for each slot used by the first node, where the slot used by the first node itself includes a self-occupied slot or/and an application slot; The first node sends the FI to the other nodes on the self-occupied time slots in each frame period, and receives the FIs sent by the other nodes on the non-self-occupying time slots in each frame period, and locally according to the received FI pairs. The slot state vectors corresponding to each time slot maintained are updated separately. The technical solution of the present invention can solve the problem of information processing for multiple time slots when a node occupies multiple time slots, thereby providing a transmission service for higher-level services more flexibly and efficiently.

The structure and processing manner of the slot state maintenance device supporting the multi-slot provided by the embodiment of the present invention will be described below with reference to the preferred hardware structure.

In the embodiment of FIG. 2, the apparatus includes a transceiver, and at least one processor coupled to the transceiver, the processor: the processor configured to maintain the first node for each time slot used by itself a corresponding slot state vector, where the slot used by the first node itself includes a self-occupied time slot or/and an application slot;

The transceiver is configured for the first node to send frame information to other nodes on the self-occupied time slot in each frame period

FI, and receiving FI sent by other nodes on a non-self-occupying time slot in each frame period; the processor is further configured to respectively according to the received FI to the slot state vector corresponding to each time slot maintained locally Update.

In an implementation, when the first node establishes a slot state vector corresponding to an application slot, the processor is configured to:

The first node selects one idle time slot of one frame period as the application time slot of the first node; if the first node uses at least one self-occupied time slot, arbitrarily select one of the self-occupied time slots, which will be selected The slot state vector corresponding to the self-occupied time slot is copied to generate an initial slot state vector corresponding to the application slot; the slot state corresponding to the selected self-occupied slot in the initial state vector corresponding to the application slot The information is modified to be idle, and a slot state vector corresponding to the application slot is established.

In implementation, the processor is further configured to:

The first node #>, according to the FI sent by the other node, determines that the slot state of the application slot of the first node is a collision, and deletes the slot state vector corresponding to the application slot.

In implementation, the processor is further configured to: Determining, by the first node, the slot state corresponding to the slot used by the first node and the slot state vector corresponding to the slot used by the first node, determining that the slot state of the self-occupied slot of the first node is a collision, deleting the corresponding slot of the self-occupied slot Time slot status vector.

In implementation, the processor is further configured to:

The slot state record corresponding to the first node is established according to the slot state information in the slot state vector corresponding to all slots used by the first node itself.

In an implementation, when the first node sends the FI to the other node in the self-occupied time slot, the processor is configured to: first obtain the first mapping according to the slot state vector corresponding to the current self-occupied time slot of the first node. The time slot state record corresponding to the first node of the first node determines that the first node has other self-occupied time slots, and the slot state information of the other self-occupied time slots in the first FI is modified to be self-occupied to obtain the second FI; The triggering transceiver sends a second FI to the other node; wherein, the current self-occupied time slot is a time slot obtained by converting the application time slot.

In implementation, the processor is further configured to:

Determining, according to the slot state record corresponding to the first node, that the first node has other time slots used by itself other than the current self-occupied time slot, and using the second FI as input information of other time slots used by the first node; The second FI separately updates the slot state vector corresponding to each other slot used by the first node for self-use.

Those skilled in the art will appreciate that embodiments of the present invention can be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or a combination of software and hardware. Moreover, the present invention can be embodied in the form of a computer program product embodied on one or more computer-usable storage interfaces (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer usable program code.

The present invention has been described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (system), and computer program products according to embodiments of the invention. It will be understood that each process and/or block of the flowchart illustrations and/or FIG. These computer program instructions can be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing device to produce a machine for the execution of instructions for execution by a processor of a computer or other programmable data processing device. Means for implementing the functions specified in one or more of the flow or in a block or blocks of the flow chart.

The computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device. The apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.

These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device. The instructions are provided for implementing one or more processes and/or block diagrams in the flowchart The steps of the function specified in the box or in multiple boxes.

Although the preferred embodiment of the invention has been described, it will be apparent to those of ordinary skill in the art that <RTIgt; Therefore, the appended claims are intended to be construed as including the preferred embodiments and the modifications

It is apparent that those skilled in the art can make various modifications and variations to the embodiments of the present invention without departing from the spirit and scope of the embodiments of the present invention. Thus, it is intended that the present invention cover the modifications and modifications of the inventions

Claims

Rights request

1. A time slot status maintenance method that supports multiple time slots, which is characterized by including:

The first node maintains a corresponding time slot status vector for each time slot it uses, where the time slots used by the first node include self-occupied time slots or/and applied time slots;

The first node sends frame information FI to other nodes on the self-occupied time slot in each frame period, and receives the FI sent by other nodes on the non-self-occupied time slot in each frame period, and based on the received FI The time slot status vector corresponding to each time slot maintained locally is updated independently.

2. The method of claim 1, wherein when the first node establishes a time slot status vector corresponding to an application time slot, it includes:

The first node selects a certain idle time slot in a frame period as the application time slot of the first node;

If the first node uses at least one self-occupied time slot, then arbitrarily selects one of the self-occupied time slots, copies the time slot status vector corresponding to the selected self-occupied time slot, and generates the corresponding application time slot. the initial time slot state vector; modify the time slot state information corresponding to the selected self-occupied time slot in the initial state vector corresponding to the application time slot to idle, and establish the time slot state vector corresponding to the application time slot .

3. The method of claim 2, further comprising:

When the first node determines that the time slot status of the application time slot of the first node is a collision based on the FI sent by other nodes, delete the time slot status vector corresponding to the application time slot.

4. The method of claim 2, further comprising:

When the first node determines that the time slot status of the self-occupied time slot of the first node is a collision based on the FI sent by other nodes and the time slot status vector corresponding to the time slot used by the first node itself, delete the self-occupied time slot correspondence time slot status vector.

5. The method of claim 1, further comprising:

Based on the time slot status information in the time slot status vector corresponding to all time slots used by the first node itself, a time slot status record corresponding to the first node is established.

6. The method according to any one of claims 1 to 5, characterized in that the first node sends FI to other nodes in its own time slot, including:

The first FI is obtained by mapping according to the time slot status vector corresponding to the current self-occupied time slot of the first node;

When it is determined that the first node has other self-occupied time slots based on the time slot status record corresponding to the first node, modify the time slot status information of the other self-occupied time slots in the first FI to self-occupied, Get the second FI;

sending said second FI to other nodes;

Wherein, the current self-occupied time slot is a time slot converted from an applied for time slot.

7. The method of claim 6, further comprising:

When it is determined according to the time slot status record corresponding to the first node that the first node has other time slots used by itself in addition to the current self-occupied time slot, the second FI is used as the time slot used by other self-occupied times of the first node. gap input information; According to the second FI, the time slot status vector corresponding to each other time slot maintained by the first node and corresponding to the time slot used by itself is independently updated.

8. A time slot status maintenance device that supports multiple time slots, which is characterized by including:

A maintenance unit, configured for the first node to respectively maintain corresponding time slot status vectors for each time slot used by the first node, where the time slots used by the first node include self-occupied time slots or/and application time slots;

The update unit is used for the first node to send frame information FI to other nodes on self-occupied time slots in each frame period, and to receive FI sent by other nodes on non-self-occupied time slots in each frame period, and The time slot status vector corresponding to each time slot maintained locally is updated separately according to the received FI.

9. The device according to claim 8, wherein when the first node establishes a time slot status vector corresponding to an application time slot, the maintenance unit is specifically used to:

10. The device according to claim 9, wherein the update unit is further configured to: determine, based on the FI sent by other nodes, that the time slot status of the first node's application time slot is a collision. When , delete the time slot status vector corresponding to the applied time slot.

11. The device according to claim 9, wherein the update unit is further configured to: the first node determines based on the FI sent by other nodes and the time slot status vector corresponding to the time slot used by the first node itself. When the time slot status of the self-occupied time slot of the first node is collision, the time slot status vector corresponding to the self-occupied time slot is deleted.

12. The device according to claim 8, wherein the maintenance unit is further configured to: establish the first node according to the time slot status information in the time slot status vector corresponding to all time slots used by the first node itself. The time slot status record corresponding to the node.

13. The device according to any one of claims 8 to 12, characterized in that when the first node sends FI to other nodes in its own time slot, the update unit is specifically used to:

sending said second FI to other nodes;

14. The device according to claim 13, wherein the update unit is further configured to: determine according to the time slot status record corresponding to the first node that the first node has other self-occupied time slots besides the current self-occupied time slot. When the time slots used by itself are used, the second FI is used as the input information of the time slots used by other itself of the first node; According to the second FI, the time slots used by each other self maintained by the first node are The slot status vectors corresponding to the slots are updated independently.