CN101232516A - Method for updating low-power dissipation system compressed by difference in wireless sensor network application - Google Patents
Method for updating low-power dissipation system compressed by difference in wireless sensor network application Download PDFInfo
- Publication number
- CN101232516A CN101232516A CNA2008100572984A CN200810057298A CN101232516A CN 101232516 A CN101232516 A CN 101232516A CN A2008100572984 A CNA2008100572984 A CN A2008100572984A CN 200810057298 A CN200810057298 A CN 200810057298A CN 101232516 A CN101232516 A CN 101232516A
- Authority
- CN
- China
- Prior art keywords
- difference
- code file
- page
- node
- eap
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- Y02B60/50—
Abstract
An updating method for low power dissipation systems is disclosed, which uses differential compression in the application of wireless sensor network. The method includes the following steps: (1) dividing an old code file and a new code file into a plurality of pages which are bytes of a section of continuous addresses; (2) comparing the old code file with the new code file to generate a differential code file; (3) transmitting the differential code file to an updated node from the publishing node in a multi-hop communication way; (4) the updated node re-generates a new code file according to the differential code file and the old code file to complete the updating. The method has advantages of good generality, short update delay, less data transmission, high energy consumption efficiency and perfect reliability.
Description
Technical field
The invention belongs to the wireless sensor network field, use the method for updating low-power dissipation system of difference compression during a kind of specifically wireless sensor network is used.
Background technology
Wireless sensor network (Wireless Sensor Networks is hereinafter to be referred as WSN) is a kind of novel calculating and the communication technology.WSN combines sensor technology, embedded computing technique, distributed information processing and the communication technology, in order to the various environment in monitoring in real time collaboratively, perception and the collection network distributed areas or the information of monitoring target.
WSN uses need dispose a large amount of unattended sensor nodes in the monitored area usually.This node deployment mode has brought problem for the renewal of application system: when debugging routine or application demand change, it is a kind of worthless mode that great deal of nodes is fetched again burned new application program.Therefore, the researcher has proposed the notion of online updating, promptly issues new run time version by wireless mode at whole network.
Online updating mainly contains four indexs: (1) run time version must be transferred in the network all more new nodes reliably; (2) possess higher energy consumption efficiency as far as possible, can not seriously shorten the life cycle of network; (3) reduce the demand of memory capacity as far as possible; (4) reduce the required time delay of renewal as far as possible.Wherein the 1st index all must satisfy for any online updating method, because the transmission content is a run time version, any mistake all can cause the program running failure or move with wrong way, thus the enforcement that influence is used.The importance of the 2nd index is only second to the 1st index, and it requires update method can not consume the energy of node excessively and influence network life cycle, this during to renewal data quantity transmitted and transmission means certain requirement has been proposed.When then being the design of online updating method, the 3rd and the 4th index take into account two indexs of consideration.
At present, the conventional online update method all is that whole run time version is all transmitted in the multi-hop communication mode in network, and the memory requirement that this increases node has also influenced network life cycle significantly and wasted big energy.Because code file generally all is the rank of 10KB, and node energy consumption is mainly derived from the transmission and the reception of radio-frequency module.In addition, also there is the researcher to propose the virtual machine pattern.This pattern requires virtual machine platform of node operation, and in order to receive and to carry out fresh code, though this method has been simplified step of updating, calculating and the memory requirement to node proposed high request simultaneously.This deviates from mutually with the design object of sensor node, because node all is to adopt embedded or MEMS technology on hardware designs, requires low cost and low-power consumption, and calculating and storage capacity are all very limited.
Summary of the invention
The objective of the invention is: the run time version replacement problem that overcomes existing wireless sensor network application system, the method for updating low-power dissipation system that uses the difference compression in a kind of wireless sensor network application is provided, transmission energy consumption and propagation delay time have been reduced effectively, guarantee transmission and reliability of updating, can adapt to the demand of major applications system update well.
Technical scheme of the present invention: use the method for updating low-power dissipation system of difference compression during wireless sensor network is used, comprise following four steps:
(1) old code file and fresh code file are divided into a plurality of pages;
(2) according to the old code file and a plurality of pages of fresh code file divided in the step (1), older code file and fresh code file generate the differential code file;
(3) described differential code file is transferred to more new node with communication mode from publisher node;
(4) described more new node regenerates the fresh code file according to differential code file and old code file, finishes renewal.
Principle of the present invention: the new and old run time version file before and after the present invention at first will upgrade is divided into a plurality of pages with same page-size, the difference that compares each content of pages, adopt compressed encoding and eap-message digest technology to generate difference table compressed code and difference page table, and combination differential code file, follow this differential code file distribution in whole network.The present invention is in issue and broadcast in the process of differential code file step by step, is according to node number of degrees re-send request may selectively for the processing method of the lost packets or the page.Last each more new node after receiving the differential code file, by decompress(ion) with explain that this document regenerates difference table and difference page table, generate final new run time version file in conjunction with self code combination again, and burned Flash or EEPROM finish renewal.
The present invention's beneficial effect compared with prior art is:
(1) the present invention is divided into a plurality of pages with old code file and fresh code file, older then code file and fresh code file generate the differential code file, the differential code file is transferred to more new node with communication mode from publisher node, more new node regenerates the fresh code file according to differential code file and old code file, finish renewal, reduce the transmission of duplicated code so significantly and upgraded time delay, prolonged network life cycle, guarantee transmission and upgraded reliability, can adapt to the demand of major applications system update well.
(2) in addition, the use of eap-message digest.The present invention has used eap-message digest at two places.The first, when searching the skew page of the fresh code file page, accelerated matching speed; The second, in code issue and transmission course, use eap-message digest to carry out verification and further guaranteed reliability of updating.
(3) in addition, the introducing of the node number of degrees and request threshold value.The first, the introducing of the node number of degrees has avoided being in the unnecessary broadcasting of node execution at network design edge.The second, when certain upgrades node detection to during the not complete complete packet of receiving every data, can wait for the broadcasting once more of its neighbor node according to the request threshold value, avoid unnecessary data request and repeating transmission, reduced channel occupancy conflict and transmitted data amount, also further reduced the transmission energy consumption.
Advantages such as in a word, it is good that the present invention has versatility, and it is short to upgrade time delay, and transmitted data amount is few, and energy consumption efficiency is high and reliable fully.
Description of drawings
Fig. 1 is the schematic diagram of the inventive method;
Fig. 2 is the new and old code file figure behind the paging of the present invention, the old code file of a wherein, and b is the fresh code file;
Fig. 3 is the generative process of differential code file of the present invention;
Fig. 4 is the form of eap-message digest table of the present invention, difference table, difference page table and differential code file, and wherein a is the eap-message digest table, and b is a difference table, and c is a difference page table form, and d is the differential code file format;
Fig. 5 is the eap-message digest table that new and old code file of the present invention generates, and wherein a is old code file eap-message digest table, and b is a fresh code file message digest table;
Fig. 6 is the product process figure of first difference table of the present invention;
Fig. 7 is the difference table of first generation of the present invention;
Fig. 8 is the aftertreatment flow chart of difference table of the present invention;
Fig. 9 is the difference table after the aftertreatment of the present invention, and wherein a is for calculating skew page or leaf back difference table, and b is the difference page table;
Figure 10 is network topology of the present invention, the node number of degrees and request threshold value example, and wherein a is a network topology, and b is the node number of degrees and request threshold value;
Figure 11 is a Data Update transmission packet format of the present invention.
Embodiment
The present invention is the method for updating low-power dissipation system that uses the difference compression during a kind of wireless sensor network is used.As shown in Figure 1, technical scheme of the present invention is for mainly being divided into three steps:
1. old code file and fresh code file are divided into a plurality of pages.
If old code file size is S
oByte, its number of pages P
oComputation rule is: with S
oDividing exactly with L, is zero as if remainder, then P
oEqual divisor, otherwise P
oEqual divisor and add 1; M page or leaf content symbol p wherein
o(m) expression.In like manner establishing the fresh code file size is S
nByte, its number of pages are P
n, m page or leaf content symbol p wherein
n(m) expression.
Shown in Fig. 2 a and 2b, old code file size is the 12K byte, and the fresh code file is the 16K byte, and page capacity is the 2K byte, and new and old code file is divided into 6 and 8 pages respectively.Wherein arrow represents that the page of fresh code file is identical with the content of pages of arrow indication in the old code file.
2. older code file and fresh code file generate the differential code file.This flow chart of steps as shown in Figure 3, the further detailed step of this step is as follows:
(1) foundation and three tables of initialization: eap-message digest table, difference table and difference page table.The eap-message digest table is used for the eap-message digest table of each page of file; Difference table is used for the mark fresh code file and the different page of old code file content; The difference page table then is used to store the fresh code file and the different page of old code file content.
Eap-message digest table, difference table and difference page table form are shown in Fig. 4 a, b, c.
(2) use the MD5 algorithm computation to generate the eap-message digest of fresh code file and old each content of pages of code file, detailed process is described below:
For each page, handle the page byte content of input earlier by 512 groupings, each grouping is divided into 16 32 seat groupings again.The output of algorithm will be formed by 4 32, and their cascades are formed 128 hashed values.
The algorithm fine division step is as follows:
The first step increases filler in former message, purpose is to make former message-length equal a value, promptly lacks 64 than 512 multiple.Filler uses one 1 and a plurality of 0, and filling always increases, and filling length is the value of 1-512.
In second step, add length.After having increased filler, and then to calculate the former length of message, and it is added message end after the filling.For example, former message is 1000, then fills 472, makes its multiple (1536) that becomes than 512 lack 64, and length value 1000 is appended to the art tail (representing with 64 bits) of message.
The 3rd goes on foot, and input is divided into 512 piece.
The 4th step, the initialization link variable.4 link variables are called A, B, C, D, and its initialization value is: A=0 * 01234567, B=0 * 89abcdef, C=0 * fedcba98, D=0 * 76543210.
The 5th step, processing block.Message is divided into N 512 grouping: M (1), M (2) ... M (N).Following processing is done in above-mentioned N 512 groupings:
1. 4 initializing variable A, B, C, D are copied to respectively among variable a, b, c, the d.
2. each 512 message grouping is divided into 16 32 seat groupings.
3. above-mentioned grouping is carried out 4 and take turns, whenever take turns 16 operations, totally 64 operations.Each operation is done a nonlinear function computing to 3 among a, b, c, the d, then the gained result is added the 4th variable, a grouping and a constant T.Again the gained result is circulated to the right and move an indefinite number, and one of add among a, b, c, the d.
4. A, B, C, D are added a, b, c, d respectively, be used for next 512 grouped datas then.
The output that last MD5 algorithm generation is 128 is the cascade of A, B, C, D.
The eap-message digest table that hypothesis generates in the present embodiment as shown in Figure 5, wherein a is old code file eap-message digest table, b is a fresh code file message digest table.
(3) page of fresh code file and old code file relatively in order, whether matched record is in the difference table Fig. 4 b of institute for the general, and the flow chart of this step is as shown in Figure 6.Tentatively generate difference table as shown in Figure 6 according to flow process in the present embodiment.P wherein
o(1) ~ p
o(4) and p
n(1) ~ p
n(4) identical, corresponding preceding 4 are labeled as 0,0 expression coupling and can make run-length encoding efficient higher in the difference table; p
o(5) ~ p
o(8) and p
n(5) ~ p
n(8) inequality, corresponding back 4 are labeled as-1 in difference table.
(4) be labeled as unmatched list item in the processed in sequence difference table, upgrade difference table, and generate the difference page table.The flow chart of this step wherein detects p as shown in Figure 8
n(5) and p
o(6) content unanimity, the matched indicia that then upgrades the 5th of difference table is 6, in like manner the 8th matched indicia is updated to 5.Difference page table content after disposing is shown in Fig. 9 b.
(5) adopt run-length encoding difference table compressed code, generate the difference table compressed code.According to the run-length encoding principle, the difference table compressed code that generates in the present embodiment is: 0451-1261.Should be understood that the run-length encoding efficient of showing in the present embodiment is general, but in the middle of the practical application as new and old code file when existing a large amount of content of pages identical, the efficient of run-length encoding will be very high.
(6) the eap-message digest generative process of similar new and old each page of code file, use the MD5 algorithm to calculate eap-message digest as difference table compressed code and difference page table, the eap-message digest and the difference page with the eap-message digest of difference table compressed code, difference table compressed code, difference page table is combined into the differential code file in order at last, and the differential code file format is shown in Fig. 3 d.
3. the differential code file is transferred to more new node in the reliable communication mode from publisher node.Network topology is shown in Figure 10 a, wherein aggregation node (is the Sink node, the connected node of wireless sensor network and external network, be equivalent to gateway) starting point upgraded for system code, be the eap-message digest table of code file, main calculating such as difference table and difference page table all finished by the Sink node.This step fine division step further is as follows:
(1) calculate all nodes the number of degrees and the request threshold value.
The node number of degrees are one hop neighbor number.The function that the calculating of the node number of degrees can be called media control layer to be provided is finished.The request threshold value is the mean value of all node number of degrees in the network.Shown in Figure 10 a, show among the figure that the neighbor node of node 1 is node 7 and node 2, then node 1 has 2 neighbor nodes, and promptly the node number of degrees are 2; In like manner can calculate node 2,3,4,5,6,7 and 8 the node number of degrees are respectively 5,4, and 1,2,3,3 and 3.At this moment, the request threshold value that can calculate the present networks topology according to the definition of request threshold value is
, shown in Figure 10 b.
(2) each node enters update mode to aggregation node (be the Sink node, the connected node of wireless sensor network and external network is equivalent to gateway) to whole Web broadcast system update message.
(3) eap-message digest with difference table compressed code and difference page table is transferred to each more new node.This step is as follows in the present embodiment:
At first aggregation node (is the Sink node, the connected node of wireless sensor network and external network, being equivalent to gateway) eap-message digest of difference table compressed code and difference page table is split into a plurality of groupings, and (packet format is as shown in figure 11, the mark that wherein divides into groups is assumed to: the 0x00-eap-message digest, 0x01-difference table compressed code, 0x02-difference page table), broadcast these groupings then.Node 3 becomes publisher node after receiving packet memory, to its neighbors 2,4,5 broadcasts packet data.When node 4 finds that self number of degrees is 1, broadcast data no longer, and node 2,5 number of degrees can be followed broadcast data greater than 1.Find to fail correct when receiving grouping as the neighbors 6 of node 5, judge self number of degrees greater than the request threshold value, requesting node 5 packet retransmission immediately not then, but set a waiting-timeout time select to wait for the grouped data of self other neighbor node.So posterior nodal point 6 can be received the grouping of node 2 broadcasting at waiting-timeout in the time, and the transfer of data and the energy consumption thereof of then having saved request repeat are as wait timeout, then again to node 5 request repeats.So broadcast and re-send request may, all correctly receive the eap-message digest of difference table compressed code and difference page table until all nodes.
(4) difference table compressed code and difference page table are transferred to all nodes to be updated.The similar step of the transmission course of this step (3), but after receiving all groupings, must carry out verification to difference table compressed code and the difference page table of receiving to paid-in eap-message digest, to guarantee that last code is without any mistake.
4. more new node regenerates fresh code according to differential code and old code, finishes renewal.This step process is as follows:
At first from the differential code file, read out the difference table compressed code, carry out the difference table of decompress(ion) generation shown in Fig. 9 a, handle the difference list item then one by one, if this list item matched indicia is-1, just the difference page table from the differential code file reads a page according to the order of sequence, otherwise just searches the corresponding page from the old code file of self, handles and has also generated the fresh code file behind all difference list items simultaneously, burned it at last to Flash or EEPROM, finish renewal.
Upgrade the purpose of wireless senser application system in order to reach low-power consumption, code contact structurally before and after the present invention has analyzed and upgraded, the difference compression of employing has reduced volume of transmitted data, and it is good to have versatility, advantages such as the renewal time delay is short, and energy consumption efficiency is high and reliable fully.
The above only is a preferred implementation of the present invention; should be pointed out that for those skilled in the art, under the prerequisite that does not break away from the principle of the invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (8)
1. use the method for updating low-power dissipation system of difference compression during wireless sensor network is used, it is characterized in that may further comprise the steps:
(1) old code file and fresh code file are divided into a plurality of pages, the described page is one section byte in the continuation address;
(2) according to the old code file and a plurality of pages of fresh code file divided in the step (1), older code file and fresh code file generate the differential code file;
(3) described differential code file is transferred to more new node with communication mode from publisher node;
(4) described more new node regenerates the fresh code file according to differential code file and old code file, finishes renewal.
2. use the method for updating low-power dissipation system of difference compression during wireless sensor network according to claim 1 is used, it is characterized in that: provide in the described step (1) and be defined as follows:
Page capacity: the byte quantity that the page comprised, L represents with symbol, page capacity must be the multiple of processor word size;
Described step (1) process is as follows:
If old code file size is S
oByte, its number of pages P
oComputation rule is: with S
oDividing exactly with L, is zero as if remainder, then P
oEqual divisor, otherwise P
oEqual divisor and add 1; M page or leaf content symbol p wherein
o(m) expression; If the fresh code file size is S
nByte, its number of pages are P
n, m page or leaf content symbol p wherein
n(m) expression.
3. use the method for updating low-power dissipation system of difference compression during wireless sensor network according to claim 1 is used, it is characterized in that: the generation of differential code file is further divided into step in the described step (2):
(2.1) foundation and three tables of initialization: eap-message digest table, difference table and difference page table, wherein the eap-message digest table is used for the eap-message digest table of each page of file, difference table is used for the mark fresh code file and the different page of old code file content, and the difference page table then is used to store the fresh code file and the different page of old code file;
(2.2) use the MD5 algorithm computation to generate the eap-message digest of fresh code file and old each content of pages of code file;
(2.3) page of fresh code file and old code file relatively in order, whether matched record is in difference table for the general;
(2.4) be labeled as unmatched list item in the processed in sequence difference table, upgrade difference table, and generate the difference page table;
(2.5) adopt run-length encoding difference table compressed code, generate the difference table compressed code;
(2.6) use the MD5 algorithm to be that difference table compressed code and difference page table calculate eap-message digest, the eap-message digest and the difference page with the eap-message digest of difference table compressed code, difference table compressed code, difference page table is combined into the differential code file in order at last.
4. use the method for updating low-power dissipation system of difference compression during wireless sensor network according to claim 2 is used, it is characterized in that: described step (2.4) is further divided into step:
(2.3.1) if p
n(m) and p
o(m) difference then has the eap-message digest and the p of which page in the scan both old code file
n(m) identical;
(2.3.2) if p
o(i) and p
n(m) the identical comparison that then further word for word saves land of eap-message digest as identical, then claims p
o(i) be p
n(m) the skew page, and page number i is recorded in the difference table, otherwise turn to step (2.3.3);
(2.3.3) with p
n(m) content is appended in the difference page table.
5. use the method for updating low-power dissipation system of difference compression during wireless sensor network according to claim 1 is used, it is characterized in that: further comprise following steps in the described step (3):
(3.1) calculate all nodes the number of degrees and the request threshold value, wherein the node number of degrees are a hop neighbor number of node; The request threshold value is the mean value of all node number of degrees in the network;
(3.2) to whole Web broadcast system update particular packet message, each node enters update mode;
(3.3) eap-message digest with difference table compressed code and difference page table is transferred to each more new node;
(3.4) difference table compressed code and difference page table are transferred to all nodes to be updated;
6. use the method for updating low-power dissipation system of difference compression during wireless sensor network according to claim 4 is used, it is characterized in that: the transmission means in the described step (3.3) is broken down as follows:
(3.3.1) publisher node is divided into a plurality of groupings according to the order of sequence with the eap-message digest of difference table compressed code and difference page table, and is broadcast to its neighbor node;
(3.3.2) each neighbor node receives grouping as required, judges then whether oneself receives all groupings;
(3.3.2.1), whether then judge the number of degrees,, be converted to all groupings that publisher node and broadcasting are received as greater than 1 greater than 1 if receive all groupings;
(3.3.2.2) if do not receive all groupings, judge that then whether self number of degrees is greater than the request threshold value, if greater than the request threshold value, then wait for; If less than the request threshold value, the then grouping of losing to the publisher node request repeat is till acknowledging receipt of all groupings;
(3.3.3) repeating step (3.3.1) and (3.3.2) till all nodes are all correctly received the eap-message digest of difference table compressed code and difference page table.
7. use the method for updating low-power dissipation system of difference compression during wireless sensor network according to claim 4 is used, it is characterized in that: the transmission means in the described step (3.4) is broken down as follows:
(3.4.1) publisher node is divided into a plurality of groupings according to the order of sequence with difference table compressed code and difference page table, and is broadcast to its neighbor node;
(3.4.2) each neighbor node receives grouping as required, judges then whether oneself receives all groupings;
(3.4.2.1), whether then judge the number of degrees,, be converted to all groupings that publisher node and broadcasting are received as greater than 1 greater than 1 if receive all groupings;
(3.4.2.2) if do not receive all groupings, judge that then whether self number of degrees is greater than the request threshold value, if greater than the request threshold value, then wait for; If less than the request threshold value, the then grouping of losing to the publisher node request repeat is till acknowledging receipt of all groupings;
(3.4.3) repeating step (3.4.1) and (3.4.2) till all nodes are all correctly received the eap-message digest of difference table compressed code and difference page table;
(3.4.4) use the MD5 algorithm according to paid-in difference table compressed code eap-message digest and difference page table eap-message digest difference verification difference table compressed code and difference page table.
8. use the method for updating low-power dissipation system of difference compression during wireless sensor network according to claim 1 is used, it is characterized in that: be further divided into following steps in the described step (4):
(4.1) the difference table compressed code is carried out decompress(ion), generate complete difference table;
(4.2) check every record of difference table according to the order of sequence one by one, handle as follows: for being labeled as identical item, directly from the run time version of self, extract this page,, then from the difference page table, extract this page for being labeled as the different pages; So, finish renewal until generating complete new run time version file.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100572984A CN101232516B (en) | 2008-01-31 | 2008-01-31 | Method for updating low-power dissipation system compressed by difference in wireless sensor network application |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100572984A CN101232516B (en) | 2008-01-31 | 2008-01-31 | Method for updating low-power dissipation system compressed by difference in wireless sensor network application |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101232516A true CN101232516A (en) | 2008-07-30 |
| CN101232516B CN101232516B (en) | 2012-05-16 |
Family
ID=39898688
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008100572984A Expired - Fee Related CN101232516B (en) | 2008-01-31 | 2008-01-31 | Method for updating low-power dissipation system compressed by difference in wireless sensor network application |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101232516B (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100553377C (en) * | 2008-12-05 | 2009-10-21 | 清华大学 | A kind of compression determination method that is used for lowering power consumption of wireless sensor network |
| CN102638823A (en) * | 2011-02-12 | 2012-08-15 | 苏州达联信息科技有限公司 | Method for updating railway track monitoring sensor node concentrating firmware |
| CN103049543A (en) * | 2012-12-26 | 2013-04-17 | 福建天晴数码有限公司 | Method and tool for updating multi-branch configuration file |
| CN103324501A (en) * | 2013-05-28 | 2013-09-25 | 大连理工大学 | Efficient remote updating method for node software of wireless sensor network |
| CN103677869A (en) * | 2012-09-06 | 2014-03-26 | 中国科学院计算技术研究所 | Wireless sensor network node remote code updating system and method |
| CN104199661A (en) * | 2014-08-29 | 2014-12-10 | 苏州大学 | Wireless sensor network (WSN) reprogramming method for MC1321X |
| WO2015077940A1 (en) * | 2013-11-27 | 2015-06-04 | 华为技术有限公司 | Sink node routing method and node device |
| CN107992323A (en) * | 2017-12-27 | 2018-05-04 | 深圳市科陆电子科技股份有限公司 | A kind of concentrator upgrade method and system |
| CN109426521A (en) * | 2017-08-21 | 2019-03-05 | 深圳市中兴微电子技术有限公司 | A kind of wireless terminal edition upgrading system and method |
| CN114401248A (en) * | 2022-03-24 | 2022-04-26 | 中国电子科技集团公司第二十八研究所 | Rapid synchronization method for system recombination address book based on Beidou broadcast |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1499075A1 (en) * | 2003-07-14 | 2005-01-19 | Samsung Electronics Co., Ltd. | Route update protocol for a wireless sensor network |
| CN1929420A (en) * | 2006-09-22 | 2007-03-14 | 东南大学 | Wireless sensing unit network broadcast route method based on hops count |
-
2008
- 2008-01-31 CN CN2008100572984A patent/CN101232516B/en not_active Expired - Fee Related
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100553377C (en) * | 2008-12-05 | 2009-10-21 | 清华大学 | A kind of compression determination method that is used for lowering power consumption of wireless sensor network |
| CN102638823A (en) * | 2011-02-12 | 2012-08-15 | 苏州达联信息科技有限公司 | Method for updating railway track monitoring sensor node concentrating firmware |
| CN103677869B (en) * | 2012-09-06 | 2017-10-10 | 中国科学院计算技术研究所 | Wireless sensor network node remote-code-update system and method |
| CN103677869A (en) * | 2012-09-06 | 2014-03-26 | 中国科学院计算技术研究所 | Wireless sensor network node remote code updating system and method |
| CN103049543A (en) * | 2012-12-26 | 2013-04-17 | 福建天晴数码有限公司 | Method and tool for updating multi-branch configuration file |
| CN103324501B (en) * | 2013-05-28 | 2015-12-23 | 大连理工大学 | Wireless sensor network node software Efficient Remote update method |
| CN103324501A (en) * | 2013-05-28 | 2013-09-25 | 大连理工大学 | Efficient remote updating method for node software of wireless sensor network |
| WO2015077940A1 (en) * | 2013-11-27 | 2015-06-04 | 华为技术有限公司 | Sink node routing method and node device |
| CN104813640A (en) * | 2013-11-27 | 2015-07-29 | 华为技术有限公司 | Sink node routing method and node device |
| CN104813640B (en) * | 2013-11-27 | 2017-12-29 | 华为技术有限公司 | A kind of Sink node method for routing and node device |
| CN104199661A (en) * | 2014-08-29 | 2014-12-10 | 苏州大学 | Wireless sensor network (WSN) reprogramming method for MC1321X |
| CN104199661B (en) * | 2014-08-29 | 2017-06-16 | 苏州大学 | A kind of wireless sensor network WSN reprogramming methods towards MC1321X |
| CN109426521A (en) * | 2017-08-21 | 2019-03-05 | 深圳市中兴微电子技术有限公司 | A kind of wireless terminal edition upgrading system and method |
| CN107992323A (en) * | 2017-12-27 | 2018-05-04 | 深圳市科陆电子科技股份有限公司 | A kind of concentrator upgrade method and system |
| CN114401248A (en) * | 2022-03-24 | 2022-04-26 | 中国电子科技集团公司第二十八研究所 | Rapid synchronization method for system recombination address book based on Beidou broadcast |
| CN114401248B (en) * | 2022-03-24 | 2022-07-01 | 中国电子科技集团公司第二十八研究所 | Rapid synchronization method for system reorganization address book based on Beidou broadcast |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101232516B (en) | 2012-05-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101232516B (en) | Method for updating low-power dissipation system compressed by difference in wireless sensor network application | |
| CN100558062C (en) | The distribution type structuring method of virtual backbone network in the wireless sensor network | |
| CN101803203B (en) | Optimized data stream compression using data-dependent chunking | |
| CN104506619A (en) | Data backup and recovery method and device, and server | |
| CN103401795A (en) | Method for eliminating redundancy of transmission contents in content central network | |
| CN103677869A (en) | Wireless sensor network node remote code updating system and method | |
| Zhao et al. | Reliable IoT storage: Minimizing bandwidth use in storage without newcomer nodes | |
| CN105515997A (en) | BF_TCAM (Bloom Filter-Ternary Content Addressable Memory)-based high-efficiency range matching method for realizing zero range expansion | |
| US20230130074A1 (en) | Network transmission optimization device for graph-type blockchain and method thereof | |
| CN111865326A (en) | Data compression method, device, equipment and storage medium | |
| Gu et al. | DR-MDS: An energy-efficient coding scheme in D2D distributed storage network for the internet of things | |
| Hnaif et al. | A Fault-Handling Method for the Hamiltonian Cycle in the Hypercube Topology. | |
| CN105681425B (en) | Multinode restorative procedure and its system based on distributed memory system | |
| CN101282353A (en) | Method for implementing efficiency route protocol for wireless sensor network based on cost function | |
| Biswas et al. | Mobility based checkpointing and trust based recovery in MANET | |
| Mo et al. | An efficient differencing algorithm based on suffix array for reprogramming wireless sensor networks | |
| Wang et al. | Toward performant and energy-efficient queries in three-tier wireless sensor networks | |
| CN106302641A (en) | A kind of methods, devices and systems of upper transmitting file | |
| Wang et al. | Reaching agreement among virtual subnets in hybrid failure mode | |
| CN104200246A (en) | Grouping N fork tracking tree RFID (radio frequency identification) anti-collision algorithm | |
| CN114745318A (en) | IPv6 dynamic Internet of things-oriented path recovery method | |
| CN103678695B (en) | A kind of method for parallel processing and device | |
| CN110831118B (en) | Method for generating Chirp signal of wake-up code with low power consumption and communication method | |
| Yang et al. | HHT-based security enhancement approach with low overhead for coding-based reprogramming protocols in wireless sensor networks | |
| CN103326731B (en) | A kind of Hidden Markov correlated source coded method encoded based on distributed arithmetic |
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: 20120516 Termination date: 20150131 |
|
| EXPY | Termination of patent right or utility model |