CN103475453B - Collaboration communication method based on random linear network encoding - Google Patents
Collaboration communication method based on random linear network encoding Download PDFInfo
- Publication number
- CN103475453B CN103475453B CN201310420089.2A CN201310420089A CN103475453B CN 103475453 B CN103475453 B CN 103475453B CN 201310420089 A CN201310420089 A CN 201310420089A CN 103475453 B CN103475453 B CN 103475453B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- packet
- cluster
- stage
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Abstract
The present invention is directed to wireless sensor network (Wireless Sensor Networks, WSNs the reliability for) communicating, propose the collaboration communication method (Network Coding Based Cooperative Communication Scheme, NCCC) based on network code.NCCC combines collaboration communication and the respective advantage of network code, obtains certain coding postiive gain by carrying out network code to transmission packet, while reducing because respective nodes fail using collaboration communication and causing the probability of communication failure.In NCCC, each node disjoint encodes and sends packet, it is not necessary to which several nodes send data simultaneously, does not therefore need strict clock synchronization between node.Meanwhile, the coding vector of network code is randomly generated in finite field, so as to reduce the complexity of realization.It is low that the present invention has implementation complexity, it is possible to greatly improves the feature of the communication reliability in WSN.
Description
Technical field
The present invention is directed wireless sensor network (Wireless Sensor Networks, WSNs) and its cooperation are led to
Letter method, specifically, is network code and collaboration communication method and its reliability for being related in wireless sensor network etc.
Performance.
Background technology
Wireless sensor network is the network technology that rises nearly ten years, and it collects embedded system, radio communication skill
The new and high technologies such as art, computer networking technology, have broad application prospects, and have therefore attracted the world each in academia
Colleges and universities of state and the sight of research institution；Also the attention of captains of industry, current existing wireless sensor are progressively obtained in industrial quarters
Networking products are widely used in the multiple fields such as military affairs, industry, traffic, agricultural, medical treatment.
Wireless sensor network is made up of the sensor node for being distributed in monitored area in a large number, and these sensor nodes pass through
The mode of wireless Ad Hoc constitutes network.Sensor node by various kinds of sensors mounted thereon (as temperature sensor,
Humidity sensor, optical sensor etc.) after the corresponding ambient parameter data of detection, after local preliminary treatment, pass through network
Routing Protocol finds out the path for reaching aggregation node, then sends data to next-hop node.Next-hop node is through storage
The mode (or carrying out data and local data after data fusion) of forwarding transmits data to next-hop node again, until by number
According to being sent to aggregation node.The data for receiving are carried out aggregation process by aggregation node, are then passed through public communication network, are such as defended
The approach such as star, internet and mobile communications network send data to management terminal.
Where bad environments being normally at due to monitor area, inconvenience can not possibly provide continuation power supply or continuation
The offer mechanism complexity of power supply has to be solved, and therefore, sensor node is typically powered using battery.Further, since cost and body
Long-pending restriction, the hardware configuration of sensor node are very low, and data processing and storage capacity, wireless communication ability are limited, and communication can
Relatively low by property.It can thus be seen that some commonly use in computer network and wireless self-networking (Ad-hoc Network) logical
Letter agreement can not be used directly in wireless sensor network.In order to improve the communication reliability in WSN, have must design very much suitable
Simple efficient communication agreement for wireless sensor network.
Content of the invention
The present invention devises a kind of reliable collaboration communication method (Network Coding based on random network code
Based Cooperative Communication Scheme, NCCC), wireless senser is improved with relatively low implementation complexity
Communication reliability in network.In order to reach object above, the technical solution used in the present invention is as follows：
NCCC collaboration communication is the transmission method based on cluster.The broadcast that the NCCC method takes full advantage of radio communication is special
Property, being reduced by way of multicast causes the probability of communication failure because of wall scroll radio link problem.Meanwhile, entering every time
Before row data is activation, the nodes for state broadcast of each normal work, can so cause the node of each normal work to grasp
The working condition of other nodes.When there is node failure, qualified node serves as failure node automatically, on behalf of complete send out
Task is sent, to reduce impact of the node failure to communication reliability.
Node carries out linear network encoding to packet, only sends the packet after coding every time, and receiving terminal only needs to receive
To source data packet is decoded by enough packets for meeting decoding condition, without receiving all packets.Therefore, exist
Still can communicate successfully in the case of having respective communication links or node failure, improve the reliability of communication.Carrying out linear net
When network is encoded, by the way of random network code, i.e., coding vector is randomly generated in finite field and data are carried out linearly
Combination.Random network code itself can substantially reduce implementation complexity during coding so as to the sensing being easy in resource-constrained
Realize on device node.But, there is certain probability and (be designated as p in the coding vector for randomly generatingN,M) decoding condition is not met, from
And cause communication Packet Error Ratio (Packet Error Rate, PER) to there is a pN,MLower limit, when M, N value meets certain bar
During part, pN,MValue can accomplish very little.
Description of the drawings
Fig. 1 system model
The handling process of Fig. 2 source tufted state broadcast phase node
Fig. 3 source cluster coding transmission processe flow process
Fig. 4 package form
The handling process of Fig. 5 intermediate tufts state broadcast node
Cluster node re-encoding process in the middle of Fig. 6
Cluster data re-encoding transmission flow in the middle of Fig. 7
The performance comparison of various method (or algorithms) under Fig. 8 single hop case
Performance comparision of the PER of the various methods of Fig. 9 in the case of different jumping figures
The delay performance contrast of various methods under Figure 10 multiple jump condition
Specific embodiment
Data processing method used by NCCC collaboration communication mainly include source node place cluster (source cluster) processing procedure, in
Between the processing method of cluster and the processing procedure of destination node place cluster (purpose cluster).Further to the present invention below in conjunction with the accompanying drawings
Explanation.
1. the processing method of source cluster is divided into three phases：Each node state broadcast in source node data packet broadcast stage, cluster
And transmit queue builds each nodes encoding data transmission phase in stage and cluster.
Stage one：The source node data packet broadcast stage.
Source node will need the source data packet for being sent to destination node to be sent to other nodes in cluster by way of broadcast.
Stage two：In cluster, each node state broadcast and transmit queue build the stage.
In the cluster of source, the node of all normal works carries out other nodes of state broadcasting announcements oneself work in specific time slot
State, then monitors and receives the state broadcast of other nodes in other time slots.State will be sent according to the state advertisement for receiving wide
The node number of the node that broadcasts is sequentially stored in TransQueue queue, is taken turns to when oneself broadcasting also while depositing the node number of oneself
Enter TransQueue.As shown in Fig. 2 wherein t represents current time slots, n is used for recording the section for sending broadcast for the flow chart in this stage
Point number (node number of normal work, n≤N i.e. in this cluster of epicycle), I is used for minute book node institute in TransQueue
The position at place.
Stage three：Each nodes encoding data transmission phase in cluster.
Assume that source data packet length can carry out M decile, the node (including source node) of normal work is by source number in the cluster of source
It is divided into M isometric data segment (P according to bag1,P2,…,PM).When each cluster sends data to next cluster, it is required for carrying out n times
Send, when node number n of cluster normal work is sent less than N, as TransQueue is round-robin queue, in TransQueue
N node sequentially sent after, transmit queue be returned to the beginning of TransQueue carry out be left time slot transmission
Task, constantly circulation is until send N number of packet.Each node may be sent once in a wheel transmitting procedure incessantly, therefore
Each node needs to calculate this node in the number of times of data transfer needs transmission and determines the time slot of transmission, and specific practice is as follows：
The business for making N/n is Q, and remainder is r, and this node location in TransQueue is I, then be transmitted across at this
In journey, this node needs the number of transmissions that carries out to be：
(wherein symbolRepresent the operation to rounding under " ")
It is that this node is needed respectively in I, n+I ..., (c-1) × n+I data slot is by data segment (P1,P2,…,PM)
Carry out coding transmission, will carry out each time sending after first encoding package, in cluster, always be divided into N number of sending time slots, each when
Gap sends a coded data packet, and in cluster, all nodes will send N number of coded data packet altogether.
Coding method is as follows：First field element v random on GF (q) domaini, constitute the column vector v=(v of M × 1 dimension1,
v2,…,vM)T, by (P1,P2,…,PM) and v carry out the multiplication operation on GF (q) domain, data C after being encoded：
C=(P1P2… PM)·v
The C for obtaining and v is carried out package transmission, this phase flow figure is as shown in figure 3, data packet form is as shown in Figure 4.
2. the processing procedure of intermediate tufts is divided into three phases：Data reception phase, state broadcast phase data bag are compiled again
Code and data is activation stage.
Stage one：Data reception phase.
One data receiver list RecvTable of each node maintenance and receiving data bag quantity J.When node is from upper hop
When cluster receives a packet, packet is stored in RecvTable, and makes J=J+1.
Stage two：State broadcast phase.
After the data receiver of first stage terminates, in cluster, the node of institute's normal work is broadcasted certainly in specific time slot
The situation of oneself receiving data bag, while other node broadcasts, broadcast data are monitored and received to the time slot in other nodes
The quantity of the packet received comprising oneself in bag.The handling process in this stage broadcasts place with the state in the stage two in the cluster of source
Reason flow process is similar to, simply the sequencer procedure of many TransQueue.
In this state broadcast, each node also notices, in addition to noticing working condition certainly, the number for oneself receiving
According to bag quantity J, in cluster, all nodes in epicycle normal work broadcast to obtain by the state for receiving other nodes transmissions in cluster
Know the situation of other node receiving data bags.Quantity J of the packet that receive of each node of each node to collect
Order from big to small being ranked up to TransQueue, enter by order of the equal node of J value then with node number from small to large
Row sequence.This phase flow figure is as shown in Figure 5.
Stage three：Packet re-encoding and data is activation stage.
If the individual packet of m (m≤N) that node is received：PR=(PR1,PR2,…,PRm), to PRProcess is once re-encoded
As follows：
First m field element v is randomly selected from GF (q) domainRiComposition column vector vR=(vR1,vR2,…,vRm)T, to PRInstitute
Linear combination is carried out by v in packet and C and constitutes new vTAnd CT, then be packaged into new packet and be transmitted, as shown in Figure 6.
Data transmission procedure is similar to the data transmission procedure in stage three in the cluster data processing procedure of source：Existed according to this node
In TransQueue, location calculates this node and needs to carry out the number of times c of data is activation in epicycle transmission and determine oneself
Sending time slots, carry out data is activation in the sending time slots of oneself, as shown in Figure 7.
3. the cluster data processing procedure of mesh is divided into four-stage：Data reception phase, state broadcast phase, packet collect
Stage and destination node decoding stage.
Stage one：Data reception phase.
This stage is same with the data reception phase in intermediate tufts data handling procedure.
Stage two：State broadcast phase.
This stage is identical with each node state broadcast phase in the cluster in the cluster data processing procedure of source.
Stage three：Packet collects the stage.
In this stage, purpose cluster in addition to destination node, the packet for receiving all is turned by the node of other normal works
Destination node is issued, the sequence number of packet enters in the RecvTable that the packet that collects is received by destination node with oneself
Row contrast, if having identical, illustrate the packet that in the existing destination node of the packet collected, then collects described in discarding.
Stage four：Destination node decoding stage.
After destination node is collected all packets that other nodes are sent in cluster and abandons repetitive data packet, it is right to begin to
The packet for receiving is decoded.If the number of the packet for receiving is m, the collection of the coding vector in all packets is combined into VD
=(VD1,VD2,…,VDm), wherein VDiIt is the data vector of i-th packet carrying, data segment collection is combined into CR=(C1,C2,…,
Cm), then VR、CRWith initial data section P=(P1,P2,…,PM) relation have：
P·VD=CR
If VDi=(vDi1,vDi2,…,vDiM)T, above formula can be write as
System of linear equations form is converted into, is obtained
From above equation group, work as m<During M, equation group has many solutions, then can not solve raw information P；As m >=M, if
rank(VD)=M, then equation group have unique solution.Now raw information P can be solved by Gaussian elimination method.
The unfailing performance such as Fig. 8 institute of various method (NCCC, MRNC, RDLC, MIMO, SISO) during single-hop transmission
Show, it can be seen that under conditions of equal energy is consumed, the best performance of RDLC but the implementation complexity of RDLC are relatively
Height, applies relatively difficult in the wireless sensor network that all kinds of resources all extremely lack.The unfailing performance of NCCC is all than SISO
And the performance of MRNC will be got well, and work as N>During M, in the low energy consumption stage, the performance of NCCC is slightly better than collaboration MIMO.
In multi-hop transmission, the mistake bag Performance Simulation Results of various methods are as shown in figure 9, the PER of various methods is all with jump
Several increase faces is in rising trend.Under the same conditions, the PER rate of climb of NCCC is all low than MRNC and SISO, and reason is such as
Under：MRNC sends the packet after network code by the path of redundancy to destination node, is all independent biography per paths
Defeated, and use single-point single-point is wirelessly transferred.If an independent pathway is in any one transmission that jumps of transmitting procedure
Failure, then whole piece path transmission failure, therefore with transmission path elongated (i.e. jumping figure becomes big), the probability of the bust this of MRNC
Just increase.The rate of climb of RDLC is most fast, and RDLC adopts old packet and new data packets to encode the mode of transmission together not increase
Plus transmission delay and improve reliability, but will also result in because of the failure that certain once transmits and cause all packets for encoding together
Can not be correctly decoded, so as to there is mass data bust this.When transmission path is longer, packet is passed on the transmit path
The probability of defeated failure just increases, and can cause the situation that mass data bag can not be correctly decoded in RDLC, also can be anxious so as to its PER
Acute rising.And set forth herein NCCC method make full use of the broadcast characteristic of radio communication, multiple sections are sent by a node
Point is while the mode of reception, reduces probability of the single-point to single-point communication failure, so as to improve the success rate of communication.
Under multiple jump condition, the delay performance of various methods is as shown in Figure 10.It can be seen that SISO, RDLC and
The time delay of MRNC is relatively small, because they are all communication of the pure single-point to list, without the association between collaboration communication interior joint
The time delay that makees the distribution with time slot and produce.Collaboration MIMO between cluster during cooperation transmission because all nodes be all in same frequency
Rate is while send, the time delay of this part is as SISO.But collaboration MIMO each cluster in the transmitting procedure of each jump has
One cluster head, sending cluster head in cluster needs for data distribution to carry out cooperation transmission to other cooperative nodes, receives in cluster and removes cluster head
Other nodes outer need to receive tidal data recovering in one's hands to cluster head, and data distribution stage cluster head only needs a time slot just permissible
Complete, but the tidal data recovering stage then needs to be divided into N-1 time slot, therefore which needs extra time delay to carry out data with respect to SISO
Distribute and collect, and increase with the increase of N.Due to being required for carrying out data distribution during each jump, with jump
Several increases, the time delay that its factor data distribution data collects generation also linearly will increase.For NCCC, in source, cluster source node is needed
The broadcast distribution of data to be carried out and the packet for receiving is collected to destination node in each node of purpose cluster, have in each cluster
The process of one next state broadcast and when packet transmit and the header overhead (coding vector) of some, therefore NCCC when
Prolonging will be big than SISO, RDLC and MRNC, and increases as jumping figure increases.Compared to collaboration MIMO, because NCCC is in each jump
It is required for carrying out the state broadcast of each node, at jumping figure less (if jumping figure is 1 or 2), time delay is somewhat bigger than collaboration MIMO
Some.But as NCCC in intermediate tufts and need not carry out the distribution of data and collect, than collaboration MIMO save part when
Prolong expense, as the time delay expense that the increase of jumping figure is saved also increases, it can be seen that jumping figure is bigger, NCCC is than cooperation
The time delay that MIMO is saved is more, and overall delay is less.In addition, code efficiency R (R=M/N) of NCCC is less, the number for sending is described
More according to redundancy packet information, then need more times to be transmitted, therefore time delay is bigger.
Claims (3)
1. a kind of collaboration communication method based on random linear network encoding, it is characterised in that：By several node group cluster associations
Make transmission packet, before packet is sent, the node of each normal work other node broadcasts state of oneself all into cluster
And the packet number for receiving, while receive the broadcast message of other nodes and by node number and its data packet number for receiving
Be stored in a transmit queue TransQueue, the packet number for afterwards TransQueue queue being received by node from
Arrive greatly and little be ranked up in order so that the node of each normal work all may know that other normal work nodes in cluster in cluster
State and its data packet number for receiving, when there is node cisco unity malfunction, the node of other normal works can take over mistake
The transmission task of effect node；
Send in data procedures in every wheel, each cluster is both needed to send N number of coded data packet, the node of intermediate tufts according to
The position that oneself is located in TransQueue determines the sending time slots of oneself, and the packet for receiving is carried out in specific time slot
Random network code, is retransmited afterwards, if the length of queue TransQueue is n=N, each node of N number of node in cluster
All press the order in TransQueue and respectively send a coded data packet；If n<N, then in cluster, each node of n node is pressed
Order in TransQueue respectively sends a coded data packet, and the 1st node that then presses in TransQueue sends (n+1)th
Individual coded data packet, the 2nd node send the n-th+2 packets, by that analogy, until sending N number of coded data end-of-packet, its
In, n≤N；
Three kinds of process：The process of source cluster, the process of intermediate tufts, purpose cluster data are processed, and its processing procedure that mutually coordinates；
The process of source cluster, is divided into three phases：Each node state broadcast and transmit queue in source node data packet broadcast stage, cluster
Each nodes encoding data transmission phase in structure stage and cluster, the concrete realization for processing are as follows：
Stage one：Source node data packet broadcast stage source node will need to be sent to the source data packet of destination node by wide
The mode that broadcasts is sent to other nodes in cluster；
Stage two：In cluster, the broadcast of each node state and transmit queue build the node of all normal works in stage source cluster and exist
Specific time slot carries out state broadcasting announcements oneself working condition of other nodes, then monitors and receive other nodes in other time slots
State broadcast；The node number for sending the node of state broadcast is sequentially stored into by TransQueue team according to the state advertisement for receiving
In row, take turns to when oneself broadcasting also while the node number of oneself is stored in TransQueue；
Stage three：In cluster, each nodes encoding data transmission phase assumes that source data packet length can carry out M decile, source cluster
Source data packet is divided into M isometric data segment (P by the node of interior normal work1,P2,…,PM)；Each cluster sends data to down
During one cluster, it is required for carrying out n times transmission, when node number n of cluster normal work is sent less than N, due to TransQueue
It is round-robin queue, after the n node of TransQueue has sequentially sent, transmit queue is returned to TransQueue's
Beginning carries out being left the transmission task of time slot, and constantly circulation is until sent N number of packet；Each node takes turns transmitting procedure one
In may send incessantly once, therefore each node needs to calculate this node and needs the number of times of transmission and determine to pass in data transfer
Defeated time slot, specific practice are as follows：
The business for making N/n is Q, and remainder is r, and this node location in TransQueue is I, then in this transmitting procedure
This node needs the number of transmissions that carries out to be：
Wherein symbolRepresent the operation to rounding under " "；
It is that this node is needed respectively in I, n+I ..., (c-1) × n+I data slot is by data segment (P1,P2,…,PM) carry out
Coding sends, and sends, be always divided into N number of sending time slots in cluster after will carrying out first encoding package each time, and each time slot is sent out
A coded data packet is sent, all nodes will send N number of coded data packet altogether in cluster；
Coding method is as follows：First field element v is randomly selected on GF (q) domaini, constitute the column vector v=(v of M × 1 dimension1,
v2,…,vM)T, by (P1,P2,…,PM) and v carry out the multiplication operation on GF (q) domain, data C after being encoded：
C=(P1P2… PM)·v
The C for obtaining and v is carried out package transmission.
2. the collaboration communication method based on random linear network encoding according to claim 1, it is characterised in that intermediate tufts
Processing procedure, be divided into three phases：Data reception phase, the re-encoding of state broadcast phase data bag and data is activation rank
Section, concrete implementation are as follows：
Stage one：One data receiver list RecvTable of each node maintenance of data reception phase and receiving data bag
Quantity J；When node receives a packet from upper hop cluster, packet is stored in RecvTable, and makes J=J+1；
Stage two：After the data receiver of state broadcast phase first stage terminates, in cluster, the node of institute's normal work exists
Specific time slot broadcasts the situation of the receiving data bag of oneself, while the time slot in other nodes is monitored and receives which
His node broadcasts, the quantity of the packet received comprising oneself in broadcast data packet；The handling process in this stage is specific as follows：
In this state broadcast, each node also notices, in addition to noticing respective working condition, the data for oneself receiving
Bag quantity J, in cluster, all nodes in epicycle normal work broadcast to know by the state for receiving other nodes transmissions in cluster
The situation of other node receiving data bags；Each node with quantity J of the packet for receiving of each node collected from
Arrive greatly little order to be ranked up TransQueue, order of the equal node of J value then with node number from small to large is carried out
Sequence；
Stage three：Packet re-encoding and data is activation stage set the m data bag that node is received：PR=(PR1,PR2,…,
PRm), wherein m≤N, to PRIt is as follows that process is once re-encoded：
First m field element v is randomly selected from GF (q) domainRiComposition column vector vR=(vR1,vR2,…,vRm)T, to PRAll data
In bag, v and C carries out the new v of linear combination compositionTAnd CT, then be packaged into new packet and be transmitted；Data transmission procedure is：
According to this node in TransQueue location calculate this node need to carry out in epicycle transmission data is activation time
Number c simultaneously determines the sending time slots of oneself, carries out data is activation in the sending time slots of oneself.
3. the collaboration communication method based on random linear network encoding according to claim 2, it is characterised in that purpose cluster
Data processing, is divided into four-stage：Data reception phase, state broadcast phase, packet collect stage and destination node decoding
In the stage, it is implemented as follows：
Stage one：This stage of data reception phase is identical with the data reception phase of intermediate tufts data handling procedure；
Stage two：Each node state broadcast phase in cluster in state this stage of broadcast phase and source cluster data processing procedure
Identical；
Stage three：Packet collects the stage in this stage, purpose cluster in addition to destination node, the node of other normal works
All the packet for receiving is transmitted to destination node, the packet that collects is received by destination node with oneself
In RecvTable, the sequence number of packet is contrasted, if having identical, the existing destination node of the packet collected is described
In, then abandon described in the packet collected；
Stage four：Destination node decoding stage is when destination node collects all packets that other nodes are sent in cluster and loses
After abandoning repetitive data packet, begin to the packet to receiving and be decoded；If the number of the packet for receiving is m, all data
The collection of the coding vector in bag is combined into VD=(VD1,VD2,…,VDm), wherein VDiIt is the data vector of i-th packet carrying, number
C is combined into according to section collectionR=(C1,C2,…,Cm), then VD、CRWith initial data section P=(P1,P2,…,PM) relation have：
P·VD=CR
If VDi=(vDi1,vDi2,…,vDiM)T, above formula can be write as
System of linear equations form is converted into, is obtained
From above equation group, work as m<During M, equation group has many solutions, then can not solve raw information P；As m >=M, if rank
(VD)=M, then equation group have unique solution；Now raw information P can be solved by Gaussian elimination method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310420089.2A CN103475453B (en) | 2013-09-02 | 2013-09-02 | Collaboration communication method based on random linear network encoding |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310420089.2A CN103475453B (en) | 2013-09-02 | 2013-09-02 | Collaboration communication method based on random linear network encoding |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103475453A CN103475453A (en) | 2013-12-25 |
| CN103475453B true CN103475453B (en) | 2017-03-08 |
Family
ID=49800171
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310420089.2A Expired - Fee Related CN103475453B (en) | 2013-09-02 | 2013-09-02 | Collaboration communication method based on random linear network encoding |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103475453B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10425192B2 (en) * | 2015-09-30 | 2019-09-24 | The Chinese University Of Hong Kong | Loss-resilient protocols for communication networks |
| CN105680917B (en) * | 2016-02-25 | 2017-05-24 | 湖南师范大学附属中学 | Data transmission method for adaptively controlling transmission power in cooperative communication |
| CN109982403B (en) * | 2018-11-06 | 2021-07-23 | 北京邮电大学 | Multi-node cooperative packet transmission method based on multi-hop network |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102164369A (en) * | 2011-05-13 | 2011-08-24 | 南京邮电大学 | Method for broadcast authentication of wireless sensor network based on automaton and game of life |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8111619B2 (en) * | 2008-02-08 | 2012-02-07 | Honeywell International Inc. | Apparatus and method for routing data in wireless networks |
-
2013
- 2013-09-02 CN CN201310420089.2A patent/CN103475453B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102164369A (en) * | 2011-05-13 | 2011-08-24 | 南京邮电大学 | Method for broadcast authentication of wireless sensor network based on automaton and game of life |
Non-Patent Citations (4)
| Title |
|---|
| A novel cluster-chain channel adaptive routing protocol in wireless sensor networks;Xingcheng Liu，et.al;《QShine’08 Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality》;20080728;第3页第1栏第1行-第3页第2栏第14行 * |
| Application of STBC-Encoded Cooperative Transmissions in Wireless Sensor Networks;Xiaohua (Edward) Li，et.al;《IEEE SIGNAL PROCESSING LETTERS》;20050228;第12卷(第2期);全文 * |
| 基于网格的无线传感器网络节能路由算法;李莎等;《计算机工程》;20110531;第37卷(第9期);全文 * |
| 无线传感器网络中基于网络编码的协作通信研究;罗建中;《中国优秀硕士学位论文全文数据库信息科技辑》;20120731;第34页第2段-第35页第1段 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103475453A (en) | 2013-12-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Katti et al. | XORs in the air: Practical wireless network coding | |
| CN101951556B (en) | Wireless sensor network data distribution method based on network coding | |
| Du et al. | From rateless to distanceless: Enabling sparse sensor network deployment in large areas | |
| CN102170332B (en) | Opportunistic routing protocol data distributing method based on fountain code and network coding | |
| Mohammad et al. | Codecast: Supporting data driven in-network processing for low-power wireless sensor networks | |
| Wang et al. | Energy efficient broadcasting using network coding aware protocol in wireless ad hoc network | |
| Anastasi et al. | A hybrid adaptive protocol for reliable data delivery in WSNs with multiple mobile sinks | |
| CN101895376A (en) | Transmission method for realizing data broadcasting in multi-hop wireless network | |
| Sharma et al. | A reliable and energy efficient transport protocol for wireless sensor networks | |
| Sethi et al. | A study on energy efficient and reliable data transfer (eerdt) protocol for wban | |
| Lindsey et al. | Energy efficient broadcasting for situation awareness in ad hoc networks | |
| CN103475453B (en) | Collaboration communication method based on random linear network encoding | |
| Yahya et al. | An energy efficient and QoS aware multipath routing protocol for wireless sensor networks | |
| Zhu et al. | Network coding-based reliable IPv6 packet delivery over IEEE 802.15. 4 wireless personal area networks | |
| Platz et al. | Random network coding in wireless sensor networks: Energy efficiency via cross-layer approach | |
| Galluccio et al. | TC-Aloha: A novel access scheme for wireless networks with transmit-only nodes | |
| Asogwa et al. | Experimental analysis of AODV, DSR and DSDV protocols based on wireless body area network | |
| Kim et al. | Ear: An environment-adaptive routing algorithm for wbans | |
| Singh et al. | Improved priority-based data aggregation congestion control protocol | |
| Kafaie et al. | FlexONC: Joint cooperative forwarding and network coding with precise encoding conditions | |
| Karthikeyan et al. | Energy utilization strategies using novel approach in wireless sensor networks | |
| Tan et al. | PNCRM: a novel real-time multicast scheme in MANETs based on partial network coding | |
| Liu et al. | Performance evaluation of a converge-cast protocol for IEEE 802.15. 4 tree-based networks | |
| Charfi et al. | Trade-off between reliability and energy cost for content-rich data transmission in wireless sensor networks | |
| Sokullu et al. | MAC layer protocols for linear wireless sensor networks: a survey |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170308 Termination date: 20210902 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |