CN108156087B - Clustering, flow distribution, coding negotiation and data forwarding method and device - Google Patents

Clustering, flow distribution, coding negotiation and data forwarding method and device Download PDF

Info

Publication number
CN108156087B
CN108156087B CN201810058607.3A CN201810058607A CN108156087B CN 108156087 B CN108156087 B CN 108156087B CN 201810058607 A CN201810058607 A CN 201810058607A CN 108156087 B CN108156087 B CN 108156087B
Authority
CN
China
Prior art keywords
coding
network node
node
data
flow
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.)
Active
Application number
CN201810058607.3A
Other languages
Chinese (zh)
Other versions
CN108156087A (en
Inventor
张玲华
陶启宏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing University of Posts and Telecommunications
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 Nanjing University of Posts and Telecommunications filed Critical Nanjing University of Posts and Telecommunications
Priority to CN201810058607.3A priority Critical patent/CN108156087B/en
Publication of CN108156087A publication Critical patent/CN108156087A/en
Application granted granted Critical
Publication of CN108156087B publication Critical patent/CN108156087B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
    • H04L47/626—Queue scheduling characterised by scheduling criteria for service slots or service orders channel conditions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a clustering, flow distribution, coding negotiation and data forwarding method and a device. The method clusters network nodes, distributes data traffic to coding paths, and selects intermediate nodes of a coding link to perform physical layer network coding so as to reduce data transmission times. The invention can create network coding opportunity in transmission, give consideration to the overall efficiency of the network, reduce the transmission times in the network, improve the throughput and prolong the life cycle of the network.

Description

Clustering, flow distribution, coding negotiation and data forwarding method and device
Technical Field
The invention relates to a clustering, flow distribution, coding negotiation and data forwarding method and a device, belonging to the technical field of wireless network communication.
Background
In modern communication technology, research on wireless communication technology becomes more and more important and more practical. In a Wireless Sensor Network (WSN), the amount of data to be transmitted is increasing, which is a great challenge for the Sensor with limited hardware conditions.
The data transmission mode of the wireless sensor network is multi-hop storage and forwarding, and intermediate nodes participating in data transmission are only responsible for forwarding data. The core operation of the conventional route store-and-forward is overturned by the network coding theory proposed by R Ahlswede et al in 2000. The network coding is an information exchange technology combining routing and coding, and the core idea of the network coding is to perform linear or nonlinear processing on data before each node in the network forwards the data. And after receiving enough coded data packets, the destination node performs decoding operation to acquire data. According to the maximum flow-minimum cut theorem in graph theory, the maximum capacity of multicast routing transmission can be achieved by the network through network coding, and the transmission efficiency of data is improved, so that the throughput of the network is improved. Applying network coding in a wireless network may result in gains in throughput, security, and robustness. Especially in a WSN network with limited bandwidth and energy, the improvement brought by network coding has practicability.
For networks adopting different routing forms, the most common and effective method for applying network coding is to utilize reverse data flow, when data links in opposite directions exist on intermediate nodes, coding operation (for example, exclusive-or operation) can be performed on the data, and then the data is broadcasted to adjacent nodes, and a destination node at a link end can decode a data packet through the data to acquire required data. By this operation, the number of data transmissions in the network can be reduced, and throughput can be improved. However, the passive waiting for coding opportunities misses many potential coding opportunities, and the network throughput cannot be further improved.
Disclosure of Invention
In order to solve the above problems, the present invention provides a method and an apparatus for clustering, traffic distribution, coding negotiation and data forwarding. The method can actively create coding opportunities, give consideration to the overall efficiency of the network, and optimize the distribution flow, thereby reducing the network transmission times, improving the network throughput and prolonging the life cycle.
The invention adopts the following technical scheme for solving the technical problems:
on one hand, the invention provides a network node clustering method based on reverse flow, each network node comprises a range communication information table, a data outlet flow table and a data inlet flow table, wherein the range communication information table RangeTable comprises a network node number rid in the communication range of the network node and a data inlet flow table rid _ RangeIntable of the network node in the communication range of the network node, the data outlet flow table OutTable comprises an end network node number outed of the data flow taking the network node as a starting point and a network node number outed in the communication range of the end network node of the data flow taking the network node as a starting point, and the data inlet flow table InTable comprises an initial network node number ind of the data flow taking the network node as a stopping point;
for any network node, the clustering method comprises the following steps:
step 1, traversing each init in the InTable of the network node, searching the OutTable, finding out the outID which is the same as the init, and if the init is successful, executing step 2; otherwise, searching OutTable, finding outid with same outid and init, and if success, executing step 3; otherwise, traversing rid of the RangeTable, finding outid with the same outid and rid _ RangeIntable _ ind in the OutTable according to rid _ RangeIntable _ ind, and if success, executing step 4; otherwise, finishing clustering; wherein, rid _ rangeIntable _ init represents the starting network node number of the data flow taking the network node in rid _ rangeIntable as the termination point;
step 2, if the set conditions are met, dividing the network node and the found network node corresponding to the outid into a cluster and generating a cluster number, otherwise, ending;
step 3, if the set conditions are met, dividing the network node, the network node corresponding to the found outid and the network node corresponding to the corresponding init into a cluster and generating a cluster number, otherwise, ending;
step 4, if the set conditions are met, dividing the network node, the found network node corresponding to the rid, the found network node corresponding to the outid and the found network node corresponding to the rid _ RangeIntabecke _ init into a cluster and generating a cluster number, otherwise, ending;
wherein the setting conditions are as follows: flow correlation coefficient C of outgoing data Flow1 and incoming data Flow212Greater than a predetermined threshold C.
As a further optimization of the invention, the flow correlation coefficient C12The calculation formula of (2) is as follows:
Figure GDA0002835439270000021
where f1 and f2 are Flow rates of Flow1 and Flow2, respectively.
On the other hand, the present invention further provides a network coding traffic distribution method based on data Flow load, where any network node completes clustering according to the network node clustering method according to any one of claims 1 or 2, and the network node distributes the intra-cluster traffic of the network node to a coding link, where the coding link is a link where an intra-cluster outgoing data Flow1 and an intra-cluster incoming data Flow2 are located, and specifically as follows:
the size of the incoming data Flow on the Link1 where the Flow1 is located is as follows:
Figure GDA0002835439270000022
the size of the outgoing data Flow on the Link1 where the Flow1 is located is as follows:
Figure GDA0002835439270000023
the size of the incoming data Flow on the Link2 where the Flow2 is located is as follows:
Figure GDA0002835439270000024
the size of the outgoing data Flow on the Link2 where the Flow2 is located is as follows:
Figure GDA0002835439270000025
wherein f1 and f2 are Flow rates of Flow1 and Flow2, respectively; flowload1And FlowLoad2Link average load for Link1 and Link2, respectively, if FlowLoad1≥FlowLoad2Then, then
Figure GDA0002835439270000031
Figure GDA0002835439270000032
If FlowLoad1<FlowLoad2Then, then
Figure GDA0002835439270000033
Figure GDA0002835439270000034
As a further optimization scheme of the invention, the calculation formula of the Link average load of Link1 and Link2 is as follows:
Figure GDA0002835439270000035
where i is 1 or 2, n is the number of network nodes on the link, NodeLoadkThe load of the kth network node on the link.
On the other hand, the invention also provides a physical layer coding negotiation and data forwarding method, after any network node completes clustering according to the network node clustering method as claimed in any one of claims 1 or 2, and performs traffic distribution according to the traffic distribution method as claimed in any one of claims 3 or 4, the network node selects the network node at the median of the hop counts of the coding links as the intermediate node N and sends the cluster number of the cluster to the intermediate node N, selects two network nodes adjacent to the intermediate node N in the coding links as the coding nodes N1, N2, and the intermediate node stores the cluster number in the ClusterTable; the negotiation and data forwarding method comprises the following steps:
step A, the intermediate node N receives a request frame RTS from the coding node N1, judges whether cluster identification in the RTS frame exists in a ClusterTable, if not, executes the step B, otherwise, executes the step C;
step B, the intermediate node N sends a Clear To Send (CTS) frame to the coding node N1, waits for receiving a data packet, stores the data packet in a receiving queue and finishes the negotiation;
step C, the intermediate node N sends a coding negotiation request frame RTNC to the coding node N2, if the intermediate node N does not receive a coding negotiation permission frame CTNC returned by the coding node N2, the step B is executed; otherwise, executing step D;
step D, the intermediate node N sends a coding transmission request frame RTNCS to the coding nodes N1 and N2, prepares to receive a coding transmission permission frame CTNCS from the coding nodes N1 and N2, and executes step E;
step E, the intermediate node N receives the CTNCS frames from N1 and N2, then receives the superposed signal N _ r simultaneously transmitted by the coding nodes N1 and N2, and performs signal mapping according to a signal mapping function F (N _ r) to obtain a coding signal N _ s and stores the coding signal N _ s,
Figure GDA0002835439270000036
step F, after the intermediate node N sends a section of synchronous signal SYNC, the coding signal N _ s obtained in the step E is broadcasted to the coding nodes N1 and N2, and the intermediate node N waits for acknowledgement frames ACK from the coding nodes N1 and N2;
and G, after the coding nodes N1 and N2 acquire the N _ s broadcast by the intermediate node, decoding by utilizing exclusive OR calculation, and ending.
On the other hand, the invention also provides a distributed cross-layer network coding flow distribution method based on reverse flow, which comprises the following steps:
step one, a network node performs clustering according to the clustering method of any one of claims 1 or 2;
step two, the network node optimally distributes the intra-cluster flow to the coding links according to the distribution method of any one of claims 3 or 4;
step three, according to the coding negotiation and data forwarding method of claim 5, the intermediate node cooperates with the coding node to perform physical layer exclusive-or coding, and the coding node decodes and forwards data by using exclusive-or operation.
In another aspect, the present invention further provides a cluster apparatus based on reverse flow, including:
the range communication information table RangeTable storage module is used for storing a network node number rid in the communication range of the network node and an incoming data flow rid _ RangeIntable of the network node in the communication range of the network node;
the data flow output table outTable storage module is used for storing an end network node number outid of the data flow taking the network node as a starting point and a network node number outid in a communication range of the end network node of the data flow taking the network node as a starting point;
the data flow entry table storage module is used for storing the initial network node number in of the data flow taking the network node as the termination point;
the reverse flow retrieval module is used for finding out reverse data flows with potential network coding opportunities, and the specific method comprises the following steps: searching OutTable after going through each init in InTable of the network node, finding outTable, finding outid which is the same as the init, if the outTable is successful, the corresponding data flow in the OutTable is reverse flow, otherwise, finding OutTable, finding outrid which is the same as the init, if the outTable is successful, the corresponding data flow in the OutTable is reverse flow, otherwise, traversing rid of RangeTable, finding outrid which is the same as outrid and rid _ RangeIntable _ init according to rid _ RangeIntable _ init, and if the outTable is successful, the corresponding data flow in the OutTable is reverse flow;
a clustering module, configured to cluster the start and end network nodes of the retrieved reverse flows according to the network node clustering method according to any one of claims 1 or 2.
As a further optimization scheme of the present invention, the clustering device further comprises a timing module, configured to time the calculation of the stream correlation coefficient.
In another aspect, the present invention further provides a data encoding and transmitting apparatus, including:
the intermediate node and coding node selection module is used for selecting a network node at the median of the hop counts of the coding links as an intermediate node and selecting two network nodes adjacent to the intermediate node of the coding links as coding nodes;
a cluster table storage module, configured to store, by the intermediate node, a cluster number generated by clustering by the clustering device in a ClusterTable table;
the coordination module is used for requesting synchronous transmission from the intermediate node to the coding node;
the coding receiving module is used for receiving the superposed electromagnetic wave waveform signals synchronously sent by the coding nodes by the intermediate node;
the signal mapping module is used for mapping the signal received by the coding receiving module by the intermediate node to generate a coding signal;
the coding forwarding module is used for broadcasting and sending the mapped coding signal to the coding node by the intermediate node;
and the decoding module is used for decoding the received coded signals by the coding node by using the locally stored data.
Compared with the prior art, the invention adopting the technical scheme has the following technical effects: the invention can create network coding opportunities in the network; giving consideration to the overall efficiency of the network and distributing flow; the transmission times in the network are reduced, the throughput is improved, and the life cycle of the network is prolonged.
Drawings
FIG. 1 is a flow chart of a distributed cross-layer network coding traffic distribution method based on reverse flow according to the present invention;
FIG. 2 is a schematic diagram of a clustering process based on reverse flow, wherein (a) is a schematic diagram of a first clustering operation, (b) is a schematic diagram of a second clustering operation, and (c) is a schematic diagram of a third clustering operation;
FIG. 3 is a schematic diagram of the present invention with respect to link traffic distribution;
fig. 4 is a schematic diagram of the process of the present invention for data encoding transmission.
Detailed Description
The technical scheme of the invention is further explained in detail by combining the attached drawings:
as shown in fig. 1, the present invention discloses a method for distributing distributed cross-layer network coding traffic based on reverse flow, which comprises the following steps:
firstly, clustering is carried out on a network node according to a data stream;
step two, the network node optimally distributes the flow to the coding link;
thirdly, the intermediate node cooperates with the coding node to carry out physical layer XOR coding;
and step four, the coding node decodes the data by utilizing the XOR operation and forwards the data.
In the first step, the network node needs to maintain a communication information table, an outgoing data flow table and an incoming data flow table. Wherein:
entries in the Range communication information Table (RangeTable) include: a network node number (rid) in the communication range of the network node and an incoming data flow table (rid _ RangeIntable) of the network node in the communication range of the network node;
the entry in the outgoing data flow table (OutTable) includes: an end network node number (outid) of the data flow taking the network node as a starting point and a network node number (outid) in a communication range of the end network node of the data flow taking the network node as a starting point;
the entry in the inbound data flow table (Table) contains: the number of the start network node (init) of the data flow with the current network node as the termination point.
For any network node, the network node clustering method based on the reverse flow comprises the following steps:
1. reverse flow retrieval: searching OutTable through each init in InTable of the network node, finding outTable, finding outid which is the same as the init, and if the outTable is successful, executing the step 2; otherwise, searching OutTable, finding outid with same outid and init, and if success, executing step 3; otherwise, traversing rid of the RangeTable, finding outid with the same outid and rid _ RangeIntable _ ind in the OutTable according to rid _ RangeIntable _ ind, and if success, executing step 4; otherwise, finishing clustering; wherein, rid _ rangeIntable _ init represents the starting network node number of the data flow taking the network node in rid _ rangeIntable as the termination point.
2. If the set condition is satisfied, performing clustering operation 1: and dividing the network node and the network node corresponding to the found outid into a cluster and generating a cluster number, otherwise, ending. As shown in fig. 2 (a), for node a: node a is the end point of the data Flow1 from node B as the starting point and node B is the end point of the data Flow2 from node a as the starting point, then node A, B is divided into clusters Cluster _ a _ B.
3. If the set condition is satisfied, executing clustering operation 2: and dividing the network node, the network node corresponding to the found outid and the network node corresponding to the corresponding init into a cluster and generating a cluster number, otherwise, ending. As shown in fig. 2 (b), for node a: node a to node B there is a data Flow1, node C has a data Flow2 to node a, node C is within range of node B, then node A, B, C is divided into clusters Cluster _ a _ BC.
4. If the set condition is satisfied, performing clustering operation 3: and dividing the network node, the found network node corresponding to the rid, the found network node corresponding to the outid and the found network node corresponding to the rid _ RangeIntableInid into a cluster and generating a cluster number, otherwise, ending. As shown in fig. 2 (c), for node a: node a to node B there is a data Flow1, node C has a data Flow2 to node D, node C is within range of node B, node D is within range of node a, then node A, B, C, D is divided into clusters Cluster _ AD _ BC.
The setting conditions are as follows: flow correlation coefficient C of outgoing data Flow1 and incoming data Flow212Greater than a predetermined threshold C.
The flow correlation coefficient is repeatedly calculated according to a timing cycle, and the flow correlation coefficient C12The calculation formula of (2) is as follows:
Figure GDA0002835439270000061
where f1 and f2 are Flow rates of Flow1 and Flow2, respectively.
The flow allocation in the present invention is intra-cluster flow allocation performed based on the clustering result. And any network node completes clustering according to the clustering method and distributes the Flow in the cluster where the network node is located to the coding link, wherein the coding link is a link where an outgoing data Flow1 and an incoming data Flow2 are located in the cluster.
Link average load FlowLoad of links 1 and 2 of links where Flow1 and Flow2 are located1And FlowLoad2Calculating the formula:
Figure GDA0002835439270000062
where i is 1 or 2, n is the number of network nodes on the link, NodeLoadkThe load of the kth network node on the link (not including the load of data Flow1 or Flow 2).
As shown in fig. 3, the network node is according toLink average load is optimized for traffic distribution for data flows Flow1 and Flow 2. Suppose FlowLoad1≥FlowLoad2The flow f _1 and f _2 calculation methods of the optimized links Link1 and Link2 are as follows:
if f1+ f2 is more than or equal to Flowload1-FlowLoad2,f_1＝(f1+f2-FlowLoad1+FlowLoad2)/2，f_2＝(f1+f2+FlowLoad1-FlowLoad2) 2; otherwise, f1 is 0, and f _2 is (f1+ f2+ FlowLoad)1-FlowLoad2)/2。
Similarly, when Flowload1<FlowLoad2Then, the optimized Link1 and Link2 flow f _1 and f _2 calculation methods are as follows: if f1+ f2 is more than or equal to Flowload2-FlowLoad1,f_2＝(f1+f2-FlowLoad1+FlowLoad2)/2，f_1＝(f1+f2+FlowLoad1-FlowLoad2) 2; otherwise, f2 is 0, and f _1 is (f1+ f2+ FlowLoad)1-FlowLoad2)/2。
The size of the incoming data Flow on the Link1 where the Flow1 is located is as follows:
Figure GDA0002835439270000071
the size of the outgoing data Flow on the Link1 where the Flow1 is located is as follows:
Figure GDA0002835439270000072
the size of the incoming data Flow on the Link2 where the Flow2 is located is as follows:
Figure GDA0002835439270000073
the size of the outgoing data Flow on the Link2 where the Flow2 is located is as follows:
Figure GDA0002835439270000074
after the clustering and the flow distribution are completed, the network node selects a network node at the median of the hop counts of the coding links as an intermediate node and sends the cluster number of the cluster to the intermediate node, two network nodes adjacent to the intermediate node in the coding links are selected as coding nodes, and the intermediate node stores the cluster number in a ClusterTable table.
As shown in fig. 4, N is an intermediate node, and N1 and N2 are encoding nodes, respectively, and the data encoding and transmitting method of the present invention has the following processes:
step A, the intermediate node N receives a request frame RTS from the coding node N1, judges whether cluster identification in the RTS frame exists in a ClusterTable, if not, executes the step B, otherwise, executes the step C;
step B, the intermediate node N sends a Clear To Send (CTS) frame to the coding node N1, waits for receiving a data packet, stores the data packet in a receiving queue and finishes the negotiation;
step C, the intermediate node N sends a coding negotiation request frame RTNC to the coding node N2, if the intermediate node N does not receive a coding negotiation permission frame CTNC returned by the coding node N2, the step B is executed; otherwise, executing step D;
step D, the intermediate node N sends a coding transmission request frame RTNCS to the coding nodes N1 and N2, prepares to receive a coding transmission permission frame CTNCS from the coding nodes N1 and N2, and executes step E;
step E, the intermediate node N receives CTNCS frames from N1 and N2 respectively, then receives a superposed signal N _ r simultaneously sent by the coding nodes N1 and N2, and performs signal mapping according to a signal mapping function F (N _ r) to obtain a coding signal N _ s and stores the coding signal N _ s;
step F, after the intermediate node N sends a section of synchronous signal SYNC, the coding signal N _ s obtained in the step E is broadcasted to the coding nodes N1 and N2, and the intermediate node N waits for acknowledgement frames ACK from the coding nodes N1 and N2;
the signal mapping function is:
Figure GDA0002835439270000081
and G, after the coding nodes N1 and N2 acquire the N _ s broadcast by the intermediate node, decoding by utilizing exclusive OR calculation according to own data, and ending.
As shown in table 1, the encoding nodes N1 and N2 use BPSK coding, N1_ s and N2_ s are transmission waveform signals, N _ r is a superimposed waveform signal received by the intermediate node N, and a signal mapped by the signal mapping function is a network layer data of N _ s and N is N _ s. The signal mapping function may make N1 ≦ N2, i.e., the physical layer exclusive-or network coding is completed.
Table 1 encoding nodes N1 and N2 use BPSK encoding
N1 N2 N1_s N2_s N_r N_s N
0 1 -1 1 0 1 1
0 0 -1 -1 -2 -1 0
1 1 1 1 2 -1 0
1 0 1 -1 0 1 1
The above description is only an embodiment of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can understand that the modifications or substitutions within the technical scope of the present invention are included in the scope of the present invention, and therefore, the scope of the present invention should be subject to the protection scope of the claims.

Claims (9)

1. A network node clustering method based on reverse flow is characterized in that each network node comprises a range communication information table, a data outlet flow table and a data inlet flow table, wherein the range communication information table RangeTable comprises a network node number rid in the communication range of the network node and a data inlet flow table rid _ RangeIntable of the network node in the communication range of the network node, the data outlet flow table OutTable comprises an end network node number outed of the data flow taking the network node as a starting point and a network node number outed in the communication range of the end network node of the data flow taking the network node as a starting point, and the data inlet flow table InTable comprises an initial network node number ind of the data flow taking the network node as a stopping point;
for any network node, the clustering method comprises the following steps:
step 1, traversing each init in the InTable of the network node, searching the OutTable, finding out the outID which is the same as the init, and if the init is successful, executing step 2; otherwise, searching OutTable, finding outid with same outid and init, and if success, executing step 3; otherwise, traversing rid of the RangeTable, finding outid with the same outid and rid _ RangeIntable _ ind in the OutTable according to rid _ RangeIntable _ ind, and if success, executing step 4; otherwise, finishing clustering; wherein, rid _ rangeIntable _ init represents the starting network node number of the data flow taking the network node in rid _ rangeIntable as the termination point;
step 2, if the set conditions are met, dividing the network node and the found network node corresponding to the outid into a cluster and generating a cluster number, otherwise, ending;
step 3, if the set conditions are met, dividing the network node, the network node corresponding to the found outid and the network node corresponding to the corresponding init into a cluster and generating a cluster number, otherwise, ending;
step 4, if the set conditions are met, dividing the network node, the found network node corresponding to the rid, the found network node corresponding to the outid and the found network node corresponding to the rid _ RangeIntabecke _ init into a cluster and generating a cluster number, otherwise, ending;
wherein the setting conditions are as follows: flow correlation coefficient C of outgoing data Flow1 and incoming data Flow212Greater than a predetermined threshold C.
2. The method according to claim 1, wherein the flow correlation coefficient C is a flow correlation coefficient12The calculation formula of (2) is as follows:
Figure FDA0002835439260000011
where f1 and f2 are Flow rates of Flow1 and Flow2, respectively.
3. A network coding traffic distribution method based on data Flow load, wherein any network node performs clustering according to the network node clustering method according to any one of claims 1 or 2, and the network node distributes the intra-cluster traffic of the network node to coding links, wherein the coding links are links where an intra-cluster outgoing data Flow1 and an intra-cluster incoming data Flow2 are located, and specifically as follows:
the size of the incoming data Flow on the Link1 where the Flow1 is located is as follows:
Figure FDA0002835439260000012
the size of the outgoing data Flow on the Link1 where the Flow1 is located is as follows:
Figure FDA0002835439260000021
the size of the incoming data Flow on the Link2 where the Flow2 is located is as follows:
Figure FDA0002835439260000022
the size of the outgoing data Flow on the Link2 where the Flow2 is located is as follows:
Figure FDA0002835439260000023
wherein f1 and f2 are Flow rates of Flow1 and Flow2, respectively; flowload1And FlowLoad2Link average load for Link1 and Link2, respectively, if FlowLoad1≥FlowLoad2Then, then
Figure FDA0002835439260000024
Figure FDA0002835439260000025
If FlowLoad1<FlowLoad2Then, then
Figure FDA0002835439260000026
Figure FDA0002835439260000027
4. The method for distributing network coding traffic based on data stream load according to claim 3, wherein the Link average load of Link1 and Link2 is calculated by the following formula:
Figure FDA0002835439260000028
where i is 1 or 2, n is the number of network nodes on the link, NodeLoadkThe load of the kth network node on the link.
5. A physical layer coding negotiation and data forwarding method is characterized in that any network node completes clustering according to the network node clustering method of any claim 1 or 2, and performs flow distribution according to the flow distribution method of any claim 3 or 4, then the network node selects a network node at the median of the hop number of a coding link as an intermediate node N and sends the cluster number of the cluster to the intermediate node N, two network nodes adjacent to the intermediate node N in the coding link are selected as coding nodes N1 and N2, and the intermediate node stores the cluster number in a ClusterTable table; the negotiation and data forwarding method comprises the following steps:
step A, the intermediate node N receives a request frame RTS from the coding node N1, judges whether cluster identification in the RTS frame exists in a ClusterTable, if not, executes the step B, otherwise, executes the step C;
step B, the intermediate node N sends a Clear To Send (CTS) frame to the coding node N1, waits for receiving a data packet, stores the data packet in a receiving queue and finishes the negotiation;
step C, the intermediate node N sends a coding negotiation request frame RTNC to the coding node N2, if the intermediate node N does not receive a coding negotiation permission frame CTNC returned by the coding node N2, the step B is executed; otherwise, executing step D;
step D, the intermediate node N sends a coding transmission request frame RTNCS to the coding nodes N1 and N2, prepares to receive a coding transmission permission frame CTNCS from the coding nodes N1 and N2, and executes step E;
step E, the intermediate node N receives the CTNCS frames from N1 and N2, then receives the superposed signal N _ r simultaneously transmitted by the coding nodes N1 and N2, and performs signal mapping according to a signal mapping function F (N _ r) to obtain a coding signal N _ s and stores the coding signal N _ s,
Figure FDA0002835439260000031
step F, after the intermediate node N sends a section of synchronous signal SYNC, the coding signal N _ s obtained in the step E is broadcasted to the coding nodes N1 and N2, and the intermediate node N waits for acknowledgement frames ACK from the coding nodes N1 and N2;
and G, after the coding nodes N1 and N2 acquire the N _ s broadcast by the intermediate node, decoding by utilizing exclusive-OR operation, and ending.
6. A distributed cross-layer network coding flow distribution method based on reverse flow is characterized by comprising the following steps:
step one, a network node performs clustering according to the clustering method of any one of claims 1 or 2;
step two, the network node optimally distributes the intra-cluster flow to the coding links according to the distribution method of any one of claims 3 or 4;
step three, according to the coding negotiation and data forwarding method of claim 5, the intermediate node cooperates with the coding node to perform physical layer exclusive-or coding, and the coding node decodes and forwards data by using exclusive-or operation.
7. A reverse flow-based clustering apparatus, comprising:
the range communication information table RangeTable storage module is used for storing a network node number rid in the communication range of the network node and an incoming data flow rid _ RangeIntable of the network node in the communication range of the network node;
the data flow output table outTable storage module is used for storing an end network node number outid of the data flow taking the network node as a starting point and a network node number outid in a communication range of the end network node of the data flow taking the network node as a starting point;
the data flow entry table storage module is used for storing the initial network node number in of the data flow taking the network node as the termination point;
the reverse flow retrieval module is used for finding out reverse data flows with potential network coding opportunities, and the specific method comprises the following steps: searching OutTable after going through each init in InTable of the network node, finding outTable, finding outid which is the same as the init, if the outTable is successful, the corresponding data flow in the OutTable is reverse flow, otherwise, finding OutTable, finding outrid which is the same as the init, if the outTable is successful, the corresponding data flow in the OutTable is reverse flow, otherwise, traversing rid of RangeTable, finding outrid which is the same as outrid and rid _ RangeIntable _ init according to rid _ RangeIntable _ init, and if the outTable is successful, the corresponding data flow in the OutTable is reverse flow;
a clustering module, configured to cluster the start and end network nodes of the retrieved reverse flows according to the network node clustering method according to any one of claims 1 or 2.
8. The apparatus of claim 7, further comprising a timing module for timing the calculation of the stream correlation coefficient.
9. A data coding transmission device, characterized in that, the device adopts a physical layer coding negotiation and data forwarding method according to claim 5 for data coding transmission;
the device includes:
the intermediate node and coding node selection module is used for selecting a network node at the median of the hop counts of the coding links as an intermediate node and selecting two network nodes adjacent to the intermediate node of the coding links as coding nodes;
a cluster table storage module, configured to store, by the intermediate node, the cluster number generated by clustering using the clustering apparatus according to claim 7 in a ClusterTable table;
the coordination module is used for requesting synchronous transmission from the intermediate node to the coding node;
the coding receiving module is used for receiving the superposed electromagnetic wave waveform signals synchronously sent by the coding nodes by the intermediate node;
the signal mapping module is used for mapping the signal received by the coding receiving module by the intermediate node to generate a coding signal;
the coding forwarding module is used for broadcasting and sending the mapped coding signal to the coding node by the intermediate node;
and the decoding module is used for decoding the received coded signals by the coding node by using the locally stored data.
CN201810058607.3A 2018-01-22 2018-01-22 Clustering, flow distribution, coding negotiation and data forwarding method and device Active CN108156087B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810058607.3A CN108156087B (en) 2018-01-22 2018-01-22 Clustering, flow distribution, coding negotiation and data forwarding method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810058607.3A CN108156087B (en) 2018-01-22 2018-01-22 Clustering, flow distribution, coding negotiation and data forwarding method and device

Publications (2)

Publication Number Publication Date
CN108156087A CN108156087A (en) 2018-06-12
CN108156087B true CN108156087B (en) 2021-04-27

Family

ID=62461805

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810058607.3A Active CN108156087B (en) 2018-01-22 2018-01-22 Clustering, flow distribution, coding negotiation and data forwarding method and device

Country Status (1)

Country Link
CN (1) CN108156087B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112954719B (en) * 2021-03-25 2023-10-13 盐城工学院 Traffic matching method for network coding perception route in wireless multi-hop network

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101692740A (en) * 2009-09-30 2010-04-07 西安电子科技大学 Wireless network multi-path routing network coding transmission method
CN101959244A (en) * 2010-09-29 2011-01-26 浙江工业大学 Method for controlling hierarchical type route suitable for wireless sensor network

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9723619B2 (en) * 2012-12-07 2017-08-01 Telefonaktiebolaget Lm Ericsson (Publ) Coordinated multipoint transmission and reception (CoMP) in a wireless telecommunications network
CN103533595A (en) * 2013-10-28 2014-01-22 天津工业大学 Multi-hop clustering routing algorithm (GEEMHCR) for wireless sensor networks

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101692740A (en) * 2009-09-30 2010-04-07 西安电子科技大学 Wireless network multi-path routing network coding transmission method
CN101959244A (en) * 2010-09-29 2011-01-26 浙江工业大学 Method for controlling hierarchical type route suitable for wireless sensor network

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
"Enhancement of DV-Hop by weighted hop distance";Qihong Tao et al.;《2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)》;20170302;全文 *
"Research on LEACH with Correlated Network Coding";Qihong Tao et al.;《2016 3rd International Conference on Information Science and Control Engineering (ICISCE)》;20161103;全文 *
"Research on network coding based on LEACH for wireless sensor network";Qihong Tao et al.;《2016 IEEE International Conference on Electronic Information and Communication Technology (ICEICT)》;20170316;全文 *

Also Published As

Publication number Publication date
CN108156087A (en) 2018-06-12

Similar Documents

Publication Publication Date Title
Park et al. Codecast: a network-coding-based ad hoc multicast protocol
Wang et al. Network coding aware cooperative MAC protocol for wireless ad hoc networks
CN108449161B (en) Retransmission method based on network coding in relay cooperation wireless network
CN103297343A (en) Routing method based on delay tolerant network
CN106713135B (en) Data transmission method and system based on software defined network
EP3087782B1 (en) A method for transmitting data in a network comprising several nodes and corresponding equipment and computer program
CN107182103B (en) Cooperative broadcasting method based on neighbor broadcasting coefficient in mobile self-organizing network
CN102857988A (en) Realization method of routing in accordance with requirements in cognitive wireless Ad Hoc network
Zhu et al. UPMAC: A localized load-adaptive MAC protocol for underwater acoustic networks
CN102438207B (en) Real-time multicast method in wireless multi-hop network
CN108156087B (en) Clustering, flow distribution, coding negotiation and data forwarding method and device
Nikseresht et al. Interference-aware multipath routing for video delivery in wireless multimedia sensor networks
CN105072586A (en) Management method for forwarding of broadcast message in embedded wireless ad hoc network
Zhang et al. An overview of opportunistic routing in mobile ad hoc networks
CN108259132B (en) Bidirectional cooperative access method based on self-adaptive multi-decoding
CN108737972B (en) Virtual gravitation-based cooperative broadcasting method in mobile Ad Hoc network
Bao et al. AI-Augmented, ripple-diamond-chain shaped, rateless routing in wireless mesh networks with multibeam directional antennas
CN106102146B (en) A kind of energy consumption optimization method of D2D communication under more honeycombs
CN102123010B (en) Data transmission method for medium access control (MAC) layer in wireless local area network
CN103581838B (en) A kind of Ad Hoc network information sharing method
Sheu et al. A cooperative MAC protocol based on 802.11 in wireless ad hoc networks
Bae et al. Cross-layer QoS architecture with multipath routing in wireless multimedia sensor networks
TW201023564A (en) Frame merging apparatus and method thereof
Xiao et al. Decentralised data piggybacking and link scheduling for reliable broadcast in VANETs
Chi et al. A network coding scheme to improve throughput for IEEE 802.11 WLAN

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant