CN101621746A - MIMO-based topology-transparent broadcast transmission multiple access method in ad hoc network - Google Patents
MIMO-based topology-transparent broadcast transmission multiple access method in ad hoc network Download PDFInfo
- Publication number
- CN101621746A CN101621746A CN200910023364A CN200910023364A CN101621746A CN 101621746 A CN101621746 A CN 101621746A CN 200910023364 A CN200910023364 A CN 200910023364A CN 200910023364 A CN200910023364 A CN 200910023364A CN 101621746 A CN101621746 A CN 101621746A
- Authority
- CN
- China
- Prior art keywords
- time slot
- node
- nts
- sending node
- stage
- 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.)
- Pending
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
- Radio Transmission System (AREA)
Abstract
The invention relates to an MIMO-based (multiple input multiple output-based) topology-transparent broadcast transmission multiple access method in an ad hoc network. By modifying the time slot structure and signal flow on the basis of MIMO-TTR (multiple input multiple output-topology-transparent reservation) protocol, the broadcast transmission can be effectively supported by the MIMO-TTR protocol in the topology-transparent network. The MIMO-based topology-transparent broadcast transmission multiple access method comprises the following steps: firstly, carrying out the time slot allocation on all the nodes in the network by the GRAND (Galois radio network design) algorithm in advance, wherein, each time slot is divided into the following stages: RTS (Request to Send), NTS (Not to Send), DATA (Data Transmission) and NAK (Non-acknowledge), and the broadcast transmission services are provided by using different MIMO data stream numbers in the four stages of the time slot; and exchanging the RTS/NTS subgroups by only one data stream at each transmitting node and each receiving node in the exchanging process, if the broadcast services are required to be transmitted by the transmitting node, the RTS subgroup is transmitted to all adjacent nodes for reservation in the allocated time slot, and if the RTS subgroup is not properly received by the receiving node, the NTS subgroup is replied to the transmitting node immediately, if the NTS subgroup is received by the transmitting subgroup, that the broadcast services cannot be transmitted in the current time slot is determined, and the next allocated time slot reservation is made, and if not, that the reservation is made is determined by the transmitting node, and the broadcast subgroup is transmitted by using all the data streams.
Description
Technical field
The present invention relates to multiple-input and multiple-output (MIMO) technology and wireless multihop self-organizing network broadcast transmitted field, support the topological unknown broadcast transmission multiple access method of MIMO in specifically a kind of ad hoc network.This method is used for realizing the successful transmission of broadcasting service under the sight that need not full mesh topology information, improve the capacity of network, realizes that simultaneously the performance of network with the variation of network very big reduction does not take place.
Background technology
The key property of the super 3G of Ad hoc, it is a kind of ad hoc deployed wireless networks that static infrastructure supports, that form by the mobile node that disperses on some geography that do not need, these nodes can freely enter and deviated from network, also can move freely in network.Mimo system can be regarded the system that transmitting terminal and receiving terminal all have been equipped with many antennas as, and its core concept is that transmit antenna array and receiving antenna array are united to reduce the error rate or to improve message transmission rate.Recently, MIMO technique (MIMO) is developed apace, also more and more is subjected to people and payes attention to, and be applied in the ad hoc network.Mimo system in physical layer by extensive studies, yet its validity and performance are strengthened having only by rational design high level, as the MAC layer, could be strengthened effectively.
Multiple access protocol based on current support MIMO need be known full mesh topology, and prior art MIMO-TTR is the unknown reservation of the topology time division multiple access access protocol of a kind of support MIMO of suitable multi-hop ad hoc network.This agreement is based on the frame structure of time division multiple access, and each time slot is divided into reservation stage and data transfer phase.By reservation, each node is at the parallel highest-traffic that sends of the nothing of its distribution conflict time slot, and utilizes it to distribute conflict time slot in time slot and the idle time slot in the unallocated time slot and send a part of data flow with certain probability.This agreement need not known the topological structure of the whole network, thereby is convenient to realize and be suitable for Distributed Application.Utilize document Ju J H and Victor O K Li.An Optimal Topology-Transparent Scheduling Method inMultihop Packet Radio Networks[J] .IEEE/ACM Transactions on Networking, 1998,6 (3): the GRAND algorithm that 298-306. provides is that each node in the network distributes several slots, every time slot divides RTS, CTS, DATA and ACK stage, the frame structure of this technology and structure of time slot are as shown in Figure 1.Though it is unknown that this technology is a topology, it mainly is to design at unicast service, and is not suitable for broadcasting service.
Multiple access protocol at current support MIMO is only supported point-to-point transmission, and prior art " is supported the broadcast transmitted time division multiple access access protocol of MIMO " in the multi-hop ad Hoc network can effectively support broadcast transmitted.Its core algorithm is to guarantee that each node does not have the timeslot scheduling algorithm that conflict is transmitted broadcasting service and guaranteed minimum frame length.The major programme of this technology is as follows: timeslot scheduling divides two stages: the phase I, each node only distributes a time slot in a frame, thereby obtains minimum frame length; Second stage is distributed to the more time slot of each node as far as possible.Owing to have the interfering nodes of more magnanimous node can be more, thereby selecting on the time slot more restriction is arranged, therefore should obtain the more chance of multi-slot to improve them at first for these nodes distribution time slots.Therefore, in order to obtain equity dispatching, each node distributes by falling power with node degree, takes turns in the distribution every, and each node only distributes a time slot.In distributing the time slot process, adopt the remaining time slots degree of freedom to weigh the priority of selecting time slot.Specific algorithm execution in step and analyzing examples are seen " the broadcast transmitted dispatching algorithm of supporting MIMO in the multi-hop ad hoc network ", Li Jiandong, Zhang Guanghui, Chen Yanyu, Li Changle, Zhang Wenzhu. " western electricity newspaper ", 33 (4): 580-583, in August, 2006.Though this technology can be supported broadcasting service, it but needs to know the topology information of network, is not suitable for using in ad hoc network.
Summary of the invention
The technical problem to be solved in the present invention is, can not effectively support broadcasting at prior art " MIMO-TTR ", and prior art " in the multi-hop ad Hoc network support MIMO broadcast transmitted time division multiple access access protocol " proposes a kind of multiple access access protocol that need not the support broadcasting service of full mesh topology information though support broadcasting service but need the weak point of full mesh topology information.
Support the topological unknown broadcast transmission multiple access method of MIMO that MIMO-TTR is made amendment in the ad hoc network of the present invention, revised structure of time slot and signal flow, make it support broadcasting service.The present invention has kept the booking-mechanism of MIMO-TTR, the mode of utilizing the reservation multiple access to insert makes sending node just preengage channel before sending carrying out broadcast data packets, after successfully preengaging, sending node just can conflict free transmission broadcast data packets, thereby reduced the influence of conflict, improved the throughput of network for broadcast transmitted.The conflict supposed is the sole cause of broadcasting failure.At broadcasting service, at first, utilize the GRAND algorithm to carry out time slot allocation in advance for all nodes in the network, each time slot is divided into request and sends " RTS ", do not send " NTS ", transfer of data " DATA " and negative response " NAK " four-stage, frame structure of the present invention and structure of time slot are as shown in Figure 2; Its exchange process will use different MIMO number of data streams in different phase according to time slot state, and each sending node and receiving node only with data flow exchange RTS/NTS grouping, are beneficial to the receiving node conflict and decompose; If sending node will send broadcasting service, only can send RTS in its distributed time slot divides into groups to be used for reservation to all neighborss, if receiving node does not correctly receive the RTS grouping, to reply the NTS grouping to sending node immediately, if sending node receives the NTS grouping, learn that promptly current time slots can not send broadcasting service, and then to the distributed time slot reservation of next institute; If receive NTS grouping, then sending node is thought and preengage successfully, just with whole data flow transmission broadcast packe.
Radio transmission signal flow process of the present invention is divided into two stages: in first stage, sending node carries out the reservation of channel; In case after preengaging successfully, sending node just can send broadcast packe in second stage.Signal flow graph is as shown in Figure 3:
(1) if sending node u has broadcasting service to need to send, it can only carry out broadcast packe and send in its distributed time slot, sending node u is the grouping carrying out of the RTS stage broadcast transmission RTS in its distributed time slot reservation of channel at first, waits for the feedback of receiving node;
In order to reduce the generation of conflict, utilize RTS grouping the carrying out reservation of channel this moment, improve the percent of pass of network.
(2) if any neighbors v of sending node u does not successfully receive this RTS grouping in the RTS stage of current time slots, then reply a NTS grouping to node u in the NTS stage of this time slot, show that current time slots is not suitable for sending broadcasting service;
(3) if any neighbors v of sending node u successfully receives this RTS grouping in the RTS stage of current time slots, then node v feeds back any information just no longer for sending node u;
(4) if sending node u receives the NTS grouping in the NTS stage of this time slot, then showing in current time slots has at least a neighbors can not successfully receive the broadcasting service of sending node u, therefore, node u should distribute time slot to restart from step (1) at the next one;
(5) if sending node u receives the NTS grouping of conflict in the NTS stage of this time slot, show in current time slots the broadcasting service that can not successfully receive node u above M neighbors is arranged, " M is the number of antennas of sending and receiving end in the mimo system " therefore, sending node u should distribute time slot to restart from step (1) at the next one;
Step (1)～(5) are first stage, and each sending node and receiving node only carry out channel booking with data flow exchange RTS/NTS grouping, are beneficial to the receiving node conflict and decompose; Step (4) and (5) illustrate no matter the NTS stage of sending node in its distributed time slot receives the NTS grouping of conflict free NTS grouping or conflict, both of these case shows that all be not suitable for carrying out broadcast transmitted this moment, sending node all will be gone off the air and be kept quite, and restart from step (1) when next sending node institute distributed time slot again;
(6) if sending node u does not receive the NTS grouping in the NTS stage of this time slot, show the broadcast packe that all successfully receives node u at all neighborss of current time slots, preengage successfully this moment, and sending node u just sends broadcast packe in the DATA stage of this time slot with whole data flow;
(7) if at least one neighbors does not successfully receive broadcast packe, just reply the NAK grouping to sending node u in this time slot NAK stage; Otherwise neighbors is all kept quite, and does not reply any grouping;
Step (6)～(7) are second stage, and sending node is broadcasted;
(8) in case sending node u receives the NAK grouping in this time slot NAK stage, show to have at least a neighbors successfully not receive broadcast packe, then sending node u just distributes time slot to restart from step (1) at the next one; Otherwise sending node u thinks that broadcast packe sends successfully;
So far, the broadcasting process of a node is all over.By above signal flow, the present invention not only can effectively support broadcast transmitted, and does not need the topology information of knowing that the whole network is concrete.
Operation principle of the present invention: suppose that network is in ideally, conflict is the sole cause of broadcast packe (RTS etc.) bust this.M＜D in network, " M is the number of antennas of sending and receiving end in the mimo system; D is a node maximal degree in the network ", all neighborss of prior art " MIMO-TTR " sending node are after successfully receiving the RTS grouping, if these nodes are all replied the CTS grouping to sending node, then these meeting in groups clash at the sending node place, make sending node successfully not receive definite transmission CTS grouping of neighbors, and think mistakenly and preengage failure, the transmission of going off the air.And this moment, channel was idle, can broadcast, thereby cause the waste of resource, can not support broadcast transmitted effectively, and in the present invention, the CTS stage being revised as the NTS stage, receiving node is only just replied NTS to sending node after successfully not receiving the RTS grouping, show the RTS grouping failure that this moment, sending node sent, after receiving node successfully receives the RTS grouping, keep quite and do not reply any information; Can improve sending node like this to the channel booking success rate, thereby effectively support broadcast transmitted.The present invention in like manner is revised as the NAK stage with the ACK stage, receiving node is only just replied NAK to sending node after successfully not receiving the DATA grouping, show the DATA grouping failure of sending node broadcasting this moment, after receiving node successfully receives the DATA grouping, keep quite and do not reply any information, can avoid like this confirming that being grouped in the receiving node place clashes, to have avoided sending node owing to correctly do not receive affirmation information that neighbors replys wrong thinks the broadcast packe bust this, reduced the number of times that sending node carries out unnecessary re-transmission, thereby improve the throughput of network, make the present invention effectively support broadcasting.In addition, M＞D in network, owing to adopted the MIMO technology can be in the network so that the probability that this network clashes in broadcast transmitted reduces greatly, the probability raising successfully transmitted of divide into groups; Receiving node only successfully do not receive RTS after the DATA grouping just to sending node reply NTS NAK, show this moment sending node send RTS DATA grouping failure, when receiving node successfully receive RTS keep quite after the DATA grouping and do not reply any information; Receiving node is replied sending node after just noting be used in and successfully receiving at every turn like this, then can significantly reduce the expense of network in broadcasting process.
The present invention is compared with the prior art the characteristics that had:
1, the number of nodes in the adhoc network changes, and has a large amount of nodes to enter or deviated from network in a period of time; Node location in the network also moves simultaneously, and topology of networks changed a lot in a period of time.Most of traditional multiple access access protocols are based on network topology structure, and when topology of networks changed, these multiple access access protocols need change according to topology of networks and recomputate in order to continue correct work.When the speed of topology of networks variation is very fast, the speed that the multiple access access protocol recomputates does not catch up with the speed that network topology structure changes, can make that network performance is affected to a great extent this moment, when situation is serious even can cause network paralysis, can not work.Prior art " in the multi-hop ad Hoc network support MIMO broadcast transmitted time division multiple access access protocol " is though support broadcasting service but need full mesh topology information, and the present invention is based on topology the unknown, adopted the GRAND algorithm that the node in the network is carried out time slot allocation, do not need to know the concrete topological structure of network, can correctly work as long as know the interstitial content N of network and node maximal degree D, relatively be fit to work in ad hoc network.Prior art " MIMO-TTR " can only realize point-to-point transmission though be that topology is unknown, can not effectively support broadcasting.The present invention still adopts the frame structure of MIMO-TTR, has revised structure of time slot and signal flow, gets above-mentioned two growing of prior art and keeps away that it is short, has realized need not to know full mesh topology information and effectively supporting broadcasting service.
2, each time slot still is divided into four-stage among the present invention, but can only realize point-to-point transmission in order to make it can overcome prior art MIMO-TTR, can not effectively support the shortcoming broadcasted, change affirmation transmission " CTS " stage of MIMO-TTR time slot into " NTS " stage that do not send, change affirmative acknowledgement " ACK " stage into negative response " NAK " stage, can avoid confirming that being grouped in the receiving node place clashes, to have avoided sending node owing to correctly do not receive affirmation information that neighbors replys wrong thinks the broadcast packe bust this, reduced the number of times that sending node carries out unnecessary re-transmission, thereby significantly reduce the expense of network in broadcasting process, improve the throughput of network, support broadcasting effectively.
Description of drawings
Frame structure and the structure of time slot of Fig. 1 prior art MIMO-TTR
Fig. 2 frame structure of the present invention and structure of time slot
Fig. 3 radio transmission signal flow chart of the present invention
The network topology structure of Fig. 4 embodiment of the invention
The time slot allocation result of Fig. 5 embodiment network
The broadcasting process of the network of Fig. 6 embodiment
Embodiment
The preferred embodiments of the present invention illustrate the detailed process of this invention by network topology structure as shown in Figure 4.At first, utilize the GRAND algorithm to draw the time slot allocation result of all nodes in this network, as shown in Figure 5.This algorithm need not to know the concrete topological structure of network, only need know that the interstitial content N of network and node maximal degree D can correctly work, in the present embodiment, and N=5, D=3.
Suppose that this network is under the situation of heavy traffic load, promptly all nodes in the network all have broadcasting service to send in its distributed time slot.By this time slot allocation as a result figure can draw, the 0th time slot allocation of the 0th subframe given node A, the C in the network, the 1st time slot allocation of the 0th subframe given the Node B in the network, E, the 2nd time slot allocation of the 0th subframe given the node D in the network, and all nodes in the network can only just can carry out the transmission of broadcasting service in its distributed time slot.
Fig. 6 (a) has shown the broadcasting process of this network in the 0th time slot of the 0th subframe.Node A, C send a RTS grouping to their all neighborss separately simultaneously in the RTS stage of the 0th time slot of the 0th subframe and preengage, by this topology of networks as can be known this moment node A, C all neighborss can not receive the RTS reservation grouping of conflict, so these neighborss are kept quite and can not replied the NTS grouping to node A, C at the 0th time slot of the 0th subframe.Owing to all do not receive the NTS grouping that its neighbors is replied at the NTS of this time slot stage node A, C, then node A, C think and preengage successfully, the DATA stage at this time slot can be carried out conflict free broadcast transmitted, and then node A, C carry out broadcast transmitted respectively in the DATA stage.Because the broadcasting service that node A, C are sent is conflict free, their all neighborss separately can both be correct in the ideal case receives broadcast packe, so these neighborss were kept quite in the NAK stage of this time slot, can't reply the NAK grouping to node A, C.So far, this network is finished in the broadcasting process of all four-stages of the 0th time slot of the 0th subframe.Similarly, Fig. 6 (b), (c) have shown the broadcasting process of this network in all time slots 1,2 of the 0th subframe, can draw the broadcasting process of this network at other time slots by the present invention.
Can draw by above analysis,, can reduce broadcast collision to a great extent, thereby improve the broadcast transmitted correctness of network, and then improve the throughput of network because the node of network adopts the MIMO technology and revised node structure of time slot and signal flow.
Claims (3)
1, support the topological unknown broadcast transmission multiple access method of MIMO in a kind of ad hoc network, in multi-hop ad hoc network, support on the time division multiple access access protocol basis of MIMO, structure of time slot and signal flow have been revised, make it in topological unknown network, effectively support broadcast transmitted, at first, utilize the GRAND algorithm to carry out time slot allocation in advance for all nodes in the network, each time slot is divided into request and sends " RTS ", do not send " NTS ", transfer of data " DATA " and negative response " NAK " four-stage, exchange process will use different MIMO number of data streams broadcast transmitted business at the four-stage of time slot according to time slot state; Each sending node and receiving node only with data flow exchange RTS/NTS grouping, are beneficial to the receiving node conflict and decompose; If sending node will send broadcasting service, can only send RTS in its distributed time slot divides into groups to be used for reservation to all neighborss, if receiving node does not correctly receive the RTS grouping, to reply the NTS grouping to sending node immediately, if sending node receives the NTS grouping, learn that promptly current time slots can not send broadcasting service, and then to the distributed time slot reservation of next institute; If receive NTS grouping, then sending node is thought and preengage successfully, just with whole data flow transmission broadcast packe.
2, support the topological unknown broadcast transmission multiple access method of MIMO in the ad hoc network according to claim 1, it is characterized in that: the radio transmission signal flow process is divided into two stages: in first stage, sending node carries out the reservation of channel, preengage successfully, enter second stage, sending node sends broadcast packe; Concrete signal flow is as follows:
(1) if sending node u has broadcasting service to need to send, it can only carry out the transmission of broadcast packe in its distributed time slot, sending node u is the grouping carrying out of the RTS stage broadcast transmission RTS in its distributed time slot reservation of channel at first, waits for the feedback of receiving node;
(2) if any neighbors v of sending node u does not successfully receive this RTS grouping in the RTS stage of current time slots, then respond a NTS grouping for node u in the NTS stage of this time slot, show that current time slots is not suitable for sending broadcasting service;
(3) if any neighbors v of sending node u successfully receives this RTS grouping in the RTS stage of current time slots, then node v feeds back any information just no longer for sending node u;
(4) if sending node u receives the NTS grouping in the NTS stage of this time slot, then showing in current time slots has at least a neighbors can not successfully receive the broadcasting service of sending node u, therefore, node u should distribute time slot to restart from step (1) at the next one;
(5) if sending node u receives the NTS grouping of conflict in the NTS stage of this time slot, show in current time slots the broadcasting service that can not successfully receive node u above M neighbors is arranged, therefore, sending node u should distribute time slot to restart from step (1) at the next one;
Step (1)～(5) are first stage, and each sending node and receiving node only carry out channel booking with data flow exchange RTS/NTS grouping, are beneficial to the receiving node conflict and decompose;
(6) if sending node u does not receive NTS grouping in the NTS stage of this time slot, show can both successful receiving node u at all neighborss of current time slots broadcast packe, just sending node u sends broadcast packe in the DATA stage of this time slot;
(7) if at least one neighbors does not successfully receive broadcast packe, just reply the NAK grouping for sending node u in this time slot NAK stage; Otherwise neighbors is all kept quite, and does not reply any grouping;
Step (6)～(7) are second stage, and sending node is broadcasted;
(8) receive the NAK grouping in case send contact u in this time slot NAK stage, show to have at least a neighbors successfully not receive broadcast packe, then sending node u just distributes time slot to restart from step (1) at the next one; Otherwise sending node u thinks that broadcast packe sends successfully;
So far, the broadcasting process of a node is all over.
3, support the topological unknown broadcast transmission multiple access method of MIMO in the ad hoc network according to claim 1, it is characterized in that: a structure of time slot is modified as request sends " RTS ", do not send " NTS ", transfer of data " DATA " and negative response " NAK " four-stage are used for effectively transmission and support broadcasting and reduce expense.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910023364A CN101621746A (en) | 2009-07-17 | 2009-07-17 | MIMO-based topology-transparent broadcast transmission multiple access method in ad hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910023364A CN101621746A (en) | 2009-07-17 | 2009-07-17 | MIMO-based topology-transparent broadcast transmission multiple access method in ad hoc network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101621746A true CN101621746A (en) | 2010-01-06 |
Family
ID=41514728
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200910023364A Pending CN101621746A (en) | 2009-07-17 | 2009-07-17 | MIMO-based topology-transparent broadcast transmission multiple access method in ad hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101621746A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106304394A (en) * | 2016-09-19 | 2017-01-04 | 华南师范大学 | A kind of adaptive scheduling optimization method based on MIMO heterogeneous ad hoc network |
| CN107005420A (en) * | 2015-05-20 | 2017-08-01 | 华为技术有限公司 | Group business feedback method and device |
-
2009
- 2009-07-17 CN CN200910023364A patent/CN101621746A/en active Pending
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107005420A (en) * | 2015-05-20 | 2017-08-01 | 华为技术有限公司 | Group business feedback method and device |
| CN107005420B (en) * | 2015-05-20 | 2019-11-12 | 华为技术有限公司 | Group business feedback method and device |
| CN106304394A (en) * | 2016-09-19 | 2017-01-04 | 华南师范大学 | A kind of adaptive scheduling optimization method based on MIMO heterogeneous ad hoc network |
| CN106304394B (en) * | 2016-09-19 | 2019-11-19 | 华南师范大学 | A kind of adaptive scheduling optimization method based on MIMO heterogeneous ad hoc network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Bharati et al. | CAH-MAC: cooperative ADHOC MAC for vehicular networks | |
| CN103428642B (en) | Based on relaying bunch in D2D multicasting method | |
| Cheng et al. | Achieving efficient reliable flooding in low-duty-cycle wireless sensor networks | |
| CN102625252B (en) | Time-divided transmission method capable of avoiding interference for D2D multi-casting communication system | |
| CN102246575A (en) | Apparatus and method for dynamic communication resource allocation for device-to-device communications in a wireless communication system | |
| JP5265014B2 (en) | Ultra-reliable coordinated wireless communication | |
| CN102340829A (en) | Device-to-device (D2D) cluster data sharing method under cellular environment | |
| CN101919295B (en) | Method of wireless data transmission | |
| WO2011079552A1 (en) | Message retransmission method for improving multicast efficiency in cellular system | |
| CN102857988B (en) | Realization method of routing in accordance with requirements in cognitive wireless Ad Hoc network | |
| Lv et al. | Multicast service-oriented virtual network embedding in wireless mesh networks | |
| CN102932866A (en) | Opportunistic routing mechanism applicable to multi-radio-frequency multi-channel Ad hoc network | |
| WO2015078068A1 (en) | Relay-based in-cluster d2d multicast method | |
| CN101199142B (en) | Apparatus and method for transmitting/receiving broadcast data in a mobile communication system | |
| CN101478318B (en) | Broadcast station collaborative communication method in ultra short wave Ad Hoc network | |
| Zhang et al. | An OFDMA-based joint reservation and cooperation MAC protocol for the next generation WLAN | |
| EP3927081A1 (en) | Resource scheduling system for a wireless communication network | |
| Mosavat-Jahromi et al. | NC-MAC: Network coding-based distributed MAC protocol for reliable beacon broadcasting in V2X | |
| CN101621746A (en) | MIMO-based topology-transparent broadcast transmission multiple access method in ad hoc network | |
| JP2016201833A (en) | Data broadcast with prepare-to-broadcast message | |
| CN1839636B (en) | Methods and apparatus of transmitting user data using traffic channels | |
| CN109156029A (en) | The method, apparatus and system of data transmission | |
| CN101883075B (en) | Cooperative transmission method based on virtual MIMO (Multiple Input Multiple Output) system | |
| Alnabelsi et al. | Uplink channel assignment in cognitive radio WMNs using physical layer network coding | |
| CN103313141A (en) | Cooperative node selection establishment method for distribution type wireless multicast |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Open date: 20100106 |