CN104244322A - Wireless multicast cooperative node selection establishment method for overcoming hidden interference - Google Patents

Wireless multicast cooperative node selection establishment method for overcoming hidden interference Download PDF

Info

Publication number
CN104244322A
CN104244322A CN201410426405.1A CN201410426405A CN104244322A CN 104244322 A CN104244322 A CN 104244322A CN 201410426405 A CN201410426405 A CN 201410426405A CN 104244322 A CN104244322 A CN 104244322A
Authority
CN
China
Prior art keywords
node
multicast
relay
collaboration
nodes
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201410426405.1A
Other languages
Chinese (zh)
Other versions
CN104244322B (en
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.)
Huazhong Normal University
Original Assignee
Huazhong Normal University
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 Huazhong Normal University filed Critical Huazhong Normal University
Priority to CN201410426405.1A priority Critical patent/CN104244322B/en
Publication of CN104244322A publication Critical patent/CN104244322A/en
Application granted granted Critical
Publication of CN104244322B publication Critical patent/CN104244322B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention provides a wireless multicast cooperative node selection establishment method for overcoming hidden interference. The method includes the steps that whether cooperative communication needs to be started or not is independently judged by each multicast receiving node and relay request messages are broadcast to standby relay nodes through multicast error code nodes; the standby relay nodes receiving the relay request messages judge whether the surplus bandwidths of the nodes meet the bandwidth requirements in the relay request messages or not, if yes, the standby relay nodes forward the relay request messages to neighbor nodes of the standby relay nodes, and if the neighbor nodes also meet the condition, relay request response messages are sent to the multicast error code nodes; one standby relay node is selected from all the responding standby relay nodes through the multicast error code nodes according to a preset optimality principle and serves as a cooperative relay node. According to the method, the problems existing in conceal route coverage are solved through the surplus bandwidths of the nodes, the effectiveness of relay transmission can be well guaranteed, the advantages of relay transmission can be well used, and the unoccupied network flow is fully used.

Description

A kind of for overcoming the wireless multicast cooperative node selection method for building up hiding interference
Technical field
The present invention relates to communication technical field, especially relating to a kind of for overcoming the cooperative node selection method for building up hiding interference in distributed wireless multicast.
Background technology
The generation of Mobile IP TV (IPTV) technology be based on people at any time, enjoy the demand of TV program everywhere.Mobile TV program be conveyed through 3G network and Internet, need investment and set up corresponding network infrastructure, spend huge.Therefore, how to reduce the deployment fund input of mobile TV technology, ensure that communication efficiency becomes the hot issue of current industrial circle and academia's research simultaneously.
Point-to-multipoint multicast transmission make use of the natural broadcast characteristic of wireless network, the transmission mode that Chang Zuowei is main in multimedia transmission.And in multicast transmission mode, introduce collaboration communication, the reliable information transfer coverage of multicast service can be promoted, become the focus that current application and research field is new.For ease of describing, now briefly introduce with Fig. 1 the cooperative diversity technique used in lower multicast collaboration communication.Fig. 1 display be radio node d0, d1, d2, d3 of 4 receiving multicast traffics.Except d1 correctly can receive the multicast information of multicast branch node r0 transmission, all there is certain error rate in these three radio nodes of d0, d2, d3, the unified multicast service sent completely inerrably can not be transferred to this three nodes, therefore these three nodes are multicast error code receiving node, can referred to as multicast error code node.In this case, d1 can be utilized to send certain cooperative information, help d0, d2, d3 tri-radio node receiving multicast traffic information, reduce the error rate of original wireless channel transmission to the impact of multicast service.
In multicast transmission path, although increase cooperative node can improve the too high problem of some receiving node error rate, it is improper that cooperative node is selected, and easily causes the problem that wireless network concealed nodes bandwidth is overflowed.Traditional selection mode based on signal to noise ratio or the error rate, owing to have ignored the problem of concealed nodes in real network, easily causes bandwidth overflow problem at present.
Summary of the invention
For overcoming existing multicast service technological deficiency, the present invention proposes the high-performance multicast deployments scheme of a kind of IPTV based on collaboration communication.
Technical scheme of the present invention provides a kind of and selects method for building up for overcoming the wireless multicast cooperative node hiding interference, each multicast reception node disjoint judges whether to need to start collaboration communication, comprise and judge whether the error rate exceedes default error rate thresholding, carry out following steps as multicast error code node and set up collaboration communication
Step 1, multicast error code node, to corresponding all relay node broadcasts relay request message for subsequent use, insert the multicast service number of bandwidth requirement and needs cooperation in relay request message;
Step 2, receive the via node each for subsequent use of relay request message, perform following sub-step respectively,
Whether step 2.1, relay node judges self residual bandwidth for subsequent use meet bandwidth requirement in relay request message, satisfied then to oneself neighbor node forward relay request message, otherwise packet discard;
Step 2.2, the neighbor node receiving relay request message calculate wireless space remaining bandwidth size, and insert relay request response message, and loopback relay request response message is to the via node for subsequent use of Forward-reques;
Step 2.3, receive the relay node judges for subsequent use of relay request response message, the remaining bandwidth in self place wireless space and respective neighbor node wireless space is all greater than the remaining bandwidth in relay request; If so, minimum value and own services multicast service situation in the remaining bandwidth in self place wireless space and respective neighbor node wireless space are inserted in relay request response message, and send relay request response message to multicast error code node;
Step 3, multicast error code node select one as collaboration relay node according to the optimization principles preset from the alternative via node of all loopback relay request response messages, and send relay selection message to collaboration relay node;
After step 4, selected collaboration relay node receive relay selection message, loopback relay selection response message is to multicast error code node;
Step 5, after multicast error code node receives the relay selection response message of collaboration relay node, trunking traffic Mechanism establishing completes.
And in step 3, the optimization principles selecting collaboration relay node from the alternative via node of all responses is as follows,
1) collaboration relay node transmission channel is without error code;
2) preferentially select multicast group interior nodes as collaboration relay node, and the maximum node of the serviced multicast service node of registering in prioritizing selection multicast group interior nodes is as collaboration relay node;
3) the maximum node of remaining bandwidth is preferentially selected as collaboration relay node.
And, below occurring during any one situation, all open detection via node for subsequent use,
(1) at the beginning of network is set up, the alternative via node of each multicast reception node is detected respectively;
(2) when the time threshold preset arrives, then the alternative via node of each multicast reception node is again detected respectively.
(3) in the error rate detects, find that the error rate of certain multicast reception node transfinites, but corresponding via node for subsequent use is 0, then need to detect the via node for subsequent use of this multicast reception node.
And, following flow process is comprised to the corresponding alternative via node of arbitrary multicast reception node detection,
Step one, by multicast reception node to neighbours' relay node broadcasts relaying probe message, and to wait for;
Step 2, when each neighbours' via node receives the relaying probe message that multicast reception node sends, respectively loopback relaying probe response message is to multicast reception node;
Step 3, when multicast reception node receive neighbours' via node respond relaying probe response message after, relevant information is registered as via node for subsequent use by each neighbours' via node, completes the process once detecting via node for subsequent use.
The present invention, by the neighbor node remaining bandwidth information of alternative cooperative node, solves communication and hides interference covering and bandwidth overflow problem, and pick out suitable cooperative node.This programme better can ensure the validity of relay transmission, and can better utilize the advantage of relay transmission---make full use of idle network traffics, improve the transmission performance of multicast service.The present invention promotes the use of by network processes protocol mode.
Accompanying drawing explanation
Fig. 1 is cooperation transmission basic principle schematic.
Fig. 2 is the cooperation transmission instance graph of the embodiment of the present invention.
Fig. 3 be the embodiment of the present invention set up collaboration communication flow chart.
Fig. 4 is that situation (3) schematic diagram is opened in the detection of the embodiment of the present invention.
Fig. 5 is the detection relaying secondary node flow chart of the embodiment of the present invention.
Fig. 6 is the data structure schematic diagram of the embodiment of the present invention.
Embodiment
Multicast collaboration communication can be divided into cooperation and multicast group in multicast group to cooperate outward.In multicast group, cooperation utilizes the receiving node of multicast service to carry out collaboration communication.It is utilize non-multicast business receiving node to carry out collaboration communication that multicast group cooperates outward.Obviously, collaboration communication is carried out higher than the radio node adopted outside multicast group owing to adopting the network utilisation efficiency of the mode of the radio node cooperative transmission information in multicast group, because multicast group interior nodes is also the user of receiving multicast traffic, the cost that cooperation produces is lower than adopting multicast group exterior node.The present invention proposes a kind of method setting up multicast cooperative node, and gives a multicast collaboration communication mechanism.The method increases " remaining bandwidth " at via node and stores information, as cooperative information, to improve the reliability of the anti-error resistance of wireless channel and multicast service.For overcoming wireless channel loading error occurring, the signal by band sends is needed to encode.The byte number that coding produces can be greater than the byte number that needs send.The redundancy encoding byte produced is to allow receiving terminal node have enhancing error correcting capability.Common coding has parity check code, CRC code, Reed-Solomen to encode.The mode of coding and length determine can the ability of channel error correction.Generally speaking, redundant information is more, and channel error correction ability is stronger; But also can reduce the ability of transmission valid data simultaneously.Different coded systems can produce different Encoding Block Length to identical traffic data encoding, and resist miscode ability is also different.Its principle revising error code is generally designated as, and the length of encoding block is the data of K, has certain error code capability for correcting s.Although this method also can sacrifice the utilance of a part of wireless frequency spectrum (bandwidth) as control overhead, improve transmission range and the robustness of multicast service, provide transmission performance on the whole.
Technical solution of the present invention is described in detail below in conjunction with drawings and Examples.
Specifically, different according to the function of carrier channel, can sub-channel according to function distinguishing be: 1) multi-case data subchannel; 2) cooperate signaling sub-channel; 3) collaboration data subchannel.A multi-case data subchannel shows multicast sending node transmission data to the descending radio sub channels of multicast users.Cooperation signaling sub-channel refers to the channel of cooperative transmission control information.Collaboration data subchannel refers to the subchannel of the cooperative information sent from via node in order to transmission.These three kinds of radio sub channels adopt OFDM (OFDM) technology, can support that multicast sending node and multiple collaboration relay node transmit data simultaneously.Multi-case data subchannel is that multicast service is intrinsic; Cooperation signaling sub-channel be system assignment, when multi-case data can not be received node correctly receive time, system start cooperation, now system assignment goes out signaling sub-channel for work order between transmission node; Collaboration data subchannel is also system assignment, and after cooperation is successfully established, the subchannel that system assignment is new is used for transmitting data information.Be described for accompanying drawing 1 below:
Suppose that r0 is multicast branch node, d0, d1 and d2, d3 are wireless multicast receiving node.Wherein, d1 can the information of accurate code reconstruct node d1.Therefore, d1 is selected as cooperative node, i.e. via node.
1) multi-case data subchannel is r0 to d0, the fine line of d2, d3 represents.
2) signaling sub-channel that cooperates has three.Such as represent the cooperation signaling sub-channel to d0 with the heavy line of r0-> d1-> d0.
3) collaboration data subchannel has three.Such as represent the collaboration data subchannel to d0 with the dotted line of d1-> d0.
In embodiment, be provided with the multicast packets S of a K bit m.S min comprise some parity informations in order to improve the ability of resist miscode, multicast source node by multi-case data subchannel send S mpacket gives all multicast reception nodes in its coverage.Receiving S mafter packet, via node can generate new control information packet S c, packet S cby collaboration data subchannel transmission, send to multicast error code receiving node.For completing effective collaboration communication, source node, multicast error code receiving node and via node also will by cooperation signaling sub-channel control information transmissions.
As shown in Figure 4, suppose that the initial data multi-case data (Multicast data) that multicast source node sends is 12 bits, wherein, 8 bit b1, b2, b3, b4, b5, b6, b7 and b8 are data, 4 bit r1, r2, r3 and r4 are check information, this information adopts multi-case data subchannel transmission, i.e. the multicast packets S of K=12 bit m.The check information trunk information (Relay data) that via node produces is 4 bits, is r5, r6, r7 and r8, and this information passes through collaboration data subchannel transmission to multicast error code node, i.e. control information packet S c.After setting up collaboration communication, multicast error code node can receive different pieces of information by two links, the information being 12 bits of multicast subchannel transmission and having error code, the information being 4 bits of cooperation subchannel transmission and not having error code.Such multicast error code node receives altogether 16 Bit data information, can recover b1, b2, b3, b4, b5, b6, b7 and b8 by zero defect.These 16 information are designated as female code Mother data, and multicast error code node is after receiving these 16 bits, and wherein r5, r6, r7 and r8 are error free transmission, always can the multi-case data of error free recovery original transmitted.Female code refers to and according to transmission channel needs, can shrink the coding form forming different subcode.When channel condition is good, then do not need to transmit too many check digit; Work as bad channel conditions, then need to increase check digit, overcome the injury of channel to transfer of data.Female code can be reduced as different subcodes.
As shown in Figure 2, suppose that s0 is multicast source node, r0, d0, d1, d2, d3 are multicast reception node, and r0, as the branch node of multicast, is transferred to d0, d1, d2 d3 simultaneously.In fig. 2, except multicast service transmission node, also have wireless receiving node a0, b0 and wireless transmission node r2, r3, form two respective independently unicast data stream.Article one, data flow is wirelessly transmitted to radio node a0 from radio node r2; Another data flow is wirelessly transmitted to radio node b0 from radio node r3.In multicast reception node, only having d1, d2 d3 accurately can reconstruct the information of source node s0, there is error code in the path transmission of r0 → d0.So end node d0, d1, d2, d3 of multicast receive identical multicast content, when one of them node d0 error rate is higher, and can by one of them node auxiliary transmission multicast content of d1, d2, d3 to d0.Namely d1, d2 d3 all can choose as cooperative node, i.e. via node, transmits a part of multicast information to d0.Each node has one to disturb radius, the congested spilling of interference space most probable in Fig. 2 centered by d1, r2, r3 centered by oneself, therefore adopts circle mark.Although d1, d2, d3 can as collaboration relay node usually, consider real network situation, if select d1 as cooperative node, the data flow (d1 → d0) newly increased, though first air interference space (topmost shown in circle) total bandwidth can not be made to overflow, can make second interference space at radio node r2 place (shown in middle circle) total bandwidth overflow.
Reason is that radio node Communication Jamming scope spatially has coincidence, only judges that Internet Use is inadequate according to alternative cooperative node self residual bandwidth information, there will be the problem that neighbor node bandwidth is overflowed.Therefore, d1 can not be selected as wireless relay nodes.Select d2 or d3 that communication then can be avoided to disturb the concealed nodes bandwidth overflow problem covering and cause.
This programme proposes a kind ofly effectively to be set up multicast cooperation and selects the mode of relay cooperative node, solves the problem that concealed nodes bandwidth is overflowed.
As Fig. 2, suppose that s0 is multicast source node, r0 is multicast branch node, d0, d1, d2, d3 are multicast reception node.When d1, d2, d3 receive correct, and when d0 reception exists error code, d1, d2, d3 can be selected as via node, set up collaboration data channel transmission information to d0.If practical topology as shown in Figure 2, select d1 as cooperative node, then newly-established data link (d1 → d0) can cause the wireless space total bandwidth at r2 place to exceed network capacity.So d1 alternatively cooperative node must be got rid of, attempt selecting d2 as cooperative node.In this topological structure, the collaboration data link (d2 → d0) newly increased can not cause wireless bandwidth consumption to be greater than the problem of network capacity.Therefore, d2 can be selected as cooperative node.
Each multicast reception node disjoint judges whether to need to start collaboration communication, sets up collaboration communication when needed.Collaboration communication is generally applied in the least significant end in multicast transmission direction, and namely multicast reception node is multicast terminal node.Each multicast terminal node is by judging whether the error rate exceedes certain predetermined restriction.If certain multicast terminal node judges that the error rate exceedes default error rate thresholding, this multicast terminal node is multicast error code node, needs to start collaboration communication, enters and sets up collaboration communication flow process.Otherwise do not need to start collaboration communication.
See Fig. 3, in embodiment, the realization flow carrying out setting up collaboration communication for arbitrary multicast error code node comprises the following steps:
Step 1, multicast error code node to corresponding all relay node broadcasts for subsequent use " relay request ", comprising bandwidth requirement.Can be set in " relay request " packet of transmission and " remaining bandwidth " field is set, insert the bandwidth value set up needed for relay data passage and create a mechanism with " multicast service number " that need to cooperate, startup relaying.Such as Fig. 2, multicast branch node r0 is sending node, and multicast terminal node d0 transfinites owing to receiving error code, " relay request " message of going on the air.
Step 2, based on the via node each for subsequent use receiving " relay request " message, perform following steps respectively:
(2.1) judge whether self residual bandwidth meets bandwidth requirement in " relay request " message, satisfied then via node for subsequent use forwards " relay request " message to neighbor node, enter (2.2), otherwise abandon message packets, stop the collaborative process of this via node for subsequent use.If all via nodes for subsequent use do not satisfy condition, then there will be and cooperate unsuccessfully.
Such as Fig. 2, node d1, d2, the d3 etc. received on the multicast tree of " relay request " message judge " remaining bandwidth " value of the remaining bandwidth whether large " relay request " of wireless space; If be greater than, the wireless space of expression own meets collaboration communication needs, then forward " relay request " message to neighbor node; Otherwise abandon this packet, and will not respond.Such as: d1 receives " relay request " packet that d0 sends, first check whether the remaining bandwidth of oneself is greater than requirement, if so, then forward " relay request " to the neighbor node of d1.If d1 finds that the remaining bandwidth of oneself is less than the bandwidth value required by collaboration communication, then abandon " relay request " packet, and no longer respond.Suppose that interference radius is identical with communication radius length, neighbor node is exactly all radio nodes that correctly can receive transmission information.
Such as this node of d0 itself stores the information of via node for subsequent use (the namely information of neighbor nodes of d0: r0, d1, d2, r2, a0).When d0 finds that oneself receiving the error rate transfinites, just broadcast " relay request ", the node received, first must ensure that oneself place wireless space also has remaining bandwidth, and the bandwidth being greater than request.
After receiving " relay request " of d0, except r2 finds that remaining bandwidth is not enough, r0, d1, d2, a0 self remaining bandwidth all enough.Therefore, r2 does not forward, and r0, d1, d2, a0 forward " interrupt requests ".These nodes also will continue the neighbor node of inquiring oneself, so necessary " forwarding " once " relay request ".
Only have the neighbor node remaining bandwidth of r0, d1, d2, a0 enough, oneself remaining bandwidth is also enough, and r0, d1, d2, a0 just can compete and do via node.
(2.2) neighbor node receiving " relay request " message calculates wireless space remaining bandwidth size, and insert " relay request response ", and loopback " relay request response " information is to the via node for subsequent use of Forward-reques, thus report self residual bandwidth value.Citing: r2 is as one of the neighbor node of d1, and receive " relay request " message that d1 forwards, insert the tape remaining width values of self, loopback " interrupt requests response " is to d1.The air interference space of r2 represents with second circle, and the collaboration communication newly increased can have influence on the air interference space of r2, so must calculate the remaining bandwidth of r2.In this example, the remaining bandwidth of r2 is less than the bandwidth requirement set up needed for collaboration communication.
(2.3) receive the relay node judges for subsequent use of " relay request response ", " remaining bandwidth " in self place wireless space and respective neighbor node wireless space is all greater than " remaining bandwidth " of " relay request "; If so, minimum " remaining bandwidth " value is inserted.And the situation of this node service multicast business is inserted in " relay request response " message, and send " relay request response " message to multicast error code node.The situation of this node service multicast business generally can comprise: the serviced multicast service nodes of the multicast service that can serve sum, the multicast service of serving number and corresponding registration.
Such as: such as the neighbor node of node d1 is r2, r0, d2, d0, represent on Fig. 2 with a circle.As long as there is a neighbor node remaining bandwidth not enough, d1 can not do cooperative node.Basic reason is: d1 and r2 interference space has overlap, supposes to add a d1-->d0, and in first circle, bandwidth does not transfinite; But bandwidth transfinites in second circle circle.So light understands the change of d1 remaining bandwidth not enough, also must understand the situation of the neighbours r2 of d1.When " remaining bandwidth " of node d1, r2, r0, d2, d0 wireless space is all greater than " remaining bandwidth " of " relay request ", via node d1 for subsequent use sends " relay request response " message to multicast error code node d0.
Step 3, multicast error code node select a node according to the optimization principles preset from the alternative via node of all loopbacks " relay request response " message, if the alternative via node be selected is labeled as collaboration relay node, send " relay selection " message to collaboration relay node, and wait for.Those skilled in the art can pre-set optimization principles voluntarily, advise that now multicast error code node selects the optimization principles of collaboration relay node as follows:
1) collaboration relay node transmission channel is without error code;
2) preferentially select multicast group interior nodes as collaboration relay node, and the maximum node of the multicast service node serviced to corresponding multicast service of registering in prioritizing selection multicast group interior nodes is as collaboration relay node;
3) the maximum node of remaining bandwidth is preferentially selected as collaboration relay node.Comprehensive three principles can select optimum node.Such as in fig. 2, multicast error code node d0 selects d2 as via node.
After step 4, selected collaboration relay node receive " relay selection " message, loopback " relay selection response message " is to multicast error code node, and the service node number that can arrange this via node at this moment adds 1 on former numerical value basis: such as in fig. 2, collaboration relay node d2 produces " relay selection response " message, simultaneously the multicast nodes+1 of the service of this nodes records, upgrade the serviced multicast service nodes of registration.D2 loopback " relay selection response " to multicast error code node d0.The multicast node of service refers to the all-multicast error code node receiving this collaboration relay node repeating signal.In order to distinguish different multicast services, relay selection response message can register multicast service number.Multicast service number is the digital or coding without repetition for distinguishing different multicast service, acts on the similar Automobile trade mark or personal telephone number.By multicast service number, different multicast services can be differentiated.During concrete enforcement, the serviced multicast service nodes of multicast service number and corresponding registration can be registered, owing to being initiate cooperation request by receiving node, after via node accepts request and becomes collaboration relay node, can direct forward collaboration multi-case data.
Following information can also be registered in relaying probe response message:
The total number of the multicast service that can serve: in general, via node provides the junction traffic of different content to need to consume self-energy, so the multicast service number of service is not too many.
The multicast node of serving of certain corresponding multicast service 1: represent that, for certain multicast service, this number is more, then relay transmission can be supplied to more node serve, and does not consume more energy.
Step 5, after multicast error code node receives " the relay selection response message " of collaboration relay node, trunking traffic Mechanism establishing completes: such as in fig. 2, and after multicast error code node d0 receives the relay selection response message of collaboration relay node d2, trunking traffic Mechanism establishing completes.Namely this flow process terminates, and starts to process the data message from collaboration data subchannel simultaneously.Remove the error rate to transfinite mark simultaneously, and arrange after the error rate detection moment is next time 3 time intervals.Do like this is that the effect of network to error code correction needs certain time of implementation because coordination mechanism is just set up.
Because wireless network network topology structure can change, such as: node has inefficacy or node motion, and network operation a period of time all needs to detect via node information for subsequent use.The present invention proposes further, when there is following arbitrary situation, all opens detection via node for subsequent use:
(1) at the beginning of network is set up, the alternative via node of each multicast reception node is detected respectively;
(2) when the time threshold preset arrives, then the alternative via node again detecting each multicast reception node is respectively needed.
(3) in the error rate detects, find that the error rate of certain multicast reception node transfinites, but corresponding via node for subsequent use is 0, then need to detect the via node for subsequent use of this multicast reception node.See Fig. 4, when specifically implementing, can for arbitrary multicast reception node, if judging whether to need to judge that the error rate transfinites when starting collaboration communication, then judge whether via node for subsequent use is 0 further,
Then carry out if not setting up collaboration communication flow process, select collaboration relay node, complete and set up cooperating relay mechanism,
If then detect corresponding alternative via node, then return, enter when the error rate transfinites and via node for subsequent use is not 0 and carry out setting up collaboration communication flow process, select collaboration relay node, complete and set up cooperating relay mechanism.
See Fig. 5, following flow process is comprised to the corresponding alternative via node of arbitrary multicast reception node detection:
Step one, by multicast reception node to neighbours' relay node broadcasts " relaying probe message ", and to wait for.Receiving node in radio transmission range is neighbor node.Namely neighbours' via node is in the via node of multicast reception nodes neighbors position.
Step 2, when each neighbours' via node receive multicast reception node send " relaying probe message " time, loopback " relaying probe response message " respectively, comprise the cooperation state information of loopback self to multicast reception node, in cooperation state information, comprise the total number of multicast service that this alternative via node can serve, remaining bandwidth, multicast service number and the multicast node number of serving for multicast service number.
Step 3, when multicast reception node receive neighbours' via node respond " relaying probe response message " after, relevant information is registered as via node for subsequent use by each neighbours' via node, completes the process once detecting via node for subsequent use.
The effect of relaying secondary node detection is the important channel making multicast error code node understand wireless communication status around.Through " relaying probe response " message fed back to, multicast error code node can know which multicast service of each relay node services for subsequent use, just at the several node of collaboration services.For reducing new cooperative node number, existing multicast collaboration relay node preferably can be utilized.The situation of each secondary node relay services is just there is known by detection.Like this, when real selection via node, based on optimization principles 2) " preferentially select multicast group interior nodes as collaboration relay node; and select node that service multicast service node is maximum as collaboration relay node ", select the node that already present multicasting relay is served, then do not increase network to drop into, can network bandwidth consumption be reduced.
During concrete enforcement, each node, type of data packet, each packet can adopt corresponding label to identify respectively, and those skilled in the art can designed, designed message format, advises that the concrete form that each message adopts is as follows:
The relay request message form that step 1, step 2.1 relate to is as shown in table 1.
Table 1: " relay request " message format
Multicast error code node in neighbor node all belong to via node for subsequent use radio node broadcast " relay request " time, " relay request " sends node is multicast error code node; When via node for subsequent use forwards " relay request " message to neighbor node, " relay request " sends node is via node for subsequent use.
" relay request response " message format that step 2.2, step 2.3 relate to is as shown in table 2.
Table 2: " relay request response " message format
When neighbor node loopback " relay request response " information receiving " relay request " message is to the via node for subsequent use of Forward-reques, sending node is neighbor node, and receiving node is via node for subsequent use; When the via node for subsequent use receiving " relay request response " sends " relay request response " message to multicast error code node, sending node is via node for subsequent use, and receiving node is multicast error code node.
The multicast nodes of serving of the corresponding multicast service n of " multicast service n " field, represents that this node can for the multicast reception node number of service.This value is higher, represents that this node can provide relay services for more multicast reception node.But be not necessarily have so much node to need relay services.The multicast node number of Gong the service that often kind of business is corresponding is arranged relevant to concrete cyberspace.
The relay selection message format that step 3 relates to is as shown in table 3.
Table 3: relay selection message format
The relay selection response message format that step 4 relates to is as shown in table 4.
Table 4: relay selection response message format
The relaying probe message form that step one relates to is as shown in table 5.
Table 5: relaying probe message form
The relaying probe response message form that step 2 relates to is as shown in table 6.
Table 6: relaying probe response message form
Label when indicating multiple with n in each table, value is relevant with concrete condition.
During concrete enforcement, invention technician can experimentally or experience preset each threshold value.
Specific embodiment described herein is only to the explanation for example of the present invention's spirit.Those skilled in the art can make various amendment or supplement or adopt similar mode to substitute to described specific embodiment, but can't depart from spirit of the present invention or surmount the scope that appended claims defines.

Claims (4)

1. select method for building up for overcoming the wireless multicast cooperative node hiding interference for one kind, it is characterized in that: each multicast reception node disjoint judges whether to need to start collaboration communication, comprise and judge whether the error rate exceedes default error rate thresholding, carry out following steps as multicast error code node and set up collaboration communication
Step 1, multicast error code node, to corresponding all relay node broadcasts relay request message for subsequent use, insert the multicast service number of bandwidth requirement and needs cooperation in relay request message;
Step 2, receive the via node each for subsequent use of relay request message, perform following sub-step respectively,
Whether step 2.1, relay node judges self residual bandwidth for subsequent use meet bandwidth requirement in relay request message, satisfied then to oneself neighbor node forward relay request message, otherwise packet discard;
Step 2.2, the neighbor node receiving relay request message calculate wireless space remaining bandwidth size, and insert relay request response message, and loopback relay request response message is to the via node for subsequent use of Forward-reques;
Step 2.3, receive the relay node judges for subsequent use of relay request response message, the remaining bandwidth in self place wireless space and respective neighbor node wireless space is all greater than the remaining bandwidth in relay request; If so, minimum value and own services multicast service situation in the remaining bandwidth in self place wireless space and respective neighbor node wireless space are inserted in relay request response message, and send relay request response message to multicast error code node;
Step 3, multicast error code node select one as collaboration relay node according to the optimization principles preset from the alternative via node of all loopback relay request response messages, and send relay selection message to collaboration relay node;
After step 4, selected collaboration relay node receive relay selection message, loopback relay selection response message is to multicast error code node;
Step 5, after multicast error code node receives the relay selection response message of collaboration relay node, trunking traffic Mechanism establishing completes.
2. select method for building up for overcoming the wireless multicast cooperative node hiding interference according to claim 1, it is characterized in that: in step 3, the optimization principles selecting collaboration relay node from the alternative via node of all responses is as follows,
1) collaboration relay node transmission channel is without error code;
2) preferentially select multicast group interior nodes as collaboration relay node, and the maximum node of the serviced multicast service node of registering in prioritizing selection multicast group interior nodes is as collaboration relay node;
3) the maximum node of remaining bandwidth is preferentially selected as collaboration relay node.
3. according to claim 1 or 2, selecting method for building up for overcoming the wireless multicast cooperative node hiding interference, it is characterized in that: below occurring during any one situation, all opening detection via node for subsequent use,
(1) at the beginning of network is set up, the alternative via node of each multicast reception node is detected respectively;
(2) when the time threshold preset arrives, then the alternative via node of each multicast reception node is again detected respectively;
(3) in the error rate detects, find that the error rate of certain multicast reception node transfinites, but corresponding via node for subsequent use is 0, then need to detect the via node for subsequent use of this multicast reception node.
4. selecting method for building up for overcoming the wireless multicast cooperative node hiding interference according to claim 3, it is characterized in that: following flow process is comprised to the corresponding alternative via node of arbitrary multicast reception node detection,
Step one, by multicast reception node to neighbours' relay node broadcasts relaying probe message, and to wait for;
Step 2, when each neighbours' via node receives the relaying probe message that multicast reception node sends, respectively loopback relaying probe response message is to multicast reception node;
Step 3, when multicast reception node receive neighbours' via node respond relaying probe response message after, relevant information is registered as via node for subsequent use by each neighbours' via node, completes the process once detecting via node for subsequent use.
CN201410426405.1A 2014-08-27 2014-08-27 It is a kind of to be used to overcome the wireless multicast cooperative node selection method for building up for hiding interference Expired - Fee Related CN104244322B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410426405.1A CN104244322B (en) 2014-08-27 2014-08-27 It is a kind of to be used to overcome the wireless multicast cooperative node selection method for building up for hiding interference

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410426405.1A CN104244322B (en) 2014-08-27 2014-08-27 It is a kind of to be used to overcome the wireless multicast cooperative node selection method for building up for hiding interference

Publications (2)

Publication Number Publication Date
CN104244322A true CN104244322A (en) 2014-12-24
CN104244322B CN104244322B (en) 2017-09-22

Family

ID=52231479

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410426405.1A Expired - Fee Related CN104244322B (en) 2014-08-27 2014-08-27 It is a kind of to be used to overcome the wireless multicast cooperative node selection method for building up for hiding interference

Country Status (1)

Country Link
CN (1) CN104244322B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107135072A (en) * 2017-06-05 2017-09-05 三峡大学 A kind of wireless sensor network system based on quantum cryptography
CN111212423A (en) * 2020-01-13 2020-05-29 北京交通大学 Credible cooperative interference node selection method based on hidden Markov model
CN114461392A (en) * 2022-01-25 2022-05-10 西南交通大学 Bandwidth-aware selective data multicast method

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080075007A1 (en) * 2006-09-25 2008-03-27 Mehta Neelesh B Decentralized and dynamic route selection in cooperative relay networks
CN101577956A (en) * 2009-06-15 2009-11-11 北京邮电大学 Method and system for selecting collaboration relay node
KR20110003931A (en) * 2009-07-07 2011-01-13 한국전자통신연구원 Apparatus and method for cooperative terminals
CN101969396A (en) * 2010-09-02 2011-02-09 北京邮电大学 Time delay and bandwidth resource-based relay selection method
CN103052115A (en) * 2011-10-17 2013-04-17 中国移动通信集团公司 Data transmission method, mobile terminal, relay aggregator and related system
CN103220035A (en) * 2013-05-08 2013-07-24 华中师范大学 Cooperative communication transmission method
CN103313141A (en) * 2013-05-08 2013-09-18 华中师范大学 Cooperative node selection establishment method for distribution type wireless multicast

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080075007A1 (en) * 2006-09-25 2008-03-27 Mehta Neelesh B Decentralized and dynamic route selection in cooperative relay networks
CN101577956A (en) * 2009-06-15 2009-11-11 北京邮电大学 Method and system for selecting collaboration relay node
KR20110003931A (en) * 2009-07-07 2011-01-13 한국전자통신연구원 Apparatus and method for cooperative terminals
CN101969396A (en) * 2010-09-02 2011-02-09 北京邮电大学 Time delay and bandwidth resource-based relay selection method
CN103052115A (en) * 2011-10-17 2013-04-17 中国移动通信集团公司 Data transmission method, mobile terminal, relay aggregator and related system
CN103220035A (en) * 2013-05-08 2013-07-24 华中师范大学 Cooperative communication transmission method
CN103313141A (en) * 2013-05-08 2013-09-18 华中师范大学 Cooperative node selection establishment method for distribution type wireless multicast

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107135072A (en) * 2017-06-05 2017-09-05 三峡大学 A kind of wireless sensor network system based on quantum cryptography
CN111212423A (en) * 2020-01-13 2020-05-29 北京交通大学 Credible cooperative interference node selection method based on hidden Markov model
CN111212423B (en) * 2020-01-13 2021-05-18 北京交通大学 Credible cooperative interference node selection method based on hidden Markov model
CN114461392A (en) * 2022-01-25 2022-05-10 西南交通大学 Bandwidth-aware selective data multicast method
CN114461392B (en) * 2022-01-25 2023-03-31 西南交通大学 Bandwidth-aware selective data multicast method

Also Published As

Publication number Publication date
CN104244322B (en) 2017-09-22

Similar Documents

Publication Publication Date Title
CN102833691B (en) D2D (Device-to-Device) multimedia broadcast multicast service method on basis of beam forming and fountain codes
CN102612110B (en) Distributive self-organized routing method in electric carrier wave illumination control system
CN101835172B (en) Method for carrying out grouping cooperative communication on multiple users based on network encoding technology
CN101873715B (en) Methods, systems and equipment for establishing data transmission channel in presence of CoMP (Coordinated Multi-point transmission/reception) and transmitting
US20030157966A1 (en) Wireless base station, method of selecting wireless base station, method of multicasting, and wireless terminal
CN101510891B (en) Apparatus and method for implementing multicast by EPON access system
TWI435644B (en) Wireless transmission method, base station, relay station and mobile station using the same
CN102075311B (en) Network coding-based wireless cooperative broadcasting/multicasting method
CN104105072A (en) Hybrid multicast method and hybrid multicast system
CN104244322A (en) Wireless multicast cooperative node selection establishment method for overcoming hidden interference
CN102067713A (en) Method and device of multimedia broadcast multicast service coordinated by multi base stations in single cell transmission mode
CN102208962A (en) Wireless data transmission method
EP1699169A1 (en) Wireless base station, wireless mobile device, and wireless access network for reducing signalling traffic
CN101868035A (en) Multipoint cooperative transmission system and method thereof
US20120170447A1 (en) Method of aggregating conventional resources upon losing connectivity to a master system site
CN101860981A (en) Routing method and system of wireless sensor network
CN103313141B (en) A kind of cooperative node for distributed wireless multicast selects method for building up
CN101924704B (en) Method and device thereof for switching double-layer multicast links
CN101610559A (en) A kind of determination method of wireless routing and node apparatus
CN102299771A (en) Network coding control method for multi-hop multi-data-stream network
KR100919052B1 (en) Network coding system of the Multicast member node
CN103152364A (en) Duplex communication auxiliary protocol
CN101635882B (en) Method for realizing all network voice broadcast in multi-hop Ad Hoc radio station network
JP2013005283A (en) Wireless device
CN102195884A (en) Video stream control method and video stream controller

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
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20170922

Termination date: 20200827

CF01 Termination of patent right due to non-payment of annual fee