CN103561444A - Method and device for collecting data in sensor network - Google Patents

Method and device for collecting data in sensor network Download PDF

Info

Publication number
CN103561444A
CN103561444A CN201310556943.8A CN201310556943A CN103561444A CN 103561444 A CN103561444 A CN 103561444A CN 201310556943 A CN201310556943 A CN 201310556943A CN 103561444 A CN103561444 A CN 103561444A
Authority
CN
China
Prior art keywords
path
node
tree topology
energy consumption
root node
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
Application number
CN201310556943.8A
Other languages
Chinese (zh)
Other versions
CN103561444B (en
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.)
WUXI SAIRUITECH CO Ltd
Original Assignee
WUXI SAIRUITECH CO Ltd
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 WUXI SAIRUITECH CO Ltd filed Critical WUXI SAIRUITECH CO Ltd
Priority to CN201310556943.8A priority Critical patent/CN103561444B/en
Publication of CN103561444A publication Critical patent/CN103561444A/en
Application granted granted Critical
Publication of CN103561444B publication Critical patent/CN103561444B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention discloses a method and device for collecting data in a sensor network. The method comprises the steps of selecting a node on a tree topology at random, and converting the tree topology into a directed tree with the node as a root node; incessantly breaking the tree tropology until the size of a sub-tree is one, and respectively finding the optimal data collecting path of the tree tropology and the optimal data collecting path passing through a corresponding root node in the sub-tree after each time of breaking; storing optimal data collecting paths obtained in each time into an alternative set; searching for the path smallest in overall sensing data communication energy consumption in the alternative set, wherein the path smallest in overall sensing data communication energy consumption is an overall optimal data collecting path, and nodes constituting the overall optimal data collecting path are optimal rendezvous points. The method and device reduce the energy consumption of data collection and improve data transmission efficiency.

Description

