CN103532667B - Wireless sensor network data method for reliable transmission based on Chinese remainder theorem - Google Patents
Wireless sensor network data method for reliable transmission based on Chinese remainder theorem Download PDFInfo
- Publication number
- CN103532667B CN103532667B CN201310471587.XA CN201310471587A CN103532667B CN 103532667 B CN103532667 B CN 103532667B CN 201310471587 A CN201310471587 A CN 201310471587A CN 103532667 B CN103532667 B CN 103532667B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- network
- neighbor
- neighbor node
- 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
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a kind of wireless sensor network data method for reliable transmission based on Chinese remainder theorem, after node is shed at random, on the basis of unit circle figure UDG, combine Gabriel figure network is carried out topology control, adjust node transmitting power, update neighbor node collection, form network data communication topology.To packet advanced person's line linearity coding to be sent, encode the data to the data of many parts of mutual linear independences, these data acquisition Chinese remainder theorems it is divided into less subdata bag again and uses jete routing algorithm to be transferred to sink node along multipath these subdata bags, finally being completed the merging to partition data and the decoding to coded data by sink node.The data communications method of the present invention realizes relatively simple, the Routing Protocol that need not complexity just can be effectively improved the service efficiency of network energy, reduces the generation of network congestion, gives full play to coded actions, ensure that data are reliably transmitted to sink node, can be used for massive wireless sensor.
Description
Technical field
The invention belongs to technical field of wireless, relate to the data transmission method in a kind of wireless sensor network,
Specifically, a kind of wireless sensor network data method for reliable transmission based on Chinese remainder theorem is related to.
Background technology
Radio sensing network WSNs is the multi-hop wireless communication network with a large amount of sensing nodes as the basic element of character.These nodes
After being deployed in given application region, information in this region of node each perception also generates data, then by wireless multi-hop
Mode passes data to sink node and is further processed by sink node.
In the application of radio sensing network, sensor node is needing to lead to after being dispersed in certain detection region at random
Cross Ad hoc mode and constitute network, and data acquisition in the region of oneself.Node is when sending data to destination node
Generally to report the positional information of node simultaneously.Destination node can judge what this event occurred after receiving data accurately
Region, and take further measures.Such as in forest fire protection, when sensor node monitors fire generation, fire fighter
Need to be accurately positioned the position that fire occurs.Under normal circumstances, sensor node can utilize GPS (global positioning system) to position
Device or located in connection agreement determine geographical position, and by broadcast data packet and neighbor node exchange position information.
Sensor node is generally powered by the battery of finite energy, to the service efficiency team node of electricity and to whole biography
For sensor network most important.Wherein research shows, the energy that node communication stage transmission data are consumed accounts for node energy
The major part consumed.The raising method of WSNs energy efficiency, mechanism or agreement is proposed according to These characteristics researchers.
In terms of reducing network energy consumption, extending network lifetime, the method effect controlled based on topology is notable,
Extensive concern and research are arrived.Topology controls typically mainly to have two kinds of methods: a kind of based on power control, another is then
It is to use layering measure.The method controlled based on power is on the premise of satisfied connection covers basic demand, reduces as far as possible
Node transmitting power improves energy efficiency.Layering thought be then the adjacent situation according to node manage change cellular logic open up
Flutterring, whole network is divided into tufted structure one by one by common practice.
In the realization means that power controls, people often use and close on figure.Gabriel figure is a kind of conventional closing on
Figure.The path suitable with artwork lowest energy consumption can be found under normal circumstances on the Gabriel figure of structure.At document An
In Energy-saving Algorithm of WSN based on Gabriel Graph, author proposes with each node
Big GG limit adjusts corresponding communication radius as launching power, allows the transmission process of data carry out on Gabriel figure simultaneously.
The alternative down hop of the most each node is only limitted to the node having GG limit to connect with it, and in the range of being no longer maximum communication
All neighbours, decrease communication amount of calculation and Communication Jamming odds.
In order to reduce energy expenditure and the complexity in view of algorithm.At document A Novel Reliable and
In Energy-Saving Forwarding Technique for Wireless Sensor Networks.The applicant carries
Go out, at source node, data are carried out data compression, it would be desirable to the initial data of transmission utilizes Chinese remainder theorem to split, will
Bigger data are divided into a series of less data so that each node has only to send each little subdata.Sink
As long as what node was correct receives these subdatas, them just can be utilized to be reduced into former data.Here have only to assume sink node
Computing capability and energy just go for WSN and relatively low data can be kept to pass more than traditional sensor node
Defeated complexity.But whether the structure not accounting for network topology in article can bring Communication Jamming, does not also account for simultaneously
The impact on reliable data transmission of insecure communication link.
Summary of the invention
It is an object of the invention to the defect overcoming above-mentioned technology to exist, it is provided that a kind of based on Chinese remainder theorem wireless
Sensor network data method for reliable transmission, considers the shadow that topology controls and data are transmitted by unreliable communication link simultaneously
Ring, improve the reliability of data transmission by using network code to increase transmitting redundancy, effectively reduce individual data
Dependence, decrease the impact that unreliable communication link is brought, the energy utilization rate of whole network can be improved simultaneously, reduce
The Communication Jamming of network, meets the transmission requirement of large-scale wireless sensing network.
Its concrete technical scheme is:
A kind of wireless sensor network data method for reliable transmission based on Chinese remainder theorem, for its net of wireless sensing
Network energy consumption balance and transmit reliable problem, uses linear network encoding and jete routing algorithm to realize data communication, bag
Include following steps:
(1) in the plane domain of L × L, shedding N number of wireless sensor node at random, Sink node is positioned at monitored area
Edge, is responsible for accepting gather data and data are carried out relevant treatment；
(2) in wireless sensor network WSNs, sensor node, with maximum transmission power broadcast position information, and records neighbour
Occupy the information of node, form the unit circle figure UDG of network；
(3) according to unit circle figure UDG, utilize Gabriel figure construction algorithm, form that network is based on Gabriel figure to be opened up
Flutter structure；
(4) according to the topological structure of Gabriel figure, data communication topological structure is formed；
(4a) node i calculates the distance with each neighbor node under Gabriel figure respectively, finds out ultimate range therein,
And adjust self transmitting power, adjust its communication radius consistent with to big distance, reduction Communication Jamming；
(4b) node i sends query messages metadata information after adjusting radius under new communication radius, and it is non-right to find out
Claim the neighbor node of link, thus obtain neighbor node collection N (i) of symmetric links.；
(4c) repeat (4a), (4b), until all node i are obtained for neighbor node collection N (i) in whole network, formed
The data communication topology of network；
(5) in the data communication topology built, need the node sending data packet is completed after respective handling with
Minimum hop routing algorithm is delivered to sink node；
(5a) node i sending data is needed to first look for the number of neighbor node in neighbor node collection N (i) of self | N
(i)|；
(5b) if the number of neighbor node collection is 1, data are left intact and pass data to unique by node i
Neighbor node j, node j search the number of neighbor node collection N (j) of self | N (j) |；
Will if packet to be first passed through time (5c) number of neighbor node collection | N (j) | is more than or equal to 2 uniform enconding
Data encoding becomes the data of many parts of linear independences, the most again each data acquisition Chinese remainder theorem is carried out data segmentation, number
Number according to segmentation is identical with the number of the neighbor node collection of node i；
(5d) data after segmentation are delivered to sink node with minimum hop routing algorithm；
(5e) first the data after segmentation are merged, then are compiled by network by the data after sink node receives segmentation
Code carries out data decoding and recovers initial data, the data that i.e. source node is to be sent；
(5f) in other times section, if network there being other sensor nodes u need to send its number gathering data
According to bag, repeat (5a)-(5e) and just make sink node receive the data that source node sends.
Further preferably, described in step (3) according to unit circle figure UDG, utilize Gabriel figure building method, shape
Become the Gabriel figure topology of network, carry out as follows:
(3a) node i is according to oneself and the positional information of neighbor node j, the calculating circle with both i and j line as diameter
Home position and radius；
(3b) node i calculates the above-mentioned center of circle distance to other neighbor nodes, and judges that whether this distance is less than above-mentioned half
Footpath, deletes if less than then being concentrated from neighbor node by this node；
(3c) repeat step (2a)-(2b), until all neighbor node j are operated by node i, thus complete this joint
The renewal of some neighbor node；
(3d) step (2c) is repeated it is known that all node k in whole wireless sensor network have carried out above-mentioned behaviour
Make, this completes the Gabriel topology constructing of whole network；
Further preferably, time number | the N (j) | of the described neighbor node collection as node j of step (5c) is more than or equal to 2
Packet is first passed through uniform enconding and encodes the data to the data of many parts of linear independences, the most again each data acquisition is used grandson
Sub-remainder theorem carries out data segmentation, carries out in accordance with the following steps；
(5c1) when number | the N (j) | of neighbor node collection of node j is more than or equal to 2, its neighbor node collection N is searched
J whether comprising sink node in (), if sink node belongs to its neighbor node collection, then directly selecting sink node is down hop
Node, and to wanting packet to be left intact；Otherwise, step (5c2) is performed；
(5c2) assume that source node S needs the m data bag sent to be B1, B2..., Bm, then source node S is from finite field Fq
In randomly select coding vectorBy the m data bag B of source node1, B2..., BmIt is encoded into n number
According to bag E1, E2..., En(n >=m):
So by using uniform enconding, just by m data bag B to be sent for source node S1, B2..., BmConversion
For E1, E2..., En；
(5c3) data E after transmission codingkWhen, in the prime number p that intra-node definition is intrinsicki, wherein prime number
Number is identical with the number of its neighbor node, according to Chinese remainder theorem, to any given integer set { Ek1, Ek2...,
EkN, the integer of existence anduniquessMake Ek=Eki(mod pki), therefore, in one data E of transmissionkTime, only need
Each paths of its neighbor node to transmit Eki?.
Further preferably, the data after sink node receives segmentation in step (5e), first the data after segmentation are carried out
Merge, then by network code, decoding data recovered initial data, carry out in accordance with the following steps:
(5e1) data E after sink node receives segmentationkiAfter, utilize Chinese remainder theorem by data E of segmentationkiEnter
Row merges, data E before being splitk, EkComputational methods be:Coefficient c thereinki=
Qkiqki,Make cki=1 (mod pki)；
(5e2) data E before being splitkAfter, it is assumed that the m data that node receives is respectively E1, E2..., Em, enter
One step judges corresponding m coefficient vector α1, α2... αkWhether linear independence, if it is, solve data by coding
Code:
Just data convert is become initial data B by above-mentioned decoding1, B2..., Bm；
Compared with prior art, the invention have the benefit that
The present invention combines Gabriel figure and WSNs carries out topology control, limits the communication model of each node in conjunction with Gabriel figure
Enclose, reduce the energy consumption of node data transmitting-receiving, and reduce internodal Communication Jamming.
The present invention utilizes the broadcast characteristic being wirelessly transferred and network coding technique to propose the reliable transmission plan of data, it is to avoid
The impact that data are transmitted by the unreliability of wireless link.By ensureing the transmitting of local node, give full play to coding
Effect, it is ensured that data are reliably transmitted to sink node.
The present invention utilizes while network code Chinese remainder theorem the biggest data to be divided into one to be using
Arranging little subdata bag, each node only need to transmit subdata bag, avoids and occur that network is gathered around while having equalized energy expenditure
Plug.
The present invention is applicable to large-scale wireless sensor network, has good extensibility.
Accompanying drawing explanation
Fig. 1 is the main-process stream of present invention wireless sensor network data based on Chinese remainder theorem method for reliable transmission
Figure；
Fig. 2 is the procedure chart needing the node S transmitting data to process Data Data to be sent in the present invention；
Fig. 3 be the present invention emulate in given network generated unit circle figure UDG Yu Gabriel figure topology, wherein,
Fig. 3 (a) is that the present invention emulates the unit circle figure UDG topology generated in given network；
Fig. 3 (b) is that the present invention emulates the Gabriel figure topology generated in given network；
Fig. 4 is that the present invention uses 100 obtained ceiling capacities of Chinese remainder theorem post-simulation to reduce the factor (MERF)
Ordering chart；
Fig. 5 is before the present invention uses the segmentation of Chinese remainder theorem data and the contrast of the big smallest number of different pieces of information after segmentation
Figure, wherein:
Fig. 5 (a) is the quantity that the present invention is provided without the front data package size of Chinese remainder theorem data segmentation；
Fig. 5 (b) is the quantity of data package size after the present invention uses Chinese remainder theorem data to split；
Fig. 6 is the transmission reliability comparison diagram that the present invention uses uniform enconding and is provided without uniform enconding.
Detailed description of the invention
With specific embodiment, technical scheme is described in more detail below in conjunction with the accompanying drawings.
With reference to Fig. 1, present invention wireless sensor network data based on Chinese remainder theorem method for reliable transmission, specifically walk
Rapid as follows:
Step 1., in the plane domain of L × L, sheds N number of wireless sensor node at random, and Sink node is positioned at monitoring section
Edge, territory, is responsible for accepting gather data and data are carried out relevant treatment.
In step 2. wireless sensor network WSNs, sensor node is with maximum transmission power broadcast position information, and record
The information of neighbor node, forms the unit circle figure UDG of network.
(2.1) in network, each node broadcasts the positional information of self with maximum transmission power；
(2.2), after node i receives the positional information of neighbor node j, record this positional information and j is added adjacency list, shape
Become the initial adjacency list of node i；
(2.3) (2.1)-(2.2) are repeated, until all nodes of the positional information received all are added neighbour by node i
Connect table, form initial adjacency list；
(2.4) (2.3) are repeated, until the initial adjacency list that all nodes of network all obtain, thus form the unit of network
Pie chart UDG.
Step 3., according to unit circle figure UDG, utilizes Gabriel figure construction algorithm, forms network based on Gabriel figure
Topological structure.
(3.1) node i is according to oneself and the positional information of neighbor node j, calculates the circle with both i and j line as diameter
Home position and radius；
(3.2) node i calculates the above-mentioned center of circle distance to other neighbor nodes, and judges that whether this distance is less than above-mentioned half
Footpath, deletes if less than then being concentrated from neighbor node by this node；
(3.3) repeat step (3.1)-(3.2), until all neighbor node j are operated by node i, thus complete
The renewal of this nodes neighbors node；
(3.4) step (3.3) is repeated it is known that all node k in whole wireless sensor network have carried out above-mentioned
Operation, this completes the Gabriel topology constructing of whole network.
Step 4. according to the topological structure of Gabriel figure, forms data communication topological structure:
(4.1) node i calculates the distance with each neighbor node under Gabriel figure respectively, finds out ultimate range therein,
And adjust self transmitting power, adjust its communication radius consistent with to big distance, reduction Communication Jamming；
(4.2) node i sends query messages metadata information after adjusting radius under new communication radius, and it is non-right to find out
Claim the neighbor node of link, thus obtain neighbor node collection N (i) of symmetric links；
(4.3) (4.1)-(4.2) are repeated until all node i are obtained for neighbor node collection N (i), shape in whole network
Become the data communication topology of network.
Step 5., in the data communication topology built, needs the node sending data to be compressed at coding by packet
It is delivered to sink node with minimum hop routing algorithm along multipath after reason.
(5.1) node i sending data is needed to first look for the number of neighbor node in neighbor node collection N (i) of self；
(5.2) if the number of neighbor node collection is 1, data are left intact and pass data to only by node i
The neighbor node j of one, node j search the number of neighbor node collection N (j) of self；
(5.3) if packet being first passed through uniform enconding by data time the number of neighbor node collection is more than or equal to 2
Being encoded into the data of many parts of linear independences, the most again each data acquisition Chinese remainder theorem is carried out data segmentation, data are divided
The number cut is identical with the number of the neighbor node collection of node i；
(5.3.1) when number | the N (j) | of neighbor node collection of node j is more than or equal to 2, its neighbor node collection N is searched
J whether comprising sink node in (), if sink node belongs to its neighbor node collection, then directly selecting sink node is down hop
Node, and to wanting packet to be left intact；Otherwise, step (5c2) is performed；
(5.3.2) assume that source node S needs the m data bag sent to be B1, B2..., Bm, then source node S is from finite field
FqIn randomly select coding vectorBy the m data bag B of source node1, B2..., BmIt is encoded into n
Packet E1, E2..., En(n >=m):
So by using uniform enconding, just by m data bag B to be sent for source node S1, B2..., BmConversion
For E1, E2..., En.This coding is advantageous in that and different data is blent into one, and decreases and depends on individual data
Rely, add the transmission reliability of data；
(5.3.3) data E after transmission codingkWhen, in the prime number p that intra-node definition is intrinsicki, wherein prime number
Number identical with the number of its neighbor node.According to Chinese remainder theorem, to any given integer set { Ek1,
Ek2..., EkN, the integer of existence anduniquessMake Ek=Eki(mod pki).Therefore, in one data E of transmissionk
Time, it is only necessary on each paths of its neighbor node, transmit Eki?.
(5.4) data after segmentation are arrived along the multi-path transmission of each sensing neighbor node with minimum hop routing algorithm
Sink node；
(5.4.1) nodes represents to the jumping figure h of Sink node, and time initial, Sink node s arranges hs=0, its
Its node arranges h=∞；
(5.4.2) Sink node is broadcasted with hsThe Route establishment information of=0, after neighbor node j receives information, is arrived
The jumping figure h of Sink nodejChange h intou=hj+ 1=1, and broadcast with hj=1 information；
(5.4.3) when in network arbitrary node v receive node j broadcast with hiRoute establishment information after, do as follows
Process: 1) if hv＜ hj+ 1, do not make any process；2) if hv=hj+ 1, node j is added in routing table；3) if hv＞ hj+ 1,
Empty existing routing table, node j is added in routing table, update hv=hj+ 1, and broadcast with hvRoute establishment letter
Breath；
(5.4.4) update Route establishment information along said process, finally can set up route based on minimum hop count.
(5.5) first the data after segmentation are merged by the data after sink node receives segmentation.Compiled by network again
Code carries out data decoding and recovers initial data, the data that i.e. source node is to be sent.
(5.5.1) data E after sink node receives segmentationkiAfter, utilize Chinese remainder theorem by data E of segmentationki
Merge, data E before being splitk。EkComputational methods be:Coefficient c thereinki=
Qkiqki,Make cki=1 (mod pki)；
(5.5.2) data E before being splitkAfter, it is assumed that the m data that node receives is respectively E1, E2..., Em,
Determine whether corresponding m coefficient vector α1, α2... αkWhether linear independence, if it is, carry out data by coding
Decoding:
Just data convert is become initial data B by above-mentioned decoding1, B2..., Bm。
The effect of the present invention can be further described by following emulation:
Simulated conditions
In the plane domain of L × L, shed N number of wireless sensor node at random so that network node is evenly distributed on prison
In survey region, Sink node is positioned at edge, monitored area, is responsible for accepting gather data and data are carried out relevant treatment.Assume
Data transmission procedure does not carry out data fusion, supposes that whole network has the ideal combining time division multiple acess TDMA technology simultaneously
Medium access control MAC protocol.
Other simulation parameters are as shown in table 1:
Table 1
| Region (m2) | 100×100 |
| Interstitial content | 100 |
| Sink position | (0,0) |
| Primary power (J) | 2 |
| Maximum communication radius (m) | 25 |
| Data package size (bits) | [10,80] |
Emulation content
Emulation 1, in conjunction with above-mentioned parameter, generates network units pie chart UDG and Gabriel figure topology, as it is shown on figure 3, its
Middle Fig. 3 (a) is network units pie chart UDG, and Fig. 3 (b) is network G abriel figure topology.Comparison from Fig. 3 (a) Yu Fig. 3 (b)
It can be seen that Gabriel figure topology ensure that the connectedness of whole network, simultaneously compared with UDG, each nodes neighbors interstitial content
Reduce, inter-node communication interference can be reduced.
Emulation 2, in conjunction with above-mentioned simulated conditions, is respectively adopted and is born in theorem and the transmission of network uniform enconding based on grandson
Scheme compares according to two kinds of communication plans of transmission with only with minimum hop count, analyzes consolidated network lower node Energy Expenditure Levels
And packet transmission situation, result is as Figure 4-Figure 6.
In the diagram, we assess two kinds of communication mode node ceiling capacities by ceiling capacity consumption reduction factor M ERF
Expenditure Levels, whereinW represents big according to the packet transmitted only with minimum hop count
Little, wCRTRepresent the size using grandson to be born in the transmitted packet of theorem.Send at random under random 100 different structures
The packet of [10,80] bits size, and the result of 100 times is ranked up.Figure 4, it is seen that compared to only taking
Minimum jump set is defeated, uses Chinese remainder theorem and coded system to transmit each node and can at least save the energy of about 45%
Amount.In Figure 5, data package size situation pair is sent when giving employing Chinese remainder theorem and do not take Chinese remainder theorem
Ratio.From figure 5 it can be seen that employing Chinese remainder theorem can be by the data compression of [10,80] bits to [10,20] bits.
Reduce the energy consumption that individual node transmission larger data bag is caused, equalized offered load, avoided net to a certain extent
Network is congested.In figure 6, when giving the unreliable communication link of consideration, it is provided without network code and uses network code data
The reliability contrast of transmission.Assume that node acquiescence sends 3 packets, when using uniform enconding, data encoding can be sent 5
Packet.From fig. 6 it can be seen that use the data transmission credibility of uniform enconding to be far longer than be provided without uniform enconding
Data transmission credibility.
Symbol description: WSNs:Wireless Sensor Networks wireless sensor network
I: sensor node
J: the neighbor node of sensor node i
S: send the source node of data
W: do not take to send data package size during Chinese remainder theorem
wCRT: take to send data package size during Chinese remainder theorem
The neighbor node collection of N (i): node i
| N (i) |: node i neighbor node collection number
MERF:Max Energy Reduction Factor ceiling capacity reduces the factor
UDG:Unit Disk Graph unit circle figure
GG:Gabriel Graph Gabriel schemes
MAC:Media Access Control medium access control
TDMA:Time Division Multiple Access time division multiple acess
The above, the only present invention preferably detailed description of the invention, protection scope of the present invention is not limited to this, any ripe
Know those skilled in the art in the technical scope of present disclosure, the letter of the technical scheme that can become apparent to
Altered or equivalence are replaced and are each fallen within protection scope of the present invention.
Claims (2)
1. a wireless sensor network data method for reliable transmission based on Chinese remainder theorem, it is characterised in that include as
Lower step:
(1) in the plane domain of L × L, shedding N number of wireless sensor node at random, Sink node is positioned at edge, monitored area,
It is responsible for accepting gather data and data are carried out relevant treatment；
(2) in wireless sensor network WSNs sensor node with maximum transmission power broadcast position information, and record neighbours joint
The information of point, forms the unit circle figure UDG of network；
(3) according to unit circle figure UDG, utilize Gabriel figure construction algorithm, form network topology based on Gabriel figure knot
Structure；
(4) according to the topological structure of Gabriel figure, data communication topological structure is formed；
(4a) node i calculates the distance with each neighbor node under Gabriel figure respectively, finds out ultimate range therein, and adjusts
Self transmitting power whole, adjusts its communication radius consistent with ultimate range, reduces Communication Jamming；
(4b) node i sends query messages metadata information after adjusting radius under new communication radius, finds out asymmetric chain
The neighbor node on road, thus obtain neighbor node collection N (i) of symmetric links；
(4c) repeat (4a), (4b), until all node i are obtained for neighbor node collection N (i) in whole network, form network
Data communication topology；
(5) in the data communication topology built, the node sending data is needed to be completed by packet after respective handling with minimum
Jumping figure routing algorithm is delivered to sink node；
(5a) node i sending data is needed to first look for the number of neighbor node in neighbor node collection N (i) of self | N (i)
|；
(5b) if the number of neighbor node collection is 1, data are left intact and pass data to unique neighbour by node i
Occupy node j, node j and search the number of neighbor node collection N (j) of self | N (j) |；
(5c) if the number of neighbor node collection is more than or equal to 2, packet is first passed through uniform enconding and encodes the data to
The data of many parts of linear independences, carry out data segmentation, the number of data segmentation the most again to each data acquisition Chinese remainder theorem
Mesh is identical with the number of the neighbor node collection of node i；
(5c1) when number | the N (j) | of neighbor node collection of node j is more than or equal to 2, search in its neighbor node collection N (j)
Whether comprising sink node, if sink node belongs to its neighbor node collection, then directly selecting sink node is next-hop node,
And packet is left intact；Otherwise, step (5c2) is performed；
(5c2) assume that source node S needs the m data bag sent to be B1, B2..., Bm, then source node S is from finite field FqIn random
Choose coding vectorBy the m data bag B of source node1, B2..., BmIt is encoded into n packet E1,
E2..., En, n >=m:
So by using uniform enconding, just by m data bag B to be sent for source node S1, B2..., BmBe converted to E1,
E1..., En；
(5c3) data E after transmission codingkWhen, in the prime number p that intra-node definition is intrinsicki, the wherein number of prime number
Identical with the number of its neighbor node, to any given integer set { Ek1, Ek2..., EkN, the integer of existence anduniquessMake Ek=Eki(mod pki), in one data E of transmissionkTime, it is only necessary at each paths of its neighbor node
Upper transmission Eki；
(5d) data after segmentation are delivered to sink node with minimum hop routing algorithm；
(5e) first the data after segmentation are merged, then are entered by network code by the data after sink node receives segmentation
The decoding of row data recovers initial data, the data that i.e. source node is to be sent；
(5e1) data E after sink node receives segmentationkiAfter, utilize Chinese remainder theorem by data E of segmentationkiClose
And, data E before being splitk, EkComputational methods be:Coefficient c thereinki=Qkiqki,Make cki=1 (mod pki)；
(5e2) data E before being splitkAfter, it is assumed that the m data that node receives is respectively E1, E2... Em, sentence further
Disconnected corresponding m coefficient vector α1, α2... αkWhether linear independence, if it is, data are decoded by coding:
Just data convert is become initial data B by above-mentioned decoding1, B2..., Bm；
(5f) in other times section, if network there being other sensor nodes u need to send its packet gathering data,
Repeating (5a)-(5e) just makes sink node receive the data that source node sends.
Wireless sensor network data method for reliable transmission based on Chinese remainder theorem the most according to claim 1, step
Suddenly described in (3) according to unit circle figure UDG, utilize Gabriel figure building method, form the Gabriel figure topology of network,
Carry out as follows:
(3a) node i is according to oneself and the positional information of neighbor node j, the center of circle of the calculating circle with both i and j line as diameter
Position and radius；
(3b) node i calculates the above-mentioned center of circle distance to other neighbor nodes, and judges whether this distance is less than above-mentioned radius, as
Fruit is deleted less than then being concentrated from neighbor node by this node；
(3c) repeating step (3a)-(3b), until all neighbor node j are operated by node i, thus it is adjacent to complete this node
Occupy the renewal of node；
(3d) step (3c) is repeated, until all node k in whole wireless sensor network have carried out above-mentioned operation, this
Just complete the Gabriel topology constructing of whole network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310471587.XA CN103532667B (en) | 2013-09-30 | 2013-09-30 | Wireless sensor network data method for reliable transmission based on Chinese remainder theorem |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310471587.XA CN103532667B (en) | 2013-09-30 | 2013-09-30 | Wireless sensor network data method for reliable transmission based on Chinese remainder theorem |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103532667A CN103532667A (en) | 2014-01-22 |
| CN103532667B true CN103532667B (en) | 2016-10-05 |
Family
ID=49934384
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310471587.XA Expired - Fee Related CN103532667B (en) | 2013-09-30 | 2013-09-30 | Wireless sensor network data method for reliable transmission based on Chinese remainder theorem |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103532667B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106060886B (en) * | 2016-05-20 | 2019-08-30 | 河海大学常州校区 | A kind of water sound sensor network Routing Protocol construction method based on asymmetric link |
| CN107333316B (en) * | 2017-08-24 | 2020-08-07 | 国网安徽省电力公司黄山供电公司 | Fault-tolerant topology construction method for wireless sensor network |
| CN110191480B (en) * | 2019-04-24 | 2022-05-06 | 浙江树人学院（浙江树人大学） | Three-dimensional wireless sensor network data collection method with mobile Sink nodes |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101951347A (en) * | 2010-11-01 | 2011-01-19 | 武汉大学 | Overlay network redundancy irrelevant multicast tree rearrangement routing method in group communication |
| CN102630086A (en) * | 2012-04-29 | 2012-08-08 | 西安电子科技大学 | Gabriel graph-based data communication method of wireless sensor network |
| CN102917313A (en) * | 2012-10-17 | 2013-02-06 | 重庆邮电大学 | Method suitable for broadcast authentication of wireless sensor network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2013057536A1 (en) * | 2011-10-17 | 2013-04-25 | Renesas Mobile Corporation | Mechanism for controlling mobility in network sharing environment |
-
2013
- 2013-09-30 CN CN201310471587.XA patent/CN103532667B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101951347A (en) * | 2010-11-01 | 2011-01-19 | 武汉大学 | Overlay network redundancy irrelevant multicast tree rearrangement routing method in group communication |
| CN102630086A (en) * | 2012-04-29 | 2012-08-08 | 西安电子科技大学 | Gabriel graph-based data communication method of wireless sensor network |
| CN102917313A (en) * | 2012-10-17 | 2013-02-06 | 重庆邮电大学 | Method suitable for broadcast authentication of wireless sensor network |
Non-Patent Citations (1)
| Title |
|---|
| 《基于网络编码的无线传感器网络数据可靠性分析》;郝静等;《计算机应用研究》;20101130;第27卷(第11期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103532667A (en) | 2014-01-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Khan et al. | Fuzzy-TOPSIS based cluster head selection in mobile wireless sensor networks | |
| CN108882258B (en) | Wireless sensor network-oriented neighbor rotation hierarchical clustering method | |
| Bouyer et al. | A new approach for decreasing energy in wireless sensor networks with hybrid LEACH protocol and fuzzy C-means algorithm | |
| Tian et al. | Reliable and energy-efficient data forwarding in industrial wireless sensor networks | |
| Zhang et al. | Performance analysis of cluster-based and tree-based routing protocols for wireless sensor networks | |
| CN104093180B (en) | Wireless sensing network route method based on multi-gateway data transmisison | |
| CN102497679B (en) | Static clustering algorithm for wireless sensor network | |
| CN107360612B (en) | A kind of data transmission method of the wireless sensor network based on ant colony multipath | |
| CN101198167B (en) | Hybrid network system combining cell network and self-organizing network, and constructing method thereof | |
| CN108112048A (en) | Recognize a kind of efficiency route protocol based on stability in sensor network | |
| Kanakala et al. | Energy-efficient cluster based routing protocol in mobile ad hoc networks using network coding | |
| CN106028398A (en) | Underwater wireless sensor network topology control method based on energy consumption balance | |
| CN107404745A (en) | A kind of fire detector remote detecting system based on MANET | |
| CN101594379A (en) | Energy efficiency opportunity routing protocol in a kind of wireless sensor network | |
| CN105764114A (en) | Underwater wireless sensor network topology control method based on balanced energy consumption | |
| CN106992842A (en) | Polynary numeric field data restoration methods based on network code and compressed sensing | |
| CN103532667B (en) | Wireless sensor network data method for reliable transmission based on Chinese remainder theorem | |
| CN102238683A (en) | Routing information acquisition and transmission method for wireless mesh network | |
| CN102630086B (en) | Gabriel graph-based data communication method of wireless sensor network | |
| Atero et al. | A low energy and adaptive architecture for efficient routing and robust mobility management in wireless sensor networks | |
| CN101800629B (en) | Network coding method of code efficiency perception | |
| CN103067873A (en) | Energy-saving multicast scheme for wireless sensor network (WSN) provided with rechargeable nodes and multiple sink nodes | |
| Zhang et al. | A hybrid transmission based data collection scheme with delay and reliability guaranteed for lossy WSNs | |
| Fotue et al. | Controlled data collection of mini-sinks for maximizing packet delivery ratio and throughput using multiple paths in wireless sensor networks | |
| Chen et al. | An improved inter-cluster multi-hop LEACH protocol oriented reliable transmission in WSNs |
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 | ||
| DD01 | Delivery of document by public notice | ||
| DD01 | Delivery of document by public notice |
Addressee: Patent of Xi'an University of Electronic Science and technology The person in charge Document name: Notice of patent termination |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20161005 Termination date: 20210930 |