CN102487306B - Wireless mesh network coding method - Google Patents
Wireless mesh network coding method Download PDFInfo
- Publication number
- CN102487306B CN102487306B CN201010574272.4A CN201010574272A CN102487306B CN 102487306 B CN102487306 B CN 102487306B CN 201010574272 A CN201010574272 A CN 201010574272A CN 102487306 B CN102487306 B CN 102487306B
- Authority
- CN
- China
- Prior art keywords
- node
- packet
- data packets
- raw data
- link
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 27
- 230000005540 biological transmission Effects 0.000 claims abstract description 18
- 238000012790 confirmation Methods 0.000 claims description 6
- 239000000284 extract Substances 0.000 claims description 6
- 230000015572 biosynthetic process Effects 0.000 claims description 2
- 238000004891 communication Methods 0.000 abstract description 5
- 230000007246 mechanism Effects 0.000 abstract description 4
- 238000011160 research Methods 0.000 abstract description 3
- 238000013461 design Methods 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 6
- 238000013459 approach Methods 0.000 description 4
- 238000009825 accumulation Methods 0.000 description 3
- 230000006872 improvement Effects 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 230000008901 benefit Effects 0.000 description 1
- 230000006837 decompression Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a wireless mesh network coding method. By using a current COPE coding algorithm, coding gain is low. By using the method of the invention, the above problem can be solved. In the method of the invention, for a participated XOR original data packet, a DESN identification is added in a packet header of the generated data packet so as to identify a destination node of the original data packet. A receiving side determines whether the receiving side itself or a neighbor is the destination node through the DESN identification and different strategies are executed. The receiving side only needs to perform decoding to the link which is used to enter into a relay node and perform routing to the link which is used to enter into a target node. Through using the above mechanism, network coding performance can be increased. The method of the invention can be used in various kinds of communication networks. Times of transmissions of the original data packet can be reduced. Network coding gain and network throughput can be effectively increased. The method has a good practical value. A new path is provided for the research and the design of the network coding.
Description
Technical field
The present invention relates to a kind of Wireless mesh network coding method, belong to the network information and network coding technique field.
Background technology
In traditional network, as the node of relaying, can only copy to the received signal, amplify and forward, this is sometimes a kind of waste for Internet resources.Ahlswede in 2000 proposes network code concept, and network node carries out specific operation to the message bit stream receiving, as mould 2 and, computing in finite field etc., then send, rather than only copy forwarding.They are from information-theoretical angle, Strict Proof network code can help us to reach the heap(ed) capacity of communication network, thereby maximally utilise the existing resource of network.The proposition of network code, from having broken in essence information processing manner traditional communication network, has become a new study hotspot in communication network research field.
The unreliability of wireless link and physical layer broadcast characteristic are very applicable to using the method for coding, the application of network code in wireless network can improve the throughput of network, especially multicast throughput, can reduce the propagation times of packet, reduces wireless transmission energy consumption.The network code based on chance (COPE) of the propositions such as Katti has been studied the problem of specific implementation in the protocol level of network code in wireless environment first.COPE agreement is monitored by chance and is received report and obtains the message information that neighbor node is stored.After obtaining the message information that all neighbor nodes store, the local information of utilizing of each node disjoint determines which packets need encodes and how to encode, to maximize the message amount that can send in once transmission.Meanwhile, packet pond of each node maintenance, for storing the packet that in a period of time T, this node sends or receives.When node receives a packet being formed by n initial data packet encoder, this node will be searched n-1 raw data packets ID of storage in data pool, if can search, node will, by this coded data packet and the n-1 a searching packet by decoding with computing, obtain required packet; If search is less than namely can not decode time, node simply deposits packet in packet pond and can not deliver in output queue, and this characteristic has determined that COPE encryption algorithm does not reach maximum network throughput in some network topology structures.
Summary of the invention
The present invention is directed to the deficiency of prior art, to COPE, coding method improves, and has proposed a kind of Wireless mesh network coding method, and its technical scheme is as follows:
A kind of Wireless mesh network coding method, it is characterized in that: link is divided into the link being connected with via node and large class of the link being connected with destination node two, receiver side only need to be decoded at the link that enters via node, the link Route Selection of target approach node, cutting in judgement destination node equals under the prerequisite of node sum that will be mutual, build a virtual multicast network, carry out this coding method:
At transmitter side, each node has an output queue, for storing the packet of wanting forward pass, when wireless channel is effective, node takes out a raw data packets from output queue, and check a raw data packets can with queue in other raw data packets encode, if there is no code machine meeting, node will directly be broadcasted this raw data packets and can not waited for the raw data packets arrival that can mate; If there is code machine meeting, these raw data packets and rear formation coded data packet are broadcast to each neighbor node; Node is before broadcast code packet, to insert at each packet the data packet head of a variable length, this data packet head improves the data packet head of COPE agreement, for the raw data packets that participates in XOR, in packet header, except using NEXTHOPE to identify the down hop of this raw data packets, also increase the destination node that DESN identifies this raw data packets; When the MAC of node indication has send opportunity, this node takes out packet from the head of its output queue, and then next coding of energy coding situation increase after reception report and ACK in data packet head, sends;
At receiver side, when a node receives the packet that a neighbor node sends, extract all ACK of this neighbor node, the storehouse of the packet that then extracts all reception reports and renewal storage neighbor node is had, according to the DESN sign judgement down hop link that receives data packet head, belong to " link that via node is connected " still " link being connected with destination node ", to entering the link of via node, decode, the link of target approach node is carried out to Route Selection, if this node is not destination node, whether other neighbor nodes that judge this node are the destination node of this packet, if it is direct route is to neighbor node, if this node is destination node, check whether this packet is coded data packet, if coded data packet, the raw data packets that this node is just found out corresponding participation coding from packet pond is decoded, after successfully decoded, ACK is fed back to upper hop node, and by the packet storage of decoding gained, then this section point checks whether oneself is the final destination of decoding the data obtained bag, if, packet is stored in to the high level of network stack, otherwise packet is placed on to output queue, to carry out transmission next time, whether if this node can not be decoded, other neighbor nodes that judge equally this node the destination node of this packet, if it is directly route to neighbor node.
The method that said each coded data packet is inserted the data packet head of a variable length is: if Routing Protocol has the header file of oneself, data packet head is just between MAC head and route head, otherwise just between MAC and IP head; Data packet head is comprised of raw data packets ID, reception report and asynchronous confirmation ACK tri-parts, wherein raw data packets ID is partly for identifying the raw data packets of participating in coding, receive report section for identifying the reception report of paid-in raw data packets, ACK partly correctly receives the confirmation of raw data packets for node, in the raw data packets ID of data packet head part, use DESN to identify the destination node of each raw data packets, receiver side identifies judgement oneself by DESN or whether neighbours are destination nodes.
Advantage of the present invention and remarkable result thereof: in COPE agreement, each node is intercepted transmission medium, obtains the state information of its neighbor node, determines the chance of encoding, and encode in local FIFO buffer structure, then carry out the Route Selection based on chance.But COPE encryption algorithm is easy to realize Shortcomings, the coding method that the present invention proposes improves COPE encryption algorithm, optimized the data retransmission mechanism of COPE network code, can reduce the number of times of raw data packets transmission, effectively improve network code gain and network throughput, there is good practical value, for research and the design of network code provides a new approach.Can be widely used in various communication networks, for example wireless mesh network, Ad hoc net, WLAN etc.,
Accompanying drawing explanation
Fig. 1 is traditional route working method schematic diagram;
Fig. 2 is the topology diagram of COPE working method;
Fig. 3 is that source node S broadcast data packet A of the present invention is to the coding routing mode schematic diagram of B;
Fig. 4 is network coding method working method schematic diagram of the present invention;
Fig. 5 is the implementation flow chart of transmitter side of the present invention;
Fig. 6 is data packet head structure chart of the present invention;
Fig. 7 is the implementation flow chart of receiver side of the present invention;
Fig. 8 is needed average transmission number of times comparison diagram under 3 kinds of modes;
Fig. 9 is 2 kinds of coding gain comparison diagrams under coded system.
Embodiment
Below in conjunction with accompanying drawing, technical scheme of the present invention is elaborated.
As shown in Figure 1, node 1,2 transmits packet A to tradition route working method separately, and B is to node 5,4, and under traditional routing mode, the number of transmissions is 6.According to COPE encryption algorithm, node is received after coded data packet, if can not decode, simply deposits packet in packet pond and can not deliver in output queue; If can decode, after directly decoding, carry out next step transmission.As shown in Figure 2, need altogether the number of transmissions is 5 times to COPE encryption algorithm working method, and coding gain is 1.2, has certain improvement, but owing to having ignored the effect of node 3, has formed waste.
The present invention is directed to this problem COPE encryption algorithm is improved, optimize the data retransmission mechanism of COPE network code.According to the topological structure of wireless mesh network, easily know node 4,5 be cut into 2, consider after node 0 coding, data, under the condition of node 3 Route Selection, are effectively utilized node 3, can be equivalent to a virtual source node S of structure, as shown in Figure 3, S is responsible for broadcast data packet A, and B is to the multicast coding Route Selection mode of node 4,5.As shown in Figure 4, coding number of times is 4 times to coding work mode of the present invention, thereby compares with COPE algorithm, has further effectively reduced the number of transmissions, and coding gain is 1.5.
The present invention is at transmitter side, and when wireless channel is effective, node will take out a raw data packets from output queue, and check a raw data packets can with queue in other raw data packets encode.If can, by these raw data packets phases with after be broadcast to each neighbor node.If there is no code machine meeting, node will directly be broadcasted this raw data packets and can not waited for that the raw data packets that can mate arrives.The implementation flow chart of transmitter side as shown in Figure 5, when the MAC of node indication has send opportunity, this node takes out packet from the head of its output queue, the next coding of energy coding situation, then in data packet head, increase after reception report and ACK, send.
In addition, in order to ensure next-hop node energy collecting, be enough correctly decoded the required raw data packets of reduction, via node need to know which raw data packets its neighbor node has stored.If via node is not received the reception report that neighbor node is sent, so in the situation that lacking definite information, this node will calculate with Routing Protocol the delivery ratio of link between next-hop node, and estimate that according to delivery ratio next-hop node stores the possibility of certain raw data packets, and determine whether carry out network code accordingly, to improve the probability that is correctly decoded of next-hop node collection.
Suppose, certain via node once n packet carried out with coding, and the probability that the down hop receiving node of supposing n packet listens to some other packet i is P
i, the probability P that this receiving node can be correctly decoded so
dequal this node and can monitor the probability P of other n-1 raw data packets that participates in coding
d=P
1* P
2* ... P
n-1.Consider now the pilot process of coding, the problem of how to search for the packet of codified.Suppose n-1 raw data packets to be coded in together now, and consider coding and n raw data packets.At this moment encryption algorithm will judge the decodable probability P of next-hop node collection of this n raw data packets
dwhether meet and be greater than a threshold value G (generally giving tacit consent to G=0.8).If meet above-mentioned threshold value, just mean that the probability that next-hop node collection can be correctly decoded is at least G, thereby carry out such network code, just may there is larger network gain.
Node, before broadcast data packet, insert the data packet head of a variable length at each packet, as shown in Figure 6, data packet head (Added Header) is exactly the dash area in figure.If Routing Protocol has the header file of oneself, data packet head is just between MAC head and route head, otherwise just between MAC and IP head.Data packet head, by the ID (Packets XOR_ed together) of raw data packets, receives report (Reception Reports) and asynchronous confirmation (Acknowledge, ACK) three parts compositions.
1) ID of raw data packets (Packets XOR_ed together)
First is mainly used in the raw data packets that sign is participated in coding.Its first is ENCODED_N-UM, for identifying the quantity of the raw data packets that participates in coding.Next just list successively the ID (PKT_ID) of raw data packets and the next-hop node (NEXTHOP) of this packet that participates in coding.When certain node receives an encoded packets, node will check whether oneself belongs in NEXTHOP list, will selective decompression if belonged to, obtain required packet.
2) receive report (Reception Reports)
Second forms by receiving report.Its first is REPORT_NUM, for representing the quantity of the reception report of paid-in raw data packets.And then be SRC_IP, for representing that each receives the source address of report.Be finally LAST_PKT and BIT MAP, represent respectively the IP sequence number of last packet of receiving from this source address of corresponding SRC_IP, and the packet of receiving before.
3) asynchronous confirmation (Acknowledge, ACK)
After the correct reception of receiving node, need to confirm by ACK.In order to ensure ACK, can transmit in low consumption mode, conventionally use accumulation ACK.A node maintains the counter of a 16bit to neighbor node, this counter is called Neighbor_Seqno_Counter.When this node sends a packet to certain neighbor node, corresponding counter is with regard to counting, and the value after counting is assigned to this packet as local sequence number, Local_PKT_SEQ_NUM.A pair of neighbor node is distinguished different packets with this sequence number.Use on this basis accumulation ACK, each coded data packet comprises an ACK head.The first of ACK piece is the number of ACK entry, is exactly next the local sequence number of packet.The first of each ACK entry is the MAC Address of a neighbor node, be next a pointer tell neighbor node accumulation ACK where to stop and an indication before receive and the table of the packet lost.
The implementation flow chart of receiver side of the present invention as shown in Figure 7, when a node receives the packet that a neighbor node sends, first extract all ACK of this neighbor node, then extract the storehouse of the packet that all receptions are reported and renewal storage neighbor node is had.Ensuing processing will depend on whether this node is destination node, according to the DESN sign that receives data packet head, judge: if this node is not destination node, whether other neighbor nodes that judge this node the destination node of this packet, if it is directly route to neighbor node; If this node is destination node, will check whether this packet is coded data packet, if coded data packet, the raw data packets that this node will attempt to find out corresponding participation coding from packet pond is decoded, after successfully decoded, ACK is fed back to upper hop node, and by the packet storage of decoding gained.Next this node will check whether oneself is the final destination of decoding the data obtained bag.If so, packet is stored in to the high level of network stack, otherwise packet is placed on to output queue, to carry out transmission next time.Whether if this node can not be decoded, other neighbor nodes that judge equally this node the destination node of this packet, if it is directly route to neighbor node.
More as shown in Figure 8, in figure, curve a is COPE coded system to the required the number of transmissions Performance Ratio of data of three kinds of mode average transmission; B is the coded system that the present invention proposes; C is direct routing mode, and obviously the present invention (curve b) transmission data is most effective.Fig. 9 has provided the coding gain performance of scheme, and c/b represents the needed average transmission number of times of direct Route Selection and the ratio that adopts needed average transmission number of times after the coded system of scheme, the i.e. coding gain of the new mode of network code of the present invention.In like manner c/a represents to adopt the coding gain under COPE coded system.Result shows, the present invention has clear improvement in coding gain index, has improved network throughput.
Essence of the present invention is that link is divided into the link being connected with via node and large class of the link being connected with destination node two, and receiver side only need to be decoded at the link that enters via node, the link Route Selection of target approach node.At receiver side, to receiving packet, analyze, if the destination node of packet is the neighbours of receiving node, directly route is passed to destination node, can effectively improve the performance of network code by this mechanism.
Claims (2)
1. a Wireless mesh network coding method, it is characterized in that: link is divided into the link being connected with via node and large class of the link being connected with destination node two, receiver side only need to be decoded at the link that enters via node, enter the link Route Selection of destination node, cutting in judgement destination node equals under the prerequisite of node sum that will be mutual, build a virtual multicast network, carry out this coding method:
At transmitter side, each node has an output queue, for storing the packet of wanting forward pass, when wireless channel is effective, node takes out a raw data packets from output queue, and check a raw data packets can with queue in other raw data packets encode, if there is no code machine meeting, node will directly be broadcasted this raw data packets and can not waited for the raw data packets arrival that can mate; If there is code machine meeting, these raw data packets and rear formation coded data packet are broadcast to each neighbor node; Node is before broadcast code packet, to insert at each packet the data packet head of a variable length, this data packet head improves the data packet head of COPE agreement, for the raw data packets that participates in XOR, in packet header, except using NEXTHOPE to identify the down hop of this raw data packets, also increase the destination node that DESN identifies this raw data packets; When the MAC of node indication has send opportunity, this node takes out packet from the head of its output queue, and then next coding of energy coding situation increase after reception report and ACK in data packet head, sends;
At receiver side, when a node receives the packet that a neighbor node sends, extract all ACK of this neighbor node, the storehouse of the packet that then extracts all reception reports and renewal storage neighbor node is had, according to the DESN sign judgement down hop link that receives data packet head, belong to " link that via node is connected " still " link being connected with destination node ", to entering the link of via node, decode, to entering the link of destination node, carry out Route Selection, if this node is not destination node, whether other neighbor nodes that judge this node are the destination node of this packet, if it is direct route is to neighbor node, if this node is destination node, check whether this packet is coded data packet, if coded data packet, the raw data packets that this node is just found out corresponding participation coding from packet pond is decoded, after successfully decoded, ACK is fed back to upper hop node, and by the packet storage of decoding gained, then this section point checks whether oneself is the final destination of decoding the data obtained bag, if, packet is stored in to the high level of network stack, otherwise packet is placed on to output queue, to carry out transmission next time, whether if this node can not be decoded, other neighbor nodes that judge equally this node are the destination node of this packet, if it is directly route to neighbor node.
2. Wireless mesh network coding method according to claim 1, it is characterized in that: the method that said each coded data packet is inserted the data packet head of a variable length is: if Routing Protocol has the header file of oneself, data packet head is just between MAC head and route head, otherwise just between MAC and IP head; Data packet head is comprised of raw data packets ID, reception report and asynchronous confirmation ACK tri-parts, wherein raw data packets ID is partly for identifying the raw data packets of participating in coding, receive report section for identifying the reception report of paid-in raw data packets, ACK partly correctly receives the confirmation of raw data packets for node, in the raw data packets ID of data packet head part, use DESN to identify the destination node of each raw data packets, receiver side identifies judgement oneself by DESN or whether neighbours are destination nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010574272.4A CN102487306B (en) | 2010-12-06 | 2010-12-06 | Wireless mesh network coding method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010574272.4A CN102487306B (en) | 2010-12-06 | 2010-12-06 | Wireless mesh network coding method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102487306A CN102487306A (en) | 2012-06-06 |
| CN102487306B true CN102487306B (en) | 2014-07-16 |
Family
ID=46152763
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010574272.4A Active CN102487306B (en) | 2010-12-06 | 2010-12-06 | Wireless mesh network coding method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102487306B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3253091B1 (en) * | 2015-01-30 | 2021-03-10 | Huawei Technologies Co., Ltd. | Data processing method and equipment |
| JP6868802B2 (en) | 2015-08-03 | 2021-05-12 | パナソニックＩｐマネジメント株式会社 | Transmission method, reception method, transmission device and reception device |
| CN105262701A (en) * | 2015-09-07 | 2016-01-20 | 香港中文大学深圳研究院 | VOQ scheduling algorithm for packet recombining algebraic exchange engine data packets |
| CN106656416B (en) * | 2016-10-18 | 2020-02-28 | 天津大学 | Optical network single link fault protection method based on network coding and path protection |
| CN106911433A (en) * | 2017-04-27 | 2017-06-30 | 重庆邮电大学 | A kind of chance forwarding Design of Routing Protocol method that nodes encoding is perceived |
| CN107547241B (en) * | 2017-05-18 | 2021-07-23 | 新华三技术有限公司 | TE tunnel fault detection method and device |
| US11108705B2 (en) * | 2019-04-30 | 2021-08-31 | Code On Network Coding, Llc | Linear network coding with pre-determined coefficient generation through parameter initialization and reuse |
| CN113411403B (en) * | 2021-06-23 | 2021-12-14 | 北京邮电大学 | Rapid data synchronization method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2141865A1 (en) * | 2008-07-02 | 2010-01-06 | Siemens Aktiengesellschaft | Method for determining a route for the transmission of a sequence of data packets and ad-hoc mesh network |
| CN101841455A (en) * | 2009-03-17 | 2010-09-22 | 华为技术有限公司 | Coding and routing method, system and nodes |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8503346B2 (en) * | 2008-09-25 | 2013-08-06 | Samsung Electronics Co., Ltd. | Wireless network using network coding scheme based on overhearing channel |
-
2010
- 2010-12-06 CN CN201010574272.4A patent/CN102487306B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2141865A1 (en) * | 2008-07-02 | 2010-01-06 | Siemens Aktiengesellschaft | Method for determining a route for the transmission of a sequence of data packets and ad-hoc mesh network |
| CN101841455A (en) * | 2009-03-17 | 2010-09-22 | 华为技术有限公司 | Coding and routing method, system and nodes |
Non-Patent Citations (2)
| Title |
|---|
| 一种新的无线mesh网络编码方法;邓文君,杨真,杨震;《重庆邮电大学学报》;20100430;第22卷(第2期);第156页至159页 * |
| 邓文君,杨真,杨震.一种新的无线mesh网络编码方法.《重庆邮电大学学报》.2010,第22卷(第2期), |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102487306A (en) | 2012-06-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102487306B (en) | Wireless mesh network coding method | |
| Katti et al. | XORs in the air: Practical wireless network coding | |
| CN101895376B (en) | Transmission method for realizing data broadcasting in multi-hop wireless network | |
| CN102497248B (en) | Data retransmission method based on network coding | |
| CN107846706B (en) | Congestion-avoiding code-aware wireless mesh network multi-path routing method | |
| CN102111820B (en) | Method for realizing scheduling control of network encoding perceived by transmission control protocol in wireless network | |
| CN104010343A (en) | Wireless network optimization method for intelligent meter reading system | |
| CN103428803B (en) | A kind of chance method for routing of combination machine meeting network code | |
| CN102170332A (en) | Opportunistic routing protocol data distributing method based on fountain code and network coding | |
| CN101667885A (en) | Method for reducing redundancy message by using network coding technique on DTN or ICN network | |
| Gao et al. | COPE: Improving energy efficiency with coded preambles in low-power sensor networks | |
| CN103297174A (en) | High-speed mobile ad hoc network data transmission method based on dynamic network codes | |
| Kadi et al. | MPR-based flooding with distributed fountain network coding | |
| CN108135020A (en) | A kind of wireless sensor network opportunistic routing protocol design method based on network code | |
| CN103037436A (en) | Network coding perception wireless mesh routing protocol based on hybrid wireless mesh protocol (HWMP) | |
| CN101800629B (en) | Network coding method of code efficiency perception | |
| CN108259132B (en) | Bidirectional cooperative access method based on self-adaptive multi-decoding | |
| CN102970117A (en) | Method for suitable for end-to-end degree of freedom feedback of random linear network coding | |
| CN107426101B (en) | Quantum cluster fragment transmission method based on layering | |
| Kafaie et al. | FlexONC: Joint cooperative forwarding and network coding with precise encoding conditions | |
| CN103532667A (en) | Reliable wireless sensor network data transmission method based on Chinese remainder theorem | |
| CN105515983A (en) | Realization method of improved network coding of flooding based on network coding | |
| Wang et al. | TCAR: A new network coding-aware routing mechanism based on local topology detection | |
| Zhu et al. | A batched network coding scheme for wireless networks | |
| Dinesh et al. | Ultimate Video Spreading With Qos over Wireless Network Using Selective Repeat Algorithm |
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 | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20120606 Assignee: Jiangsu Nanyou IOT Technology Park Ltd. Assignor: NANJING University OF POSTS AND TELECOMMUNICATIONS Contract record no.: 2016320000212 Denomination of invention: Wireless mesh network coding method Granted publication date: 20140716 License type: Common License Record date: 20161118 |
|
| LICC | Enforcement, change and cancellation of record of contracts on the licence for exploitation of a patent or utility model | ||
| EC01 | Cancellation of recordation of patent licensing contract |
Assignee: Jiangsu Nanyou IOT Technology Park Ltd. Assignor: NANJING University OF POSTS AND TELECOMMUNICATIONS Contract record no.: 2016320000212 Date of cancellation: 20180116 |
|
| EC01 | Cancellation of recordation of patent licensing contract | ||
| CP02 | Change in the address of a patent holder |
Address after: 210003 new model road, Nanjing, Nanjing, Jiangsu Patentee after: NANJING University OF POSTS AND TELECOMMUNICATIONS Address before: 210003 new model road 66, Gulou District, Nanjing, Jiangsu Patentee before: NANJING University OF POSTS AND TELECOMMUNICATIONS |
|
| CP02 | Change in the address of a patent holder | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20120606 Assignee: Nanjing Aoding Network Technology Co.,Ltd. Assignor: NANJING University OF POSTS AND TELECOMMUNICATIONS Contract record no.: X2020980007080 Denomination of invention: A coding method for Wireless Mesh Networks Granted publication date: 20140716 License type: Common License Record date: 20201023 |
|
| EE01 | Entry into force of recordation of patent licensing contract | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20201222 Address after: 518000 No.6 Qinglong Road, Qinglong Road, Qinghua community, Longhua street, Longhua District, Shenzhen City, Guangdong Province Patentee after: Shenzhen Pengbo Information Technology Co.,Ltd. Address before: 210003, No. 66, new exemplary Road, Nanjing, Jiangsu Patentee before: NANJING University OF POSTS AND TELECOMMUNICATIONS Effective date of registration: 20201222 Address after: 224000 Qingyang Road (within Qingdun Office), Nanyang Town, Tinghu District, Yancheng City, Jiangsu Province (8) Patentee after: Yancheng Qinglong Jinbang water Co.,Ltd. Address before: 518000 No.6 Qinglong Road, Qinglong Road, Qinghua community, Longhua street, Longhua District, Shenzhen City, Guangdong Province Patentee before: Shenzhen Pengbo Information Technology Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| CI03 | Correction of invention patent |
Correction item: Patentee|Address Correct: Yancheng Qingdun Jinbang Water Affairs Co., Ltd.|224000 Qingyang Road, Nanyang Town, Tinghu District, Yancheng City, Jiangsu Province (in Qingdun Office) (8) False: Yancheng Qingyi Jinbang Water Co., Ltd.|224000 Qingyang Road, Nanyang Town, Tinghu District, Yancheng City, Jiangsu Province (in Qingdun Office) (8) Number: 01-01 Volume: 37 |
|
| CI03 | Correction of invention patent | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20211020 Address after: 224000 Nanyang Town sub district office, Tinghu District, Yancheng City, Jiangsu Province (8) Patentee after: Yancheng Jingneng Electrical Equipment Co.,Ltd. Address before: 224000 Qingyang Road (within Qingdun Office), Nanyang Town, Tinghu District, Yancheng City, Jiangsu Province (8) Patentee before: Yancheng Qingdun Jinbang water Co.,Ltd. |
|
| TR01 | Transfer of patent right |