CN111246580B - Time slot distribution method for supporting multi-hop streaming service in self-organizing network - Google Patents

Time slot distribution method for supporting multi-hop streaming service in self-organizing network Download PDF

Info

Publication number
CN111246580B
CN111246580B CN202010029703.2A CN202010029703A CN111246580B CN 111246580 B CN111246580 B CN 111246580B CN 202010029703 A CN202010029703 A CN 202010029703A CN 111246580 B CN111246580 B CN 111246580B
Authority
CN
China
Prior art keywords
node
time slot
current
nodes
hop
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202010029703.2A
Other languages
Chinese (zh)
Other versions
CN111246580A (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.)
Xidian University
Original Assignee
Xidian University
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 Xidian University filed Critical Xidian University
Priority to CN202010029703.2A priority Critical patent/CN111246580B/en
Publication of CN111246580A publication Critical patent/CN111246580A/en
Application granted granted Critical
Publication of CN111246580B publication Critical patent/CN111246580B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446—Resources in time domain, e.g. slots or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/543—Allocation or scheduling criteria for wireless resources based on quality criteria based on requested quality, e.g. QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a time slot allocation method for supporting multi-hop streaming service in a self-organizing network, which comprises the following steps: (1) a source node triggers time slot reservation; (2) the intermediate node forwards the SREQ frame; (3) the destination node performs end-to-end time slot allocation; (4) and planning a time slot distribution result. The target node of the invention carries out uniform end-to-end time slot allocation through the collected available time slot set information of all nodes on the multi-hop service flow path, thereby overcoming the problems of high requirement on the computing power of centralized time slot allocation and high complexity and low end-to-end throughput of distributed time slot allocation multi-hop service flow in the prior art. The method has the advantages of simple and easy realization, and can improve the end-to-end throughput of the multi-hop service flow, and can be used for time slot allocation of the time division multiple access protocol in the wireless self-organizing network.

Description

Time slot distribution method for supporting multi-hop streaming service in self-organizing network
Technical Field
The invention relates to the technical field of communication, in particular to a time slot allocation method for supporting multi-hop streaming service in a self-organizing network in the technical field of wireless communication. On the basis of time slot allocation of a traditional Time Division Multiple Access (TDMA) technology in a self-organizing network, the invention searches a multi-hop service flow for end-to-end unified time slot allocation according to the destination node and bandwidth requirement information of the service flow, thereby achieving the purpose of improving end-to-end high throughput.
Background
The time slot allocation method is a key technology of a TDMA multiple access protocol, for a wireless self-organizing network, certain problems exist in a traditional hop-by-hop allocation algorithm and a centralized allocation algorithm, the hop-by-hop allocation algorithm can cause bottleneck nodes on a path to limit the whole bandwidth on the path, and the centralized allocation algorithm needs to gather all information, thereby causing network resource waste and limited computing node computing capability. Because the wireless channel is shared by each node, and the time slot resources between the nodes have a mutual interweaving relationship, the bandwidth quantization and the realization of the end-to-end bandwidth maximization allocation of the multi-hop service path become the realization difficulty, and the method has important significance for improving the performance of the ad hoc network.
The patent document applied by the Hunan Zhi-leading communication technology Co Ltd is 'a dynamic allocation method for time slot resources of a broadband ad hoc network based on a multistage frame structure for calculating and allocating bandwidth in the wireless ad hoc network' (patent application No. 201711248355.2, publication No. CN107949062A) and provides a method for allocating time slots of the wireless ad hoc network. In the method, a main node sends broadcast information to a sub-node, after the sub-node receives the broadcast information, the sub-node enters a silent receiving state until the sub-node has a service waiting to send, the sub-node sends a time slot request frame to the main node, the main node receives the time slot request frame sent by the sub-node, a time slot is allocated for a new request of the sub-node by utilizing an online time slot allocation mechanism, and the main node broadcasts a time slot allocation scheme in the next superframe. The method has the disadvantages that a fixed main node is responsible for time slot allocation of the nodes in the whole network in time slot allocation work, the requirement on the calculation capacity of the main node is high, and the performance of the whole network is influenced.
Patent document "a time slot allocation method meeting real-time bandwidth requirement" (patent application number: 201611085682.6, publication number: CN106792972A) of the university of river and south proposes a three-link time slot allocation algorithm, in which time slots are allocated in units of three-hop links in the route establishment process, interference degree statistics is performed on the time slots of an available time slot set of each hop link within a three-hop link range, the number of times each time slot appears within the three-hop link range is counted, and when the time slots are allocated within the three-hop link range, a link with the least available time slot set elements is selected, and the time slot with the least interference degree is allocated on the link. The method still has the defects that wireless channels are shared among the nodes, time slot distribution of adjacent nodes in a two-hop range is mutually influenced, and the problem of low end-to-end throughput of multi-hop service flow is caused only by considering three-hop link range for time slot distribution.
Disclosure of Invention
The present invention aims to provide a time slot allocation method for supporting a multi-hop streaming service in an ad hoc network, so as to solve the problem of low end-to-end throughput for the multi-hop streaming service in the ad hoc network.
The idea for realizing the purpose of the invention is as follows: the destination node divides nodes on a path into node sets according to available time slot information of all nodes in the multi-hop service flow, takes the node sets as a unit, sorts the node sets by using quantized bandwidth of the node sets, allocates time slots for all nodes in each node set according to the idea of preferentially allocating time slots for the node sets with small quantized bandwidth, and finally plans a time slot allocation result to all nodes on a plurality of service flows.
In order to achieve the purpose, the method comprises the following specific steps:
step 1, a source node triggers time slot reservation:
a multi-access control layer MAC of a source node in a self-organizing network constructs a time slot reservation request SREQ frame by utilizing a sensed multi-hop service flow and broadcasts and sends the SREQ frame out to trigger time slot reservation;
step 2, the intermediate node forwards the SREQ frame:
the intermediate node receives the SREQ frame, adds the node number of the intermediate node into the path node information in the SREQ frame, adds the available time slot set of the intermediate node into the available time slot set information of the path node in the SREQ frame, obtains a new SREQ frame and broadcasts the new SREQ frame to be sent out;
step 3, the destination node performs end-to-end time slot allocation:
step 1, a destination node in a self-organizing network extracts path node information, available time slot set information of all path nodes and bandwidth required by service flow from a received SREQ frame;
step 2, dividing all nodes in the path node information into a node set every three nodes according to the sequence from the source node to the destination node, and dividing the last less than three nodes into a node set;
step 3, setting an empty time slot set for storing the allocated time slots for each node in the path node information;
step 4, ordering the node sets from small to large according to the quantization bandwidth of each node set;
step 5, one node set is sequentially selected as a current node set;
step 6, judging whether the available time slot set in the current node set is an empty set, if so, executing step 9, otherwise, executing step 7 after allocating a time slot for each node in the current node set;
step 7, judging whether all the node sets are selected, if so, executing step 8, otherwise, executing step 5;
step 8, judging whether the time slot distributed by each node in the path node information is equal to the bandwidth required by the service flow, if so, executing step 9, otherwise, executing step 4;
step 9, completing the end-to-end time slot allocation of the destination node;
step 4, planning a time slot distribution result:
and the destination node of the multi-hop service flow in the self-organized network encapsulates the time slot sets of all nodes on the path information and the path node information into an SREP frame, and the SREP frame is transmitted to all nodes on the path information in a hop-by-hop unicast manner from the destination node to the source node.
Compared with the prior art, the invention has the following advantages:
first, when the invention performs end-to-end time slot allocation at the destination node, each destination node is only responsible for time slot allocation of all nodes on one multi-hop path at a time in the time slot allocation of the nodes in the whole network, thereby overcoming the problems of high computing power requirement and high complexity caused by the master node responsible for time slot allocation of the nodes in the whole network in the centralized time slot allocation in the prior art, dispersing the time slot allocation task of the whole network to different destination nodes, and improving the efficiency of completing time slot allocation.
Secondly, when the destination node performs end-to-end time slot allocation, the destination node divides a small node set according to the time slot resource information of all nodes on the path, and performs end-to-end unified planning of the time slot resources by taking the node set as a unit, so that the problem of low end-to-end throughput of the multi-hop service flow caused by time slot allocation only according to the information of a local three-hop range in the prior art is solved, the complexity of realizing the maximized time slot allocation of the path bandwidth is reduced, and the end-to-end throughput of the multi-hop service flow is improved.
Drawings
FIG. 1 is a flow chart of the present invention;
FIG. 2 is a flow chart of destination node end-to-end time slot allocation of the present invention;
FIG. 3 is a schematic diagram of a set of partitioners of the present invention.
Detailed Description
The invention is further described below with reference to the accompanying drawings.
The specific steps of the implementation of the present invention are further described with reference to fig. 1.
Step 1, a source node triggers time slot reservation.
And constructing a time slot reservation request (SREQ) frame by using the perceived multi-hop service flow and broadcasting the SREQ frame to trigger time slot reservation by using a multi-access control layer (MAC) of a source node in the self-organizing network.
The multi-hop service flow comprises a source address, a destination address, a service flow type, a source port number, a destination port number and a service flow required bandwidth.
The constructing of the time slot reservation request SREQ frame means that a source address, a destination address, a service flow required bandwidth, path node information, and available time slot set information of a path node are encapsulated into one data frame.
And 2, the intermediate node forwards the SREQ frame.
The intermediate node receives the SREQ frame, adds the node number of the intermediate node into the path node information in the SREQ frame, and adds the available time slot set of the intermediate node into the available time slot set information of the path node in the SREQ frame to obtain a new SREQ frame and broadcast and send the new SREQ frame.
The specific steps of the invention for step 3, the destination node performing end-to-end time slot allocation, are further described with reference to fig. 2.
And 3, the destination node performs end-to-end time slot allocation.
Step 1, a destination node in the self-organizing network extracts path node information, available time slot set information of all path nodes and bandwidth needed by service flow from a received SREQ frame.
And 2, dividing all nodes in the path node information into a node set every three nodes according to the sequence from the source node to the destination node, and dividing the last less than three nodes into a node set.
The partitioning of the node set is further described with reference to fig. 3.
Each small circle in fig. 3 represents a node, the numbers in the circles represent the node numbers of the nodes, each dotted ellipse represents a node set, the node 1, the node 2, and the node 3 constitute the node set 1, the node 4, the node 5, and the node 6 constitute the node set 2, and finally the node 7 constitutes the node set 3.
And 3, setting an empty time slot set for storing the allocated time slots for each node in the path node information.
And 4, sequencing the node sets from small to large according to the quantization bandwidth of each node set.
The quantization bandwidth of each node set refers to a maximum bandwidth value of each node set, and the value is an integral value of the ratio of the number of union set time slots of all node available time slot sets in each node set to the number of nodes in the node set.
And 5, sequentially selecting a node set as the current node set.
And 6, judging whether the available time slot set in the current node set is an empty set, if so, executing the step 9, otherwise, executing the step 7 after allocating a time slot to each node in the current node set.
The allocation of a time slot to each node in the current node set is divided into the following three cases:
firstly, the number of nodes in the current node set is 1, a time slot is taken out from the available time slot set of the nodes in the node set and added to the time slot set of the node, and the time slot is deleted from the available time slot set of each node of the two-hop adjacent nodes of the node.
Secondly, when the number of nodes in the current node set is 2, executing the following steps:
calculating a common set of available time slots of two nodes, an exclusive time slot set of each node, according to the following formula:
Uxy＝Ux∩Uy,Dx＝Ux-Uxy,Dy＝Uy-Uxy
wherein, UxyRepresenting a common set, U, of the set of available time slots of the xth node in the current set of nodes and the set of available time slots of the yth node in the current set of nodesxRepresenting the available time slot set of the x-th node in the current node set, n representing the set intersection symbol, UyIndicating the set of available time slots of the y-th node in the current set of nodes, DxIndicating a set of exclusive time slots for the xth node in the current set of nodes, DyIndicating the exclusive time slot set of the y-th node in the current node set.
If the exclusive time slot set D of the x-th node in the current node setxIf not, taking out a time slot from the current exclusive time slot set and inserting the time slot into the time slot set of the x-th node in the current node set, otherwise, taking out the time slot from the UxyAnd taking out a time slot and inserting the time slot into the time slot set of the x-th node in the current node set.
And deleting the taken time slot from the available time slot set of each node of the two-hop adjacent node of the current node.
And performing the same processing on the y-th node in the current node set by adopting the same method to complete the time slot allocation of the current node set.
Thirdly, when the number of nodes in the current node set is 3, executing the following steps:
3.1. and according to the following formula, respectively calculating the intersection of the available time slots of the three nodes, the intersection of the available time slots of every two nodes and the exclusive time slot set of each node.
Uijk＝Ui∩Uj∩Uk
Uij＝Ui∩Uj-Uijk,Uik＝Ui∩Uj-Uijk,Ujk＝Uj∩Uk-Uijk
Di＝Ui-Uijk-Uij-Uik,Dj＝Uj-Uijk-Uij-Ujk,Dk＝Uk-Uijk-Uik-Ujk
Wherein, UijkSet U of available time slots representing ith node in current set of nodesiAnd the available time slot set U of the jth node in the current node setjThe available time slot set U of the kth node in the current node setkN denotes the set intersection symbol, UijA common available time slot set of two nodes, U, representing the available time slot set of the ith node in the current node set and the available time slot set of the jth node in the current node setikA common available time slot set of two nodes, U, representing the available time slot set of the current ith node and the available time slot set of the kth node in the current node setjkA common available time slot set of two nodes representing the available time slot set of the jth node in the current node set and the available time slot set of the kth node in the current node set, DiIndicating a set of exclusive time slots for the ith node in the current set of nodes, DjSet of exclusive time slots representing the jth node in the current set of nodes, DkRepresenting the set of exclusive time slots for the kth node in the current set of nodes.
3.2. If the exclusive time slot set D of the ith node in the current node setiNon-null, from the exclusive set of slotsAnd taking out a time slot and inserting the time slot into the time slot set of the ith node of the current node set, otherwise, executing the step 3.3.
3.3. If U is presentijAnd UikIf all are not null, then the slave UijAnd UikAnd (3) taking out a time slot from the public available time slot set of the pairwise nodes with more middle elements and inserting the time slot into the time slot set of the ith node in the current node set, otherwise, executing the step 3.4.
3.4. Slave UijkAnd taking out a time slot and inserting the time slot into the time slot set of the ith node in the node set.
3.5. The time slot is deleted from the available time slot set of each node of the two-hop neighbor node of the current node.
3.6. And performing the same processing on the jth node in the current node set and the kth node in the current node set by adopting the same method to complete the time slot allocation of the current node set.
And 7, judging whether all the node sets are selected, if so, executing the step 8, and otherwise, executing the step 5.
And 8, judging whether the time slot allocated by each node in the path node information is equal to the bandwidth required by the service flow, if so, executing the step 9, and otherwise, executing the step 4.
And 9, the destination node finishes the end-to-end time slot allocation.
And 4, planning a time slot distribution result.
And the destination node of the multi-hop service flow in the self-organized network encapsulates the time slot sets of all nodes on the path information and the path node information into an SREP frame, and the SREP frame is transmitted to all nodes on the path information in a hop-by-hop unicast manner from the destination node to the source node.

Claims (5)

1. A time slot distribution method for supporting multi-hop streaming service in a self-organizing network is characterized in that a node for generating service flow of each multi-hop service flow in the self-organizing network is used as a source node, a node consuming the service flow is used as a destination node, and a forwarding node between the source node and the destination node is used as an intermediate node; the destination node divides node sets for all nodes on the traffic flow path and allocates time slots for each node in each node set according to the path node information, the path node available time slot set information and the traffic flow required bandwidth, so as to realize end-to-end unified time slot allocation, and the method specifically comprises the following steps:
step 1, a source node triggers time slot reservation:
a multi-access control layer MAC of a source node in a self-organizing network constructs a time slot reservation request SREQ frame by utilizing a sensed multi-hop service flow and broadcasts and sends the SREQ frame out to trigger time slot reservation;
step 2, the intermediate node forwards the SREQ frame:
the intermediate node receives the SREQ frame, adds the node number of the intermediate node into the path node information in the SREQ frame, adds the available time slot set of the intermediate node into the available time slot set information of the path node in the SREQ frame, obtains a new SREQ frame and broadcasts the new SREQ frame to be sent out;
step 3, the destination node performs end-to-end time slot allocation:
step 1, a destination node in a self-organizing network extracts path node information, available time slot set information of all path nodes and bandwidth required by service flow from a received SREQ frame;
step 2, dividing all nodes in the path node information into a node set every three nodes according to the sequence from the source node to the destination node, and dividing the last less than three nodes into a node set;
step 3, setting an empty time slot set for storing the allocated time slots for each node in the path node information;
step 4, ordering the node sets from small to large according to the quantization bandwidth of each node set;
step 5, one node set is sequentially selected as a current node set;
step 6, judging whether the available time slot set in the current node set is an empty set, if so, executing step 9, otherwise, executing step 7 after allocating a time slot for each node in the current node set;
step 7, judging whether all the node sets are selected, if so, executing step 8, otherwise, executing step 5;
step 8, judging whether the time slot distributed by each node in the path node information is equal to the bandwidth required by the service flow, if so, executing step 9, otherwise, executing step 4;
step 9, completing the end-to-end time slot allocation of the destination node;
step 4, planning a time slot distribution result:
and the destination node of the multi-hop service flow in the self-organized network encapsulates the time slot sets of all nodes on the path information and the path node information into an SREP frame, and the SREP frame is transmitted to all nodes on the path information in a hop-by-hop unicast manner from the destination node to the source node.
2. The method of claim 1, wherein the multi-hop traffic flow in step 1 comprises a source address, a destination address, a traffic flow type, a source port number, a destination port number, and a required bandwidth of the traffic flow.
3. The timeslot allocation method for supporting multi-hop streaming services in an ad hoc network according to claim 1, wherein the constructing of the timeslot reservation request SREQ frame in step 1 is performed by encapsulating a source address, a destination address, a required bandwidth of a service stream, path node information, and available timeslot aggregation information of a path node into one data frame.
4. The method according to claim 1, wherein the quantized bandwidth of each node set in step 3 and step 4 is a maximum bandwidth value of each node set, and the value is a value obtained by rounding a ratio of a union time slot number of node available time slot sets of all nodes in each node set to a node number in the node set.
5. The method for allocating time slots supporting multi-hop streaming service in an ad hoc network according to claim 1, wherein the step 3, step 6, specifically allocating a time slot to each node in the current node set comprises the following steps:
step 1, if the number of nodes in a current node set is 1, taking a time slot from an available time slot set of the nodes in the node set, adding the time slot into the time slot set of the node, and deleting the time slot from the available time slot set of each node of two-hop adjacent nodes of the node;
and 2, if the number of the nodes in the current node set is 2, executing the following steps:
2.1. calculating a common set of available time slots of two nodes, an exclusive time slot set of each node, according to the following formula:
Uxy＝Ux∩Uy,Dx＝Ux-Uxy,Dy＝Uy-Uxy
wherein, UxyRepresenting a common set, U, of the set of available time slots of the xth node in the current set of nodes and the set of available time slots of the yth node in the current set of nodesxRepresenting the available time slot set of the x-th node in the current node set, n representing the set intersection symbol, UyIndicating the set of available time slots of the y-th node in the current set of nodes, DxIndicating a set of exclusive time slots for the xth node in the current set of nodes, DyAn exclusive time slot set representing the y node in the current node set;
2.2. if the exclusive time slot set D of the x-th node in the current node setxIf not, taking out a time slot from the current exclusive time slot set and inserting the time slot into the time slot set of the x-th node in the current node set, otherwise, taking out the time slot from the UxyA time slot is taken out and inserted into the time slot set of the xth node in the current node set;
2.3. deleting the taken time slot from the available time slot set of each node of the two-hop neighbor node of the current node;
2.4. the same method as the steps 2.2 and 2.3 is adopted to carry out the same treatment on the ith node in the current node set, and the time slot allocation of the current node set is completed;
and 3, if the number of the nodes in the current node set is 3, executing the following steps:
3.1. respectively calculating the intersection of the available time slots of the three nodes, the intersection of the available time slots of every two nodes and the exclusive time slot set of each node according to the following formula:
Uijk＝Ui∩Uj∩Uk
Uij＝Ui∩Uj-Uijk
Uik＝Ui∩Uj-Uijk
Ujk＝Uj∩Uk-Uijk
Di＝Ui-Uijk-Uij-Uik
Dj＝Uj-Uijk-Uij-Ujk
Dk＝Uk-Uijk-Uik-Ujk
wherein, UijkSet U of available time slots representing ith node in current set of nodesiAnd the available time slot set U of the jth node in the current node setjThe available time slot set U of the kth node in the current node setkN denotes the set intersection symbol, UijA common available time slot set of two nodes, U, representing the available time slot set of the ith node in the current node set and the available time slot set of the jth node in the current node setikA common available time slot set of two nodes, U, representing the available time slot set of the current ith node and the available time slot set of the kth node in the current node setjkA common available time slot set of two nodes representing the available time slot set of the jth node in the current node set and the available time slot set of the kth node in the current node set, DiIndicating a set of exclusive time slots for the ith node in the current set of nodes, DjSet of exclusive time slots representing the jth node in the current set of nodes, DkAn exclusive time slot set representing the kth node in the current node set;
3.2. if the exclusive time slot set D of the ith node in the current node setiIf not, taking out a time slot from the current exclusive time slot set to insert into the current exclusive time slot setIn the time slot set of the ith node in the front node set, otherwise, executing 3.3 of the step;
3.3. if U is presentijAnd UikIf all are not null, then the slave UijAnd UikTaking out a time slot from the public available time slot set of every two nodes with the middle element number and inserting the time slot into the time slot set of the ith node in the current node set, otherwise, executing the step 3.4;
3.4. slave UijkTaking out a time slot and inserting the time slot into the time slot set of the ith node in the node set;
3.5. deleting the taken time slot from the available time slot set of each node of the two-hop neighbor node of the current node;
3.6. and performing the same processing on the jth node in the current node set and the kth node in the current node set by adopting the same method to complete the time slot allocation of the current node set.
CN202010029703.2A 2020-01-13 2020-01-13 Time slot distribution method for supporting multi-hop streaming service in self-organizing network Active CN111246580B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010029703.2A CN111246580B (en) 2020-01-13 2020-01-13 Time slot distribution method for supporting multi-hop streaming service in self-organizing network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010029703.2A CN111246580B (en) 2020-01-13 2020-01-13 Time slot distribution method for supporting multi-hop streaming service in self-organizing network

Publications (2)

Publication Number Publication Date
CN111246580A CN111246580A (en) 2020-06-05
CN111246580B true CN111246580B (en) 2022-03-22

Family

ID=70864145

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010029703.2A Active CN111246580B (en) 2020-01-13 2020-01-13 Time slot distribution method for supporting multi-hop streaming service in self-organizing network

Country Status (1)

Country Link
CN (1) CN111246580B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112153742B (en) * 2020-08-31 2022-07-26 西安电子科技大学 MANET network dynamic time slot distribution method, system, equipment and application
CN113709884B (en) * 2021-09-26 2023-11-10 中车青岛四方机车车辆股份有限公司 Communication resource allocation method and device

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2910655A1 (en) * 2006-12-22 2008-06-27 Thales Sa METHOD FOR RESERVATION AND DYNAMIC ALLOCATION OF TIME CRANES IN A NETWORK WITH SERVICE GUARANTEE
WO2014084463A1 (en) * 2012-11-29 2014-06-05 아주대학교 산학협력단 Time division multiple access frame structure for ad-hoc network and method for allocating dynamic time slots using same
CN105873130A (en) * 2016-05-30 2016-08-17 电子科技大学 Time slot competition method for multi-hop self-organizing network
CN108235437A (en) * 2017-12-04 2018-06-29 中国电子科技集团公司第三十研究所 A kind of radio mobile self-organizing network channel time slot dispatching distribution method
CN109547148A (en) * 2019-01-18 2019-03-29 西安电子科技大学 Based on the dynamic time slot allocating method of service flow path in TDMA ad hoc network
CN110519845A (en) * 2019-05-16 2019-11-29 重庆邮电大学 The unmanned plane ad hoc network multi-hop TDMA cut-in method for assisting distribution based on time slot and using

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2910655A1 (en) * 2006-12-22 2008-06-27 Thales Sa METHOD FOR RESERVATION AND DYNAMIC ALLOCATION OF TIME CRANES IN A NETWORK WITH SERVICE GUARANTEE
WO2014084463A1 (en) * 2012-11-29 2014-06-05 아주대학교 산학협력단 Time division multiple access frame structure for ad-hoc network and method for allocating dynamic time slots using same
CN105873130A (en) * 2016-05-30 2016-08-17 电子科技大学 Time slot competition method for multi-hop self-organizing network
CN108235437A (en) * 2017-12-04 2018-06-29 中国电子科技集团公司第三十研究所 A kind of radio mobile self-organizing network channel time slot dispatching distribution method
CN109547148A (en) * 2019-01-18 2019-03-29 西安电子科技大学 Based on the dynamic time slot allocating method of service flow path in TDMA ad hoc network
CN110519845A (en) * 2019-05-16 2019-11-29 重庆邮电大学 The unmanned plane ad hoc network multi-hop TDMA cut-in method for assisting distribution based on time slot and using

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
A Modified Dynamic TDMA Slot Allocation Algorithm in Ad Hoc Network;Ting Yin等;《IEEE》;20161212;第124-128页 *
时隙式随机多址系统在无线传感器网络中的设计与实现;熊成彪等;《信息通信》;20190115;第248-250页 *

