CN101252543B - Rapid data anastomosing algorithm used for wireless sensor network - Google Patents

Rapid data anastomosing algorithm used for wireless sensor network Download PDF

Info

Publication number
CN101252543B
CN101252543B CN2008101038458A CN200810103845A CN101252543B CN 101252543 B CN101252543 B CN 101252543B CN 2008101038458 A CN2008101038458 A CN 2008101038458A CN 200810103845 A CN200810103845 A CN 200810103845A CN 101252543 B CN101252543 B CN 101252543B
Authority
CN
China
Prior art keywords
node
unit lattice
dummy unit
data
fusion
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.)
Expired - Fee Related
Application number
CN2008101038458A
Other languages
Chinese (zh)
Other versions
CN101252543A (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.)
Beijing Jiaotong University
Original Assignee
Beijing Jiaotong University
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 Beijing Jiaotong University filed Critical Beijing Jiaotong University
Priority to CN2008101038458A priority Critical patent/CN101252543B/en
Publication of CN101252543A publication Critical patent/CN101252543A/en
Application granted granted Critical
Publication of CN101252543B publication Critical patent/CN101252543B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • Y—GENERAL 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
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE 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/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

Disclosed is a quick chain data fusion algorithm based on virtual cell grids. A whole sensor zone is divided into virtual cell grids; data are sent to an appointed node for fusion by the nodes in the cell grids, the chain data fusion process is started in the vertical direction of the cell grids and the data are sent to the Sink node each time by only one node in each chain. The nodes play the role of data fusion in turn for balancing the energy consumption of the nodes. The invention has the advantages that the data transmission chain constructed in the CFDASC algorithm is short, therefore the time delay in data transmission is short. The algorithm has good robustness, that is, each chain transmits data to the Sink node; and has good energy saving property, that is, all the data in the wireless sensor network zone are finally fused into the data transmitted by a plurality of chains, the data account for transmission is largely reduced in the data transmission process and most of the energy is effectively saved.

Description

A kind of rapid data anastomosing algorithm that is applied to wireless sensor network
Technical field
The present invention relates to a kind of rapid data anastomosing algorithm that is applied to wireless sensor network.The present invention is applicable to the wireless network application, is particularly useful for the wireless sensor network application.
Background technology
Wireless sensor network (wireless sensor network, WSN) form by being deployed in cheap microsensor nodes a large amount of in the monitored area, the network system of the self-organizing of a multi-hop that forms by communication, its objective is the information of perceptive object in perception collaboratively, collection and the processing network's coverage area, and send to the observer.The resource of wireless sensor network node is very limited, is mainly reflected in several aspects such as the energy content of battery, disposal ability, memory capacity and communication bandwidth.The method that adopts each node to transfer data to aggregation node separately in the process of acquisition of information is inappropriate, mainly contains following two reasons.
(1) waste communication bandwidth and energy: in the higher sensor network of coverage, there is redundancy in the information of adjacent node report, and each node transmits data separately can waste communication bandwidth; Simultaneously, transferring large number of data can make the too much energy of whole network consumption, shortens the life span of network.
(2) efficient of reduction information gathering: a plurality of nodes transmit the coordination difficulty that data can increase data link layer simultaneously, cause frequent conflict collision, have reduced communication efficiency, thereby have influenced the promptness of information gathering.
For avoiding the problems referred to above, wireless sensor network needs to use data fusion (data aggregation or data fusion) technology in the process of collecting data.Data fusion is that many piece of data or information are handled, be combined into more effective, more meet the process of the data of user's request.The data fusion method widespread usage such as the comprehensive various sensory information of common meeting when distinguishing a things, comprises vision, sense of touch, sense of smell and the sense of hearing etc. in daily life.The information that relies on a kind of sense organ acquisition separately often is not enough to things is made accurate judgement, and comprehensive various sensorial data is more accurate to the description meeting of things.In the application of wireless sensor network, only be concerned about monitoring result in the time of many, do not need to receive a large amount of initial data, data fusion is to realize the important means of this purpose.
Data anastomosing algorithm has caused researcher's attention recently.In wireless sensor network, it is an important problem that route technology is combined with the data fusion technology.Data fusion can reduce data volume, alleviates the network congestion in the convergence process, assists Routing Protocol to prolong the life span of network.The data fusion technology that is applied in the route technology of wireless sensor network mainly contains three major types: the first kind is based on the route of inquiry; Second class is based on the route of level; The 3rd class is based on the route of chain.Representative algorithm based on the route of chain has PEGASIS algorithm and higher order algorithm thereof.The PEGASIS algorithm at first utilized greedy algorithm that all nodes in the network are connected into a strand before collecting data, and node of picked at random is as the head then.The head sends the request of collecting data to the two ends of chain, and data flow to the head from two end points of strand.Intermediate node will be carried out mixing operation before Data transmission, finally send result data to aggregation node by head's node.The advantage of PEGASIS algorithm is that the distance that the structure of strand makes each node send data nearly all is the shortest, and finally has only a node to carry out remote transfer of data.The PEGASIS algorithm of single-stranded structure mainly contains following two defectives: (1) average retardation is bigger: data need transmit along the single-stranded structure order, the delay of collecting data is decided by the distance of head's node and strand end node, so average retardation is directly proportional with interstitial content.(2) robustness is relatively poor: because the easy inefficacy of sensor node, if do not take suitable reparation strategy, the transmission path of single-stranded structure increases the mortality of request of data easily.
Summary of the invention
In order to overcome the deficiency of existing data anastomosing algorithm, the invention provides a kind of quick chained record blending algorithm based on the dummy unit lattice (CFDASC:an Chain-basedFast Data Aggregation algorithm based on a Suppositional Cell forwireless sensor networks) that is applied to wireless sensor network, solve the problem that the wireless sensor network data blending algorithm postpones.
The technical solution adopted for the present invention to solve the technical problems is:
The present invention proposes a kind of quick chained record blending algorithm based on the dummy unit lattice.
A kind of quick chained record blending algorithm based on the dummy unit lattice, whole sensitive zones is divided into one by one dummy unit lattice, the node that node in the cell all sends the data to a prior appointment merges, carry out the data fusion process of chain type subsequently along the vertical direction of cell, every chain has only a node to send the data to the Sink node at every turn.For the energy consumption of balanced node, all the role who takes on data fusion in turn between the node.
A kind of rapid data anastomosing algorithm that is applied to wireless sensor network of the present invention comprises following two step process:
Step 1, netinit in this stage, form the dummy unit lattice, and each dummy unit lattice has a label according to the present position, makes things convenient for transfer of data, and simultaneously in each dummy unit lattice the node of (promptly bunch in) all will have numbering unique in bunch.
Step 2, data collection, fusion and transmission, this step comprise two steps,
Step 1), the one, the data collection of dummy unit lattice inside, fusion and transmission,
Step 2), the one, between the dummy unit lattice, also comprise and the Sink data between nodes is collected, merges and transmitted.
The present invention is based on the chained record blending algorithm of dummy unit lattice, and the positional information of utilizing node belongs to node in one by one the dummy unit lattice, and the node in the cell serves as bunch head of data fusion in the cell in turn; Send to aggregation node after the data of a string cell are merged, thereby data fusion process is accelerated, reduce the propagation delay time of data, reduced volume of transmitted data simultaneously, saved node energy, further prolonged the life cycle of network.
The invention has the beneficial effects as follows,
1, the time-delay of data is little: the transfer of data chain of forming in the CFDASC algorithm is very short, so the time delay during transfer of data is very little.
2, the robustness of algorithm is good: every chain all transmits data and gives the Sink node, can be as the single-stranded structure of PEGASIS algorithm, if chain lost efficacy, the Sink node will not receive data.
3, energy saving is better: all data in the whole wireless sensor network zone are fused into the data that several chains send at last, and institute's data quantity transmitted significantly reduces in data transmission procedure, has saved most energy effectively.
Description of drawings
Fig. 1 wireless sensor network node initial distribution figure;
Fig. 2 node cluster figure;
Fig. 3 data transmission scheme;
Fig. 4 determines the flow chart of unique number in the node dummy unit lattice;
The flow chart that Fig. 5 dummy unit lattice internal data is collected;
The flow chart that chained record merges between Fig. 6 dummy unit lattice;
The flow chart that Fig. 7 CFDASC algorithm is total.
The present invention is further described below in conjunction with drawings and Examples.
Embodiment
At first provide the sensor network structure that adopts the CFDASC algorithm, Fig. 1 has provided a start node distribution map example, has 100 nodes to be randomly dispersed in the plane domain of 50m * 50m, and the Sink node is positioned at the 75m place.Fig. 2 is the situation of cell interior nodes cluster, how to select a bunch back to introduce.Fig. 3 has provided under the situation that sub-clustering is determined, data are how to be transferred to the Sink node by the chained record blending algorithm.Step 1, netinit:
In this stage, form the dummy unit lattice, each dummy unit lattice has a label according to the present position, makes things convenient for transfer of data, and simultaneously in each dummy unit lattice the node of (promptly bunch in) all will have numbering unique in bunch.As shown in Figure 1, each dummy unit lattice can be G with form IjLabel come mark, subscript i wherein, j represents the pairing horizontal ordinate of dummy unit lattice respectively, with such labeling method, the label of five cells of Far Left one row is respectively C among Fig. 1 11, C 12, C 13, C 14And C 15
The length of side of dummy unit lattice should be by monitored area area and the application desired time of delay comprehensive decision of aggregation node according to whole wireless sensor network.Generally speaking, in order to reach the purpose of quick fusion, the dummy unit lattice are too much unsuitable.
After the length of side of dummy unit lattice is decided, broadcast a message by the Sink node to the whole network, include the positional information on four summits of rectangle of monitored area, the length of side information of dummy unit lattice and the positional information of Sink node in this message, node can calculate own affiliated cell according to the positional information of oneself rapidly after receiving these information.Each node all writes down the positional information of Sink node so that the direction that specified data is transmitted in data transmission procedure and the trend of chaining.
By seeing on the common edge that has some nodes to be positioned at two dummy unit lattice just among Fig. 1 or the public vertex place of four dummy unit lattice, this moment, the ownership of this category node be adding forever in the nearer dummy unit lattice of Sink node, the benefit of doing like this is nearer apart from the Sink node, and the transmission of fused data is conserve energy more.
Definite method of unique number is in the node cluster: after determining the dummy unit lattice that oneself belong to, each node is all broadcasted the positional information of oneself, each node all writes down those and lays oneself open to the position of the node in the same cell, through after the regular hour, each node has all been known the nodal information in the own affiliated cell, node unique number in each dummy unit lattice is to obtain according to the positional information of this node is automatic, and a variety of methods can be arranged.For example: the numbering minimum of coordinate figure minimum, x coordinate priority is better than the y coordinate, promptly sees the x coordinate figure of node earlier, and minimum node obtains No. 1, when the x coordinate is identical, the y coordinate of reference node again.
With dummy unit lattice C IjInterior nodes (x n, y n) definite process of unique number n is that example illustrates how the node unique number in the same dummy unit lattice is determined.Flow chart is supposed dummy unit lattice C as shown in Figure 4 IjIn node add up to k, 1≤n≤k wherein, determine that then the process of unique number in the node dummy unit lattice is as follows:
Step 1, node (x n, y n) know C by the record node location IjInterior nodes adds up to k, changes step 2 over to;
Step 2, with x nCompare with the x coordinate of other k-1 node, change step 3 over to;
Step 3, by relatively, other k-1 node is divided into three parts: the x coordinate of first's node is all less than x n, the node number is k 1The x coordinate of second portion node all equals x n, the node number is k 2The x coordinate of third part node is all greater than x n, the node number is k-1-k 1-k 2Change step 4 over to;
Step 4, judgement k 2Whether be 0, if k 2Equal 0, change step 5 over to; Otherwise change step 6 over to;
Step 5, obtain node (x n, y n) at dummy unit lattice C IjInterior unique number n is n=k 1+ 1, algorithm finishes.
Step 6, with y nWith this k 2The y coordinate of individual node compares, and changes step 7 over to;
Step 7, judgement y nWhether minimum, if minimum, change step 5 over to; If not minimum, change step 8 over to;
Step 8, with this k 2Individual node separated into two parts: the y coordinate of first's node is all less than y n, the node number is k 3The y coordinate of second portion node is all greater than y n, the node number is k 2-k 3Change step 9 over to;
Step 9, obtain node (x n, y n) at dummy unit lattice C IjInterior unique number n is n=k 1+ k 3, algorithm finishes.Step 2, data collection, fusion and transmission:
Data collection, fusion and transmission comprise two parts content, the one, and data collection, fusion and the transmission course of dummy unit lattice inside, the one, between the dummy unit lattice, also comprise and the collection of Sink data between nodes, fusion and transmission course.
1, dummy unit lattice inside
Have a node to play data fusion in the data collection, cell in each dummy unit lattice, this node is to rotate in the cell at every turn, from being numbered 1 node, carries out successively.As shown in Figure 2.This leader cluster node in the cell is also carried out the data that receive other cell leader cluster nodes possibly, and merges, and is transmitted to the leader cluster node of other cells or directly sends to the Sink node.
With illustrated method dummy unit lattice C is described IjThe process of data collection between the middle individual node of k (k 〉=1), fusion and transmission, that establishes this k node is numbered 1,2 ... n ..., k-1, k.Flow chart as shown in Figure 5, dummy unit lattice internal data collection process is described below:
Step 1, netinit are finished, and change step 2 over to;
Step 2, node perceived and image data change step 3 over to;
Step 3, be numbered the leader cluster node of the node of n as Ben Genei, other k-1 node sends to node n with the data of perception, and node n merges the data that receive, between the dummy unit lattice chained record merge, transmission course, change step 4 over to;
Step 4, judge whether n=k sets up,, change step 5 over to if set up; Otherwise change step 6 over to;
Step 5, make n=1, change step 2 over to;
Step 6, make the value of n increase 1, change step 2 over to.
2, between the dummy unit lattice, also comprise and the Sink node between
At first to consider the direction of chaining.This direction is related with the position of Sink node.As shown in Figure 3, an end of every chain is all nearest from the Sink node.
Next is how the data of every chain are transferred to the Sink node, here adopt the PEGASIS algorithm, the head of the interior leader cluster node of a cell as the whole piece chain promptly arranged at every turn, and the leader cluster node of responsible adjacent unit lattice from chain receives data, and sends to the Sink node after merging.This task also is to finish by turns between all cells on the chain.
With chain C I1-C ImFor example illustrates the process of data collection between the dummy unit lattice, fusion and transmission with diagram, suppose that this chain comprises m dummy unit lattice altogether, bunch head unification CH of each dummy unit lattice when transfer of data at every turn I1-CH ImRepresent that dummy unit lattice leader cluster node is all taken in turn by the cell interior nodes when transmitting data in fact at every turn.Chained record merges flow process as shown in Figure 6 between the dummy unit lattice, and the chained record fusion process is described below between the dummy unit lattice:
Step 1, netinit are finished, and dummy unit lattice internal data collection process changes step 2 over to;
Step 2, during this takes turns, dummy unit lattice C IjA bunch CH IjHead (1≤j≤m), change step 3 over to as the chained record fusion;
Step 3, CH IjReceive and fusion CH Ij-1With CH Ij+1If the data of sending j=1 or j=m, then receive only and merge the data that end unit lattice send, CH IjGive aggregation node with the transfer of data after merging, change step 4 over to;
Step 4, judge whether j=m sets up,, change step 5 over to if set up; Otherwise change step 6 over to;
Step 5, make j=1, change step 2 over to;
Step 6, make the value of j increase 1, change step 2 over to.
Comprehensive top two described contents of step can obtain the total flow chart of CFDASC algorithm as shown in Figure 7, and the text description of CFDASC algorithmic procedure is as follows:
Step 1, netinit dispense sensor node in the monitored area, aggregation node is determined the length of side of dummy unit lattice, to message of the whole network broadcasting, change step 2 over to then;
Step 2, sensing node calculate own affiliated cell, and the positional information of broadcasting oneself, receive the information of other sensing nodes simultaneously, and record belongs to the node location in the same cell, changes step 3 over to;
Step 3, carry out sensing node unique number deterministic process in the dummy unit lattice, change step 4 over to;
Step 4, carry out the data-gathering process of dummy unit lattice inside, change step 5 over to;
Step 5, carry out between the dummy unit lattice chained record and merge, the data after the fusion send to aggregation node, change step 4 over to.

Claims (4)

1. quick chained record fusion method based on the dummy unit lattice, it is characterized in that: whole sensitive zones is divided into one by one dummy unit lattice, the leader cluster node that node in the dummy unit lattice all sends the data to a prior appointment merges, the leader cluster node of this appointment is to rotate in the dummy unit lattice, from being numbered 1 node, carry out successively; Can carry out the data that receive other dummy unit lattice leader cluster nodes in the data collection between the dummy unit lattice of this leader cluster node, fusion and the transmission course in the dummy unit lattice, and merge, be transmitted to the leader cluster node of other dummy unit lattice or directly send to the Sink node;
Carry out the data fusion process of chain type subsequently along the vertical direction of dummy unit lattice, the data fusion process of described chain type, at first to consider the direction of chaining, this direction is related with the position of Sink node, and the described and position Sink node is related to be that an end of every chain is all nearest from the Sink node; Next is how the data of every chain are transferred to the Sink node, here adopt the PEGASIS algorithm, promptly have only the head of the interior leader cluster node of dummy unit lattice as the whole piece chain at every turn, the leader cluster node of responsible contiguous dummy unit lattice from chain receives data, and send to the Sink node after merging, the transfer of data of every chain is finished between this task of Sink node also is all dummy unit lattice on the chain by turns, all is the role who takes on data fusion in turn between the dummy unit lattice leader cluster node on the chain promptly.
2. a kind of quick chained record fusion method based on the dummy unit lattice according to claim 1 is characterized in that comprising following two steps:
Step 1, netinit in this stage, form the dummy unit lattice, and each dummy unit lattice has a label according to the present position, makes things convenient for transfer of data, simultaneously in each dummy unit lattice promptly the node in bunch all numbering unique in bunch to be arranged;
Step 2, data collection, fusion and transmission, this stage comprises two parts content, the one, data collection, fusion and the transmission course of dummy unit lattice inside, the one, between the dummy unit lattice, also comprise and the collection of Sink data between nodes, fusion and transmission course.
3. a kind of quick chained record fusion method based on the dummy unit lattice according to claim 2 is characterized in that:
Definite step of unique number is in the dummy unit lattice: after determining the dummy unit lattice that oneself belong to, each node is all broadcasted the positional information of oneself, each node all writes down those and lays oneself open to the position of the node in the same dummy unit lattice, through after the regular hour, each node has all been known the nodal information in the own affiliated dummy unit lattice, and the node unique number in each dummy unit lattice is to obtain according to the positional information of this node is automatic.
4. a kind of quick chained record fusion method according to claim 2 based on the dummy unit lattice, it is characterized in that: have the leader cluster node of an appointment to play data fusion in data collection, the dummy unit lattice in each dummy unit lattice at every turn, this leader cluster node is to rotate in the dummy unit lattice, from being numbered 1 node, carry out successively; Can carry out the data that receive other dummy unit lattice leader cluster nodes in the data collection between the dummy unit lattice of this leader cluster node, fusion and the transmission course in the dummy unit lattice, and merge, be transmitted to the leader cluster node of other dummy unit lattice or directly send to the Sink node.
CN2008101038458A 2008-04-11 2008-04-11 Rapid data anastomosing algorithm used for wireless sensor network Expired - Fee Related CN101252543B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2008101038458A CN101252543B (en) 2008-04-11 2008-04-11 Rapid data anastomosing algorithm used for wireless sensor network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2008101038458A CN101252543B (en) 2008-04-11 2008-04-11 Rapid data anastomosing algorithm used for wireless sensor network

Publications (2)

Publication Number Publication Date
CN101252543A CN101252543A (en) 2008-08-27
CN101252543B true CN101252543B (en) 2011-03-16

Family

ID=39955737

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2008101038458A Expired - Fee Related CN101252543B (en) 2008-04-11 2008-04-11 Rapid data anastomosing algorithm used for wireless sensor network

Country Status (1)

Country Link
CN (1) CN101252543B (en)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101808390A (en) * 2010-03-08 2010-08-18 南昌航空大学 Construction method of aggregation tree for collecting self health state of wireless sensor network
CN102149158B (en) * 2011-04-18 2013-07-24 武汉理工大学 Method for fusing sensor grid data based on grid clustering
CN102202372B (en) * 2011-06-15 2013-10-16 华北电力大学 Chain routing method of wireless sensor network based on fuzzy theory
CN103037467B (en) * 2011-09-30 2015-04-01 无锡物联网产业研究院 Method and device for fusing data of wireless sensor network
CN103533000B (en) * 2012-07-05 2016-12-21 华为技术有限公司 Measure signal transmission/reconstructing method, relevant device and wireless sensor network
CN103813406B (en) * 2014-02-20 2018-08-17 南昌大学 Layering chain tree route method based on region division
CN105072563B (en) * 2015-07-28 2019-01-22 北京博信视通科技有限公司 A kind of method and apparatus of device-to-device communication
CN106535248B (en) * 2016-08-11 2019-10-15 青岛大学 Robust state fusion method of the wireless sensor network based on data-driven strategy

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
JP特开2006-157896A 2006.06.15
汤波 等.无线传感器网络最小能量簇群构造策略.计算机应用第27卷 第1期.2007,第27卷(第1期),13,14,43.
汤波等.无线传感器网络最小能量簇群构造策略.计算机应用第27卷 第1期.2007,第27卷(第1期),13,14,43. *
郑勇 等.基于无线传感器网络的网内数据融合.计算机应用研究 第4期.2006,(第4期),243-245.
郑勇等.基于无线传感器网络的网内数据融合.计算机应用研究 第4期.2006,(第4期),243-245. *

Also Published As

Publication number Publication date
CN101252543A (en) 2008-08-27

Similar Documents

Publication Publication Date Title
CN101252543B (en) Rapid data anastomosing algorithm used for wireless sensor network
CN102404817B (en) Networking method and system for wireless sensor network based on multiple sink nodes
CN103220216B (en) A kind of wireless body area network route method based on Region dividing
CN101729331B (en) Clustering method and device, routing method and device of cluster head and base station
Khedr et al. Successors of PEGASIS protocol: A comprehensive survey
CN102026331A (en) Distributed multi-jump energy-saving communication method in wireless sensor network
CN103906044A (en) Networking method of wireless electricity consumption information acquisition ad hoc network
CN104469879B (en) A kind of dynamic k value cluster routing methods
CN105246117B (en) A kind of implementation method of the energy-saving routing protocol suitable for mobile wireless Sensor Network
CN106792973A (en) Cluster head election and its shift process in a kind of energy heterogeneous wireless sensor network
CN105072661A (en) Clustering multi-hop routing protocol of wireless sensor network
Zareei et al. The effects of an Adaptive and Distributed Transmission Power Control on the performance of energy harvesting sensor networks
CN102427597A (en) Fusion method for WSN (Wireless Sensor Network) tree type clustering data based on CR (Cognitive Radio)
CN106292611B (en) A kind of wisdom agricultural control system based on cloud computing
CN107431910A (en) For managing the technology for the heterogeneous nodes for being configured to support homogeneous communication agreement
JP2007004390A (en) Sensor network system, cluster formation method, and sensor node
Varsha et al. Development of QoS optimized routing using Artificial bee colony and TABU-GA with a mobile base station in Wireless Sensor Network
CN102883399A (en) Cluster-based CTP (coordinated test program) routing protocol
CN103237364B (en) A kind of integrated wireless sensor network data collection mechanism
CN107071873B (en) Coordinator of tree sensor network ad hoc network
Cao Minh et al. DISON: a self-organizing network management framework for wireless sensor networks
CN111405616A (en) Sensor network route improvement method for intelligent flow allocation and path update
KR20090034111A (en) Query-based zigbee mesh routing protocol
Natarajan et al. An improvement of communication stability on underwater sensor network using balanced energy efficient joining distance matrix
CN110177388A (en) A kind of wireless sensor network node distributed clustering method

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
C17 Cessation of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20110316

Termination date: 20120411