CN106034081B - A kind of transmission control method in D2D cast communication - Google Patents
A kind of transmission control method in D2D cast communication Download PDFInfo
- Publication number
- CN106034081B CN106034081B CN201510104443.XA CN201510104443A CN106034081B CN 106034081 B CN106034081 B CN 106034081B CN 201510104443 A CN201510104443 A CN 201510104443A CN 106034081 B CN106034081 B CN 106034081B
- Authority
- CN
- China
- Prior art keywords
- forwarding
- multicast message
- multicast
- node
- group
- 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
Abstract
The present invention proposes that the transmission control method in a kind of D2D cast communication includes: that D2D UE receives multicast message, for affiliated group of the multicast message, is periodically turned on multicast forwarding study mechanism, the period is known as multicast forwarding learning cycle；The D2D UE determines whether that the multicast message to group belonging to the multicast message is forwarded in the multicast forwarding learning cycle.
Description
Technical field
The present invention relates to the transmission control methods in D2D communication more particularly to a kind of D2D cast communication.
Background technique
D2D (Device to Device) in the related technology, not yet provides the concrete scheme that multicast forwarding uses at present, because
This is by taking technical solution common in current wireless self-organization network as an example.Communication mode main for multicast in ad hoc network at present
After sending multicast packet for source node, the header of neighbors parsing multicast packet simultaneously therefrom obtains group number, if neighbors category
In corresponding group of the cast communication, then the multicast packet is received and parsed through, and be forwarded；Otherwise it is only forwarded, does not parse
The multicast packet.Remaining node in network takes identical processing mode after receiving the multicast packet of forwarding, to the data
Grouping is forwarded without exception, and judges whether this node parses multicast packet according to group number, realizes that multicast packet can be with this
The whole network realizes the propagation of data grouping in a manner of broadcasting flooding, and reduces useless unpacking time by selectively parsing data
Number.
When multicast packet is propagated in the form of broadcasting flooding, since node unconditionally turns multicast packet
Hair is likely to result in network and there are a large amount of useless forwarding packets, leads to the serious waste of interface-free resources.Further, since node
After sending a multicast message, all neighbors can be all forwarded it, cause to occur within one shorter time big
The forwarding packet in nearby sphere is measured, it is possible that more serious collision, influences the quality of data receiver.
Summary of the invention
In view of the above-mentioned problems, the present invention proposes that the transmission control method in a kind of D2D cast communication includes:
D2D UE receives multicast message, for affiliated group of the multicast message, is periodically turned on multicast forwarding learning machine
System, the period are known as multicast forwarding learning cycle；The D2D UE determines whether pair in the multicast forwarding learning cycle
The multicast message organized belonging to the multicast message is forwarded.
Further, described to determine to include: in each multicast forwarding learning cycle, before the D2D UE is to the group
Several multicast messages are forwarded, and listen to neighbors to the forwarding situation of the multicast message, record the forwarding of neighbors
Whether belong to and is triggered by this node；If belonging to the neighbors forwarding triggered by this node is more than predetermined threshold, the D2D
UE continues to forward this group of multicast message in current multicast forwarding learning cycle；Otherwise, the D2D UE is forwarded in current multicast
This group of multicast message is no longer forwarded in learning cycle.
Preferably, the multicast message of the forwarding at least carries the sequence number and hop count of the multicast message, the sequence
Number for identifying multicast message content, the hop count in the multicast message of D2D UE itself forwarding is the jump in former message
Number+1.Further, whether the forwarding of the neighbors belongs to be triggered by this node and be judged by the hop count, specifically includes:
If the hop count carried in the multicast message of neighbors forwarding is equal to the hop count+1 carried in the multicast message of this node forwarding,
The forwarding for determining the neighbors is triggered by this node, be otherwise determined as being triggered by this node.
Preferably, when the D2D UE forwards the multicast message, the resource of forwarding, the jump are used for according to hop count selection
Several corresponding relationships with resource are obtained according to system intialization resource policy.Further, whether the forwarding of the neighbors belongs to
Resource judgment by the triggering of this node according to neighbors for forwarding, specifically includes: if neighbors forwarding multicasting message uses
The corresponding hop count of resource be equal to the corresponding hop count+1 of resource that uses of this node forwarding multicasting message, then determine the neighbors
Forwarding be to be triggered by this node, be otherwise determined as being triggered by this node.
Preferably, the multicast message of the forwarding at least carries the sequence number and upper hop node ID of the multicast message,
The sequence number is for identifying multicast message content.Further, whether the forwarding of the neighbors belongs to and is triggered by this node
Judged by the upper hop node ID, if upper hop node ID is described node in the multicast message of neighbors forwarding
ID then determines that the forwarding of the neighbors is the triggering of this node, be otherwise determined as being triggered by this node.
Preferably, further includes: after belonging to the neighbors variation of the group in a jump neighbor node table of the D2D UE, institute
D2D UE is stated to reset this group of multicast message number forwarded in this period or reset current multicast forwarding learning cycle；Or,
It is described after being not belonging to the group in a jump neighbor node table of the D2D UE but temporarily becoming the neighbors variation of group relaying
D2D UE resets this group of multicast message number forwarded in this period or resets current multicast forwarding learning cycle；Or, working as
The one of the D2D UE jumps in neighbor node table after any neighbors variation, and the D2D UE resets this forwarded in this period
Group multicast message number resets current multicast forwarding learning cycle.
Preferably, further includes: when the sending node for removing the multicast message in a jump neighbor node table of the D2D UE
Except when other group nodes are not present: the D2D UE, which carries this additional group and relays UE, is arranged in intermediate region, formation group
Interior physical path, then forward the multicast message；Or it attempts to forward the multicast message by the relaying UE outside group.Into one
Step, described to attempt to forward the multicast message by different groups of relaying UE to include following steps: the D2D UE is to difference
The relaying UE of group, which is issued, temporarily enters a group request, and statement needs it as interim multicast relay forwarding node in request；If institute
It states different groups of relaying UE and agrees to the request, then the D2D UE forwards the multicast message to the relaying of the different groups
The relaying UE of UE, the different groups relay to other group nodes；If the relaying UE of the different groups refuses the request,
Then the D2D UE does not forward the multicast message.Further include: after the cast communication, agree to the request different groups
Relaying UE exit the group, or be retained in the relaying identity of the group.The relaying UE of the different groups agrees to sentencing for the request
Disconnected factor includes: that one jumps the other group nodes existed in addition to the request sending node in neighbor node table；Or one
There are other group nodes and self-ability in addition to the request sending node in jump neighbor node table can be competent at forwarding
Task.
Further, when the D2D UE is the source node of cast communication, the source node sends the group of itself always
Broadcast message；Or source node judges whether to continue to send the multicast message of itself according to the result that multicast forwarding learns.
Preferably, to having determined that the forwarding for certain multicast message to be forwarded handles in the following way: receiving for the first time
It is forwarded when the multicast message, hereafter receives identical multicast message again without forwarding；Or the multicast is received every time
It is forwarded when message, until the hop count to the multicast message reaches max-forwards number；Or it receives for the first time
When to the multicast message, judges whether to forward according to sending probability p1, hereafter receive the multicast message again according to hair
Probability p 2 is sent to judge whether to forward.
The present invention realizes to the control of flooding range, subtracts by introducing a kind of controlling mechanism to forwarding in cast communication
The number of few unnecessary forwarding, and improve collision situation when being flooded in the prior art.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is this hair
Bright some embodiments for those of ordinary skill in the art without creative efforts, can be with root
Other attached drawings are obtained according to these attached drawings.
Fig. 1 is the multicast forwarding study mechanism process flow diagram in proposition method of the present invention；
Fig. 2 is the topological structure schematic diagram of Example 1 and Example 2 of the present invention；
Fig. 3 is the topological structure schematic diagram of the embodiment of the present invention 3.
Specific embodiment
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is
A part of the embodiment of the present invention, instead of all the embodiments；It should be noted that in the absence of conflict, in the application
Embodiment and embodiment in feature can be combined with each other.Based on the embodiments of the present invention, those of ordinary skill in the art
Every other embodiment obtained without creative efforts, shall fall within the protection scope of the present invention.
The present invention proposes that the transmission control method in a kind of D2D cast communication includes: that D2D UE receives multicast message, for
Affiliated group of the multicast message is periodically turned on multicast forwarding study mechanism, and the period is known as multicast forwarding learning cycle；
The D2D UE determines whether to carry out the multicast message of group belonging to the multicast message in the multicast forwarding learning cycle
Forwarding.
Further, described to determine to include: in each multicast forwarding learning cycle, before the D2D UE is to the group
Several multicast messages are forwarded, and listen to neighbors to the forwarding situation of the multicast message, record the forwarding of neighbors
Whether belong to and is triggered by this node；If belonging to the neighbors forwarding triggered by this node is more than predetermined threshold, the D2D
UE continues to forward this group of multicast message in current multicast forwarding learning cycle；Otherwise, the D2D UE is forwarded in current multicast
This group of multicast message is no longer forwarded in learning cycle.Please refer to attached drawing 1.
Preferably, the multicast message of the forwarding at least carries the sequence number and hop count of the multicast message, the sequence
Number for identifying multicast message content, the hop count in the multicast message of D2D UE itself forwarding is the jump in former message
Number+1.Further, whether the forwarding of the neighbors belongs to be triggered by this node and be judged by the hop count, specifically includes:
If the hop count carried in the multicast message of neighbors forwarding is equal to the hop count+1 carried in the multicast message of this node forwarding,
The forwarding for determining the neighbors is triggered by this node, be otherwise determined as being triggered by this node.
Alternatively, being used for the resource of forwarding, the hop count according to hop count selection when the D2D UE forwards the multicast message
It is obtained with the corresponding relationship of resource according to system intialization resource policy.Further, the forwarding of the neighbors whether belong to by
Resource judgment of this node triggering according to neighbors for forwarding, specifically includes: if what neighbors forwarding multicasting message used
The corresponding hop count of resource is equal to the corresponding hop count+1 of resource that this node forwarding multicasting message uses, then determines the neighbors
Forwarding is triggered by this node, be otherwise determined as being triggered by this node.
Alternatively, the multicast message of the forwarding at least carries the sequence number and upper hop node ID of the multicast message, institute
Sequence number is stated for identifying multicast message content.Further, whether the forwarding of the neighbors belongs to logical by the triggering of this node
The upper hop node ID judgement is crossed, if upper hop node ID is described node ID in the multicast message of neighbors forwarding,
The forwarding for then determining the neighbors is the triggering of this node, be otherwise determined as being triggered by this node.
The above method can also include the following steps: as the neighbour for belonging to the group in a jump neighbor node table of the D2D UE
Node or be not belonging to the group but temporarily become the group relaying neighbors variation after, the D2D UE, which was reset in this period, have been turned
This group of multicast message number of hair resets current multicast forwarding learning cycle；It can certainly be arranged to work as the D2D UE
One jump in neighbor node table after any neighbors variation, D2D UE resets this group of multicast message number forwarded in phase this week
Mesh resets current multicast forwarding learning cycle.
In the above method for D2D UE one jump neighbor node table in addition to the sending node of the multicast message not
There are when other group nodes: the D2D UE can carry additional this group relaying UE and be arranged in intermediate region, in formation group
Physical path, then forward the multicast message.Alternatively, attempting to forward the multicast message by the relaying UE outside group.It is described
Attempt through different groups of the relaying UE forwarding multicast message to include following steps: the D2D UE is to different groups of relaying UE
It issues and temporarily enters a group request, statement needs it as interim multicast relay forwarding node in request；If the different groups
It relays UE and agrees to the request, then the D2D UE forwards the multicast message to the relaying UE of the different groups, the difference
The relaying UE of group relays to other group nodes；If the relaying UE of the different groups refuses the request, the D2D
UE does not forward the multicast message.Further include: after the cast communication, agree to that the relaying UE of the different groups of the request is moved back
The group out, or it is retained in the relaying identity of the group.The relaying UE of the different groups agrees to that the factor of judgment of the request includes:
One jumps the other group nodes existed in addition to the request sending node in neighbor node table；Or one jumps neighbor node table
The other group nodes and self-ability of middle presence in addition to the request sending node can be competent at forwarding task.
When the D2D UE is the source node of cast communication, the source node sends the multicast message of itself always；Or
Source node judges whether to continue to send the multicast message of itself according to the result that multicast forwarding learns.
In the above method, the forwarding for having determined that certain multicast message to be forwarded can be handled in the following way: the
It is forwarded when once receiving the multicast message, hereafter receives identical multicast message again without forwarding；Or it receives every time
It is forwarded when to the multicast message, until the hop count to the multicast message reaches max-forwards number；
It when can also receive the multicast message for the first time, judges whether to forward according to sending probability p1, hereafter receive again described
Multicast message judges whether to forward according to sending probability p2.
The present invention is suitable under certain representational special screnes, by introducing one kind to forwarding in cast communication
Controlling mechanism realizes the control to flooding range, reduces the number of unnecessary forwarding, and improve and flooded in the prior art
When collision situation.
One embodiment of the invention includes the following steps:
1, when D2D UE receives multicast message, triggering is directed to the periodical multicast forwarding of the corresponding communication set of the multicast message
Study mechanism；
2, it is triggered after periodical multicast forwarding study mechanism, D2D UE is directed to the group, is periodically made whether to forward
The judgement of the multicast message of the group, the time interval between determining twice is known as a multicast forwarding learning cycle, in each multicast
The end of learning cycle is forwarded to carry out the above judgement；
3, after each multicast forwarding learning cycle starts, D2D UE disappears to the multicast of the preceding N item group in the period
Breath is forwarded；
The multicast message of forwarding at least carries multicast message sequence number and hop count: the sequence number of multicast message, for distinguishing
The multicast message content of the content of multicast message, different sequence numbers is similar and different, the multicast message content phase of same sequence number
Together, the sequence number of multicast message is not changed when forwarding；The hop count of multicast message, after D2D UE receives certain multicast message, itself
It, should be in the multicast message of itself forwarding by the hop count+1 in former message when being forwarded to it.
Wherein the multicast message of the preceding N item group refers to the different multicast message of N sequence number；Exist for this node
The case where identical certain multicast message of sequence number is repeatedly forwarded in one time window only forwards a calculating by this node；
When node forwarding multicasting message, the resource for transmission can be selected independently；The resource of different node selections can
It can be different, it is also possible to identical (namely time domain/frequency domain/time-frequency collision occurs).
4, after forwarding multicasting message, D2D UE should listen to neighbors to the forwarding situation once again of the multicast message, and record is adjacent
Node is triggered to whether the forwarding of the multicast message belongs to by this node；
Judged according to the hop count carried in the multicast message of neighbors forwarding, when the multicast message that neighbors forwards
Hop count be exactly this node transmission multicast message in carry hop count+1 when, it is believed that belong to triggered by this node it is forwarded over
Journey, otherwise it is assumed that being not belonging to；Alternatively,
Or upper hop node ID is carried when all node forwarding multicasting message, D2D UE listens to the multicast of neighbors forwarding
Think to belong to the repeating process triggered by this node when upper hop node ID is this node ID in message, otherwise it is assumed that being not belonging to；
5, after forwarded at least multicast message of the N item group in the multicast forwarding learning cycle: if above N
In secondary forwarding, after having M times/more than M times/less than M times forwarding multicasting message, the repeating process of neighbors will not be triggered: current group
Broadcast the multicast message that the group is no longer forwarded in forwarding learning cycle；Otherwise forwarding is remained in current multicast forwarding learning cycle
The multicast message of the group.
6, when D2D UE one jump neighbor node table change, or at least one jump neighbor node table in belong to the group
After neighbors changes, it may proceed as follows: the number of the multicast message for the group that resetting has forwarded, since 0
Again it counts；And/or the multicast forwarding learning cycle that resetting is current.
Another embodiment of the invention is similar with above scheme, and difference is:
1, when D2D UE forwarding multicasting message, the resource for forwarding is no longer selected independently, but is selected according to hop count
Resource for forwarding:
The node of identical forwarding hop count uses identical resource, is sent in the form of collaboration diversity, the message of transmission
Content is identical (namely only to be carried the content of the multicast message received, may carry hop count, and should not at least carry hair
Send the ID of node)；The node of difference forwarding hop count uses different resources；The resource used between different hop counts may be in time domain
On be orthogonal；
2, the multicast message forwarded still carries sequence number, but can not carry hop count, what hop count can be used according to forwarding
Resource judgment.
In this case, the message that D2D UE is received may be multiple nodes while forward, and in this node physics
Layer passes through combined multicast message, and sending node ID will not be carried in the multicast message, therefore can not judge upper hop node；
So under this scenario, the D2D UE only passes through hop count (whether+1) and judges whether to trigger the repeating process of neighbors, and
Do not judged by upper hop node ID.
For above each scheme, node is if it have been determined that be forwarded certain multicast message of certain group, it may be considered that
Following pass-through mode: being forwarded when receiving the multicast message of the sequence number for the first time, hereafter receives the multicast of same sequence number
Message is without forwarding；Or be all forwarded when receiving the multicast message of the sequence number every time, it is considered as to the blind of the multicast message
It retransmits；Or it judges whether to forward by sending probability p1 when receiving the multicast message of the sequence number for the first time；Hereafter it receives every time
To the sequence number multicast message when, judge whether to forward by sending probability p2, wherein p1, p2 can be system pre-configuration
Empirical value, can also be obtained according to the actual situation using certain algorithm.
In addition, the multicast message of itself can be sent always without by multicast when source node of the node as cast communication
Forward the limitation of the result of study；It can also judge whether that the multicast for continuing to send itself disappears according to the result that multicast forwarding learns
Breath.
The present invention is suitable for the scene that most of node can be transferred through the relaying realization communication of group interior nodes, for the scene
Under fraction with this organize other nodes exceed communication range node, take two schemes can with the other nodes of this group lead to
Letter: it is requested to become the relaying UE that this group communicates to other groups of UE；By way of additionally arranging this group of relay node, adjustment
The topological structure of communication network, all nodes can communicate with each other in realization group.
Above-mentioned each scheme is illustrated below by specific embodiment.
Embodiment 1
The multicast forwarding that the embodiment uses controls corresponding the first string, and topological structure please refers to Fig. 2.It is assumed that for more
Secondary repetition receives the multicast message of same sequence number, takes the processing side being forwarded when only receiving for the first time in the embodiment
Formula.Multicast message carries upper hop node ID.
1, when the source node for certain cast communication that A1 is communication set A, A1 starts periodical multicast study mechanism, sends the
One multicast message；
2, A2, A3, A4 receive the multicast message of A1, A2, A3, and A4 starts periodical multicast study mechanism, forwards first
Multicast message；
If a) A3 first forwards the multicast message of A1, subsequent A3 receives first multicast message of A4 forwarding, it is found that this disappears
Upper hop node is not A3 but A1 in breath, it is believed that the forwarding of A4 is not belonging to be triggered by A3；
B) similarly, if A4 first forwards the multicast message of A1, A4 thinks that the forwarding of A3 is not belonging to be triggered by A4；
C) A1 receives A2, and the multicast message of A3, A4 forwarding finds that upper hop node is A1 in message, it is believed that A2, A3, A4
Forwarding belong to and triggered by A1；
3, A5 receives the multicast message of A4, and A5 starts periodical multicast study mechanism, forwards first multicast message；A4 is received
The multicast message forwarded to A5 finds that upper hop node is A4 in the message, it is believed that the forwarding of A5 belongs to be triggered by A4；
4, A1 sends Article 2 multicast message, repeats step 1~3, sends Article 3 multicast message ..., sends the N articles group
Broadcast message；A2~A5 is forwarded study；
5, A1~A5 forwarded N multicast message in the multicast learning cycle, determine whether answer within the period
Forward remaining multicast message:
A) A1, A4 have sent N multicast message within the period, wherein the message of the repeating process of neighbors can be triggered
The big Mr. Yu's threshold value of quantity, A1, A4 keep forwarding within the period other multicast messages of the group；
B) A2, A3, A5 have sent N multicast message within the period, wherein the repeating process of neighbors can be triggered
Message number is less than or equal to certain threshold value, A2, A3, and A5 does not forward other multicast messages of the group within the period；
In this embodiment, (each multicast forwarding learning cycle) end-state is that A1 sends multicast message, and A4 will turn
Send out the multicast message of A1.
Embodiment 2: the present embodiment and implementation 1 are essentially identical, and difference is that multicast message carries forwarding hop count.In embodiment
In 1 step 2 and step 3, there is following change:
1, A2, A3, A4 receive the multicast message (carrying hop count is the first jump) of A1, and A2, A3, A4 start periodical multicast
Habit mechanism forwards first multicast message (carrying hop count is the second jump)；
If a) A3 first forwards the multicast message of A1, subsequent A3 receives first multicast message of A4 forwarding, it is found that this disappears
The hop count of breath is identical as the message hop count that this node forwards, and is the second jump, it is believed that the forwarding of A4 is not belonging to be triggered by A3；
B) similarly, if A4 first forwards the multicast message of A1, A4 thinks that the forwarding of A3 is not belonging to be triggered by A4；
C) A1 receives A2, the multicast message of A3, A4 forwarding, and discovery message hop count is the message hop count+1 of this node, it is believed that
The forwarding of A2, A3, A4 belong to be triggered by A1；
2, A5 receives the multicast message of A4, and A5 starts periodical multicast study mechanism, first multicast message is forwarded (to carry
Hop count is third jump)；A4 receives the multicast message of A5 forwarding, it is found that the message hop count is the message hop count+1 of this node, it is believed that
The forwarding of A5 belongs to be triggered by A4.
Embodiment 3
Please refer to attached drawing 3.A1 ... A6 is D2D UE in figure, belongs to same communication set A.B1 is D2D UE, is not belonging to lead to
Letter group A.B1 is the neighbors of A5 and A6.A6 does not belong to a jump neighbors of communication set A, namely other sections with communication set A
Point is physically segregated.
Under the scene, A6 can jump neighbors B1 to itself one and issue interim relay request, and B1 agrees to the request simultaneously
It is interim that communication set A is added.When A1 sends cast communication as source node, it is A6 forwarding multicasting that B1, which can be used as interim relay node,
Message.
By the above various embodiments as can be seen that the limitation to flooding forwarding range in cast communication can be achieved in the present invention,
Useless flooding hop count is reduced, the probability to collide when being forwarded is reduced, to promote communication performance and save money
Source.
Those of ordinary skill in the art will appreciate that: realize that all or part of the steps of above method embodiment can pass through
The relevant hardware of program instruction is completed, and program above-mentioned can be stored in a computer readable storage medium, the program
When being executed, step including the steps of the foregoing method embodiments is executed；And storage medium above-mentioned includes: ROM, RAM, magnetic disk or light
The various media that can store program code such as disk.
Finally, it should be noted that the above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although
Present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that: it still may be used
To modify the technical solutions described in the foregoing embodiments or equivalent replacement of some of the technical features；
And these are modified or replaceed, technical solution of various embodiments of the present invention that it does not separate the essence of the corresponding technical solution spirit and
Range.
Claims (14)
1. the transmission control method in a kind of D2D cast communication characterized by comprising
D2D UE receives multicast message, for affiliated group of the multicast message, is periodically turned on multicast forwarding study mechanism, institute
Stating the period is known as multicast forwarding learning cycle；
The D2D UE determines whether the multicast message to group belonging to the multicast message in the multicast forwarding learning cycle
It is forwarded；
The judgement includes: in each multicast forwarding learning cycle, and the D2D UE disappears to several multicasts before the group
Breath is forwarded, and listens to neighbors to the forwarding situation of the multicast message, and whether the forwarding for recording neighbors belongs to by this
Node triggering；If belonging to the neighbors forwarding triggered by this node is more than predetermined threshold, the D2D UE is in current multicast
Continue to forward this group of multicast message in forwarding learning cycle；Otherwise, the D2D UE is forwarded in learning cycle not in current multicast
This group of multicast message is forwarded again.
2. disappearing the method according to claim 1, wherein the multicast message of the forwarding at least carries the multicast
The sequence number and hop count of breath, the sequence number is for identifying multicast message content, the multicast message of D2D UE itself forwarding
In the hop count be hop count+1 in former message.
3. according to the method described in claim 2, it is characterized in that, whether the forwarding of the neighbors belongs to is triggered by this node
Judged by the hop count, specifically included: if the hop count carried in the multicast message of neighbors forwarding is forwarded equal to this node
Multicast message in the hop count+1 that carries, then determine that the forwarding of the neighbors is triggered by this node, be otherwise determined as be not
It is triggered by this node.
4. the method according to claim 1, wherein further include: when the D2D UE forwards the multicast message,
The corresponding relationship of resource according to hop count selection for forwarding, the hop count and resource is obtained according to system intialization resource policy.
5. according to the method described in claim 4, it is characterized in that, whether the forwarding of the neighbors belongs to is triggered by this node
Resource judgment according to neighbors for forwarding, specifically includes: if the resource that neighbors forwarding multicasting message uses is corresponding
Hop count is equal to the corresponding hop count+1 of resource that this node forwarding multicasting message uses, then determines that the forwarding of the neighbors is by this
Node triggering, be otherwise determined as being triggered by this node.
6. disappearing the method according to claim 1, wherein the multicast message of the forwarding at least carries the multicast
The sequence number and upper hop node ID of breath, the sequence number is for identifying multicast message content.
7. according to the method described in claim 6, it is characterized in that, whether the forwarding of the neighbors belongs to is triggered by this node
Judged by the upper hop node ID, if upper hop node ID is described node in the multicast message of neighbors forwarding
ID then determines that the forwarding of the neighbors is the triggering of this node, be otherwise determined as being triggered by this node.
8. method described in any one according to claim 1~7, which is characterized in that further include:
After belonging to the neighbors variation of the group in a jump neighbor node table of the D2D UE, the D2D UE resets this period
The current multicast forwarding learning cycle of this group of multicast message number or resetting inside forwarded；Or,
After being not belonging to the group in a jump neighbor node table of the D2D UE but temporarily becoming the neighbors variation of group relaying,
The D2D UE resets this group of multicast message number forwarded in this period or resets current multicast forwarding learning cycle；
Or,
After the one of the D2D UE jumps any neighbors variation in neighbor node table, the D2D UE, which was reset in this period, have been turned
This group of multicast message number of hair resets current multicast forwarding learning cycle.
9. method described in any one according to claim 1~7, which is characterized in that further include: when a jump of the D2D UE
When other group nodes are not present in neighbor node table in addition to the sending node of the multicast message:
The D2D UE carries additional this group relaying UE and is arranged in intermediate region, the physical path in formation group, then forwards institute
State multicast message；Or it attempts to forward the multicast message by different groups of relaying UE.
10. according to the method described in claim 9, it is characterized in that, described in the relaying UE forwarding attempted by different groups
Multicast message includes following steps:
The D2D UE temporarily enters a group request to different groups of relaying UE sending, and statement needs it as interim multicast in request
Relay forwarding node；
If the relaying UE of the different groups agrees to the request, the D2D UE forwards the multicast message to the difference
The relaying UE, the relaying UE of the different groups of group relay to other group nodes；
If the relaying UE of the different groups refuses the request, the D2D UE does not forward the multicast message.
11. according to the method described in claim 10, it is characterized by further comprising:
After the cast communication, agree to that the relaying UE of the different groups of the request exits the group, or be retained in the group
Relay identity.
12. according to the method described in claim 10, it is characterized in that, the relaying UE of the different groups agrees to sentencing for the request
Disconnected factor includes:
One jumps the other group nodes existed in addition to the request sending node in neighbor node table；Or,
There are other group nodes in addition to the request sending node in one jump neighbor node table and self-ability can
Competent forwarding task.
13. method described in any one according to claim 1~7, which is characterized in that further include: when the D2D UE is group
When broadcasting the source node of communication, the source node sends the multicast message of itself always；Or source node learns according to multicast forwarding
As a result judge whether to continue to send the multicast message of itself.
14. method described in any one according to claim 1~7, which is characterized in that further include: it to be forwarded to having determined that
The forwarding of certain multicast message is handled in the following way:
It is forwarded when receiving the multicast message for the first time, hereafter receives identical multicast message again without forwarding；Or,
It is forwarded when receiving the multicast message every time, until reaching max-forwards to the hop count of the multicast message
Until number；Or,
When receiving the multicast message for the first time, judges whether to forward according to sending probability p1, hereafter receive described group again
Message is broadcast to judge whether to forward according to sending probability p2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510104443.XA CN106034081B (en) | 2015-03-10 | 2015-03-10 | A kind of transmission control method in D2D cast communication |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510104443.XA CN106034081B (en) | 2015-03-10 | 2015-03-10 | A kind of transmission control method in D2D cast communication |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106034081A CN106034081A (en) | 2016-10-19 |
| CN106034081B true CN106034081B (en) | 2019-04-05 |
Family
ID=57150767
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510104443.XA Expired - Fee Related CN106034081B (en) | 2015-03-10 | 2015-03-10 | A kind of transmission control method in D2D cast communication |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106034081B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1483266A (en) * | 2000-09-06 | 2004-03-17 | ŵ�������繫˾ | Multicast route in AD-HOC network |
| CN103428642A (en) * | 2013-07-16 | 2013-12-04 | 北京邮电大学 | Intra-cluster device-to-device (D2D) multicast method based on relay |
| WO2014042345A1 (en) * | 2012-09-17 | 2014-03-20 | Lg Electronics Inc. | Method and apparatus for performing harq operation in wireless communication system |
| CN104365035A (en) * | 2012-04-30 | 2015-02-18 | 英特尔公司 | An apparatus and method to enable device-to-device (D2D) communication in cellular networks |
-
2015
- 2015-03-10 CN CN201510104443.XA patent/CN106034081B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1483266A (en) * | 2000-09-06 | 2004-03-17 | ŵ�������繫˾ | Multicast route in AD-HOC network |
| CN104365035A (en) * | 2012-04-30 | 2015-02-18 | 英特尔公司 | An apparatus and method to enable device-to-device (D2D) communication in cellular networks |
| WO2014042345A1 (en) * | 2012-09-17 | 2014-03-20 | Lg Electronics Inc. | Method and apparatus for performing harq operation in wireless communication system |
| CN103428642A (en) * | 2013-07-16 | 2013-12-04 | 北京邮电大学 | Intra-cluster device-to-device (D2D) multicast method based on relay |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106034081A (en) | 2016-10-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Soua et al. | Wave: a distributed scheduling algorithm for convergecast in IEEE 802.15. 4e TSCH networks | |
| US9231738B2 (en) | Communication method for relay node and next node of the relay node for network coding | |
| KR100664953B1 (en) | Method for multicast routing system and in mobile ad-hoc network environment | |
| JP5231634B2 (en) | Routing method between local peer groups (LPG) | |
| US9060386B2 (en) | Method of selecting relay mode in mobile ad-hoc network | |
| US9210045B2 (en) | Gravitational parent selection in directed acyclic graphs | |
| Pahlevani et al. | PlayNCool: Opportunistic network coding for local optimization of routing in wireless mesh networks | |
| JP2009260911A5 (en) | ||
| CN103118413A (en) | IPv6 (Internet protocol version 6) industrial wireless sensor network routing method based on definiteness scheduling | |
| Bhatia et al. | RD-TDMA: A randomized distributed TDMA scheduling for correlated contention in WSNs | |
| CN105072586B (en) | To the management method of the forwarding of broadcast message in embedded radio self-organizing network | |
| US8897158B2 (en) | Method and system for on-demand adaptation of packet time-to-live in time-slotted barrage relay networks | |
| CN112740729A (en) | Apparatus and method for autonomously configuring relay node apparatus in mesh network | |
| CN106034081B (en) | A kind of transmission control method in D2D cast communication | |
| CN106034289A (en) | Forwarding control method in D2D multicast communication | |
| CN104185268B (en) | A kind of slot synchronization algorithm suitable for ad hoc networking | |
| KR20070083027A (en) | Method for multicast routing using mpr set information | |
| CN106034359A (en) | Speaking right preemption method of cluster service in ad-hoc network | |
| EP3813311B1 (en) | On-demand table and route update after a node failure in a wireless network | |
| Prathviraj et al. | Lifetime aware MPR selection in OLSR for MANET | |
| Bhatia et al. | Dslr: A distributed schedule length reduction algorithm for wsns | |
| Xian et al. | An efficient ad hoc on-demand distance vector routing protocol | |
| Al-hamadani et al. | RAAODV: a reputation-aware AODV for mobile ad hoc networks | |
| Mahajan et al. | Energy Efficient Routing Protocols for Mobile Ad-Hoc Networks | |
| US11825386B2 (en) | Broadcast delivery techniques in a wireless network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| PP01 | Preservation of patent right | ||
| PP01 | Preservation of patent right |
Effective date of registration: 20191121 Granted publication date: 20190405 |
|
| PD01 | Discharge of preservation of patent | ||
| PD01 | Discharge of preservation of patent |
Date of cancellation: 20200710 Granted publication date: 20190405 |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190405 Termination date: 20200310 |