CN108289317A - A kind of wireless sensor network method for routing and device based on big data analysis - Google Patents
A kind of wireless sensor network method for routing and device based on big data analysis Download PDFInfo
- Publication number
- CN108289317A CN108289317A CN201810452658.4A CN201810452658A CN108289317A CN 108289317 A CN108289317 A CN 108289317A CN 201810452658 A CN201810452658 A CN 201810452658A CN 108289317 A CN108289317 A CN 108289317A
- Authority
- CN
- China
- Prior art keywords
- node
- leader cluster
- wireless sensor
- routing
- sensor network
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/70—Routing based on monitoring results
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of wireless sensor network method for routing and device based on big data analysis, the quantity for counting each leader cluster node data packet obtains each leader cluster node data transfer number, judge whether that the leader cluster node higher than high frequency threshold value is labeled as energy consumption exception leader cluster node, will then carry out sub-clustering again and the leader cluster node after sub-clustering again is calculated into transmission path according to greedy routing algorithm and updates routing table.The disclosure can pass through the test of a period of time, actual motion test is carried out to the sensor newly arranged, avoid the sub- sub-clustering region of high frequency of data transmission, the working life of sensing network entirety can be extended, whole network life, efficiency of transmission and monitoring effect and quality are improved, than traditional HEED routing algorithm communication cost smallers after optimization.
Description
Technical field
This disclosure relates to which wireless sensor network route field, and in particular to a kind of wireless sense network based on big data analysis
Network method for routing and device.
Background technology
For large-scale distributed wireless sensor network, node by one jump directly be with base station communication it is unpractical,
So most of wireless sense network all transmits number using the method for clustering routing to realize that the layering in sub-clustering area is route now
According in order to reduce the information content for being transmitted to base station, cluster head node is responsible for merging in cluster number caused by not source node
According to and the data after fusion being sent to convergent point, since data acquisition is to concentrate and periodic, the agreement is very
Be suitable for the application system that requirement continuously monitors, for terminal user, due to it does not need to be instantly available it is all
Data, therefore agreement does not need periodic transmission data, can achieve the purpose that limiting sensor node energy consumes in this way,
After given time interval, agreement re-elects cluster head node, to ensure that wireless sensor network obtains unified energy point
Cloth, although LEACH can improve the life span of network, there are still some to be worth for assumed condition used in agreement
The problem of discussion.Do not illustrate how the number of leader cluster node is distributed ability and in whole network in present method for routing.Cause
This, it is likely that there is selected leader cluster node and concentrate on some region of phenomenon of network, can thus make the week of some nodes
Enclosing has a large amount of node around no any leader cluster node or certain leader cluster nodes, cause to influence whole network life
And efficiency of transmission, influence monitoring effect and quality.
Invention content
The purpose of the disclosure is in view of the deficiencies of the prior art, to improve whole network life, efficiency of transmission and monitoring effect
Fruit and quality.
To achieve the goals above, the disclosure provide a kind of wireless sensor network method for routing based on big data analysis and
Device, wherein the described method comprises the following steps：
Step 1, intiating radio sensing network；
Step 2, it is multiple cluster areas according to wireless sensor network routing algorithm sub-clustering by wireless sensor network, wherein each cluster area
Including at least one leader cluster node；
Step 3, the leader cluster node data packet of wireless sensor network communication in nearest 72 hours is read；
Step 4, the quantity for counting each leader cluster node data packet obtains each leader cluster node data transfer number；
Step 5, the leader cluster node for data transfer number being greater than or equal to high frequency threshold value is labeled as energy consumption exception leader cluster node；
Step 6, the sensor node of unmarked energy consumption exception is subjected to sub-clustering again according to wireless sensor network routing algorithm；
Step 7, the leader cluster node after sub-clustering again is calculated into transmission path according to greedy routing algorithm and updates routing table.
Further, in step 1, the intiating radio sensing network includes following sub-step：
Step 1.1, radio sensing network node is arranged at random in region to be monitored；
Step 1.2, each sensor node broadcasts oneself ID number and relative position information to wireless sense network；
Wherein, the ID number is the unique identification number of each radio sensing network node, and the relative position information is according to convergence
The arrival time for each radio sensing network node broadcast singal that node receives obtains.
Further, in step 2, the wireless sensor network routing algorithm includes at least LEACH algorithms, HEED algorithms
One of which.
Further, in step 3, the leader cluster node data packet of communication in described nearest 72 hours is within nearest 72 hours
Each leader cluster node be transferred to aggregation node, aggregation node is transmitted and stored at the data packet in base station server database,
In, the data packet includes at least transmission time.
Further, in step 4, the quantity of each leader cluster node data packet does not include the cluster area except leader cluster node
The data packet that outer node is forwarded via leader cluster node.
The present invention also provides a kind of wireless sensor network route device based on big data analysis, described device include：
Initialization unit is used for intiating radio sensing network；
Primary clustering unit is used to wireless sensor network be multiple cluster areas according to wireless sensor network routing algorithm sub-clustering,
In, each cluster area includes at least one leader cluster node；
Data packet acquiring unit, the leader cluster node data packet for reading wireless sensor network communication in nearest 72 hours；
Frequency statistics unit, the quantity for counting each leader cluster node data packet obtain each leader cluster node data transfer number；
Abnormal marking unit, the leader cluster node for data transfer number to be greater than or equal to high frequency threshold value are abnormal labeled as energy consumption
Leader cluster node；
Again sub-clustering unit, for carrying out the sensor node of unmarked energy consumption exception according to wireless sensor network routing algorithm
Again sub-clustering；
Routing update unit, for the leader cluster node after sub-clustering again to be calculated transmission path according to greedy routing algorithm and is updated
Routing table.
The disclosure has the beneficial effect that：The invention discloses a kind of wireless sensor network routing side based on big data analysis
Method can carry out actual motion test to the sensor newly arranged, avoid the high frequency of data transmission by the test of a period of time
Sub- sub-clustering region, can extend the working life of sensing network entirety, improve whole network life, efficiency of transmission and monitoring effect
Fruit and quality, than traditional HEED routing algorithm communication cost smallers after optimization.
Description of the drawings
By the way that the embodiment in conjunction with shown by attached drawing is described in detail, above-mentioned and other features of the disclosure will
More obvious, identical reference label indicates same or analogous element in disclosure attached drawing, it should be apparent that, in being described below
Attached drawing be only some embodiments of the present disclosure, for those of ordinary skill in the art, do not making the creative labor
Under the premise of, other drawings may also be obtained based on these drawings, in the accompanying drawings：
Fig. 1 show a kind of flow chart of wireless sensor network method for routing based on big data analysis of the disclosure；
Fig. 2 show a kind of wireless sensor network route device based on big data analysis of disclosure embodiment.
Specific implementation mode
The technique effect of the design of the disclosure, concrete structure and generation is carried out below with reference to embodiment and attached drawing clear
Chu, complete description, to be completely understood by the purpose, scheme and effect of the disclosure.It should be noted that the case where not conflicting
Under, the features in the embodiments and the embodiments of the present application can be combined with each other.
As shown in Figure 1 for according to a kind of flow of wireless sensor network method for routing based on big data analysis of the disclosure
Figure, a kind of wireless sensor network road based on big data analysis according to embodiment of the present disclosure is illustrated with reference to Fig. 1
By method.
The disclosure proposes a kind of wireless sensor network method for routing based on big data analysis, wherein the method includes
Following steps：
Step 1, intiating radio sensing network；
Step 2, it is multiple cluster areas according to wireless sensor network routing algorithm sub-clustering by wireless sensor network, wherein each cluster area
Including at least one leader cluster node；
Step 3, the leader cluster node data packet of wireless sensor network communication in nearest 72 hours is read；
Step 4, the quantity for counting each leader cluster node data packet obtains each leader cluster node data transfer number；
Step 5, the leader cluster node for data transfer number being greater than or equal to high frequency threshold value is labeled as energy consumption exception leader cluster node；
Step 6, the sensor node of unmarked energy consumption exception is subjected to sub-clustering again according to wireless sensor network routing algorithm；
Step 7, the leader cluster node after sub-clustering again is calculated into transmission path according to greedy routing algorithm and updates routing table.
Further, in step 1, the intiating radio sensing network includes following sub-step：
Step 1.1, radio sensing network node is arranged at random in region to be monitored；
Step 1.2, each sensor node broadcasts oneself ID number and relative position information to wireless sense network；
Wherein, the ID number is the unique identification number of each radio sensing network node, and the relative position information is according to convergence
The arrival time for each radio sensing network node broadcast singal that node receives obtains.
Further, in step 2, the wireless sensor network routing algorithm includes at least LEACH algorithms, HEED algorithms
One of which.
Further, the HEED cluster algorithms that the present embodiment uses include following steps：
L) initial phase：It includes the number for calculating neighbor node and the value of the AMRP of itself that each node, which calculates it, and
The initial probability as leader cluster node of setting, wherein AMRP is minimum average B configuration power in the cluster of HEED, is weighed for being used as
The standard of communication cost in cluster.
2) iteration phase：Each node is in the cycle of every wheel if it find that there is interim leader cluster node then to carry out around itself
It is corresponding to judge:If itself being also interim cluster head CHprob, and the value of the AMRP of itself is minimum, at this time the CHprob of oneself
=1, then announce that itself is final cluster head, otherwise carries out next round;If it oneself is interim cluster not have node to announce in neighbor node
Head then itself becomes interim cluster head according to certain probability.
Alternative cluster head status:When node cluster head ratio<When 1, node is alternative cluster head status, if finding to have later logical
Believe the smaller leader cluster node of cost, then it is common section that it, which changes state, and the candidate cluster head is added.
Final cluster head status:When node cluster head ratio=1, node is saved as final cluster head status, and to its neighbour
Point broadcast.
3) after iteration, if there is no other interim cluster heads or their AMRP all in the neighbours of interim cluster head
Smaller than itself, then the interim cluster head, which is closed, announces that itself is final cluster head (finalcluster head), if around other nodes
It itself is final leader cluster node not find that final leader cluster node is also announced.Otherwise the interim cluster of AMRP value minimums is added
Head.
Further, in step 3, the leader cluster node data packet of communication in described nearest 72 hours is within nearest 72 hours
Each leader cluster node be transferred to aggregation node, aggregation node is transmitted and stored at the data packet in base station server database,
In, the data packet includes at least transmission time.
Further, in step 4, the quantity of each leader cluster node data packet does not include the cluster area except leader cluster node
The data packet that outer node is forwarded via leader cluster node.
Further, the greedy routing algorithm is that node passes through positioning device or the survey by sending decreasing energy
Trial signal finds the neighbor node nearest away from oneself, then since the node farthest away from base station, using greedy algorithm come structure
A chain is made, this chain is exactly the cluster in greedy routing.Adjacent node on chain is shortest two neighbours of distance in relative position
Node is occupied, this assumes that these nodes are all static.Data transmission in greedy routing uses token (Token) mechanism：
Cluster head generates a token, is sent to one end of chain, notice frontier node starts transmission data, each of between cluster head and tip
After node receives data, first the data with oneself acquisition carry out fusion treatment, still further below a node forwarding, until data
It is transferred to cluster head, cluster head is started same process by the other end that token is sent to chain again after the data of side.Cluster receives
It is then forwarded to base station after the data come to both sides transmission.
Data in greedy routing are transmitted between shortest adjacent node, thus node is only sent with minimum power
Packet has also carried out data fusion in each intermediate node, reduces service traffics in this way, and the power consumption of whole network is also
Reduce.And in fact, result of study also indicates that, the life cycle using the sensor network of greedy routing is to use LEACH
Nearly 2 times of network.
Greedy routing transmits data using token mode, first in the side fused data of cluster, then in other side fused data,
Delay is but increased in this way.
The present invention also provides a kind of wireless sensor network route device based on big data analysis, as shown in Fig. 2, described
Device includes：
Initialization unit is used for intiating radio sensing network；
Primary clustering unit is used to wireless sensor network be multiple cluster areas according to wireless sensor network routing algorithm sub-clustering,
In, each cluster area includes at least one leader cluster node；
Data packet acquiring unit, the leader cluster node data packet for reading wireless sensor network communication in nearest 72 hours；
Frequency statistics unit, the quantity for counting each leader cluster node data packet obtain each leader cluster node data transfer number；
Abnormal marking unit, the leader cluster node for data transfer number to be greater than or equal to high frequency threshold value are abnormal labeled as energy consumption
Leader cluster node；
Again sub-clustering unit, for carrying out the sensor node of unmarked energy consumption exception according to wireless sensor network routing algorithm
Again sub-clustering；
Routing update unit, for the leader cluster node after sub-clustering again to be calculated transmission path according to greedy routing algorithm and is updated
Routing table.
The present embodiment is emulated using OPNET, is a networks simulation technology software package, it can accurately analyze complexity
The performance of network and behavior.Probe standard or that user specifies is can be inserted into from anywhere in network model, to adopt
Collect data and is counted.By pop one's head in obtained simulation data can with graphic software platform, digital form observation, be output to the
The software package of tripartite is gone.Usually there are three modules to form for its product structure, can provide a series of simulation model library to the user,
Telecommunications, space flight and aviation, military affairs, the system integration, university, counseling services, administration etc. are widely used.
In OPNET simulation models, set a sink node and multiple sense nodes, these sense nodes some
As source node, as relay node, some do not play a role temporarily in certain subtask then for some.The role of node be with
What the difference and target condition of task constantly converted.
In the process of sink nodes, I has carried out some settings to sink nodes.Wherein mainly it is accomplished that energy is supervised
Specific energy expenditure and energy reserve is arranged in visual function first, we are capable of the energy variation situation of dynamic simulator system.Section
The energy of point is also that can exhaust, we set an identifier and the record to some particular moments, these will
It plays a role when being managed to node.
Simulation observation has been carried out for the dump energy of node, gross energy and data delay.Wherein, dump energy, total energy
Amount and data delay are all local variables, they all reflect the state change of a node.
In our emulation, we set the total energy value and node in some special cases of each node
Energy consumption values.Specific setting is as follows：
#define RECV_CONTROL_ENERGY RX_ENERGY*CONTROL_MESSAGE ；
#define RECV_DATA_ENERGY RX_ENERGY*DATA_MESSAGE ；
#define TRANS_CONTROL_ENERGY TX_RF*CONTROL_MESSAGE ；
#define TRANS_DATA_ENERGY TX_RF*DATA_MESSAGE ；
Node as defined in the method for routing of the disclosure is when playing the part of different types of role, their Energy Expenditure Levels, these
Consumption figures is differentiated, and individual energy expenditure can be according to requiring specifically to be arranged.About energy transition problem, with reference to following language
Sentence.
Dump energy changes：
Energy_stathandle_ptr->remain_energy-=TX_RF*CONTROL_MESSAGE；
Energy_stathandle_ptr->remain_energy-=TX_RF*DATA_MESSAGE；
Energy_stathandle_ptr->remain_energy-=RECV_DATA_ENERGY；
Energy_stathandle_ptr->remain_energy-=RECV_CONTROL_ENERGY；
Gross energy changes：
total_energy-=TX_RF*CONTROL_MESSAGE；
total_energy-=TX_RF*DATA_MESSAGE；
total_energy-=RECV_DATA_ENERGY；
total_energy-=RECV_CONTROL_ENERGY；
Gross energy expenditure variation：
total_energy_consume+=TX_RF*CONTROL_MESSAGE；
total_energy_consume+=TX_RF*DATA_MESSAGE；
total_energy_consume+=RECV_DATA_ENERGY；
total_energy_consume+=RECV_CONTROL_MESSAGE_ENERGY；
Preferably, energy and delay are negative growths.Therefore the Routing Protocol that the disclosure proposes relatively is suitble to node lifetime requirement
Occasion relatively high, relatively low to delay requirement.
Under OPNET simulated environment, we are by establishing network range 200 × 200, number of network node 300, node with
Machine is distributed and wireless sensor network (WSN) emulation scene stillness, and it is 15 to transmit and receive maximum reference distance；Node uses
IEEE802.11MAC layer protocols, bandwidth 2Mb/s；Observer nodes one are located at the network scenarios upper right corner, and target area is in lower-left
Angle；Assume that target area node is handled by polymerization in simulation process, only there are one sensing nodes to return to matched data；When emulation
Between terminate for network lifetime.Because the communication energy consumption proportion of node is maximum, do not consider to perceive energy consumption.Node energy is set
For 14000 units, sends, receives grouping 5 units of consumption.Simulation result confidence level 0.95, remaining main simulation parameter packet
It includes：Observer nodes interest flood period 300s；280 packet packets are generated after the matching of sensing node interest；Packet packet
Data payload 1024Byte.
Using the performance ratio of the method for routing and traditional HEED method for routing using acquiescence minimum delay strategy of the disclosure
Compared with the life cycle of investigation sub-clustering type network and two class network of not sub-clustering type network.From the point of view of average delay, the routing side of the disclosure
Method can obtain optimum performance.Packet transmission rate is higher under various scenes, the reason is that node is static and network topology is stablized, and
2Mbs bandwidth is sufficient for service bandwidth needs.Never from the point of view of sub-clustering type network lifetime, using the method for routing ratio of the disclosure
Traditional HEED method for routing improves 50%, and then improves 540% after big data analysis processing；From sub-clustering type network lifetime
From the point of view of, 7% only is improved than traditional HEED method for routing using the method for routing of the disclosure, and then carried after big data analysis processing
It is high by 21%.Test result shows that algorithm can provide guaranteed differentiated services to two class business after improving, while can be in the whole network model
Fully efficiently using for interior realization energy resource is enclosed, realizes that network energy consumption is balanced.The performance boost of the method for routing of the disclosure compared with
It is small, the reason is that the most jete strategy of greedy algorithm is similar with the tradition minimum delay strategy of HEED method for routing, but takes into account and examine
Consider maximization path energy bottleneck and is still obviously improved performance.From agreement cost, algorithm after big data analysis is improved
There are some increases, the reason is that more complicated energy consumption marks the protocol integrated test system caused by establishment strategy and cluster head Exchange rings to open
Pin.
Particularly, a kind of wireless sensor network route device based on big data analysis of the present invention, can pass through one
The test of section time carries out actual motion routing test to the sensor newly arranged, avoids the sub- sub-clustering area of high frequency data transfer
Domain can extend the working life of sensing network entirety, than traditional HEED routing algorithm communication cost smallers after optimization.
Although the description of the disclosure is quite detailed and especially several embodiments are described, it is not
Any of these details or embodiment or any specific embodiments are intended to be limited to, but it is by reference to appended that should be considered as
Claim considers that the prior art provides the possibility explanation of broad sense for these claims, to effectively cover the disclosure
Preset range.In addition, the disclosure is described with inventor's foreseeable embodiment above, its purpose is to be provided with
Description, and those equivalent modifications that the disclosure can be still represented to the unsubstantiality change of the disclosure still unforeseen at present.
Claims (7)
1. a kind of wireless sensor network method for routing based on big data analysis, which is characterized in that the method for routing include with
Lower step：
Step 1, intiating radio sensing network；
Step 2, it is multiple cluster areas according to wireless sensor network routing algorithm sub-clustering by wireless sensor network, wherein each cluster area
Including at least one leader cluster node；
Step 3, the leader cluster node data packet of wireless sensor network communication in nearest 72 hours is read；
Step 4, the quantity for counting each leader cluster node data packet obtains each leader cluster node data transfer number；
Step 5, the leader cluster node for data transfer number being greater than or equal to high frequency threshold value is labeled as energy consumption exception leader cluster node；
Step 6, the sensor node of unmarked energy consumption exception is subjected to sub-clustering again according to wireless sensor network routing algorithm；
Step 7, the leader cluster node after sub-clustering again is calculated into transmission path according to greedy routing algorithm and updates routing table.
2. a kind of wireless sensor network method for routing based on big data analysis according to claim 1, which is characterized in that
In step 1, the intiating radio sensing network includes following sub-step：
Step 1.1, radio sensing network node is arranged at random in region to be monitored；
Step 1.2, each sensor node broadcasts oneself ID number and relative position information to wireless sense network；
Wherein, the arrival for each radio sensing network node broadcast singal that the relative position information is received according to aggregation node
Time obtains.
3. a kind of wireless sensor network method for routing based on big data analysis according to claim 1, which is characterized in that
In step 2, the wireless sensor network routing algorithm includes at least LEACH algorithms, HEED algorithm one of which.
4. a kind of wireless sensor network method for routing based on big data analysis according to claim 1, which is characterized in that
In step 3, the leader cluster node data packet of communication in described nearest 72 hours is each leader cluster node transmission within nearest 72 hours
To aggregation node, aggregation node is transmitted and stored at the data packet in base station server database, wherein the data packet is at least
Including transmission time.
5. a kind of wireless sensor network method for routing based on big data analysis according to claim 1, which is characterized in that
In step 4, the quantity of each leader cluster node data packet does not include the node in addition to leader cluster node in the cluster area via cluster head
The data packet of node forwarding.
6. a kind of wireless sensor network method for routing based on big data analysis according to claim 1, which is characterized in that
In steps of 5, the high frequency threshold value is：。
7. a kind of wireless sensor network route device based on big data analysis, which is characterized in that described device includes：
Initialization unit is used for intiating radio sensing network；
Primary clustering unit is used to wireless sensor network be multiple cluster areas according to wireless sensor network routing algorithm sub-clustering,
In, each cluster area includes at least one leader cluster node；
Data packet acquiring unit, the leader cluster node data packet for reading wireless sensor network communication in nearest 72 hours；
Frequency statistics unit, the quantity for counting each leader cluster node data packet obtain each leader cluster node data transfer number；
Abnormal marking unit, the leader cluster node for data transfer number to be greater than or equal to high frequency threshold value are abnormal labeled as energy consumption
Leader cluster node；
Again sub-clustering unit, for carrying out the sensor node of unmarked energy consumption exception according to wireless sensor network routing algorithm
Again sub-clustering；
Routing update unit, for the leader cluster node after sub-clustering again to be calculated transmission path according to greedy routing algorithm and is updated
Routing table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810452658.4A CN108289317B (en) | 2018-05-13 | 2018-05-13 | Wireless sensor network routing method and device based on big data analysis |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810452658.4A CN108289317B (en) | 2018-05-13 | 2018-05-13 | Wireless sensor network routing method and device based on big data analysis |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108289317A true CN108289317A (en) | 2018-07-17 |
| CN108289317B CN108289317B (en) | 2020-05-22 |
Family
ID=62834763
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810452658.4A Active CN108289317B (en) | 2018-05-13 | 2018-05-13 | Wireless sensor network routing method and device based on big data analysis |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108289317B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109253531A (en) * | 2018-09-06 | 2019-01-22 | 江苏佳源科技有限公司 | Air-conditioning and lighting energy saving control system |
| CN113271347A (en) * | 2021-04-29 | 2021-08-17 | 广东海洋大学 | Distributed storage method and system for acquiring complex marine environment data |
| CN115884108A (en) * | 2022-11-29 | 2023-03-31 | 杭州雅赫网络科技有限公司 | Method for improving big data transmission stability |
| CN116582910A (en) * | 2023-06-30 | 2023-08-11 | 中国通信建设第三工程局有限公司 | Digital information transmission method and system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103916942A (en) * | 2014-04-04 | 2014-07-09 | 安徽工程大学 | LEACH protocol improvement method capable of lowering energy consumption |
| KR101658736B1 (en) * | 2015-09-07 | 2016-09-22 | 성균관대학교산학협력단 | Wsn clustering mehtod using of cluster tree structure with low energy loss |
| CN106658642A (en) * | 2016-12-29 | 2017-05-10 | 长春理工大学 | Energy heterogeneous wireless sensor network clustering method and system |
| CN106973419A (en) * | 2017-03-03 | 2017-07-21 | 武汉工程大学 | A kind of innovatory algorithm of LEACH agreements |
-
2018
- 2018-05-13 CN CN201810452658.4A patent/CN108289317B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103916942A (en) * | 2014-04-04 | 2014-07-09 | 安徽工程大学 | LEACH protocol improvement method capable of lowering energy consumption |
| KR101658736B1 (en) * | 2015-09-07 | 2016-09-22 | 성균관대학교산학협력단 | Wsn clustering mehtod using of cluster tree structure with low energy loss |
| CN106658642A (en) * | 2016-12-29 | 2017-05-10 | 长春理工大学 | Energy heterogeneous wireless sensor network clustering method and system |
| CN106973419A (en) * | 2017-03-03 | 2017-07-21 | 武汉工程大学 | A kind of innovatory algorithm of LEACH agreements |
Non-Patent Citations (1)
| Title |
|---|
| 王选政: "基于QoS的无线传感器网络路由协议的研究", 《中国优秀硕士论文全文数据库》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109253531A (en) * | 2018-09-06 | 2019-01-22 | 江苏佳源科技有限公司 | Air-conditioning and lighting energy saving control system |
| CN113271347A (en) * | 2021-04-29 | 2021-08-17 | 广东海洋大学 | Distributed storage method and system for acquiring complex marine environment data |
| CN115884108A (en) * | 2022-11-29 | 2023-03-31 | 杭州雅赫网络科技有限公司 | Method for improving big data transmission stability |
| CN116582910A (en) * | 2023-06-30 | 2023-08-11 | 中国通信建设第三工程局有限公司 | Digital information transmission method and system |
| CN116582910B (en) * | 2023-06-30 | 2024-01-23 | 中国通信建设第三工程局有限公司 | Digital information transmission method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108289317B (en) | 2020-05-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108289317A (en) | A kind of wireless sensor network method for routing and device based on big data analysis | |
| Xinhua et al. | Performance comparison of LEACH and LEACH-C protocols by NS2 | |
| Sohrabi et al. | Performance of a novel self-organization protocol for wireless ad-hoc sensor networks | |
| AU2018374839B2 (en) | Limiting forwarding of multicast communications | |
| US11290295B2 (en) | Multi-network operation with member node for multicast groups | |
| US10419231B2 (en) | Multi-network operation for multicast groups | |
| CN104185264B (en) | The method and apparatus of uplink power control | |
| CN107465622B (en) | Method for realizing network topology discovery by utilizing LLDP | |
| CN109842868A (en) | A kind of frame aggregation, network settings frame sending method and equipment | |
| Abedin et al. | An interoperable IP based WSN for smart irrigation system | |
| Chi et al. | Implementation and study of a greenhouse environment surveillance system based on wireless sensor network | |
| Hoang et al. | An energy driven architecture for wireless sensor networks | |
| Huang et al. | An enhanced scheduling framework for elephant flows in SDN-based data center networks | |
| Dasgupta et al. | Congestion avoidance topology in wireless sensor network using Karnaugh map | |
| Cao Minh et al. | DISON: a self-organizing network management framework for wireless sensor networks | |
| Ali | Realization of a robust fog-based green VANET infrastructure | |
| Torres et al. | Improving lifetime and availability for ad hoc networks to emergency and rescue scenarios | |
| Dragana et al. | Evaluation of cluster formation algorithm in large scale wireless sensor network | |
| Laner et al. | M2M traffic and models | |
| Selvakumar et al. | Contrast for QOS based clustered energy efficient protocol with PSO and multi-hop gateways in wireless sensor network | |
| Mishra et al. | DTSS and clustering for energy conservation in wireless sensor network | |
| Chen et al. | Extending the RPL routing protocol to agricultural low power and lossy networks (A-LLNs) | |
| Ben-Othman et al. | Performance evaluation of a medium access control protocol for wireless sensor networks using petri nets | |
| Hamiane et al. | Improvement of crankshaft MAC protocol for wireless sensor networks: a simulation study. | |
| Sikander et al. | Comparison of clustering routing protocols for Wireless Sensor Networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |