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 PDF

Info

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
Application number
CN201410588333.0A
Other languages
Chinese (zh)
Inventor
舒磊
李浩波
周长兵
张峰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangdong University of Petrochemical Technology
Original Assignee
Guangdong University of Petrochemical Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Guangdong University of Petrochemical Technology filed Critical Guangdong University of Petrochemical Technology
Priority to CN201410588333.0A priority Critical patent/CN104320822A/en
Publication of CN104320822A publication Critical patent/CN104320822A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/24Connectivity information management, e.g. connectivity discovery or connectivity update
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W4/00Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/02Services making use of location information
    • H04W4/021Services related to particular areas, e.g. point of interest [POI] services, venue services or geofences
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/18Self-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

本发明公开了一种工业厂区有毒气体边界区域定位方法,包括如下步骤:(1)区分出有毒气体内的所有节点以及有毒气体外的所有节点;(2)每个传感器节点向自身一跳内所有邻居节点广播消息;(3)内边界节点定位以及内边界定位;(4)外边界节点定位以及外边界定位;(5)边界Face面积区域定位;(6)边界区域定位。本发明不仅能够定位出有毒气体的内外边界节点,而且还能精确的定位出有毒气体所在的边界区域面积。

The invention discloses a method for locating a toxic gas boundary area in an industrial factory area, which includes the following steps: (1) distinguishing all nodes inside the toxic gas and all nodes outside the toxic gas; (2) each sensor node hops to itself All neighbor nodes broadcast messages; (3) Inner boundary node location and inner boundary location; (4) Outer boundary node location and outer boundary location; (5) Border Face area location; (6) Border area location. The invention can not only locate the inner and outer boundary nodes of the toxic gas, but also accurately locate the area of the boundary area where the toxic gas is located.

Description

工业厂区有毒气体边界区域定位方法Location method of toxic gas boundary area in industrial factory area

技术领域technical field

本发明属于工业无线传感器网络领域,具体的发明涉及一种工业厂区有毒气体边界区域定位方法,将有毒气体的边界面积区域定位出来并报道,并且提高有毒气体边界区域的定位精度。The invention belongs to the field of industrial wireless sensor networks, and specifically relates to a method for locating a toxic gas boundary area in an industrial factory area, which locates and reports the toxic gas boundary area, and improves the positioning accuracy of the toxic gas boundary area.

背景技术Background technique

近年来,随着传感器制造技术和无线网络通信技术的发展和成熟,让小型化、高集成和多功能的传感器节点的使用成为现实,在大型石化企业的生产过程中常常会伴随着出现各种各样的有毒化学气体,当这些有毒气体达到一定浓度时,会威胁到一线工作人员的生命安全以及以亿元为单位的直接重大经济损失,所以对泄漏的有毒气体的检测以及定位是至关重要的。而且气体不像液体有明确的边界,气体所需要解决的最主要的问题除了准确检测出气体外,还要利用传感器网络来确定气体的大致边界区域,并通过一系列算法提高边界区域准确度。In recent years, with the development and maturity of sensor manufacturing technology and wireless network communication technology, the use of miniaturized, highly integrated and multi-functional sensor nodes has become a reality. In the production process of large petrochemical enterprises, various Various toxic chemical gases, when these toxic gases reach a certain concentration, will threaten the life safety of front-line staff and direct major economic losses in units of 100 million yuan, so the detection and location of leaked toxic gases are crucial important. Moreover, gas does not have a clear boundary like liquid. The most important problem that needs to be solved for gas is not only the accurate detection of gas, but also the use of sensor networks to determine the approximate boundary area of the gas, and a series of algorithms to improve the accuracy of the boundary area.

目前国内外针对边界定位的相关研究文献如下:At present, the relevant research literature on boundary positioning at home and abroad is as follows:

2008年,Chang等人在《CODA:A Continuous Objet Detectionand Tracking Algorithm for Wireless Ad Hoc Sensor Networks》中提出了允许每个传感器节点在感测范围内探测和跟踪移动目标的CODA策略,提出连续目标的边界传感器是由静态簇群中的簇头决定的,而不是由多个传感器经过大量的数据交换后决定的,能够减少通信开销和能量损耗。但是CODA算法在前期的簇结构以及簇维护花费是很高的,而且它是基于凸包的算法,在一些检测凹的连续目标的时候不是特别准确可靠。In 2008, Chang et al. proposed a CODA strategy that allows each sensor node to detect and track moving targets within the sensing range in "CODA: A Continuous Objet Detection and Tracking Algorithm for Wireless Ad Hoc Sensor Networks", proposing the boundaries of continuous targets The sensor is determined by the cluster head in the static cluster, rather than by multiple sensors after a large amount of data exchange, which can reduce communication overhead and energy consumption. However, the cost of cluster structure and cluster maintenance in the early stage of CODA algorithm is very high, and it is an algorithm based on convex hull, which is not particularly accurate and reliable when detecting concave continuous targets.

2011年,Luan等人在《Continuous Object Tracing in WirelessSensor Networks》中提出了连续对象追踪的RCOT算法,RCOT是第一个采用环网结构进行检测跟监控连续对象的边界的理论算法,并且通过采用压缩报告信息的大小来减少能量损耗。但是他报告的是有毒气体的内边界节点,而不是有毒气体的边界所穿过的区域。In 2011, Luan et al. proposed the RCOT algorithm for continuous object tracking in "Continuous Object Tracing in WirelessSensor Networks". RCOT is the first theoretical algorithm that uses a ring network structure to detect and monitor the boundaries of continuous objects, and uses compression Report the size of the message to reduce power consumption. But he reports the inner boundary nodes of the toxic gas, not the region crossed by the boundary of the toxic gas.

2012年,Kim等人在《Efficient Continuous Object Trackingwith Virtual Grid in Wireless Sensor Networks》中提出了用类似电视剧中像素分布成像的方案来检测跟踪定位气体目标。虽然报告有毒气体边界所穿过的区域面积,但是该方法假设的基于虚拟网格的网络模型太过于理想化,在许多实际应用中,例如在大型石化工厂中,基于网格的网络布置很难实现,而且该方案中的虚拟网格设置的密度直接影响到气体边界探测的精度。In 2012, Kim et al. proposed in "Efficient Continuous Object Tracking with Virtual Grid in Wireless Sensor Networks" to detect, track and locate gas targets using a scheme similar to pixel distribution imaging in TV dramas. Although the area of the region crossed by the toxic gas boundary is reported, the virtual grid-based network model assumed by this method is too idealized. In many practical applications, such as in large petrochemical plants, the grid-based network layout is difficult Realization, and the density of the virtual grid setting in this scheme directly affects the accuracy of gas boundary detection.

因此,目前关于边界定位的文献中普遍存在的问题是:Thus, the prevailing questions in the current literature on boundary localization are:

大多数的关于连续物体定位算法都只是检测出了内边界节点,而不是目标物体所在的区域,这对于气体来说是毫无意义的。或者有些模型太过于理想化,现实中很难实现。Most of the continuous object localization algorithms only detect the inner boundary nodes, rather than the area where the target object is located, which is meaningless for gas. Or some models are too idealized to be realized in reality.

发明内容Contents of the invention

本发明的目的是为了解决目前在大型工业厂区中有毒气体的定位算法在定位时的不足之处,本发明的方法不仅可以检测出有毒气体,而且可以较为精确地定位出有毒气体所在的边界区域。The purpose of the present invention is to solve the deficiencies of the current positioning algorithm for toxic gas in large industrial factory areas. The method of the present invention can not only detect the toxic gas, but also accurately locate the boundary area where the toxic gas is located .

为了达到上述目的,本发明提供了基于平面化算法的有毒气体边界区域定位方法。由于在厂区内无线传感器节点是随机分布式布置的,为了能让各节点有效的连通并且能够高效节能,本发明选择了用平面化算法使整个网络连通。In order to achieve the above purpose, the present invention provides a method for locating the toxic gas boundary area based on a planarization algorithm. Since the wireless sensor nodes are randomly distributed in the factory area, in order to allow each node to be effectively connected and energy-efficient, the present invention uses a planarization algorithm to connect the entire network.

本发明的技术方案如下:Technical scheme of the present invention is as follows:

一种工业厂区有毒气体边界区域定位方法,包括如下步骤:A kind of localization method of poisonous gas boundary area in industrial factory area, comprises the steps:

(1)、每个传感器节点检测自身是否感应到有毒气体,区分出是有毒气体内的所有节点以及有毒气体外的所有节点;(1), each sensor node detects whether it senses toxic gas, and distinguishes all nodes in the toxic gas and all nodes outside the toxic gas;

(2)、每个传感器节点向自身一跳内所有邻居节点广播消息,所述节点广播的信息数据至少包括三种:节点的ID信息,节点的坐标信息以及节点是否感应到有毒气体的信息;(2), each sensor node broadcasts a message to all neighbor nodes in its own hop, and the information data broadcast by the node includes at least three kinds: the ID information of the node, the coordinate information of the node and the information of whether the node senses toxic gas;

(3)、内边界节点定位以及内边界定位(3), inner boundary node positioning and inner boundary positioning

在所有有毒气体内节点,根据收到一跳通信范围内邻居节点的信息中的是否感应到有毒气体的信息,判断:In all the nodes in the toxic gas, according to the information of whether the toxic gas is sensed in the information received from the neighbor nodes within the one-hop communication range, it is judged that:

3a、假设一个节点的所有邻居节点都感应到有毒气体,则该节点为普通有毒气体内节点,在计算中剔除;3a. Assuming that all the neighbor nodes of a node sense the poisonous gas, then the node is a common poisonous gas internal node, which is eliminated in the calculation;

3b、假设一个节点接收到的所有邻居节点的信息中至少有一个节点没有感应到有毒气体,那么这个节点则为内边界节点,并记录相应的ID信息以及坐标信息;3b. Assuming that at least one of the information received by a node from all neighbor nodes has not sensed toxic gas, then this node is an inner boundary node, and records the corresponding ID information and coordinate information;

3c、根据边界节点定位中步骤3b记录的ID信息以及坐标信息,使内边界节点形成一个唯一的环形通路,称为内边界;3c. According to the ID information and coordinate information recorded in step 3b in the boundary node positioning, the inner boundary nodes form a unique circular path, which is called the inner boundary;

(4)、外边界节点定位以及外边界定位(4), outer boundary node positioning and outer boundary positioning

在所有有毒气体外的节点中,根据收到一跳通信范围内邻居节点的信息包中的是否感应到有毒气体的信息,判断:Among all the nodes outside the toxic gas, according to whether the poisonous gas is sensed in the information packet received from the neighbor node within the one-hop communication range, it is judged that:

4a、假设一个节点的所有邻居节点都没有感应到有毒气体,则该节点为普通的有毒气体外节点,在计算中剔除;4a. Assuming that all the neighbor nodes of a node have not sensed the toxic gas, then the node is an ordinary node outside the toxic gas, which is excluded in the calculation;

4b、假设一个节点接收到的所有邻居节点的信息中至少有一个节点有感应到有毒气体,那么这个节点则为外边界节点,并记录相应的ID信息以及坐标信息;4b. Assuming that at least one of the information received by a node from all neighbor nodes has sensed toxic gas, then this node is an outer boundary node, and records the corresponding ID information and coordinate information;

4c、根据边界节点定位中步骤4b记录的ID信息、坐标信息以及存储在基站中的整个网络节点连通的全局路由信息,使外边界节点形成一个唯一的环形通路,称为外边界;4c. According to the ID information and coordinate information recorded in step 4b of the boundary node positioning, and the global routing information connected to the entire network nodes stored in the base station, the outer boundary nodes form a unique ring path, called the outer boundary;

(5)、边界Face面积区域定位(5), Boundary Face area positioning

根据内外边界的节点信息以及存储在基站中的整个网络节点连通的全局路由信息,相邻并相连的两个内边界节点以及他们所对应的外边界节点通过全局路由信息找彼此相连的最短通路;According to the node information of the inner and outer borders and the global routing information of the entire network nodes stored in the base station, two adjacent and connected inner border nodes and their corresponding outer border nodes find the shortest path connected to each other through the global routing information;

假设两个内边界节点都只有一个外边界节点,那么通过全局路由信息找到外边界节点相连的最短通路,之后与内外边界节点相连所围成的区域就为边界Face面积区域;Assuming that both inner boundary nodes have only one outer boundary node, then the shortest path connecting the outer boundary nodes is found through the global routing information, and then the area surrounded by the connection with the inner and outer boundary nodes is the boundary Face area area;

假设两个内边界节点都有2个以上的外边界节点,那么通过全局路由信息计算,其中一个内边界节点的一个外边界节点找另一个内边界节点的外边界节点的最短通路中存在这个内边界节点的其他外边界节点,那么用通路中的外边界节点替换之前的外边界节点;以此类推,2个外边界节点相连的最短路径内不包含其他的外边界节点,则最短通路以及内外边界节点所围成的区域为边界Face面积区域;Assuming that two inner border nodes have more than two outer border nodes, then through global routing information calculation, there is this inner border node in the shortest path for an outer border node of one inner border node to find the outer border node of another inner border node. other outer border nodes of the border node, then replace the previous outer border node with the outer border node in the path; and so on, if the shortest path connecting two outer border nodes does not contain other outer border nodes, then the shortest path and inner and outer border nodes The area enclosed by the boundary nodes is the boundary Face area area;

(6)、边界区域定位(6), boundary area positioning

根据确定的内边界和外边界的信息,确定边界区域,内边界跟外边界所围成的中间区域即为有毒气体边界区域。According to the information of the determined inner boundary and outer boundary, the boundary area is determined, and the middle area enclosed by the inner boundary and the outer boundary is the toxic gas boundary area.

上述步骤3c中内边界节点形成一个唯一的环形通路的方法为:The method of forming a unique circular path for the inner boundary nodes in the above step 3c is as follows:

每个内边界节点必然都会连接且仅会连接其他2个内边界节点,根据已知的坐标信息,假设节点I的坐标为(χi,yi),其他节点的坐标为J(χj,yj),计算I节点跟其他节点距离取距离最小的2个节点相连,之后任意取一个方向依次类推进行递归选择,直到回到第一个节点,使所有内边界节点形成一个唯一的环,称为内边界。Each inner boundary node must be connected and only connected to other two inner boundary nodes. According to the known coordinate information, it is assumed that the coordinates of node I are (χ i , y i ), and the coordinates of other nodes are J(χ j , y j ), calculate the distance between node I and other nodes Take the two nodes with the smallest distance to connect, and then take any direction and so on for recursive selection until returning to the first node, so that all inner boundary nodes form a unique ring, called the inner boundary.

上所述步骤4c中内边界节点形成一个唯一的环形通路的方法为:The method for forming a unique circular path for the inner boundary nodes in step 4c above is as follows:

假设两个相邻的外边界节点需要相连,根据ID信息、坐标信息以及通过基站的全局路由信息,首先判断是否在传感器节点的一跳邻居通信范围内,如果是则直接相连,如果不是,则再判断两个节点相连的最短路径是否通过内边界节点,如果是则剔除这条通路,选择除通过内边界节点外的最短路径,如果不是则选择其为连接路径,依次类推使所有外边界节点形成一个唯一的环形通路,称为外边界。Assuming that two adjacent outer border nodes need to be connected, according to the ID information, coordinate information and the global routing information through the base station, first judge whether they are within the communication range of the sensor node’s one-hop neighbor, if yes, connect directly, if not, then Then judge whether the shortest path connecting two nodes passes through the inner boundary node, if so, remove this path, select the shortest path except through the inner boundary node, if not, select it as the connection path, and so on to make all the outer boundary nodes A unique circular path is formed, called the outer boundary.

本发明不仅能够精确的定位出工业厂区内气体泄漏时有毒气体所在区域的内外边界节点,而且能够精确定位出有毒气体所在的边界面积区域。The invention can not only accurately locate the inner and outer boundary nodes of the area where the toxic gas is located when the gas leaks in the industrial factory area, but also accurately locate the area of the boundary area where the toxic gas is located.

附图说明Description of drawings

图1为本发明的流程分析示意图;Fig. 1 is the flow chart analysis schematic diagram of the present invention;

图2为本发明的系统特征示意图;Fig. 2 is a schematic diagram of system features of the present invention;

图3为利用Gas信息检测跟判别内外边界节点示意图;Figure 3 is a schematic diagram of using Gas information to detect and distinguish internal and external boundary nodes;

图4为利用内边界节点ID信息、坐标信息确定内边界的示意图;Fig. 4 is a schematic diagram of determining the inner boundary by using the inner boundary node ID information and coordinate information;

图5为利用外边界节点ID信息、坐标信息以及全局路由信息确定外边界的示意图;Fig. 5 is a schematic diagram of determining the outer boundary by using outer boundary node ID information, coordinate information and global routing information;

图6为利用内外边界节点确定边界Face面积区域的示意图;Fig. 6 is a schematic diagram of determining the boundary Face area area by using inner and outer boundary nodes;

图7为基于内边界跟外边界确定有毒气体边界区域示意图;Fig. 7 is a schematic diagram of determining the toxic gas boundary area based on the inner boundary and the outer boundary;

图中的●表示感应到气体的节点;○表示没有感应到气体的节点;表示内外边界;表示气体团。● in the figure indicates the node that senses the gas; ○ indicates the node that does not sense the gas; Indicates the inner and outer boundaries; represents a gas mass.

具体实施方式Detailed ways

下面结合附图对本发明作进一步描述。以下实施例仅用于更加清楚地说明本发明的技术方案,而不能以此来限制本发明的保护范围。The present invention will be further described below in conjunction with the accompanying drawings. The following examples are only used to illustrate the technical solution of the present invention more clearly, but not to limit the protection scope of the present invention.

如图1所示,一旦发现有毒气体,首先对传感器节点进行筛选,判断区分出气体内跟气体外的所有节点;然后在气体内的所有节点中进行筛选,选出内边界节点;气体外的所有节点中进行筛选,选出外边界节点;然后根据内外边界节点形成内外边界,再根据内外边界确定有毒气体的边界区域。As shown in Figure 1, once a toxic gas is found, the sensor nodes are first screened to judge and distinguish all nodes inside and outside the gas; then all nodes inside the gas are screened to select inner boundary nodes; all nodes outside the gas The nodes are screened to select the outer boundary nodes; then the inner and outer boundaries are formed according to the inner and outer boundary nodes, and then the boundary area of the toxic gas is determined according to the inner and outer boundaries.

如图2所示,是一块有毒气体的区域以及区域内随机所布置的传感器节点A至U,每个节点都有各自的ID、坐标等信息,一跳通信范围内节点之间通过相互广播,能够知道节点一跳邻居内所有节点的信息,结合节点本身的信息能够判断出节点A至节点K都是气体的外边界节点,节点L至节点S都是气体的内边界节点,而由于节点T跟节点U它们的一跳邻居内都是感应到气体的节点,因此他们不是内边界节点;然后根据边界节点的ID以及坐标信息确定出内外边界,再根据内外边界确定边界区域。As shown in Figure 2, it is an area of toxic gas and sensor nodes A to U randomly arranged in the area. Each node has its own ID, coordinates and other information. The nodes within the communication range of one hop broadcast each other. It is possible to know the information of all nodes in the neighbors of a node, combined with the information of the node itself, it can be judged that nodes A to K are all the outer boundary nodes of the gas, and nodes L to S are all the inner boundary nodes of the gas, and because the node T The one-hop neighbors of node U are all nodes that sense gas, so they are not inner boundary nodes; then determine the inner and outer boundaries according to the ID and coordinate information of the boundary nodes, and then determine the boundary area according to the inner and outer boundaries.

