CN103096387A - Cognitive transmission method based on data prior classification in smart power girds - Google Patents
Cognitive transmission method based on data prior classification in smart power girds Download PDFInfo
- Publication number
- CN103096387A CN103096387A CN2011103357040A CN201110335704A CN103096387A CN 103096387 A CN103096387 A CN 103096387A CN 2011103357040 A CN2011103357040 A CN 2011103357040A CN 201110335704 A CN201110335704 A CN 201110335704A CN 103096387 A CN103096387 A CN 103096387A
- Authority
- CN
- China
- Prior art keywords
- data
- node
- transmission
- state
- channel
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a cognitive transmission method based on data prior classification in smart power girds. The cognitive transmission method based the on data prior classification in the smart power girds comprises the following steps: numbering each node in a wireless sensor network respectively and setting corresponding initial transmission grading information, initial node status information, initial transmission start time and initial transmission end time; producing data periodically within the working time according to the time t1 by the node and distributing generated data to data packages of different priority levels in sequence according to the data classification algorithm; determining the operation of a channel according to the node status; examining and confirming the current node with regards to the condition that the channel is occupied by the node with a priority level data and a low mark, and then conducting a conflict resolution. A new working period starts through sleeping time when the current period is over. The cognitive transmission method based on the data prior classification in the smart power girds can ensure that the node can gather the most important data so as to reach a root node in the shortest time delay under the condition of limited energy of the sensor node and under a poor working condition, so that realization becomes easy and efficiency is high.
Description
Technical field
What the present invention relates to is a kind of method of wireless communication technology field, specifically a kind of cognitive transmission method of wireless sensor network of based on data classification technique.
Background technology
Along with the development of intelligent grid technology, become more and more important for Real-Time Monitoring and the control of electric equipment.Because some equipment of electrical system are connected up, the characteristics of power supply, installation site or equipment itself limit, wired real-time inspection and control network is difficult to realize.The advantage of the real-time inspection and control network that this moment is wireless has just embodied out, and it does not need cable to connect.This means that each wireless sensor terminal only needs antenna just passable, the expense of having saved a large amount of cables.And wireless senser can be arranged in the place that needs more flexibly, can more close measuring object.
But wireless senser also has the place of some shortcomings.Owing to there is no cable, can't use Power supply, can only use powered battery.This consumption that just means energy is very sensitive for sensor network.In the research of sensor network, how saving energy is an important research point.In general, the wireless senser transmission policy of power saving, the delay of its communication is larger.Be that the speed transmitted in network of information and the energy consumption of wireless sensor network node are exchanges.Simultaneously, for the sensor network of Real-Time Monitoring, because the data class of monitoring is complicated, different data are that different significance levels is arranged.Different data are different for the sensitivity of time-delay in other words, and some data are more urgent, need to be transferred to as soon as possible receiving node, and some data are not too responsive to actual effect, allow larger transmission delay.On the other hand, the effect of diagnosing for intelligent grid especially remote error due to sensor network is the operation conditions of monitoring equipment, the data that they are collected at most of time are all more normal data in fact, from the angle of whole network in fact the information collected of transducer very large redundancy is arranged.If the data of these redundancies all are sent to receiving node, in fact just waste the energy of transducer.And the data of redundancy are those unessential data often, and they are to postponing not have very high requirement.
Summary of the invention
In the process of transfer of data, if can be by the redundancy of cognitive data, the significance level of detection data, carry out cognitive transmission, both can reduce the data volume of transmission, can not increasing under the prerequisite of energy saving even, increase the transmission speed of important information again.
The present invention is achieved by the following technical solutions, the present invention includes following steps:
The first step is given respectively each node serial number in wireless sensor network and the corresponding initial transmission class information of each node, start node state information, initial transmission time started and initial transmission concluding time is set.
Described initial transmission grade is: the data waiting for transmission such as default setting is initial are from the storehouse of limit priority.
The described transmission time started, be: the work at present time.
Described transmission end time is: the work at present time.
Second step, node are take time T as the cycle, and the operating time is t in cycle T, is set to (T-t) length of one's sleep.Each node periodically produces data according to time t1 within the operating time, and according to the data staging algorithm, the data that generate is assigned in different priority data bags successively.
Described priority data bag comprises: 0,1 ..., k grade, wherein the data of 0 grade have the highest importance, and other take second place successively.
In the 3rd step, sensor node is according to the operation of own state (idle condition, remain to be sent out a data mode, Tx state, Rx state) decision to channel.
Described Tx state, the current transmission data phase that is in of its expression sensor node;
Described Rx state, the current receive data state that is in of its expression sensor node;
Described idle condition, it is illustrated in working time of node, repeatedly searches priority data grade bag, checks whether the packet of high priority has data, if 0 grade does not have data, down searches 1 grade, 2 grades etc., until find data;
Treat the data that need transmission, node is checked the state of other nodes in its transmission radius, obtain the current state of channel, and carry out further work;
Described sensor node transmission radius refers to: according to the node topology that generates, the radius that sensor node can transmit is set, in radius, if there are other sensor nodes except node itself, this node can carry out transfer of data with other node, and all transmitting procedures are undertaken by same channel.Other nodes are when carrying out transfer of data simultaneously, and its transmitting procedure can cause interference to the transmission of sensor node.
Node is intercepted the interior possible state of channel of scope and is comprised the free time, the high-priority data transmission is arranged, the same priority transfer of data is arranged, the lower-priority data transmission is arranged:
Channel clear, its expression channel is not taken by other nodes.Present node is verified channel again through a very short chance event, if channel is still idle, carries out transfer of data;
The high-priority data transmission state is arranged, and in the transmission radius of sensor node, other nodes are in the state of transmission or receive data, and the grade mark of the data of transmission or reception returned to for the 3rd step higher than the current data that will transmit;
The same priority data transmission state is arranged, in the transmission radius of sensor node, other nodes are in the state of transmission or receive data, and the grade mark of the data of transmission or reception is identical with the current high priority data grade that will transmit, returns to for the 3rd step;
The lower-priority data transmission is arranged, and in the transmission radius of sensor node, other nodes are in the state that transmits or accept data, and the grade mark of the data of transmission or reception entered into for the 4th step all lower than the current data that will transmit.
The 4th step was taken situation for channel by the lower node of high priority data grade mark, and present node is verified confirmation.Channel or this situation after verifying, processing just conflicts.
Above-mentioned conflict processing procedure comprises the following steps:
Step (1): if the state of present node is the Tx state, the expression present node is transmission node.Wait node waiting for transmission at first to send RFC (request for the channel) to present node by signaling channel.Current just after the node of the transmission of data is received RFC by the Signalling exchange channel of oneself, the Packet Generation that is transmitting is complete, send SAF (stop after the frame) to its down hop by own signaling channel immediately.At first next-hop node completes the current data packet that is receiving on data transmission channel after receiving SAF by oneself Signalling exchange channel, sends NOTIFICATION by signaling channel afterwards and replys to present node.The NOTIFICATION that present node receives from down hop replys, immediately by signaling channel send another NOTIFICATION reply to etc. data to be transmitted interrupt node;
Step (2): if the state of present node is the RX state, the expression present node is receiving node.Wait node waiting for transmission to send RFC (request for the channel) to present node by signaling channel.Present node is transmitted to its upper hop node by signaling channel with it after receiving this signaling immediately, the upper hop node sends SAF immediately to current receiving node after receiving this signaling, after treating that current data packet is sent completely, the upper hop node sends NOTIFICATION by signaling channel and replys to current receiving node.After the node of current receive data is completed the transmission that current data wraps in data transmission channel, immediately by signaling channel send NOTIFICATION reply to etc. data to be transmitted interrupt node;
Down hop (perhaps upper hop) node of step (3) present node and it carries out data and state clearing work, then abdicate channel to etc. node waiting for transmission.
The nodes waiting for transmission such as step (4) carry out normal transfer of data after just receiving that NOTIFICATION that the node at busy channel sends by signaling channel replys.
The 5th step, after current period finishes, through the quite long length of one's sleep, return to second step, begin the new work period.
Preferably, described data and state clearing work comprise the following steps:
Step (31) changes to 0 with the down hop of present node and it or the state of upper hop node;
Step (32) is calculated the data bulk of transmission of present node, then the corresponding data bulk of plus-minus in present node and its corresponding priority data storehouse of down hop (perhaps upper hop) node;
Step (33) changes to the current time with the down hop of present node and it or acceptance and the transmitting time of upper hop node.Compared with prior art, the invention has the beneficial effects as follows: (i) working time of node much smaller than the length of one's sleep of node, is saved the sensor energy loss; (ii) data that importance is high arrive root node with the fastest speed; (iii) unessential data also can all arrive root node through considerable time, guarantee data integrity; (iv) transmit based on the data of classification, final complexity of the present invention is low, and requirement on devices is simple, and laser propagation effect is obvious.
Description of drawings
Fig. 1 is overall data transfer process figure a.
Fig. 2 is overall data transfer process figure b.
Fig. 3 is the channel confliction process chart.
The Signalling exchange figure a that Fig. 4 conflicts and processes.
The Signalling exchange figure b that Fig. 5 conflicts and processes.
Fig. 6 emulation cycle is 10, the mean transit delay schematic diagram for the different priority levels data of embodiment when transmission rate is 2000 bps.
Fig. 7 emulation cycle is 10, when transmission rate is 2000 bps embodiment for different priority levels, the mean transit delay schematic diagram of different transmission jump number data.
Fig. 8 emulation cycle is 10, embodiment's for the Data Growth trend schematic diagram in the different pieces of information grade storehouse of root node when transmission rate is 2000 bps.
Embodiment
The below elaborates to embodiments of the invention, and the present embodiment is being implemented take technical solution of the present invention as prerequisite, provided detailed execution mode and concrete operating process, but protection scope of the present invention is not limited to following embodiment.
The wireless sensor network environment parameter of the present embodiment is as follows: 30 meters of transmission radiuses, and the node number is 200, and the scene size is 200 meters * 200 meters, and simulation time is 1000 seconds.
As shown in Figure 1, the present embodiment comprises the following steps:
The first step is given respectively each node serial number in wireless sensor network and the corresponding initial transmission class information of each node, start node state information, initial transmission time started and initial transmission concluding time is set.
Described initial transmission class information is-1.
Described start node state information is-1.
The described initial transmission time started is 0.
The described initial transmission concluding time is 0.
Second step, node are take time T as the cycle, and the operating time is t in cycle T, is set to (T-t) length of one's sleep.Each node periodically produces data according to time t1 within the operating time, and according to the data priority hierarchical algorithms, the data that generate is assigned in different priority data bags successively.
Described priority data bag comprises: 0,1 ..., k grade, wherein the data of 0 grade have the highest importance, and other take second place successively.
The present embodiment Scene is set to the square area of 200 meters * 200 meters, and 200 nodes are distributed on the scene plane according to the random site coordinate information, and the position coordinates of selected sink node is positioned at scene center in fact, and coordinate vector is (100,100).
The node work period in the present embodiment is preferably 50 seconds, and the operating time is 10 seconds, is set to 40 seconds the length of one's sleep, and the cycle of each node generated data is 5 seconds.
In the 3rd step, sensor node (Sensor node) node determines the operation to channel according to the operating state (comprise idle condition, remain to be sent out data mode, Tx state, Rx state) of oneself.
Described Tx state, the current transmission data phase that is in of its expression sensor node;
Described Rx state, the current receive data state that is in of its expression sensor node;
Described idle condition in working time of node, is searched priority data grade bag repeatedly, checks whether the packet of high priority has data, if 0 grade does not have data, down searches 1 grade, 2 grades etc., until find data;
Treat the data that need transmission, node is checked the state of other nodes in its transmission radius, obtains the current state of channel;
Described sensor node transmission radius refers to: according to the node topology that generates, the radius that sensor node can transmit is set, in radius, if there are other sensor nodes except node itself, this node can carry out transfer of data with other node, and all transmitting procedures are undertaken by same channel.Other nodes are when carrying out transfer of data simultaneously, and its transmitting procedure can cause interference to the transmission of sensor node.
In this example, the transmission radius size of sensor node preferably is set to 30 meters.
Node is intercepted the interior possible state of channel of scope and is comprised channel clear, the high-priority data transmission state is arranged, the same priority data transmission state is arranged, the lower-priority data transmission state is arranged:
Channel clear, its expression channel is not taken by other nodes.Present node is verified channel again through a very short chance event, if channel is still idle, carry out transfer of data: at first transmission state mark, grade of transmission mark, transmission time started and the transmission end time of present node and next-hop node are set, then through carrying out the data clearing of corresponding node after the transmission time of estimating.Otherwise turned back to for the 3rd step;
Wherein: the transmission state of current transmission node is labeled as 1, and the transmission state of next-hop node is labeled as 2, and the time started of present node and next-hop node is labeled as current time t1, and the concluding time is labeled as the time that the current time adds transfer of data.
The high-priority data transmission state is arranged, and in sensor node transmission radius, other nodes are in the state of transmission or receive data, and the priority level mark of the data of transmission or reception returned to for the 3rd step higher than the current data that will transmit;
The same priority data transmission state is arranged, in sensor node transmission radius, other nodes are in the state of transmission or receive data, and the priority level mark of the data of transmission or reception is identical with the current high priority data grade that will transmit, returns to for the 3rd step;
The lower-priority data transmission state is arranged, in sensor node transmission radius, other nodes are in the state that transmits or accept data, and the priority level mark of the data of transmission or reception entered into for the 4th step all lower than the current data that will transmit.
The 4th step in sensor node transmission radius, was taken situation for channel by the lower node of data priority grade mark, and present node is verified confirmation.Channel or this situation after verifying, processing just conflicts.
Wherein, the transmission radius of described sensor node refers to: according to the node topology that generates, the radius that sensor node can transmit is set, in radius, if there are other sensor nodes except this node itself, this node can carry out transfer of data with other node, and all transmitting procedures are undertaken by same channel.
As shown in Figure 2, described conflict processing procedure comprises the following steps:
Step (1): if the state of present node is the Tx state, the expression present node is transmission node.Wait node waiting for transmission at first to send RFC (request for the channel) to present node by signaling channel.Current just after the node of the transmission of data is received RFC by the Signalling exchange channel of oneself, the Packet Generation that is transmitting is complete, send SAF (stop after the frame) to its down hop by own signaling channel immediately.At first next-hop node completes the current data packet that is receiving on data transmission channel after receiving SAF by oneself Signalling exchange channel, sends NOTIFICATION by signaling channel afterwards and replys to present node.The NOTIFICATION that present node receives from down hop replys, immediately by signaling channel send another NOTIFICATION reply to etc. data to be transmitted interrupt node, as shown in Figure 2;
Step (2): if the state of present node is the Rx state, the expression present node is receiving node.Wait node waiting for transmission to send RFC (request for the channel) to present node by signaling channel.Present node is transmitted to its upper hop node by signaling channel with it after receiving this signaling immediately, the upper hop node sends SAF immediately to current receiving node after receiving this signaling, after treating that current data packet is sent completely, the upper hop node sends NOTIFICATION by signaling channel and replys to current receiving node.After the node of current receive data is completed the transmission that current data wraps in data transmission channel, immediately by signaling channel send NOTIFICATION reply to etc. data to be transmitted interrupt node, as shown in Figure 3;
Down hop (perhaps upper hop) node of step (3) present node and it carries out data and state clearing work, then abdicate channel to etc. node waiting for transmission.
The nodes waiting for transmission such as step (4) carry out normal transfer of data after just receiving that NOTIFICATION that the node at busy channel sends by signaling channel replys.
The clearing work of described data and state comprises the following steps:
Step (31) changes to 0 with the state of present node and its down hop (perhaps upper hop) node;
Step (32) is calculated the data bulk of transmission of present node, then the corresponding data bulk of plus-minus in present node and its corresponding priority data storehouse of down hop (perhaps upper hop) node;
Step (33) changes to the current time with acceptance and the transmitting time of present node and its down hop (perhaps upper hop) node.
In the 5th step, current period through the length of one's sleep of 40 seconds, returns to second step after finishing, and begins the new work period.
As shown in Figure 6, be in the high data of priority level in simulation example, just arrived the sink node with very short time delay, and 0 priority has been compared obvious advantage with the data of 1 priority time delay used with the data of other three priority time delay used.
As shown in Figure 7, in simulation example, arriving the sink node through same number of hops and still be in the data of different priority levels, is also the higher data of priority level, arrives the sink needed time of node shorter.
As shown in Figure 8, in the data stack of dividing according to different priority levels on the sink node, the data that receive inside the data stack of different priority levels are along with the growth trend of time is not identical yet.Wherein, be in the data stack of high precedence, the Data Growth speed of the inside is obviously greater than the Data Growth trend than the data stack of low precedence the inside, and higher grade, growth along with the time, the rate of rise of data is faster, and it is shorter that the data that show high precedence arrive the required time of sink node.
By above-mentioned Fig. 6, Fig. 7, Fig. 8 as can be known: after the present embodiment method can make and divide through priority level, be in the data of high precedence, with shorter time delay, arrive quickly the sink node, and priority level is higher, and data are more important, arrives the required time of sink node shorter.
Claims (9)
1. the cognitive transmission method of based on data priority rating in an intelligent grid, is characterized in that,
Comprise the following steps:
The first step is given respectively each node serial number in wireless sensor network and the corresponding initial transmission class information of each node, start node state information, initial transmission time started and initial transmission concluding time is set;
Second step, node is take time T as the cycle, operating time is t in cycle T, be set to (T-t) length of one's sleep, wherein, each node periodically produces data according to time t1 in operating time t, and according to the data staging algorithm, the data that generate is assigned in different priority data bags successively;
The 3rd step, the operation of the Determines of sensor node basis oneself to channel, wherein, the state of sensor node comprises following state:
Remain to be sent out data mode;
The Tx state, the current transmission data phase that is in of its expression sensor node;
The Rx state, the current receive data state that is in of its expression sensor node;
Idle condition, it is illustrated in working time of node t, repeatedly search priority data grade bag, whether the packet of checking high priority has data, if there is no data in the packet of limit priority, search successively down in the packet of time priority whether data are arranged, until find data;
Wherein, treat the data that need transmission, node is checked the state of other nodes in its transmission radius, obtain the current state of channel, and carry out further work;
The 4th step was taken situation for channel by the lower node of high priority data grade mark, and present node is verified confirmation; Channel or this situation after verifying, processing just conflicts;
The 5th step, after current period finishes, through the length of one's sleep (T-t), return to second step, begin the new work period.
2. the cognitive transmission method of based on data priority rating in intelligent grid according to claim 1, is characterized in that, the initial transmission class information described in the first step is: the data waiting for transmission such as default setting is initial are from the storehouse of limit priority.
3. the cognitive transmission method of based on data priority rating in intelligent grid according to claim 1, is characterized in that, the initial transmission time started described in the first step, is: the work at present time.
4. the cognitive transmission method of based on data priority rating in intelligent grid according to claim 1, is characterized in that, the initial transmission concluding time described in the first step, is: the work at present time.
5. the cognitive transmission method of based on data priority rating in intelligent grid according to claim 1, is characterized in that, the described priority data bag of second step, comprise: 0,1 ..., k grade, wherein the data of 0 grade have the highest importance, and other take second place successively.
6. the cognitive transmission method of based on data priority rating in intelligent grid according to claim 1, it is characterized in that, the current state of the 3rd described channel of step comprises channel clear, the high-priority data transmission state is arranged, the same priority data transmission state is arranged, the lower-priority data transmission state is arranged:
Channel clear, its expression channel is not taken by other nodes.Present node is verified channel again through a very short chance event, if channel is still idle, carries out transfer of data;
The high-priority data transmission state is arranged, in the transmission radius of sensor node, other nodes are in the state of transmission or receive data, and the grade mark of the data of transmission or reception is higher than the current data that will transmit, wait for the node transmission of high precedence, search simultaneously the priority level storehouse of oneself, see whether exist more high-grade data to transmit;
The same priority data transmission state is arranged, in the transmission radius of sensor node, other nodes are in the state of transmission or receive data, and the grade mark of the data of transmission or reception is identical with the current high priority data grade that will transmit, wait for the node transmission with priority level, search simultaneously the priority level storehouse of oneself, see whether exist more high-grade data to transmit;
The lower-priority data transmission state is arranged, in the transmission radius of sensor node, other nodes are in the state that transmits or accept data, and the grade mark of the data of transmission or reception enters into the conflict management flow process all lower than the current data that will transmit.
7. the cognitive transmission method of based on data priority rating in intelligent grid according to claim 6, it is characterized in that, the transmission radius of described sensor node refers to: according to the node topology that generates, the radius that sensor node can transmit is set, in radius, if there are other sensor nodes except this node itself, this node can carry out transfer of data with other node, and all transmitting procedures are undertaken by same channel.
8. the cognitive transmission method of based on data priority rating in intelligent grid according to claim 1, is characterized in that, the processing procedure of conflicting described in the 4th step comprises the following steps:
Step (1): if the state of present node is the Tx state, the expression present node is transmission node; Wait node waiting for transmission at first to send RFC to present node by signaling channel; Current just after the node of the transmission of data is received RFC by the Signalling exchange channel of oneself, the Packet Generation that is transmitting is complete, immediately by the down hop of own signaling channel transmission SAF to it; At first next-hop node completes the current data packet that is receiving on data transmission channel after receiving SAF by oneself Signalling exchange channel, sends NOTIFICATION by signaling channel afterwards and replys to present node; The NOTIFICATION that present node receives from down hop replys, immediately by signaling channel send another NOTIFICATION reply to etc. data to be transmitted interrupt node;
Step (2): if the state of present node is the RX state, the expression present node is receiving node.Wait node waiting for transmission to send RFC to present node by signaling channel.Present node is transmitted to its upper hop node by signaling channel with it after receiving this signaling immediately, the upper hop node sends SAF immediately to current receiving node after receiving this signaling, after treating that current data packet is sent completely, the upper hop node sends NOTIFICATION by signaling channel and replys to current receiving node; After the node of current receive data is completed the transmission that current data wraps in data transmission channel, immediately by signaling channel send NOTIFICATION reply to etc. data to be transmitted interrupt node;
Down hop or the upper hop node of step (3) present node and it carry out data and state clearing work, then abdicate channel to etc. node waiting for transmission;
The nodes waiting for transmission such as step (4) carry out normal transfer of data after just receiving that NOTIFICATION that the node at busy channel sends by signaling channel replys.
9. the cognitive transmission method of based on data priority rating in intelligent grid according to claim 8, is characterized in that, described data and state clearing work comprise the following steps:
Step (31) changes to 0 with the down hop of present node and it or the state of upper hop node;
Step (32) is calculated the data bulk of transmission of present node, then the corresponding data bulk of plus-minus in present node and its corresponding priority data storehouse of down hop (perhaps upper hop) node;
Step (33) changes to the current time with the down hop of present node and it or acceptance and the transmitting time of upper hop node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110335704.0A CN103096387B (en) | 2011-10-28 | 2011-10-28 | Based on the cognitive transmission method of high priority data classification in intelligent grid |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110335704.0A CN103096387B (en) | 2011-10-28 | 2011-10-28 | Based on the cognitive transmission method of high priority data classification in intelligent grid |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103096387A true CN103096387A (en) | 2013-05-08 |
| CN103096387B CN103096387B (en) | 2016-06-01 |
Family
ID=48208380
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110335704.0A Expired - Fee Related CN103096387B (en) | 2011-10-28 | 2011-10-28 | Based on the cognitive transmission method of high priority data classification in intelligent grid |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103096387B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103929778A (en) * | 2014-05-13 | 2014-07-16 | 南通大学 | Data grading transmission method |
| CN106160920A (en) * | 2015-03-31 | 2016-11-23 | 联想(北京)有限公司 | A kind of information processing method, device and electronic equipment |
| CN107580042A (en) * | 2017-08-30 | 2018-01-12 | 广东电网有限责任公司中山供电局 | A kind of transmission method and system of distribution network data |
| CN108471642A (en) * | 2018-03-26 | 2018-08-31 | 厦门四信通信科技有限公司 | A kind of infusion pump network of LoRa transmission |
| CN108871544A (en) * | 2018-04-20 | 2018-11-23 | 南京曦光信息科技有限公司 | A kind of comprehensive sensing data convergence priority scheduling method and system of distribution type fiber-optic |
| CN114389746A (en) * | 2020-10-21 | 2022-04-22 | 航天科工惯性技术有限公司 | Variable-length data processing and transmitting method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101013976A (en) * | 2007-02-05 | 2007-08-08 | 南京邮电大学 | Mixed intrusion detection method of wireless sensor network |
| US20080307075A1 (en) * | 2007-06-07 | 2008-12-11 | Hitachi, Ltd. | Sensor-net system and sensor node |
| CN101409660A (en) * | 2008-08-14 | 2009-04-15 | 宁波中科集成电路设计中心有限公司 | Channel access control method for wireless sensor network |
-
2011
- 2011-10-28 CN CN201110335704.0A patent/CN103096387B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101013976A (en) * | 2007-02-05 | 2007-08-08 | 南京邮电大学 | Mixed intrusion detection method of wireless sensor network |
| US20080307075A1 (en) * | 2007-06-07 | 2008-12-11 | Hitachi, Ltd. | Sensor-net system and sensor node |
| CN101409660A (en) * | 2008-08-14 | 2009-04-15 | 宁波中科集成电路设计中心有限公司 | Channel access control method for wireless sensor network |
Non-Patent Citations (2)
| Title |
|---|
| 吴佳伟: "《智能电网中无线传感器网络技术的应用研究》", 《供用电》 * |
| 张强，孙雨耕，杨挺，崔振辉: "无线传感器网络在智能电网中的应用", 《中国电力》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103929778A (en) * | 2014-05-13 | 2014-07-16 | 南通大学 | Data grading transmission method |
| CN103929778B (en) * | 2014-05-13 | 2018-06-19 | 南通大学 | Data staging transmission method |
| CN106160920A (en) * | 2015-03-31 | 2016-11-23 | 联想(北京)有限公司 | A kind of information processing method, device and electronic equipment |
| CN106160920B (en) * | 2015-03-31 | 2019-05-31 | 联想(北京)有限公司 | A kind of information processing method, device and electronic equipment |
| CN107580042A (en) * | 2017-08-30 | 2018-01-12 | 广东电网有限责任公司中山供电局 | A kind of transmission method and system of distribution network data |
| CN108471642A (en) * | 2018-03-26 | 2018-08-31 | 厦门四信通信科技有限公司 | A kind of infusion pump network of LoRa transmission |
| CN108871544A (en) * | 2018-04-20 | 2018-11-23 | 南京曦光信息科技有限公司 | A kind of comprehensive sensing data convergence priority scheduling method and system of distribution type fiber-optic |
| CN114389746A (en) * | 2020-10-21 | 2022-04-22 | 航天科工惯性技术有限公司 | Variable-length data processing and transmitting method |
| CN114389746B (en) * | 2020-10-21 | 2023-07-14 | 航天科工惯性技术有限公司 | Variable length data processing and transmitting method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103096387B (en) | 2016-06-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103096387A (en) | Cognitive transmission method based on data prior classification in smart power girds | |
| CN104639552B (en) | The chain network wireless high-speed means of communication | |
| JP5909159B2 (en) | Control apparatus and control method | |
| CN111371827B (en) | Data transmission method, device and computer readable storage medium | |
| CN104868846B (en) | Solar photovoltaic assembly array data acquisition method based on wireless Internet of Things | |
| CN101924391B (en) | Electric distribution network feeder automation system based on wireless ad hoc network and networking method thereof | |
| CN105915454A (en) | Multimode communication method for state monitoring of power transmission line | |
| CN107453849A (en) | Mutual-backup linkage method and system for wired link and wireless link of power distribution communication network and air-ground mutual-backup integrated device | |
| CN103763751B (en) | Data transmission method and system of wireless sensor network | |
| CN107800624A (en) | A kind of optimal circuitous path selection new method of regional protection key message | |
| CN110351827A (en) | A kind of wireless self-networking method and system based on Sub-GHz | |
| CN109922537B (en) | Wireless module and implementation method thereof | |
| CN107072018A (en) | One kind is based on power carrier light pole intelligence system | |
| CN107682264A (en) | Data transmission method and system based on real-time active path planning | |
| US20160050040A1 (en) | Radio communication system and radio communication method | |
| Muhendra et al. | Development of digital water meter infrastructure using wireless sensor networks | |
| Huang et al. | Optimal traffic scheduling between roadside units in vehicular delay-tolerant networks | |
| CN104483936A (en) | Wireless network information collection platform of wireless data access system | |
| CN103236143A (en) | Intelligent household appliance control system and method | |
| CN107645756A (en) | Network node add-on system and things-internet gateway | |
| CN207075108U (en) | One kind is based on power carrier light pole intelligence system | |
| CN104301426B (en) | A kind of wireless communication system of transmission line of electricity online monitoring system | |
| JP5991610B2 (en) | Data acquisition apparatus and multi-hop communication system using the same | |
| CN107024886A (en) | Intelligence control system based on Internet of Things architectural framework | |
| Jacquet et al. | Using a token approach for the MAC layer of linear sensor networks: Impact of the node position on the packet delivery |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160601 Termination date: 20181028 |