Also Published As

Publication number Publication date
CN111246580A (en) 2020-06-05

Similar Documents

Publication Publication Date Title
Zhang et al. Joint routing and scheduling in multi-radio multi-channel multi-hop wireless networks
US8130654B2 (en) Context-aware packet switching
CN103369599B (en) A kind of many radio frequencies multi-Channel Wireless Mesh Network resource cross-layer optimizing method
Kim et al. Fair and efficient multihop scheduling algorithm for IEEE 802.16 BWA systems
Wang et al. Interference-aware joint routing and TDMA link scheduling for static wireless networks
Borgonovo et al. MAC for ad-hoc inter-vehicle network: services and performance
CN102055675B (en) Multipath routing distribution method based on load equilibrium
CN111246580B (en) Time slot distribution method for supporting multi-hop streaming service in self-organizing network
CN109413752A (en) A kind of real time resources dispatching method towards wireless low-power consumption network
CN112291791B (en) Power communication mesh bandwidth resource allocation method based on 5G slice
CN104010344B (en) A kind of wireless sensor network virtual MIMO communication strategy based on cooperative groups
CN110418389A (en) A kind of meter register method of energy measurement network
CN107959977A (en) Wireless Mesh netword resource regulating method based on painting theory
Yu et al. Coordinated parallel resource allocation for integrated access and backhaul networks
Wang et al. OFDMA-based channel-width adaptation in wireless mesh networks
CN107426822B (en) Overhead-free resource reallocation method in wireless network
Soua et al. Wave: a distributed scheduling algorithm for convergecast in ieee 802.15. 4e networks (extended version)
Duan et al. An all-to-all broadcast protocol for variable packet sizes using directional antennas
Cai et al. An end-to-end bandwidth allocation algorithm for ad hoc networks
Chen et al. A multicast mechanism in WiMax mesh network
CN103731835A (en) Multiple input multiple output medium access control (MIMO MAC) protocol method for achieving singlecast and broadcast
Wang et al. A fair centralized scheduling algorithm based on traffic demand for IEEE 802.16 Mesh networks
Shi et al. Routing and Channel Assignment for Multicast in Multi-Channel Multi-Radio Wireless Mesh Networks.
Theoleyre et al. Assignment of roles and channels for a multichannel mac in wireless mesh networks
Mansoori et al. Throughput capacity analysis of large multi-channel, multi-interface random wireless mesh networks

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