CN104159202A - Multipath wireless sensor network coding flow distribution method - Google Patents

Multipath wireless sensor network coding flow distribution method Download PDF

Info

Publication number
CN104159202A
CN104159202A CN201410393086.9A CN201410393086A CN104159202A CN 104159202 A CN104159202 A CN 104159202A CN 201410393086 A CN201410393086 A CN 201410393086A CN 104159202 A CN104159202 A CN 104159202A
Authority
CN
China
Prior art keywords
link
network
ncmc
wireless sensor
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.)
Granted
Application number
CN201410393086.9A
Other languages
Chinese (zh)
Other versions
CN104159202B (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 NANYOU INSTITUTE OF INFORMATION TEACHNOVATION Co.,Ltd.
Original Assignee
Nanjing Post and Telecommunication University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanjing Post and Telecommunication University filed Critical Nanjing Post and Telecommunication University
Priority to CN201410393086.9A priority Critical patent/CN104159202B/en
Publication of CN104159202A publication Critical patent/CN104159202A/en
Application granted granted Critical
Publication of CN104159202B publication Critical patent/CN104159202B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

The invention discloses a multipath wireless sensor network coding flow distribution method and belongs to the technical field of wireless network communication. In the method, a source node distributes data flow to different paths, and a middle node carries out coding by using reverse network coding and uses a multicast mode for flow transmission. When the network transmission flow is given, the source node distributes the data flow to different paths for transmission in a flow distribution method, thereby reducing the times of transmitting the given flow. According to the method of the invention, the network coding chances in the network can be increased, the transmission times in the wireless sensor network can be reduced, and throughput is improved.

Description

A kind of multipath wireless sensor network coding flow allocation method
Technical field
The present invention relates to wireless network communication technique field, particularly a kind of multipath wireless sensor network coding flow allocation method.
Background technology
Wireless senser can form network by self organization ability, thereby we conventionally can be by wireless sensor network (Wireless Sensor Networks, WSN) be deployed in the region that self is not easy to enter into, thereby guarantee the acquisition of information of regional around, grasp in real time ambient condition information, convenient people's life.Thereby can say, the appearance of sensor network has made up the mankind and cannot set foot in area information and obtain the sorry of difficulty.The large information technology of Ta Jiang modern society three is that sensor technology, computer technology and the communication technology are effectively applied to one.
The mode that traditional wireless sensor network transmits data is storage forwarding, except sending node and the node receiving node of data are only responsible for route, and data content is not done to any processing, and intermediate node is being played the part of the role of transponder.For a long time, people generally believe on intermediate node the data of transmission are not processed and can be produced any income, yet the network code theory that the people such as R Ahlswede proposed in 2000 has thoroughly been overthrown this traditional view.Network code is a kind of message-switching technique that has merged route and coding, its core concept is, on each node in network, the information of receiving on each channel is carried out to linearity or nonlinear processing, then be transmitted to downstream node, intermediate node is being played the part of the role of encoder or signal processor.Max-flow-minimal cut theorem according in graph theory, by network code, can reach max-flow circle of multicast route transmission, improves the efficiency of transmission of information.
Network code is applied in wireless network can bring the performance gains such as throughput, network linking robustness and data sharing.From typical network code principle, can find out: Adoption Network coding can obtain the maximum ductility limit of network multicast, particularly, in the WSN of Bandwidth-Constrained, network code can reach theoretical upper limit for increasing data flow.In WSN, data are to arrive destination node by a jumping or multi-hop transmission, and network code takes full advantage of the characteristic of wireless channel transmission, has greatly improved the throughput of network.In actual applications, WSN node and link often can lose efficacy, thereby affect the robustness of network.Traditional network linking restoration methods is to re-route.But, Adoption Network coding can weaken that node leaves or link failure on the complete impact of obtaining data of other nodes, thereby effectively improve fault-tolerance and the robustness of system.
In wireless sensor network, a plurality of nodes have N source data, and M destination node attempts to obtain some parts of interested source files.Distribution form for any data source and demand nodes in network, the network code that modal a kind of network code mode is reverse data flow, when two different source nodes transmit by same via node, for example, if the opposite direction of these two data flow, can (carry out networking coding, carry out XOR), via node is transmitted to this two source nodes in the mode of broadcast again, and source node utilizes the decoding data of self.By such network code, can reduce Internet Transmission number of times, improve throughput.If it should be noted that neighbor node in the broadcasting area of source node and via node and interested in the content of via node transmission, utilize the multicast feature of network can be by data stream transmitting to these neighbor nodes.
Summary of the invention
For solving the problems of the technologies described above, the object of the present invention is to provide a kind of multipath wireless sensor network coding assignment of traffic point-score, the method can reduce Internet Transmission number of times, improves throughput.
In order to solve the problems of the technologies described above the technical scheme of proposition, be: a kind of multipath wireless sensor network coding flow allocation method, comprises the steps:
Step 1: at the network struction initial stage, the link that network can carry out network code and multicast transmission declare respectively for NCMC (that is: network code) link and MC (that is: multicast) link also given its capacity be respectively Y nCMCand Y mCdescribed NCMC link is the link with reverse coding and multicast transmission ability, mode with multicast after reverse data flow can being encoded sends to all mid-side nodes, MC link is the link only with multicast transmission ability, identical data flow can be sent to a plurality of destination nodes in the mode of multicast, when network struction, capacity and the cost of described NCMC link and MC link are broadcasted;
Step 2: in the network operation stage, network node is received the link capacity (Y that NCMC link and MC link are broadcasted nCMC, Y mC) and cost, according to the computational methods of two kinds of link costs, calculate the total transmission cost of link,, node utilizes the distributed optimal path dispense flow rate of obtaining of method of Lagrange multipliers;
Step 3: be current network flow distribution state X according to method of Lagrange multipliers gained optimal solution, utilize steepest descent method to try to achieve new link capacity (Y nCMC, Y mC), under new link capacity, repeat above-mentioned steps one to three, the path allocation flow while finally trying to achieve minimal network transmission cost.
Preferably, in described step 1, the transmission of wireless sensor network node meets the propagation property of wireless transmission, and, when a node transmits packet, all nodes within the specific limits can be accepted this packet.
Preferably, in described step 1, be not that all network nodes all need broadcast message, only capacity and the cost of NCMC link and MC link need to be broadcasted.
Preferably, in described step 1, NCMC link is transmitted packet in the mode of multicast, and the node within the scope of multicast transmission all can receive, and this packet can be used for carrying out decoding.
Preferably, while utilizing method of Lagrange multipliers calculating path dispense flow rate in described step 2, internodal calculating is not complementary, and A node can link and the capacity of MC link and the path flow that cost is calculated required distribution according to NCMC, and does not rely on the result of calculation of B node.
Preferably, while utilizing method of Lagrange multipliers calculating path dispense flow rate in described step 2, comprise the following steps:
Selected initial point x 0, initial multiplier vector λ 0, initial penalty factor σ 0, amplification coefficient C>1, departure ε, constant θ belongs to (0,1), makes k=1;
The first step: according to target function f (x) and restrictive condition C i(x) write out
M ( x , λ , σ ) = f ( x ) + 1 / 2 σ * Σ i = 1 m { [ max ( 0 , λ i - σ c i ( x ) ) - λ i 2 ] } , Use initialization λ, carry out second step;
Second step: get current λ and judge, if export initial point x 0carry out the 3rd step, otherwise, (λ k+1) i=max[0, (λ k) i-σ c i(x)], i=1,2 ..., m re-starts judgement;
The 3rd step: get current point and carry out iteration, given Δ x carries out the 4th step;
The 4th step: x 1=x 0+ 8* Δ x, if f is (x 0)>=f (x 1), carry out the 5th step, otherwise, reduce Δ x and re-execute the 4th step;
The 5th step: x 2=x 0+ 2* Δ x, if f is (x 2)>=f (x 1), output interval (x 1, x 2) carry out the 6th step, otherwise increase Δ x, re-execute the 5th step;
The 6th step: calculate b=x 1+ 0.618* (x 2-x 1) make f 2=f (b), carries out the 7th step;
The 7th step: calculate a=x 1+ 0.382* (x 2-x 1) make f 1=f (a), carries out the 8th step;
The 8th step: judge if | x 1-x 2| < ε carries out the 9th step, if f 1< f 2make x 2=b, b=a, f 2=f 1carry out the 6th step, if f 1=f 2make x 2=b, x 1=a, f 2=f 1carry out the 7th step, if f 1> f 2make x 1=b, a=b, f 1=f 2calculate b=x 1+ 0.618* (x 2-x 1) make f 2=f (b) carries out the 8th step;
The 9th step: calculate x *if=(a+b)/2 it be minimal point; finish, otherwise forward the 3rd step to.
Preferably, in described step 3, utilize steepest descent method to calculate and adjust link capacity (Y nCMC, Y mC), can further reduce the total cost of network, approach global optimum's point.
Preferably, in described step 3, utilize steepest descent method to calculate and adjust link capacity (Y nCMC, Y mC) time, network system is adjusted front and back all in Nash equilibrium state, and network is being adjusted front and back all in stable state.
Beneficial effect:
1, the present invention can increase the network coding opportunity in network.
2, the present invention has reduced internodal dependence, node is calculated and be not limited to global information.
3, the present invention can reduce the number of transmissions in wireless sensor network, improves throughput.
Accompanying drawing explanation
Fig. 1 is that the present invention is about the method flow diagram of computing network path flow.
Fig. 2 is that the present invention is about calculating linking capacity (Y nCMC, Y mC) steepest descent method method flow diagram.
Fig. 3 is that the present invention is about the flow chart of wireless sensor network coding flow allocation method.
Embodiment
Below in conjunction with Figure of description, the invention is described in further detail.
As shown in Figure 1-Figure 3, the present invention discloses a kind of multipath wireless sensor network coding flow allocation method, comprises the steps:
Step 1: at the network struction initial stage, the link that network can carry out network code and multicast transmission declare respectively for NCMC link and MC link also given its capacity be respectively Y nCMCand Y mCdescribed NCMC link is the link with reverse coding and multicast transmission ability, mode with multicast after reverse data flow can being encoded sends to all mid-side nodes, MC link is the link only with multicast transmission ability, identical data flow can be sent to a plurality of destination nodes in the mode of multicast, when network struction, capacity and the cost of described NCMC link and MC link are broadcasted;
Step 2: in the network operation stage, network node is received the link capacity (Y that NCMC link and MC link are broadcasted nCMC, Y mC) and cost, according to the computational methods of two kinds of link costs, calculating the total transmission cost of link, node utilizes the distributed optimal path dispense flow rate of obtaining of method of Lagrange multipliers;
Step 3: be current network flow distribution state X according to method of Lagrange multipliers gained optimal solution, utilize steepest descent method to try to achieve new link capacity (Y nCMC, Y mC), under new link capacity, repeat above-mentioned steps one to three, the path allocation flow while finally trying to achieve minimal network transmission cost.
In described step 1, the transmission of wireless sensor network node meets the propagation property of wireless transmission, and, when a node transmits packet, all nodes within the specific limits can be accepted this packet.
In described step 1, be not that all network nodes all need broadcast message, only capacity and the cost of NCMC link and MC link need to be broadcasted.
In described step 1, NCMC link is transmitted packet in the mode of multicast, and the node within the scope of multicast transmission all can receive, and this packet can be used for carrying out decoding.
While utilizing method of Lagrange multipliers calculating path dispense flow rate in described step 2, internodal calculating is not complementary, be that A node can link and the capacity of MC link and the path flow that cost is calculated required distribution according to NCMC, and do not rely on the result of calculation of B node.
In described step 3, utilize steepest descent method to calculate and adjust link capacity (Y nCMC, Y mC), can further reduce the total cost of network, approach global optimum's point.
In described step 3, utilize steepest descent method to calculate and adjust link capacity (Y nCMC, Y mC) time, network system is adjusted front and back all in Nash equilibrium state, and network is being adjusted front and back all in stable state.
While utilizing method of Lagrange multipliers calculating path dispense flow rate in described step 2, comprise the following steps:
Selected initial point x 0, initial multiplier vector λ 0, initial penalty factor σ 0, amplification coefficient C>1, departure ε, constant θ belongs to (0,1), makes k=1;
The first step: according to target function f (x) and restrictive condition C i(x) write out
M ( x , &lambda; , &sigma; ) = f ( x ) + 1 / 2 &sigma; * &Sigma; i = 1 m { [ max ( 0 , &lambda; i - &sigma; c i ( x ) ) - &lambda; i 2 ] } , Use initialization λ, carry out second step;
Second step: get current λ and judge, if export initial point x 0carry out the 3rd step, otherwise, (λ k+1) i=max[0, (λ k) i-σ c i(x)], i=1,2 ..., m re-starts judgement;
The 3rd step: get current point and carry out iteration, given Δ x carries out the 4th step;
The 4th step: x 1=x 0+ 8* Δ x, if f is (x 0)>=f (x 1), carry out the 5th step, otherwise, reduce Δ x and re-execute the 4th step;
The 5th step: x 2=x 0+ 2* Δ x, if f is (x 2)>=f (x 1), output interval (x 1, x 2) carry out the 6th step, otherwise increase Δ x, re-execute the 5th step;
The 6th step: calculate b=x 1+ 0.618* (x 2-x 1) make f 2=f (b), carries out the 7th step;
The 7th step: calculate a=x 1+ 0.382* (x 2-x 1) make f 1=f (a), carries out the 8th step;
The 8th step: judge if | x 1-x 2| < ε carries out the 9th step, if f 1< f 2make x 2=b, b=a, f 2=f 1carry out the 6th step, if f 1=f 2make x 2=b, x 1=a, f 2=f 1carry out the 7th step, if f 1> f 2make x 1=b, a=b, f 1=f 2calculate b=x 1+ 0.618* (x 2-x 1) make f 2=f (b) carries out the 8th step;
The 9th step: calculate x *if=(a+b)/2 it be minimal point; finish, otherwise forward the 3rd step to.

Claims (8)

1. a multipath wireless sensor network coding flow allocation method, is characterized in that, described method comprises the steps:
Step 1: at the network struction initial stage; The link of network code and multicast transmission is declared respectively as NCMC link and MC link, and given its capacity is respectively Y nCMCand Y mC, described NCMC link is the link with reverse coding and multicast transmission ability; Mode with multicast after reverse data flow is encoded sends to all mid-side nodes, and MC is linked as the link only with multicast transmission ability, and identical data flow is sent to a plurality of destination nodes in the mode of multicast; When network struction, capacity and the cost of described NCMC link and MC link are broadcasted;
Step 2: in the network operation stage; Network node is received the link capacity that NCMC link and MC link are broadcasted, that is: Y nCMC, Y mCand cost, according to the computational methods of two kinds of link costs, calculating the total transmission cost of link, node utilizes the distributed optimal path dispense flow rate of obtaining of method of Lagrange multipliers;
Step 3: be current network flow distribution state X according to method of Lagrange multipliers gained optimal solution, utilize steepest descent method to try to achieve new link capacity: Y nCMC, Y mC, under new link capacity, repeat above-mentioned steps one to three, the path allocation flow while finally trying to achieve minimal network transmission cost.
2. a kind of multipath wireless sensor network coding flow allocation method according to claim 1, it is characterized in that, in described step 1, the transmission of wireless sensor network node meets the propagation property of wireless transmission, when a node transmits packet, all nodes within the specific limits can be accepted this packet.
3. a kind of multipath wireless sensor network coding flow allocation method according to claim 1, it is characterized in that, in described step 1, be not that all network nodes all need broadcast message, only capacity and the cost of NCMC link and MC link need to be broadcasted.
4. a kind of multipath wireless sensor network coding flow allocation method according to claim 1, it is characterized in that, in described step 1, NCMC link is transmitted packet in the mode of multicast, and the node within the scope of multicast transmission all can receive, and this packet is used for carrying out decoding.
5. a kind of multipath wireless sensor network coding flow allocation method according to claim 1, it is characterized in that, while utilizing method of Lagrange multipliers calculating path dispense flow rate in described step 2, internodal calculating is not complementary, be that A node links according to NCMC and the capacity of MC link and the path flow that cost is calculated required distribution, and do not rely on the result of calculation of B node.
6. a kind of multipath wireless sensor network coding flow allocation method according to claim 1, is characterized in that, while utilizing method of Lagrange multipliers calculating path dispense flow rate in described step 2, comprises the following steps:
Selected initial point x 0, initial multiplier vector λ 0, initial penalty factor σ 0, amplification coefficient C>1, departure ε, constant θ belongs to (0,1), makes k=1;
The first step: according to target function f (x) and restrictive condition C i(x) write out
M ( x , &lambda; , &sigma; ) = f ( x ) + 1 / 2 &sigma; * &Sigma; i = 1 m { [ max ( 0 , &lambda; i - &sigma; c i ( x ) ) - &lambda; i 2 ] } , Use initialization λ, carry out second step;
Second step: get current λ and judge, if export initial point x 0carry out the 3rd step, otherwise, (λ k+1) i=max[0, (λ k) i-σ c i(x)], i=1,2 ..., m re-starts judgement;
The 3rd step: get current point and carry out iteration, given Δ x carries out the 4th step;
The 4th step: x 1=x 0+ 8* Δ x, if f is (x 0)>=f (x 1), carry out the 5th step, otherwise, reduce Δ x and re-execute the 4th step;
The 5th step: x 2=x 0+ 2* Δ x, if f is (x 2)>=f (x 1), output interval (x 1, x 2) carry out the 6th step, otherwise increase Δ x, re-execute the 5th step;
The 6th step: calculate b=x 1+ 0.618* (x 2-x 1) make f 2=f (b), carries out the 7th step;
The 7th step: calculate a=x 1+ 0.382* (x 2-x 1) make f 1=f (a), carries out the 8th step;
The 8th step judge if | x 1-x 2| < ε carries out the 9th step, if f 1< f 2make x 2=b, b=a, f 2=f 1carry out the 6th step, if f 1=f 2make x 2=b, x 1=a, f 2=f 1carry out the 7th step, if f 1> f 2make x 1=b, a=b, f 1=f 2calculate b=x 1+ 0.618* (x 2-x 1) make f 2=f (b) carries out the 8th step;
The 9th step: calculate x *if=(a+b)/2 it be minimal point; finish, otherwise forward the 3rd step to.
7. a kind of multipath wireless sensor network coding flow allocation method according to claim 1, is characterized in that, utilizes steepest descent method to calculate and adjust link capacity (Y in described step 3 nCMC, Y mC), reduce the total cost of network, approach global optimum's point.
8. a kind of multipath wireless sensor network coding flow allocation method according to claim 1, is characterized in that, utilizes steepest descent method to calculate and adjust link capacity (Y in described step 3 nCMC, Y mC) time, network system is adjusted front and back all in Nash equilibrium state, and network is being adjusted front and back all in stable state.
CN201410393086.9A 2014-08-11 2014-08-11 A kind of multipath wireless sensor network encodes flow allocation method Active CN104159202B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410393086.9A CN104159202B (en) 2014-08-11 2014-08-11 A kind of multipath wireless sensor network encodes flow allocation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410393086.9A CN104159202B (en) 2014-08-11 2014-08-11 A kind of multipath wireless sensor network encodes flow allocation method

Publications (2)

Publication Number Publication Date
CN104159202A true CN104159202A (en) 2014-11-19
CN104159202B CN104159202B (en) 2018-04-27

Family

ID=51884589

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410393086.9A Active CN104159202B (en) 2014-08-11 2014-08-11 A kind of multipath wireless sensor network encodes flow allocation method

Country Status (1)

Country Link
CN (1) CN104159202B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101325556A (en) * 2008-06-23 2008-12-17 南京大学 Multi-path routing method for wireless network based on network encoding
US20090003216A1 (en) * 2007-06-27 2009-01-01 Microsoft Corporation Multipath Forwarding Algorithms Using Network Coding
CN102547856A (en) * 2011-12-02 2012-07-04 湖北经济学院 Network-coding-based multipath routing method in Ad Hoc network
CN102572717A (en) * 2012-02-20 2012-07-11 南京中通电气有限公司 Multipath routing reliable transmission method based on network coding

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090003216A1 (en) * 2007-06-27 2009-01-01 Microsoft Corporation Multipath Forwarding Algorithms Using Network Coding
CN101325556A (en) * 2008-06-23 2008-12-17 南京大学 Multi-path routing method for wireless network based on network encoding
CN102547856A (en) * 2011-12-02 2012-07-04 湖北经济学院 Network-coding-based multipath routing method in Ad Hoc network
CN102572717A (en) * 2012-02-20 2012-07-11 南京中通电气有限公司 Multipath routing reliable transmission method based on network coding

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
JIE TONG: "Intra-flow Network Coding based Multipath Routing Protocol for Event-driven Wireless Sensor Networks", 《2009 FIFTH INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR NETWORKS》 *
姚玉坤: "基于无线组播特性的网络编码在传感器网络中的应用研究", 《数据通信》 *

Also Published As

Publication number Publication date
CN104159202B (en) 2018-04-27

Similar Documents

Publication Publication Date Title
CN101188535B (en) Method for determining clustering energy balance route of wireless sensor network based on binary tree
Guo et al. Efficient error recovery with network coding in underwater sensor networks
CN103916220A (en) Network coding cooperative communication method based on polarization codes
CN101478805B (en) DTN network Anycast routing method based on opportunistic communication
Wang et al. Energy efficient broadcasting using network coding aware protocol in wireless ad hoc network
CN104394571A (en) Topology control method of wireless sensor network used for monitoring water quality of inland river
CN101965031B (en) Maximum probability-based cognitive radio multi-path multicast routing method
CN108521666B (en) Multi-relay system dynamic power distribution method based on nonlinear energy acquisition model
CN101552934A (en) Optical internet cross-domain reliable route calculating method based on PCE backtracking recursion
CN107360612A (en) A kind of data transmission method of the wireless sensor network based on ant colony multipath
CN106028398A (en) Underwater wireless sensor network topology control method based on energy consumption balance
CN104918238A (en) Cooperation interference excitation method for realizing physical layer safety
Yang et al. DLS: A dynamic local stitching mechanism to rectify transmitting path fragments in wireless sensor networks
CN103441787B (en) Based on the information transferring method of antenna and user&#39;s Combination selection in bidirectional relay system
CN105554817B (en) A kind of relay selection method of load justice
CN104159202A (en) Multipath wireless sensor network coding flow distribution method
Balaji et al. Fuzzy based particle swarm optimization routing technique for load balancing in wireless sensor networks
CN108880708B (en) Compressed sensing link quality estimation method based on intertidal zone wireless sensor network
Li et al. Quantum Genetic Energy Efficient Iteration Clustering Routing Algorithm for Wireless Sensor Networks.
CN110661566A (en) Unmanned aerial vehicle cluster networking method and system adopting depth map embedding
CN104780567A (en) Satellite network flow control method
CN102123490A (en) Power distribution method of two-way multi-hop network based on physical layer network coding
CN105790810B (en) MIMO wireless multi-hop network distribution cross-layer optimizing method based on channelling mode selection
CN107529227A (en) A kind of denoising forwards bi-directional relaying slot allocation method
CN102065472B (en) Cross-layer design-based method for determining wireless network coding participation packet

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20210512

Address after: Room 507, 6-3 Xingzhi Road, Nanjing Economic and Technological Development Zone, Jiangsu Province, 210000

Patentee after: NANJING NANYOU INSTITUTE OF INFORMATION TEACHNOVATION Co.,Ltd.

Address before: 210003, 66 new model street, Gulou District, Jiangsu, Nanjing

Patentee before: NANJING University OF POSTS AND TELECOMMUNICATIONS