CN104320822A - Method for positioning boundary region of poisonous gas in industrial factory district - Google Patents
Method for positioning boundary region of poisonous gas in industrial factory district Download PDFInfo
- Publication number
- CN104320822A CN104320822A CN201410588333.0A CN201410588333A CN104320822A CN 104320822 A CN104320822 A CN 104320822A CN 201410588333 A CN201410588333 A CN 201410588333A CN 104320822 A CN104320822 A CN 104320822A
- Authority
- CN
- China
- Prior art keywords
- node
- boundary
- nodes
- information
- toxic gas
- 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.)
- Pending
Links
Classifications
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/021—Services related to particular areas, e.g. point of interest [POI] services, venue services or geofences
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a method for positioning the boundary region of poisonous gas in an industrial factory district. The method comprises the following steps that (1) all nodes inside the poisonous gas and all nodes outside the poisonous gas are distinguished; (2) each sensor node broadcasts information to all neighbor nodes within a hop of the corresponding sensor node; (3) inner boundary nodes and the inner boundary are positioned; (4) outer boundary nodes and the outer boundary are positioned; a boundary Face region area is positioned; (6) the boundary region is positioned. According to the method, the inner boundary nodes and the outer boundary nodes of the poisonous gas can be positioned, and the boundary region area of the poisonous gas can also be accurately positioned.
Description
Technical field
The invention belongs to industrial wireless sensor network field, concrete invention relates to a kind of industrial working toxic gas borderline region localization method, by the boundary areas zone location of toxic gas out and report, and improves the positioning precision of toxic gas borderline region.
Background technology
In recent years; along with development and the maturation of sensor manufacturing techniques and wireless network communication technique; allow miniaturization, high integrated and multi-functional sensor node use become a reality; usually can along with the various poisonous chemical gas of appearance in the production process of large petrochemical plant; when these toxic gases reach finite concentration; the life security of front man and the direct heavy economic losses in units of hundred million yuan can be threatened, so be vital to the detection of toxic gas of leaking and location.And gas has clear and definite border unlike liquid, the required topmost problem solved of gas, except accurately detecting gas, also will utilize sensor network to determine the approximate bounds region of gas, and improve borderline region accuracy by series of algorithms.
The domestic and international research papers for boundary alignment is as follows at present:
2008, the people such as Chang propose in " CODA:A Continuous Objet Detection and Tracking Algorithm for Wireless Ad Hoc Sensor Networks " allow each sensor node detect in sensing range and the CODA of tracked mobile target tactful, the border sensor proposing successive objective is determined by bunch head in static bunch group, instead of to be determined after a large amount of exchanges data by multiple transducer, communication overhead and energy loss can be reduced.But CODA algorithm is very high at clustering architecture in earlier stage and a bunch maintenance cost, and it is the algorithm based on convex closure, is not especially accurately and reliably when some detect recessed successive objective.
2011, the people such as Luan propose the RCOT algorithm of continuous object tracing in " Continuous Object Tracing in Wireless Sensor Networks ", RCOT is first theoretical algorithm adopting ring network structure to carry out the border detected with the continuous object of monitoring, and by adopting the size of compression report information to reduce energy loss.But his report is the inner boundary node of toxic gas, instead of the region that the border of toxic gas is passed.
2012, the people such as Kim proposed and carry out detecting and tracking locating gas target by the scheme of pixel distribution imaging in similar TV play in " Efficient Continuous Object Tracking with Virtual Grid in Wireless Sensor Networks ".Although the region area that report toxic gas border is passed, but the network model based on virtual grid of the method hypothesis is too idealized, in many practical applications, such as in large-scale petrochemical factory, network arrangement based on grid is difficult to realize, and the density that arranges of virtual grid in the program directly has influence on the precision of gas border detection.
Therefore, about problem ubiquitous in the document of boundary alignment be at present:
Mostly all just detected inner boundary node about continuous object localization algorithm, instead of the region at target object place, this is skimble-skamble for gas.Or some model is too idealized, be difficult in reality realize.
Summary of the invention
The object of the invention is the weak point of location algorithm when locating in order to solve toxic gas in large scale industry plant area at present, method of the present invention not only can be tested with poisonous gas, and comparatively accurately can orient the borderline region at toxic gas place.
In order to achieve the above object, the invention provides the toxic gas borderline region localization method based on planarizartion algorithm.Owing to being accidental distributed layout at on-site wireless sensor node, to be effectively communicated with and can be energy-efficient in order to allow each node, the present invention have selected and makes whole network-in-dialing with planarizartion algorithm.
Technical scheme of the present invention is as follows:
A kind of industrial working toxic gas borderline region localization method, comprises the steps:
(1), each sensor node detect self whether sense toxic gas, distinguishing is all nodes in toxic gas and all nodes outside toxic gas;
(2), each sensor node to self one jump in all neighbor node broadcasts, the information data of described node broadcasts at least comprises three kinds: the id information of node, and whether the coordinate information of node and node sense the information of toxic gas;
(3), inner boundary node locating and inner boundary location
In all toxic gas interior nodes, according to the information whether sensing toxic gas received in the information of neighbor node in a jumping communication range, judge:
3a, suppose that all neighbor nodes of a node all sense toxic gas, then this node is common toxic gas interior nodes, rejects in the calculation;
3b, suppose all neighbor nodes that a node receives information in have at least a node not sense toxic gas, so this node is then inner boundary node, and records corresponding id information and coordinate information;
3c, according to the id information of step 3b record in boundary node location and coordinate information, make inner boundary node form a unique annular channels, be called inner boundary;
(4), external boundary node locating and external boundary location
In node outside all toxic gases, according to the information whether sensing toxic gas received in the packets of information of neighbor node in a jumping communication range, judge:
4a, suppose that all neighbor nodes of a node all do not sense toxic gas, then this node is common toxic gas exterior node, rejects in the calculation;
4b, suppose all neighbor nodes that a node receives information in have at least a node to sense toxic gas, so this node is then external boundary node, and records corresponding id information and coordinate information;
4c, id information according to step 4b record in boundary node location, coordinate information and store the overall routing iinformation that whole network node is in a base station communicated with, make external boundary node form a unique annular channels, be called external boundary;
(5), border Face surface area location
According to the overall routing iinformation that nodal information and the storage whole network node in a base station of inner and outer boundary are communicated with, two adjacent and connected inner boundary nodes and the external boundary node corresponding to them look for the shortest path be connected with each other by overall routing iinformation;
Suppose that two inner boundary nodes all only have an external boundary node, so by the shortest path that overall routing iinformation finds external boundary node to be connected, the surrounded region that is connected with inner and outer boundary node is afterwards just border Face surface area;
Suppose that two inner boundary nodes have the external boundary node of more than 2, so calculated by overall routing iinformation, an external boundary node of one of them inner boundary node looks in the shortest path of the external boundary node of another inner boundary node other external boundary nodes that there is this inner boundary node, the external boundary node before so replacing it with the external boundary node in path; By that analogy, do not comprise other external boundary node in the shortest path that 2 external boundary nodes are connected, then the region that shortest path and inner and outer boundary node surround is border Face surface area;
(6), borderline region location
According to the information of the inner boundary determined and external boundary, determine borderline region, the zone line that inner boundary surrounds with external boundary is toxic gas borderline region.
In above-mentioned steps 3c, inner boundary node forms the method for a unique annular channels and is:
Each inner boundary node is inevitable can be connected and only can connect other 2 inner boundary nodes, according to known coordinate information, supposes that the coordinate of node I is (χ
i, y
i), the coordinate of other nodes is J (χ
j, y
j), calculate I node with other nodal distances
get and be connected apart from minimum 2 nodes, get arbitrarily afterwards a direction the like carry out recurrence selection, until get back to first node, make all inner boundary nodes form a unique ring, be called inner boundary.
In upper described step 4c, inner boundary node forms the method for a unique annular channels and is:
Suppose that two adjacent external boundary nodes need to be connected, according to id information, coordinate information and the overall routing iinformation by base station, first judge whether in a hop neighbor communication range of sensor node, if it is be directly connected, if not, then judge again two nodes be connected shortest path whether by inner boundary node, if it is this path is rejected, select the shortest path except passing through inner boundary node, be access path if not then selecting it, the like make all external boundary nodes form a unique annular channels, be called external boundary.
The inner and outer boundary node of toxic gas region when the present invention can not only orient Leakage Gas in industrial working accurately, and accurately can orient the boundary areas region at toxic gas place.
Accompanying drawing explanation
Fig. 1 is process analysis schematic diagram of the present invention;
Fig. 2 is system features schematic diagram of the present invention;
Fig. 3 is for utilizing Gas infomation detection with differentiating inner and outer boundary node schematic diagram;
Fig. 4 is the schematic diagram utilizing inner boundary node ID information, coordinate information determination inner boundary;
Fig. 5 is the schematic diagram utilizing external boundary node ID information, coordinate information and overall routing iinformation determination external boundary;
Fig. 6 is the schematic diagram utilizing inner and outer boundary node to determine border Face surface area;
Fig. 7 is for defining poisonous gas borderline region schematic diagram based on inner boundary with external boundary;
In figure ● represent the node sensing gas; Zero represents the node not sensing gas;
represent inner and outer boundary;
represent gas group.
Embodiment
Below in conjunction with accompanying drawing, the invention will be further described.Following examples only for technical scheme of the present invention is clearly described, and can not limit the scope of the invention with this.
As shown in Figure 1, once find that there is poisonous gas, first sensor node is screened, judge to distinguish in gas with all nodes outside gas; Then screen in all nodes in gas, select inner boundary node; Screen in all nodes outside gas, select external boundary node; Then form inner and outer boundary according to inner and outer boundary node, then define the borderline region of poisonous gas according to inner and outer boundary.
As shown in Figure 2, random arranged sensor node A to U in the region of one piece of toxic gas and region, each node has respective ID, the information such as coordinate, one jumps between communication range interior nodes by broadcast mutually, the information of all nodes in node one hop neighbor can be known, information in conjunction with node itself can judge that node A to node K is the external boundary node of gas, node L to node S is the inner boundary node of gas, and be all the node sensing gas because node T follows in their hop neighbor of node U, therefore they are not inner boundary nodes, then inner and outer boundary is determined according to the ID of boundary node and coordinate information, then according to inner and outer boundary determination borderline region.
As shown in Figure 3, the node of A-V is arranged in region, by scheming easily to see that wherein node M-V senses toxic gas, therefore be gas interior node, more such as, by carrying out broadcast transmission packet between a hop neighbor node, node O, it sends data to node H, I, J, V, P, learn that node H, I, J do not sense toxic gas, meet and have at least a node not sense the condition of toxic gas in a hop neighbor node, therefore node O is inner boundary node.And node V, its hop neighbor node O, P, W, R, U, N sense toxic gas, do not meet inner boundary node condition, therefore it is gas interior nodes, rejects the information of this node in calculating afterwards.By that analogy, can to obtain node be M, N, P, Q, R, S, T is also all inner boundary node, and records their information.Node A-L does not sense toxic gas, therefore be gas exterior node, again by carrying out broadcast transmission data between a hop neighbor node of node, such as node C, it sends data to Node B, D, E, R, S, learn node R, S senses toxic gas, meet and have at least a node to sense the condition of toxic gas in a hop neighbor node, therefore node C is external boundary node.And node D, its a hop neighbor Node B, C, E do not sense toxic gas, do not meet the condition of external boundary node, and therefore node D is gas exterior node.By that analogy, we can obtain node A, B, C, E, F, G, H, I, J, K, L is all external boundary node, and records their information.
As shown in Figure 4, by determining the information of inner boundary node, an inner boundary node energy can be seen and only can be connected with 2 neighbor nodes, first obtaining their ID and coordinate information, random selecting node such as node T, supposes that its coordinate is (χ
i, y
i) then set the coordinate of other nodes as (χ
j, y
j), by calculating their distance L
choose two to be connected apart from minimum node, can find out for node S and node M in figure, then a random selecting node be connected such as node M is same as the calculating of node T, another except node T looking for M node is connected apart from minimum neighbor node, when the minimum node of the node finally found by that analogy distance except node is before node T, the ring LMNOPQRS now formed is inner boundary.
As shown in Figure 5, by determining the information of external boundary node, in conjunction with the overall routing iinformation that the whole network node stored in a base station is communicated with, first judge whether two external boundary nodes jump in communication range respective one, such as Node B, C are the neighbor nodes of jumping in communication range, and path BC is the shortest path path that can directly be communicated with, then direct connected node BC.But whether need to be connected at the respective one node adjacent node of jumping in communication range, also need to judge that whether passage path is through inner boundary node, such as suppose node F, I is 2 connected external boundary nodes, but but do not jump in communication range one, then need the shortest path being looked for connected node FI by overall routing iinformation, can see that path FPOI is the shortest path, but this path have passed through inner boundary node P with O, therefore get rid of, look for an other shortest path path without inner boundary node, by figure, we can see by node G, the path FGHI of H is the shortest passage path, a then part for connected node FGHI external boundary the most, by that analogy, external boundary both can be defined as the ring through ABCEFGHIJKL node.
As shown in Figure 6, by the adjacent inner boundary node SR determined, S has 2 external boundary node AK, R has two external boundary Node B C, suppose that the external boundary C node from R node looks for the shortest path of the external boundary node of S node, can see that Node B is on the shortest path of C to AK by figure, therefore C is replaced by Node B, then Node B finds the external boundary node A of inner boundary node S to be the shortest path path BA be communicated with, connect BR afterwards, SR, SA and shortest path BA, the surface area ABRS that they surround is border Face surface area.
As shown in Figure 7, by the external boundary ABCDEFGHIJK that determined and inner boundary LMNOPQRS, the zone line that these two annulars surround is the borderline region that we need to obtain toxic gas.
The above is only the preferred embodiment of the present invention; it should be pointed out that for those skilled in the art, under the prerequisite not departing from the technology of the present invention principle; can also make some improvement and distortion, these improve and distortion also should be considered as protection scope of the present invention.
Claims (3)
1. an industrial working toxic gas borderline region localization method, is characterized in that comprising the steps:
(1), each sensor node detect self whether sense toxic gas, distinguish all nodes in toxic gas and all nodes outside toxic gas;
(2), each sensor node all neighbor node broadcasts within the scope of self one-hop propagation, the information data of described node broadcasts at least comprises three kinds: the id information of node, and whether the coordinate information of node and node sense the information of toxic gas;
(3), inner boundary node locating and inner boundary location
Node in all toxic gases, according to the information whether sensing toxic gas received in the information of neighbor node within the scope of a jumping, judges:
3a, suppose that all neighbor nodes of a node all sense toxic gas, then this node is common toxic gas interior nodes, rejects in the calculation;
3b, suppose all neighbor nodes that a node receives information in have at least a node not sense toxic gas, so this node is then inner boundary node, and records corresponding id information and coordinate information;
3c, according to the id information of step 3b record in boundary node location and coordinate information, make inner boundary node form a unique annular channels, be called inner boundary;
(4), external boundary node locating and external boundary location
In node outside all toxic gases, according to the information whether sensing toxic gas received in the packets of information of neighbor node in a jumping broadcasting area, judge:
4a, suppose that all neighbor nodes of a node all do not sense toxic gas, then this node is common toxic gas exterior node, rejects in the calculation;
4b, suppose all neighbor nodes that a node receives information in have at least a node to sense toxic gas, so this node is then external boundary node, and records corresponding id information and coordinate information;
4c, id information according to step 4b record in boundary node location, coordinate information and store the overall routing iinformation that whole network node is in a base station communicated with, make external boundary node form a unique annular channels, be called external boundary;
(5), border Face surface area location
According to the overall routing iinformation that nodal information and the storage whole network node in a base station of inner and outer boundary are communicated with, two adjacent and connected inner boundary nodes and the external boundary node corresponding to them look for the shortest path be connected with each other by overall routing iinformation;
Suppose that two inner boundary nodes all only have an external boundary node, so by the shortest path that overall routing iinformation finds external boundary node to be connected, the surrounded region that is connected with inner and outer boundary node is afterwards just border Face surface area;
Suppose that two inner boundary nodes have the external boundary node of more than 2, so calculated by overall routing iinformation, an external boundary node of one of them inner boundary node looks in the shortest path of the external boundary node of another inner boundary node other external boundary nodes that there is this inner boundary node, the external boundary node before so replacing it with the external boundary node in path; By that analogy, do not comprise other external boundary node in the shortest path that 2 external boundary nodes are connected, then the region that shortest path and inner and outer boundary node surround is border Face surface area;
(6), borderline region location
According to the information of the inner boundary determined and external boundary, determine borderline region, the zone line that inner boundary surrounds with external boundary is toxic gas borderline region.
2. industrial working according to claim 1 toxic gas borderline region localization method, is characterized in that the method that inner boundary node in described step 3c forms a unique annular channels is:
Each inner boundary node is inevitable can be connected and only can connect other 2 inner boundary nodes, according to known coordinate information, supposes that the coordinate of node I is (χ
i, y
i), the coordinate of other nodes is J (χ
j, y
j), calculate I node with other nodal distances
get and be connected apart from minimum 2 nodes, get arbitrarily afterwards a direction the like carry out recurrence selection, until get back to first node, make all inner boundary nodes form a unique ring, be called inner boundary.
3. industrial working according to claim 1 toxic gas borderline region localization method, is characterized in that the method that inner boundary node in described step 4c forms a unique annular channels is:
Suppose that two adjacent external boundary nodes need to be connected, according to id information, the overall routing iinformation that coordinate information and storage whole network node is in a base station communicated with, first judge whether in a hop neighbor communication range of sensor node, if it is be directly connected, if not, then judge again two nodes be connected shortest path whether by inner boundary node, if it is this path is rejected, select the shortest path except passing through inner boundary node, be access path if not then selecting it, the like make all external boundary nodes form a unique annular channels, be called external boundary.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410588333.0A CN104320822A (en) | 2014-10-27 | 2014-10-27 | Method for positioning boundary region of poisonous gas in industrial factory district |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410588333.0A CN104320822A (en) | 2014-10-27 | 2014-10-27 | Method for positioning boundary region of poisonous gas in industrial factory district |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104320822A true CN104320822A (en) | 2015-01-28 |
Family
ID=52375973
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410588333.0A Pending CN104320822A (en) | 2014-10-27 | 2014-10-27 | Method for positioning boundary region of poisonous gas in industrial factory district |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104320822A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104931202A (en) * | 2015-06-03 | 2015-09-23 | 广东石油化工学院 | Gas leakage internal boundary positioning algorithm |
| CN105072626A (en) * | 2015-07-16 | 2015-11-18 | 广东石油化工学院 | Distributed algorithm for calculating failure coverage area |
| CN105554835A (en) * | 2015-12-09 | 2016-05-04 | 河海大学常州校区 | Toxic gas tracking method based on virtual node migration in wireless sensor network |
| CN105682169A (en) * | 2016-03-16 | 2016-06-15 | 广东石油化工学院 | Sleeping scheduling method for detecting toxic gas in industrial sensor network |
| CN106793071A (en) * | 2016-12-05 | 2017-05-31 | 广东石油化工学院 | A kind of industrial sensor network is based on the poison gas boundary detection method of node locating |
| CN114973443A (en) * | 2022-05-19 | 2022-08-30 | 杭州中威电子股份有限公司 | Complex gas environment inspection system and method based on inspection robot |
| CN116347377A (en) * | 2023-02-28 | 2023-06-27 | 南京农业大学 | Pest dense area positioning method and system based on Internet of things of solar insecticidal lamps |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1988509A (en) * | 2006-12-07 | 2007-06-27 | 中国科学院计算技术研究所 | Method for forming fine convergence gradient in sensor network |
| CN101021836A (en) * | 2006-02-15 | 2007-08-22 | 国际商业机器公司 | Information processing system and method for dynamic boundary mapping |
| US20100277284A1 (en) * | 2009-05-01 | 2010-11-04 | Brown Jonathan E | Data separation in high density environments |
| CN103929717A (en) * | 2014-04-29 | 2014-07-16 | 哈尔滨工程大学 | Wireless sensor network positioning method based on weight Voronoi diagrams |
-
2014
- 2014-10-27 CN CN201410588333.0A patent/CN104320822A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101021836A (en) * | 2006-02-15 | 2007-08-22 | 国际商业机器公司 | Information processing system and method for dynamic boundary mapping |
| CN1988509A (en) * | 2006-12-07 | 2007-06-27 | 中国科学院计算技术研究所 | Method for forming fine convergence gradient in sensor network |
| US20100277284A1 (en) * | 2009-05-01 | 2010-11-04 | Brown Jonathan E | Data separation in high density environments |
| CN103929717A (en) * | 2014-04-29 | 2014-07-16 | 哈尔滨工程大学 | Wireless sensor network positioning method based on weight Voronoi diagrams |
Non-Patent Citations (2)
| Title |
|---|
| GONG-XING WU等: "Boundary Recognition by Topological Methods in Wireless Sensor Networks", 《IEEE CONFERENCE ANTHOLOGY》 * |
| KAI LI等: "Boundary Recognition in Sensor Networks by Building Relative Contours", 《2009 IEEE 34TH CONFERENCE ON LOCAL COMPUTER NETWORKS (LCN 2009)》 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104931202A (en) * | 2015-06-03 | 2015-09-23 | 广东石油化工学院 | Gas leakage internal boundary positioning algorithm |
| CN105072626A (en) * | 2015-07-16 | 2015-11-18 | 广东石油化工学院 | Distributed algorithm for calculating failure coverage area |
| CN105554835A (en) * | 2015-12-09 | 2016-05-04 | 河海大学常州校区 | Toxic gas tracking method based on virtual node migration in wireless sensor network |
| CN105554835B (en) * | 2015-12-09 | 2019-02-15 | 河海大学常州校区 | Based on the toxic gas method for tracing of dummy node migration in wireless sensor network |
| CN105682169A (en) * | 2016-03-16 | 2016-06-15 | 广东石油化工学院 | Sleeping scheduling method for detecting toxic gas in industrial sensor network |
| CN106793071A (en) * | 2016-12-05 | 2017-05-31 | 广东石油化工学院 | A kind of industrial sensor network is based on the poison gas boundary detection method of node locating |
| CN106793071B (en) * | 2016-12-05 | 2020-04-03 | 广东石油化工学院 | Node positioning-based toxic gas boundary detection method for industrial sensor network |
| CN114973443A (en) * | 2022-05-19 | 2022-08-30 | 杭州中威电子股份有限公司 | Complex gas environment inspection system and method based on inspection robot |
| CN114973443B (en) * | 2022-05-19 | 2024-04-12 | 杭州中威电子股份有限公司 | Inspection robot-based complex gas environment inspection system and method thereof |
| CN116347377A (en) * | 2023-02-28 | 2023-06-27 | 南京农业大学 | Pest dense area positioning method and system based on Internet of things of solar insecticidal lamps |
| CN116347377B (en) * | 2023-02-28 | 2024-02-02 | 南京农业大学 | Pest dense area positioning method and system based on Internet of things of solar insecticidal lamps |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104320822A (en) | Method for positioning boundary region of poisonous gas in industrial factory district | |
| Shahzad et al. | DV-maxHop: A fast and accurate range-free localization algorithm for anisotropic wireless networks | |
| Yuan et al. | Data density correlation degree clustering method for data aggregation in WSN | |
| US20120036242A1 (en) | Method and sensor network for attribute selection for an event recognition | |
| Beghdad et al. | Boundary and holes recognition in wireless sensor networks | |
| Wang et al. | A novel node placement for long belt coverage in wireless networks | |
| CN104796916A (en) | Establishment method of wireless sensor network high barrier coverage for target detection | |
| CN110234145A (en) | The improved wireless sensor network locating method of DV-HOP based on reliable beaconing nodes | |
| Xiao et al. | A critical line based boundary surveillance strategy in wireless sensor networks | |
| Liu et al. | Diffusion distance-based predictive tracking for continuous objects in industrial wireless sensor networks | |
| Guo et al. | Enhancing barrier coverage with β quality of monitoring in wireless camera sensor networks | |
| CN103546966B (en) | A kind of node positioning method of the wireless senser based on wild environment | |
| CN105050099A (en) | Method for identifying boundary nodes in distributed wireless sensor network | |
| Cabero et al. | Indoor people tracking based on dynamic weighted multidimensional scaling | |
| CN104822152A (en) | Target-detection-oriented construction method for weak barrier coverage of wireless sensor network | |
| CN104656059B (en) | A kind of improved DF and location method | |
| CN105072631A (en) | Distributed wireless sensor network coverage hole identification method | |
| Chehri et al. | Geo-location with wireless sensor networks using non-linear optimization | |
| CN105472630B (en) | The wireless sensor network fringe node recognition methods differentiated based on triangle | |
| Lei et al. | Energy-efficient boundary detection of continuous objects in internet of things sensing networks | |
| Li et al. | Power-efficient node localization algorithm in wireless sensor networks | |
| Meng et al. | EARP: extended area multihop node localization algorithm for anisotropic wireless sensor networks | |
| Chen et al. | A node division location detection scheme for chain‐type wireless sensor networks | |
| CN105764028A (en) | Wireless sensor network node positioning method | |
| KR101486462B1 (en) | Sensor Positioning System and Scheme Considering Holes in Wireless Sensor Networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20150128 |