CN102300234B - Novel multi-hop routing transmission method - Google Patents

Novel multi-hop routing transmission method Download PDF

Info

Publication number
CN102300234B
CN102300234B CN201010212142.6A CN201010212142A CN102300234B CN 102300234 B CN102300234 B CN 102300234B CN 201010212142 A CN201010212142 A CN 201010212142A CN 102300234 B CN102300234 B CN 102300234B
Authority
CN
China
Prior art keywords
node
jumping
backup
data
follow
Prior art date
Application number
CN201010212142.6A
Other languages
Chinese (zh)
Other versions
CN102300234A (en
Inventor
王芳
周斌
王海峰
Original Assignee
上海无线通信研究中心
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 上海无线通信研究中心 filed Critical 上海无线通信研究中心
Priority to CN201010212142.6A priority Critical patent/CN102300234B/en
Publication of CN102300234A publication Critical patent/CN102300234A/en
Application granted granted Critical
Publication of CN102300234B publication Critical patent/CN102300234B/en

Links

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THIR OWN ENERGY USE
    • Y02D70/00Techniques for reducing energy consumption in wireless communication networks
    • Y02D70/30Power-based selection of communication route or path

Abstract

The invention discloses a novel multi-hop routing transmission system and method. The transmission system comprises a source node for transmitting data and a target node for receiving data, wherein a backup node for receiving data transmitted by the source node is arranged between the source node and the target node, and is used for executing the functions of the target node instead of the target node when the target node cannot correctly receive data transmitted by the source node; the distance between the backup node and the target node is a backup step length; and the backup step length is smaller than the distance between the source node and the target node. In the invention, an efficient multi-hop routing transmission mode is adopted, so that the transmission times can be reduced effectively, and wireless resources such as transmission power and the like can be saved.

Description

A kind of Novel multi-hop routing method

Technical field

The invention belongs to communication technical field, relate to a kind of Novel multi-hop routing system, the invention still further relates to a kind of Novel multi-hop routing method simultaneously.

Background technology

Between terminal, (device-to-device, D2D) Direct Communication is a study hotspot of rising in recent years, adopts D2D technology can effectively improve system effectiveness, increases covering in the cellular system under centralized control.In the mode of multi-hop, transmit the important application that data are D2D communication.In current cellular communication system, by central controller---base station (BS), as the access point between mobile device and network, mobile device can carry out communication by honeycomb uplink and downlink link and BS.But when each communication equipment close together, between employing equipment, direct communication technology can be brought numerous benefits for system, such as increase system covers, extends battery, improves the level of resources utilization, reduces system interference etc.Current, in cellular communication system, adopt D2D technology to become the focus of research.In the cellular system strengthening at this D2D, because the communication link quality between equipment is conventionally comparatively desirable, therefore the communication of the D2D under centralized control can effectively improve the efficiency of cellular system.

In the mode of multi-hop, transmit the important application that data are D2D communication.Under multi-hop transmission pattern, in order to save time, the resource such as power, wish, with few jumping figure of trying one's best, data are delivered to destination node from source node.But in traditional multihop network, once a node does not successfully receive data, it will ask front end node data retransmission, this waste that just mode of request retransmission can be brought retransmission delay time and Radio Resource immediately that makes mistakes.Suppose to exist 7 nodes in certain multihop network, be expressed as Node (0), Node (1), Node (2), ..., Node (6), the normalization distance between node is 1, data need to be transferred to Node (6) from Node (0).Conventional transmission pattern description is as follows:

The first step: Route Selection

Route Selection refers to that, according to certain algorithm and criterion, such as shortest time or nodes are minimum etc., select a group node, guarantee these data from Node (0), successively by these nodes to reach Node (6).For example a route choosing is: Node (0) → Node (1)-→ Node (2) → Node (3) → Node (4) → Node (5) → Node (6).

Second step: the transmission of data

Mode with " multi-hop " is transmitted data, in jumping, there is one " source node " and one " destination node " in each, when destination node is successfully received data, it can return to " ACK " confirmation signal to the source node when front jumping, and changes the source node of down hop into; Its follow-up adjacent node also can be received " ACK " confirmation signal at the same time, and carries out the preparation that receives data.Once when the destination node of front jumping cannot successfully receive data, it will return to source node " NACK " thus signal request source node data retransmission, its follow-up adjacent node receive after this " NACK " signal, maintain the original state constant.

Fig. 1 and Fig. 2 respectively for destination node in the situation that success/mistake is received data, the workflow of each node and signaling process.

Fig. 3 has provided the example of a conventional transmission pattern.The target of supposing the destination node of each jumping receives bLock error rate (Block Error Ratio, BLER) be 30%, altogether need 8 jumpings data could be transferred to Node (6) from Node (0), wherein have 2 jumpings to make a mistake, in each jumping, state and the action of destination node and source node are summarised in table 1.

In the 1st jumps, Node (1) has successfully received the data that Node (0) sends, and to Node (2), send this bag in the 2nd jumps, but Node (2) takes defeat, so Node (2) is to Node (1) feedback NACK request retransmission.Therefore in the 3rd jumps, source node and destination node are respectively still Node (1) and Node (2), and current Node (2) receives data success.In follow-up the 4th jumping and the 5th is jumped, Node (3) and Node (4) have all successfully received data, but Node (5) receives data failure in the 6th jumps.So again transmit data by Node (4) to Node (5) in the 7th jumps, and Node (5) successfully receives.Finally, in the 8th jumps, data are successfully sent to Node (6) by Node (5).In sum, data have altogether experienced 8 jumpings and just by Node (0), have passed through successively Node (1), Node (2) ... Node (5) is transferred to Node (6).

Jumping figure Source node Destination node Data receiving state ??1 ??Node(0) ??Node(1) ??ACK ??2 ??Node(1) ??Node(2) ??NACK ??3 ??Node(1) ??Node(2) ??ACK

??4 ??Node(2) ??Node(3) ??ACK ??5 ??Node(3) ??Node(4) ??ACK ??6 ??Node(4) ??Node(5) ??NACK ??7 ??Node(4) ??Node(5) ??ACK ??8 ??Node(5) ??Node(6) ??ACK

Table 1: conventional transmission pattern for example

The advantage of conventional transmission pattern is: route selection method is simple, and the interstitial content that participates in route is few, separate between each jumping; Shortcoming is: once destination node mistake receives data, must retransmit by request source node, cause the waste of the resources such as time and power.

Summary of the invention

Technical problem to be solved by this invention is: provide a kind of and receive during data in destination node mistake the Novel multi-hop routing system needn't request source node retransmitting;

In addition the present invention also provides a kind of Novel multi-hop routing method.

For solving the problems of the technologies described above, the present invention adopts following technical scheme.

A kind of Novel multi-hop routing system comprises sending the source node of data and in order to receive the destination node of data, between described source node and destination node, be provided with the backup node of the data of sending in order to reception sources node, described backup node is in order to carry out the function of destination node for the position of destination node at the described destination node data age that correctly reception sources node sends, distance between described backup node and destination node is backup step-length, and described backup step-length is less than the distance between source node and destination node.

As a preferred embodiment of the present invention, described Novel multi-hop routing system comprises transmitting N+1 node of data, and wherein N is integer and N >=1; Between every adjacent two nodes, be provided with a backup node, between i node and i+1 node, be provided with i backup node, wherein 1≤i≤N; Distance between i backup node and i node is shorter than the distance between i+1 node and i node.

As another kind of preferred version of the present invention, between every adjacent two backup nodes, be provided with a backup-backup node, between j backup node and j+1 backup node, be provided with j backup-backup node, wherein 1≤j≤N-1; Distance between j backup-backup node and j backup node is shorter than the distance between j+1 backup node and j backup node.

A kind of Novel multi-hop routing method comprises the following steps:

Step 1, selects a group node according to algorithm and the criterion set, in order to guarantee that data, from first node, arrive last node by each node successively; The process that data transfer to another node from a node is a jumping, and in each jumping, the node of outgoi8ng data is source node, and the node that receives data is destination node;

Step 2 arranges a backup node between the source node of each jumping and destination node, no matter when can the destination node of front jumping correctly receive data, when the backup node of front jumping all can correctly receive data;

Step 3, when the source node of front jumping sends after data, when the destination node of front jumping receives data, simultaneously when same data are intercepted and received to the backup node of front jumping;

Step 4, when when the destination node of front jumping correctly receives data, when the backup node of front jumping discharges data, when the destination node of front jumping changes the source node of follow-up jumping into;

When the destination node of front jumping cannot correctly receive data, when the backup node of front jumping just changes source node the forwarding data of follow-up jumping into, when the destination node of front jumping is not done any action.

As a preferred embodiment of the present invention, in described step 4, when when the destination node of front jumping correctly receives data, the course of work of each node is:

When the destination node of front jumping successfully receives the backward source node feeding back ACK of data signaling, when the backup node of the backup node of front jumping, follow-up jumping all can listen to ACK signaling simultaneously;

When the destination node of front jumping changes the source node of follow-up jumping into, when the backup node of front jumping discharges the data of receiving, the backup node of follow-up jumping and destination node are carried out the preparation that receives data.

As another kind of preferred version of the present invention, in described step 4, when when the destination node of front jumping receives data failure, the course of work of each node is:

When the destination node of front jumping receives the backward source node feedback of data failure NACK signaling, when the backup node of the backup node of front jumping, follow-up jumping all can listen to NACK signaling simultaneously;

When the destination node of front jumping is not done any action, when the backup node of front jumping changes the source node of follow-up jumping into, the destination node that the backup node of follow-up jumping changes follow-up jumping into receives data.

As another preferred version of the present invention, in described step 2, a backup-backup node is set between adjacent backup node.

As another preferred version of the present invention, when when the destination node of front jumping correctly receives data, the course of work of each node is:

When the destination node of front jumping successfully receives the backward source node feeding back ACK of data signaling, when backup node, the backup-backup node of front jumping, the backup node of follow-up jumping all can listen to ACK signaling simultaneously;

When the destination node of front jumping changes the source node of follow-up jumping into, when the backup node of front jumping discharges the data of receiving, the backup node of follow-up jumping and destination node are carried out the preparation that receives data, and the backup-backup node of follow-up jumping does not do any action.

As another preferred version of the present invention, when when the destination node of front jumping receives data failure, the course of work of each node is:

When the destination node of front jumping receives the backward source node feedback of data failure NACK signaling, when backup node, the backup-backup node of front jumping, the backup node of follow-up jumping all can listen to NACK signaling simultaneously;

When the destination node of front jumping is not done any action, when the backup node of front jumping changes the source node of follow-up jumping into, the backup node that changes follow-up jumping when the backup-backup node of front jumping into receives data, and the destination node that the backup node of follow-up jumping changes follow-up jumping into receives data.

Beneficial effect of the present invention is: the present invention is a kind of multi-hop routing mode efficiently, can effectively reduce the number of transmissions, saves the Radio Resources such as through-put power.

Accompanying drawing explanation

Fig. 1 is signaling process and the workflow schematic diagram of traditional scheme when current jumping data receiving state is ACK;

Fig. 2 is signaling process and the workflow schematic diagram of traditional scheme when current jumping data receiving state is NACK;

Fig. 3 is traditional multi-hop routing pattern diagram;

Fig. 4 is multi-hop routing pattern diagram of the present invention;

Fig. 5 is signaling process and the workflow schematic diagram of scheme of the present invention when current jumping data receiving state is ACK;

Fig. 6 is signaling process and the workflow schematic diagram of scheme of the present invention when current jumping data receiving state is NACK;

Fig. 7 is the relatively schematic diagram of the number of transmissions of N=10;

Fig. 8 is relatively schematic diagram of the availability of frequency spectrum;

The number of transmissions when Fig. 9 is N=5 and N=3 is schematic diagram relatively.

Embodiment

Below in conjunction with accompanying drawing, the specific embodiment of the present invention is described in further detail.

Embodiment mono-

The present embodiment provides a kind of Novel multi-hop routing system and transmission method, and route need to be pre-set before transmission data, compares traditional scheme, and the present embodiment needs more node to participate in route.Between source node and destination node, increase by one " backup node ", no matter can destination node accurately receive data, and this backup node can both receive data like clockwork.

Suppose that route is determined before first source node sends data, there is a source node in jumping in each therefore, a destination node and a backup node, backup node than destination node from source node more close to.Distance definition between backup node and destination node is " backup step-length ".

The definition that comprises two kinds " jumpings " in follow-up description: " working as front jumping " and " follow-up jumping ", they comprise respectively dissimilar node.For working as front jumping, comprise each one of source node, destination node and backup node; For follow-up jumping, except comprising above-mentioned node, also comprise one " backup-backup node ", as its name suggests, this node is when the backup node of front jumping backup node in follow-up jumping, when the destination node when front jumping does not successfully receive data, backup-backup node just changes the backup node of follow-up jumping into.

The source node of each jumping sends data to destination node, and sending mode (modulating-coding form, a merit power etc.) pre-determines according to target BLER.When destination node receives data, same data are intercepted and received to backup node.The design of backup step-length can guarantee no matter can destination node correctly receive data, and backup node can both be received data like clockwork.

Destination node successfully receives after data, and to source node feeding back ACK, when the backup node of front jumping, the backup node of follow-up jumping, backup-backup node all can listen to ACK simultaneously.So when the destination node of front jumping changes the source node of follow-up jumping into, source node does not do anything, backup node discharges the data of receiving; The backup node of follow-up jumping and destination node are carried out the preparation that receives data, and the backup-backup node of follow-up jumping does not do any action.

If destination node receives data failure, it feeds back NACK to source node, and when the backup node of front jumping, the backup node of follow-up jumping, backup-backup node also all can listen to simultaneously.After this when front jumping destination node is not done anything, backup node changes the source node of follow-up jumping into, backup-the backup node of follow-up jumping and backup node change backup node into respectively and destination node receives data, and the destination node of follow-up jumping is not done anything.

According to foregoing description, suggest plans needs more node to participate in transfer of data compared with traditional scheme.Due to the reception data mode (ACK/NACK) of previously each jumping of experience not necessarily, any node all may be played the part of the different roles such as source node, destination node, backup node, backup-backup node, and the ACK/NACK information that each node can be heard according to oneself is automatically changeb to corresponding role.

Compared with traditional scheme, the present invention suggests plans does not need extra signaling consumption, when destination node receives after data feeding back ACK/NACK, when backup node, backup-backup node and the destination node of the backup node of front jumping, follow-up jumping all will be intercepted this ACK/NACK simultaneously.Normalization distance between hypothesis goal node and source node is " 1 ", and the transmitting of the signal of node adopts full-duplex mode, when destination node is during to source node feeding back ACK/NACK, all apart from destination node, the node within " 1 " can listen to signaling, comprises backup node and destination node when the source node of front jumping, backup node, follow-up jumping.Therefore,, when these nodes listen to ACK/NACK signaling, they can be worked as the distance automatic decision of front jumping destination node and change own role in follow-up jumping according to this signaling and distance.

Fig. 5 and Fig. 6 have described work and the signaling process of each node according to the difference of ACK/NACK signaling, comprise the role transforming in follow-up jumping according to ACK/NACK signaling of data transmission procedure and each node.

Embodiment bis-

As shown in Figure 4, there are 18 nodes in the Novel multi-hop routing system that the present embodiment provides, 2/3 place of backup node between source node and destination node in its route.

The computing formula of path loss is:

128.1+37.6log 10(R)????????????(1)

Wherein R represents the distance between any 2 nodes, and path loss represents the fading severity of wireless signal, and path loss is larger, and signal to noise ratio is lower.

When backup step-length is 0.168, the received signal to noise ratio of backup node is than the high 3dB of the received signal to noise ratio of destination node;

When backup step-length is 0.2, the received signal to noise ratio of backup node is than the high 3.64dB of the received signal to noise ratio of destination node;

When backup step-length is 1/3, the received signal to noise ratio of backup node is than the high 6.62dB of the received signal to noise ratio of destination node;

According to the computing formula of path loss (1), can learn that the received signal to noise ratio of backup node is than the high 6.62dB of the received signal to noise ratio of destination node, therefore when destination node is operated on rational working point, backup node always can receive data like clockwork.In Fig. 4, the source node of each jumping and destination node all belong to the node of same type, and for example, dark circles node sends data to next dark circles node, and the square node between them is backup node; Same, when source node and destination node are triangular form node, the dark circles node between them is a backup node.

Suppose that data need to pass to Node (6) from Node (0), between source node and destination node, increase backup node, backup step-length is 1/3, except Node (0) is to Node (6), in route, also selected Node (2/3), Node (4/3), Node (5/3), Node (7/3), Node (8/3), ..., Node (16/3) and Node (17/3).

In the 1st jumps, Node (0) sends data to Node (1), Node (0), Node (2/3) and Node (1) are respectively source node, backup node and the destination nodes when front jumping, and Node (4/3), Node (5/3) and Node (2) are respectively backup-backup node, backup node and the destination node of follow-up jumping.In this jumping, Node (1) successfully receives data feeding back ACK, and Node (1) changes follow-up jumping into subsequently source node, Node (5/3) change backup node into, and Node (2) changes destination node into.

In the 2nd jumps, Node (1) sends data to Node (2), using Node (5/3) as backup node.Node (7/3), Node (8/3) and Node (3) are respectively backup-backup node, backup node and the destination node of follow-up jumping.But in this jumping, Node (2) receives data failure and feeds back NACK to Node (1), Node (5/3)/Node (7/3)/Node (8/3)/Node (3) all can hear this NACK simultaneously, so changing the 3rd source node of jumping into, Node (5/3) sends data to its destination node Node (8/3), Node (7/3) changes backup node into, and Node (3), Node (10/3) and Node (11/3) change respectively backup-backup node, backup node and the destination node of the forth jump into.

In the 4th jumps, Node (11/3) successfully receives data from Node (8/3), but in the 5th jumps, Node (14/3) receives data failure, so in the 6th jumps, the backup node of Node (14/3)---Node (13/3) becomes source node and sends data to Node (16/3).In the end one jump---in the 7th jumping, the distance between source node and destination node is less than 1, and we can select another MCS form to receive like clockwork surely data to guarantee Node (6).As for being less than 1 when the distance of final jump, How to choose transmission mode and MCS form enforcement and the performance on scheme of the present invention affects without essence, and under this assumption, we think Node (6), and in the end one jump can disposable correct reception data.

In sum, described in the present embodiment, scheme needs 7 jumpings just data can be delivered to Node (6) from Node (0) altogether, than the traditional scheme described in background technology is few, used 1 to jump, therefore suggested plans and can save transmission time and power.Source node, destination node and the accepting state of each jumping are as shown in table 2.

Jumping figure Source node Destination node Backup node Data receiving state ??1 ??Node(0) ??Node(1) ??Node(2/3) ??ACK ??2 ??Node(1) ??Node(2) ??Node(5/3) ??NACK ??3 ??Node(5/3) ??Node(8/3) ??Node(7/3) ??ACK ??4 ??Node(8/3) ??Node(11/3) ??Node(10/3) ??ACK ??5 ??Node(11/3) ??Node(14/3) ??Node(13/3) ??NACK ??6 ??Node(13/3) ??Node(16/3) ??Node(5) ??ACK ??7 ??Node(16/3) ??Node(6) ? ??ACK

Table 2: the node transmission state table of transmission plan shown in Fig. 4

Below the routing node number of conventional transmission scheme and scheme of the present invention and participation nodes are compared, comparative result is as shown in table 3.So-called " participation node " refers to the nodes of actual participation transfer of data, comprises source node, destination node and backup node in all jumpings." routing node " not only comprises " participation node ", and comprises all potential nodes that can listen to ACK/NACK signaling, and they may really not participate in the transmission of data.

N in table 3 represents to have N+1 node in conventional transmission scheme route, and therefore the distance of the normalization between first source node and last destination node is N, and corresponding to Fig. 3, first node is positioned at coordinate " 0 ", and last node is positioned at coordinate " N ".

Table 3: routing node and participation interstitial content contrast table

The number of transmissions to conventional transmission scheme and scheme of the present invention compares, and comparative result is as shown in table 4, wherein N=10.The average transmission number of times of traditional scheme calculates according to formula (2), and q is wherein target BLER.

N × [ 1 ( 1 - q ) + 2 ( 1 - q ) q + 3 ( 1 - q ) q 2 + . . . ] = N ( 1 - q ) - - - ( 2 )

??Target?BLER ??0.1 ??0.2 ??0.3 ??0.4 ??0.5 ??0.6 ??0.7 ??0.8 ??0.9 Traditional scheme ??11.11 ??12.5 ??14.29 ??16.67 ??20 ??25 ??33.3 ??50 ??100 Institute suggests plans, backup step-length 0.2 ??10.66 ??10.91 ??11.05 ??11.24 ??11.50 ??11.77 ??12.00 ??12.26 ??12.65 Institute suggests plans, backup step-length 1/3 ??10.68 ??11.08 ??11.45 ??11.86 ??12.29 ??12.77 ??13.30 ??13.87 ??14.49

Table 4: the number of transmissions contrast table

Fig. 7 is relatively schematic diagram of the number of transmissions, and as seen from Figure 7, the number of transmissions of scheme slowly increases along with the increase of BLER described in the present embodiment; When BLER is 30%, conventional transmission scheme needs 14.3 jumpings that data are passed to N (10) from N (0); And bring up to 80% as BLER, and backup step-length is 1/3 o'clock, scheme also only needs 13.9 jumpings just data can be passed to N (10) from N (0) described in the present embodiment.Therefore described in the present embodiment, scheme can obviously reduce the number of transmissions, then saves transmitting power.On the other hand, maintaining under the prerequisite of identical traffic number of times, conventional transmission scheme can reduce much the requirement of target signal to noise ratio, means and can adopt radical MCS form to improve the availability of frequency spectrum of system.For example, in conventional transmission scheme, if guarantee the 14.3 average transmission jumping figures of jumping, need to adopt 16QAM and 2/3 yard, if but adopt the scheme described in the present embodiment, 3/4 yard is just enough to guarantee that 80% target BLER and average transmission number of times are 13.9 times.

Suppose that each jumps MCS form and be 16QAM and 3/4 yard, the availability of frequency spectrum of different schemes when Fig. 8 has compared N=10.When target signal to noise ratio is 30%, the availability of frequency spectrum of scheme described in the present embodiment (backup step-length 0.2) is 0.2715, than 0.2099 of conventional transmission scheme, exceeds 29%.

Embodiment tri-

The difference of the present embodiment and embodiment bis-is: N is 5, and the number of transmissions comparative result is as shown in table 5 and Fig. 9.

The object block error rate ??0.1 ??0.2 ??0.3 ??0.4 ??0.5 ??0.6 ??0.7 ??0.8 ??0.9 Traditional scheme ??5.56 ??6.25 ??7.14 ??8.33 ??10 ??12.5 ??16.67 ??25 ??50 Institute suggests plans, backup step-length 0.2 ??5.41 ??5.68 ??5.83 ??5.94 ??6 ??6.07 ??6.16 ??6.32 ??6.59 Institute suggests plans, backup step-length 1/3 ??5.40 ??5.68 ??5.88 ??6.06 ??6.24 ??6.46 ??6.73 ??7.02 ??7.47

The number of transmissions contrast table during table 5:N=5

Embodiment tetra-

The difference of the present embodiment and embodiment bis-is: N is 3, and the number of transmissions comparative result is as shown in table 6 and Fig. 9.

??Target?BLER ??0.1 ??0.2 ??0.3 ??0.4 ??0.5 ??0.6 ??0.7 ??0.8 ??0.9 Traditional scheme ??3.33 ??3.75 ??4.28 ??5 ??6 ??7.5 ??10 ??15 ??30 Institute suggests plans, backup step-length 0.2 ??3.27 ??3.48 ??3.66 ??3.79 ??3.87 ??3.94 ??3.97 ??4.00 ??4.00 Institute suggests plans, backup step-length 1/3 ??3.28 ??3.48 ??3.66 ??3.81 ??3.94 ??4.06 ??4.21 ??4.40 ??4.66

The number of transmissions contrast table during table 6:N=3

From embodiment bis-to embodiment tetra-, can find out, even scheme of the present invention is still obvious to the minimizing effect of the number of transmissions in the situation that nodes is less.

The present invention increases by one " backup node " between the source node of each jumping and destination node, and wherein the selection principle of backup node is: no matter can destination node correctly receive data, and backup node all can correctly receive data; Once destination node cannot correctly receive data, when the backup node of front jumping just changes source node the forwarding data of follow-up jumping into; Each node the role in each is jumped do not determine in advance, but determined by the transmission state (ACK/NACK) of previous all jumpings; Node can change and determine own to the role when in front jumping and follow-up jumping by intercepting the ACK/NACK signaling of adjacent node.

Here description of the invention and application is illustrative, not wants scope of the present invention to limit in the above-described embodiments.Here the distortion of disclosed embodiment and change is possible, and for those those of ordinary skill in the art, the various parts of the replacement of embodiment and equivalence are known.Those skilled in the art are noted that in the situation that not departing from spirit of the present invention or substantive characteristics, and the present invention can be with other forms, structure, layout, ratio, and realize with other elements, material and parts.

Claims (6)

1. a Novel multi-hop routing method, is characterized in that, comprises the following steps:
Step 1, selects a group node according to algorithm and the criterion set, in order to guarantee that data, from first node, arrive last node by each node successively; The process that data transfer to another node from a node is a jumping, and in each jumping, the node of outgoi8ng data is source node, and the node that receives data is destination node;
Step 2 arranges a backup node between the source node of each jumping and destination node, no matter when can the destination node of front jumping correctly receive data, when the backup node of front jumping all can correctly receive data;
Step 3, when the source node of front jumping sends after data, when the destination node of front jumping receives data, simultaneously when same data are intercepted and received to the backup node of front jumping;
Step 4, when when the destination node of front jumping correctly receives data, when the backup node of front jumping discharges data, when the destination node of front jumping changes the source node of follow-up jumping into;
When the destination node of front jumping cannot correctly receive data, when the backup node of front jumping just changes source node the forwarding data of follow-up jumping into, when the destination node of front jumping is not done any action.
2. Novel multi-hop routing method according to claim 1, is characterized in that: in described step 4, when when the destination node of front jumping correctly receives data, the course of work of each node is:
When the destination node of front jumping successfully receives the backward source node feeding back ACK of data signaling, when the backup node of the backup node of front jumping, follow-up jumping all can listen to ACK signaling simultaneously;
When the destination node of front jumping changes the source node of follow-up jumping into, when the backup node of front jumping discharges the data of receiving, the backup node of follow-up jumping and destination node are carried out the preparation that receives data.
3. Novel multi-hop routing method according to claim 1, is characterized in that: in described step 4, when when the destination node of front jumping receives data failure, the course of work of each node is:
When the destination node of front jumping receives the backward source node feedback of data failure NACK signaling, when the backup node of the backup node of front jumping, follow-up jumping all can listen to NACK signaling simultaneously;
When the destination node of front jumping is not done any action, when the backup node of front jumping changes the source node of follow-up jumping into, the destination node that the backup node of follow-up jumping changes follow-up jumping into receives data.
4. Novel multi-hop routing method according to claim 1, is characterized in that: in described step 2, a backup-backup node is set between adjacent backup node.
5. Novel multi-hop routing method according to claim 4, is characterized in that: when when the destination node of front jumping correctly receives data, the course of work of each node is:
When the destination node of front jumping successfully receives the backward source node feeding back ACK of data signaling, when backup node, the backup-backup node of front jumping, the backup node of follow-up jumping all can listen to ACK signaling simultaneously;
When the destination node of front jumping changes the source node of follow-up jumping into, when the backup node of front jumping discharges the data of receiving, the backup node of follow-up jumping and destination node are carried out the preparation that receives data, and the backup-backup node of follow-up jumping does not do any action.
6. Novel multi-hop routing method according to claim 4, is characterized in that: when when the destination node of front jumping receives data failure, the course of work of each node is:
When the destination node of front jumping receives the backward source node feedback of data failure NACK signaling, when backup node, the backup-backup node of front jumping, the backup node of follow-up jumping all can listen to NACK signaling simultaneously;
When the destination node of front jumping is not done any action, when the backup node of front jumping changes the source node of follow-up jumping into, the backup node that changes follow-up jumping when the backup-backup node of front jumping into receives data, and the destination node that the backup node of follow-up jumping changes follow-up jumping into receives data.
CN201010212142.6A 2010-06-25 2010-06-25 Novel multi-hop routing transmission method CN102300234B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201010212142.6A CN102300234B (en) 2010-06-25 2010-06-25 Novel multi-hop routing transmission method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201010212142.6A CN102300234B (en) 2010-06-25 2010-06-25 Novel multi-hop routing transmission method

Publications (2)

Publication Number Publication Date
CN102300234A CN102300234A (en) 2011-12-28
CN102300234B true CN102300234B (en) 2014-05-07

Family

ID=45360328

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201010212142.6A CN102300234B (en) 2010-06-25 2010-06-25 Novel multi-hop routing transmission method

Country Status (1)

Country Link
CN (1) CN102300234B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9001760B2 (en) * 2012-09-27 2015-04-07 Qualcomm Incorporated Scheduling assignment and ACK/NACK reporting to facilitate centralized D2D scheduling
CN104219023B (en) * 2013-05-31 2019-05-31 上海朗帛通信技术有限公司 Communication means and device in a kind of D2D system

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1541466A (en) * 2001-06-30 2004-10-27 诺基亚公司 Appts. and method for delivery of packets in multi-hop wireless networks
CN101174977A (en) * 2006-10-31 2008-05-07 中兴通讯股份有限公司 Wireless Ad hoc network multimedia video active-standby path transmission method

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7742399B2 (en) * 2006-06-22 2010-06-22 Harris Corporation Mobile ad-hoc network (MANET) and method for implementing multiple paths for fault tolerance

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1541466A (en) * 2001-06-30 2004-10-27 诺基亚公司 Appts. and method for delivery of packets in multi-hop wireless networks
CN101174977A (en) * 2006-10-31 2008-05-07 中兴通讯股份有限公司 Wireless Ad hoc network multimedia video active-standby path transmission method

Also Published As

Publication number Publication date
CN102300234A (en) 2011-12-28

Similar Documents

Publication Publication Date Title
Zhao et al. Practical relay networks: a generalization of hybrid-ARQ
Sadek et al. A distributed relay-assignment algorithm for cooperative communications in wireless networks
CN101965741B (en) Method and apparatus for cooperative wireless communications
EP2850741B1 (en) Distributed collaborative signaling in full duplex wireless transceivers
Tannious et al. Cognitive radio protocols based on exploiting hybrid ARQ retransmissions
US8239719B2 (en) Method and apparatus for hybrid automatic repeat request
EP2242306B1 (en) Wireless communication base station device, wireless communication relay device, wireless communication terminal device, packet retransmission method, and wireless communication system
JP2010532639A (en) Method and system for reliable relay related transmission scheme and opportunistic cooperative transmission scheme
Shan et al. Distributed cooperative MAC for multihop wireless networks
US20100315989A1 (en) Method and apparatus for cooperative relaying in wireless communications
US20100254295A1 (en) Multicast and broadcast data transmission method
CN102948173B (en) Local selection of retransmitting device in cooperative cluster to enhance cellular multicast
RU2474087C2 (en) Triggering cqi transmission from ue to node b for ue in cell_fach state
CN102484569B (en) Wireless communication having reduced feedback delay
CN102461302B (en) Base station, wireless communication system, wireless resource allocating method, and wireless communicating method
Dai et al. Throughput maximization of ad-hoc wireless networks using adaptive cooperative diversity and truncated ARQ
CN107592182A (en) The HARQ ACK methods of disposal of unexpected downlink subframe
CN103546254B (en) Perform the method and its base station and mobile device of hybrid automatic repeat request
CN102282781B (en) Signal transmission method using MBSFN subframe in radio communication system
JPWO2011052022A1 (en) Radio communication system having relay device and relay terminal selection method
CN102340829B (en) Data sharing method in D2D bunch under cellular environment
CN102687444B (en) For the method for the modulation and encoding scheme of selecting community
EP2562940B1 (en) Method for cooperative data transmission among terminals, and method for clustering cooperative terminals for same
CN1622658A (en) Method and apparatus for improving relay performance of mobile communication system
CN101925110B (en) Method, relay station and base station for transmitting uplink feedback information of relay link

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
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: 20140507

Termination date: 20180625