CN102123349A - Method for accumulatively searching data set of wireless sensor network - Google Patents
Method for accumulatively searching data set of wireless sensor network Download PDFInfo
- Publication number
- CN102123349A CN102123349A CN2011100032704A CN201110003270A CN102123349A CN 102123349 A CN102123349 A CN 102123349A CN 2011100032704 A CN2011100032704 A CN 2011100032704A CN 201110003270 A CN201110003270 A CN 201110003270A CN 102123349 A CN102123349 A CN 102123349A
- Authority
- CN
- China
- Prior art keywords
- node
- message
- search
- data set
- searched
- 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
Images
Abstract
The invention relates to a method for accumulatively searching a data set of a wireless sensor network. At the beginning of any appointed source node in the wireless sensor network, a smaller node set stored with some data set is searched through limited message transmission (searching message is controlled in an as small as possible range near a source node during transmitting in the node). The method is realized in each node in a distributed manner, the searched node set dynamically changes in a searching process so that an accumulative searching mode is realized, and gradually enlarges until storage positions of all data in the searched data set are searched.
Description
Technical field
The invention belongs to networking technology area, be specifically related to a kind of wireless sensor network accumulation formula data set searching method.
Background technology
Wireless sensor network comprises a large amount of sensor nodes, but the information around the perception, and whether information that can perception has: ambient temperature, humidity even have certain animal via to cross or the like.Application based on wireless sensor network often need be searched for a data set, promptly gathers the coupling of carrying out relevant information according to the value of an information and searches.As application, often need begin to seek the sensor node record (the elk here, jackals and wolves and brave leopard are searched data set) of nearest elk, jackals and wolves and brave leopard process from certain specified sensor node at the zoo administration of having disposed sensor network.This just needs sensor network to begin route by query messages from arbitrary node, find nearest, be stored in the data set on some sensor node.For in wireless sensor network, effectively handling this search to a data set, need an effectively set searching method, make it possible to by the least possible message transmission, in as far as possible little transducer hunting zone, found from the nearest storage of certain specified node a set of node of searched data set.The most direct method is to the whole network broadcast data set searching request by the Sink node in the wireless sensor network (master control node), all nodes that receive searching request are searched the local image data of oneself, whether check has the data record that satisfies searching request, if have, then return the matched data collection to the Sink node, node continues to propagate searching request towards periphery simultaneously, all receives the set searching request and has done respective handling up to the whole network node.Existing method to the whole network broadcasting can find that all comprise the node of searched data set in the whole network, but the mode of broadcasting can consume a large amount of message transmission, and a lot of application do not need to find all nodes of having stored by searched data set, wastes time and energy.At present, by the least possible message transmission, in as far as possible little transducer hunting zone, find the searching method of searched data set not appear in the newspapers.
Summary of the invention
The present invention has overcome the deficiencies in the prior art, a kind of wireless sensor network accumulation formula data set searching method has been proposed, this method can begin by any assigned source node in a wireless sensor network, strive for by limited message propagation, find ferret out, reduced the message transmission capacity of search data collection, can significantly improve the wireless sensor network lifetime.
Technical scheme of the present invention is: wireless sensor network accumulation formula data set searching method, the assigned source node begins arbitrarily in a wireless sensor network, by limited message propagation (propagation of search message in node is controlled near the source node in the as far as possible little scope), seek the less set of node of having stored certain data set; This method is distributed realization in each node, and the dynamic change in search procedure of searched set of node realizes a kind of search of accumulating formula, and the node to be searched collection progressively enlarges, and is all found up to the memory location of all data of searched data centralization.
Described searching method is based on the distributed propagation of message, comprises search message, ack message and research message, and in search procedure, the intermediate node that meets search condition is called the center node.
Described search message sends by generating tree (spanning) mode, and the accumulation that is used to carry out data set is searched, and search message comprises four partial contents:
1) data set that will search for;
2) transmit the last hop node sign of this message;
3) the center node identification of this message of initialization;
4) the present jumping figure that transmits of this message.
Described ack message is that clean culture sends, and the node that has been used to store searched data centralization data is reported to the center node, and ack message comprises four partial contents:
1) data set that finds;
The node identification of the data set that 2) finds;
3) next-hop node of this message sign;
4) the destination center node identification of this message.
Described research message is that multicast sends, and is used for the center node and notifies its child node to carry out following two kinds of actions:
A) stop the transmission of search message;
B) or become next stage center node and continue the transmission of new search message.
Described message comprises three partial contents:
1) sign of the next stage center of appointment;
2) data set of being responsible for searching for by next stage center node of appointment;
3) next-hop node collection.
The present invention has following beneficial effect:
1) the method is propagated search message according to generating tree (spanning) mode, and spread scope is limited near the node that sets out, has stored on the set of node of searched data set, greatly reduced participating in the node number of search, thereby significantly reduced message propagation quantity.
2) the ack transmission of news process of returning to upper level center node after new center node finds is the clean culture process, can significantly reduce transmission of news quantity.
3) center node notice leaf node stop or the process that becomes next stage center are multicast process, can significantly reduce the transmission of news amount.
4) the present invention has reduced the message transmission capacity of search data collection, can significantly improve the wireless sensor network lifetime.
Description of drawings
Fig. 1 represents the schematic diagram of the method for the invention collection wireless sensor network data collection.
Among the figure, the 1. general node in the network; 2. the leaf node in the expression network; 3.search the transmission of message; 4.ack message is returned to the clean culture of center node.
Embodiment
Further specify below in conjunction with embodiment.
The present invention can begin by any assigned source node in a wireless sensor network, strive for seeking the less set of node of having stored certain data set by limited message propagation (propagation of search message in node is controlled near the source node in the as far as possible little scope).This method is distributed realization in each node, and the dynamic change in search procedure of searched set of node realizes a kind of search of accumulating formula, and the node to be searched collection progressively enlarges, and is all found up to the memory location of all data of searched data centralization.
As shown in Figure 1, the leaf node 2 in general node 1, the used network of algorithm and the transmission 3 of search message have been comprised in the network, this transmission is represented by solid arrow, has also comprised in addition and has represented ack message to return 4 to the clean culture of center node, dots among the figure.
The message based distributed propagation of the realization of this method, at first introduce the employed three class message of this method, search message, ack message, research message:
Search message: such message sends by generating tree (spanning) mode, and the accumulation that is used to carry out data set is searched.This type of message comprises 4 partial contents: the 1) data set that will search for of this message is designated as search.Q; 2) transmit the last hop node sign of this message, be designated as search.from; 3) the center node identification of this message of initialization is designated as search.fromCenter; 4) the present jumping figure that transmits of this message is designated as search.hop.
Ack message: such message is that clean culture sends, and the node that has been used to store searched data centralization data is reported to the center node.These message 3 partial contents: the data set that 1) finds is designated as ack.found; 2) find the node identification of ack.found data set, be designated as ack.source; 3) next-hop node of this message sign is designated as ack.next; 4) the destination center node identification of this message is designated as ack.toCenter
Research message: such message is that multicast sends, and is used for the center node and notifies its leaf node to carry out following two kinds of actions: a) stop the transmission of search message, b) or become next stage center node and continue the transmission of new search message.This type of message comprises 2 partial contents: the 1) sign of the next stage center of appointment is designated as research.newCenter; 2) data set of being responsible for searching for by next stage center node of appointment is designated as research.Q; 3) the next-hop node collection is designated as research.nexts
Pong message: such message is that message is jumped in clean culture 1, is used for the father node with the sign notice search message formation of oneself, so that allow father node add the route that sends this pong message to.This type of message comprises 2 partial contents: 1) send the node identification of this message, be designated as pong.from; 2) next of this message jumped the destination node sign, is designated as pong.to;
Each node maintenance has reverse routing table and forward routing table: oppositely routing table is formed on each node by pong message; The forward routing table forms in each node in the search message process again.Concrete forming process can be with reference to following distributed algorithm implementation procedure.
When initial, the reverse and forward routing table of each node all is an empty set.As Fig. 1 is example, and the method that the present invention proposes has realized that with the distributed execution on following described each node the follow node begins search data collection query={1,2,3,4,5}, progressively find the process of all data of data centralization in a kind of mode of accumulation:
(1) order is set out node as the center node, the operation of execution in step 2.
(2) if this center node is the node that sets out, a) search message of initialization then; B) make the search.from=node identification that sets out, the search.fromCenter=node identification that sets out, search.Q=query local (local stored data sets), search.hop=0; 3) if search.Q is that empty set then finishes; Otherwise enter step 4.
(3) if this node is to receive the center node that becomes after the research message that upper level center node sends, then this node carries out following operation: a) search message of initialization, b) make search.from=local node sign, search.fromCenter=local node sign, search.Q=research.Q (i.e. the search data collection that from the research message that upper level center node is received, comprises), search.hop=0; C) propagate this search message (node that receives this search message is carried out according to the operation of step 10) to neighbor node; D) operation of continuation step 4.
(4) this center node waits for that the long time of MaxHops*t1, (wherein MaxHops was these network edge two internodal maximum hop counts, t1 is that message propagation 1 is jumped spent maximum time), if no any ack message is returned in the MaxHops*t1 time, then think and search for failure, report (attention to upper level center node, if this center node itself is the then directly end search of node of setting out, return the search failed message) to the user; Otherwise, continue execution in step 5 operations.
(5) establishing the center node, the data set ack.found that comprises in all ack message of returning is carried out the set that union operation obtains is q1, if q1=search.Q then shows and found all data of data centralization, enters step 6; Otherwise enter step 7.
(6) this center node is carried out following operation: a) research message of initialization; B) make the research.Q=sky, the research.newCenter=sky; C) make the set of node that comprises in the local forward routing table of research.TOs=; D) all the leaf node multicasts to this center node send research message (the realization refer step 8 and 9 that multicast sends), thereby make its all leaf node stop transmission of news.Notice that the transmission of research message here is multicast operation (the multicast path is created in the forward routing table of each node according to last search and pong transmission of news process).
(7) this center node is carried out following operation: a) research message of initialization; B) make research.Q=search.Q q1; C) from the node that returns ack message, select the node of the maximum ack.found set of transmission (to have a plurality of as if both candidate nodes as new center node, that of selection node identification maximum), the new center node identification of selecting of note is c1, makes research.newCenter=c1; D) make the set of node that comprises in the local forward routing table of research.nexts=; E) all the leaf node multicasts to this center node send research message (refer step 8 and 9), thereby carry out according to the operation of step 3 again after making new center node (some leaf nodes) receive research message, other leaf nodes then stop transmission of news.
(8) [realization of research message multicast] any one receive that the node of research message checks at first whether oneself belongs to research.nexts, if not, then abandon this research message, otherwise, remember that the set of node that comprises in the forward routing table of oneself is p1, if p1 is that sky shows that then this message has arrived the leaf node, entering step 9 continues to carry out, otherwise, make research.nexts=q1, continue neighbours' multicast towards periphery.
(9) the leaf node of receiving research message checks whether research.newCenter equals the local node sign, if, then this leaf node is changed into new next stage center node, get back to step 3 and continue to carry out (create new search message, the data set that comprises in the research message is searched for); Otherwise, stop transmission of news.
(10) [search message is according to generating the realization that tree (spanning) mode is propagated] any one receive that the node of search message at first judges the search message of oneself whether once receiving from search.center, if then abandon this message; Otherwise this vertex ticks oneself is the leaf node, and carries out following operation: a) the hop count device search.hop in the search message is added 1 (being search.hop=search.hop+1); B) according to the content of search.fromCenter and search.from, in the reverse routing table in this locality, add a route (being used for returning ack message to the clean culture of the center of this message of initialization node in case of necessity) to search.fromCenter; C) (node of receiving this pong message adds a route that arrives the node that sends hello message in the local forward routing table of oneself to return pong message to a last hop node clean culture that sends this search message.Attention: the center node can utilize this route, and its leaf node is notified in multicast---stop the transmission of search message or become next stage center node continuing the transmission of new search message); D) this node receives that since one search message waits for the 2*search.hop*t1 time and (note, t1 is that message propagation 1 is jumped spent maximum time), if 2*search.hop*t1 did not receive research message in the time, then this node is changed into ordinary node and transmit this search message to neighbor node according to the operation continuation of step 10; Otherwise, execution in step 9; E) check whether search.Q ∩ local is empty set, if not the then also operation of continuous extra execution in step 11.
(11) the ack message unicast is returned the realization of center node, this node carries out following operation: 1) ack message of initialization, the common factor that comprises local node data set (being designated as local) and search.Q in this message makes that this data set is ack.found=search.Q ∩ local; B) make ack.toCenter=search.fromCenter, ack.source=local node sign; C) make ack.next=search the next-hop node sign of the arrival ack.toCenter that local oppositely routing table finds; D) carry out according to step 12, the node that points to ack.toCenter returns ack message, notes, the ack message is here carried out singlecast router by each node with reference to the reverse routing table of oneself and returned.
(12) node of receiving ack message checks that whether ack.next equals the local node sign, if not, then abandons this message; If, then make ack.next=search the next-hop node sign of the arrival ack.toCenter that local oppositely routing table finds, continue to transmit this message to next-hop node, arrive ack.toCenter until this message.
The present invention will " search " message propagates according to generating tree (spanning) mode, and spread scope is limited near the node that sets out, has stored on the set of node of searched data set, greatly reduced participating in the node number of search, thereby reduced message propagation quantity; New center node find the back to upper level center node to return " ack " transmission of news process be the clean culture process, can reduce transmission of news quantity; Center node notice leaf node stop or the process that becomes next stage center are multicast process, can reduce the transmission of news amount.More than 3 message transmission capacities that in wireless sensor network, greatly reduce the search data collection, therefore can improve the wireless sensor network lifetime.
Claims (4)
1. wireless sensor network is accumulated formula data set searching method, described searching method is based on the distributed propagation of message, comprise search message, ack message and research message, it is characterized in that: in search procedure, the intermediate node that meets search condition is called the center node, the assigned source node begins arbitrarily in a wireless sensor network, by limited message propagation (propagation of search message in node is controlled near the source node in the as far as possible little scope), seek the less set of node of having stored certain data set; This method is distributed realization in each node, and the dynamic change in search procedure of searched set of node realizes a kind of search of accumulating formula, and the node to be searched collection progressively enlarges, and is all found up to the memory location of all data of searched data centralization.
2. wireless sensor network accumulation formula data set searching method according to claim 1, it is characterized in that: described search message sends by generating tree (spanning) mode, the accumulation that is used to carry out data set is searched, and search message comprises four partial contents:
1) data set that will search for;
2) transmit the last hop node sign of this message;
3) the center node identification of this message of initialization;
4) the present jumping figure that transmits of this message.
3. wireless sensor network accumulation formula data set searching method according to claim 1, it is characterized in that: described ack message is that clean culture sends, the node that has been used to store searched data centralization data is reported to the center node, and ack message comprises four partial contents:
1) data set that finds;
The node identification of the data set that 2) finds;
3) next-hop node of this message sign;
4) the destination center node identification of this message.
4. wireless sensor network accumulation formula data set searching method according to claim 1, it is characterized in that: described research message is that multicast sends, and is used for the center node and notifies its child node to carry out following two kinds of actions:
A) stop the transmission of search message,
B) or become next stage center node and continue the transmission of new search message;
Described message comprises three partial contents:
1) sign of the next stage center of appointment;
2) data set of being responsible for searching for by next stage center node of appointment;
3) next-hop node collection.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110003270.4A CN102123349B (en) | 2011-01-10 | 2011-01-10 | Method for accumulatively searching data set of wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110003270.4A CN102123349B (en) | 2011-01-10 | 2011-01-10 | Method for accumulatively searching data set of wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102123349A true CN102123349A (en) | 2011-07-13 |
| CN102123349B CN102123349B (en) | 2014-06-18 |
Family
ID=44251764
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110003270.4A Expired - Fee Related CN102123349B (en) | 2011-01-10 | 2011-01-10 | Method for accumulatively searching data set of wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102123349B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1574683A (en) * | 2003-05-26 | 2005-02-02 | Lg电子株式会社 | Method and device for searching distributed signal sources of base station |
| CN101262393A (en) * | 2008-01-25 | 2008-09-10 | 华中科技大学 | Industrial wireless sensing network and communication method based on distributed coordinated frequency |
| CN101459914A (en) * | 2008-12-31 | 2009-06-17 | 中山大学 | Wireless sensor network node coverage optimization method based on ant colony algorithm |
| CN101471865A (en) * | 2007-12-28 | 2009-07-01 | 中国科学院软件研究所 | Method for high-efficiency data fusion in wireless sensor network |
-
2011
- 2011-01-10 CN CN201110003270.4A patent/CN102123349B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1574683A (en) * | 2003-05-26 | 2005-02-02 | Lg电子株式会社 | Method and device for searching distributed signal sources of base station |
| CN101471865A (en) * | 2007-12-28 | 2009-07-01 | 中国科学院软件研究所 | Method for high-efficiency data fusion in wireless sensor network |
| CN101262393A (en) * | 2008-01-25 | 2008-09-10 | 华中科技大学 | Industrial wireless sensing network and communication method based on distributed coordinated frequency |
| CN101459914A (en) * | 2008-12-31 | 2009-06-17 | 中山大学 | Wireless sensor network node coverage optimization method based on ant colony algorithm |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102123349B (en) | 2014-06-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Misra et al. | An ant swarm-inspired energy-aware routing protocol for wireless ad-hoc networks | |
| Prodhan et al. | TTL based routing in opportunistic networks | |
| CN101489276B (en) | Multicast routing method for Ad Hoc network | |
| CN101815287B (en) | Wireless sensor network routing method and system based on tree network | |
| EP2560321B1 (en) | Ethernet multicast method and device | |
| CN106161204B (en) | A kind of data transmission method in mobile social networking based on swarm intelligence | |
| CN101184037B (en) | Probability effective broadcast coefficient based flooding method | |
| JP2003258860A (en) | Method for managing multicast subscriber in mobile network | |
| CN103052130B (en) | A kind of wireless multimedia sensor network data fusion method based on rough set | |
| Khedr et al. | Successors of PEGASIS protocol: A comprehensive survey | |
| CN101873273A (en) | Routing forwarding method, routing node and wireless communication network | |
| CN104080112A (en) | Method for improving service reliability of wireless self-organizing network | |
| CN1691619A (en) | Method for implementing self-organizing network | |
| US20120147749A1 (en) | Routing apparatus and method for mobile ad-hoc network | |
| CN105072030A (en) | NDN (Named Data Networking) route system based on content clustering, and clustering query method therefor | |
| CN101364945A (en) | Method for realizing unicast energy-saving routing protocol based on cross-layer mechanism on Ad Hoc network | |
| CN104661275A (en) | Method for transmitting data in opportunity network | |
| CN101494599A (en) | Method for implementing multicast energy-saving routing protocol of Ad Hoc network based on layer-striding mechanism | |
| CN101835099A (en) | Large-scale sensor network routing method based on cluster and RREP broadcast | |
| CN109618368B (en) | Wireless sensor network data fusion scheduling algorithm for time delay and power consumption joint optimization | |
| CN102075974A (en) | Method for searching high contiguity resources in wireless sensor network | |
| CN103209207B (en) | A kind of ordinary node of peer-to-peer network system is found and maintenance of neighbor nodal method | |
| CN102123349B (en) | Method for accumulatively searching data set of wireless sensor network | |
| CN102711213A (en) | Wireless sensor network routing method based on residual energy | |
| CN101931543A (en) | Method for efficiently managing dynamic node based on overlay network multicast system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| 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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20140616 Address after: 266061 Shandong Province, Qingdao city Laoshan District Songling Road No. 99 Patentee 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 Patentee before: Zhang Junhu |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140618 Termination date: 20190110 |