CN102075975A - Data monitoring method for wireless sensor network - Google Patents
Data monitoring method for wireless sensor network Download PDFInfo
- Publication number
- CN102075975A CN102075975A CN201110003287XA CN201110003287A CN102075975A CN 102075975 A CN102075975 A CN 102075975A CN 201110003287X A CN201110003287X A CN 201110003287XA CN 201110003287 A CN201110003287 A CN 201110003287A CN 102075975 A CN102075975 A CN 102075975A
- Authority
- CN
- China
- Prior art keywords
- node
- bubble
- message
- grading
- wireless sensor
- 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
- 238000000034 method Methods 0.000 title claims abstract description 30
- 238000012544 monitoring process Methods 0.000 title claims abstract description 23
- 230000002159 abnormal effect Effects 0.000 claims abstract description 10
- 230000005540 biological transmission Effects 0.000 claims abstract description 10
- 230000009191 jumping Effects 0.000 claims 3
- 230000002776 aggregation Effects 0.000 claims 1
- 238000004220 aggregation Methods 0.000 claims 1
- 230000006854 communication Effects 0.000 claims 1
- 235000008694 Humulus lupulus Nutrition 0.000 description 9
- 238000010586 diagram Methods 0.000 description 2
- 238000005265 energy consumption Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 230000000644 propagated effect Effects 0.000 description 1
- 230000001953 sensory effect Effects 0.000 description 1
Images
Landscapes
- Small-Scale Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
本发明涉及一种无线传感器网络Bubble式数据监测方法,所述监测方法在无线传感器网络中设置有节点和Sink节点,所述节点能够产生Bubble,所述Bubble是所述节点向周围k跳(k是一个相对网络尺寸来说较小的值)范围内广播状态监测消息,所述Sink节点为汇聚节点,就是能够接受所有节点传输包的某个特殊节点;所述监测方法通过一次网络结点间的”Grading”消息传播实现对Bubble中心的选取,Bubble中心的选取满足两个最近的Bubble不会有太多重合,利用这些距离适当的Bubble,检测是否在本Bubble区域内有异常数据出现,及时向Sink结点汇报。
The present invention relates to a kind of wireless sensor network Bubble type data monitoring method, and described monitoring method is provided with node and Sink node in wireless sensor network, and described node can produce Bubble, and described Bubble is that described node jumps around k (k It is a relatively small value for the network size) within the broadcast status monitoring message, and the Sink node is a sink node, which is a special node that can accept all node transmission packets; The "Grading" message dissemination realizes the selection of the bubble center. The selection of the bubble center satisfies that there will not be too much overlap between the two nearest bubbles. Use these bubbles with an appropriate distance to detect whether there is abnormal data in the bubble area, and timely Report to the Sink node.
Description
技术领域technical field
本发明属于网络技术领域,具体涉及一种无线传感器网络Bubble式数据监测方法。 The invention belongs to the field of network technology, and in particular relates to a bubble-type data monitoring method of a wireless sensor network. the
背景技术Background technique
无线传感器网络包含大量的传感器节点,可感知周围的信息,能够感知的信息有:环境温度、湿度等等。基于无线传感器网络的应用常需要对一些异常的传感器感知到的异常数据进行预警处理,而异常的感知数据往往出现在一个很小的范围内,通常在某个节点的k跳范围内的节点上。因此我们需要能够对这些异常区域进行感知并对感知数据进行监测。 The wireless sensor network contains a large number of sensor nodes, which can perceive the surrounding information. The information that can be sensed includes: ambient temperature, humidity and so on. Applications based on wireless sensor networks often require early warning processing of abnormal data sensed by some abnormal sensors, and abnormal sensory data often appear in a small range, usually on nodes within the k-hop range of a certain node . Therefore, we need to be able to sense these abnormal areas and monitor the sensed data. the
最简单直观的监测方法是每个结点将自己的传感模块得到的数据定期向Sink节点报告。由Sink节点定期得到被监测区域传感器结点的所有当前感知数据,Sink结点根据所有结点的取值找到警戒值超标的区域。 The most simple and intuitive monitoring method is that each node regularly reports the data obtained by its own sensor module to the Sink node. The Sink node regularly obtains all the current sensing data of the sensor nodes in the monitored area, and the Sink node finds the area where the warning value exceeds the standard according to the values of all nodes. the
另一种数据监测方法是随机Bubble式的预警方法,这种方法不需要每个结点按照某个时间间隔定期通过耗费能量的多跳数据传输向Sink结点汇报当前的感知数据,而是每个结点定期产生Bubble,即定期向周围k跳范围广播状态监测消息(k是一个相对网络尺寸来说较小的值),若发现监测值超标则向Sink结点报告,若监测值未超标则不做任何处理,等待下一个检查周期。 Another data monitoring method is a random bubble early warning method. This method does not require each node to report the current perception data to the Sink node through energy-consuming multi-hop data transmission at a certain time interval. A node periodically generates Bubbles, that is, broadcasts status monitoring messages to the surrounding k-hop range (k is a relatively small value relative to the network size), and reports to the Sink node if the monitoring value exceeds the standard, and if the monitoring value does not exceed the standard Then do not do any processing, and wait for the next check cycle. the
第一种方法需要每个结点将感知的数据通过其他结点的转发传回Sink节点,每个节点既需要承担定期感知数据的任务又需要承担其他节点向Sink节点汇报时的消息传递任务。这两部分任务都会消耗传感器网络上结点的大量能量,缩短传感器网络的生命期。 The first method requires each node to transmit the perceived data back to the Sink node through the forwarding of other nodes. Each node needs to undertake the task of periodically sensing data and the task of message delivery when other nodes report to the Sink node. These two tasks will consume a lot of energy of the nodes on the sensor network and shorten the lifetime of the sensor network. the
第二种方法需要每个结点定期向周围k跳交换状态消息,虽然能够在一定 程度上减少不必要的结点向Sink节点的汇报消息的数量,从而减少无线传感器结点间消息传递的能量消耗,但仍然会带来一些冗余的消息交换。比如,两个相距很近(小于k跳)的结点同时向周围k跳范围广播状态监测消息,会使某些结点在很短的时间间隔内重复感知和汇报数据,带来不必要的能量消耗。 The second method requires each node to periodically exchange status messages to the surrounding k hops, although it can reduce the number of unnecessary nodes reporting messages to the Sink node to a certain extent, thereby reducing the energy of message transmission between wireless sensor nodes consumption, but still introduces some redundant message exchanges. For example, two nodes that are very close (less than k hops) broadcast status monitoring messages to the surrounding k hops at the same time, which will cause some nodes to repeatedly perceive and report data in a very short time interval, resulting in unnecessary energy consumption. the
发明内容Contents of the invention
本发明克服了现有技术的不足,提出了一种无线传感器网络Bubble式数据监测方法,所述方法在传感器网络中部署后,能够以一个低能耗的方式定期监测传感器数据,探测可能的数据异常的区域。 The present invention overcomes the deficiencies of the prior art, and proposes a Bubble-type data monitoring method for wireless sensor networks. After the method is deployed in the sensor network, it can regularly monitor sensor data in a low-energy-consumption manner, and detect possible data anomalies Area. the
本发明的技术方案为:无线传感器网络Bubble式数据监测方法,所述监测方法在无线传感器网络中设置有节点和Sink节点,所述节点能够产生Bubble,所述Bubble是所述节点向周围k跳(k是一个相对网络尺寸来说较小的值)范围内广播状态监测消息,所述Sink节点为汇聚节点,就是能够接受所有节点传输包的某个特殊节点; The technical scheme of the present invention is: wireless sensor network Bubble type data monitoring method, described monitoring method is provided with node and Sink node in wireless sensor network, described node can produce Bubble, and described Bubble is described node k jumps around (k is a relatively small value relative to the size of the network), broadcast status monitoring messages within the range, and the Sink node is a sink node, which is a special node that can accept all node transmission packets;
所述监测方法通过一次网络结点间的”Grading”消息传播实现对Bubble中心的选取,Bubble中心的选取满足两个最近的Bubble不会有太多重合,利用这些距离适当的Bubble,检测是否在本Bubble区域内有异常数据出现,及时向Sink结点汇报。 The monitoring method realizes the selection of the Bubble center through the "Grading" message propagation between the network nodes once. The selection of the Bubble center satisfies that the two nearest Bubbles will not have too much overlap. Utilize these Bubbles with appropriate distances to detect whether they are in the If there is abnormal data in this Bubble area, report it to the Sink node in time. the
所述“Grading”消息传播的具体过程为: The specific process of the "Grading" message propagation is as follows:
“Grading”消息传播由Sink结点发起一次生成树(spanning)传播过程,实现Bubble中心(称为i级结点)的选取,所述i级结点记为距所述Sink结点i*(2k+1)跳的结点,目的是使相邻级别的结点间的距离不小于2k+1跳,避免相邻级别的结点作为Bubble中心产生重叠的Bubble(半径为k),每个结点首先检查自己是否收到过“Grading”消息,若是,则直接丢弃该消息,若否,则 检查自己是否是第i*(2k+1)跳结点,若是则标注自己是i级结点,否则继续转发“Grading”消息,直到所有结点都收到过“Grading”消息为止。 "Grading" message propagation initiates a spanning tree (spanning) propagation process by the Sink node, and realizes the selection of the Bubble center (called the i-level node), and the i-level node is recorded as i*( 2k+1) hop nodes, the purpose is to make the distance between nodes of adjacent levels not less than 2k+1 hops, to avoid overlapping Bubbles (with a radius of k) when nodes of adjacent levels are used as Bubble centers, each The node first checks whether it has received the "Grading" message, if so, it discards the message directly, if not, then checks whether it is the i*(2k+1) hop node, and if so, marks itself as the i-level node Otherwise, continue to forward the "Grading" message until all nodes have received the "Grading" message. the
本发明具有如下有益效果: The present invention has the following beneficial effects:
1)本发明是完全分布式实现; 1) The present invention is a fully distributed implementation;
2)在无线传感器网络中选取一部分结点而不是全部作为Bubble中心,可以极大地减少不必要的传感器结点间消息传输,延长无线传感器网络生命周期; 2) Selecting a part of the nodes in the wireless sensor network instead of all as the bubble center can greatly reduce unnecessary message transmission between sensor nodes and prolong the life cycle of the wireless sensor network;
3)使用生成树(spanning tree)方式进行一次消息传递,得到所有的Bubble中心,消耗的消息量较少; 3) Use the spanning tree method to carry out a message transfer to get all the Bubble centers, and consume less messages;
4)Bubble中心间的距离适当,使得由Bubble中心产生的距离最近的两个Bubble不会有太多的重合,利用这些距离适当的Bubble,检测是否在本Bubble区域内有异常数据出现,及时向Sink结点汇报,可以减少不必要的传感器结点间消息传输,延长无线传感器网络生命周期。 4) The distance between the Bubble centers is appropriate, so that the two closest Bubbles generated by the Bubble centers will not overlap too much. Use these Bubbles with appropriate distances to detect whether there is abnormal data in the Bubble area, and report to Sink node reporting can reduce unnecessary message transmission between sensor nodes and prolong the life cycle of wireless sensor networks. the
附图说明Description of drawings
图1表示当k=2时“Grading”消息的传播示意图,图中箭头表示一次消息以一种生成树(spanning)的方式在结点间的传递。 Fig. 1 shows a schematic diagram of propagation of "Grading" message when k=2, and the arrows in the figure represent the transmission of a message between nodes in a spanning manner. the
图2为以图1所示的传感器网络拓扑结构为例,从图1的得到的4个1级结点和5个2级结点作为Bubble中心,定期向周围结点广播k(=2)为半径的Bubble,执行定期传感器数据监测示意图。 Figure 2 is an example of the sensor network topology shown in Figure 1. The four first-level nodes and five second-level nodes obtained from Figure 1 are used as the Bubble center to broadcast k (=2) to the surrounding nodes regularly. Schematic diagram of performing regular sensor data monitoring for a Bubble with a radius. the
具体实施方式Detailed ways
以下结合实施例进一步说明。 Below in conjunction with embodiment further illustrate. the
参见图1和图2所示,本发明去除了一些冗余消息交换。本发明在无线传感器网络中设置有节点和Sink节点,所述节点能够产生Bubble,所述Bubble是所述节点向周围k跳(k是一个相对网络尺寸来说较小的值)范围内广播状态 监测消息,所述Sink节点为汇聚节点,就是能够接受所有节点传输包的某个特殊节点。 Referring to Fig. 1 and Fig. 2, the present invention removes some redundant message exchanges. The present invention is provided with node and Sink node in the wireless sensor network, and described node can produce Bubble, and described Bubble is that described node broadcasts the state within the range of k hops (k is a relatively small value relative to network size) For monitoring messages, the Sink node is a sink node, which is a special node that can receive packets transmitted by all nodes. the
本发明是在无线传感器网络中选取一部分结点作为Bubble中心,Bubble中心的选取满足两个最近的Bubble不会有太多重合。利用这些距离适当的Bubble,检测是否在本Bubble区域内有异常数据出现,及时向Sink结点汇报。本方法可以极大地减少不必要的传感器结点间消息传输,延长无线传感器网络生命周期。本发明为选取Bubble(半径为k)中心,使得所有Bubble中心产生的Bubble之间没有太多重合,本方法通过一次网络结点间的“Grading”消息传播实现对Bubble中心的选取,其过程如下: The present invention selects a part of nodes in the wireless sensor network as the Bubble center, and the selection of the Bubble center satisfies that two nearest Bubbles will not overlap too much. Use these Bubbles with appropriate distances to detect whether there is any abnormal data in the Bubble area, and report to the Sink node in time. The method can greatly reduce unnecessary message transmission between sensor nodes and prolong the life cycle of the wireless sensor network. The present invention selects the center of the Bubble (with a radius of k) so that there is not much overlap between the Bubbles generated by all the Bubble centers. This method realizes the selection of the Bubble center through a "Grading" message propagation between network nodes. The process is as follows :
“Grading”消息传播由Sink结点发起一次生成树(spanning)传播过程,实现Bubble中心(在算法中称为i级结点)的选取。这里的i级结点记为距Sink结点每i*(2k+1)跳的结点,目的是使相邻级别的结点间的距离不小于2k+1跳,避免相邻级别的结点作为Bubble中心产生重叠的Bubble(半径为k)。该过程的实现需要每个结点首先检查自己是否收到过“Grading”消息,若是,则直接丢弃该消息,若否,则检查自己是否是第i*(2k+1)跳结点,若是则标注自己是i级结点,否则继续转发“Grading”消息,直到所有结点都收到过”Grading”消息为止。图1显示的是k=2时“Grading”消息传播后得到的所有i级结点,以上“Grading”消息传播仅实现了相邻级结点间的距离不小于2k+1跳,但同级结点间的距离仍有可能小于2k+1跳。图2为以图1所示的传感器网络拓扑结构为例,从图1的得到的4个1级结点和5个2级结点作为Bubble中心,定期向周围结点广播k(=2)为半径的Bubble,执行定期传感器数据监测。因此,如图2所示,本方法可保证Bubble中心的选取满足两个最近的Bubble不会有太多重合。 "Grading" message propagation is a spanning tree (spanning) propagation process initiated by the Sink node to realize the selection of the Bubble center (called i-level node in the algorithm). The i-level node here is recorded as a node every i*(2k+1) hops away from the Sink node. The purpose is to make the distance between nodes of adjacent levels not less than 2k+1 hops and avoid The point is used as the center of the bubble to generate overlapping bubbles (with a radius of k). The realization of this process requires each node to first check whether it has received the "Grading" message, if so, then discard the message directly, if not, then check whether it is the i*(2k+1) hop node, if so Then mark yourself as an i-level node, otherwise continue to forward the "Grading" message until all nodes have received the "Grading" message. Figure 1 shows all i-level nodes obtained after the "Grading" message is propagated when k=2. The above "Grading" message propagation only realizes that the distance between adjacent level nodes is not less than 2k+1 hops, but the same level The distance between nodes may still be less than 2k+1 hops. Figure 2 is an example of the sensor network topology shown in Figure 1. The four first-level nodes and five second-level nodes obtained from Figure 1 are used as the Bubble center to broadcast k (=2) to the surrounding nodes regularly. For radius bubbles, perform periodic sensor data monitoring. Therefore, as shown in FIG. 2 , this method can ensure that the selection of the center of the bubble satisfies the requirement that the two nearest bubbles will not overlap too much. the
本发明有以下优点: The present invention has the following advantages:
1)本发明可以减少冗余消息交换; 1) The present invention can reduce redundant message exchange;
2)本发明是在无线传感器网络中选取一部分结点作为Bubble中心,Bubble中心的选取满足两个最近的Bubble不会有太多重合。利用这些距离适当的Bubble,检测是否在本Bubble区域内有异常数据出现,及时向Sink结点汇报。 2) The present invention selects a part of nodes in the wireless sensor network as the Bubble center, and the selection of the Bubble center satisfies that the two nearest Bubbles will not overlap too much. Use these Bubbles with appropriate distances to detect whether there is any abnormal data in the Bubble area, and report to the Sink node in time. the
3)本发明可以极大地减少不必要的传感器结点间消息传输,延长无线传感器网络生命周期。 3) The present invention can greatly reduce unnecessary message transmission between sensor nodes and prolong the life cycle of the wireless sensor network. the
Claims (2)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110003287.XA CN102075975B (en) | 2011-01-10 | 2011-01-10 | Data monitoring method for wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110003287.XA CN102075975B (en) | 2011-01-10 | 2011-01-10 | Data monitoring method for wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102075975A true CN102075975A (en) | 2011-05-25 |
| CN102075975B CN102075975B (en) | 2014-12-24 |
Family
ID=44034284
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110003287.XA Expired - Fee Related CN102075975B (en) | 2011-01-10 | 2011-01-10 | Data monitoring method for wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102075975B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070019569A1 (en) * | 2005-07-22 | 2007-01-25 | Park Il G | Methods for automatically selecting a cluster header in a wireless sensor network and for dynamically configuring secure wireless sensor network |
| CN101282290A (en) * | 2008-03-05 | 2008-10-08 | 中科院嘉兴中心微系统所分中心 | Method for balancing and clustering load of wireless sensing network based on gradient |
| CN101355496A (en) * | 2008-08-12 | 2009-01-28 | 武汉大学 | Multi-hop clustering routing protocol initiated by base station |
-
2011
- 2011-01-10 CN CN201110003287.XA patent/CN102075975B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070019569A1 (en) * | 2005-07-22 | 2007-01-25 | Park Il G | Methods for automatically selecting a cluster header in a wireless sensor network and for dynamically configuring secure wireless sensor network |
| CN101282290A (en) * | 2008-03-05 | 2008-10-08 | 中科院嘉兴中心微系统所分中心 | Method for balancing and clustering load of wireless sensing network based on gradient |
| CN101355496A (en) * | 2008-08-12 | 2009-01-28 | 武汉大学 | Multi-hop clustering routing protocol initiated by base station |
Non-Patent Citations (1)
| Title |
|---|
| 徐晨等: "无线传感器网络多sink路由技术研究", 《计算机应用研究》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102075975B (en) | 2014-12-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102665171A (en) | Routing control method based on big-scale WSN (wireless sensor network) emergency monitoring | |
| Kumari | A comprehensive survey of routing protocols in wireless sensor networks | |
| Kumar et al. | Improving network life time using static cluster routing for wireless sensor networks | |
| Karthikeyan et al. | Proficient dazzling crow optimization routing protocol (PDCORP) for effective energy administration in wireless sensor networks | |
| Ratnaraj et al. | OEDSR: Optimized energy-delay sub-network routing in wireless sensor network | |
| Samanta et al. | Optimal load distribution of cluster head in fault-tolerant wireless sensor network | |
| CN106161118A (en) | In a kind of wireless sense network, the k of balancing energy jumps cluster routing method | |
| CN102075975B (en) | Data monitoring method for wireless sensor network | |
| Padiya et al. | Analysis of data aggregation methods to avoid data redundancy in wireless sensor network | |
| CN103607746A (en) | Method for realizing routing through wireless sensing nodes | |
| CN103179631B (en) | A kind of choose the method that optimal angle carries out sub-clustering | |
| Wang et al. | Sleep scheduling for critical nodes in group-based industrial wireless sensor networks | |
| CN107579887B (en) | A kind of intelligent domestic system based on wireless sensor network | |
| Mandloi et al. | An Efficient Clustering Technique for Deterministically Deployed Wireless Sensor Networks | |
| CN109831757B (en) | Method for reducing time delay and energy consumption in dense wireless sensor network | |
| Izadi et al. | Quality control of sensor network data | |
| Afsar | A comprehensive fault‐tolerant framework for wireless sensor networks | |
| Quadri et al. | Comparative parameters for energy efficient routing for MANET | |
| CN104301963A (en) | Improvement and optimization of a flooding routing algorithm based on ZigBee wireless network | |
| Fayeez et al. | Throughput Analysis Of Energy Aware Routing Protocol For Real-Time Load Distribution In Wireless Sensor Network (Wsn) | |
| Liu et al. | Adaptive fault detection approaches for dynamic mobile networks | |
| Karim et al. | Mobility-centric energy efficient and fault tolerant clustering protocol of wireless sensor network | |
| CN102143545A (en) | Router and packet forwarding method thereof | |
| Bhatti et al. | Trends towards optimistic data aggregation techniques | |
| Zhao et al. | Algorithms for Reducing Communication Energy and Avoiding Energy Holes to Extend Lifetime of WSNs |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: QINGDAO UNIVERSITY OF SCIENCE + TECHNOLOGY Free format text: FORMER OWNER: ZHANG JUNHU Effective date: 20140616 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20140616 Address after: 266061 Shandong Province, Qingdao city Laoshan District Songling Road No. 99 Applicant after: Qingdao University of Science & Technology Address before: Yunling road Laoshan District Qingdao city Shandong province 266061 No. 16 No. 5 Building 1 unit 401 room Applicant before: Zhang Junhu |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20141224 Termination date: 20190110 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |