CN105515983A - Realization method of improved network coding of flooding based on network coding - Google Patents
Realization method of improved network coding of flooding based on network coding Download PDFInfo
- Publication number
- CN105515983A CN105515983A CN201510823028.XA CN201510823028A CN105515983A CN 105515983 A CN105515983 A CN 105515983A CN 201510823028 A CN201510823028 A CN 201510823028A CN 105515983 A CN105515983 A CN 105515983A
- Authority
- CN
- China
- Prior art keywords
- packet
- node
- packets
- data
- agreement
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/32—Flooding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0076—Distributed coding, e.g. network coding, involving channel coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a realization method of an improved network coding of flooding based on network coding. The network coding of the realization method allows data processing based on a traditional data forwarding method of network nodes; the network throughput, robustness and reliability are effectively increased. The realization method combines the network coding technology with a flooding protocol and provides an improved network coding of flooding (NCFD), linear network coding technology is adopted on the basis of multi-path transmission. Experimental simulation result shows that with the increasing number of network nodes, NCFD can significantly decrease network energy consumption and data redundancy.
Description
Technical field
The present invention relates to the implementation method of the agreement that floods that a kind of coding Network Based improves, belong to Computer network technical field.
Background technology
Wireless sensor network (WSN) has the advantages such as low cost, high flexibility, extensive self-organizing network, makes it have application prospect widely.The agreement that floods is an original agreement of WSN, a lot of operations in wireless sensor network, and such as the operation such as data retransmission, time synchronized, node locating, formation routing tree all needs to flood.And almost in all Routing Protocols, the strategy that floods all can be used in transfer of data or route discovery stage.Therefore the performance improving the agreement that floods has important facilitation for the improvement in performance of agreement itself and other agreement.The agreement that floods specifies, after certain node completes the initialization of broadcast, just this message is sent to its all neighbor node.When certain node first time receives FAM (floodingalgorithmmessage), then send to other neighbor nodes with the form of broadcast, this FAM was just abandoned as this node has received, finally information data is sent to destination node, each node finally realizing whole network accepts to be FAM.This agreement deficiency is, it easily causes " implosion " and " overlap " of information, makes the overload of network, causes the waste of resource.But the agreement that floods is and the most reliable routing algorithm the simplest, under violent at joint movements, to pass in and out network frequent variations scene, it is the most effective mode that the whole network floods, and has fabulous robustness.
Network coding technique is an important breakthrough in Research on Network Communication field, and it allows network node to participate in data processing based on the method for traditional data retransmission, can effectively improve network throughput, robustness and reliability.Appearing as of network code overcomes overload in the agreement that floods, and the problems such as the wasting of resources provide a new thinking.Based on the network coding method (COPE) of chance, being a kind ofly relate to the mechanism of encoding between data flow, is the Routing Protocol for multiple unicast stream.COPE agreement adopts random coded mode, can obtain the data message that neighbor node receives, and the meeting of detection code machine, effectively can improve the throughput that wireless network clean culture transmits.Encoding operation used by COPE is fairly simple, compares and is applicable to wireless sensor network.But, in many application of wireless senser, all require that perception data is all transferred to destination, and do not lose and mistake occurs.But wireless communication link high failure rate, node resource are limited and the factor such as environmental interference makes the data transmission credibility of wireless sensor network be difficult to be protected, and therefore improving data transmission credibility is major issue in Design of Wireless Sensor Network always.The research of current reliable routing concentrates on and utilizes the redundancy of network to send to realize reliability, comprise multipath and packet loss re-transmission policy, and the message of high reliability transmits and has requirement of real-time more.Multipath retransmits relative to packet loss has the little advantage of time delay, but multipath means the increase of data packet redundant traffic volume.Consider the principal character that sensor network is resource-constrained, multithreading resource consumption can be relatively bigger than normal, so said method can cause efficiency to reduce, network lifecycle shortens.And the present invention can solve problem above well.
Summary of the invention
The object of the invention is the deficiency solving above-mentioned prior art problem, provide the implementation method of the agreement that floods that a kind of coding Network Based improves, the method uses the network coding scheme of XOR algorithm, the packet transmitted is processed, can effectively save network bandwidth resources and consumed energy.This agreement uses simple xor operation to complete network code, based on COPE encoding mechanism, increases data processing module, can obviously reduce network energy consumption and data redudancy between Route establishment and two stages of data retransmission.
The present invention solves the technical scheme that its technical problem takes: the implementation method of the agreement that floods that a kind of coding Network Based improves, and the method protocol code process comprises:
Step 1: when node is ready for sending data, first checks that this packet is source data packet, if source data packet, then directly sends; If node is transit node, then calls encryption algorithm and search code machine meeting, if there is code machine just can carry out encoding operation;
Step 2: receive table according to the neighbours of oneself and judge that can neighbours decode; If all n the source data packet comprised in encoded packets, and learn that neighbours' reception table at least has wherein n-1, then represent that this neighbor node can decode this encoded packets; Wherein, n-1 indicates n-1 source data packet;
Step 3: if by judging, then carry out xor operation;
Step 4: after traveling through complete output queue, upgrades packet header information according to coded data packet set.
Further, protocol-decoding process of the present invention comprises:
Step 1: obtain encoded packets information; In array, obtain the information of all packets participating in coding, comprise source node address, sequence number, transmitting time, from coded data packet, obtain the number of the source data packet participating in coding;
Step 2: judge to decode; Compare with coded data packet in the data pool of oneself, add up the number of different packets; If different packet numbers is 1, then can decodes corresponding different packet, otherwise decode unsuccessfully, simultaneously, the source address of the non-existent packet of statistic record data pool and sequence number, when successfully decoded, this information is exactly the information of the raw data packets decoded;
Step 3: recover raw data packets; If can successfully decode, node just performs decode operation, by carrying out xor operation to encoded packets and known source data packet, obtains new data packets; By information corresponding in encoded packets packet header write new data packets packet header being completed the acquisition of header packet information.
Agreement of the present invention uses simple xor operation to complete network code, and node only needs lower computing capability just can complete.
Agreement of the present invention is based on COPE encoding mechanism, between Route establishment and two stages of data retransmission, increase data processing module.
Protocol application of the present invention in wireless sensor network, the operations such as such as data retransmission, time synchronized, node locating, formation routing tree.
Beneficial effect:
1, network coding technique is combined with the agreement that floods by the present invention, and the basis of Multipath Transmission adopts linear network encoding technology, and achieving network code increases along with the increase of nodes quantity.
2, the present invention can obviously reduce network energy consumption and data redudancy, and can effectively save network bandwidth resources and consumed energy.
3, the present invention uses xor operation to complete network code, and node only needs lower computing capability just can complete.
Accompanying drawing explanation
Fig. 1 is the method flow diagram that the present invention receives data processing.
Embodiment
Below in conjunction with Figure of description, the invention is described in further detail.
Embodiment one
(1) data processing module
As shown in Figure 1, the present invention supposes that certain node sends packet p, and its neighbor node receives this packet p, then the treatment step receiving data is as follows:
Step 1: if p is raw data packets, first judges the packet that it is whether new, if new packet, just more new neighbor reception table this packet is backuped to reception tank, if not new data packets, just directly to abandon this bag; And then judge whether neighbor node has received this packet all, if neighbor node does not receive these data, so just wait for code machine meeting, coded treatment is carried out to packet, and then sends, otherwise just feeding output sequence waits for a random duration.If this neighbor node has received this packet all, this node has not just forwarded this packet.
Step 2: if p is coded data packet, then need first to carry out decoding process to this packet.After decoded packet data, again repeat the operation of step 1.
(2) cataloged procedure
Step 1: when node is ready for sending data, first checks that this packet is source data packet, if source data packet, then directly sends.If node is transit node, then calls encryption algorithm and search code machine meeting, if there is code machine just can carry out encoding operation.
Step 2: receive table according to the neighbours of oneself and judge that can neighbours decode.If all n the source data packet comprised in encoded packets, and learn that neighbours' reception table at least has wherein n-1, then represent that this neighbor node can decode this encoded packets.Wherein, n-1 indicates n-1 source data packet.
Step 3: if by judging, then carry out xor operation.
Step 4: after traveling through complete output queue, upgrades packet header information according to coded data packet set.
(3) decode procedure
Step 1: obtain encoded packets information.In array, obtain the information of all packets participating in coding, comprise source node address, sequence number, transmitting time, from coded data packet, obtain the number of the source data packet participating in coding.
Step 2: judge to decode.Compare with coded data packet in the data pool of oneself, add up the number of different packets.If different packet numbers is 1, then can decodes corresponding different packet, otherwise decode unsuccessfully.Meanwhile, the source address of the non-existent packet of statistic record data pool and sequence number, when successfully decoded, this information is exactly the information of the raw data packets decoded.
Step 3: recover raw data packets.If can successfully decode, node just performs decode operation.By carrying out xor operation to encoded packets and known source data packet, obtain new data packets; By information corresponding in encoded packets packet header write new data packets packet header being completed the acquisition of header packet information.
Embodiment two
The present invention supposes that the packet of node A is Ql, and the packet of Node B is Q2, and the packet of node C is Q3.Suppose that each node has obtained 2 respective hop neighbor states.Now 3 data packet broadcast are gone out by A, B, C successively, and node E just have received these three packets of Ql, Q2, Q3.Node is according to the upper hop information of packet, and 2 hop neighbor node tables, upgrades the neighbours' reception table of oneself.As shown in table 1:
The neighbours of table 1:E receive table
E | Q l | Q 2 | Q 3 |
A | 1 | 0 | 1 |
B | 0 | 1 | 0 |
C | 1 | 0 | 1 |
D | 0 | 1 | 0 |
From table 1, E, when being ready for sending Ql, finds the packet that can participate in encoding at output queue place.Send Ql ⊕ Q2 if first consider, neighbor node success is decoded, thus obtains the packet of disappearance.All have at least one packet in packet Ql, Q2 due to A, B, C, D, so when they receive encoded packets Ql ⊕ Q2, missing data bag can be obtained by one's own packet and encoded packets are carried out xor operation.Continue to add raw data packets if consider again, send Ql ⊕ Q2 ⊕ Q3.Neighbor node cannot successfully be decoded, and with regard to node A, it has packet Ql, when it receives encoded packets Ql ⊕ Q2 ⊕ Q3, does not obtain disappearance bag Q2 and Q3 by xor operation.Send so node E finally selects packet Ql, Q2 to carry out coding.After its 4 neighbours receive this encoded packets, neighbours B and D carries out xor operation decode missing data bag Ql by receiving encoded packets and existing packet Q2.In like manner, neighbours A and C carries out xor operation obtain missing data bag Q2 by receiving packet and data with existing bag Ql.
Claims (5)
1. an implementation method for the agreement that floods of coding improvement Network Based, it is characterized in that, described method protocol code process comprises:
Step 1: when node is ready for sending data, first checks that this packet is source data packet, if source data packet, then directly sends; If node is transit node, then calls encryption algorithm and search code machine meeting, if there is code machine just can carry out encoding operation;
Step 2: receive table according to the neighbours of oneself and judge that can neighbours decode; If all n the source data packet comprised in encoded packets, and learn that neighbours' reception table at least has wherein n-1, then represent that this neighbor node can decode this encoded packets;
Step 3: if by judging, then carry out xor operation;
Step 4: after traveling through complete output queue, upgrades packet header information according to coded data packet set.
2. the implementation method of the agreement that floods of a kind of coding improvement Network Based according to claim 1, it is characterized in that, described method protocol-decoding process comprises:
Step 1: obtain encoded packets information; In array, obtain the information of all packets participating in coding, comprise source node address, sequence number, transmitting time, from coded data packet, obtain the number of the source data packet participating in coding;
Step 2: judge to decode; Compare with coded data packet in the data pool of oneself, add up the number of different packets; If different packet numbers is 1, then can decodes corresponding different packet, otherwise decode unsuccessfully, simultaneously, the source address of the non-existent packet of statistic record data pool and sequence number, when successfully decoded, this information is exactly the information of the raw data packets decoded;
Step 3: recover raw data packets; If can successfully decode, node just performs decode operation, by carrying out xor operation to encoded packets and known source data packet, obtains new data packets; By information corresponding in encoded packets packet header write new data packets packet header being completed the acquisition of header packet information.
3. the implementation method of the agreement that floods of a kind of coding improvement Network Based according to claim 1, is characterized in that: described agreement adopts network coding technique to process the packet transmitted; Described agreement uses xor operation to complete network code.
4. the implementation method of the agreement that floods of a kind of coding improvement Network Based according to claim 1, is characterized in that: described agreement is based on COPE encoding mechanism, between Route establishment and two stages of data retransmission, increases data processing module.
5. the implementation method of the agreement that floods of a kind of coding improvement Network Based according to claim 1, is characterized in that: the protocol application of described method is in wireless sensor network.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510823028.XA CN105515983A (en) | 2015-11-24 | 2015-11-24 | Realization method of improved network coding of flooding based on network coding |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510823028.XA CN105515983A (en) | 2015-11-24 | 2015-11-24 | Realization method of improved network coding of flooding based on network coding |
Publications (1)
Publication Number | Publication Date |
---|---|
CN105515983A true CN105515983A (en) | 2016-04-20 |
Family
ID=55723638
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201510823028.XA Pending CN105515983A (en) | 2015-11-24 | 2015-11-24 | Realization method of improved network coding of flooding based on network coding |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN105515983A (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110071928A (en) * | 2019-04-28 | 2019-07-30 | 广东电网有限责任公司 | A kind of method for converting protocol actively adapting to power grid communication agreement and system |
CN113169934A (en) * | 2018-09-12 | 2021-07-23 | 华为技术有限公司 | System and method for backup flooding topology separation |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7760699B1 (en) * | 2006-08-05 | 2010-07-20 | Sandeep Malik | System and method for efficient transmission of electronic information |
CN102170332A (en) * | 2011-05-18 | 2011-08-31 | 西安电子科技大学 | Opportunistic routing protocol data distributing method based on fountain code and network coding |
CN102299771A (en) * | 2011-09-08 | 2011-12-28 | 南京邮电大学 | Network coding control method for multi-hop multi-data-stream network |
CN103561445A (en) * | 2013-11-12 | 2014-02-05 | 北京工业大学 | Wireless sensor network multi-path routing method based on network coding |
-
2015
- 2015-11-24 CN CN201510823028.XA patent/CN105515983A/en active Pending
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7760699B1 (en) * | 2006-08-05 | 2010-07-20 | Sandeep Malik | System and method for efficient transmission of electronic information |
CN102170332A (en) * | 2011-05-18 | 2011-08-31 | 西安电子科技大学 | Opportunistic routing protocol data distributing method based on fountain code and network coding |
CN102299771A (en) * | 2011-09-08 | 2011-12-28 | 南京邮电大学 | Network coding control method for multi-hop multi-data-stream network |
CN103561445A (en) * | 2013-11-12 | 2014-02-05 | 北京工业大学 | Wireless sensor network multi-path routing method based on network coding |
Non-Patent Citations (1)
Title |
---|
LI NA ZHANG: "an improved flooding protocol based on network coding", 《INFORMATION, COMPUTER AND APPLICATION ENGINEERING》 * |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113169934A (en) * | 2018-09-12 | 2021-07-23 | 华为技术有限公司 | System and method for backup flooding topology separation |
US11811611B2 (en) | 2018-09-12 | 2023-11-07 | Huawei Technologies Co., Ltd. | System and method for backup flooding topology split |
CN110071928A (en) * | 2019-04-28 | 2019-07-30 | 广东电网有限责任公司 | A kind of method for converting protocol actively adapting to power grid communication agreement and system |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP2962428B1 (en) | Method and apparatus for improving performance in a wireless network | |
CN102497248B (en) | Data retransmission method based on network coding | |
CN107959551A (en) | A kind of reliable data transport in wireless sensor networks method based on network code | |
Peng et al. | Fault-tolerant routing mechanism based on network coding in wireless mesh networks | |
CN108449161B (en) | Retransmission method based on network coding in relay cooperation wireless network | |
Anastasi et al. | A hybrid adaptive protocol for reliable data delivery in WSNs with multiple mobile sinks | |
CN102170332A (en) | Opportunistic routing protocol data distributing method based on fountain code and network coding | |
CN102123471A (en) | Stub network of Internet of things and seepage data transmission method thereof | |
CN101895376A (en) | Transmission method for realizing data broadcasting in multi-hop wireless network | |
CN101969668A (en) | Data transmission method for wireless cooperative relay system | |
Liu et al. | On-surface wireless-assisted opportunistic routing for underwater sensor networks | |
CN102170613B (en) | Cognition-based self-organized network layered coding multicast method | |
CN103200088A (en) | Improved type MMRS fixed relay node selection signal transmission method based on fountain encoding | |
CN104852788A (en) | Data broadcast ARQ method based on maximum-minimum network encoding | |
CN104539387A (en) | Hop-by-hop reliable transmission control method for underwater wireless sensor network | |
CN102208962A (en) | Wireless data transmission method | |
Rajan et al. | A Comprehensive analysis of Network Coding for Efficient Wireless Network Communication | |
Chi et al. | Efficient network coding-based loss recovery for reliable multicast in wireless networks | |
CN105515983A (en) | Realization method of improved network coding of flooding based on network coding | |
Platz et al. | Random network coding in wireless sensor networks: Energy efficiency via cross-layer approach | |
CN102025473A (en) | Retransmission method based on intergenerational network coding in packet network | |
CN108259132A (en) | One kind is based on adaptive multiple decoded two-way cooperation cut-in method | |
Rivera et al. | Performance dynamic coding RLNC LoRa on smart cities | |
CN102377523B (en) | Network coding method of time division duplex (TDD) wireless relay cellular network and communication method | |
Manoranjitham et al. | Performance enhancement using network coding in dynamic source routing |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
RJ01 | Rejection of invention patent application after publication | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160420 |