CN103096387B - Based on the cognitive transmission method of high priority data classification in intelligent grid - Google Patents
Based on the cognitive transmission method of high priority data classification in intelligent grid Download PDFInfo
- Publication number
- CN103096387B CN103096387B CN201110335704.0A CN201110335704A CN103096387B CN 103096387 B CN103096387 B CN 103096387B CN 201110335704 A CN201110335704 A CN 201110335704A CN 103096387 B CN103096387 B CN 103096387B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- transmission
- channel
- state
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Abstract
The present invention provides the cognitive transmission method in intelligent grid based on high priority data classification, including step: gives each node serial number in wireless sensor network respectively and arranges corresponding initial transmission class information, start node status information, initial transmission time started, initial transmission end time; Each node is operationally interior periodically produces data according to time t1, and is sequentially allocated in different priority data bags according to data staging algorithm by the data of generation; Node is according to the operation to channel of oneself Determines; Being taken situation for channel by the node that high priority data grade mark is relatively low, present node carries out verifying confirmation, then carries out clash handle. After current period terminates, through the length of one's sleep, start the new working cycle. The present invention can when sensor node finite energy, and in severe working environment, it is ensured that the most important data that node is collected arrive root node with the shortest time delay, it is achieved simple, efficiency is high.<!--2--><!--3-->
Description
Technical field
A kind of method that the present invention relates to wireless communication technology field, the specifically cognitive transmission method of a kind of wireless sensor network based on data staging technology.
Background technology
Along with the development of intelligent power grid technology, monitoring and control in real time for electrical equipment become more and more important. Being limited owing to some equipment of electrical system are subject to the feature of wiring, power supply, installation site or equipment itself, wired real-time inspection and control network is difficult to. The advantage of now wireless real-time inspection and control network just embodies out, and it need not connect by cable. It is just passable that this means that each wireless sensor terminal has only to antenna, saves the expense of a large amount of cable. And wireless senser can be arranged in the place of needs more flexibly, it is possible to closer to measuring object.
But, wireless senser also has the place of some shortcomings. Owing to there is no cable, it is impossible to use power supply to power, battery can only be used to power. This means that the consumption of 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 strategy of power saving, the delay of its information transmission is more big. Namely information is transmitted in a network speed and the energy consumption of wireless sensor network node are exchanges. Simultaneously for the sensor network of monitoring in real time, owing to the data class of monitoring is complicated, different data are to have different significance levels. Data different in other words are different for the sensitivity of time delay, and some data are more urgent, it is necessary to be transferred to receiving node as soon as possible, and some data are less sensitive to actual effect, allow bigger transmission delay. On the other hand, owing to sensor network is used for the operation conditions that the effect of intelligent grid especially remote error diagnosis is monitoring equipment, they are all the normal data of comparison in the data that most of time is collected in fact, from the angle of whole network actually sensor collection to information have very big redundancy. If the data of these redundancies are all sent to receiving node, actually simply waste the energy of sensor. And, the data of redundancy are often those unessential data, and they are to postponing not have significantly high requirement.
Summary of the invention
In the process of data transmission, if the redundancy of cognitive data, the significance level of detection data can be passed through, carry out the transmission of cognition, both can reduce the data volume of transmission, the transmission speed of important information under not increasing the premise even reducing energy expenditure, can have been increased again.
The present invention is achieved by the following technical solutions, and the present invention comprises the following steps:
The first step, gives each node serial number in wireless sensor network respectively and arranges the corresponding initial transmission class information of each node, start node status information, initial transmission time started and initial transmission end time.
Described initial transmission grade, be: the data of default setting initial latency transmission are from the storehouse of limit priority.
The described transmission time started, it is: the work at present time.
Described transmission end time, be: the work at present time.
Second step, node is with time T for the cycle, and in cycle T, the working time is t, is set to (T-t) length of one's sleep. Each node is operationally interior periodically produces data according to time t1, and the data of generation is sequentially allocated in different priority data bags according to data staging algorithm.
Described priority data bag, including: 0,1 ..., k grade, wherein the data of 0 grade have the highest importance, and other take second place successively.
3rd step, sensor node determines the operation to channel according to oneself state (idle condition, have data mode pending, Tx state, Rx state).
Described Tx state, it represents that sensor node is currently at transmission data phase;
Described Rx state, it represents that sensor node is currently at reception data mode;
Described idle condition, it represents 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, then down lookup 1 grade, 2 grades etc., until finding data;
Treating the data needing transmission, node checks the state of other nodes in its transmission radius, obtains the current state of channel, and carries out further work;
Described sensor node transmission radius refers to: according to the node topology generated, the radius that sensor node can transmit is set, in radius, if there are other sensor nodes except node itself, then this node can carry out data transmission with other node, and all of transmitting procedure is undertaken by same channel. Other nodes are when carrying out data transmission simultaneously, and the transmission of sensor node can be interfered by its transmitting procedure.
Node is intercepted the possible state of channel in scope and is included the free time, has high-priority data transmission, has the transmission of same priority data, has lower-priority data to transmit:
Channel clear, it represents that channel is not taken by other nodes. Present node verifies channel again through a very short random event, if channel is still idle, then carries out data transmission;
Having high-priority data transmission state, in the transmission radius of sensor node, other nodes are in transmission or receive the state of data, and the grade mark of the data transmitted or receive is higher than the data currently transmitted, then return the 3rd step;
There is same priority data transmission state, in the transmission radius of sensor node, other nodes are in transmission or receive the state of data, and the grade mark of the data transmitted or receive is identical with the high priority data grade currently transmitted, then return the 3rd step;
Having lower-priority data to transmit, in the transmission radius of sensor node, other nodes are in transmission or accept the state of data, and the grade mark of the data transmitted or receive is entirely below the data currently transmitted, then enter into the 4th step.
4th step, is taken situation for channel by the node that high priority data grade mark is relatively low, and present node carries out verifying confirmation. Channel or this situation after verification, just carry out clash handle.
Above-mentioned clash handle process, comprises the following steps:
Step (1): if the state of present node is Tx state, represents that present node is transmission node. Then etc. node waiting for transmission first passes through signaling channel and sends RFC (requestforthechannel) to present node. The packet transmitted is sent after receiving RFC by the Signalling exchange channel of oneself by the current node transmitting data, sends SAF (stopaftertheframe) to its down hop by the signaling channel of oneself immediately. First next-hop node completes, after receiving SAF by the Signalling exchange channel of oneself, the current data packet received on data transmission channel, sends NOTIFICATION response to present node by signaling channel afterwards. Present node receives the NOTIFICATION response from down hop, immediately by signaling channel send another NOTIFICATION response to etc. data to be transmitted interrupt node;
Step (2): if the state of present node is RX state, represents that present node is receiving node. Then etc. node waiting for transmission sends RFC (requestforthechannel) to present node by signaling channel. Present node forwards it to its upper hop node immediately by signaling channel after receiving this signaling, upper hop node sends SAF immediately to current receiving node after receiving this signaling, after treating that current data packet is sent completely, upper hop node sends NOTIFICATION response to current receiving node by signaling channel. After the current node receiving data completes the transmission that current data wraps in data transmission channel, immediately by signaling channel send NOTIFICATION response to etc. data to be transmitted interrupt node;
Step (3) present node and its down hop (or upper hop) node carry out data and state clearing work, then concede channel to etc. node waiting for transmission.
The nodes waiting for transmission such as step (4) carry out normal data transmission after receiving the NOTIFICATION response just sent by signaling channel at the node of busy channel.
5th step, after current period terminates, through the considerably long length of one's sleep, returns second step, starts the new working cycle.
Preferably, described data and state clearing work comprise the following steps:
The state of present node and its down hop or upper hop node is changed to 0 by step (31);
Step (32) calculates the transmission data bulk of present node, then adds and subtracts corresponding data bulk in present node and its down hop (or upper hop) node corresponding priority data storehouse;
Acceptance and the transmission time of present node and its down hop or upper hop node are changed to current time by step (33). 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, saves sensor energy loss; (ii) data that importance is high arrive root node with the fastest speed; (iii) unessential data also can all arrive at root node through considerable time, it is ensured that data integrity; (iv) data based on classification are transmitted, and the complexity of the final present invention is low, and requirement on devices is simple, and laser propagation effect is obvious.
Accompanying drawing explanation
Fig. 1 is overall data transfer process figure a.
Fig. 2 is overall data transfer process figure b.
Fig. 3 is channel confliction process chart.
The Signalling exchange figure a of Fig. 4 clash handle.
The Signalling exchange figure b of Fig. 5 clash handle.
Fig. 6 emulation cycle is 10, the mean transit delay schematic diagram for different priority levels data of embodiment when transfer rate is 2000 bps.
Fig. 7 emulation cycle is 10, when transfer 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 for the data growth trend schematic diagram in the different pieces of information grade storehouse of root node when transfer rate is 2000 bps.
Detailed description of the invention
Below embodiments of the invention being elaborated, the present embodiment is being carried out premised on technical solution of the present invention, gives detailed embodiment 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: transmission radius 30 meters, node number is 200, and scene is sized to 200 meters �� 200 meters, and simulation time is 1000 seconds.
As it is shown in figure 1, the present embodiment comprises the following steps:
The first step, gives each node serial number in wireless sensor network respectively and arranges the corresponding initial transmission class information of each node, start node status information, initial transmission time started and initial transmission end time.
Described initial transmission class information, is-1.
Described start node status information, is-1.
The described initial transmission time started, is 0.
The described initial transmission end time, is 0.
Second step, node is with time T for the cycle, and in cycle T, the working time is t, is set to (T-t) length of one's sleep. Each node is operationally interior periodically produces data according to time t1, and the data of generation is sequentially allocated in different priority data bags according to data priority hierarchical algorithms.
Described priority data bag, including: 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, 200 nodes are distributed in scene plane according to random site coordinate information, the position coordinates of selected sink node is positioned at scene center in fact, and coordinate vector is (100,100).
The node working cycle in the present embodiment is preferably 50 seconds, and the working time is 10 seconds, is set to the length of one's sleep 40 seconds, and the cycle of each node generation data is 5 seconds.
3rd step, sensor node (Sensor node) node determines the operation to channel according to the duty (include idle condition, have data mode pending, Tx state, Rx state) of oneself.
Described Tx state, it represents that sensor node is currently at transmission data phase;
Described Rx state, it represents that sensor node is currently at reception data mode;
Described idle condition, 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, then down lookup 1 grade, 2 grades etc., until finding data;
Treating the data needing transmission, node checks 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 generated, the radius that sensor node can transmit is set, in radius, if there are other sensor nodes except node itself, then this node can carry out data transmission with other node, and all of transmitting procedure is undertaken by same channel. Other nodes are when carrying out data transmission simultaneously, and the transmission of sensor node can be interfered by its transmitting procedure.
In this example, the transmission radius size of sensor node is preferably set to 30 meters.
Node is intercepted the possible state of channel in scope and is included channel clear, has high-priority data transmission state, has same priority data transmission state, has lower-priority data transmission state:
Channel clear, it represents that channel is not taken by other nodes. Present node verifies channel again through a very short random event, if channel is still idle, then carry out data transmission: first the transmission state labelling of present node and next-hop node, grade of transmission labelling, transmission time started and transmission end time are set, after being then passed through the transmission time estimated, carry out the data clearing of corresponding node. Otherwise return to the 3rd step;
Wherein: the transmission state of current transmission node is labeled as 1, 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 end time is labeled as the current time time plus data transmission.
Having high-priority data transmission state, in sensor node transmission radius, other nodes are in transmission or receive the state of data, and the priority level labelling of the data transmitted or receive is higher than the data currently transmitted, then return the 3rd step;
There is same priority data transmission state, in sensor node transmission radius, other nodes are in transmission or receive the state of data, and the priority level labelling of the data transmitted or receive is identical with the high priority data grade currently transmitted, then return the 3rd step;
There is lower-priority data transmission state, in sensor node transmission radius, other nodes are in transmission or accept the state of data, and the priority level labelling of the data transmitted or receive is entirely below the data currently transmitted, then enter into the 4th step.
4th step, transmits in radius at sensor node, is taken situation for channel by the node that data priority level labelling is relatively low, and present node carries out verifying confirmation. Channel or this situation after verification, just carry out clash handle.
Wherein, the transmission radius of described sensor node refers to: according to the node topology generated, the radius that sensor node can transmit is set, in radius, if there are other sensor nodes except this node itself, then this node can carry out data transmission with other node, and all of transmitting procedure is undertaken by same channel.
As in figure 2 it is shown, described clash handle process, comprise the following steps:
Step (1): if the state of present node is Tx state, represents that present node is transmission node. Then etc. node waiting for transmission first passes through signaling channel and sends RFC (requestforthechannel) to present node. The packet transmitted is sent after receiving RFC by the Signalling exchange channel of oneself by the current node transmitting data, sends SAF (stopaftertheframe) to its down hop by the signaling channel of oneself immediately. First next-hop node completes, after receiving SAF by the Signalling exchange channel of oneself, the current data packet received on data transmission channel, sends NOTIFICATION response to present node by signaling channel afterwards. Present node receives the NOTIFICATION response from down hop, immediately by signaling channel send another NOTIFICATION response to etc. data to be transmitted interrupt node, as shown in Figure 2;
Step (2): if the state of present node is Rx state, represents that present node is receiving node. Then etc. node waiting for transmission sends RFC (requestforthechannel) to present node by signaling channel. Present node forwards it to its upper hop node immediately by signaling channel after receiving this signaling, upper hop node sends SAF immediately to current receiving node after receiving this signaling, after treating that current data packet is sent completely, upper hop node sends NOTIFICATION response to current receiving node by signaling channel. After the current node receiving data completes the transmission that current data wraps in data transmission channel, immediately by signaling channel send NOTIFICATION response to etc. data to be transmitted interrupt node, as shown in Figure 3;
Step (3) present node and its down hop (or upper hop) node carry out data and state clearing work, then concede channel to etc. node waiting for transmission.
The nodes waiting for transmission such as step (4) carry out normal data transmission after receiving the NOTIFICATION response just sent by signaling channel at the node of busy channel.
The clearing work of described data and state comprises the following steps:
The state of present node and its down hop (or upper hop) node is changed to 0 by step (31);
Step (32) calculates the transmission data bulk of present node, then adds and subtracts corresponding data bulk in present node and its down hop (or upper hop) node corresponding priority data storehouse;
Acceptance and the transmission time of present node and its down hop (or upper hop) node are changed to current time by step (33).
5th step, after current period terminates, through the length of one's sleep of 40 seconds, returns second step, starts the new working cycle.
As shown in Figure 6, simulation example is in the data that priority level is high, just reaches sink node with very short time delay, and 0 priority has compared obvious advantage with the time delay used by the data of 1 priority with the time delay used by the data of other three priority.
As it is shown in fig. 7, in simulation example, arrive sink node through same number of hops but be in the data of different priority levels, be also the data that priority level is more high, the time required for arriving sink node is more short.
As shown in Figure 8, according in the data stack of different priority level divisions on sink node, the data received inside the data stack of different priority levels growth trend over time also differs. Wherein, it is in the data stack of high precedence, the data rate of rise of the inside is significantly greater than the data growth trend inside the data stack of relatively low precedence, and grade is more high, growth over time, the rate of rise of data is more fast, it was shown that the time needed for the data arrival sink node of high precedence is more short.
From above-mentioned Fig. 6, Fig. 7, Fig. 8: the present embodiment method enables to, after priority level divides, be in the data of high precedence, with shorter time delay, arrive more quickly at sink node, and priority level is more high, data are more important, then the time needed for arriving sink node is more short.
Claims (9)
1. based on the cognitive transmission method of high priority data classification in an intelligent grid, it is characterised in that comprise the following steps:
The first step, gives each node serial number in wireless sensor network respectively and arranges the corresponding initial transmission class information of each node, start node status information, initial transmission time started and initial transmission end time;
Second step, node is with time T for the cycle, in cycle T, the working time is t, it is set to (T-t) length of one's sleep, wherein, each node operationally between periodically produce data according to time t1 in t, and according to data staging algorithm, the data of generation are sequentially allocated in different priority data bags;
3rd step, sensor node is according to the operation to channel of oneself Determines, and wherein, the state of sensor node includes following state:
There is data mode pending;
Tx state, it represents that sensor node is currently at transmission data phase;
Rx state, it represents that sensor node is currently at reception data mode;
Idle condition, it represents in working time of node t, repeatedly search priority data grade bag, check whether the packet of high priority has data, if the packet of limit priority does not have data, then down search successively in the packet of sub-priority and whether have data, until finding data;
Wherein, treating the data needing transmission, node checks the state of other nodes in its transmission radius, obtains the current state of channel, and carries out further work;
4th step, is taken situation for channel by the node that high priority data grade mark is relatively low, and present node carries out verifying confirmation; Channel or this situation after verification, just carry out clash handle;
5th step, after current period terminates, through the length of one's sleep (T-t), returns second step, starts the new working cycle.
2. based on the cognitive transmission method of high priority data classification in intelligent grid according to claim 1, it is characterised in that the initial transmission class information described in the first step, it is: the data of default setting initial latency transmission are from the storehouse of limit priority.
3. based on the cognitive transmission method of high priority data classification in intelligent grid according to claim 1, it is characterised in that the initial transmission time started described in the first step, be: the work at present time.
4. based on the cognitive transmission method of high priority data classification in intelligent grid according to claim 1, it is characterised in that the initial transmission end time described in the first step, be: the work at present time.
5. based on the cognitive transmission method of high priority data classification in intelligent grid according to claim 1, it is characterised in that the priority data bag described in second step, including: 0,1 ..., k grade, wherein the data of 0 grade have the highest importance, and other take second place successively.
6. based on the cognitive transmission method of high priority data classification in intelligent grid according to claim 1, it is characterized in that, the current state of the channel described in the 3rd step includes channel clear, has high-priority data transmission state, has same priority data transmission state, has lower-priority data transmission state:
Channel clear, it represents that channel is not taken by other nodes; Present node verifies channel again through a very short random event, if channel is still idle, then carries out data transmission;
There is high-priority data transmission state, in the transmission radius of sensor node, other nodes are in transmission or receive the state of data, and the grade mark of the data transmitted or receive is higher than the data currently transmitted, then wait the node-node transmission of high precedence, search the priority level storehouse of oneself simultaneously, see that the data that whether there is greater degree need to be transmitted;
There is same priority data transmission state, in the transmission radius of sensor node, other nodes are in transmission or receive the state of data, and the grade mark of the data transmitted or receive is identical with the high priority data grade currently transmitted, then wait the node-node transmission of same priority level, search the priority level storehouse of oneself simultaneously, see that the data that whether there is greater degree need to be transmitted;
There is lower-priority data transmission state, in the transmission radius of sensor node, other nodes are in transmission or receive the state of data, and the grade mark of the data transmitted or receive is entirely below the data currently transmitted, then enter into conflict management flow process.
7. based on the cognitive transmission method of high priority data classification 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 generated, the radius that sensor node can transmit is set, in radius, if there are other sensor nodes except this node itself, then this node can carry out data transmission with other node, and all of transmitting procedure is undertaken by same channel.
8., based on the cognitive transmission method of high priority data classification in intelligent grid according to claim 1, it is characterised in that clash handle process described in the 4th step, comprise the following steps:
Step (1): if the state of present node is Tx state, represents that present node is transmission node; Then etc. node waiting for transmission first passes through signaling channel and sends RFC to present node; The packet transmitted is sent after receiving RFC by the Signalling exchange channel of oneself by the current node transmitting data, sends SAF to its down hop by the signaling channel of oneself immediately; First next-hop node completes, after receiving SAF by the Signalling exchange channel of oneself, the current data packet received on data transmission channel, sends NOTIFICATION response to present node by signaling channel afterwards; Present node receives the NOTIFICATION response from down hop, immediately by signaling channel send another NOTIFICATION response to etc. data to be transmitted interrupt node; Wherein, RFC represents channel request signaling, and SAF represents frame end signaling;
Step (2): if the state of present node is RX state, represents that present node is receiving node; Then etc. node waiting for transmission sends RFC to present node by signaling channel; Present node forwards it to its upper hop node immediately by signaling channel after receiving this signaling, upper hop node sends SAF immediately to current receiving node after receiving this signaling, after treating that current data packet is sent completely, upper hop node sends NOTIFICATION response to current receiving node by signaling channel; After the current node receiving data completes the transmission that current data wraps in data transmission channel, immediately by signaling channel send NOTIFICATION response to etc. data to be transmitted interrupt node;
Step (3) present node and its down hop or upper hop node carry out data and state clearing work, then concede channel to etc. node waiting for transmission;
The nodes waiting for transmission such as step (4) carry out normal data transmission after receiving the NOTIFICATION response just sent by signaling channel at the node of busy channel.
9. based on the cognitive transmission method of high priority data classification in intelligent grid according to claim 8, it is characterised in that described data and state clearing work comprise the following steps:
The state of present node and its down hop or upper hop node is changed to 0 by step (31);
Step (32) calculates the transmission data bulk of present node, then adds and subtracts corresponding data bulk in present node and its down hop or upper hop node corresponding priority data storehouse;
Reception and the transmission time of present node and its down hop or upper hop node are changed to current time by step (33).
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 CN103096387A (en) | 2013-05-08 |
| CN103096387B true 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) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103929778B (en) * | 2014-05-13 | 2018-06-19 | 南通大学 | Data staging transmission method |
| 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 |
| CN114389746B (en) * | 2020-10-21 | 2023-07-14 | 航天科工惯性技术有限公司 | Variable length data processing and transmitting method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101013976A (en) * | 2007-02-05 | 2007-08-08 | 南京邮电大学 | Mixed intrusion detection method of wireless sensor network |
| CN101409660A (en) * | 2008-08-14 | 2009-04-15 | 宁波中科集成电路设计中心有限公司 | Channel access control method for wireless sensor network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4977534B2 (en) * | 2007-06-07 | 2012-07-18 | 株式会社日立製作所 | Sensor network system and sensor node |
-
2011
- 2011-10-28 CN CN201110335704.0A patent/CN103096387B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101013976A (en) * | 2007-02-05 | 2007-08-08 | 南京邮电大学 | Mixed intrusion detection method of wireless sensor network |
| CN101409660A (en) * | 2008-08-14 | 2009-04-15 | 宁波中科集成电路设计中心有限公司 | Channel access control method for wireless sensor network |
Non-Patent Citations (2)
| Title |
|---|
| 《智能电网中无线传感器网络技术的应用研究》;吴佳伟;《供用电》;20100830;全文 * |
| 无线传感器网络在智能电网中的应用;张强，孙雨耕，杨挺，崔振辉;《中国电力》;20100630;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103096387A (en) | 2013-05-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103096387B (en) | Based on the cognitive transmission method of high priority data classification in intelligent grid | |
| JP5909159B2 (en) | Control apparatus and control method | |
| CN111371827B (en) | Data transmission method, device and computer readable storage medium | |
| CN102547942B (en) | Wireless sensor network intelligent gateway applied to greenhouse environment monitoring | |
| CN102685839B (en) | Method, gateway, terminal and system for communication of Internet of things | |
| CN105915454A (en) | Multimode communication method for state monitoring of power transmission line | |
| CN101232417A (en) | Embedded type wireless sensing network intelligent platform | |
| JP2005217548A (en) | Method and system for radio communication and radio terminal | |
| CN103532877B (en) | A kind of dispatching method ensureing wireless sensor network information real-time Transmission | |
| CN101895956A (en) | Data transmission method of multilayer distributed wireless sensor network | |
| CN112491842B (en) | Multi-protocol Internet of things gateway for smart construction site | |
| CN102572991A (en) | Transmission method with low power consumption based on trust control | |
| US20140105063A1 (en) | Duty cycle control method and apparatus to mitigate latency for duty cycle-based wireless low-power mac | |
| CN103763751B (en) | Data transmission method and system of wireless sensor network | |
| CN103619057B (en) | 802.15.4e wireless device low-power consumption network-building methods based on 4 20mA loops power takings | |
| CN109922537B (en) | Wireless module and implementation method thereof | |
| CN105959239B (en) | The communication means of three-dimensional network on mating plate | |
| CN104348523B (en) | Data transmission method for wireless sensor node | |
| CN105188084A (en) | Congestion control based wireless sensor network routing optimization method | |
| CN103929778A (en) | Data grading transmission method | |
| CN103605172B (en) | Be applicable to the radio data transmission method of wind energy gradient meteorological observation | |
| Huang et al. | Optimal traffic scheduling between roadside units in vehicular delay-tolerant networks | |
| CN103281732B (en) | For improving the method for radio sensing network channel efficiency | |
| CN103236143A (en) | Intelligent household appliance control system and method | |
| CN203278865U (en) | Intelligent household appliance control system |
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: 20160601 Termination date: 20181028 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |