CN101610559B - Determination method of wireless routing and node device - Google Patents
Determination method of wireless routing and node device Download PDFInfo
- Publication number
- CN101610559B CN101610559B CN2008101152523A CN200810115252A CN101610559B CN 101610559 B CN101610559 B CN 101610559B CN 2008101152523 A CN2008101152523 A CN 2008101152523A CN 200810115252 A CN200810115252 A CN 200810115252A CN 101610559 B CN101610559 B CN 101610559B
- Authority
- CN
- China
- Prior art keywords
- node
- route
- value
- coding efficiency
- efficiency value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a determination method of wireless routing and a node device. The determination method comprises the following steps that: a network node judges whether the node is a destination node or has a routing reaching the destination node after receiving a routing request message; when judging that the node is not the destination node and does not have the routing reaching the destination node, the network node calculates a coding benefit value of the node and broadcasts the coding benefit value to a neighbor node through the routing request message; when judging that the node is the destination node and has the routing reaching the destination node, the network node returns a request response message containing a routing reaching the destination node from a source node to the source node, and the request response message carries the information and coding benefit value information of each node in the routing; and the source node determines a current routing according to the coding benefit value information. The determination method determines a routing through network coding benefit and makes full use of network coding opportunity to improve network transmission efficiency.
Description
Technical field
The present invention relates to wireless communication field, the route that relates in particular in a kind of wireless network is confirmed method and corresponding network node device.
Background technology
Network code carries out coded combination through the different data streams to network node, can obtain the maximum ductility limit of network multicast speed.
In the prior art, existing complete opportunistic network coding (completely opportunistic approach tonetwork coding, COPE) routing mechanism.The COPE routing mechanism is a kind of new routing mechanism, and it can find the code machine meeting in adjacent network node, can accomplish only to transmit a packet behind the coding and make a plurality of unicast services be benefited.
With a simple example COPE routing mechanism is described.As shown in Figure 1, node 1 will pass through a pair of packet of routers exchange with node 2.When not using network coding technique, node 1 sends to router (the 1st transmission) with the packet of oneself, and router sends to node 2 (the 2nd transmission) with packet again.Node 2 sends to router (the 3rd transmission) with the packet of oneself, and router sends to node 1 (the 4th transmission) with packet again.This process needs 4 transmission altogether.When adopting the network code mode; Node 1 sends to router (the 1st transmission) with the packet of oneself; Node 2 also sends to router (the 2nd transmission) with the packet of oneself; Router carries out XOR with the packet of node 1 transmission and the packet of node 2 transmissions, and the packet behind the broadcasting XOR (the 3rd transmission), and is as shown in Figure 2.Node 1 can be through XOR acquisition the other side's packet with node 2.This process only needs 3 transmission.The transmission resource of saving can be used for sending new data, improves the throughput of whole transmission network.
COPE is through a kind of chance encoding mechanism; Two or more data packets in data flows are carried out network code (such as the simplest bit-level XOR
), information flowrate is improved.COPE is a transmits data packets of monitoring (overhear) other nodes through node, and transmits through the mode of broadcasting.
This shows, adopt COPE mechanism, can carry out network code, to improve the network transmission efficiency to the multiplex data stream that transmits simultaneously in the node.But in the prior art, route and network code carry out respectively, at first judge the path from the source node to the destination node through route technology; In the process of the route propagation business datum that employing is determined; Each node uses monitoring technique, obtains the data packet transmission information (packet that has received and the packet that needs acquisition) of other nodes, uses the network coding technique of complete opportunistic matter (promptly to have an opportunity to encode and just compile; Otherwise the principle of not compiling), obtain certain coding gain.A typical example is as shown in Figure 3.
Three data flow are arranged among Fig. 3, are respectively:
f
1: 2 → 1, data flow f
1, expression network node 2 is to a data flow of node 1;
f
2: 1 → 3, data flow f
2, expression network node 1 is to a data flow of node 3;
f
3: 3 → 2, data flow f
3, expression network node 3 is to a data flow of node 2.
All do not have loss if each bar transmits link, corresponding shortest path (based on the minimum routing mechanism of jumping figure) should be respectively 2 → 5 → 7 → 4 → 1,1 → 4 → 7 → 6 → 3 and 3 → 9 → 8 → 2.When not adopting network code, the total the number of transmissions that sends a packets need should be 11 times.
When adopting network code, because node 1 and 7 passes through node 4 exchange data packets, therefore, and in the transmission path of above-mentioned three data flow, only can be to data flow f at node 4
1With data flow f
2Carry out network code, total transmission number of times is dropped to 10 times from 11 times.
And in fact, event data stream f
3Route change 3 → 6 → 7 → 5 → 2 into, then further can carry out network code at node 5 and 6 places, total transmission number of times is no more than 9 times.
This shows; In the prior art, the COPE routing mechanism only is that network code has been applied in the wireless network transmissions, does not have to confirm best route to the network coding opportunity that can adopt in advance; Only be on the route that existing route mechanism is determined; The chance that utilization can be encoded is carried out network code, thereby makes the gain that can not demonstrate fully network code, can not promote the transmission efficiency and the performance of network substantially.
Summary of the invention
The present invention provides a kind of determination method of wireless routing, confirms route through the network code benefit, makes full use of network coding opportunity, promotes the network transmission efficiency.
The present invention also provides respective wireless network node device and source node device, confirms route through the network code benefit, makes full use of network coding opportunity, promotes the network transmission efficiency.
Determination method of wireless routing provided by the invention comprises:
After network node receives route request information, judge whether this node is destination node or whether has the route that arrives destination node;
When judging this node is not destination node; And when this node does not have the route that arrives destination node, calculate the coding efficiency value of this node and be broadcast to neighbor node, wherein through route request information; The coding efficiency value of calculating this node comprises: based on a plurality of data flow of this node reception; Determine the network code mode that can adopt, respectively to each network code mode of determining, based on each neighbor node corresponding codes benefit value of preset coding benefit value calculation rule; And summation, with maximum and the coding efficiency value of value as this node;
When judging this node is destination node; Or this node is when having the route that arrives destination node; Return the request response that comprises from source node arrival destination node routing information to source node; And in the described request response message, carrying the coding efficiency value information, said source node is determined current route according to said coding efficiency value information.
According to said method of the present invention, before source node returns the described request response message, also comprise: calculate each node in the said path the coding efficiency value and value;
The said coding efficiency value information that in the described request response message, carries is said and value;
Said source node is determined current route according to said coding efficiency value information, specifically comprises: said source node is determined the maximum and value of carrying in each request response of returning, confirms as current route with maximum with the corresponding said path of value.
According to said method of the present invention, the coding efficiency value that the said coding efficiency value information that in the described request response message, carries is each node in the said path;
Said source node is determined current route according to said coding efficiency value information; Specifically comprise: said source node calculates the said coding efficiency value of carrying in each request response of returning and value, current route is confirmed as in maximum said path with the value correspondence.
The said a plurality of data flow that receive according to this node are determined the network code mode that can adopt, and comprising:
Any data stream of choosing in said a plurality of data flow carries out network code; And from said a plurality of data flow, select the data flow combination to carry out network code arbitrarily.
Said respectively to each network code mode of determining, according to preset coding benefit value calculation rule and each neighbor node corresponding codes benefit value, comprising:
When a kind of network code mode that employing is determined, said neighbor node can not correct decoding, the packet after the decoding is local data accepted bag or decoding back packet when being local unwanted packet, and this neighbor node corresponding codes benefit value is 0; When said neighbor node can correct decoding goes out the desired data bag, calculate this neighbor node corresponding codes benefit value according to preset coding benefit value computing function.
Based on said method of the present invention, said coding efficiency value computing function based on the business datum that transmits to transfer delay, bandwidth, handling capacity or this node and radio link quality between the neighbor node require different, be provided with respectively or revise.
Said coding efficiency value computing function comprises: I (n
i)=(1-e
i) g
i
Wherein, n
iRepresent i neighbor node in n the neighbor node, I (n
i) for being directed against this node I, neighbor node n
iThe coding efficiency value, e
iFor this node I to neighbor node n
iThe link error probability, g
iThe sign of being benefited for the encoding factor, its concrete value is: as certain network code mode of employing, neighbor node n
iWhen can correct decoding going out the desired data bag, value is 1, otherwise value is 0.
According to said method of the present invention, also comprise:
After network node receives route request information, according to the routing table of the local storage of the updating route information that carries in the said route request information.
According to said method of the present invention, also comprise: when the heavy-route condition that is provided with satisfied, said source node was broadcasted route request information once more, confirmed route again.
Again confirm route when said heavy-route condition when setting satisfies, specifically comprise:
Before the current route that use is determined transmits the data flow end, when said source node detects network topological change, broadcast route request information once more, confirm route again; Perhaps
When offered load surpassed preset threshold, said source node was broadcasted route request information once more, confirmed route again; Perhaps
Receive the routing error RRER of other network node transmission when said source node after, broadcast route request information once more, confirm route again.
The present invention provides a kind of wireless network node device in addition, comprising: route request information reception/judging unit, coding efficiency value are confirmed unit, route request information delivery unit and request response transmitting element;
Said route request information reception/judging unit is used to receive route request information, and judges whether this node is destination node or whether has the route that arrives destination node; When judging this node is not destination node, and this node do not have the route that arrives destination node, sends said route request information and gives said route request information delivery unit, and start said coding efficiency value and confirm the unit; When judging this node is destination node, or this node sends said route request information and gives described request response message transmitting element when having the route that arrives destination node;
Said coding efficiency value determining unit; Be used to calculate the coding efficiency value of this node, and send to said route request information delivery unit, wherein; The coding efficiency value of calculating this node comprises: according to a plurality of data flow of this node reception; Determine the network code mode that can adopt, respectively to each network code mode of determining, according to each neighbor node corresponding codes benefit value of preset coding benefit value calculation rule; And summation, with maximum and the coding efficiency value of value as this node;
Said route request information delivery unit is used in said route request information, carrying the coding efficiency value that said coding efficiency value is confirmed this node that the unit is determined to neighbor node broadcasting route request information;
Described request response message transmitting element; Be used for according to the route request information that receives; Return the request response that comprises from source node arrival destination node path to source node, in the described request response message, carry each nodal information and coding efficiency value information in the said path.
Described request response message transmitting element also is used for, calculate each node in the said path the coding efficiency value and value; The said coding efficiency value information that in the described request response message, carries is said and value; Perhaps
The coding efficiency value that the said coding efficiency value information that in the described request response message, carries is each node in the said path.
Said coding efficiency value confirms that the unit comprises:
The network code mode is confirmed subelement, is used for a plurality of data flow according to the reception of this node, determines the network code mode that can adopt;
Coding efficiency value computation subunit is used for being directed against respectively each network code mode of determining, according to preset coding benefit value calculation rule and each neighbor node corresponding codes benefit value, and summation;
The coding efficiency value is confirmed subelement, is used for maximum and the coding efficiency value of value as this node, and sends to said route request information delivery unit.
Wireless network node device provided by the invention also comprises:
Route storage update unit is used to store this node route list; And the routing iinformation that carries in the route request information according to said route request information reception/judging unit reception, upgrade local routing table of storing;
Said route request information reception/judging unit according to the routing table of storing in the said route storage update unit, judges whether this node is destination node or whether has the route that arrives destination node.
The present invention also provides a kind of wireless network source node device, comprising: route request information transmitting element, request response receiving element and route are confirmed the unit;
Said route request information transmitting element is used to broadcast route request information and gives network node;
Described request response message receiving element; Be used to receive the request response that arrives the destination node path from source node that comprises that network node returns; In the described request response message, carry each nodal information and coding efficiency value information in the said path, wherein, said coding efficiency value information is confirmed according to the coding efficiency value of node; Wherein the coding efficiency value of computing node comprises: according to a plurality of data flow of this node reception; Determine the network code mode that can adopt, respectively to each network code mode of determining, according to each neighbor node corresponding codes benefit value of preset coding benefit value calculation rule; And summation, with maximum and the coding efficiency value of value as this node;
Said route is confirmed the unit, is used for the said coding efficiency value information that receives according to described request response message receiving element, determines current route.
Said route confirms that the unit also is used for, and determines the maximum and value of carrying in each request response of returning, confirms as current route with maximum with the corresponding said path of value; Said is the coding efficiency value sum of each node in the path with being worth; Perhaps
Said route confirms that the unit also is used for, calculate each node in the path of carrying in each request response return the coding efficiency value and value, current route is confirmed as in maximum said path with the value correspondence.
Wireless network source node device provided by the invention also comprises:
The heavy-route unit when the heavy-route condition that is provided with satisfies, indicates said route request information transmitting element to broadcast route request information once more, confirms route again.
Beneficial effect of the present invention is following:
Adopt the present invention, after network node receives route request information, judge whether this node is destination node or whether has the route that arrives destination node; When judging this node is not destination node, or this node calculates the coding efficiency value of this node and is broadcast to neighbor node through route request information when not having the route that arrives destination node; Neighbor node repeats said method; Up to arriving destination node; Or a certain node by destination node, or has this node that arrives the destination node route when having the route that arrives destination node; Return the request response that comprises arrival destination node path, the coding efficiency value of in request response, carrying each node in the said path to source node; Source node calculates the said coding efficiency value sum of carrying in each request response of returning, confirms as current route with maximum with the corresponding said path of value.Thereby make that the current route of determining is the maximum route of coding efficiency value.When the current route that employing is determined was carried out the business datum transmission, its network code benefit was maximum, and more network coding opportunity is arranged, and has greatly improved the transmission efficiency of whole network.
Description of drawings
Fig. 1 when not adopting network code in the prior art between node packet transmit sketch map;
Packet transmission sketch map between node when Fig. 2 is the available technology adopting network code;
Fig. 3 is the contrast sketch map that transmits route when shortest path is by mechanism and consideration network coding opportunity in the prior art;
Fig. 4 receives the process chart after the route request information for node in the inventive method;
Fig. 5 is a specific embodiment sketch map of calculation code benefit value of the present invention;
Fig. 6 is a wireless network node apparatus structure sketch map of the present invention;
Fig. 7 is coding efficiency value determining unit structural representation in the wireless network node device of the present invention;
Fig. 8 is a wireless network source node apparatus structure sketch map of the present invention.
Embodiment
Below in conjunction with accompanying drawing, the inventive method and node apparatus are elaborated.
Source node in the wireless network (node that promptly has business datum to send; Like the server in the network) when needing to send business datum; Can among the RREQ that source node sends, include origin node and destination node information to neighbor node broadcasting route request information RREQ (routerequest).
Each node (is the example explanation with a node) that receives RREQ is carried out step as shown in Figure 4:
Step S101, node receive and resolve RREQ.
If this node is the neighbor node of source node, the RREQ that then direct reception sources node sends from the RREQ that receives, can parse origin node and destination node information.
If this node is not the neighbor node of source node; Then the RREQ that receives of this node is that (RREQ need be sent to destination node for the transmission of other node in the middle of having passed through; Perhaps be sent to and have till the network node that arrives the destination node route); From the RREQ that receives, except can parsing origin node and destination node information, can also parse from this node of source node arrival the node path of process; In this case, can carry out routing table update according to the routing table of the node path that parses and self storage.For example:
If in the routing table of former storage, the node path that does not have storing and resolving to go out then can add a new route; Perhaps, in the routing table of former storage, for example stored the route that arrives the B node from the A node and be: A → C → D → B; And according to the node path that from the RREQ that receives, parses, the route that arrives the B node from the A node is: A → E → B; Then former route A → C → D → B is updated to A → E → B.
Step S102, judge that whether this node is destination node or whether has the route that arrives destination node.
This node confirms according to the destination node information that parses whether self is exactly destination node; If not, then further inquire about local routing table, determine whether to arrive the route of destination node.
When judging this node is not destination node, and this node is not when having the route that arrives destination node, execution in step S103; When judging this node is destination node, or this node is when having the route that arrives destination node, execution in step S106.
Step S103, according to a plurality of data flow that this node receives, determine the network code mode that can adopt.
The data flow of supposing the current reception of this node is N, and the network code mode that then can adopt is:
Any data stream of choosing in N the data flow carries out network code; And from N data flow, select the data flow combination to carry out network code arbitrarily.
Describe with an object lesson below.Referring to Fig. 5, suppose that this node is node I, receive three data flow, be respectively first data flow { A1, A2, A3...}, second data flow { B1, B2, B3...} and the 3rd data flow { C1, C2, C3...}.The packet of the correspondence of current reception is { A1, B1, C1}.These three data flow possibly be the Business Streams that distributes from neighbor node or upper strata.
Because each node can be through broadcasting each other between the node in the network, modes such as message monitoring are known the packet that its neighbor node comprises, and the packet information of neighbor node needs.Therefore, suppose to monitor according to chance, node I learns each neighbor node A, B, and the packet that C comprised is respectively:
Neighbor node A has comprised packet C1 and packet B1;
Neighbor node B has comprised packet A1;
Neighbor node C has comprised packet A1;
And node I is known:
The data packet queue that neighbor node A needs is { A1, A2, A3...};
The data packet queue that neighbor node B needs is { B1, B2, B3...};
The data packet queue that neighbor node C needs is { C1, C2, C3...}.
Any data stream that node I chooses in three data flow carries out network code; And from three data flow, select arbitrarily the data flow combination to carry out network code, according to the packet of the correspondence of current reception C1} obtains following seven kinds of network code modes that can adopt, and is respectively for A1, B1:
First kind of coded system: adopt first data flow to encode, the coding codeword of output is expressed as c1=A1;
Second kind of coded system: adopt second data stream to encode, the coding codeword of output is expressed as c2=B1;
The third coded system: adopt the 3rd data stream to encode, the coding codeword of output is expressed as c3=C1;
The 4th kind of coded system: adopt first data flow and second data stream to carry out assembly coding, the coding codeword of output is expressed as c4=A1+B1;
The 5th kind of coded system: adopt first data flow and the 3rd data stream to carry out assembly coding, the coding codeword of output is expressed as c5=A1+C1;
The 6th kind of coded system: adopt second data flow and the 3rd data stream to carry out assembly coding, the coding codeword of output is expressed as c6=B1+C1;
The 7th kind of coded system: adopt first data flow, second data flow and the 3rd data stream to carry out assembly coding, the coding codeword of output is expressed as c7=A1+B1+C1.
Step S104, to each network code mode of determining, according to preset coding benefit value calculation rule and each neighbor node corresponding codes benefit value, and sue for peace.
Be specially: a kind of network code mode of determining when employing; Neighbor node can not correct decoding, the packet after the decoding is local data accepted bag or decoding back packet when being local unwanted packet, and this neighbor node corresponding codes benefit value is 0; When neighbor node can correct decoding goes out the desired data bag, calculate this neighbor node corresponding codes benefit value according to preset coding benefit value computing function.
Continuing to continue to use example describes as follows:
To above-mentioned first kind of coded system (c1=A1): neighbor node A can decipher out its needed packet A1, then calculates this neighbor node A corresponding codes benefit value according to preset coding benefit value computing function, supposes that result of calculation is a; Because neighbor node B and C, this locality has received packet A1, and its coding efficiency value is respectively 0.When then adopting first kind of coded system, each neighbor node coding efficiency value sum is S1=a+0+0=a.
To above-mentioned second kind of coded system (c2=B1): neighbor node B can decipher out its needed packet B1, then calculates this neighbor node B corresponding codes benefit value according to preset coding benefit value computing function, supposes that result of calculation is b; Because neighbor node A, this locality has received packet B1, and its coding efficiency value is 0; Neighbor node C need not receive packet B1, and its coding efficiency value also is 0; When then adopting second kind of coded system, each neighbor node coding efficiency value sum is S2=0+b+0=b.
To above-mentioned the third coded system (c3=C1): neighbor node C can decipher out its needed packet C1, then calculates this neighbor node C corresponding codes benefit value according to preset coding benefit value computing function, supposes that result of calculation is c; Since neighbor node A, local data accepted bag C1, and its coding efficiency value is 0; Neighbor node B need not receive packet C1, and its coding efficiency value also is 0; When then adopting the third coded system, each neighbor node coding efficiency value sum is S3=0+0+c=c.
To the 4th kind of coded system (c4=A1+B1): neighbor node A can decipher out its needed packet A1; Then calculating this neighbor node A corresponding codes benefit value based on preset coding benefit value computing function is a; Neighbor node B can decipher out its needed packet B1, and then calculating this neighbor node B corresponding codes benefit value based on preset coding benefit value computing function is b, neighbor node C data accepted bag A1; And do not need packet B1, its coding efficiency value is 0; When then adopting the 4th kind of coded system, each neighbor node coding efficiency value sum is S4=a+b+0=a+b.
To the 5th kind of coded system (c5=A1+C1): neighbor node A can decipher out its needed packet A1; Then calculating this neighbor node A corresponding codes benefit value according to preset coding benefit value computing function is a; Neighbor node B has received packet A1; And do not need packet C1, its coding efficiency value is 0; Neighbor node C can decipher out its needed packet C1; Then calculating this neighbor node C corresponding codes benefit value according to preset coding benefit value computing function is c; When then adopting the 5th kind of coded system, each neighbor node coding efficiency value sum is S5=a+0+c=a+c.
To the 6th kind of coded system (c6=B1+C1): neighbor node A has received packet B1 and C1; Its coding efficiency value is 0; Neighbor node B only stores packet A1, can't from the coded system of B1+C1, decipher out its needed packet B1, so its coding efficiency value is 0; In like manner; Neighbor node C only stores packet A1, can't from the coded system of B1+C1, decipher out its needed packet C1, so its coding efficiency value also is 0; When then adopting the 6th kind of coded system, each neighbor node coding efficiency value sum is S6=0+0+0=0.
To the 7th kind of coded system (c7=A1+B1+C1): neighbor node A can decipher out its needed packet A1; Then calculating this neighbor node A corresponding codes benefit value according to preset coding benefit value computing function is a; Neighbor node B has only received packet A1; Can't from the present encoding mode, decipher out its needed packet B1, so its coding efficiency value is 0; In like manner; Neighbor node C has only received packet A1, also can't from the present encoding mode, decipher out its needed packet C1, so its coding efficiency value also is 0; When then adopting the 7th kind of coded system, each neighbor node coding efficiency value sum is S7=a+0+0=a.
To sum up, obtain 7 and value, be respectively:
S1＝a；
S2＝b；
S3＝c；
S4＝a+b
S5＝a+c；
S6＝0；
S7＝a。
Above-mentioned 7 with value in, can obviously draw S4 and S5 is bigger, it is above-mentioned the 4th kind of coded system of correspondence and the 5th kind of coded system respectively.If the coding efficiency value b that calculates is greater than c, then S4 is maximum and value; If the coding efficiency value c that calculates is greater than b, then S5 is maximum and value.
The concrete computing function of coding efficiency value, can based on the business datum that transmits to transfer delay, bandwidth, handling capacity and this node and radio link quality between the neighbor node require different, be provided with respectively or revise, the present invention does not limit this.
For example: suppose that the coding efficiency value computing function that is used for the calculating of coding efficiency value is:
I(n
i)＝(1-e
i)g
i
In the following formula, n
iRepresent i neighbor node in n the neighbor node, I (n
i) for being directed against this node I, neighbor node n
iThe coding efficiency value, e
iFor this node I to neighbor node n
iThe link error probability, g
iThe sign of being benefited for the encoding factor, its concrete value is: as certain network code mode of employing, neighbor node n
iWhen can correct decoding going out the desired data bag, value is 1, otherwise value is 0.
In the last example; If node I is 0.2 to the link error probability of Node B; And node I is 0.1 to the link error probability of node C, when using above-mentioned coding efficiency value computing function calculation code benefit value, clearly; When adopting the 5th kind of coded system (c5=A1+C1) for this transmission, S5 is maximum coding efficiency value.
Step S105, maximum and value that step S104 is calculated be as the coding efficiency value of this node, and carry through route request information and to be broadcast to neighbor node.
Continue to use example, node I is according to 7 and value calculating, with its maximum be worth the coding efficiency value of S5 as this node, and carry through route request information and to be broadcast to its neighbor node A, B, C.
Step S106, this node return to source node and comprise the request response that arrives the destination node path, in request response, carry each nodal information and corresponding codes benefit value in the transfer path of determining; Perhaps calculate earlier each node corresponding codes benefit value in the transfer path of determining and value, request response carry each nodal information in the transfer path of determining and calculate and value.
For a definite node N, if when execution in step S102, judging this node is not destination node, and this node is not when having the route that arrives destination node, and it can carry out above-mentioned steps S103, S104 and S105; And if node N is when execution in step S102, judging this node is destination node, or when judging this node and having the route that arrives destination node, then direct execution in step S106.In this case; Path node information and each node corresponding codes benefit value that its each upstream node carries through route request information have been comprised in the route request information that node N receives; Therefore; This node N returns request response to source node, in request response, carries the coding efficiency value information, and the concrete mode of carrying can have following two kinds of methods at least:
Method one: in request response, carry each nodal information and corresponding codes benefit value in the transfer path of determining;
Method two: calculate earlier each node corresponding codes benefit value in the transfer path of determining and value, request response carry each nodal information in the transfer path of determining and calculate and value.
Source node is after sending a route request information; In setting duration, can receive many request response of returning; In every request response returning, all carry a transfer path of determining (each nodal information and the coding efficiency value information that comprise the transfer path process).Source node is handled to the coding efficiency value information that carries in each bar request response of returning as follows:
If the coding efficiency value information that carries in the request response is the coding efficiency value (promptly adopting said method one to carry) of each node in the path; Then source node calculates the coding efficiency value sum of each node in the path of carrying in each request response respectively, confirms as current route with maximum with the corresponding transfer path of value.
If the coding efficiency value information that carries in the request response of returning be each node in the path the coding efficiency value and value (promptly adopting said method two to carry); Then source node is determined the maximum and value of carrying in each request response of returning, confirms as current route with maximum with the corresponding path of value.
Because the time variation of wireless network, when variety of network conditions changed, the route of determining was along with the variation of network condition; Possibly no longer be optimal path, perhaps unavailable, therefore; The heavy-route condition need be set; When the heavy-route condition that is provided with satisfies, broadcast route request information once more by source node, confirm route again.
The heavy-route condition can concrete condition Network Based be provided with flexibly, and for example, following situation generally needs heavy-route:
One, data flow transmission finishes: this be since routing mechanism of the present invention adopt coded data stream Network Based by; If a data flow transmission finishes; Might cause in network other node can not carry out network code or encoded data wraps in the destination node side and can not translate; Therefore need recomputate route in principle, if the source node of next data flow is consistent with destination node certainly, the result who upgrades route might be the same.
Two, the variation of loading condition in the network:, thereby make that the current route of determining is relevant with the QoS situation in the network because the criterion of route of the present invention can be provided with respective coding benefit value computing function according to Link State.If the traffic carrying capacity of on the route of having set up, transmitting in the network is the trend that increases or reduce gradually, the route of this moment might not be optimal selection; Therefore, in the reality, can confirm a threshold value that characterizes offered load, when offered load surpasses setting threshold, promptly be necessary route is upgraded according to the engineering experience value.
Three, since neighbor list or topology table change: move out of radio transmission range or shut down etc. of network node for example; To accordingly change the strategy that node carries out network code this moment, otherwise can occur that other node can not carry out network code or encoded data wraps in the situation that the destination node side can not be translated; Therefore need recomputate route, be updated to the route of each known destination node.
Four, connect when unavailable through the MAC protocol discovery when node, will send a routing error (RRER) to all nodes (comprising source node) at the upper reaches of using this route.Source node will be deleted the route that all comprise this invalid node from route-caching after receiving this RRER.If desired, source node can be initiated route finding process again and set up new route.
In sum, (when neighbor node increases or disappears) when Business Stream changes in the network, all will recomputate route in principle when detecting neighbor table or topology table and change.
Confirm method according to route provided by the invention, the present invention also provides a kind of wireless network node device, and its structural representation is as shown in Figure 6, comprising:
Route request information reception/judging unit 61, coding efficiency value are confirmed unit 62, route request information delivery unit 63 and request response transmitting element 64; Wherein:
Route request information reception/judging unit 61 is used to receive route request information, and judges whether this node is destination node or whether has the route that arrives destination node; When judging this node is not destination node, and this node do not have the route that arrives destination node, sends route request information and gives route request information delivery unit 63, and start the coding efficiency value and confirm unit 62; When judging this node is destination node, or this node sends route request information and gives request response transmitting element 64 when having the route that arrives destination node;
The coding efficiency value is confirmed unit 62, is used to calculate the coding efficiency value of this node, and sends to route request information delivery unit 63;
Route request information delivery unit 63 is used for to neighbor node broadcasting route request information, in route request information, carries the coding efficiency value of this node that the coding efficiency value confirms that unit 62 is determined;
Request response transmitting element 64; Be used for according to the route request information that receives; Return the request response that comprises from source node arrival destination node path to source node, in request response, carry each nodal information and coding efficiency value information in the said path.
Wherein, the coding efficiency value information that carries can be: calculate by request response transmitting element 64 each node in the path the coding efficiency value and value; In request response, carry calculate and value; The coding efficiency value of each node in the path of perhaps directly in request response, carrying.
Preferably, wireless network node device provided by the invention can also comprise:
Route storage update unit 65 is used to store this node route list; And the routing iinformation that carries in the route request information according to 61 receptions of route request information reception/judging unit, upgrade local routing table of storing;
Route request information reception/judging unit 61 according to the routing table of storage in the route storage update unit 65, judges whether this node is destination node or whether has the route that arrives destination node.
Wherein, the coding efficiency value confirms that the concrete structure sketch map of unit 62 is as shown in Figure 7, may further include:
The network code mode is confirmed subelement 621, is used for a plurality of data flow according to the reception of this node, determines the network code mode that can adopt;
Coding efficiency value computation subunit 622 is used for being directed against respectively each network code mode of determining, according to preset coding benefit value calculation rule and each neighbor node corresponding codes benefit value, and summation;
The coding efficiency value is confirmed subelement 623, is used for maximum and the coding efficiency value of value as this node, and sends to route request information delivery unit 63.
The present invention also provides a kind of wireless network source node device, and its structural representation is as shown in Figure 8, comprising: route request information transmitting element 81, request response receiving element 82 and route are confirmed unit 83; Wherein:
Route request information transmitting element 81 is used to broadcast route request information and gives network node;
Request response receiving element 82 is used to receive the request response that arrives the destination node path from source node that comprises that network node returns, and in request response, carries each nodal information and coding efficiency value information in the said path;
Route is confirmed unit 83, is used for the said coding efficiency value information that receives according to request response receiving element 82, determines current route.
Wherein, route confirms that unit 83 determines the mode of current route and comprise:
If carry in the request response that receives and be worth the coding efficiency value sum of each node in the path that the node that returns request response calculates (said and the value serve as reasons); Then determine the maximum and value of carrying in each request response of returning, confirm as current route with the corresponding path of value maximum;
If the coding efficiency value of carrying each node in the path in the request response that receives, then calculate respectively each node in the path of carrying in each request response of returning the coding efficiency value and value, current route is confirmed as in maximum path with the value correspondence.
Preferably, wireless network source node device provided by the invention can also comprise:
Heavy-route unit 84, when the heavy-route condition that is provided with satisfied, indication route request information transmitting element 81 was broadcasted route request information once more, confirms route again.
In sum; Because when the present invention adopts the various network coded system to each network node through calculating; The coding efficiency value sum of its neighbor node is got and is worth maximum coding efficiency value and sends its neighbor node to as the coding efficiency value of this node, and its neighbor node is adopted in the same way and handled; Behind the transfer path of determining from the source node to the destination node, return request response (routereply) to source node.And source node is according to a plurality of RREP that receive; A paths of choosing coding efficiency value sum maximum in each bar transfer path again is as current route; Thereby make when adopting the current route of determining to carry out the business datum transmission; Its network code benefit is maximum, and more network coding opportunity is arranged, and has greatly improved the transmission efficiency of whole network.
Obviously, those skilled in the art can carry out various changes and modification to the present invention and not break away from the spirit and scope of the present invention.Like this, belong within the scope of claim of the present invention and equivalent technologies thereof if of the present invention these are revised with modification, then the present invention also is intended to comprise these changes and modification interior.
Claims (17)
1. a determination method of wireless routing is characterized in that, comprising:
After network node receives route request information, judge whether this node is destination node or whether has the route that arrives destination node;
When judging this node is not destination node; And when this node does not have the route that arrives destination node, calculate the coding efficiency value of this node and be broadcast to neighbor node, wherein through route request information; The coding efficiency value of calculating this node comprises: based on a plurality of data flow of this node reception; Determine the network code mode that can adopt, respectively to each network code mode of determining, based on each neighbor node corresponding codes benefit value of preset coding benefit value calculation rule; And summation, with maximum and the coding efficiency value of value as this node;
When judging this node is destination node; Or this node is when having the route that arrives destination node; Return the request response that comprises from source node arrival destination node routing information to source node; And in the described request response message, carrying the coding efficiency value information, said source node is determined current route according to said coding efficiency value information.
2. the method for claim 1 is characterized in that, before source node returns the described request response message, also comprises: calculate each node in the said path the coding efficiency value and value;
The said coding efficiency value information that in the described request response message, carries is said and value;
Said source node is determined current route according to said coding efficiency value information, specifically comprises: said source node is determined the maximum and value of carrying in each request response of returning, confirms as current route with maximum with the corresponding said path of value.
3. the method for claim 1 is characterized in that, the coding efficiency value that the said coding efficiency value information that in the described request response message, carries is each node in the said path;
Said source node is determined current route according to said coding efficiency value information; Specifically comprise: said source node calculates the said coding efficiency value of carrying in each request response of returning and value, current route is confirmed as in maximum said path with the value correspondence.
4. the method for claim 1 is characterized in that, the said a plurality of data flow that receive according to this node are determined the network code mode that can adopt, and comprising:
Any data stream of choosing in said a plurality of data flow carries out network code; And from said a plurality of data flow, select the data flow combination to carry out network code arbitrarily.
5. the method for claim 1 is characterized in that, and is said respectively to each network code mode of determining, according to preset coding benefit value calculation rule and each neighbor node corresponding codes benefit value, comprising:
When a kind of network code mode that employing is determined, said neighbor node can not correct decoding, the packet after the decoding is local data accepted bag or decoding back packet when being local unwanted packet, and this neighbor node corresponding codes benefit value is 0; When said neighbor node can correct decoding goes out the desired data bag, calculate this neighbor node corresponding codes benefit value according to preset coding benefit value computing function.
6. method as claimed in claim 5; It is characterized in that; Said coding efficiency value computing function according to the business datum that transmits to transfer delay, bandwidth, throughput or this node and radio link quality between the neighbor node require different, be provided with respectively or revise.
7. method as claimed in claim 6 is characterized in that, said coding efficiency value computing function comprises: I (n
i)=(1-e
i) g
i
Wherein, n
iRepresent i neighbor node in n the neighbor node, I (n
i) for being directed against this node I, neighbor node n
iThe coding efficiency value, e
iFor this node I to neighbor node n
iThe link error probability, g
iThe sign of being benefited for the encoding factor, its concrete value is: as certain network code mode of employing, neighbor node n
iWhen can correct decoding going out the desired data bag, value is 1, otherwise value is 0.
8. the method for claim 1 is characterized in that, also comprises:
After network node receives route request information, according to the routing table of the local storage of the updating route information that carries in the said route request information.
9. the method for claim 1 is characterized in that, also comprises: when the heavy-route condition that is provided with satisfied, said source node was broadcasted route request information once more, confirmed route again.
10. method as claimed in claim 9 is characterized in that, confirms again when said heavy-route condition when setting satisfies specifically to comprise route:
Before the current route that use is determined transmits the data flow end, when said source node detects network topological change, broadcast route request information once more, confirm route again; Perhaps
When offered load surpassed preset threshold, said source node was broadcasted route request information once more, confirmed route again; Perhaps
Receive the routing error RRER of other network node transmission when said source node after, broadcast route request information once more, confirm route again.
11. a wireless network node device is characterized in that, comprising: route request information reception/judging unit, coding efficiency value are confirmed unit, route request information delivery unit and request response transmitting element;
Said route request information reception/judging unit is used to receive route request information, and judges whether this node is destination node or whether has the route that arrives destination node; When judging this node is not destination node, and this node do not have the route that arrives destination node, sends said route request information and gives said route request information delivery unit, and start said coding efficiency value and confirm the unit; When judging this node is destination node, or this node sends said route request information and gives described request response message transmitting element when having the route that arrives destination node;
Said coding efficiency value determining unit; Be used to calculate the coding efficiency value of this node, and send to said route request information delivery unit, wherein; The coding efficiency value of calculating this node comprises: according to a plurality of data flow of this node reception; Determine the network code mode that can adopt, respectively to each network code mode of determining, according to each neighbor node corresponding codes benefit value of preset coding benefit value calculation rule; And summation, with maximum and the coding efficiency value of value as this node;
Said route request information delivery unit is used in said route request information, carrying the coding efficiency value that said coding efficiency value is confirmed this node that the unit is determined to neighbor node broadcasting route request information;
Described request response message transmitting element; Be used for according to the route request information that receives; Return the request response that comprises from source node arrival destination node path to source node, in the described request response message, carry each nodal information and coding efficiency value information in the said path.
12. device as claimed in claim 11 is characterized in that, described request response message transmitting element also is used for, calculate each node in the said path the coding efficiency value and value; The said coding efficiency value information that in the described request response message, carries is said and value; Perhaps
The coding efficiency value that the said coding efficiency value information that in the described request response message, carries is each node in the said path.
13. device as claimed in claim 11 is characterized in that, said coding efficiency value confirms that the unit comprises:
The network code mode is confirmed subelement, is used for a plurality of data flow according to the reception of this node, determines the network code mode that can adopt;
Coding efficiency value computation subunit is used for being directed against respectively each network code mode of determining, according to preset coding benefit value calculation rule and each neighbor node corresponding codes benefit value, and summation;
The coding efficiency value is confirmed subelement, is used for maximum and the coding efficiency value of value as this node, and sends to said route request information delivery unit.
14. like claim 11,12 or 13 described devices, it is characterized in that, also comprise:
Route storage update unit is used to store this node route list; And the routing iinformation that carries in the route request information according to said route request information reception/judging unit reception, upgrade local routing table of storing;
Said route request information reception/judging unit according to the routing table of storing in the said route storage update unit, judges whether this node is destination node or whether has the route that arrives destination node.
15. a wireless network source node device is characterized in that, comprising: route request information transmitting element, request response receiving element and route are confirmed the unit;
Said route request information transmitting element is used to broadcast route request information and gives network node;
Described request response message receiving element; Be used to receive the request response that arrives the destination node path from source node that comprises that network node returns; In the described request response message, carry each nodal information and coding efficiency value information in the said path, wherein, said coding efficiency value information is confirmed according to the coding efficiency value of node; Wherein the coding efficiency value of computing node comprises: according to a plurality of data flow of this node reception; Determine the network code mode that can adopt, respectively to each network code mode of determining, according to each neighbor node corresponding codes benefit value of preset coding benefit value calculation rule; And summation, with maximum and the coding efficiency value of value as this node;
Said route is confirmed the unit, is used for the said coding efficiency value information that receives according to described request response message receiving element, determines current route.
16. device as claimed in claim 15 is characterized in that, said route confirms that the unit also is used for, and determines the maximum and value of carrying in each request response of returning, confirms as current route with maximum with the corresponding said path of value; Said is the coding efficiency value sum of each node in the path with being worth; Perhaps
Said route confirms that the unit also is used for, calculate each node in the path of carrying in each request response return the coding efficiency value and value, current route is confirmed as in maximum said path with the value correspondence.
17. device as claimed in claim 15 is characterized in that, also comprises:
The heavy-route unit when the heavy-route condition that is provided with satisfies, indicates said route request information transmitting element to broadcast route request information once more, confirms route again.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101152523A CN101610559B (en) | 2008-06-19 | 2008-06-19 | Determination method of wireless routing and node device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101152523A CN101610559B (en) | 2008-06-19 | 2008-06-19 | Determination method of wireless routing and node device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101610559A CN101610559A (en) | 2009-12-23 |
| CN101610559B true CN101610559B (en) | 2012-03-28 |
Family
ID=41484081
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008101152523A Expired - Fee Related CN101610559B (en) | 2008-06-19 | 2008-06-19 | Determination method of wireless routing and node device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101610559B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101800629B (en) * | 2010-04-07 | 2013-03-20 | 无锡泛联物联网科技股份有限公司 | Network coding method of code efficiency perception |
| CN101883394B (en) * | 2010-05-10 | 2012-11-28 | 南京大学 | Method for supporting coding opportunity discovery of wireless ad hoc network |
| CN101883048B (en) * | 2010-06-25 | 2012-10-10 | 陶洋 | Routing method of multi-dimensional network |
| CN101951656B (en) * | 2010-10-07 | 2013-06-12 | 西安电子科技大学 | Method for designing wireless network routing protocol with energy efficiency and coding perception |
| CN104486040B (en) * | 2014-12-15 | 2017-10-24 | 西安电子科技大学 | High efficient coding perception route method based on cache management |
| CN106130604A (en) * | 2016-07-19 | 2016-11-16 | 成都之达科技有限公司 | Mobile unit power line communication method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1819545A (en) * | 2004-02-12 | 2006-08-16 | 三星电子株式会社 | Multicast method in network |
| CN1852256A (en) * | 2006-02-20 | 2006-10-25 | 华为技术有限公司 | Method and system for data transmission in wireless net-like network |
| EP1324515B1 (en) * | 2001-12-21 | 2007-02-21 | Itt Manufacturing Enterprises, Inc. | Method and apparatus for routing information in satellite communication networks |
-
2008
- 2008-06-19 CN CN2008101152523A patent/CN101610559B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1324515B1 (en) * | 2001-12-21 | 2007-02-21 | Itt Manufacturing Enterprises, Inc. | Method and apparatus for routing information in satellite communication networks |
| CN1819545A (en) * | 2004-02-12 | 2006-08-16 | 三星电子株式会社 | Multicast method in network |
| CN1852256A (en) * | 2006-02-20 | 2006-10-25 | 华为技术有限公司 | Method and system for data transmission in wireless net-like network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101610559A (en) | 2009-12-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP5550792B2 (en) | Method for finding a set of routes in a network | |
| US8005054B2 (en) | Communication system, communication method, communication terminal device, control method thereof, and program | |
| CN101124568B (en) | System and method for routing ISIS traffic through unidirectional links of a computer network | |
| CN101610559B (en) | Determination method of wireless routing and node device | |
| US7773569B2 (en) | System and method for efficiently routing data packets and managing channel access and bandwidth in wireless multi-hopping networks | |
| CN100440853C (en) | Processing broadcast data in a mobile ac-hoc network | |
| US8787257B2 (en) | Network communication system, node device, routing method and routing program | |
| CN102084689B (en) | Selective priori reactive routing | |
| Gkantsidis et al. | Multipath code casting for wireless mesh networks | |
| CN1679358A (en) | Multiple path reactive routing in a mobile ad hoc network | |
| WO1999046899A2 (en) | Routing method for wireless and distributed systems | |
| US20110122878A1 (en) | Method of percolation networking architecture for data transmission and routing | |
| US20140293787A1 (en) | Method for optimizing the capabilities of an ad hoc telecommunication network | |
| CN101969406A (en) | Multi-constraint QoS (Quality of Service) routing method based on selective detection | |
| JP2010093387A (en) | Wireless communication system, transmission terminal, relay terminal, data transmission method, data reception method, and computer program | |
| WO2009036792A1 (en) | Compressed source routing | |
| JP2007135136A (en) | Radio device and radio network system with radio device | |
| JP2006287538A (en) | Wireless device | |
| Lee et al. | QoS‐aware routing and power control algorithm for multimedia service over multi‐hop mobile ad hoc network | |
| EP2308260B2 (en) | A medium access control forwarding protocol | |
| KR100754279B1 (en) | Routing metric method of the ad-hoc on-demand distance vector routing over wireless networks | |
| JP2006050377A (en) | Radio network system | |
| JP2010081314A (en) | Data delivery method, and radio communication system | |
| Akshay et al. | Bandwidth optimized multicast routing algorithm based on hybrid mesh and tree structure with collision control in MANET using lempel-ziv-oberhumer method | |
| JP2008118274A (en) | Network communication apparatus and communication program for ring type network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| 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: 20120328 Termination date: 20200619 |