CN101119151A - On-demand multi-access method with conflict decomposition - Google Patents
On-demand multi-access method with conflict decomposition Download PDFInfo
- Publication number
- CN101119151A CN101119151A CNA200710121164XA CN200710121164A CN101119151A CN 101119151 A CN101119151 A CN 101119151A CN A200710121164X A CNA200710121164X A CN A200710121164XA CN 200710121164 A CN200710121164 A CN 200710121164A CN 101119151 A CN101119151 A CN 101119151A
- Authority
- CN
- China
- Prior art keywords
- node
- access
- conflict
- slot
- channel
- 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
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a method of demand multiple access with conflict resolver. The method comprises the steps as follows: when a first node detects that access conflict occurs, the conflict resolver group is transmitted in the channel, declaring the beginning of conflict free reservation access time slot; when receiving the nodes of conflict resolver and group, preservation signal or interception signal is transmitted in a micro time slot of the conflict free reservation access time slot to a virtual ID number distributed to each node according to personal priority bit number and the first node so as to compete to be switched in the channels. When the first node detests that the access nodes has been switched successfully in the channels, result broadcast grouping is transmitted to the nodes. By the invention, the nodes in access conflict can be switched quickly in the channel quickly, which reduces the average massage discarding rate and average massage time delay, and improves channel throughput.
Description
Technical field
The present invention relates to a kind of multi-address access method according to requirement, relate in particular to a kind of multi-address access method according to requirement that has the decomposable process that conflicts, belong to the multiple access technique field in the radio communication.
Background technology
Mobile Ad Hoc network is a kind of multi-hop mobile wireless network that does not have the predetermined basis facility, is made of some nodes with self organizing functions such as autonomous transmitting-receiving, transfer, route, control, management.Mobile Ad Hoc network has characteristics such as deployment fast, self-organizing, selfreparing flexibly, during all kinds of military and civilian that be specially adapted to temporarily, predetermined facility and network topology constantly change use (as speedily carry out rescue work, combat a natural disaster, rescue, military operation etc.).Between each node in the mobile Ad Hoc network by the medium access control (Media Access Control, hereinafter to be referred as: MAC) method realize fast, efficiently, shared channel resources liberally.
Existing MAC method is divided into fixed allocation and distribution according to need dual mode usually.Owing to there is great deal of nodes in Ad Hoc network, and each node also handles based on burst service, and therefore, mobile Ad Hoc network mainly adopts the demand assigned access way, promptly according to the communication requirement of each node, channel resource is distributed.Existing distribution according to need mode mainly is divided into based on competition at random with based on there not being conflict two classes, wherein:
Access way based on competition at random is to send request (Request To Send by adopting, be called for short: RTS) message and removing request (Clear To Send, be called for short: CTS) carry out the periodical information exchange, reservation distributed mode is competed at random and obtained channel resource, as IEEE 802.11 distributed coordination function (DCF), two busy tone multiple access (DBTMA) and distributed packet reservation multiple access agreements such as (DPRMA).Though this mode can overcome the wasting of resources problem in the fixed allocation access way, yet when sending the increase of number of users and subscriber traffic, the probability of packet collisions can sharply strengthen, thereby has increased average multiple address news time delay greatly, reduced channel throughput.
Based on conflict free access way is to utilize cluster-head to realize fixing or the distribution according to need channel resource, and its typical case's representative polling mechanisms that use as IEEE 802.11 point coordination function (PCF) and virtual base station agreements such as (VBS) more.For the situation of carrying out network management by the algorithm that hives off, whole network is divided into some groups, each group self-organizing management, and cluster-head is responsible for place group's initialization management and routing management.The defective of this access way is: but when a large amount of mobile nodes did not send any information, cluster-head still will regularly carry out poll to all nodes, therefore can waste a large amount of polling overheads.
Summary of the invention
The purpose of this invention is to provide a kind of reduction average message loss ratio and average multiple address news time delay, improve the multi-address access method according to requirement of channel throughput.
To achieve these goals, one embodiment of the present of invention provide a kind of multi-address access method according to requirement with the conflict decomposition, comprising:
When cluster-head has detected the access interference generation, in channel, send conflict and decompose grouping, declare not have the beginning of conflict reservation access slot;
Receive described conflict and decompose the node of grouping, number in the mini-slot of described no conflict reservation access slot, send the reservation signal or intercept channel, compete access channel according to self preferential item and the virtual identity that distributes for each node of described cluster-head;
Cluster-head sends broadcast packe as a result to affiliated node after detecting access node success access channel.
By the method for the invention, owing to introducing the conflict step of decomposition in the multiple access access procedure as required, the node that therefore can guarantee to have taken place access interference is access channel apace, has reduced average message loss ratio and average message time delay.And, therefore can under the prerequisite that does not influence the reservation access, improve channel throughput because the situation that the number of nothing conflict access slot can take place according to the idle condition and the access interference of current channel resource not be provided with.
Below by drawings and Examples, technical scheme of the present invention is described in further detail.
Description of drawings
The multi-address access method according to requirement flow chart that Fig. 1 decomposes for band conflict of the present invention;
Fig. 2 is the flow chart of conflict decomposition step among Fig. 1;
Fig. 3 a is the sequential chart of node a, b in the embodiment of the present invention and c competition CF time slot;
Fig. 3 b is the sequential chart of node a in the embodiment of the present invention and c competition CF time slot;
Fig. 3 c is the sequential chart of node c in the embodiment of the present invention and d competition CF time slot;
Fig. 3 d is the sequential chart of the node d competition CF time slot in the embodiment of the present invention;
Fig. 4 is the flow chart of poll step among Fig. 1;
In channel, send the sequential chart of grouping in Fig. 5 embodiment of the present invention under the no access interference situation.
Embodiment
The basic functional principle of the cut-in method as required flow chart that Fig. 1 decomposes for band conflict of the present invention is specially:
Wherein, cluster-head is meant the node that has the center controlled function in the group.Usually in a group, the node except that cluster-head can be divided into gateway node and ordinary node.Gateway node wherein is meant the node that is used for carrying out message transmission between group and group.
Wherein, access failure is meant because in the frame structure of existing channel, have only a reservation access slot to send the RA grouping for node, because the business in the mobile Ad Hoc network is many based on burst service, when a plurality of nodes send the RA grouping simultaneously with the request access channel, competition then can take place insert collision, promptly clash, these nodes all can't successful access channel.
Wherein, grouping is accumulated and is meant that node has remaining traffic packets also not send.
Below introduce the execution conflict step of decomposition described in the step 130 in detail, as shown in Figure 2, comprising:
Wherein, the number of CF time slot is typically expressed as N
CFIndividual, specifically can adjust, up to all detected access interferences are all decomposed fully according to the number of nodes or the handled business of each node that insert simultaneously.Each CF time slot can be divided into a series of isometric mini-slot and long transmission access slot two parts.
Wherein, node is meant the node that will compete the CF time slot, and these nodes all are when competing access channel in step 110, owing to access interference has taken place and the node of access failure.The binary code of node number is made of preferential item and virtual identity successively.After preferential item shows this node access failure, wait for the priority that inserts once more; Virtual identity number is the code of the node of unique identification that distributed by cluster-head in advance.
Step 211 judges whether i mini-slot is last mini-slot of CF time slot, is execution in step 212 then; Otherwise return execution in step 202, begin to compete the next mini-slot in the CF time slot.
Particularly, when node in all corresponding mini-slot, finish according to own binary code send preengage signal or intercept channel after, represent that then this node successfully competed this CF time slot.
In addition, when in cluster-head detects certain CF time slot in the frame, not having node to send TA differential group to insert, then can judge the conflict step of decomposition finishes, all require all successful access channel of node of access, and cluster-head will be cancelled the CF time slot of back at once and directly send broadcast packe (be called for short: RB divides into groups) as a result.
Below illustrate the implementation of above-mentioned steps.
For example, suppose to have three nodes, promptly node a, b and c all compete failure when competing the CF time slot first, therefore all participate in the competition to another CF time slot.The content of the preferential item of these three nodes and virtual identity number can be expressed as respectively:
Node a:(01) 11010
Node b:(01) 11101
Node c:(01) 00101
Wherein, the preferential item of binary number representation in the parantheses, the virtual identity of other binary number representation respective nodes number.Shown in Fig. 3 a, the numbering of the first line display mini-slot, second represents the content of the reservation signal that node a, b and c send respectively to four lines in each mini-slot.Because node a, b and c all are the accesses that are at war with for the second time, so their preferential item is 01.
In the 1st mini-slot, because the binary number of three node transmissions is 0, then these three nodes are all intercepted channel; In the 2nd mini-slot, the binary number of three node transmissions is 1, then all sends the reservation signal; In the 3rd mini-slot, node a and b send the reservation signal, and node c intercepts channel, withdraw from the competition to this CF time slot after listening to the reservation signal, and self preferential item is added 1; In the 4th mini-slot, node a and b all send the reservation signal, and " q " expression node c has withdrawed from competition in this mini-slot; In the 5th mini-slot, node b sends the reservation signal, and node a intercepts channel, withdraws from the competition to this CF time slot after listening to the reservation signal; In the 6th mini-slot, node b intercepts channel, and " q " expression node a has withdrawed from competition in this mini-slot, and self preferential item is added 1; In the 7th mini-slot, node b wins this CF time slot after sending the reservation signal, and sends TA differential group, successful access channel at the 8th time slot ensuring escapement from confliction.
Shown in Fig. 3 b, the node a of competition access failure and c compete once more and insert second CF time slot.At this moment, all failed once because they insert the 1st CF time slot in competition, so priority bit all becomes " 10 ".Particularly, in the 1st mini-slot, node a and c all send the reservation signal; In the 2nd mini-slot, node a and c all intercept channel; In the 3rd mini-slot, node a sends the reservation signal, and node c intercepts channel, withdraws from the competition to this CF time slot after listening to the reservation signal, and self preferential item is added 1; In the 4th mini-slot, node a sends the reservation signal, and " q " expression node c has withdrawed from competition in this mini-slot; In the 5th mini-slot, node a intercepts channel; In the 6th mini-slot, node a sends the reservation signal, and intercept channel at the 7th mini-slot, do not listen to other node-sent reserved signals, therefore, node a finally wins this CF time slot, and sends transmission access differential group (also can be described as TA differential group), successful access channel at the 8th time slot ensuring escapement from confliction.
Behind node a and all successful access channel of b, node c competes once more and inserts the 3rd CF time slot.If the node that is at war with node c not, then node c can successful access channel, if also have this moment a node d to compete with it, then can adopt above-mentioned identical method, the competition access channel.
Particularly, shown in Fig. 3 c, node c and d competition insert the 4th CF time slot.Since in first three CF time slot, the equal access failure of node c, and therefore, this moment, its preferential item became 11, and because node d is at war with to the CF time slot for the first time, therefore, its preferential item is 00.In the 1st mini-slot, node c sends the reservation signal, and node d intercepts channel, withdraws from the competition to this CF time slot after listening to the reservation signal, and self preferential item is added 1; In the 2nd mini-slot, node c sends the reservation signal, and " q " expression joint d has withdrawed from competition in this mini-slot; In the 3rd to 6 mini-slot, node c is intercepting channel always; In the 7th mini-slot, node c finally wins this CF time slot after sending the reservation signal, and sends TA grouping, successful access channel at the 8th time slot ensuring escapement from confliction.
Node d continues competition and inserts the 5th CF time slot behind the competition access failure.At this moment, owing to do not have other nodes and node d competition, therefore, shown in Fig. 3 d, node d sends TA grouping, successful access channel at the 8th time slot ensuring escapement from confliction.
Need to prove different in Fig. 3 a, 3b of the virtual identity of the node c among Fig. 3 c number and node c herein.This be because, in step 201, when cluster-head sends the CR grouping to the node of access failure, can redistribute virtual identity number for these nodes according to the business transmission situation of linchpin node in a period of time, and periodically the virtual identity redistributed number is carried in the CR grouping at regular intervals and send.Preferentially compete the CF time slot owing to have the meeting of big virtual identity number, therefore,, can distribute bigger virtual identity number for sending the less node of traffic carrying capacity number of times usually in order to improve the access success rate.Specific to the node c among Fig. 3 c, before itself and node d competition CF time slot, owing to received the newly assigned virtual identity number that comes from cluster-head, therefore had new virtual identity number.Certainly, if cluster-head number is not periodically redistributed virtual identity, then the virtual identity of each node number can not change in whole competition CF time slot process.
In addition, when traffic carrying capacity increases,, can utilize the too much successful access of cluster-head restriction individual nodes in order to guarantee the fairness of shared channel.For example, cluster-head then can send notice message according to the order of severity of current access interference generation after detecting continuous 2 the successful access channels of certain node, make this node can not initiate access channel within a certain period of time.Have only when just beginning to attempt access channel once more through this node after this time, again such as, when the cluster joint reaches maximum traffic grouping transmit queue, all nodes that successfully insert will withdraw from the poll groupings transmit queue after finishing a traffic packets transmission, and access again is at war with.
By above-mentioned conflict step of decomposition, the node that can guarantee to have taken place access interference is access channel apace, has reduced the average message time delay.And, therefore can under the prerequisite that does not influence the reservation access, improve channel throughput because the situation that the number of CF time slot can take place according to the idle condition and the access interference of current channel resource is provided with.In addition, by preferential item being set for node and periodically redistributing virtual identity number, the order that inserts of configuration node with further optimization access procedure, improves access efficiency neatly.
Access interference not taking place when node reservation access channel, after promptly successfully inserting, can carry out the step of poll, below introduce the step of the execution poll described in the step 140 in detail, as shown in Figure 4, comprising:
Step 302 judges whether the gateway node that is polled to has traffic packets to send, if then execution in step 310 is arranged, otherwise execution in step 311.
In addition, more access chance is arranged in order to guarantee each gateway node, the number of nodes in the group more for a long time, cluster-head can be at set intervals, gateway node of poll once more after the node common to several carries out poll.
In order to be illustrated more clearly in above-mentioned polling procedure, can be referring to Fig. 5.Fig. 5 is that the various sequential charts that send in the channel that are grouped in are specially under the situation that no access interference takes place:
At the reservation access phase, cluster-head sends SR grouping declaration reservation and inserts beginning, distributes 1 reservation access slot thereafter; Each node sends the RA grouping and preengages in this time slot when traffic packets will send; When access interference did not take place, cluster-head sent the RB grouping and announces the access result, and declaration RA grouping sends successfully.
There is not the conflict traffic packets transmission stage, cluster-head and each node that successfully inserts alternately send traffic packets, promptly send traffic packets (Packet by cluster-head earlier, be called for short PKT), the node that is inserted by success sends traffic packets on for the channel resource of its distribution then, then cluster-head sends traffic packets again, is that another node that successfully inserts sends traffic packets afterwards, and the rest may be inferred.When cluster-head and all nodes that successfully insert finish alternately send traffic packets after, enter reservation next time after alternately distributing and insert and do not have a conflict traffic packets transmission stage, repetition above-mentioned steps.
In addition, in order to improve utilization rate of channel resources, after the node that success inserts is finished all traffic packets transmissions, can send to cluster-head and carry the traffic packets that discharges the channel resource sign, after cluster-head receives this traffic packets, begin just no longer it to be carried out poll from next frame, use to other nodes that successfully insert the channel resource allocation of distributing to this node.When the traffic packets transmit queue on the channel reached maximum, during promptly leisureless channel resource, cluster-head can temporarily be cancelled the reservation access phase, restarted to carry out the reservation access phase when channel resource is released again.By said method, can reduce the throughput of channel control expense, raising channel greatly.
It needs to be noted herein, though be illustrated among Fig. 5 under the situation of no access interference generation, the various sequential charts that send in the channel that are grouped in, but if access interference has taken place, those skilled in the art should be appreciated that, after having finished conflict and decompose by the described conflict step of decomposition of present embodiment, the nothing conflict traffic packets among Fig. 5 sends the stage and also can be suitable for.
In a word, the method of the invention combines fair competition, not having the conflict reservation inserts, the thought of poll services as required, be set to that reservation inserts period and conflict decomposition phase and transmission period as required by Channel Transmission, make packet collisions exist only in reservation access and conflict decomposition phase, solved the access interference problem in reservation access and conflict decomposition phase, greatly reduce the adverse effect that concealed terminal in the higher time reservation of traffic carrying capacity and exposed terminal bring to Channel Transmission, eliminated the possibility that clashes in the traffic packets process of transmitting, thereby avoided packet collisions, save unnecessary spending, improved channel throughput and the sending node access efficiency on the reservation time slot greatly.
It should be noted last that, above embodiment is only unrestricted in order to technical scheme of the present invention to be described, although the present invention is had been described in detail with reference to preferred embodiment, those of ordinary skill in the art is to be understood that, can make amendment or be equal to replacement technical scheme of the present invention, and not break away from the spirit and scope of technical solution of the present invention.
Claims (10)
1. the multi-address access method according to requirement with the conflict decomposition is characterized in that, comprising:
When cluster-head has detected the access interference generation, in channel, send conflict and decompose grouping, declare not have the beginning of conflict reservation access slot;
Receive described conflict and decompose the node of grouping, number in the mini-slot of described no conflict reservation access slot, send the reservation signal or intercept channel, compete access channel according to self preferential item and the virtual identity that distributes for each node of described cluster-head;
Cluster-head sends broadcast packe as a result to affiliated node after detecting access node success access channel.
2. the multi-address access method according to requirement that band conflict according to claim 1 is decomposed is characterized in that, described cluster-head also comprises before detecting described access interference:
The node broadcasts of cluster-head in the group of its place sends reservation and begins grouping, notifies each node can begin to preengage access.
3. the multi-address access method according to requirement that band conflict according to claim 2 is decomposed is characterized in that, the described reservation of described cluster-head broadcast transmission begins also to comprise after the grouping:
Receiving the node that described reservation begins to divide into groups, judge whether the traffic packets that will send, is then in the reservation access slot of channel, sends reservation and inserts grouping, the competition access channel.
4. the multi-address access method according to requirement that band conflict according to claim 1 is decomposed, it is characterized in that, described nothing conflict access slot comprises a plurality of isometric mini-slot and a transmission access slot, and described node sends the reservation signal or intercepts channel in described nothing conflict access slot and comprises:
I mini-slot in not having the conflict access slot, if the binary code i position of number being made up of preferential item and virtual identity of described node is 1, then signal is preengage in transmission in this mini-slot; If the binary code i position of described node is 0, then in this mini-slot, intercept channel.
5. the multi-address access method according to requirement that band conflict according to claim 4 is decomposed is characterized in that described node is intercepted channel and comprised:
When other node-sent reserved signals are arranged, then withdraw from competition in listening to described mini-slot, and self preferential item is added 1 this nothing conflict access slot; When not having other nodes to send the reservation signal, described node will continue the next mini-slot of competition.
6. the multi-address access method according to requirement that band conflict according to claim 5 is decomposed is characterized in that, the competition that described node withdraws from this nothing conflict access slot also comprises afterwards:
In the next one has the conflict access slot, do not send the reservation signal or intercept channel, the competition access channel.
7. the multi-address access method according to requirement that band conflict according to claim 4 is decomposed is characterized in that, the binary code of described node basis oneself in all corresponding mini-slot also comprises after sending the reservation signal or intercepting channel:
All finish according to its binary code that the reservation signal sends in described all mini-slot or channel when intercepting when described node, in described transmission access slot, send transmission and insert differential group, successful access channel.
8. the multi-address access method according to requirement that band conflict according to claim 7 is decomposed is characterized in that, described node sends transmission and inserts the differential group in described transmission access slot, also comprises after the successful access channel:
After the transmission access differential group that cluster-head sends according to described node detects access node success access channel, send broadcast packe as a result to affiliated node.
9. the multi-address access method according to requirement that band conflict according to claim 1 is decomposed is characterized in that, described cluster-head distributes virtual identity number to be specially to affiliated node:
Cluster-head is periodically redistributed virtual identity number for affiliated node, sends situation according to the business of node, and cluster-head distributes bigger virtual identity number for sending the less node of number of times, and announces the distribution condition of virtual identity number to affiliated node.
10. the multi-address access method according to requirement that band conflict according to claim 1 is decomposed is characterized in that, described cluster-head also comprises after sending described broadcast packe as a result:
Described node to gateway node and successful access channel carries out poll.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB200710121164XA CN100559738C (en) | 2007-08-30 | 2007-08-30 | The multi-address access method according to requirement that the band conflict is decomposed |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB200710121164XA CN100559738C (en) | 2007-08-30 | 2007-08-30 | The multi-address access method according to requirement that the band conflict is decomposed |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101119151A true CN101119151A (en) | 2008-02-06 |
| CN100559738C CN100559738C (en) | 2009-11-11 |
Family
ID=39055112
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB200710121164XA Expired - Fee Related CN100559738C (en) | 2007-08-30 | 2007-08-30 | The multi-address access method according to requirement that the band conflict is decomposed |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100559738C (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101399833B (en) * | 2008-12-09 | 2011-06-01 | 中国人民解放军理工大学 | Hybrid media access control method based on collaborative collision decomposition |
| CN102970737A (en) * | 2012-11-21 | 2013-03-13 | 无锡儒安科技有限公司 | Wireless network transmission conflict resolution method and system based on constructive interference |
| CN103118335A (en) * | 2011-10-12 | 2013-05-22 | Nxp股份有限公司 | Station and method thereof |
| CN103718600A (en) * | 2011-07-28 | 2014-04-09 | 美国博通公司 | Signaling and procedure design for cellular cluster contending on license-exempt bands |
| CN109548168A (en) * | 2018-12-19 | 2019-03-29 | 北航（四川）西部国际创新港科技有限公司 | Adaptive hierarchical multiple access method and its system in highly dynamic radio network |
| CN110140321A (en) * | 2017-01-06 | 2019-08-16 | 高通股份有限公司 | The unicast data transmission using mini time slot in the downlink shared burst of time slot |
| CN110383783A (en) * | 2017-03-07 | 2019-10-25 | 华为技术有限公司 | The system and method that conflict is detected and slowed down using wake-up packet |
-
2007
- 2007-08-30 CN CNB200710121164XA patent/CN100559738C/en not_active Expired - Fee Related
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101399833B (en) * | 2008-12-09 | 2011-06-01 | 中国人民解放军理工大学 | Hybrid media access control method based on collaborative collision decomposition |
| CN103718600B (en) * | 2011-07-28 | 2017-11-14 | 安华高科技通用Ip(新加坡)公司 | For the signaling and process design of the honeycomb cluster competed on licensed band is exempted from |
| CN103718600A (en) * | 2011-07-28 | 2014-04-09 | 美国博通公司 | Signaling and procedure design for cellular cluster contending on license-exempt bands |
| CN103118335A (en) * | 2011-10-12 | 2013-05-22 | Nxp股份有限公司 | Station and method thereof |
| US9210722B2 (en) | 2011-10-12 | 2015-12-08 | Nxp, B.V. | Establishing fairness and reducing delay in broadcast based vehicle to vehicle communication using application-level phase adjustments |
| CN103118335B (en) * | 2011-10-12 | 2016-02-17 | Nxp股份有限公司 | Website and method thereof |
| CN102970737B (en) * | 2012-11-21 | 2016-04-20 | 无锡儒安科技有限公司 | A kind of contention resolution of the wireless network transmissions based on constructive interference and system |
| CN102970737A (en) * | 2012-11-21 | 2013-03-13 | 无锡儒安科技有限公司 | Wireless network transmission conflict resolution method and system based on constructive interference |
| CN110140321A (en) * | 2017-01-06 | 2019-08-16 | 高通股份有限公司 | The unicast data transmission using mini time slot in the downlink shared burst of time slot |
| CN110140321B (en) * | 2017-01-06 | 2022-08-12 | 高通股份有限公司 | Unicast data transmission using mini-slots on a downlink common burst of slots |
| US11558890B2 (en) | 2017-01-06 | 2023-01-17 | Qualcomm Incorporated | Unicast data transmission on a downlink common burst of a slot using mini-slots |
| US11902997B2 (en) | 2017-01-06 | 2024-02-13 | Qualcomm Incorporated | Unicast data transmission on a downlink common burst of a slot using mini-slots |
| CN110383783A (en) * | 2017-03-07 | 2019-10-25 | 华为技术有限公司 | The system and method that conflict is detected and slowed down using wake-up packet |
| CN110383783B (en) * | 2017-03-07 | 2020-12-01 | 华为技术有限公司 | System and method for detecting and mitigating conflicts using wake-up packets |
| CN109548168A (en) * | 2018-12-19 | 2019-03-29 | 北航（四川）西部国际创新港科技有限公司 | Adaptive hierarchical multiple access method and its system in highly dynamic radio network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100559738C (en) | 2009-11-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110493893B (en) | Self-adaptive dynamic networking method | |
| EP1290529B1 (en) | Method for dynamically allocating time slots of a common tdma broadcast channel to a network of transceiver nodes | |
| Kanzaki et al. | Dynamic TDMA slot assignment in ad hoc networks | |
| Bao et al. | A new approach to channel access scheduling for ad hoc networks | |
| CN101977385B (en) | DSAM (Dynamic Slot-time Allocation Method) of scale-extensible single-jump ad hoc network supporting QoS (Quality of Service) | |
| US7835383B2 (en) | Method and system for providing a modified timed division multiple access (TDMA) for reduced delay | |
| CN100559738C (en) | The multi-address access method according to requirement that the band conflict is decomposed | |
| CN100534068C (en) | Non-confliction on-demand multi-address access method | |
| Borgonovo et al. | ADHOC: a new, flexible and reliable MAC architecture for ad-hoc networks | |
| CN108024367B (en) | Method, device, equipment and storage medium for dynamically allocating time slot | |
| CN111818652B (en) | Channel resource allocation method of multi-transceiver multi-channel wireless Ad Hoc network | |
| CN105119632A (en) | Multi-frequency hopping pattern based communication method applicable to mobile ad hoc network | |
| CN100559903C (en) | Adapter distribution multi-address access method | |
| CN110225593A (en) | A kind of random number in Distributed T DMA agreement is left unused slot contention method | |
| EP1936870B1 (en) | Distributed scheduling access in a wireless network | |
| CN100452745C (en) | Multi-address access method with the confliction decomposition | |
| CN100505584C (en) | Fast precontract and line transmission multi-address access method | |
| US8976728B2 (en) | Distributed medium access control (DMAC) for mobile ad hoc networks | |
| US7343170B1 (en) | System and method for allowing nodes in a wireless communication network to access multiple channels | |
| CN102118832B (en) | Dynamic time slot allocation access method for networking of frequency-hopping radio station | |
| Aydın et al. | Enabling self-organizing tdma scheduling for aerial swarms | |
| CN100512505C (en) | Asynchronous interactive multi-address access method | |
| CN100429958C (en) | Bandwidth reserved media access control method for private wireless network | |
| CN111371483B (en) | Beam scheduling method, device and system | |
| CN111491320B (en) | Network resource processing method and device and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20091111 Termination date: 20150830 |
|
| EXPY | Termination of patent right or utility model |