CN112564975A - Time slot allocation method and system for ring network node - Google Patents

Time slot allocation method and system for ring network node Download PDF

Info

Publication number
CN112564975A
CN112564975A CN202011441721.8A CN202011441721A CN112564975A CN 112564975 A CN112564975 A CN 112564975A CN 202011441721 A CN202011441721 A CN 202011441721A CN 112564975 A CN112564975 A CN 112564975A
Authority
CN
China
Prior art keywords
time slot
node
application
timer
release
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202011441721.8A
Other languages
Chinese (zh)
Other versions
CN112564975B (en
Inventor
钟志声
胡敬东
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
GHT CO Ltd
Original Assignee
GHT CO Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by GHT CO Ltd filed Critical GHT CO Ltd
Priority to CN202011441721.8A priority Critical patent/CN112564975B/en
Publication of CN112564975A publication Critical patent/CN112564975A/en
Application granted granted Critical
Publication of CN112564975B publication Critical patent/CN112564975B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08Configuration management of networks or network elements
    • H04L41/0876Aspects of the degree of configuration automation
    • H04L41/0886Fully automatic configuration
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/42Loop networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/82Miscellaneous aspects
    • H04L47/826Involving periods of time

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Automation & Control Theory (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Small-Scale Networks (AREA)

Abstract

The invention discloses a time slot allocation method of a ring network node, which comprises the following steps: acquiring address codes of all nodes in the ring network, and selecting the node with the smallest address code as an arbitration node; after receiving the time slot application request packet, the arbitration node broadcasts a time slot application request to other nodes; identifying destination address information carried by a time slot application request, stopping a first time slot application timer, calculating the time slot occupation condition of the current node, and starting the first time slot application timer after the calculation is finished; when the time slot occupation condition of the current node is not occupied, marking the time slot as an occupation state and broadcasting an available idle time slot signal; after receiving the available idle time slot signal, the application node marks the time slot as an occupied state and sends a response broadcast packet for successful occupation of the time slot of the application node to other nodes. The invention can improve the flexibility of time slot allocation in the ring network system and realize the maximization of resource utilization of each node. The embodiment of the invention also discloses a time slot distribution system of the ring network node.

Description

Time slot allocation method and system for ring network node
Technical Field
The present invention relates to the field of network communication technologies, and in particular, to a method and a system for allocating time slots of a ring network node.
Background
The E1 ring network in the railway ring network system is a ring-shaped voice switching network connected by a plurality of ring network bridge (RB) devices, a plurality of communication nodes exist, but the voice time slot resources on the railway E1 ring network are very limited.
The existing method for allocating time slots to each node generally adopts a method for fixedly allocating time slots according to the traffic of each node, namely more fixed time slots are allocated to nodes with larger traffic and less fixed time slots are allocated to nodes with less traffic.
The inventor finds that the prior art has the following problems in the process of implementing the invention:
under the existing time slot allocation method, the call which can be generated by each node in the ring network system at the same time depends on the number of manually allocated time slots, and the whole time slot allocation process needs manual configuration and adjustment and lacks flexibility; and the maximization of the time slot resources of the nodes cannot be realized, and the concurrent call volume of each node is severely restricted.
Disclosure of Invention
The embodiment of the invention provides a time slot allocation method of a ring network node, which can improve the flexibility of time slot allocation in a ring network system and realize the maximization of resource utilization of each node.
The embodiment of the invention provides a time slot allocation method of a ring network node, which comprises the following steps:
acquiring address codes of all nodes in a ring network, and selecting the node with the minimum address code as an arbitration node;
when an application node sends a time slot application request packet to the arbitration node, starting a first time slot application timer;
after receiving the time slot application request packet, the arbitration node broadcasts a time slot application request to other nodes;
after a node receives the time slot application request, identifying destination address information carried by the time slot application request, stopping the first time slot application timer when the destination address information is the same as an address code of the application node, calculating the time slot occupation condition of the current node, and starting the first time slot application timer after the calculation is finished;
when the time slot occupation condition of the current node is not occupied, marking the time slot as an occupation state and broadcasting an available idle time slot signal;
and after receiving the available idle time slot signal, the application node stops the first time slot application timer, marks the time slot as an occupied state and sends a response broadcast packet for successfully occupying the time slot of the application node to other nodes.
As an improvement of the above solution, the starting of the first slot application timer when the application node sends the slot request packet to the arbitration node includes:
judging whether the looped network is complete;
when the ring network is complete, starting the first time slot application timer;
when the time slot application timer is started to time out, restarting the first time slot application timer;
and when the times of restarting the first time slot application timer exceed a preset time threshold, determining that the time slot application fails.
As an improvement of the above scheme, the method further comprises the following steps: after the arbitration node receives the time slot request packet, calculating idle time slot conditions of other nodes;
and after the time slot of the application node is successfully occupied, starting a time slot resource protection timer.
As an improvement of the above scheme, the method further comprises the following steps: broadcasting an unavailable idle time slot signal when the time slot occupation condition of the current node is occupied;
and when the application node receives the signal of no available idle time slot, stopping the first time slot application timer and judging that the time slot application fails.
As an improvement of the above scheme, the sending of the response broadcast packet for successful occupation of the application node time slot to the other nodes specifically includes:
and sending a response broadcast packet for successful occupation of the application node time slot to other nodes, so that the other nodes mark the time slot as an occupied state after receiving the response broadcast packet for successful occupation of the application node time slot.
As an improvement of the above scheme, the method further comprises the following steps:
starting a first time slot release timer when a release node sends a release time slot request packet to the arbitration node;
after the arbitration node receives the time slot release request packet, broadcasting time slot release success information;
when the release node receives the time slot release success information, the first time slot release timer is stopped, and the time slot is marked to be in an unoccupied state;
and when other nodes receive the successful time slot release information, identifying the destination address information carried by the successful time slot release information, and stopping a second time slot release timer when the destination address information is the same as the address code of the release node, and marking the time slot as an unoccupied state.
As an improvement of the above solution, the starting of the first slot release timer when the release node sends a release slot request packet to the arbitration node includes:
judging whether the looped network is complete;
when the ring network is complete, starting the first time slot release timer;
restarting the first time slot release timer when the time slot release timer is started to time out;
and when the number of times of restarting the first time slot release timer exceeds a preset number threshold, determining that the time slot release fails.
The embodiment of the invention correspondingly provides a time slot allocation system of a ring network node, which comprises the following steps:
the node selection module is used for acquiring the address codes of all nodes in the ring network and selecting the node with the minimum address code as an arbitration node;
the timer starting module is used for starting a first time slot application timer when the application node sends a time slot application request packet to the arbitration node;
a request broadcasting module, configured to broadcast a time slot application request to other nodes after the arbitration node receives the time slot application request packet;
a time slot calculating module, configured to identify destination address information carried in the time slot application request after a node receives the time slot application request, stop a first time slot application timer when the destination address information is the same as an address code of the application node, calculate a time slot occupation condition of a current node, and start the first time slot application timer after the calculation is completed;
a time slot broadcasting module, configured to mark the time slot as an occupied state when the time slot occupation condition of the current node is not occupied, and broadcast an available idle time slot signal;
and the time slot occupation module is used for stopping the first time slot application timer after the application node receives the available idle time slot signal, marking the time slot as an occupied state and sending a response broadcast packet for successfully occupying the time slot of the application node to other nodes.
Compared with the prior art, the time slot allocation method and the time slot allocation system for the ring network node provided by the embodiment of the invention have the following beneficial effects:
the time slot resources in the ring network can be utilized more coordinately by selecting the arbitration node according to the preset conditions; resource allocation is uniformly carried out on one node, so that the maximization of resources is realized, and each node has the equal right of applying for time slot resources, so that the method is more suitable for a railway networking scheme; especially, under the scene that each node has a time period and needs a large amount of concurrent services, the flexibility and the superiority of the scheme of the application can be better embodied, and the problem that the concurrency of the call is greatly restricted by a fixed time slot allocation strategy is avoided;
the sending of the time slot request packet and the time slot release request packet is controlled by the timer, so that the broadcast resource waste when the timer does not respond is avoided; the time slot resources are integrated on one node device, so that the unified allocation of the time slots of the ring network is realized, the concurrency of each node can reach the maximum available time slot number of the whole ring, the ring network resources are greatly saved, the automatic allocation can be realized while the concurrency is increased, the time slot allocation is not required to be manually participated, and the allocation efficiency is greatly improved.
Drawings
Fig. 1 is a flowchart illustrating a time slot allocation method of a ring network node according to an embodiment of the present invention.
Fig. 2 is a schematic diagram of a simple ring network structure according to an embodiment of the present invention.
Fig. 3 is a schematic structural diagram of a timeslot allocation system of a ring network node according to a second embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1, a schematic flowchart of a timeslot allocation method for a ring network node according to an embodiment of the present invention is shown, where the method includes:
s101, acquiring address codes of all nodes in a ring network, and selecting the node with the smallest address code as an arbitration node;
specifically, referring to fig. 2, which is a schematic diagram of a simple ring network structure provided in an embodiment of the present invention, stations are connected in a ring shape through 2M trunk lines, and an RB device is connected to a network switch through a network line; the station is a geographical position corresponding to each ring network device when networking is performed; the address code is the only identification code of the ring network equipment in the ring network, and the address code of each node in the ring network can be acquired through the RB equipment which is positioned in the ring network and completes network transmission conversion.
S102, when an application node sends a time slot application request packet to an arbitration node, starting a first time slot application timer;
in a specific embodiment, when a certain node needs to initiate a voice call, the node is an application node, the application node sends a time slot request packet to an arbitration node when initiating the voice call, and sends a time slot release request packet to the arbitration node when ending the call.
Further, when the application node sends a time slot request packet to the arbitration node, starting a first time slot application timer, comprising:
judging whether the looped network is complete;
when the looped network is complete, starting a first time slot application timer;
when the time slot application timer is started to time out, restarting the first time slot application timer;
and when the times of restarting the first time slot application timer exceed a preset time threshold, determining that the time slot application fails.
Preferably, the preset number threshold is 3. Namely, if the first time slot application timer is not started successfully after being restarted for 3 times, the time slot application is judged to fail.
S103, after receiving the time slot application request packet, the arbitration node broadcasts a time slot application request to other nodes;
further, still include: after the arbitration node receives the time slot request packet, calculating the idle time slot conditions of other nodes;
and after the time slot of the application node is successfully occupied, starting a time slot resource protection timer.
In a specific implementation mode, if the node receiving the time slot request packet is not the arbitration node, the time slot request packet is automatically discarded, so that request collision is avoided, and the time slot allocation efficiency is improved.
S104, when a node receives a time slot application request, identifying destination address information carried by the time slot application request, stopping a first time slot application timer when the destination address information is the same as an address code of an application node, calculating the time slot occupation condition of the current node, and starting the first time slot application timer after the calculation is finished;
specifically, the destination address is the address code information of the application node or the release node carried in the response packet.
In a specific implementation mode, after a node receives a time slot application request, destination address information carried by the time slot application request is identified, and if the destination address information is different from an address code of the application node, a first time slot application timer is not stopped, and the time slot occupation condition of the current node is directly calculated.
S105, when the time slot occupation condition of the current node is not occupied, marking the time slot as an occupation state, and broadcasting an available idle time slot signal;
further, still include: broadcasting an unavailable idle time slot signal when the time slot occupation condition of the current node is occupied;
and when the application node receives the signal of no available idle time slot, stopping the first time slot application timer and judging that the time slot application fails.
S106, after receiving the available idle time slot signal, the application node stops the first time slot application timer, marks the time slot as an occupied state, and sends a response broadcast packet for successful occupation of the time slot of the application node to other nodes.
In a specific embodiment, the application node starts an application timer when sending out a time slot application request packet. When the application node applies for the time slot, the application timer needs to be stopped to avoid overtime, if the time is overtime for multiple times, the arbiter is not responded, the time slot cannot be applied, and the application of the time slot fails when the application node applies for the time slot. Thereby avoiding the continuous occupation of resources.
Further, sending a response broadcast packet for applying for successful occupation of the node time slot to the other nodes specifically includes:
and sending a response broadcast packet for successful occupation of the application node time slot to other nodes, so that the other nodes mark the time slot as an occupied state after receiving the response broadcast packet for successful occupation of the application node time slot.
Further, when the application node needs to end the call, the method sends a time slot release request packet to the arbitration node, including:
when a release node sends a release time slot request packet to an arbitration node, starting a first time slot release timer;
after receiving the time slot release request packet, the arbitration node broadcasts time slot release success information;
when the release node receives the time slot release success information, the first time slot release timer is stopped, and the time slot is marked to be in an unoccupied state;
and when other nodes receive the successful time slot release information, identifying the destination address information carried by the successful time slot release information, and stopping the second time slot release timer when the destination address information is the same as the address code of the release node, and marking the time slot as an unoccupied state.
Further, when the release node sends a release slot request packet to the arbitration node, starting a first slot release timer, comprising:
judging whether the looped network is complete;
when the looped network is complete, starting a first time slot release timer;
when the time slot release timer is started to time out, restarting the first time slot release timer;
and when the number of times of restarting the first time slot release timer exceeds a preset number threshold, determining that the time slot release fails.
In a specific implementation mode, after a node receives a time slot release request, destination address information carried by the time slot release request is identified, and if the destination address information is different from an address code of a release node, a second time slot release timer is not stopped, and the time slot is directly marked to be in an unoccupied state.
Referring to fig. 3, an embodiment of the present invention correspondingly provides a timeslot allocation system for a ring network node, including:
a node selection module 201, configured to obtain address codes of each node in the ring network, and select a node with the smallest address code as an arbitration node;
a timer starting module 202, configured to start a first time slot application timer when the application node sends a time slot application request packet to the arbitration node;
the request broadcasting module 203 is used for broadcasting the time slot application request to other nodes after the arbitration node receives the time slot application request packet;
the time slot calculation module 204 is configured to, after a node receives a time slot application request, identify destination address information carried in the time slot application request, stop the first time slot application timer when the destination address information is the same as an address code of an application node, calculate a time slot occupation condition of a current node, and start the first time slot application timer after the calculation is completed;
a time slot broadcasting module 205, configured to mark a time slot as an occupied state when the time slot occupation condition of the current node is not occupied, and broadcast an available idle time slot signal;
and the time slot occupation module 206 is configured to stop the first time slot application timer after the application node receives the available idle time slot signal, mark the time slot as an occupied state, and send a response broadcast packet indicating that the time slot occupation of the application node is successful to the other nodes.
Compared with the prior art, the time slot allocation method and the time slot allocation system for the ring network node provided by the embodiment of the invention have the following beneficial effects:
the time slot resources in the ring network can be utilized more coordinately by selecting the arbitration node according to the preset conditions; resource allocation is uniformly carried out on one node, so that the maximization of resources is realized, and each node has the equal right of applying for time slot resources, so that the method is more suitable for a railway networking scheme; especially, under the scene that each node has a time period and needs a large amount of concurrent services, the flexibility and the superiority of the scheme of the application can be better embodied, and the problem that the concurrency of the call is greatly restricted by a fixed time slot allocation strategy is avoided;
the sending of the time slot request packet and the time slot release request packet is controlled by the timer, so that the broadcast resource waste when the timer does not respond is avoided; the time slot resources are integrated on one node device, so that the unified allocation of the time slots of the ring network is realized, the concurrency of each node can reach the maximum available time slot number of the whole ring, the ring network resources are greatly saved, the automatic allocation can be realized while the concurrency is increased, the time slot allocation is not required to be manually participated, and the allocation efficiency is greatly improved.
If the module/unit integrated by the time slot allocation method of the ring network node is realized in the form of a software functional unit and sold or used as an independent product, the module/unit can be stored in a computer readable storage medium. Based on such understanding, all or part of the flow of the method according to the embodiments of the present invention may also be implemented by a computer program, which may be stored in a computer-readable storage medium, and when the computer program is executed by a processor, the steps of the method embodiments may be implemented. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-Only Memory (ROM), Random Access Memory (RAM), electrical carrier wave signals, telecommunications signals, software distribution medium, and the like.
It should be noted that the above-described device embodiments are merely illustrative, where the units described as separate parts may or may not be physically separate, and the parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. In addition, in the drawings of the embodiment of the apparatus provided by the present invention, the connection relationship between the modules indicates that there is a communication connection between them, and may be specifically implemented as one or more communication buses or signal lines. One of ordinary skill in the art can understand and implement it without inventive effort.
While the foregoing is directed to the preferred embodiment of the present invention, it will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention.

Claims (8)

1. A time slot allocation method of a ring network node is characterized by comprising the following steps:
acquiring address codes of all nodes in a ring network, and selecting the node with the minimum address code as an arbitration node;
when an application node sends a time slot application request packet to the arbitration node, starting a first time slot application timer;
after receiving the time slot application request packet, the arbitration node broadcasts a time slot application request to other nodes;
after a node receives the time slot application request, identifying destination address information carried by the time slot application request, stopping the first time slot application timer when the destination address information is the same as an address code of the application node, calculating the time slot occupation condition of the current node, and starting the first time slot application timer after the calculation is finished;
when the time slot occupation condition of the current node is not occupied, marking the time slot as an occupation state and broadcasting an available idle time slot signal;
and after receiving the available idle time slot signal, the application node stops the first time slot application timer, marks the time slot as an occupied state and sends a response broadcast packet for successfully occupying the time slot of the application node to other nodes.
2. The method as claimed in claim 1, wherein the starting the first time slot application timer when the application node sends the time slot request packet to the arbitration node includes:
judging whether the looped network is complete;
when the ring network is complete, starting the first time slot application timer;
when the time slot application timer is started to time out, restarting the first time slot application timer;
and when the times of restarting the first time slot application timer exceed a preset time threshold, determining that the time slot application fails.
3. The method for allocating timeslots of a ring network node of claim 1 further comprising: after the arbitration node receives the time slot request packet, calculating idle time slot conditions of other nodes;
and after the time slot of the application node is successfully occupied, starting a time slot resource protection timer.
4. The method for allocating timeslots of a ring network node of claim 1 further comprising: broadcasting an unavailable idle time slot signal when the time slot occupation condition of the current node is occupied;
and when the application node receives the signal of no available idle time slot, stopping the first time slot application timer and judging that the time slot application fails.
5. The method for allocating timeslot of a ring network node according to claim 1, wherein the sending of the response broadcast packet for successful timeslot occupation of the application node to the other nodes specifically includes:
and sending a response broadcast packet for successful occupation of the application node time slot to other nodes, so that the other nodes mark the time slot as an occupied state after receiving the response broadcast packet for successful occupation of the application node time slot.
6. The method for allocating timeslots of a ring network node of claim 1 further comprising:
starting a first time slot release timer when a release node sends a release time slot request packet to the arbitration node;
after the arbitration node receives the time slot release request packet, broadcasting time slot release success information;
when the release node receives the time slot release success information, the first time slot release timer is stopped, and the time slot is marked to be in an unoccupied state;
and when other nodes receive the successful time slot release information, identifying the destination address information carried by the successful time slot release information, and stopping a second time slot release timer when the destination address information is the same as the address code of the release node, and marking the time slot as an unoccupied state.
7. The method as claimed in claim 6, wherein the starting the first timeslot release timer when the release node sends a release timeslot request packet to the arbitration node includes:
judging whether the looped network is complete;
when the ring network is complete, starting the first time slot release timer;
restarting the first time slot release timer when the time slot release timer is started to time out;
and when the number of times of restarting the first time slot release timer exceeds a preset number threshold, determining that the time slot release fails.
8. A system for allocating timeslots of a ring network node, comprising:
the node selection module is used for acquiring the address codes of all nodes in the ring network and selecting the node with the minimum address code as an arbitration node;
the timer starting module is used for starting a first time slot application timer when the application node sends a time slot application request packet to the arbitration node;
a request broadcasting module, configured to broadcast a time slot application request to other nodes after the arbitration node receives the time slot application request packet;
a time slot calculating module, configured to identify destination address information carried in the time slot application request after a node receives the time slot application request, stop the first time slot application timer when the destination address information is the same as an address code of the application node, calculate a time slot occupation condition of a current node, and start the first time slot application timer after the calculation is completed;
a time slot broadcasting module, configured to mark the time slot as an occupied state when the time slot occupation condition of the current node is not occupied, and broadcast an available idle time slot signal;
and the time slot occupation module is used for stopping the first time slot application timer after the application node receives the available idle time slot signal, marking the time slot as an occupied state and sending a response broadcast packet for successfully occupying the time slot of the application node to other nodes.
CN202011441721.8A 2020-12-11 2020-12-11 Time slot allocation method and system for ring network node Active CN112564975B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011441721.8A CN112564975B (en) 2020-12-11 2020-12-11 Time slot allocation method and system for ring network node

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011441721.8A CN112564975B (en) 2020-12-11 2020-12-11 Time slot allocation method and system for ring network node

Publications (2)

Publication Number Publication Date
CN112564975A true CN112564975A (en) 2021-03-26
CN112564975B CN112564975B (en) 2022-09-27

Family

ID=75062178

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011441721.8A Active CN112564975B (en) 2020-12-11 2020-12-11 Time slot allocation method and system for ring network node

Country Status (1)

Country Link
CN (1) CN112564975B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113761959A (en) * 2021-09-10 2021-12-07 众力智联(湖州)智能科技有限公司 Wireless interconnection-oriented multi-RFID read-write node dynamic time slot allocation method
CN114375057A (en) * 2022-03-22 2022-04-19 杭州格物智安科技有限公司 Wireless network system node time slot allocation method

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101197855A (en) * 2007-12-25 2008-06-11 三一重工股份有限公司 Equipment node address code distribution method and distributing system, and address configuration node
CN102612152A (en) * 2012-02-27 2012-07-25 西北工业大学 Ad Hoc network MAC (Media Access Control) protocol realizing method based on STDMA (Self Organizing Time Division Multiple Access)
CN103686862A (en) * 2012-09-07 2014-03-26 电信科学技术研究院 Method and device for applying for time slot resources
US20160080282A1 (en) * 2014-09-17 2016-03-17 Theplatform, Llc Methods And Systems For Resource Allocation
WO2016173346A1 (en) * 2015-04-30 2016-11-03 中兴通讯股份有限公司 Dynamic bandwidth allocation method and device for optical burst ring network
CN108024367A (en) * 2017-12-01 2018-05-11 上海金卓网络科技有限公司 A kind of method, apparatus, equipment and the storage medium of dynamically distributes time slot
CN111654557A (en) * 2020-05-29 2020-09-11 宋斌 Automatic distribution method of RS485 address codes, upper computer and lower computer

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101197855A (en) * 2007-12-25 2008-06-11 三一重工股份有限公司 Equipment node address code distribution method and distributing system, and address configuration node
CN102612152A (en) * 2012-02-27 2012-07-25 西北工业大学 Ad Hoc network MAC (Media Access Control) protocol realizing method based on STDMA (Self Organizing Time Division Multiple Access)
CN103686862A (en) * 2012-09-07 2014-03-26 电信科学技术研究院 Method and device for applying for time slot resources
US20160080282A1 (en) * 2014-09-17 2016-03-17 Theplatform, Llc Methods And Systems For Resource Allocation
WO2016173346A1 (en) * 2015-04-30 2016-11-03 中兴通讯股份有限公司 Dynamic bandwidth allocation method and device for optical burst ring network
CN108024367A (en) * 2017-12-01 2018-05-11 上海金卓网络科技有限公司 A kind of method, apparatus, equipment and the storage medium of dynamically distributes time slot
CN111654557A (en) * 2020-05-29 2020-09-11 宋斌 Automatic distribution method of RS485 address codes, upper computer and lower computer

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
隋静雯等: "基于多天线扇区切换的动态时隙分配算法", 《信息通信》 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113761959A (en) * 2021-09-10 2021-12-07 众力智联(湖州)智能科技有限公司 Wireless interconnection-oriented multi-RFID read-write node dynamic time slot allocation method
CN114375057A (en) * 2022-03-22 2022-04-19 杭州格物智安科技有限公司 Wireless network system node time slot allocation method
CN114375057B (en) * 2022-03-22 2022-07-22 杭州格物智安科技有限公司 Wireless network system node time slot allocation method

Also Published As

Publication number Publication date
CN112564975B (en) 2022-09-27

Similar Documents

Publication Publication Date Title
JP6636045B2 (en) V2V based resource allocation method and apparatus
CN112564975B (en) Time slot allocation method and system for ring network node
CN104254136B (en) Method, Service Access Point, website and the system of medium access
CN110087328B (en) Resource multiplexing method and device
WO2017101209A1 (en) Service transmission method and apparatus
CN109121098B (en) Method and system for allocating channel
CN101262696A (en) A method for realizing inter-system communication and system and terminal
EP4340509A1 (en) Transmission resource selection method and apparatus, device, and storage medium
CN113472694B (en) CSMA (Carrier sense multiple Access) time slot channel binding access method and power carrier communication method
CN105794292A (en) Data transmission method, resource measurement method, device and apparatus
CN109644502B (en) Point-to-multipoint channel allocation method, device and system
US7924864B2 (en) Terminal-based contention free low overhead access
CN106559888A (en) A kind of method and apparatus of cooperation resource allocation
CN114501396B (en) Data transmission method, device and equipment
CN108377553B (en) Resource maintenance method and device
CN114900900A (en) Resource allocation and scheduling method, device and base station
CN113133051B (en) Access resource allocation method, device, base station and medium
CA2576532C (en) Method for indicating a channel for sending uplink access request and trunking system
CN105850220B (en) Data transmission method and equipment
CN101453789B (en) Method and system for called continuous time for cluster group call
CN102223714A (en) Method for accessing terminal to group service, terminal and base station
WO2022047750A1 (en) Lbt parameter determining method and apparatus, device and medium
JP2794980B2 (en) Channel allocation method for mobile communication system
CN111465100A (en) Relay uplink access channel configuration method, configuration signaling and equipment
WO2024017245A1 (en) Resource allocation method and apparatus, terminal, and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant