CN106034289A - Forwarding control method in D2D multicast communication - Google Patents

Forwarding control method in D2D multicast communication Download PDF

Info

Publication number
CN106034289A
CN106034289A CN201510104416.2A CN201510104416A CN106034289A CN 106034289 A CN106034289 A CN 106034289A CN 201510104416 A CN201510104416 A CN 201510104416A CN 106034289 A CN106034289 A CN 106034289A
Authority
CN
China
Prior art keywords
group
node
multicast message
relaying
request
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.)
Withdrawn
Application number
CN201510104416.2A
Other languages
Chinese (zh)
Inventor
周淼
孙鹏
戴维琴
俞岚
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Xinwei Telecom Technology Inc
Original Assignee
Beijing Xinwei Telecom Technology Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Xinwei Telecom Technology Inc filed Critical Beijing Xinwei Telecom Technology Inc
Priority to CN201510104416.2A priority Critical patent/CN106034289A/en
Publication of CN106034289A publication Critical patent/CN106034289A/en
Withdrawn legal-status Critical Current

Links

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention provides a forwarding control method in D2D multicast communication. The forwarding control method comprises the steps of generating and maintaining a 1-hop neighborhood node list by D2D UE through a periodical D2D discovery process, wherein the neighborhood node list at least comprises a neighborhood node ID and a set to which the neighborhood node belongs; and after the D2D UE receives multicast information, analyzing the set to which the multicast information belongs, and if other sets of nodes besides a multicast information transmitting node exist in the 1-hop neighborhood node list, forwarding the multicast information by the D2D UE.

Description

A kind of transmission control method in D2D cast communication
Technical field
The present invention relates to D2D communication, particularly relate to the transmission control method in a kind of D2D cast communication.
Background technology
At present in D2D (Device to Device) correlation technique, not yet provide the concrete of multicast forwarding use Scheme, as a example by therefore common in current wireless self-organization network technical scheme.At present in MANET for The main communication mode of multicast is that after source node sends multicast packet, its neighbors resolves the header of multicast packet And therefrom obtain group number, if neighbors belongs to the group that this cast communication is corresponding, then receive and parse through this multicast Data, and forward;The most only forward, do not resolve this multicast packet.Remaining node in network After receiving the multicast packet of forwarding, take identical processing mode, this packet forwarded without exception, And judge whether this node resolves multicast packet according to group number, realizing multicast packet with this can be at the whole network with extensively The mode broadcasting flooding realizes the propagation of packet, and reduces useless unpacking by resolving data selectively Number of times.
When multicast packet is propagated with the form of broadcast flooding, due to node unconditionally to multicast packet Forward, be likely to result in network and there is the most useless forwarding bag, cause the serious wave of interface-free resources Take.Additionally, due to after node sends a multicast message, it all can be forwarded by all of neighbors, Cause occurring the forwarding bag in a large amount of nearby sphere in one section of relatively short period of time, it is possible that the most serious Collision, affect the quality of data receiver.
Summary of the invention
For the problems referred to above, the present invention proposes the transmission control method in a kind of D2D cast communication, including: D2D UE, by periodic D2D discovery procedure, generates and safeguards a jumping neighbor node table;Described adjacent joint Point list at least includes group belonging to neighbors ID and neighbors;After D2D UE receives multicast message, point Analyse group belonging to described multicast message, if one is jumped in neighbor node table except the sending node of described multicast message Outside, there is also other this group node, the most described D2D UE forwards described multicast message.
Preferably, when a described jumping neighbor node table does not exists in addition to the sending node of described multicast message During other this group node, described D2D UE attempts forwarding described multicast message by the relaying UE of difference group. Specifically include: the relaying UE of difference group is sent and enters group request temporarily by described D2D UE, states in request Need it as interim multicast relay forwarding node;If the relaying UE of described different group agrees to described asking Asking, the most described D2D UE forwards described multicast message to the relaying UE of described different groups, described different groups Relaying UE relay to other this group node;If the relaying UE of described different group refuses described request, The most described D2D UE does not forward described multicast message.Further, after described cast communication terminates, agree to The relaying UE of the different groups of described request exits this group, or is retained in the relaying identity of this group.Wherein, The relaying UE of described different group agrees to that the factor of judgment of described request includes: one is jumped in neighbor node table and deposited At other this group node in addition to described request sending node;Or, one is jumped to exist in neighbor node table and is removed Other this group node and self-ability outside described request sending node can be competent at forwarding task.
Preferably, when a described jumping neighbor node table does not exists in addition to the sending node of described multicast message During other this group node, the most described D2D UE carries extra this group relaying UE and is arranged in zone line, Physical path in formation group, then forward described multicast message;Or do not forward described multicast message.
Preferably, also including: when the source node that described D2D UE is cast communication, no matter one jumps neighbour Whether there is other this group node in node listing, described source node all sends the multicast message of self to one Jump neighbors.Or, when the source node that described D2D UE is cast communication, if one jumps neighbors Without other this group node in list, the most described source node does not send the multicast message of self;Or described source node Attempt being forwarded the multicast message of self by the relaying UE of difference group;Or described source node carries extra basis Group relaying UE is arranged in zone line, the physical path in formation group, retransmits the multicast message of self.
Preferably, described forwarding is carried out in the following way: carry out when receiving described multicast message for the first time turning Send out, receive identical multicast message the most again and do not forward;Or all enter when receiving described multicast message every time Row forwards;Or when receiving described multicast message for the first time, judge whether to forward according to sending probability p1, Receive described multicast message the most again to judge whether to forward according to sending probability p2.
The method of the present invention can realize, to the restriction flooding forwarding scope in cast communication, reducing useless flooding Hop count, reduces the probability collided when forwarding, thus promotes communication performance and save resource.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below will be to enforcement In example or description of the prior art, the required accompanying drawing used is briefly described, it should be apparent that, retouch below Accompanying drawing in stating is some embodiments of the present invention, for those of ordinary skill in the art, is not paying On the premise of creative work, it is also possible to obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is that the present invention proposes transmission control method process chart;
Fig. 2 is the node topology schematic diagram of the embodiment of the present invention 1;
Fig. 3 is the node topology schematic diagram of the embodiment of the present invention 2.
Detailed description of the invention
For making the purpose of the embodiment of the present invention, technical scheme and advantage clearer, below in conjunction with the present invention Accompanying drawing in embodiment, is clearly and completely described the technical scheme in the embodiment of the present invention, it is clear that Described embodiment is a part of embodiment of the present invention rather than whole embodiments;It should be noted that In the case of not conflicting, the embodiment in the application and the feature in embodiment can be mutually combined.Based on Embodiment in the present invention, those of ordinary skill in the art are obtained under not making creative work premise Every other embodiment, broadly fall into the scope of protection of the invention.
Transmission control method in the D2D cast communication that the present invention proposes, including:
D2D UE, by periodic D2D discovery procedure, generates and safeguards a jumping neighbor node table;Described Neighbor node table at least includes group belonging to neighbors ID and neighbors;
After D2D UE receives multicast message, analyze group belonging to described multicast message, if one jumps neighbors In list in addition to the sending node of described multicast message, there is also other this group node, the most described D2D UE Forward described multicast message.If in one jumping neighbor node table in addition to the sending node of described multicast message There is not other this group node, described D2D UE can not forward described multicast message.Handling process Refer to accompanying drawing 1.
Should when a described jumping neighbor node table does not exist other in addition to the sending node of described multicast message During group node, it is also possible to use following several processing mode:
Mode one, described D2D UE attempt forwarding described multicast message by the relaying UE of difference group.Tool Body includes:
The relaying UE of difference group is sent and enters group request temporarily by described D2D UE, and in request, statement needs it As interim multicast relay forwarding node;
The relaying UE of difference group can be agreed to that request can also refuse request by described D2D UE, and it judges Factor includes: one jumps other this group joint existed in neighbor node table in addition to described request sending node Point;Or one is jumped in neighbor node table and be there is other this group node in addition to described request sending node also And self-ability can be competent at forwarding task (such as intensity of traffic etc. factor).
If agreeing to described request, the most described D2D UE forwards described multicast message in described different groups Continue UE, and the relaying UE of described different groups relays to other this group node.Further, described multicast After sign off, the relaying UE of different groups can select to exit this group, it is also possible to selects to be retained in this group Relaying identity.
If refusing described request, the most described D2D UE does not forward described multicast message.
Mode two, described D2D UE carry extra this group relaying UE and are arranged in zone line, formation group Interior physical path, then forward described multicast message.
When the source node that described D2D UE is cast communication, also include processing as follows: no matter one jumps neighbour Whether there is other this group node in node listing, described source node all sends the multicast message of self to one Jump neighbors.Or, do not send out without other this group node, described source node if one is jumped in neighbor node table Give the multicast message of self;Or attempt being forwarded the multicast message of self by the relaying UE of difference group;Or take It is arranged in zone line, the physical path in formation group with extra this group relaying UE, retransmits self Multicast message.
In above each method, forwarding therein can use following several ways to carry out: receives institute for the first time Forward when stating multicast message, receive identical multicast message the most again and do not forward;Or receive every time All forward during described multicast message;Or when receiving described multicast message for the first time, according to sending probability p1 Judge whether to forward, receive described multicast message the most again and judge whether to according to sending probability p2 Forward.Wherein p1 and p2 can be the most preset, or uses certain algorithm to calculate acquisition.
The method that the present invention proposes can realize, to the restriction flooding forwarding scope in cast communication, reducing useless Flooding hop count, reduces the probability collided when forwarding, thus promotes communication performance and save resource.
Example 1:
Refer to accompanying drawing 2.A1 ... A5 is D2D UE, belongs to same communication set A.
In D2D discovery procedure, this group one that A1~A5 finds jumps neighbors (other groups as shown in the table Node draw the most in the drawings):
Node ID One jumps neighbor node table
A1 A2,A3,A4
A2 A1
A3 A1,A4
A4 A1,A3,A5
A5 A1
It is assumed that for the multicast message that receive same serial number is repeated several times, this embodiment is taked only The processing mode forwarded is carried out when once receiving.
1, when the source node of certain cast communication that A1 is communication set A, A1 has and belongs to the one of communication set A Jumping neighbors A2, A3, A4, A1 send this multicast message;
2, A1 one jumping neighbors receive A1 send multicast message:
A) A2 is in addition to the sending node A1 of this message, does not has other to belong to jumping neighbour's joint of communication set A Point, A2 does not broadcast this message of forwarding;
B) A3 is in addition to the sending node A1 of this message, has other to belong to a jumping neighbors of communication set A A4, A3 broadcast forwards this message;
C) A4 is in addition to the sending node A1 of this message, has other to belong to a jumping neighbors of communication set A A3, A5, A4 broadcast forwards this message;
3, the part one of A1 jump neighbors forward A1 send multicast message:
A) A3 forwards this multicast message:
I.A1 receives the multicast message that A3 forwards, it is believed that self this multicast message the most forwarded over, the heaviest Multiple forwarding;
Ii.A4 receives the multicast message that A3 forwards, it is believed that self this multicast message the most forwarded over, the heaviest Multiple forwarding;
B) A4 forwards this multicast message:
I.A1 receives the multicast message that A4 forwards, it is believed that self this multicast message the most forwarded over, the heaviest Multiple forwarding;
Ii.A3 receives the multicast message that A4 forwards, it is believed that self this multicast message the most forwarded over, the heaviest Multiple forwarding;
Iii.A5 receives the multicast message that A4 forwards, and A5, in addition to the sending node A4 of this message, does not has it He belongs to a jumping neighbors of communication set A, and A5 does not broadcast this message of forwarding;
In this embodiment, end-state is that A1 sends multicast message, and A3, A4 will forward the multicast of A1 Message.
The present invention is applicable to the scene that major part node can be transferred through organizing the relaying realization communication of interior nodes, for Fraction under this scene organizes other node node beyond communication range with this, and two schemes can be taked to make It can organize other node communication with this: 1, asks it to become the relaying UE that this group communicates to other UE organized; 2, by the way of extra layout this group via node, the topological structure of communication network is adjusted, it is achieved in group All nodes can intercommunication.The first scheme will be illustrated by the following examples.
Embodiment 2
Refer to accompanying drawing 3.A1 in figure ... A6 is D2D UE, belongs to same communication set A.B1 is D2D UE, is not belonging to communication set A.B1 is the neighbors of A5 and A6.A6 does not belong to communication set A A jumping neighbors, namely and other node of communication set A be physically segregated.
Under this scene, A5 broadcast sends relay request, and B1 finds have and A5 in self jumping neighbors Belong to the A6 of same communication set, B1 and agree to become the relaying of group A.Or, A6 is by route discovery originally There is a common jumping neighbors B1 in node and A5, sends relay request to B1, and B1 finds self adjacent joint Point has and belongs to the A5, B1 of same communication set with A6 and agree to that this request becomes the relaying of group A.Work as A1 When sending cast communication as source node, B1 can be A6 forwarding multicasting message as interim via node.
One of ordinary skill in the art will appreciate that: all or part of step realizing said method embodiment can Completing with the hardware relevant by programmed instruction, aforesaid program can be stored in an embodied on computer readable and deposit In storage media, this program upon execution, performs to include the step of said method embodiment;And aforesaid storage Medium includes: the various media that can store program code such as ROM, RAM, magnetic disc or CD.
Last it is noted that above example is only in order to illustrate technical scheme, rather than it is limited System;Although the present invention being described in detail with reference to previous embodiment, those of ordinary skill in the art It is understood that the technical scheme described in foregoing embodiments still can be modified by it, or to it Middle part technical characteristic carries out equivalent;And these amendments or replacement, do not make appropriate technical solution Essence departs from the spirit and scope of various embodiments of the present invention technical scheme.

Claims (10)

1. the transfer control method in a D2D cast communication, it is characterised in that including:
D2D UE, by periodic D2D discovery procedure, generates and safeguards a jumping neighbor node table;Described Neighbor node table at least includes group belonging to neighbors ID and neighbors;
After D2D UE receives multicast message, analyze group belonging to described multicast message, if one jumps neighbors In list in addition to the sending node of described multicast message, there is also other this group node, the most described D2D UE Forward described multicast message.
Method the most according to claim 1, it is characterised in that also include: when described one jumps neighbour's joint When there is not other this group node in addition to the sending node of described multicast message in point list, the most described D2D UE does not forward described multicast message.
Method the most according to claim 1, it is characterised in that also include: when described one jumps neighbour's joint When there is not other this group node in addition to the sending node of described multicast message in point list, the most described D2D UE carries extra this group relaying UE and is arranged in zone line, the physical path in formation group, then forwards Described multicast message.
Method the most according to claim 1, it is characterised in that also include:
Should when a described jumping neighbor node table does not exist other in addition to the sending node of described multicast message During group node, described D2D UE attempts forwarding described multicast message by the relaying UE of difference group.
Method the most according to claim 4, it is characterised in that described trial is by difference group The UE that continues forwards described multicast message to include following steps:
The relaying UE of difference group is sent and enters group request temporarily by described D2D UE, and in request, statement needs it As interim multicast relay forwarding node;
If the relaying UE of described different group agrees to described request, the most described D2D UE forwards described multicast Message relays to other this group node to the relaying UE of described different group, the relaying UE of described different groups;
If the relaying UE of described different group refuses described request, the most described D2D UE does not forward described group Broadcast message.
Method the most according to claim 5, it is characterised in that also include:
After described cast communication terminates, agree to that the relaying UE of the different groups of described request exits this group, or It is retained in the relaying identity of this group.
Method the most according to claim 5, it is characterised in that the relaying UE of described different groups is same The factor of judgment of described request of anticipating includes:
One is jumped and be there is other this group node in addition to described request sending node in neighbor node table;Or,
One jump neighbor node table exists other this group node except described request sending node in addition to and oneself Body ability can be competent at forwarding task.
Method the most according to claim 1, it is characterised in that also include: as described D2D UE During for the source node of cast communication, no matter one jumps in neighbor node table whether there is other this group node, institute State source node all to send self multicast message and jump neighbors to one.
Method the most according to claim 1, it is characterised in that also include: as described D2D UE During for the source node of cast communication, if one is jumped in neighbor node table without other this group node, then
Described source node does not send the multicast message of self;Or,
Described source node attempts being forwarded the multicast message of self by the relaying UE of difference group;Or,
Described source node carries extra this group relaying UE and is arranged in zone line, and the physics in formation group leads to Road, retransmits the multicast message of self.
10. according to the method described in claim 1~9 any one, it is characterised in that also include: described Forward and carry out in the following way:
Forward when receiving described multicast message for the first time, receive identical multicast message the most again and do not carry out Forward;Or,
All forward when receiving described multicast message, until the hop count of described multicast message is reached every time To max-forwards number of times;Or,
When receiving described multicast message for the first time, judge whether to forward, hereafter according to sending probability p1 Receive described multicast message again to judge whether to forward according to sending probability p2.
CN201510104416.2A 2015-03-10 2015-03-10 Forwarding control method in D2D multicast communication Withdrawn CN106034289A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510104416.2A CN106034289A (en) 2015-03-10 2015-03-10 Forwarding control method in D2D multicast communication

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510104416.2A CN106034289A (en) 2015-03-10 2015-03-10 Forwarding control method in D2D multicast communication

Publications (1)

Publication Number Publication Date
CN106034289A true CN106034289A (en) 2016-10-19

Family

ID=57151057

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510104416.2A Withdrawn CN106034289A (en) 2015-03-10 2015-03-10 Forwarding control method in D2D multicast communication

Country Status (1)

Country Link
CN (1) CN106034289A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106973303A (en) * 2017-03-20 2017-07-21 重庆邮电大学 A kind of D2D video distributions and pre-cache method based on network code
CN112235719A (en) * 2020-11-02 2021-01-15 深圳市中诺通讯有限公司 Method and equipment for realizing group interaction through D2D
CN115378554A (en) * 2022-10-24 2022-11-22 北京博点智合科技有限公司 Data transmission method, device, equipment and readable storage medium

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102118826A (en) * 2011-03-17 2011-07-06 同济大学 Multi-hop communication method for nodes of network
CN103428642A (en) * 2013-07-16 2013-12-04 北京邮电大学 Intra-cluster device-to-device (D2D) multicast method based on relay
CN103747507A (en) * 2014-01-28 2014-04-23 宇龙计算机通信科技(深圳)有限公司 Selecting method, selecting device, terminal and base station for communication mode
CN103857006A (en) * 2012-11-28 2014-06-11 美国博通公司 Apparatuses and Methods for Communication System
CN104105069A (en) * 2013-04-07 2014-10-15 华为终端有限公司 Multicast data processing method and device
US20150249544A1 (en) * 2012-09-17 2015-09-03 Lg Electronics Inc. Method and apparatus for performing harq operation in wireless communication system

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102118826A (en) * 2011-03-17 2011-07-06 同济大学 Multi-hop communication method for nodes of network
US20150249544A1 (en) * 2012-09-17 2015-09-03 Lg Electronics Inc. Method and apparatus for performing harq operation in wireless communication system
CN103857006A (en) * 2012-11-28 2014-06-11 美国博通公司 Apparatuses and Methods for Communication System
CN104105069A (en) * 2013-04-07 2014-10-15 华为终端有限公司 Multicast data processing method and device
CN103428642A (en) * 2013-07-16 2013-12-04 北京邮电大学 Intra-cluster device-to-device (D2D) multicast method based on relay
CN103747507A (en) * 2014-01-28 2014-04-23 宇龙计算机通信科技(深圳)有限公司 Selecting method, selecting device, terminal and base station for communication mode

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106973303A (en) * 2017-03-20 2017-07-21 重庆邮电大学 A kind of D2D video distributions and pre-cache method based on network code
CN106973303B (en) * 2017-03-20 2020-03-17 重庆邮电大学 D2D video distribution and pre-caching method based on network coding
CN112235719A (en) * 2020-11-02 2021-01-15 深圳市中诺通讯有限公司 Method and equipment for realizing group interaction through D2D
CN115378554A (en) * 2022-10-24 2022-11-22 北京博点智合科技有限公司 Data transmission method, device, equipment and readable storage medium

Similar Documents

Publication Publication Date Title
Soua et al. Wave: a distributed scheduling algorithm for convergecast in IEEE 802.15. 4e TSCH networks
US8351417B2 (en) Methods for efficient organization of vehicle peer groups and efficient V2R communications
EP1376939B1 (en) Mobile ad-hoc network and methods for performing functions therein based upon weighted quality of service metrics
US7715354B2 (en) Method of beacon exchange between devices with asymmetric links and system using the method
Jahanshahi et al. Multicast routing protocols in wireless mesh networks: a survey
CN107889185B (en) Networking method of wireless data acquisition system of electric meter
CN102883403B (en) Construction method for mobile ad hoc network
US20150023213A1 (en) Node apparatus and communication method
Jahanshahi et al. On channel assignment and multicast routing in multi–channel multi–radio wireless mesh networks
CN104883304B (en) For part entangled quantum to the method for routing of bridge communications network
CN102395126B (en) Mobile Ad hoc network address configuration realization method based on tree structure
US9906434B2 (en) SMF-type communication method for a MANET network, network node and mobile network which implement this communication method
CN110831104B (en) Routing method for linear topology wireless ad hoc network
CN109121096B (en) Method and apparatus for determining broadcast nodes in a mesh network
CN106034322A (en) Routing switching method based on chain quality in mobile ad hoc network
CN106034289A (en) Forwarding control method in D2D multicast communication
CN106330731A (en) Wireless Ad hoc network multicast tree establishing method
CN105072586B (en) To the management method of the forwarding of broadcast message in embedded radio self-organizing network
CN110662258A (en) Message forwarding method, device and medium
CN104410985B (en) A kind for the treatment of method and apparatus of topology control message
CN112740729A (en) Apparatus and method for autonomously configuring relay node apparatus in mesh network
CN106034359A (en) Speaking right preemption method of cluster service in ad-hoc network
CN109714398A (en) Date storage method and device
CN104104746B (en) A kind of segmented address distribution method of wireless self-networking
CN110365584B (en) Network management method and device

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
WW01 Invention patent application withdrawn after publication

Application publication date: 20161019

WW01 Invention patent application withdrawn after publication