CN101465797B - Data transmission method, system, sending terminal node and receiving terminal node - Google Patents
Data transmission method, system, sending terminal node and receiving terminal node Download PDFInfo
- Publication number
- CN101465797B CN101465797B CN2007101953870A CN200710195387A CN101465797B CN 101465797 B CN101465797 B CN 101465797B CN 2007101953870 A CN2007101953870 A CN 2007101953870A CN 200710195387 A CN200710195387 A CN 200710195387A CN 101465797 B CN101465797 B CN 101465797B
- Authority
- CN
- China
- Prior art keywords
- message
- time slot
- stage
- rts
- nts
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The invention provides a data transmission method, a system, a sender node and a receiver node thereof. During a time slot i allocated to the sender node, the sender node sends an RTS message in the RTS(transmit requires) period; if an NTS message is received in the NTS period of the time slot i, the step of sending an RTS message is turned to in the next time slot j allocated to the sender node; otherwise, service data is sent in the DATA period of the time slot i. As for the receiver node, if the RTS message is not received successfully in the RTS period of the time slot i, the NTS message is sent in the NTS period of the time slot i and the sender node is forbidden to send the service data during the time slot i; and if the RTS message is successfully received in RTS period, no NTS message is sent in the NTS period of the time slot i. The method and the system can realize the harmonious transmission of broadcasting and unicasting service data.
Description
Technical field
The present invention relates to the network communications technology, particularly a kind of method of transfer of data, system, sender node and receiving terminal node.
Background technology
Ad hoc network is a kind ofly not need static infrastructure to support, organize wireless network by what the mobile node that disperses on some geography was formed, and each node can freely enter and deviated from network, and can move freely in network.Ad hoc network is because the characteristics of flexible configuration have application prospects.
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 can be regarded the system that transmitting terminal and receiving terminal all have been equipped with many antennas as, 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, many antennas of both link ends can be created a plurality of independently channels, these independently channel a plurality of independent data stream are sent thereon so that higher spectrum efficiency to be provided, and need not to consume extra bandwidth or energy.In vertical-type bell lab layered space-time (V-BLAST) structure commonly used, transmitting terminal and receiving terminal all are equipped with M antenna, a high-speed bit stream can resolve into M individual bit stream of the former speed of 1/M, each bit stream sends by M antenna is parallel simultaneously, has so just only taken the former bandwidth of 1/M.Have the reception M data flow that the receiving terminal of M antenna can be successful, and when the neighbors of receiving terminal sent smaller or equal to M data flow to receiving terminal, receiving terminal can successfully separate the data flow that receives.
When carrying out internodal transfer of data, two class conflicts may take place: if node is also sending data flow in time slot i receiving data stream, then first kind conflict can take place, this first kind conflict causes owing to node can not transmit and receive data simultaneously; If node receives above M data flow at time slot i, then can send the second class conflict.Wherein, i is a timeslot number of distributing to this node.Under the situation that above-mentioned conflict takes place, this node and its neighbors then can not successfully carry out transfer of data, at this problem, provide a kind of method of carrying out transfer of data between node in the prior art.The main technical schemes of this method is as follows:
This scheme adopts frame structure shown in Figure 1, and in this frame structure, a frame is divided into q subframe, comprises q time slot in each subframe, and promptly every frame is by q
2Individual time slot is formed, and each time slot is divided into the request of sending (RTS), sends and determine (CTS), transfer of data (DATA) and transmission response (ACK) four-stage.For the node u distributed time slot in the network can be expressed as f
u(x), wherein, x is a subframe numbers of distributing to node u, 0≤x≤q-1, in addition, the S among the figure
vThe neighbors set of expression node v, the timeslot number of distributing to each node in every frame is q.In order to avoid conflict when the transfer of data, sender node at first sends the RTS message to receiving terminal node in the RTS stage that is self distributed time slot i, if receiving terminal node receives and unique RTS message that receives this sender node transmission, then think this time slot i for there not being the conflict time slot, send CTS message notifying sender node at the CTS node of this time slot i to sender node and can walk abreast and send M data flow to this receiving terminal node; If receiving terminal node successfully receives l neighbors at time slot i and sends to the RTS message of self and do not receive the RTS message that sends to other node, then send CTS message notifying sender node to sender node and can walk abreast M/l data flow of transmission to this receiving terminal node at this time slot i; If receiving terminal node receives l neighbors and sends to the RTS message of self, and receive the RTS message that sends to other node, then can send 1 data flow to this receiving terminal node to the transmission CTS of sender node message notifying sender node at this time slot i.
Can realize conflict free transfer of data between node by said method, but, the inventor finds in realizing process of the present invention: this method is only carried out at unicast service, transmission for broadcast service data, if a neighbors of sender node can not successfully receive the RTS message, then may cause the bust this of business datum, if utilize method of the prior art, sender node can not know whether all neighborss all successfully receive the RTS message, therefore, the method for prior art and being not suitable for realizes the no colliding data transmission of broadcasting service.
Summary of the invention
The embodiment of the invention provides a kind of method, system, sender node and receiving terminal node of transfer of data, so that realize the no colliding data transmission of broadcasting service.
A kind of method of transfer of data, this method comprises: at broadcasting service, be among the sender node distributed time slot i, sender node is sending request (RTS) stage to its neighbors broadcast transmission RTS message; If in the transmission of this time slot i negates the NTS message that receives in (NTS) stage from arbitrary described neighbors, be among this sender node distributed time slot j then at the next one, go to described in the RTS stage step to the neighbors broadcast transmission RTS of this sender node message; If do not receive NTS message from arbitrary described neighbors in the NTS stage of this time slot i, then transfer of data (DATA) stage of this time slot i to described neighbors broadcast transmission business datum.
A kind of method of transfer of data, this method comprises: at broadcasting service, in distributing to the time slot i of sender node, if receiving terminal node does not successfully receive the RTS message in the RTS stage, then NTS stage of this time slot i to the neighbors broadcast transmission NTS of receiving terminal node message, forbid that sender node sends business datum at this time slot i; If the RTS stage successfully receives the RTS message, then do not send the NTS message in the NTS stage of this time slot i.
A kind of system of transfer of data, this system comprises: sender node and receiving terminal node; Described sender node, at broadcasting service, be used for being self distributed time slot i, sending request (RTS) stage to its neighbors broadcast transmission RTS message, if in the transmission of this time slot i negates the NTS message that receives in (NTS) stage from arbitrary described neighbors, then in the next one is self distributed time slot j, continue to carry out described operation to its neighbors broadcast transmission RTS message in the RTS stage; If do not receive NTS message from arbitrary described neighbors in the NTS stage of this time slot i, then DATA stage of this time slot i to described neighbors broadcast transmission business datum; Described receiving terminal node at broadcasting service, is used for when the RTS stage of described time slot i does not successfully receive the RTS message, NTS stage of this time slot i to the neighbors broadcast transmission NTS of receiving terminal node message; When the RTS stage of described time slot i successfully receives the RTS message, do not send the NTS message in the NTS stage of this time slot i.
A kind of sender node, this sender node comprises: RTS packet sending unit, NTS message receiving element and business datum transmitting element; At broadcasting service, described RTS packet sending unit is used for being this sender node distributed time slot i, is sending the request RTS stage to its neighbors broadcast transmission RTS message; When the NTS message that receives in the NTS stage from arbitrary described neighbors was negated in the transmission of this time slot i, the RTS stage that at the next one is this sender node distributed time slot j was to its neighbors broadcast transmission RTS message at described NTS message receiving element; Described NTS message receiving element is used for receiving the NTS message in the NTS stage of this time slot i; Described business datum transmitting element is used at described NTS message receiving element sending business datum in the transfer of data DATA stage of this time slot i when the NTS stage of time slot i does not receive the NTS message.
A kind of receiving terminal node, this receiving terminal node comprises: RTS message receiving element and NTS packet sending unit; At broadcasting service, described RTS message receiving element is used for receiving the RTS message distributing to the time slot i of sender node in the RTS stage; Described NTS packet sending unit, be used at described RTS message receiving element when the RTS stage of time slot i does not successfully receive the RTS message, the NTS stage at this time slot i forbids that to the neighbors broadcast transmission NTS of receiving terminal node message sender node sends business datum at this time slot i, if when the RTS stage of time slot i successfully receives the RTS message, do not send the NTS message in the NTS stage of this time slot i at described RTS message receiving element.
As can be seen from the above technical solutions, in embodiments of the present invention, sender node is sending the reservation that the RTS message carries out business data transmission for the RTS stage among self distributed time slot i, if the NTS stage at time slot i receives the NTS message, then have at least a neighbors can not successfully receive the RTS message in the neighbors at this sender node of broadcasting service, perhaps, can not successfully receive the RTS message at the unicast service receiving terminal node, this moment business data transmission reservation failure, then sender node can be waited for and nextly resend the reservation that the RTS message carries out business data transmission for self distributed time slot j; If the NTS stage at time slot i does not receive the NTS message, then illustrate that at broadcasting service all neighborss of this sender node can both successfully receive the RTS message, at unicast service, illustrate that receiving terminal node can successfully receive the RTS message, this moment, the reservation of business datum was successful, and sender node can be carried out the transmission of business datum.Therefore, the method that the embodiment of the invention provides, system, sender node and receiving terminal node can be used to realize the no conflict transmission of broadcast service data, and can be used to realize the no conflict transmission of unicast service data.
Description of drawings
The frame assumption diagram that Fig. 1 provides for prior art;
The frame assumption diagram that Fig. 2 provides for the embodiment of the invention;
The method flow diagram that the realization broadcast service data that Fig. 3 provides for the embodiment of the invention transmits;
The method flow diagram of the realization unicast service transfer of data that Fig. 4 provides for the embodiment of the invention;
The system construction drawing that Fig. 5 provides for the embodiment of the invention.
Embodiment
In order to realize the purpose, technical solutions and advantages of the present invention, describe the present invention below in conjunction with the drawings and specific embodiments.
Structure of time slot in the frame structure that the embodiment of the invention provides prior art is reset, as shown in Figure 2, in this frame structure, other structure can remain unchanged, but the structure to each time slot is reset, and promptly being arranged to RTS, sending negates (NTS), DATA and bust this response (NAK) four-stage.
The method that the embodiment of the invention provides mainly comprises: be among the sender node distributed time slot i, sender node sends the RTS message in the RTS stage, if the NTS stage at this time slot i receives the NTS message, be among this sender node distributed time slot j then, re-execute the step that the described RTS stage at this time slot j sends the RTS message at the next one; If the NTS stage at this time slot i does not receive the NTS message, then send business datum in the DATA stage of this time slot i.
For receiving terminal node, if in time slot i, successfully do not receive the RTS message, then send the NTS message in the NTS stage of this time slot i, if in time slot i, successfully receive the RTS message, then can not send any information in the NTS stage of this time slot i.
The realization broadcast service data transmission method flow chart that Fig. 3 provides for the embodiment of the invention, in this embodiment, be example with the multicast service, suppose that sender node is node u, node u can be as shown in Figure 3 to the process of its neighbors broadcast service data, and this method may further comprise the steps:
Step 301: node u is being broadcast transmission RTS message among its distributed time slot i.
In this step, node u has business datum to need broadcasting, at first is being broadcast transmission RTS message among its distributed time slot i, sends business datum to its neighbors request, and waits for the feedback of its neighbors.
For distributing time slot method, node u can adopt existent method in the prior art,
Wherein, x is a subframe numbers of distributing to node u, 0≤x≤q-1, and 0≤a≤q-1, every frame is by q
2Individual time slot is formed, and the value of q and k can be passed through the GRAND algorithm computation, and this part is a prior art, does not repeat them here.
In this step, node u preferably sends by a data flow when sending the RTS message, so that reduce the conflict that causes receiving terminal node.Certainly, also can adopt M or M to send with interior a plurality of data flow.
Step 302: the RTS message of each neighbors receiving node u broadcasting of node u, if successfully receive the RTS message, then execution in step 303; If successfully do not receive the RTS message, then execution in step 304.
In this step, if when each neighbors receives RTS message also sending the RTS message, then can not successfully receive this RTS message, if each neighbors received above M data flow simultaneously in this RTS stage, then can not successfully receive this RTS message.Wherein, the data flow maximum number that the value of M can receive for this neighbors is relevant with the antenna number of self usually.
Step 303: the neighbors that successfully receives the RTS message is not broadcasted any message in the NTS stage of this time slot i, execution in step 305.
Step 304: the neighbors that does not successfully receive the RTS message is broadcasted the NTS message in the NTS stage of this time slot i, execution in step 305.
In this step,, then broadcast this time slot of NTS message description i and be not suitable for node u broadcast service data if this neighbors does not successfully receive the RTS message.
In this step, this neighbors preferably by this NTS message of data streaming, also can be broadcasted this NTS message by M or with interior a plurality of data flow.
Step 305: node u receives the NTS message in the NTS stage, if node u does not receive the NTS message at this time slot i, then execution in step 306, if node u clashes at the NTS message that this time slot i receives NTS message or reception, wait for that then the next one goes to step 301 for its distributed time slot.
In this step, if node u receives the NTS message in this time slot i, then illustrate in this time slot i, have at least a neighbors can not be successful the business datum of receiving node u broadcasting, at this moment, node u will attempt sending the RTS message for its distributed time slot at the next one, promptly go to execution in step 301.
If the NTS message that node u received in the NTS stage of this time slot i surpasses M, then can clash, this moment, node u can not normally receive the NTS message, and then node u will attempt sending the RTS message for its distributed time slot at the next one, promptly go to execution in step 301.
Step 306: node u is at the DATA of this time slot i stage broadcast service data.
In this step, node u does not receive the NTS message, shows that its all neighborss all can successfully receive business datum in this time slot i, and can not produce conflict, and therefore, node u can be at the DATA of this time slot i stage broadcast service data.
Node u can also can pass through M or M with interior a plurality of data flow broadcast service datas at this node by a data streaming business datum.
Step 307: each neighbors of node u receives business datum in the DATA stage of this time slot i, if each neighbors successfully receives business datum, then execution in step 308; If can not successfully receive business datum, then execution in step 309.
In this step, if neighbors also sends business datum simultaneously in the DATA stage of this time slot i, then business datum can not be successfully received,, then business datum can not be successfully received if neighbors received more than M business data flow simultaneously in the DATA stage of this time slot i.
Step 308: the neighbors that successfully receives business datum does not send any message in the NAK stage of this time slot i, execution in step 310.
Step 309: the neighbors that does not successfully receive business datum is broadcasted the NAK message in the NAK stage of this time slot i, execution in step 310.
Step 310:, then go to execution in step 301 for its distributed time slot at the next one if node u receives the NAK message of NAK message or conflict in the NAK stage of this time slot i; If node u does not receive the NAK message in the NAK stage of this time slot i, the broadcast service data success then is described, can process ends.
In this step, if node u receives the NAK message in the NAK stage of this time slot i, then show to have at least a neighbors successfully not receive business datum, therefore, need re-execute flow process shown in Figure 3 for its distributed time slot at the next one, until successful broadcast service data.
In this step, if node u receives the NAK message of conflict in the NAK stage of this time slot i, then showing has M above neighbors successfully not receive business datum, therefore, need re-execute flow process shown in Figure 3 for its distributed time slot at the next one, until successful broadcast service data.
Above flow process is to be the description that example is carried out with the broadcast service data, same this method also can be used for the transmission of unicast service data, the method flow diagram of the realization unicast service transfer of data that Fig. 4 provides for the embodiment of the invention, among this embodiment, suppose that sender node is node u, receiving terminal node is node v, node u will be when node v sends business datum, need at first to preengage to node v by sending the RTS message, as shown in Figure 4, this method can may further comprise the steps:
Step 401: node u is being sent to node v for the RTS stage of its distributed time slot i with the RTS message.
Equally, in this step, node u preferably sends by a data flow, also can adopt M or M to send with interior a plurality of data flow.
Step 402: node v receives the RTS message in the RTS stage of this time slot i, if successfully do not receive the RTS message, then execution in step 403, if successfully receive the RTS message, then execution in step 405.
In this step, if when node v receives the RTS message also sending the RTS message, then can not successfully receive this RTS message, if node v received above M data flow simultaneously in this RTS stage, then can not successfully receive this RTS message.Wherein, the data flow maximum number that the value of M can receive for node v is relevant with the antenna number of self usually.
Step 403: node v replys the NTS message in the NTS stage of time slot i to node u.
In this step, node v preferably sends this NTS message by a data flow, also can send this NTS message by M or with interior a plurality of data flow.
Step 404: node u receives the NTS message at time slot i, waits for that the next one goes to execution in step 401 for its distributed time slot.
In this step, node u receives the NTS message at time slot i, then illustrates in this time slot i, and node v can not successfully receive the business datum that node u sends, and at this moment, node u will attempt sending the RTS message for its distributed time slot at the next one.
Step 405: node v does not reply any message in the NTS stage of time slot i to node u.
Step 406: node u does not receive the NTS message at time slot i, sends business datum in the DATA stage of this time slot i to node v.
In this step, node u does not receive the NTS message at time slot i, then illustrates in this time slot i, and node v can successfully receive the business datum that node u sends.
Step 407: the business datum that node v sends at the DATA of this time slot i stage receiving node u.If successfully receive this business datum, then execution in step 408, if successfully do not receive business datum, then execution in step 409.
In this step, if node v also sends business datum simultaneously in the DATA stage of this time slot i, then business datum can not be successfully received,, then business datum can not be successfully received if node v received more than M business data flow simultaneously in the DATA stage of this time slot i.
Step 408: node v does not reply any message, process ends in the NAK stage of this time slot i to node u.
Step 409: the NAK stage of this time slot of node v i is replied the NAK message to node u.
Step 410: node u receives the NAK message of NAK message or conflict in the NAK stage of this time slot i, shows that then business datum does not send success, waits for nextly going to execution in step 401 for the RTS stage of its distributed time slot.
In this step,, show that then node v does not successfully receive business datum, therefore, need re-execute flow process shown in Figure 4 for its distributed time slot at the next one, until successful broadcast service data if node u receives the NAK message in the NAK stage of this time slot i.
In this step, if node u receives the NAK message of conflict in the NAK stage of this time slot i, show that then node v does not successfully receive business datum, therefore, need re-execute flow process shown in Figure 4 for its distributed time slot at the next one, until successful broadcast service data.
The system construction drawing that Fig. 5 provides for the embodiment of the invention, as shown in Figure 5, this system can comprise: sender node 500 and receiving terminal node 510.
Sender node 500, be used for sending the RTS message in the RTS stage, if receive the NTS message in the NTS stage of this time slot i for self distributed time slot i, then in the next one is self distributed time slot j, continue to carry out the operation that sends the RTS message in the RTS stage; If the NTS stage at this time slot i does not receive the NTS message, then send business datum in the DATA stage of this time slot i.
Receiving terminal node 510 is used for sending the NTS message in the NTS stage of this time slot i when the RTS stage of time slot i does not successfully receive the RTS message; When the RTS stage of time slot i successfully receives the RTS message, do not send the NTS message in the NTS stage of this time slot i.
Receiving terminal node 510 can also be used for sending the NAK message in the NAK stage of this time slot i when the DATA of time slot i node does not successfully receive business datum.
Sender node 500 can also be used for when the NAK stage of this time slot i receives the NAK message of NAK message or conflict, in the next one is self distributed time slot j, continues to carry out sending the operation that the request RTS stage sends the RTS message.
This system can be used for unicast service, also can be used for broadcasting service.When being used for broadcasting service, receiving terminal node 510 can be the neighbors of receiving terminal node 500, and at this moment, receiving terminal node 510 can be one or more.
Wherein, sender node 500 can comprise: RTS packet sending unit 501, NTS message receiving element 502 and business datum transmitting element 503.
RTS packet sending unit 501 is used for being this sender node 500 distributed time slot i, sends the RTS message in the transmission request RTS stage; Negates when the NTS stage receiving the NTS message at NTS message receiving element 502 in the transmission of this time slot i, is RTS stage of this sender node 500 distributed time slot j to send the RTS message at the next one.
RTS packet sending unit 501 preferably sends by a data flow when sending the RTS message, so that reduce the conflict that causes receiving terminal node.Certainly, also can adopt M or M to send with interior a plurality of data flow.
The mode that RTS packet sending unit 501 sends the RTS message can be the neighbors that is broadcast to this sender node 500, can be that receiving terminal node 510 is given in clean culture.
NTS message receiving element 502 is used for receiving the NTS message in the NTS stage of this time slot i.
Business datum transmitting element 503 is used at NTS message receiving element 502 sending business datum in the transfer of data DATA stage of this time slot i when the NTS stage of time slot i does not receive the NTS message.
Business datum transmitting element 503 preferably sends by a data flow when sending business datum, so that reduce the conflict that causes receiving terminal node.Certainly, also can adopt M or M to send with interior a plurality of data flow.
The mode that business datum transmitting element 503 sends business datum can be the neighbors that is broadcast to this sender node 500, can be that receiving terminal node 510 is given in clean culture.
In addition, RTS packet sending unit 501 also is used for, and negates the NTS message that receives in the NTS stage when clashing at NTS message receiving element 502 in the transmission of this time slot i, is RTS stage of this sender node 500 distributed time slot j to send the RTS message at the next one.
This sender node 500 can also comprise: NAK message receiving element 504 is used for receiving the NAK message in the NAK stage of time slot i.
RTS packet sending unit 501, can also be used at NAK message receiving element 504 negates when the NAK stage receiving the NAK message of NAK message or conflict in the transmission of this time slot i, is RTS stage of this sender node 500 distributed time slot j to send the RTS message at the next one.
Receiving terminal node 510 can comprise: RTS message receiving element 511 and NTS packet sending unit 512.
RTS message receiving element 511 is used for receiving the RTS message distributing to the time slot i of sender node 500 in the RTS stage.
NTS packet sending unit 512, be used at RTS message receiving element 511 when the RTS stage of time slot i does not successfully receive the RTS message, send the NTS message in the NTS stage of this time slot i and forbid that sender node 500 sends business datum at this time slot i, if when the RTS stage of time slot i successfully receives the RTS message, do not send the NTS message in the NTS stage of this time slot i at RTS message receiving element 511.
NTS packet sending unit 512 preferably sends by a data flow when sending the NTS message, so that reduce the conflict that causes sender node.Certainly, also can adopt M or M to send with interior a plurality of data flow.
The mode that NTS packet sending unit 512 sends the NTS message can be the neighbors that is broadcast to this sender node 500, can be that receiving terminal node 510 is given in clean culture.
This receiving terminal node 510 can also comprise: business datum receiving element 513 and NAK packet sending unit 514.
Business datum receiving element 513 is used for receiving business datum in the DATA stage of time slot i.
NAK packet sending unit 514, be used for business datum receiving element 513 when the DATA stage of time slot i does not successfully receive business datum, the NAK stage at time slot i sends the NAK message, if when the DATA stage of time slot i successfully receives business datum, do not send the NAK message in the NAK stage of time slot i at business datum receiving element 513.
By above description as can be seen, in embodiments of the present invention, sender node is sending the reservation that the RTS message carries out business data transmission for the RTS stage among self distributed time slot i, if the NTS stage at time slot i receives the NTS message, then have at least a neighbors can not successfully receive the RTS message in the neighbors at this sender node of broadcasting service, perhaps, can not successfully receive the RTS message at the unicast service receiving terminal node, this moment business data transmission reservation failure, then sender node can be waited for and nextly resend the reservation that the RTS message carries out business data transmission for self distributed time slot j; If the NTS stage at time slot i does not receive the NTS message, then illustrate that at broadcasting service all neighborss of this sender node can both successfully receive the RTS message, at unicast service, illustrate that receiving terminal node can successfully receive the RTS message, this moment, the reservation of business datum was successful, and sender node can be carried out the transmission of business datum.Therefore, the method that the embodiment of the invention provides, system, sender node and receiving terminal node can be used to realize the no conflict transmission of broadcast service data, and can be used to realize the no conflict transmission of unicast service data.
The above only is preferred embodiment of the present invention, and is in order to restriction the present invention, within the spirit and principles in the present invention not all, any modification of being made, is equal to replacement, improvement etc., all should be included within the scope of protection of the invention.
Claims (15)
1. the method for a transfer of data is characterized in that, this method comprises:
At broadcasting service, be among the sender node distributed time slot i, this sender node is sending the request RTS stage to its neighbors broadcast transmission RTS message;
If in the transmission of this time slot i negates the NTS message that receives in the NTS stage from arbitrary described neighbors, be among this sender node distributed time slot j then at the next one, go to described in the RTS stage step to the neighbors broadcast transmission RTS of this sender node message; If do not receive NTS message from arbitrary described neighbors in the NTS stage of this time slot i, then transfer of data DATA stage of this time slot i to described neighbors broadcast transmission business datum.
2. method according to claim 1 is characterized in that, this method also comprises:
If in the transmission of this time slot i negates the NTS message that the NTS stage receives conflict, is among this sender node distributed time slot j at the next one then, go to the described step that sends the RTS message in the RTS stage.
3. method according to claim 1 is characterized in that, described transmission RTS message comprises: send described RTS message by N data flow, wherein, 1≤N≤M;
Described transmission business datum comprises: send described business datum by P data flow, wherein, and 1≤P≤M, the value of M is the data flow maximum number that receiving terminal node can receive.
4. method according to claim 1, it is characterized in that, this method also comprises: if when the bust this response NAK stage of this time slot i receives the NAK message of NAK message or conflict, be among its distributed time slot j then, go to the described step that sends the RTS message in the RTS stage at the next one.
5. the method for a transfer of data is characterized in that, this method comprises:
At broadcasting service, in distributing to the time slot i of sender node, if receiving terminal node does not successfully receive the RTS message in the transmission request RTS stage, then the transmission of this time slot i negate the NTS stage to the neighbors broadcast transmission NTS of receiving terminal node message, forbid that sender node sends business datum at this time slot i; If the RTS stage successfully receives the RTS message, then do not send the NTS message in the NTS stage of this time slot i.
6. method according to claim 5, it is characterized in that, this method also comprises: if successfully receive business datum in the DATA stage of this time slot i, then do not send the NAK message in the bust this response NAK stage of this time slot i, if the transfer of data DATA stage at this time slot i does not successfully receive business datum, then send the NAK message in the NAK stage of this time slot i.
7. according to claim 5 or 6 described methods, it is characterized in that, described successfully the reception comprises: described receiving terminal node is also sending the RTS message when receiving the RTS message, perhaps receiving terminal node is also sending business datum when receiving business datum; Perhaps, described receiving terminal node receives RTS message or the business datum above M data flow simultaneously, and wherein, the value of M is the data flow maximum number that receiving terminal node can receive.
8. method according to claim 6 is characterized in that, described transmission NAK message comprises: to the neighbors broadcasting NAK of receiving terminal node message.
9. the system of a transfer of data is characterized in that, this system comprises: sender node and receiving terminal node;
Described sender node, at broadcasting service, be used for being self distributed time slot i, sending the request RTS stage to its neighbors broadcast transmission RTS message, if in the transmission of this time slot i negates the NTS message that receives in the NTS stage from arbitrary described neighbors, then in the next one is self distributed time slot j, continue to carry out described operation to its neighbors broadcast transmission RTS message in the RTS stage; If do not receive NTS message from arbitrary described neighbors in the NTS stage of this time slot i, then transfer of data DATA stage of this time slot i to described neighbors broadcast transmission business datum;
Described receiving terminal node at broadcasting service, is used for when the RTS stage of described time slot i does not successfully receive the RTS message, NTS stage of this time slot i to the neighbors broadcast transmission NTS of receiving terminal node message; When the RTS stage of described time slot i successfully receives the RTS message, do not send the NTS message in the NTS stage of this time slot i.
10. system according to claim 9, it is characterized in that, described receiving terminal node also is used for when the DATA stage of described time slot i does not successfully receive business datum, NAK stage of this time slot i to the neighbors broadcast transmission NAK of receiving terminal node message;
Described sender node also is used for when the NAK stage of this time slot i receives the NAK message of NAK message or conflict, in the next one is self distributed time slot j, continues to carry out describedly sending the operation that the request RTS stage sends the RTS message.
11. a sender node is characterized in that, this sender node comprises: RTS packet sending unit, NTS message receiving element and business datum transmitting element; At broadcasting service,
Described RTS packet sending unit is used for being this sender node distributed time slot i, is sending the request RTS stage to its neighbors broadcast transmission RTS message; When the NTS message that receives in the NTS stage from arbitrary described neighbors was negated in the transmission of this time slot i, the RTS stage that at the next one is this sender node distributed time slot j was to its neighbors broadcast transmission RTS message at described NTS message receiving element;
Described NTS message receiving element is used for receiving the NTS message in the NTS stage of this time slot i;
Described business datum transmitting element is used at described NTS message receiving element sending business datum in the transfer of data DATA stage of this time slot i when the NTS stage of time slot i does not receive the NTS message.
12. sender node according to claim 11, it is characterized in that, described RTS packet sending unit also is used for, negates the NTS message that receives in the NTS stage when clashing at described NTS message receiving element in the transmission of this time slot i, is RTS stage of this sender node distributed time slot j to send the RTS message at the next one.
13. sender node according to claim 11 is characterized in that, this sender node also comprises: NAK message receiving element is used for receiving the NAK message in the bust this response NAK stage of described time slot i;
Described RTS packet sending unit also is used at described NAK message receiving element when the NAK stage of this time slot i receives the NAK message of NAK message or conflict, is RTS stage of this sender node distributed time slot j to send the RTS message at the next one.
14. a receiving terminal node is characterized in that, this receiving terminal node comprises: RTS message receiving element and NTS packet sending unit; At broadcasting service,
Described RTS message receiving element is used for distributing to the time slot i of sender node, receives the RTS message in the transmission request RTS stage;
Described NTS packet sending unit, be used at described RTS message receiving element when the RTS stage of time slot i does not successfully receive the RTS message, in the transmission of this time slot i negates that the NTS stage is to the neighbors broadcast transmission NTS of receiving terminal node message, forbid that sender node sends business datum at this time slot i, if when the RTS stage of time slot i successfully receives the RTS message, do not send the NTS message in the NTS stage of this time slot i at described RTS message receiving element.
15. receiving terminal node according to claim 14 is characterized in that, this receiving terminal node also comprises: business datum receiving element and NAK packet sending unit;
Described business datum receiving element is used for receiving business datum in the transfer of data DATA stage of described time slot i;
Described NAK packet sending unit, be used for described business datum receiving element when the DATA stage of time slot i does not successfully receive business datum, the bust this response NAK stage at described time slot i sends the NAK message, if when the DATA stage of time slot i successfully receives business datum, do not send the NAK message in the NAK stage of described time slot i at described business datum receiving element.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101953870A CN101465797B (en) | 2007-12-17 | 2007-12-17 | Data transmission method, system, sending terminal node and receiving terminal node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101953870A CN101465797B (en) | 2007-12-17 | 2007-12-17 | Data transmission method, system, sending terminal node and receiving terminal node |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101465797A CN101465797A (en) | 2009-06-24 |
| CN101465797B true CN101465797B (en) | 2011-07-06 |
Family
ID=40806170
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007101953870A Expired - Fee Related CN101465797B (en) | 2007-12-17 | 2007-12-17 | Data transmission method, system, sending terminal node and receiving terminal node |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101465797B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101742559B (en) * | 2009-12-04 | 2012-12-05 | 西安电子科技大学 | Parallel RTS (remote terminal system) processing multiple access method supporting MIMO (multiple input multiple output) in ad hoc network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1507704A (en) * | 2001-04-09 | 2004-06-23 | ����ɭ�绰�ɷ�����˾ | Instantaneeous joint transmit power control and link adaptation for RTS/CTS based channel access |
| WO2005039225A1 (en) * | 2003-10-20 | 2005-04-28 | Thomson Licensing | Method of communication in a wireless communication network, corresponding station and network |
-
2007
- 2007-12-17 CN CN2007101953870A patent/CN101465797B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1507704A (en) * | 2001-04-09 | 2004-06-23 | ����ɭ�绰�ɷ�����˾ | Instantaneeous joint transmit power control and link adaptation for RTS/CTS based channel access |
| WO2005039225A1 (en) * | 2003-10-20 | 2005-04-28 | Thomson Licensing | Method of communication in a wireless communication network, corresponding station and network |
Non-Patent Citations (2)
| Title |
|---|
| 张光辉等."多跳 Ad hoc网络中支持MIMO的拓扑未知预约时分多址接入协议".《电子与信息学报》.2006,第28卷(第5期), |
| 顾燕等."Ad Hoc网络中一种新的双信道MAC协议及其性能分析".《应用科学学报》.2006,第24卷(第5期), |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101465797A (en) | 2009-06-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Shan et al. | Distributed cooperative MAC for multihop wireless networks | |
| KR101170404B1 (en) | Distributed resource reservation in a wireless adhoc network | |
| US7570921B2 (en) | Systems and methods for improving range for multicast wireless communication | |
| CN101714914B (en) | Wireless communications method and device | |
| US8693414B2 (en) | Multi-user transmission method, multiple input multiple output transmission system using the same, scheduling method and access point using the same for scheduling simultaneous transmission | |
| CN101743716B (en) | Establishment of reliable multicast/broadcast in a wireless network | |
| EP2150089B1 (en) | System and method using multiple request to send (rts) messages to enhance wireless communication resource allocation | |
| CN101366197A (en) | Method of cooperatively relaying data in cellular networks for a broadcast multicast services | |
| CN101919295B (en) | Method of wireless data transmission | |
| CN102771060A (en) | Method for recovering a frame that failed to be transmitted in a mu-mimo based wireless communication system | |
| WO2011079552A1 (en) | Message retransmission method for improving multicast efficiency in cellular system | |
| CN101803232A (en) | Message coding in a relayed communications network | |
| KR101467844B1 (en) | Method for transmitting data in a relay system and system therefor | |
| CN101199142B (en) | Apparatus and method for transmitting/receiving broadcast data in a mobile communication system | |
| CN102932866A (en) | Opportunistic routing mechanism applicable to multi-radio-frequency multi-channel Ad hoc network | |
| CN102783058A (en) | Enabling simultaneous transmissions in wireless networks | |
| US8537693B2 (en) | Multicast scheduling systems and methods for leveraging cooperation gains in relay networks | |
| CN101478318B (en) | Broadcast station collaborative communication method in ultra short wave Ad Hoc network | |
| CN102421068A (en) | Grouping-based wireless communication | |
| CN101465797B (en) | Data transmission method, system, sending terminal node and receiving terminal node | |
| CN102474339B (en) | Relaying node, time division duplex communication system and communication method | |
| Lee et al. | A cooperative TDMA MAC protocol using dynamic slot assignment scheme | |
| JPWO2010146625A1 (en) | Communication device | |
| CN1839636B (en) | Methods and apparatus of transmitting user data using traffic channels | |
| Shariatmadari et al. | Statistical analysis of downlink transmissions for ultra-reliable low-latency communications |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110706 Termination date: 20131217 |