CN102413178B - Safe automatic clustering method of wireless sensor network nodes - Google Patents

Safe automatic clustering method of wireless sensor network nodes Download PDF

Info

Publication number
CN102413178B
CN102413178B CN201110359778.8A CN201110359778A CN102413178B CN 102413178 B CN102413178 B CN 102413178B CN 201110359778 A CN201110359778 A CN 201110359778A CN 102413178 B CN102413178 B CN 102413178B
Authority
CN
China
Prior art keywords
node
identification number
clustering
wireless sensor
self
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
CN201110359778.8A
Other languages
Chinese (zh)
Other versions
CN102413178A (en
Inventor
戚湧
李千目
陆路
侯君
Original Assignee
Wuxi Nanligong Technology Development 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 Nanligong Technology Development Co Ltd filed Critical Wuxi Nanligong Technology Development Co Ltd
Priority to CN201110359778.8A priority Critical patent/CN102413178B/en
Publication of CN102413178A publication Critical patent/CN102413178A/en
Application granted granted Critical
Publication of CN102413178B publication Critical patent/CN102413178B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a safe automatic clustering method of wireless sensor network nodes, which comprises the steps of: firstly, establishing a wireless sensor network, allocating unique identification numbers for all fixed nodes in the wireless sensor network; sending and broadcasting to a network where the nodes are to the nodes in a wireless sensor, calculating the node identification number with maximum association degree Q of self nodes and neighbor nodes with neighbor nodes, then replacing self identification numbers by using the identification numbers, informing new identification numbers to the neighbor nodes; and repeating updating, and completing automatic clustering of the network nodes of the wireless sensor. Compared with the traditional clustering method with the limit of needing knowing the whole network state, the automatic clustering method has remarkable advantages on clustering and optimizing from the node individuals, and can achieve required effects for the clustering result of the sensor nodes.

Description

A kind of automatic clustering method of safe wireless sensor network node
Technical field
The present invention relates to wireless sensor network field, especially a kind of automatic clustering method of node, specifically a kind of automatic clustering method of safe wireless sensor network node.
Background technology
At present, research for network cluster dividing has significant role in theory significance and practical application, has been applied to the various fields such as the bio-networks analyses such as the social network analysis such as terroristic organization's identification, organization management, metabolic network analysis, the analysis of the protein Internet and agnoprotein matter function prediction, gene regulatory network analysis and the identification of master control gene and Web community mining and the Web document sub-clustering based on descriptor and search engine at present.
At present, the research method for network cluster dividing mainly can be divided into two classes: method (optimization based method) and heuristic (heuristic method) based on optimizing.The former is converted into optimization problem by complex network sub-clustering problem, carrys out the clustering architecture of calculation of complex network by the predefined target function of optimization.For example, spectral method (spectral method) is converted into quadratic form optimization problem by network cluster dividing problem, by calculating the characteristic vector of Special matrix, optimizes predefined " cutting (cut) " function.The latter is converted into complex network sub-clustering problem the design problem of predefine heuristic rule.For example, to be the limit betweenness that connects in the limit betweenness (edge betweenness) that connects between take bunch should be greater than bunch design the method for sub-clustering as predefined heuristic rule to the Girvan-Newman method of extensively being quoted.
Along with the development of sensing technology, people start this technology to be applied on computer network.The wireless self-organization network of the oriented mission that wireless sensor network is comprised of a plurality of sensor nodes, it has advantages of that associated treatment ability is strong, is widely used in the fields such as target following, environmental monitoring.
Realizing the quick sub-clustering of network node, is to realize the self-control of each node and the prerequisite of coordinated management in wireless sensor network.Traditional cluster-dividing method is the overall situation, whole sensor network to be cut apart, but this need to be to the perception of the whole network state overall situation, and in reality, in network sensor node initial layout, network condition is normally unknown, and therefore the practicality of traditional sub-clustering scheme is lower.
Summary of the invention
The object of the invention is the lower problem of practicality for traditional sub-clustering scheme, propose a kind of automatic clustering method of safe wireless sensor network node.Compare conventional method and grasp the requirement of network integrality, this method does not need to understand overall network state, makes method can adapt to the demand of wireless sensor system.
In this scheme, using each sensor node as an agent, and each agent communicates by letter with adjacent node, utilizes the FN that the present invention proposes to improve and optimizate method, to self carrying out sub-clustering optimization, finally obtains the sub-clustering result of wireless sensor network.
Technical scheme of the present invention is:
The automatic clustering method of wireless sensor network node, it comprises the following steps:
(1) set up wireless sensor network, for stationary nodes all in radio sensing network is distributed unique identifying number;
(2) in wireless senser, each node sends broadcast to place network, broadcast the identification number of self node, can receive the identification number of other nodes, just using the node in identification number source as its neighbor node, and self identification number be informed to this neighbor node is the node of posting a letter of identification number;
(3) each node is received the identification number information of neighbor node, the identification number of this neighbor node is stored in this locality, then each node is that FN sub-clustering optimization method carries out sub-clustering according to fast network sub-clustering optimization method, be that each node calculates and comprises in self node and neighbor node, node identification number with its neighbor node correlation degree Q maximum, then with this identification number, replace the identification number of self, new identification number is informed to neighbor node simultaneously;
Q = 1 Σ ij A ij Σ ij [ A ij - k i k j Σ ij A ij ] = 1 - k i k j ( Σ ij A ij ) 2 .
Wherein, A=(A ij) n * nthe Critical Matrices of wireless sensor network, k i, k jthe degree that is node i, j is the neighbor node number of node i, j, and Q is a self-defining scale, represents the tightness degree that is connected of self node and neighbor node;
(4) each node receives the information that neighbor node identification number upgrades, and repeating step 3, until node receives identification number or the update times of neighbor node, do not reach set point, and node no longer upgrades self identification number;
(5), in whole network without node updates self identification number, regard sub-clustering as and finish, the node of same identification number is thought in same cluster, completes the automatic sub-clustering of wireless sensor network node.
In the present invention, after the first run sends the identification number number of broadcast, storage neighbor node, neighbours' number of each node statistics self is informed neighbours' number of neighbor node self simultaneously, and connecting joint is counted.
The present invention, in clustering process, if neighbor node cannot connect, deletes this node from neighbor node list.
In step 4 of the present invention, the set point of update times is no less than 50 times.
In the present invention, each node, after completing a cluster-dividing method, enters sleep pattern, and when the identification number of its neighbor node changes, node just can be waken up, and carries out the sub-clustering of next round.
Beneficial effect of the present invention:
The present invention is by above technical scheme, make the FN improvement sub-clustering optimization method that the present invention proposes in the sub-clustering of wireless sensor network node, have obvious effect of optimization, compare the limitation that traditional cluster-dividing method need to be had gained some understanding to whole network state, this method starts to carry out ground sub-clustering optimization method with node individuality obvious advantage, for the sub-clustering result of sensor node, can reach desired effect.
Accompanying drawing explanation
Fig. 1 is initialization node location schematic diagram of the present invention.
Fig. 2 is node communication schematic diagram of the present invention.
Fig. 3 is the node clustering schematic diagram after cluster-dividing method of the present invention is optimized.
Embodiment
Below in conjunction with drawings and Examples, the present invention is further illustrated.
The automatic clustering method of wireless sensor network node, it comprises following part:
The formation of 1 network
The present invention adopts general wireless sensor network model: (1), sensor node are randomly dispersed in a region A; (2), all nodes have enough computing capabilitys come supporting signal to process and calculate route, and equal.
Number identification of 2 node identifications
When arranging wireless sensor network, to unique identification number of each sensor assignment, node, when transmission, adds the identification number of oneself before communications packets.Node is received information, can originate by identification number identifying information, if information is not from neighbor node, information is abandoned.
The automatic sub-clustering of 3 nodes
When initial, internodal communication adopts wireless broadcast channel, and node sends broadcast packet automatically, and its neighbor node once can determined after broadcast.The non-moving node of node, so the neighbor node of each node can be considered as can changing hardly.Each node has a certain size local buffer, deposits its adjacent node list.Node is communicated by letter with adjacent node, obtains adjacent node state, the FN proposing according to the present invention renewal oneself state of improving one's methods, and then communicate by letter with adjacent node.This process is carried out several times or node clustering hit the target, and the sub-clustering result of node can be accepted, and cluster-dividing method finishes.
The uncertainty of 4 node communication quality
While monitoring due to reality, the communication quality of wireless sensor network can be received the impact of environment, and therefore, we need to consider inter-node communication quality problems when method for designing.For the poor node of communication quality, node can be deleted it from neighbor node, in cluster-dividing method carries out, no longer receives the information from this node.
The sub-clustering speed of 5 nodes and energy-conservation consideration
In order to save the energy consumption of each node, and to accelerate the speed of sub-clustering, in design, node, after completing a cluster-dividing method, can enter sleep pattern, just only have node when the sign of its neighbor node changes to be waken up, carries out the sub-clustering of next round.
During concrete enforcement:
In conjunction with simulated environment, the present invention is described in further detail.As shown in Figure 1, the area size of this scene is 100m*100m.In region, by 30 wireless sensor nodes, formed.Node location is fixed, and status is identical.
During initial conditions, each node itself is considered as an agent, and distributes unique sign of each agent.Starting stage, each agent regards one bunch as.Each agent sends the broadcast packet that comprises own identification number, and the node receiving is stored in the identification number comprising in broadcast packet in neighbor node list, is about to information source node as the neighbor node of this node, as shown in Figure 2.After once broadcasting, neighbours' number of each node statistics self, and continue, by self neighbours' number broadcast, by one, to take turns simply and gather, the linking number of the overall network that node can calculate and the linking number of neighbor node.
We introduce FN sub-clustering optimization method:
Q = 1 Σ ij A ij Σ ij [ A ij - k i k j Σ ij A ij ] = 1 - k i k j ( Σ ij A ij ) 2 .
Wherein, A=(A ij) n * nthe Critical Matrices of network, k iit is the degree of node i.
Node is by spontaneous calculating, finds out and can make the maximized node identification number of Q, and replace the identification number of self with this identification number in comprising self node and neighbor node, new identification number informed to neighbor node, as shown in Figure 3 simultaneously.
One, take turns after identification number upgraded, the identification number of each node changes, then carries out sub-clustering optimization method for the second time according to above-mentioned steps, and such sub-clustering optimizing process is repeated multiple times.In clustering process, consider the unsteadiness of wireless communication, if neighbor node cannot connect, this node is deleted from neighbor node list.If the identification number of the neighbor node of node does not change, node just enters sleep pattern with saving resource, until the identification number of neighbor node changes, is just waken up.When all nodes all enter sleep pattern, sub-clustering optimizing process is regarded termination as, and the node that identification number is identical is thought in same bunch.
Because the stop condition of method is harsher, can set sub-clustering optimization wheel number according to the difference for sub-clustering required precision, wheel number is larger, and sub-clustering result is more outstanding.Consider time and energy consumption, be generally set as 50 times, its sub-clustering result just can have been accepted.
Under above-mentioned environment, emulated data shows, adopts method of the present invention, the sub-clustering excellent of node, and easily realize.Above result demonstration, the outstanding method of the present invention has very high feasibility and reasonability.
The part that the present invention does not relate to all prior art that maybe can adopt same as the prior art is realized.

Claims (5)

1. an automatic clustering method for the wireless sensor network node of safety, is characterized in that it comprises the following steps:
(1) set up wireless sensor network, for stationary nodes all in radio sensing network is distributed unique identifying number;
(2) in wireless senser, each node sends broadcast to place network, broadcast the identification number of self node, can receive the identification number of other nodes, just using the node in identification number source as its neighbor node, and self identification number be informed to this neighbor node is the node of posting a letter of identification number;
(3) each node is received the identification number information of neighbor node, the identification number of this neighbor node is stored in this locality, then each node is that FN sub-clustering optimization method carries out sub-clustering according to fast network sub-clustering optimization method, be that each node calculates and comprises in self node and neighbor node, node identification number with its neighbor node correlation degree Q maximum, then with this identification number, replace the identification number of self, new identification number is informed to neighbor node simultaneously;
Figure 2011103597788100001DEST_PATH_IMAGE002
.
Wherein, the Critical Matrices of wireless sensor network,
Figure 2011103597788100001DEST_PATH_IMAGE006
,
Figure 2011103597788100001DEST_PATH_IMAGE008
the degree that is node i, j is the neighbor node number of node i, j, and Q is a self-defining scale, represents the tightness degree that is connected of self node and neighbor node;
(4) each node receives the information that neighbor node identification number upgrades, and repeating step 3, until node receives identification number or the update times of neighbor node, do not reach set point, and node no longer upgrades self identification number;
(5), in whole network without node updates self identification number, regard sub-clustering as and finish, the node of same identification number is thought in same cluster, completes the automatic sub-clustering of wireless sensor network node.
2. the automatic clustering method of safe wireless sensor network node according to claim 1, it is characterized in that: after the first run sends the identification number of broadcast, storage neighbor node, each node is added up the neighbours' number of self, informs neighbours' number of neighbor node self simultaneously, and connecting joint is counted.
3. the automatic clustering method of safe wireless sensor network node according to claim 1, is characterized in that: in clustering process, if neighbor node cannot connect, this node is deleted from neighbor node list.
4. the automatic clustering method of safe wireless sensor network node according to claim 1, is characterized in that: in step 4, the set point of update times is no less than 50 times.
5. the automatic clustering method of safe wireless sensor network node according to claim 1, it is characterized in that: each node is after completing a cluster-dividing method, enter sleep pattern, when the identification number of its neighbor node changes, node just can be waken up, and carries out the sub-clustering of next round.
CN201110359778.8A 2011-11-14 2011-11-14 Safe automatic clustering method of wireless sensor network nodes Expired - Fee Related CN102413178B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201110359778.8A CN102413178B (en) 2011-11-14 2011-11-14 Safe automatic clustering method of wireless sensor network nodes

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201110359778.8A CN102413178B (en) 2011-11-14 2011-11-14 Safe automatic clustering method of wireless sensor network nodes

Publications (2)

Publication Number Publication Date
CN102413178A CN102413178A (en) 2012-04-11
CN102413178B true CN102413178B (en) 2014-02-12

Family

ID=45915021

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201110359778.8A Expired - Fee Related CN102413178B (en) 2011-11-14 2011-11-14 Safe automatic clustering method of wireless sensor network nodes

Country Status (1)

Country Link
CN (1) CN102413178B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103260229B (en) * 2013-06-04 2015-09-30 东北林业大学 The method of data transmission is carried out based on the MAC protocol for wireless sensor networks predicted and feed back
JP6201669B2 (en) * 2013-11-15 2017-09-27 富士通株式会社 COMMUNICATION METHOD, COMMUNICATION DEVICE, COMMUNICATION PROGRAM, AND COMMUNICATION SYSTEM
CN104837158B (en) * 2015-05-06 2018-05-15 南昌大学 The covering cavity restorative procedure of failure node, system in Internet of Things

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101207572A (en) * 2007-12-14 2008-06-25 北京科技大学 Method for clustering vehicle mounted Ad hoc network based on signal strength

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101394357B1 (en) * 2007-10-09 2014-05-13 삼성전자주식회사 Wireless sensor network system and method managing cluster thereof
KR20090065230A (en) * 2007-12-17 2009-06-22 한국전자통신연구원 Wireless sensor network having hierarchical structure and method for routing for the same

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101207572A (en) * 2007-12-14 2008-06-25 北京科技大学 Method for clustering vehicle mounted Ad hoc network based on signal strength

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
新的无线传感器网络分簇算法;胡静等;《通信学报》;20080731;第29卷(第7期);全文 *
胡静等.新的无线传感器网络分簇算法.《通信学报》.2008,第29卷(第7期),全文.

Also Published As

Publication number Publication date
CN102413178A (en) 2012-04-11

Similar Documents

Publication Publication Date Title
Xu et al. A computation offloading method for edge computing with vehicle-to-everything
CN103678671B (en) A kind of dynamic community detection method in social networks
CN101505311B (en) Information transmission method and system based on socialized network
Sun et al. Analytical exploration of energy savings for parked vehicles to enhance VANET connectivity
CN102118450B (en) Betweenness centrality-based opportunistic network P2P (peer-to-peer) information query method
CN104714852A (en) Parameter synchronization optimization method and system suitable for distributed machine learning
CN101977226A (en) Novel opportunity network data transmission method
CN106658603A (en) Wireless sensor network routing energy-saving method with load balancing
CN103327075B (en) Based on the distributed Combo discovering method that label is mutual
CN102413178B (en) Safe automatic clustering method of wireless sensor network nodes
CN102244872B (en) Frequency planning method of TD-SCDMA (Time Division Synchronization Code Division Multiple Access) cells
CN110838072A (en) Social network influence maximization method and system based on community discovery
CN102571431A (en) Group concept-based improved Fast-Newman clustering method applied to complex network
CN103108387A (en) Establishment method of multi-hop wireless self-organization network applied to agriculture
CN105451173A (en) Track-data-analysis-technology-based intelligent cluster communication resource configuration method and system
CN102065446A (en) Topology control system and method orienting group mobile environment
CN104168631A (en) Wireless sensor network energy balance coverage scheduling and cross-layer routing design method
Khan et al. An efficient optimization technique for node clustering in VANETs using gray wolf optimization
CN106211196A (en) How unmanned sail body based on markov random file harmonious property method
Zhong et al. Information entropy based on propagation feature of node for identifying the influential nodes
CN104967495A (en) Method of establishing meteorological satellite Markov time-varying channel simulation model
CN104702676B (en) A kind of railway distributive data center resource regulating method
Zhang et al. Feature extraction of trajectories for mobility modeling in 5G NB-IoT networks
Sun et al. Scheduling optimization for UAV communication coverage using virtual force-based PSO model
He et al. Traffic Processing Model of Big Data Base Station Based on Hybrid Improved CNN Algorithm and K-Centroids Clustering Algorithm

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: LI QIANMU

Free format text: FORMER OWNER: WUXI NJUST TECHNOLOGY DEVELOPMENT CO., LTD.

Effective date: 20140430

C41 Transfer of patent application or patent right or utility model
C53 Correction of patent for invention or patent application
CB03 Change of inventor or designer information

Inventor after: Li Qianmu

Inventor before: Qi Yong

Inventor before: Li Qianmu

Inventor before: Lu Lu

Inventor before: Hou Jun

COR Change of bibliographic data

Free format text: CORRECT: INVENTOR; FROM: QI YONG LI QIANMU LU LU HOU JUN TO: LI QIANMU

Free format text: CORRECT: ADDRESS; FROM: 214192 WUXI, JIANGSU PROVINCE TO: 210019 NANJING, JIANGSU PROVINCE

TR01 Transfer of patent right

Effective date of registration: 20140430

Address after: 210019 Xuanwu District, Jiangsu, Xiaolingwei 200, Nanjing

Patentee after: Li Qianmu

Address before: 214192 Jiangsu City, Xishan Province Economic Development Zone, Xishan Furong Road No. 99, No. three, No.

Patentee before: Wuxi Nanligong Technology Development Co., Ltd.

CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20140212

Termination date: 20181114

CF01 Termination of patent right due to non-payment of annual fee