如图3所示,在区域内布置了A—V的节点,由图容易看到其中节点M-V感应到有毒气体,因此是气体内部节点,再通过在一跳邻居节点之间进行广播发送数据包,例如节点O,它向节点H、I、J、V、P发送数据,得知节点H、I、J没有感应到有毒气体,符合在一跳邻居节点内至少有一个节点没有感应到有毒气体的条件,因此节点O为内边界节点。而节点V,它的一跳邻居节点O、P、W、R、U、N都感应到有毒气体,不符合内边界节点条件,因此它只是气体内节点,在之后的计算中剔除这个节点的信息。以此类推,可以得到节点为M、N、P、Q、R、S、T也都是内边界节点,并记录他们的信息。节点A-L没有感应到有毒气体,因此是气体外部节点,再通过在节点的一跳邻居节点之间进行广播发送数据,例如节点C,它向节点B、D、E、R、S发送数据,得知节点R、S感应到有毒气体,符合在一跳邻居节点中至少有一个节点感应到有毒气体的条件,因此节点C是外边界节点。而节点D,它的一跳邻居节点B、C、E都没有感应到有毒气体,不符合外边界节点的条件,因此节点D只是气体外节点。以此类推,我们可以得到节点A、B、C、E、F、G、H、I、J、K、L都是外边界节点,并记录他们的信息。As shown in Figure 3, A-V nodes are arranged in the area. It is easy to see from the figure that the nodes M-V sense the toxic gas, so they are internal nodes of the gas, and then send data packets by broadcasting between one-hop neighbor nodes , such as node O, it sends data to nodes H, I, J, V, P, and learns that nodes H, I, J have not sensed poisonous gas, which is consistent with at least one node in one-hop neighbor nodes not sensing poisonous gas condition, so node O is an inner boundary node. As for node V, its one-hop neighbor nodes O, P, W, R, U, and N all sense poisonous gas, which does not meet the conditions of inner boundary nodes, so it is only a node inside the gas, and the node of this node will be eliminated in the subsequent calculations. information. By analogy, it can be obtained that nodes M, N, P, Q, R, S, and T are also inner boundary nodes, and record their information. Nodes A-L do not sense toxic gas, so they are gas-external nodes, and then send data by broadcasting between one-hop neighbor nodes of the node, such as node C, which sends data to nodes B, D, E, R, and S, and obtains It is known that nodes R and S have sensed poisonous gas, which meets the condition that at least one node senses poisonous gas in one-hop neighbor nodes, so node C is an outer boundary node. As for node D, its one-hop neighbor nodes B, C, and E have not sensed toxic gas, which does not meet the conditions of an outer boundary node, so node D is only an outer node of gas. By analogy, we can get that nodes A, B, C, E, F, G, H, I, J, K, and L are all outer boundary nodes, and record their information.

如图4所示,通过已经确定内边界节点的信息,可以看到一个内边界节点能且仅能够跟2个邻居节点相连,先获得他们的ID以及坐标信息,随机选取一个节点例如节点T,假设它的坐标为(χi,yi)然后设其他节点的坐标为(χj,yj),通过计算他们的距离L选取两个距离最小的节点相连,图中可看出为节点S以及节点M,然后随机选取一个相连接的节点例如节点M做相同于节点T的计算,找寻M节点的除了节点T的之外的另一个距离最小的邻居节点相连,以此类推最后找到的节点除了之前的节点外距离最小的节点是节点T时,此时形成的环LMNOPQRS即为内边界。As shown in Figure 4, through the information of the inner boundary nodes that have been determined, it can be seen that an inner boundary node can and can only be connected to two neighbor nodes, first obtain their ID and coordinate information, and randomly select a node such as node T, Suppose its coordinates are (χ i , y i ) and then set the coordinates of other nodes as (χ j , y j ), by calculating their distance L Select two nodes with the smallest distance to connect, which can be seen as node S and node M in the figure, and then randomly select a connected node such as node M to do the same calculation as node T, and find M nodes except node T Another neighbor node with the smallest distance is connected, and by analogy, when the node with the smallest distance to the last found node is node T except the previous node, the ring LMNOPQRS formed at this time is the inner boundary.

如图5所示,通过已经确定外边界节点的信息,结合存储在基站中的整个网络节点连通的全局路由信息,首先判断两个外边界节点是否在各自一跳通信范围内,例如节点B、C是在一跳通信范围内的邻居节点,且通路BC是能够直接连通的最短通路路径,则直接连接节点BC。但是不是在各自一跳通信范围内的节点相邻节点需要相连,还需要判断通路路径是否经过内边界节点,例如假设节点F、I是相连的2个外边界节点,但是却不在一跳通信范围内,则需要通过全局路由信息找连接节点FI的最短通路,可以看到通路FPOI是最短的通路,但是这条通路经过了内边界节点P跟O,因此排除,找寻另外一条不经过内边界节点的最短通路路径,由图我们可以看到通过节点G、H的通路FGHI是最短的通路路径,则连接节点FGHI最为外边界的一部分,以此类推,外边界既可确定为经过ABCEFGHIJKL节点的环。As shown in Figure 5, through the information of the outer border nodes that have been determined, combined with the global routing information of the entire network nodes stored in the base station, first determine whether the two outer border nodes are within their respective one-hop communication ranges, such as node B, C is a neighbor node within the one-hop communication range, and the path BC is the shortest path that can be directly connected, then directly connect to node BC. However, adjacent nodes that are not within the communication range of each hop need to be connected, and it is also necessary to determine whether the path passes through the inner boundary node. For example, suppose nodes F and I are two connected outer boundary nodes, but they are not within the communication range of one hop. It is necessary to find the shortest path connecting node FI through the global routing information. It can be seen that the path FPOI is the shortest path, but this path passes through the inner boundary nodes P and O, so it is ruled out and another path that does not pass through the inner boundary node is found. From the figure, we can see that the path FGHI passing through the nodes G and H is the shortest path, then the connecting node FGHI is the most outer part of the boundary, and so on, the outer boundary can be determined as the ring passing through the node ABCEFGHIJKL .

如图6所示,通过已经确定的相邻内边界节点SR,S有2个外边界节点AK,R有两个外边界节点BC,假设从R节点的外边界C节点出发找寻S节点的外边界节点的最短通路,由图可以看到节点B在C到AK的最短通路上,因此用节点B替换C,然后节点B找到内边界节点S的外边界节点A是连通的最短通路路径BA,之后连接BR,SR,SA以及最短通路BA,他们所围成的面积区域ABRS即为边界Face面积区域。As shown in Figure 6, through the determined adjacent inner boundary node SR, S has two outer boundary nodes AK, R has two outer boundary nodes BC, assuming that starting from the outer boundary node C of node R to find the outer boundary node of S node The shortest path of the boundary node, we can see from the figure that node B is on the shortest path from C to AK, so replace C with node B, and then node B finds the shortest path BA connected to the outer boundary node A of the inner boundary node S, Then connect BR, SR, SA and the shortest path BA, and the area ABRS surrounded by them is the boundary Face area.

如图7所示,通过已经确定的外边界ABCDEFGHIJK以及内边界LMNOPQRS,这两个环形所围成的中间区域即为我们需要求出有毒气体的边界区域。As shown in Figure 7, through the determined outer boundary ABCDEFGHIJK and inner boundary LMNOPQRS, the middle area surrounded by these two rings is the boundary area where we need to find out the toxic gas.

以上所述仅是本发明的优选实施方式,应当指出,对于本技术领域的普通技术人员来说,在不脱离本发明技术原理的前提下,还可以做出若干改进和变形,这些改进和变形也应视为本发明的保护范围。The above is only a preferred embodiment of the present invention, it should be pointed out that for those of ordinary skill in the art, without departing from the technical principle of the present invention, some improvements and modifications can also be made. It should also be regarded as the 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.
CN201410588333.0A 2014-10-27 2014-10-27 Method for positioning boundary region of poisonous gas in industrial factory district Pending CN104320822A (en)

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)

* Cited by examiner, † Cited by third party
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 广东石油化工学院 A Distributed Algorithm for Computing 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 南京农业大学 Method and system for locating pest-intensive areas based on solar insecticidal lamp Internet of Things

Citations (4)

* Cited by examiner, † Cited by third party
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 哈尔滨工程大学 A Weighted Voronoi Diagram-Based Localization Method for Wireless Sensor Networks

Patent Citations (4)

* Cited by examiner, † Cited by third party
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 哈尔滨工程大学 A Weighted Voronoi Diagram-Based Localization Method for Wireless Sensor Networks

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
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)

* Cited by examiner, † Cited by third party
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 广东石油化工学院 A Distributed Algorithm for Computing 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 河海大学常州校区 Toxic gas tracking method based on virtual node walk 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 广东石油化工学院 A method for detection of toxic gas boundary based on node localization in 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 南京农业大学 Method and system for locating pest-intensive areas based on solar insecticidal lamp Internet of Things
CN116347377B (en) * 2023-02-28 2024-02-02 南京农业大学 Pest-intensive area positioning method and system based on solar insecticidal lamp Internet of Things

Similar Documents

Publication Publication Date Title
CN104320822A (en) Method for positioning boundary region of poisonous gas in industrial factory district
Khoufi et al. Survey of deployment algorithms in wireless sensor networks: coverage and connectivity issues and challenges
Youssef et al. Accurate anchor-free node localization in wireless sensor networks
Shu et al. Toxic gas boundary area detection in large-scale petrochemical plants with industrial wireless sensor networks
Zhu et al. A survey on communication and data management issues in mobile sensor networks
CN101742642B (en) A Semi-automatic Node Location Method for Wireless Sensor Networks Based on Region Division and Coordinate Margin
CN102098692B (en) Method for detecting and filling wireless sensor network (WSN) cover blind area based on blind area boundary node
Hadir et al. An optimized DV-hop localization algorithm using average hop weighted mean in WSNs
CN102158957A (en) Positioning method for wireless sensor network in three-dimensional space through twice region segmentation and iteration
Yu et al. A self detection technique in fault management in WSN
CN110234145A (en) The improved wireless sensor network locating method of DV-HOP based on reliable beaconing nodes
CN107071735A (en) A kind of mobile node Monte Carlo localization method based on sequential
CN103945399A (en) Cooperation deployment method of mixed sensing nodes under uncertain environment
CN105072631B (en) The empty recognition methods of distributed wireless sensor network covering
CN104931202A (en) Gas leakage internal boundary positioning algorithm
TW201509214A (en) Method and system for sensor nodes localization
CN105050099A (en) Method for identifying boundary nodes in distributed wireless sensor network
Lu et al. Adaptive mobile anchor localization algorithm based on ant colony optimization in wireless sensor networks
Chehri et al. Geo-location with wireless sensor networks using non-linear optimization
Wang Three-dimensional wireless sensor networks: geometric approaches for topology and routing design
CN105472630B (en) The wireless sensor network fringe node recognition methods differentiated based on triangle
CN110708675B (en) A Node Location Method for Wireless Sensor Networks Based on Dual Mobility Anchor Nodes
CN106793071B (en) A method for detection of toxic gas boundary based on node localization in industrial sensor network
KR101486462B1 (en) Sensor Positioning System and Scheme Considering Holes in Wireless Sensor Networks
CN105472687B (en) A kind of wireless sensor network node fusion for classification method based on perception properties

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

Application publication date: 20150128

WD01 Invention patent application deemed withdrawn after publication