The method of the Data Collection in a kind of sensor network and device
Technical field
The embodiment of the present invention relates to radio network technique, relates in particular to method and the device of the Data Collection in a kind of sensor network.
Background technology
Wireless sensor network (Wireless Sensor Networks, WSNs) is a kind of self-organizing network consisting of a plurality of sensor nodes.The mode that the information exchange that sensor node in this network obtains detection is crossed wireless multi-hop transmission sends to base station, then by base station, these information is carried out to analyzing and processing.The function of wireless sensor network is that management for environment monitor information is collected and managed.Therefore, Data Collection is the basic task of sensor network.Data Collection refers to that the perception information that the sensor node in network is collected sends base station to, is then processed information by base station.The general fashion of Data Collection is wireless multi-hop transmission, and each node is packaged into packet by the perception information of self, and this packet arrives base station through other node-routings in network.
In traditional Data Collection mode, base station is fixed on to the somewhere that transducer is deployed to ensure effective monitoring and control of illegal activities in region, the mode that other node in network transmits by wireless multi-hop sends the perception information of self to base station, then by base station, perception information is carried out to analyzing and processing.Fig. 1 is the schematic diagram of the Data Collection of fixed base stations in prior art, as shown in Figure 1, the advantage of this information mode is simple, and network designer only need to guarantee, under the prerequisite of the full UNICOM of network, base station can be seated in to the optional position in network.Because base station has been fixed on the somewhere in network, sensor node within jumping apart from base station one need to be born more data retransmission task, thereby take the lead in ruing out of energy and " death ", finally cause network paralysis, shortened greatly the life cycle of network.In prior art, in the information scheme under base station is fixing, the way of avoiding network to paralyse is too early divided three classes conventionally: the first, and design low-power consumption Routing Protocol; Second: reasonably use multi-stage channel to carry out transfer of data; The the 3rd: in base station, around dispose the more or stronger node of ability and take turns to operate.
First two method is still being born too much forwarding task owing to being positioned at base station node around, therefore can not fundamentally solve the uneven problem of load.The third method, owing to having reduced the coverage rate of network, has increased lower deployment cost, so practicality is not strong.In prior art, by increasing mobile device to base station, make base station movement, then constantly adjust the position of base station, offered load can be split on different nodes, slow down the appearance of load uneven phenomenon.In the Data Collection mode of this movable type, because sensor node only need be born the data retransmission task of self and a small amount of other nodes, so in the node infonnation collection process of taking turns at each, energy consumes identical.The mode that relies on mobile base station to carry out Data Collection can be divided into two classes: the first kind is that mobile base station carries out directly accessing and collecting data to node.Be within base station moves to the communication range of each node in turn, the mode of node by single-hop directly and base station communication.The advantage of this mode is when node only need arrive in mobile base station to send the perception data of self to the other side, and without the data retransmission task of bearing other node, so energy consumption is lower.Yet because the movement velocity of base station is slower, cause larger data delay, practicality is lower.Equations of The Second Kind is that base station only rests on specific Nodes, is called convergent point (Rendezvous Point).Other nodes send to perception data apart from self nearest convergent point by the mode of multi-hop transmission, then by mobile base station, move to convergent point place information is unified to collect.
In this data collection plan of utilizing convergent point, under can requiring in the difference of network delay and energy consumption, make compromise.For example, fire hazard monitoring, this class of intrusion detection to the higher scene of data delay requirement in, can select less convergent point, mobile base station only need spend the short period and just can collect at convergent point place overall perception data.And in Humidity Detection, this class of air quality monitoring, in the lower scene of data delay requirement, can be selected more convergent point, reduce the energy that transducer consumes due to data retransmission, extend the life cycle of Sensor Network.It is large that but the mode of carrying out Data Collection by convergent point in prior art still exists energy consumption, the problem that data transmission efficiency is low.
Summary of the invention
In view of this, the embodiment of the present invention provides method and the device of the Data Collection in a kind of sensor network, to reduce the energy consumption of Data Collection in prior art, improves data transmission efficiency.
On the one hand, the embodiment of the present invention provides the method for the Data Collection in a kind of sensor network, and described method comprises:
Choose at random a node on tree topology, described tree topology is converted into and take the directed tree that described node is root node;
Described tree topology is constantly broken minute, until subtree size is 1, find respectively described tree topology and in the subtree after broken minute, through the optimal data of corresponding root node, collect path at every turn, and depositing the optimal data collection path at every turn obtaining in alternative concentrating;
In the alternative path of searching overall perception data communication energy consumption minimum of concentrating, the path of described overall perception data communication energy consumption minimum is global optimum's Data Collection path, and the node that forms described global optimum's Data Collection path is optimum aggregation point.
Further, describedly find respectively the optimal data through corresponding root node in described tree topology and the subtree after each broken minute to collect path, and the optimal data at every turn obtaining is collected to path deposit alternative concentrating in, comprising:
According to the optimal data of the tree topology of looking for or subtree at every turn, collect path, by the described tree topology directed tree that to be converted into the root node of described tree topology or the root node of described subtree of take be root node;
Adopt mode from bottom to top to travel through described tree topology, calculate each node corresponding take the data generation rate sum of all nodes in the subtree that this node is root, and calculate the required transmission energy consumption consumption figures of global information of described root node;
Adopt top-down mode to travel through described tree topology, calculate the required transmission energy consumption consumption figures of global information that each node is corresponding, and calculate the total energy consumption of saving corresponding to length through the root node path in preset length;
Combine in path to the described length through root node in preset length, the total energy consumption of the saving that path after calculation combination is corresponding, and be kept at alternative concentrating;
From described alternative concentrating, choose optimal data collection path, and calculate the required transmission energy consumption consumption figures of global information corresponding to this path, and deposit described optimal data collection path and the corresponding required transmission energy consumption consumption figures of global information in alternative concentrating, wherein, described optimal data is collected the maximum path of total energy consumption that path is saving.
Further, it is described that to find respectively in described tree topology and the subtree after each broken minute the time of implementation complexity each time of collecting path through the optimal data of corresponding root node be O (NlgN), wherein, N represents the total nodes in described transmitter network.
Further, the time of implementation complexity of described method is O (Nlg 2n), wherein, N represents the total nodes in described sensor network.
Further, at a described node of choosing at random on tree topology, described tree topology is converted into and take the directed tree that described node is root, also comprise:
Adopt minimal spanning tree algorithm that graph topology is converted into tree topology.
On the other hand, the embodiment of the present invention also provides the device of the Data Collection in a kind of sensor network, and described device comprises:
Root node is chosen module, for choosing at random a node on tree topology, described tree topology is converted into and take the directed tree that described node is root node;
First searches module, for described tree topology is constantly broken minute, until subtree size is 1, find respectively described tree topology and in the subtree after broken minute, through the optimal data of corresponding root node, collect path at every turn, and depositing the optimal data collection path at every turn obtaining in alternative concentrating;
Second searches module, be used in the alternative path of searching overall perception data communication energy consumption minimum of concentrating, the path of described overall perception data communication energy consumption minimum is global optimum's Data Collection path, and the node that forms described global optimum's Data Collection path is optimum aggregation point.
Further, described first search module and comprise:
Transformant module, for collecting path according to the optimal data of the tree topology looked for or subtree at every turn, by the described tree topology directed tree that to be converted into the root node of described tree topology or the root node of described subtree of take be root node;
The first calculating sub module, for adopting mode from bottom to top to travel through described tree topology, calculate each node corresponding take the data generation rate sum of all nodes in the subtree that this node is root, and calculate the required transmission energy consumption consumption figures of global information of described root node;
The second calculating sub module, be used for adopting top-down mode to travel through described tree topology, calculate the required transmission energy consumption consumption figures of global information that each node is corresponding, and calculate the total energy consumption of saving corresponding to length through the root node path in preset length;
The 3rd calculating sub module, for to the described length through root node the path in preset length combine, the total energy consumption of the saving that path after calculation combination is corresponding, and be kept at alternative concentrating;
Choose submodule, for choosing optimal data collection path from described alternative concentrating, and calculate the required transmission energy consumption consumption figures of global information corresponding to this path, and deposit described optimal data collection path and the corresponding required transmission energy consumption consumption figures of global information in alternative concentrating, wherein, described optimal data is collected the maximum path of total energy consumption that path is saving.
Further, described first searches that described in module, to find respectively in described tree topology and the subtree after each broken minute the time of implementation complexity each time of collecting path through the optimal data of corresponding root node be O (NlgN), wherein, N represents the total nodes in described transmitter network.
The time of implementation complexity of the method that further, described device is realized is O (Nlg 2n), wherein, N represents the total nodes in described sensor network.
Further, described device also comprises:
Topology conversion module, for adopting minimal spanning tree algorithm that graph topology is converted into tree topology.
The method of the Data Collection in the sensor network that the embodiment of the present invention provides, Apparatus and system is by constantly breaking minute described tree topology according to the root node of tree topology, and the optimal data of calculating described tree topology and the subtree after each broken minute is collected path, combine the optimal data of described tree topology and the subtree after each broken minute and collect path, in path after combination, search global optimum's Data Collection path, the node that forms described global optimum's Data Collection path is optimum aggregation point, at optimum aggregation point, carry out Data Collection, reduced the energy consumption of Data Collection, improved data transmission efficiency, and load balancing.
Accompanying drawing explanation
Fig. 1 is the schematic diagram of the Data Collection of fixed base stations in prior art;
Fig. 2 is the flow chart of the method for the Data Collection in the sensor network that provides of first embodiment of the invention;
Fig. 3 a is the schematic diagram of the tree topology in the method for the Data Collection in the sensor network that provides of first embodiment of the invention;
Fig. 3 b is that the root node m of the selected tree topology in the method for the Data Collection in the sensor network that provides of first embodiment of the invention is converted into tree topology in the schematic diagram of directed tree;
Fig. 3 c is the schematic diagram in the length from root node m in the method for the Data Collection in the sensor network that provides of the first embodiment of the invention path in preset length;
Fig. 3 d is the schematic diagram that the optimum of the root node m through tree topology in the method for the Data Collection in the sensor network that provides of first embodiment of the invention is collected data path
Fig. 3 e is the schematic diagram that the optimum of the child nodes of the root node m through tree topology in the method for the Data Collection in the sensor network that provides of first embodiment of the invention is collected data path;
Fig. 3 f is the schematic diagram that in the method for the Data Collection in the sensor network that provides of first embodiment of the invention, data path and optimum aggregation point are collected by global optimum;
Fig. 4 is the schematic diagram of the device of the Data Collection in the sensor network that provides of second embodiment of the invention.
Embodiment
Below in conjunction with drawings and Examples, the present invention is described in further detail.Be understandable that, specific embodiment described herein is only for explaining the present invention, but not limitation of the invention.It also should be noted that, for convenience of description, in accompanying drawing, only show part related to the present invention but not full content.
Fig. 2 shows the first embodiment of the present invention.
Fig. 2 is the realization flow figure of the method for the Data Collection in the sensor network that provides of first embodiment of the invention, and details are as follows for the method:
In step 201, choose at random a node on tree topology, described tree topology is converted into and take the directed tree that described node is root node.
Choose at random a node on tree topology, the root node using this node as described tree topology, described tree topology is converted into and take the directed tree that this node is root node.As preferred embodiment a kind of, can choose the node in the centre position that is positioned at described tree topology, using this node as the root node of described tree topology, described tree topology is converted into and take the directed tree that this node is root node.Fig. 3 a is the schematic diagram of the tree topology in the method for the Data Collection in the sensor network that provides of first embodiment of the invention, and Fig. 3 b is that the root node m of the selected tree topology in the method for the Data Collection in the sensor network that provides of first embodiment of the invention is converted into tree topology in the schematic diagram of directed tree.As shown in Figure 3 a and Figure 3 b shows, the node d of the selected Fig. 3 a of Fig. 3 b is root node m, and described tree topology is converted into and take the directed tree that root node m is root node.
Exemplary, at a described node of choosing at random on tree topology, described tree topology is converted into and take the directed tree that described node is root, also comprise:
Adopt minimal spanning tree algorithm that graph topology is converted into tree topology.
Before step 201, also comprise: adopt minimal spanning tree algorithm that graph topology is converted into tree topology.If the topology providing is graph topology, described graph topology is converted into tree topology.After being converted into tree topology, there is advantage: because in graph topology, between any a pair of node, conventionally have mulitpath, tend to cause loop checking installation, make packet cannot successfully be sent to destination, and in tree topology, do not have such problem; Tree topology is usingd ETX value as link energy consumption criterion, and adopting minimal spanning tree algorithm to carry out preliminary treatment to graph topology is that network link is done to preliminary optimization; In the application of many sensor networks, all adopt tree topology, therefore, adopt minimal spanning tree algorithm to carry out to graph topology the expansion that preliminary treatment can guarantee algorithm.
In step 202, described tree topology is constantly broken minute, until subtree size is 1, finds respectively described tree topology and in the subtree after broken minute, through the optimal data of corresponding root node, collect path at every turn, and depositing the optimal data collection path at every turn obtaining in alternative concentrating.
According to the root node of described tree topology, described tree topology is broken minute, the subtree that the child nodes that obtains take described root node is root, according to same method, according to described child nodes, described tree topology is constantly broken minute again, until subtree size is 1.
In order to find Data Collection path optimum on given tree topology, need to find through the optimal data of each node on described tree topology and collect path.Therefore, find optimal data and collect Route Dependence in the optimal data collection path of finding through given node.Therefore first need design to find the Data Collection routing algorithm through given node.
Given first is found the calculation expression of using through needing in the Data Collection routing algorithm of given node.
Theorem 1. is for take the given tree topology that node r is root, and establishing node v is any child nodes of node r, has:
C save(P r,v)=C save(p r,parent(r))+κ v·c(v,parent(v))
Wherein, C save(p u,v) be the ETX transmission value of the total energy consumption that can save when convergent point is expanded to node v from node u, C save(P r,v) be the ETX transmission value of the total energy consumption that can save when convergent point is expanded to node v from node r, C save(p r, parent (r)) be the ETX transmission value of total energy consumption that convergent point can be saved when node r expands to the father node of node r, κ vfinger be take the data generation rate of all nodes in the subtree that node v is root, and c (v, parent (v)) is the energy consumption cost in the path of the father node from node v to node v.
It is wireless propagation path p that theorem 2. is established node z u,von any relay point, have:
C(R 1)=C(z)-C save(p u,z)-C save(p z,v)
Wherein, C (R 1) represent that the required transmission energy consumption consumption figures in path through node z, C (z) represent that all nodes on tree topology send packet to the required total energy consumption of node v, C save( pu, z) be the ETX transmission value of the total energy consumption that can save when convergent point is expanded to node z from node u, C save( pz, v) be the ETX transmission value of the total energy consumption that can save when convergent point is expanded to node v from node z.
Theorem 3. is established the root node that node s is tree topology, and node v is any one node on tree topology, has:
C(v)=C(parent(v))+c(v,parent(v))·(κ s-2·κ v)
Wherein, C (v) represents that all nodes on tree topology send packet to the required total energy consumption of node v, C (parent (v)) represents that all nodes on tree topology send packet to the required total energy consumption of the father node of node v, c (v, parent (v)) be the energy consumption cost in the path of the father node from node v to node v, κ sthe data generation rate that refers to all nodes on whole tree topology, κ vfinger be take the data generation rate of all nodes in the subtree that node v is root.
Exemplary, described finding respectively in described tree topology and the subtree after each broken minute collected path through the optimal data of corresponding root node, and the optimal data at every turn obtaining is collected to path deposits alternative concentrating in, comprises following sub-step:
Sub-step 2021, collects path according to the optimal data of the tree topology of looking for or subtree at every turn, by the described tree topology directed tree that to be converted into the root node of described tree topology or the root node of described subtree of take be root node.
When the optimal data of finding tree topology is collected path, just tree topology is converted into and take the directed tree that the root node of described tree topology is root node, when the optimal data of finding the subtree after each broken minute is collected path, just using and break the root node of the subtree after dividing as the root node of whole tree topology at every turn, tree topology is converted into directed tree, supposes that the root node of the tree topology after transforming is s.
Sub-step 2022, adopts mode from bottom to top to travel through described tree topology, calculate each node corresponding take the data generation rate of all nodes in the subtree that this node is root, and calculate the required transmission energy consumption consumption figures of global information of described root node.
Adopt mode from bottom to top to travel through described tree topology, calculate the data generation rate sum κ of take all nodes in the subtree that this node v is root that each node v is corresponding v, and according to the formula of theorem 3, calculating the required transmission energy consumption consumption figures of global information of described root node s, the required transmission energy consumption consumption figures of global information of described root node s is that all nodes on tree topology send packets to the required total energy consumption of node v.
Sub-step 2023, adopts top-down mode to travel through described tree topology, calculates the required transmission energy consumption consumption figures of global information that each node is corresponding, and calculates the total energy consumption of saving corresponding to length through the root node path in preset length.
Adopt top-down mode to travel through described tree topology, according to the formula of theorem 3, calculate respectively the required transmission energy consumption consumption figures of global information that each node is corresponding, all nodes that the required transmission energy consumption consumption figures of global information that each node of described calculating is corresponding calculates respectively on tree topology send packets to the required total energy consumption of each node, and calculate according to the formula of theorem 1 total energy consumption that is no more than saving corresponding to the path of preset length from root node s length.Preset length represents the path of the convergent point of needs expansion, and preset length can be set as required by user.
Fig. 3 c is the schematic diagram in the length from root node m in the method for the Data Collection in the sensor network that provides of the first embodiment of the invention path in preset length, as shown in Figure 3 c, the line of the overstriking in Fig. 3 c represents length from the root node m path in preset length, be m->b->a, m->b->c, m->e->i, m->f->g and m->f->h.
Sub-step 2024, combine in the path to the described length through root node in preset length, the total energy consumption of the saving that path after calculation combination is corresponding, and be kept at alternative concentrating.
Combine the path of the described length through root node s in preset length, according to the total energy consumption of saving corresponding to the path the total energy consumption calculation combination of saving corresponding to the path that is no more than preset length from root node s length, the total energy consumption of the saving that path after combination is corresponding is the total energy consumption sum of saving corresponding to each path in the path of combination, and the total energy consumption of the path after combination and corresponding saving thereof is kept to alternative concentrating.
Fig. 3 d is the schematic diagram that the optimum of the root node m through tree topology in the method for the Data Collection in the sensor network that provides of first embodiment of the invention is collected data path, as shown in Figure 3 d, through the optimal data of root node m, collecting path is e->m->f.Fig. 3 e is the schematic diagram that the optimum of the child nodes of the root node m through tree topology in the method for the Data Collection in the sensor network that provides of first embodiment of the invention is collected data path, as shown in Figure 3 e, it is a->b->c that the optimal data of the child nodes b of process root node m is collected path, it is e->i->k that the optimal data of the child nodes e of process root node m is collected path, it is h->f->g that the optimal data of the child nodes f of process root node m is collected path.
Sub-step 2025, from described alternative concentrating, choose optimal data collection path, and calculate the required transmission energy consumption consumption figures of global information corresponding to this path, and deposit described optimal data collection path and the corresponding required transmission energy consumption consumption figures of global information in alternative concentrating, wherein, described optimal data is collected the maximum path of total energy consumption that path refers to saving.
From the described alternative maximum path of total energy consumption of choosing saving of concentrating, this path is optimal data and collects path, according to the formula of theorem 2, calculate the required transmission energy consumption consumption figures of global information corresponding to this path, and deposit described optimal data collection path and the corresponding required transmission energy consumption consumption figures of global information in alternative concentrating.
Exemplary, it is described that to find respectively in described tree topology and the subtree after each broken minute the time of implementation complexity each time of collecting path through the optimal data of corresponding root node be O (NlgN), wherein, N represents the total nodes in described transmitter network.
In step 203, in the alternative path of searching overall perception data communication energy consumption minimum of concentrating, the path of described overall perception data communication energy consumption minimum is global optimum's Data Collection path, and the node that forms described global optimum's Data Collection path is optimum aggregation point.
Combine alternative concentrated optimal data and collect path, the overall perception data communication energy consumption in the path after calculation combination, each optimal data in the path of combination is collected the required transmission energy consumption consumption figures sum of global information corresponding to path, and in the path after combination, search the path of overall perception data communication energy consumption minimum, this path is global optimum's Data Collection path, and the node that forms described global optimum's Data Collection path is optimum aggregation point.
Fig. 3 f is the schematic diagram that in the method for the Data Collection in the sensor network that provides of first embodiment of the invention, data path and optimum aggregation point are collected by global optimum, as shown in Fig. 3 f, global optimum's Data Collection path is that node e, m and the f on e->m->f ,Gai global optimum's Data Collection path is optimum aggregation point.
Exemplary, the time of implementation complexity of described method is O (Nlg 2n), wherein, N represents the total nodes in described sensor network.The time of implementation complexity of the method for the Data Collection in this sensor network is O (Nlg 2n).
The present embodiment is by the root node of selected tree topology, according to described root node, described tree topology is constantly broken minute, and the optimal data of calculating described tree topology and the subtree after each broken minute is collected path, combine the optimal data of described tree topology and the subtree after each broken minute and collect path, in path after combination, search the path of perception data communication energy consumption minimum, this path is global optimum's Data Collection path, the node that forms described global optimum's Data Collection path is optimum aggregation point, at optimum aggregation point, carry out Data Collection, reduced the energy consumption of Data Collection, improved data transmission efficiency, and load balancing.
Fig. 4 shows the second embodiment of the present invention.
Fig. 4 is the schematic diagram of the device of the Data Collection in the sensor network that provides of second embodiment of the invention.The device of the Data Collection in the sensor network described in the present embodiment is for realizing the method for the Data Collection of the sensor network described in the first embodiment.As shown in Figure 4, the device of the Data Collection in the sensor network described in the present embodiment comprises: root node is chosen module 401, first and searched module 402 and second and search module 403.
Wherein, root node is chosen module 401 for choosing at random a node on tree topology, and described tree topology is converted into and take the directed tree that described node is root node.Described root node is chosen the function that module realizes for performing step 201, repeats no more here.
First searches module 402 for described tree topology constantly being broken minute, until subtree size is 1, find respectively described tree topology and in the subtree after broken minute, through the optimal data of corresponding root node, collect path at every turn, and depositing the optimal data collection path at every turn obtaining in alternative concentrating.
Exemplary, described first searches module comprises:
Transformant module, for collecting path according to the optimal data of the tree topology looked for or subtree at every turn, by the described tree topology directed tree that to be converted into the root node of described tree topology or the root node of described subtree of take be root node;
The first calculating sub module, for adopting mode from bottom to top to travel through described tree topology, calculate each node corresponding take the data generation rate sum of all nodes in the subtree that this node is root, and calculate the required transmission energy consumption consumption figures of global information of described root node;
The second calculating sub module, be used for adopting top-down mode to travel through described tree topology, calculate the required transmission energy consumption consumption figures of global information that each node is corresponding, and calculate the total energy consumption of saving corresponding to length through the root node path in preset length;
The 3rd calculating sub module, for to the described length through root node the path in preset length combine, the total energy consumption of the saving that path after calculation combination is corresponding, and be kept at alternative concentrating;
Choose submodule, for choosing optimal data collection path from described alternative concentrating, and calculate the required transmission energy consumption consumption figures of global information corresponding to this path, and deposit described optimal data collection path and the corresponding required transmission energy consumption consumption figures of global information in alternative concentrating, wherein, described optimal data is collected the maximum path of total energy consumption that path is saving.
Exemplary, described first searches that described in module, to find respectively in described tree topology and the subtree after each broken minute the time of implementation complexity each time of collecting path through the optimal data of corresponding root node be O (NlgN), wherein, N represents the total nodes in described transmitter network.
Second searches module 403 in the alternative path search overall perception data communication energy consumption minimum of concentrating, the path of described overall perception data communication energy consumption minimum is global optimum's Data Collection path, and the node that forms described global optimum's Data Collection path is optimum aggregation point.Described second searches the function that delivery piece is realized for performing step 203, repeats no more here.
Exemplary, the time of implementation complexity of the method that described device is realized is O (Nlg 2n), wherein, N represents the total nodes in described sensor network.
Exemplary, described device also comprises:
Topology conversion module, for adopting minimal spanning tree algorithm that graph topology is converted into tree topology.
The present embodiment chooses by root node the root node that module is chosen tree topology, first searches module take root node and chooses root node that module chooses and constantly tree topology is broken minute as starting point, and find respectively in described tree topology and the subtree after each broken minute and collect path through the optimal data of corresponding root node, deposit alternative concentrating in, second searches module searches global optimum's Data Collection path and optimum aggregation point alternative concentrating, reduced the energy consumption of Data Collection, improved data transmission efficiency, and load balancing.
Note, above are only preferred embodiment of the present invention and institute's application technology principle.Skilled person in the art will appreciate that and the invention is not restricted to specific embodiment described here, can carry out for a person skilled in the art various obvious variations, readjust and substitute and can not depart from protection scope of the present invention.Therefore, although the present invention is described in further detail by above embodiment, the present invention is not limited only to above embodiment, in the situation that not departing from the present invention's design, can also comprise more other equivalent embodiment, and scope of the present invention is determined by appended claim scope.

Claims (10)

1. a method for the Data Collection in sensor network, is characterized in that, described method comprises:
Choose at random a node on tree topology, described tree topology is converted into and take the directed tree that described node is root node;
Described tree topology is constantly broken minute, until subtree size is 1, find respectively described tree topology and in the subtree after broken minute, through the optimal data of corresponding root node, collect path at every turn, and depositing the optimal data collection path at every turn obtaining in alternative concentrating;
In the alternative path of searching overall perception data communication energy consumption minimum of concentrating, the path of described overall perception data communication energy consumption minimum is global optimum's Data Collection path, and the node that forms described global optimum's Data Collection path is optimum aggregation point.
2. method according to claim 1, it is characterized in that, describedly find respectively the optimal data through corresponding root node in described tree topology and the subtree after each broken minute to collect path, and the optimal data at every turn obtaining is collected to path deposit alternative concentrating in, comprising:
According to the optimal data of the tree topology of looking for or subtree at every turn, collect path, by the described tree topology directed tree that to be converted into the root node of described tree topology or the root node of described subtree of take be root node;
Adopt mode from bottom to top to travel through described tree topology, calculate each node corresponding take the data generation rate sum of all nodes in the subtree that this node is root, and calculate the required transmission energy consumption consumption figures of global information of described root node;
Adopt top-down mode to travel through described tree topology, calculate the required transmission energy consumption consumption figures of global information that each node is corresponding, and calculate the total energy consumption of saving corresponding to length through the root node path in preset length;
Combine in path to the described length through root node in preset length, the total energy consumption of the saving that path after calculation combination is corresponding, and be kept at alternative concentrating;
From described alternative concentrating, choose optimal data collection path, and calculate the required transmission energy consumption consumption figures of global information corresponding to this path, and deposit described optimal data collection path and the corresponding required transmission energy consumption consumption figures of global information in alternative concentrating, wherein, described optimal data is collected the maximum path of total energy consumption that path is saving.
3. method according to claim 2, it is characterized in that, it is described that to find respectively in described tree topology and the subtree after each broken minute the time of implementation complexity each time of collecting path through the optimal data of corresponding root node be O (NlgN), wherein, N represents the total nodes in described transmitter network.
4. method according to claim 2, is characterized in that, the time of implementation complexity of described method is O (Nlg 2n), wherein, N represents the total nodes in described sensor network.
5. according to the method described in any one in claim 1-4, it is characterized in that, at a described node of choosing at random on tree topology, described tree topology be converted into and take the directed tree that described node is root, also comprise:
Adopt minimal spanning tree algorithm that graph topology is converted into tree topology.
6. a device for the Data Collection in sensor network, is characterized in that, described device comprises:
Root node is chosen module, for choosing at random a node on tree topology, described tree topology is converted into and take the directed tree that described node is root node;
First searches module, for described tree topology is constantly broken minute, until subtree size is 1, find respectively described tree topology and in the subtree after broken minute, through the optimal data of corresponding root node, collect path at every turn, and depositing the optimal data collection path at every turn obtaining in alternative concentrating;
Second searches module, be used in the alternative path of searching overall perception data communication energy consumption minimum of concentrating, the path of described overall perception data communication energy consumption minimum is global optimum's Data Collection path, and the node that forms described global optimum's Data Collection path is optimum aggregation point.
7. device according to claim 6, is characterized in that, described first searches module comprises:
Transformant module, for collecting path according to the optimal data of the tree topology looked for or subtree at every turn, by the described tree topology directed tree that to be converted into the root node of described tree topology or the root node of described subtree of take be root node;
The first calculating sub module, for adopting mode from bottom to top to travel through described tree topology, calculate each node corresponding take the data generation rate sum of all nodes in the subtree that this node is root, and calculate the required transmission energy consumption consumption figures of global information of described root node;
The second calculating sub module, be used for adopting top-down mode to travel through described tree topology, calculate the required transmission energy consumption consumption figures of global information that each node is corresponding, and calculate the total energy consumption of saving corresponding to length through the root node path in preset length;
The 3rd calculating sub module, for to the described length through root node the path in preset length combine, the total energy consumption of the saving that path after calculation combination is corresponding, and be kept at alternative concentrating;
Choose submodule, for choosing optimal data collection path from described alternative concentrating, and calculate the required transmission energy consumption consumption figures of global information corresponding to this path, and deposit described optimal data collection path and the corresponding required transmission energy consumption consumption figures of global information in alternative concentrating, wherein, described optimal data is collected the maximum path of total energy consumption that path is saving.
8. device according to claim 7, it is characterized in that, described first searches that described in module, to find respectively in described tree topology and the subtree after each broken minute the time of implementation complexity each time of collecting path through the optimal data of corresponding root node be O (NlgN), wherein, N represents the total nodes in described transmitter network.
9. device according to claim 7, is characterized in that, the time of implementation complexity of the method that described device is realized is O (Nlg 2n), wherein, N represents the total nodes in described sensor network.
10. according to the device described in any one in claim 6-9, it is characterized in that, described device also comprises:
Topology conversion module, for adopting minimal spanning tree algorithm that graph topology is converted into tree topology.
CN201310556943.8A 2013-11-11 2013-11-11 A kind of method and device of data collection in sensor network Active CN103561444B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310556943.8A CN103561444B (en) 2013-11-11 2013-11-11 A kind of method and device of data collection in sensor network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310556943.8A CN103561444B (en) 2013-11-11 2013-11-11 A kind of method and device of data collection in sensor network

Publications (2)

Publication Number Publication Date
CN103561444A true CN103561444A (en) 2014-02-05
CN103561444B CN103561444B (en) 2018-06-26

Family

ID=50015552

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310556943.8A Active CN103561444B (en) 2013-11-11 2013-11-11 A kind of method and device of data collection in sensor network

Country Status (1)

Country Link
CN (1) CN103561444B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103826279A (en) * 2014-03-07 2014-05-28 西南大学 Mobile data collection method with minimized concurrent data uploading and collecting cost
CN104185191A (en) * 2014-08-26 2014-12-03 南京邮电大学 Wireless sensor network data collecting method based on multiple data collection binary tree

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102612080A (en) * 2012-03-09 2012-07-25 武汉理工大学 Minimum-energy-consumption self-adaption convergent routing method on basis of second-generation wavelet zero tree encoding

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102612080A (en) * 2012-03-09 2012-07-25 武汉理工大学 Minimum-energy-consumption self-adaption convergent routing method on basis of second-generation wavelet zero tree encoding

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
JUNZHAO DU等: "Rendezvous Data Collection Using a Mobile Element in Heterogeneous Sensor Networks", 《INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS》 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103826279A (en) * 2014-03-07 2014-05-28 西南大学 Mobile data collection method with minimized concurrent data uploading and collecting cost
CN104185191A (en) * 2014-08-26 2014-12-03 南京邮电大学 Wireless sensor network data collecting method based on multiple data collection binary tree
CN104185191B (en) * 2014-08-26 2017-06-16 南京邮电大学 The wireless sense network method of data capture of binary tree is collected based on multiple data

Also Published As

Publication number Publication date
CN103561444B (en) 2018-06-26

Similar Documents

Publication Publication Date Title
Wang et al. A software defined network routing in wireless multihop network
CN105246120B (en) A kind of data transmission delay and the limited Sink node mobile route distribution selection method of hop count
CN101179499A (en) Method for wireless self-organizing of monitoring system to form tree-shaped routing
CN101951655B (en) Reactive routing protocol based on geographic information in wireless sensor network
CN101286912A (en) Mobile terminal assisted wireless sensor network information acquisition method
Krishna et al. Energy efficient data aggregation techniques in wireless sensor networks
CN104253867A (en) Toxic gas monitoring and tracking method based on respiratory mechanism in wireless sensor network
CN109874162A (en) The hybrid Design of Routing Protocol optimization method of high-altitude high-speed mobile node ad hoc network
Xu et al. Study on WSN topology division and lifetime
Saranya et al. Routing techniques in sensor network–a survey
Daflapurkar et al. Tree based distributed clustering routing scheme for energy efficiency in wireless sensor networks
CN103561444A (en) Method and device for collecting data in sensor network
Padiya et al. Analysis of Data Aggregation Methods to avoid Data Redundancy in Wireless Sensor Network
Wang et al. Mobility based data collection algorithm for wireless sensor networks
Javaid et al. On sink mobility trajectory in clustering routing protocols in WSNs
Tan et al. A distributed and dynamic data gathering protocol for sensor networks
Xu et al. A low energy adaptive clustering multi-hop routing protocol based on fuzzy decision
Jayekumar et al. A novel energy-link failure recovery routing (E-LFRR) algorithm for QOS optimization in wireless sensor network
Yadav et al. Cluster based routing schemes in wireless sensor networks: A comparative study
Anand et al. Comparison of routing protocols in wireless sensor networks: a detailed survey
Shahid et al. Proactive multipath data dissemination for Multimedia Sensor Networks
Bhat et al. Effective cluster head selection based on EDM for WSN
Yang et al. Performance evaluation of a wireless sensor network considering mobile event
Dhatchayani et al. Agent based efficient data gathering scheme for wireless sensor networks with a mobile sink
Goyal et al. Routing protocols based on sink mobility in wireless sensor networks—A review

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant