CN106792845A - Anchor node system of selection in mobile ad-hoc network - Google Patents
Anchor node system of selection in mobile ad-hoc network Download PDFInfo
- Publication number
- CN106792845A CN106792845A CN201611050324.1A CN201611050324A CN106792845A CN 106792845 A CN106792845 A CN 106792845A CN 201611050324 A CN201611050324 A CN 201611050324A CN 106792845 A CN106792845 A CN 106792845A
- Authority
- CN
- China
- Prior art keywords
- node
- cluster
- anchor node
- anchor
- selection
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/04—Arrangements for maintaining operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention discloses anchor node system of selection in a kind of mobile ad-hoc network, it is comprised the following steps：Step one, anchor node number as needed, it is determined that needing the clusters number formed in mobile ad-hoc network and the anchor node number for needing extra selection, will rationally be clustered to all Node distribution formulas, the cluster of number needed for obtaining in network；Step 2, based on the cluster situation obtained in step one, in each cluster, its leader cluster node is according to distance value situation between each node in the cluster and cluster barycenter, some moderate nodes of distance between cluster barycenter are selected, as the anchor node gone out selected in cluster set to be selected etc..Step 3, according to anchor node Optimal Distribution rule, three anchor nodes is selected in each anchor node for clustering set to be selected.The present invention can in a network select the anchor node being reasonably distributed, and then be conducive to improving the performance of network, simple to operate.
Description
Technical field
It is more particularly to a kind of mobile from group the present invention relates to anchor node system of selection in a kind of mobile communication technology field
Anchor node system of selection in knitmesh network.
Background technology
Mobile ad-hoc network has the advantages that quickly networking, does not rely on infrastructure, is searched after emergency services, calamity
Rescue, obtained widely applying in the multiple fields such as intelligent transportation and factory automation.The structure of mobile ad-hoc network can divide
Be planarized structure and hierarchy etc., wherein hierarchy can efficiently reduce that planarized structure brought it is end-to-end logical
The problems such as believing time delay high, network service load imbalance, while the scalability of network can be improved.In mobile ad-hoc network
In, the proposition of hierarchy is mainly due to reduce the purposes such as nodes total energy consumption and traffic load, it is necessary to by network
Networking node (can be people, robot, vehicle etc., hereinafter referred to as node) carries out Partition of role, such as typical double-layer structure
Middle is anchor node and user node, i.e. anchor node composition upper strata by node division, and user node constitutes lower floor；By anchor node
The distribution to the reasonable resource scheduling such as calculating task of user node can be realized, user node depends on anchor node to realize
Function such as communicates realization to the positioning of itself by the range finding with anchor node.The formation of sandwich construction in mobile ad-hoc network
The as extension form of double-layer structure.Therefore, the rational selection for anchor node in mobile ad-hoc network is received more
Carry out more concerns.
In mobile ad-hoc network, between node there is identical speciality, i.e. each node to be capable of achieving identical
Function, is such as positioned oneself etc. by GPS (global positioning system, global positioning system).To move
Hierarchy is formed in dynamic self-organizing network to improve the performance of network, then needs to select certain amount from these nodes
Node is used as anchor node.And the distribution situation of anchor node affects the performance of mobile ad-hoc network, such as nodes total energy
The user node ratio and the traffic load of anchor node that can be communicated with anchor node in consumption, network, and the service that network is provided
Realize situation accordingly；Therefore, select the anchor node being reasonably distributed be conducive to improve mobile ad-hoc network in performance with
And improve the service quality that network is provided；For example, to position user node as in the mobile ad-hoc network of main business,
Rational anchor node distribution can improve the user node number that can be positioned in network and the positioning for user node
The positioning precision that Cheng Suoneng reaches, it can be seen that the importance of anchor node select permeability in mobile ad-hoc network.
Found through the retrieval to prior art, the scheme at present on anchor node selection in mobile ad-hoc network includes
Be uniformly distributed, the scheme such as random distribution.It refers to planning in known network in the case of all node initial positions to be uniformly distributed
The position when anchor node for going out required number is uniformly distributed in a network, and the node in network closest to these positions is selected
It is anchor node；Random distribution refers to number destination node needed for randomly being selected from all nodes as anchor node；Both
Scheme needs to there is central controller in network and carries out pool control to anchor node selection course, and in all node initial roles
In identical mobile ad-hoc network, select to meet and be uniformly distributed or the anchor node of random distribution is difficult to, therefore need
A kind of distributed method is wanted to select the anchor node being reasonably distributed in a network.
The content of the invention
The technical problems to be solved by the invention are to provide anchor node system of selection in a kind of mobile ad-hoc network, its energy
The anchor node being reasonably distributed enough is selected in a network, and then is conducive to improving the performance of network, it is simple to operate.
The present invention is to solve above-mentioned technical problem by following technical proposals：Anchor section in a kind of mobile ad-hoc network
Selection method is clicked, it is comprised the following steps：
Step one, anchor node number as needed, it is determined that needing the clusters number formed in mobile ad-hoc network
And the extra anchor node number for selecting is needed, will rationally be clustered to all Node distribution formulas in network, number needed for obtaining
Purpose is clustered；
Step 2, based on the cluster situation obtained in step one, in each cluster, its leader cluster node is poly- according to this
Distance value situation between each node and cluster barycenter in class, selects some moderate sections of the distance between cluster barycenter
Point, as the anchor node gone out selected in cluster set to be selected；
Step 3, according to each the corresponding anchor node set to be selected of cluster obtained in step 2, for each cluster,
Its leader cluster node is from the set to be selected of corresponding anchor node, and three nodes for selecting distribution closest to equilateral triangle are poly- as this
The anchor node gone out selected in class；
, there is the anchor node for needing extra selection in step 4, then need by each is clustered in network leader cluster node it
Between communication, collect at node deployment zone boundary each cluster in closest to deployment region border node, from this
The anchor node that needs are additionally selected is randomly choosed out in a little nodes, so far, is specified number and had in the entire network and closed
Manage the anchor node of distribution.
Preferably, the step one is comprised the following steps：
Step 10, mobile ad-hoc network interior joint sum is N, the anchor node number N according to required selectiona, calculate
The clusters number for being formed is needed to be shown below：WhereinForDownwards round value；Simultaneously
Calculating needs the anchor node number of extra selection to be shown below：Na'=Na-3×Ncluster；
Step 11, is clustered using similarity propagation clustering algorithm to mobile ad-hoc network interior joint, the cluster
Algorithm is distributed algorithm, only relies upon the Similarity value of the Similarity value and node itself between different nodes, wherein, will save
The negative value of the Euclidean distance between point i and node j (i, j=1 ..., N, j ≠ i) is used as Similarity value therebetween, node i
Distance is shown below between node j：Its
In, the two-dimensional position of initial time node i is shown below：Pi=[xi,yi]T, the similarity between node i and node j is as follows
Shown in formula：S (i, j)=- dij, for nodei, range finding communication is carried out respectively by with other nodes in network, obtain itself and its
The distance between his node collection is combined into Di, dmedianIt is DiIntermediate value, the similarity of node i itself is put and is shown below：s(i,
I)=- dmedian·fscale, wherein, fscaleIt is Product-factor, by adjusting fscaleValue, thus it is possible to vary s's (i, i) takes
Value, and then different number of cluster can be obtained in cluster process；
Step 12, during by node clustering, also obtain the cluster head in each cluster while forming cluster
Node, choose process for the anchor node in each cluster is carried out by the leader cluster node control of the cluster, is clustered by each
Communication between leader cluster node, obtains the anchor node for needing extra selection.
Preferably, the step 2 is comprised the following steps：
Step 2 ten, based on the cluster situation obtained in step one, for cluster Cm(m=1 ..., Ncluster), wherein the
K node is expressed as Cmk(k=1 ..., Nm), NmIt is CmInterior joint number；The barycenter of cluster is om；Leader cluster node collects cluster
The initial position of interior all nodes, according to following formula：Calculate shown in following formula
Step 2 11, CmLeader cluster node calculate each node C in clustermkWith omBetween distance value dko, and constitute collection
Close Do, dmedWith dmaxRespectively DoIn intermediate value and maximum；
Step 2 12, extracts DoIn in being shown below：(dmed,(dmax+dmedThe interval distance value in)/2), this
A little corresponding node sets of distance value are CmIn anchor node set S to be selectedm。
Preferably, step 3 is comprised the following steps：
Step 3 ten, according to the cluster C obtained in step 2m(m=1 ..., Ncluster) anchor node set S to be selectedm,
Calculate SmMiddle each two nodeThe distance between
Step 3 11, from SmThree difference nodes of middle selectionWithIts position distribution constituted three
Angular area is calculated as follows shown in formula by Heron's formula：Its
In, p is shown below： It is nodeWith nodeThe distance between；
Step 3 12 a, triangle, its barycenter is assigned respectively to the distance on its three summitsWithThen the triangle can reach its maximum area when as equilateral triangle, and the maximum area is calculated as follows shown in formula：
Step 3 13, for evaluation nodeWithConstituted triangle close to equilateral triangle degree,
Equilateral triangle similarity is defined to be shown below：
Step 3 14, repeat step 11, step 12 and step 13, until by SmIn all nodes with three section
Point is completed for combination traversal, and obtains the combination of nodes with maximum equilateral triangle similarity, wherein three nodes for including are i.e.
It is cluster CmIn the anchor node selected；
Step 3 15, sets m=m+1, repeat step repeat step 11, step 12, step 13 and step 10
Four, until all clusters complete anchor node selection.
Preferably, the step 4 is comprised the following steps：
Step 4 ten, the N obtained in step 10a' be not 0, then proceed step 4 11 and step 4 12, it is no
Then, anchor node selection course in mobile ad-hoc network is so far completed；
Step 4 11, each is in the cluster at node deployment zone boundary closest to node deployment zone boundary
Node by these cluster correspondence leader cluster nodes between communications be pooled to close to deployment region middle position cluster correspond to
Leader cluster node at；
Step 4 12, the leader cluster node is randomly chosen out N from the node being pooled toa' individual anchor node, it is so far, complete
The anchor node selection course into mobile ad-hoc network.
Positive effect of the invention is：The anchor node number that the present invention can be obtained as needed, to needing
The clusters number formed in network and the anchor node number for needing extra selection are planned；Based on known to each node in network
Itself initial position, can application distribution formula clustering method the node in whole network is reasonably clustered, obtain institute
The cluster of number is needed, and three nodes with relatively uniform distribution are selected as anchor node in each cluster；In node
Deployment region border is selected around to be gone out to need the anchor node of extra selection, so as to the anchor for obtaining having reasonable layout in whole network
Node set.Confirmed by substantial amounts of Computer Simulation and actual experiment, due to rational clustering distribution and each cluster
Selected in node be evenly distributed in corresponding cluster, the anchor node system of selection proposed in the present invention can be initial in node
Selected in a distributed manner for the anchor node with reasonable layout in mobile ad-hoc network known to position, be conducive to improving net
The performance of network.
Brief description of the drawings
Fig. 1 is the general frame schematic diagram of anchor node system of selection in mobile ad-hoc network；
Fig. 2 is the anchor node distribution example figure obtained in anchor node system of selection in mobile ad-hoc network；
Fig. 3 is uniform the anchor node distribution that is obtained based on anchor node system of selection in mobile ad-hoc network, anchor node
Distribution and anchor node random distribution, co-positioned when institute is carried out to user node in network using imparametrization belief propagation algorithm
The positioning precision Comparative result of acquisition.
Specific embodiment
Present pre-ferred embodiments are given below in conjunction with the accompanying drawings, to describe technical scheme in detail.
As shown in figure 1, anchor node system of selection is comprised the following steps in mobile ad-hoc network of the present invention：
Step one, anchor node number as needed, it is determined that needing the clusters number formed in mobile ad-hoc network
(needing to select three anchor nodes in each cluster) and the extra anchor node number for selecting is needed, by all sections in network
Point is rationally clustered in a distributed manner, the cluster of number needed for obtaining；
Step 2, based on the cluster situation obtained in step one, in each cluster, its leader cluster node is poly- according to this
Distance value situation between each node and cluster barycenter in class, selects some moderate sections of the distance between cluster barycenter
Point, as the anchor node gone out selected in cluster set to be selected；
Step 3, according to each the corresponding anchor node set to be selected of cluster obtained in step 2, for each cluster,
Its leader cluster node is from the set to be selected of corresponding anchor node, and three nodes for selecting distribution closest to equilateral triangle are poly- as this
The anchor node gone out selected in class；
Step 4, if in the presence of the anchor node for needing extra selection, needing the leader cluster node by each cluster in network
Between communication, collect at node deployment zone boundary each cluster in closest to deployment region border node (no
Including the anchor node selected in step 3), the anchor node that needs are additionally selected is randomly choosed out from these nodes, extremely
This, specified number and in the entire network with reasonable layout anchor node.
The step one is comprised the following steps：
Step 10, mobile ad-hoc network interior joint sum is N, the anchor node number N according to required selectiona, calculate
Need the clusters number N for being formedclusterAs shown in following formula (1), whereinForDownwards round value；Calculating simultaneously needs
The anchor node number N ' additionally to selectaAs shown in following formula (2)；
Na'=Na-3×Ncluster......(2)
Step 11, is clustered using similarity propagation clustering algorithm to mobile ad-hoc network interior joint, the cluster
Algorithm is distributed algorithm, only relies upon the Similarity value of the Similarity value and node itself between different nodes, wherein, will save
The negative value of the Euclidean distance (hereinafter referred to as distance) between point i and node j (i, j=1 ..., N, j ≠ i) is used as therebetween
Similarity value, between node i and node j shown in distance such as following formula (3)：
Wherein, the two-dimensional position P of initial time node iiAs shown in following formula (4),
Pi=[xi,yi]T......(4)
Shown in similarity such as following formula (5) between node i and node j,
S (i, j)=- dij.......(5)
For node i, range finding communication is carried out respectively by with other nodes in network, obtain it between other nodes
Distance set is Di, dmedianIt is DiIntermediate value, the similarity of node i itself is put as shown in following formula (6),
S (i, i)=- dmedian·fscale,......(6)
Wherein, fscaleIt is Product-factor, by adjusting fscaleValue, change the value of s (i, i), and then clustering
Different number of cluster is obtained in journey；
Step 12, during by node clustering, also obtain the cluster head in each cluster while forming cluster
Node, choose process for the anchor node in each cluster is carried out by the leader cluster node control of the cluster, is clustered by each
Communication between leader cluster node, obtains the anchor node for needing extra selection.
The step 2 is comprised the following steps：
Step 2 ten, based on the cluster situation obtained in step one, for cluster Cm(m=1 ..., Ncluster), wherein the
K node is expressed as Cmk(k=1 ..., Nm), NmIt is CmInterior joint number；The barycenter of cluster is om；Leader cluster node collects cluster
The initial position of interior all nodes, calculates shown in following formula (8) according to following formula (7)；
Step 2 11, CmLeader cluster node calculate each node C in clustermkWith omBetween distance value dko, and constitute collection
Close Do, dmedWith dmaxRespectively DoIn intermediate value and maximum；
Step 2 12, extracts DoIn in as shown in following formula (9) interval distance value, the corresponding section of these distance values
Point set is CmIn anchor node set S to be selectedm。
(dmed,(dmax+dmed)/2)......(9)
Step 3 is comprised the following steps：
Step 3 ten, according to the cluster C obtained in step 2m(m=1 ..., Ncluster) anchor node set S to be selectedm,
Calculate SmMiddle each two nodeThe distance between
Step 3 11, from SmThree difference nodes of middle selectionWithIts position distribution constituted three
Angular area is calculated as follows shown in formula (10) by Heron's formula,
Wherein, shown in p such as following formulas (11),It is nodeWith nodeThe distance between；
Step 3 12 a, it is assumed that triangle, its barycenter is assigned respectively to the distance on its three summitsWith(It is nodeWith CmBarycenter omThe distance between), then the triangle is when as equilateral triangle
Its maximum area can be reached, the maximum area is calculated as follows shown in formula (12)；
Step 3 13, for evaluation nodeWithConstituted triangle close to equilateral triangle degree,
Define shown in equilateral triangle similarity such as following formula (13)；
Step 3 14, repeat step 11, step 12 and step 13, until by SmIn all nodes with three section
Point is completed for combination traversal, and obtains the combination of nodes with maximum equilateral triangle similarity, wherein three nodes for including are i.e.
It is cluster CmIn the anchor node selected；
Step 3 15, sets m=m+1, repeat step 11, step 12, step 13 and step 14, until institute
There is cluster to complete anchor node to select.
The step 4 is comprised the following steps：
Step 4 ten, if the N obtained in step 10a' be not 0, then proceed step 4 11 and step 4 12, it is no
Then, anchor node selection course in mobile ad-hoc network is so far completed；
Step 4 11, each is in the cluster at node deployment zone boundary closest to node deployment zone boundary
Node by these cluster correspondence leader cluster nodes between communications be pooled to close to deployment region middle position cluster correspond to
Leader cluster node at；
Step 4 12, the leader cluster node is randomly chosen out N from the node being pooled toa' individual anchor node, it is so far, complete
The anchor node selection course into mobile ad-hoc network.
In the mobile ad-hoc network that is considered of the present invention, the initial position of all nodes is, it is known that first as needed
Anchor node number, cooks up the clusters number for needing to be formed in a network and the anchor node number for needing extra selection；Network
Between interior nodes mutually carry out range finding communication to obtain distance therebetween, using the negative value of distance between node as node it
Between similarity；Network node is clustered using similarity propagation clustering algorithm, wherein by similar to node itself
The reasonable assignment of degree can make to obtain required clusters number in cluster process, while can obtain each cluster in cluster process
In leader cluster node, each leader cluster node needs the anchor node selection process etc. being responsible in cluster where it；For shape in network
Into each cluster, its leader cluster node collect cluster interior nodes initial position, by calculate these nodes with cluster barycenter
The distance between, can therefrom select the anchor node set to be selected formed apart from the moderate node of barycenter in the cluster；Enter one
Step ground, selects distribution closest to three nodes of equilateral triangle as at this in the anchor node set to be selected in each cluster
The anchor node selected in cluster；The anchor node of extra selection, enters between clustering correspondence leader cluster node by each if necessary
Row communication, node closest to deployment region border (does not include in collecting each cluster at node deployment zone boundary
The anchor node selected in each cluster), and the anchor node that needs are additionally selected is randomly choosed out in these nodes；So far,
Anchor node selection course is completed in mobile ad-hoc network.
More specifically, in a preference of the invention, it is considered to which one to position user node as main business
Mobile ad-hoc network, selection reference mode of the anchor node as user node in co-positioned process, the present invention is logical
Following technical scheme realization is crossed, the present invention is comprised the following steps：
Step 5 ten, the anchor node number selected as needed, calculates the clusters number for needing to be formed in a network
And need the anchor node number of extra selection；The mobile ad-hoc network considered in the present embodiment includes 150 nodes, node
The square area of 100m × 100m is deployed in, it is necessary to the anchor node selected is 19, it is therefore desirable to form 6 in a network
Cluster (selecting 3 anchor nodes in each cluster) and 1 anchor node of the extra selection of needs, are carried out between network node
Range finding communication, using similarity propagation clustering algorithm, using the negative value of the distance between node as similar between corresponding node
Degree, while by giving each node rational itself similarity (fscale=4) so as to 6 clusters needed for obtaining；
Step 5 11, obtains the anchor node set to be selected in each cluster.For each cluster Cm(m=1 ..., 6),
Calculate CmBarycenter om, then calculate CmIn each node and omThe distance between, obtain distance set Do, and obtain DoIn
Median dmedWith maximum dmax, select those and omThe distance between be in (dmed,(dmax+dmedIn the interval of)/2)
Node is used as CmIn anchor node set to be selected；
Step 5 12, selects the anchor node in each cluster.For each cluster Cm(m=1 ..., 6), its is right
The anchor node set S to be selected for answeringmIn every three nodes formed combination, and select distribution closest to equilateral triangle node group
Close, then three nodes in the combination are CmSelected in the anchor node that goes out；
Step 5 13, selects the anchor node for needing extra selection.Due to there is 1 to need extra selection in the present embodiment
Anchor node, then by each be in node deployment zone boundary at cluster in closest to node deployment zone boundary node
(the not anchor node including having been selected in step 3) collects, and randomly chooses out a node therefrom as extra choosing
The anchor node selected out, selects the node closest to deployment region left border as anchor node in the present embodiment.So far, move certainly
Anchor node selection course is completed in tissue network；Fig. 2 illustrate obtained in this preference anchor node distribution and in a network
Each cluster for being formed, wherein, "○" represents user node, the anchor node gone out selected by " ▲ " expression, and each cluster is by dotted line
And deployment region border round；It can be seen that the anchor node selected in this preference is in whole deployment region
Distribution is more uniform.
Exist to assess the anchor node gone out selected by anchor node system of selection in mobile ad-hoc network proposed by the present invention
The performance to be reached in the present embodiment, have selected a kind of co-positioned algorithm being widely studied in the present embodiment --- non-ginseng
Numberization belief propagation algorithm is missed as the location algorithm for user node with the positioning of all user nodes in whole network
Difference situation as performance indications, wherein described position error by root-mean-square error (root mean square error,
RMSE) it is indicated, RMSE's is defined as shown in formula (14),
Wherein, NaIt is the number of user node in network；SaIt is the set of user node in network；xaIt is user node na
Physical location；It is user node naThe estimated location obtained during co-positioned.
Fig. 3 lists anchor node distribution, anchor node random distribution and the anchor node for proposing that method is obtained in the present invention
In the case of being uniformly distributed, using imparametrization belief propagation algorithm under 200 sample conditions to network in user node carry out
Cumulative distribution (cumulative distribution function, the CDF) situation for the position error to be reached during positioning.
It can be seen that compared to the situation of anchor node random distribution, imparametrization belief propagation algorithm is carried based on the present invention
Go out when the anchor node that method obtains is distributed and positioning when anchor node is uniformly distributed is based on close to it in the performance in terms of positioning precision
Precision property, and anchor node be uniformly distributed can be considered as anchor node Optimal Distribution situation, it can be said that the bright present invention is carried
The method for going out can be to select rational anchor node point as the mobile ad-hoc network of main business to position user node
Cloth, improves performance of the location algorithm in terms of positioning precision.
Particular embodiments described above, technical problem, technical scheme and beneficial effect to solution of the invention are carried out
Further describe, should be understood that and the foregoing is only specific embodiment of the invention, be not limited to
The present invention, all any modification, equivalent substitution and improvements within the spirit and principles in the present invention, done etc., should be included in this
Within the protection domain of invention.
Claims (5)
1. anchor node system of selection in a kind of mobile ad-hoc network, it is characterised in that it is comprised the following steps：
Step one, anchor node number as needed, it is determined that need in mobile ad-hoc network formed clusters number and
The anchor node number of extra selection is needed, will rationally be clustered to all Node distribution formulas in network, number needed for obtaining
Cluster；
Step 2, based on the cluster situation obtained in step one, in each cluster, its leader cluster node is according in the cluster
Distance value situation between each node and cluster barycenter, selects some moderate nodes of distance between cluster barycenter, makees
The anchor node set to be selected gone out selected in the cluster；
Step 3, according to each the corresponding anchor node set to be selected of cluster obtained in step 2, for each cluster, its cluster
Head node selects distribution closest to three nodes of equilateral triangle as in the cluster from the set to be selected of corresponding anchor node
It is selected go out anchor node；
, be present the anchor node for needing extra selection in step 4, then need by between the leader cluster node of each cluster in network
Communication, collect at node deployment zone boundary each cluster in closest to deployment region border node, from these section
The anchor node that needs are additionally selected is randomly choosed out in point, so far, is specified number and had in the entire network and rationally divided
The anchor node of cloth.
2. anchor node system of selection in mobile ad-hoc network as claimed in claim 1, it is characterised in that the step one is wrapped
Include following steps：
Step 10, mobile ad-hoc network interior joint sum is N, the anchor node number N according to required selectiona, calculating needs shape
Into clusters number be shown below：WhereinForDownwards round value；Calculate simultaneously
The anchor node number of extra selection is needed to be shown below：Na'=Na-3×Ncluster；
Step 11, is clustered using similarity propagation clustering algorithm to mobile ad-hoc network interior joint, the clustering algorithm
It is distributed algorithm, only relies upon the Similarity value of the Similarity value and node itself between different nodes, wherein, by node i
With the negative value of the Euclidean distance between node j (i, j=1 ..., N, j ≠ i) as Similarity value therebetween, node i with
Distance is shown below between node j：Wherein,
The two-dimensional position of initial time node i is shown below：Pi=[xi,yi]T, the similarity such as following formula between node i and node j
It is shown：S (i, j)=- dij, for node i, range finding communication is carried out respectively by with other nodes in network, obtain itself and other
The distance between node collection is combined into Di, dmedianIt is DiIntermediate value, the similarity of node i itself is put and is shown below：s(i,i)
=-dmedian·fscale, wherein, fscaleIt is Product-factor, by adjusting fscaleValue, change s (i, i) value, and then
Different number of cluster is obtained in cluster process；
Step 12, during by node clustering, also obtain the leader cluster node in each cluster while forming cluster,
Choose process for the anchor node in each cluster is carried out by the leader cluster node control of the cluster, the cluster head section clustered by each
Communication between point, obtains the anchor node for needing extra selection.
3. anchor node system of selection in mobile ad-hoc network as claimed in claim 1, it is characterised in that the step 2 bag
Include following steps：
Step 2 ten, based on the cluster situation obtained in step one, for cluster Cm(m=1 ..., Ncluster), wherein k-th
Node is expressed as Cmk(k=1 ..., Nm), NmIt is CmInterior joint number；The barycenter of cluster is om；Leader cluster node collects institute in cluster
There is the initial position of node, according to following formula：Calculate shown in following formula
Step 2 11, CmLeader cluster node calculate each node C in clustermkWith omBetween distance value dko, and constitute set Do,
dmedWith dmaxRespectively DoIn intermediate value and maximum；
Step 2 12, extracts DoIn in being shown below：(dmed,(dmax+dmedThe interval distance value in)/2), these distances
It is worth corresponding node set as CmIn anchor node set S to be selectedm。
4. anchor node system of selection in mobile ad-hoc network as claimed in claim 1, it is characterised in that step 3 include with
Lower step：
Step 3 ten, according to the cluster C obtained in step 2m(m=1 ..., Ncluster) anchor node set S to be selectedm, calculate Sm
Middle each two nodeThe distance between
Step 3 11, from SmThree difference nodes of middle selectionWithThe triangle that its position distribution is constituted
Area is calculated as follows shown in formula by Heron's formula：Wherein, p
It is shown below： It is nodeWith node
The distance between；
Step 3 12 a, triangle, its barycenter is assigned respectively to the distance on its three summitsWith
Then the triangle reaches its maximum area when as equilateral triangle, and the maximum area is calculated as follows shown in formula：
Step 3 13, for evaluation nodeWithConstituted triangle is defined close to the degree of equilateral triangle
Equilateral triangle similarity is shown below：
Step 3 14, repeat step 11, step 12 and step 13, until by SmIn all nodes be with three nodes
Combination traversal is completed, and obtains the combination of nodes with maximum equilateral triangle similarity, wherein three nodes for including be it is poly-
Class CmIn the anchor node selected；
Step 3 15, setting m=m+1, repeat step repeat step 11, step 12, step 13 and step 14, directly
Anchor node selection is completed to all clusters.
5. anchor node system of selection in mobile ad-hoc network as claimed in claim 1, it is characterised in that the step 4 bag
Include following steps：
Step 4 ten, the N obtained in step 10a' be not 0, then proceed step 4 11 and step 4 12, otherwise, so far
Complete anchor node selection course in mobile ad-hoc network；
Step 4 11, the section in the cluster at node deployment zone boundary closest to node deployment zone boundary is in by each
Point is pooled to the corresponding cluster of cluster close to deployment region middle position by these communications clustered between correspondence leader cluster node
At head node；
Step 4 12, the leader cluster node is randomly chosen out N from the node being pooled toa' individual anchor node, so far, completes movement
Anchor node selection course in self-organizing network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611050324.1A CN106792845B (en) | 2016-11-24 | 2016-11-24 | Anchor node selection method in mobile self-organizing network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611050324.1A CN106792845B (en) | 2016-11-24 | 2016-11-24 | Anchor node selection method in mobile self-organizing network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106792845A true CN106792845A (en) | 2017-05-31 |
| CN106792845B CN106792845B (en) | 2020-05-01 |
Family
ID=58911351
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611050324.1A Active CN106792845B (en) | 2016-11-24 | 2016-11-24 | Anchor node selection method in mobile self-organizing network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106792845B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108900336A (en) * | 2018-06-29 | 2018-11-27 | 电子科技大学 | A kind of server selection method for built-in network |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101715232A (en) * | 2009-11-20 | 2010-05-26 | 西安电子科技大学 | Positioning method of weighted wireless sensor network nodes based on RSSI and LQI |
| CN102123495A (en) * | 2011-01-13 | 2011-07-13 | 山东大学 | Centroid location algorithm based on RSSI (Received Signal Strength Indication) correction for wireless sensor network |
| CN103369670A (en) * | 2013-07-08 | 2013-10-23 | 河海大学 | Improved DV-hop (distance vector-hop) location method based on hop count optimization |
| CN103889057A (en) * | 2014-04-18 | 2014-06-25 | 上海海事大学 | Wireless sensor network search-and-rescue target location method based on maritime environment self-adaptation RSST distance measurement |
| CN104185272A (en) * | 2014-07-30 | 2014-12-03 | 河海大学 | WSN location method based on WSDV-Hop (Weighted and Selected DV-Hop) |
| CN105611623A (en) * | 2015-09-18 | 2016-05-25 | 宇龙计算机通信科技(深圳)有限公司 | Positioning method of mobile terminal and positioning device |
-
2016
- 2016-11-24 CN CN201611050324.1A patent/CN106792845B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101715232A (en) * | 2009-11-20 | 2010-05-26 | 西安电子科技大学 | Positioning method of weighted wireless sensor network nodes based on RSSI and LQI |
| CN102123495A (en) * | 2011-01-13 | 2011-07-13 | 山东大学 | Centroid location algorithm based on RSSI (Received Signal Strength Indication) correction for wireless sensor network |
| CN103369670A (en) * | 2013-07-08 | 2013-10-23 | 河海大学 | Improved DV-hop (distance vector-hop) location method based on hop count optimization |
| CN103889057A (en) * | 2014-04-18 | 2014-06-25 | 上海海事大学 | Wireless sensor network search-and-rescue target location method based on maritime environment self-adaptation RSST distance measurement |
| CN104185272A (en) * | 2014-07-30 | 2014-12-03 | 河海大学 | WSN location method based on WSDV-Hop (Weighted and Selected DV-Hop) |
| CN105611623A (en) * | 2015-09-18 | 2016-05-25 | 宇龙计算机通信科技(深圳)有限公司 | Positioning method of mobile terminal and positioning device |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108900336A (en) * | 2018-06-29 | 2018-11-27 | 电子科技大学 | A kind of server selection method for built-in network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106792845B (en) | 2020-05-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103476118B (en) | A kind of WLAN indoor location fingerprint positioning method for monitoring in real time | |
| CN108684005B (en) | SOM-based multi-AUV efficient data collection method in underwater sensor network | |
| CN106021560B (en) | The low time delay memory B+ tree index structuring method of Data Flow Oriented | |
| CN103249110B (en) | A kind of wireless sense network method for tracking target based on dynamic tree | |
| CN102883400B (en) | Method for forwarding data of hierarchal wireless sensor network based on semantic routing | |
| CN101170499A (en) | A selection method for combined service execution path in self-organized network | |
| CN104469879B (en) | A kind of dynamic k value cluster routing methods | |
| CN105512344B (en) | A kind of querying method of indoor moving object relative location | |
| CN105050095B (en) | A kind of topological construction method of the heterogeneous wireless sensor net based on energy predicting | |
| CN103686922A (en) | Optimization method for survival time of multi-Sink-node movement wireless sensor network | |
| CN103259744A (en) | Method for mapping mobile virtual network based on clustering | |
| CN113411766B (en) | Intelligent Internet of things comprehensive sensing system and method | |
| CN107659973A (en) | Super-intensive network cluster dividing method based on density K means algorithms | |
| John et al. | Energy saving cluster head selection in wireless sensor networks for internet of things applications | |
| CN109960279A (en) | A kind of unmanned plane turn circle radius optimization method based on heuritic approach | |
| CN105654387A (en) | Time-varying network community evolution visualization method introducing quantitative index | |
| CN108848535A (en) | A kind of mist calculating environmental resource distribution method towards shared model | |
| CN114727353A (en) | Self-adaptive information transmission method of mobile opportunistic sensor network based on genetic algorithm | |
| CN106792845A (en) | Anchor node system of selection in mobile ad-hoc network | |
| CN107135155B (en) | A kind of opportunistic network routing method based on node social relationships | |
| CN106211197A (en) | A kind of construction method of air-sea orientation self-organizing network space division multiplexing time division multiple acess access model | |
| CN103826282B (en) | Set based on dump energy divides multi-hop routing method | |
| CN103427884B (en) | Acquisition methods is worked in coordination with in multiple terminals based on service generation ubiquitous in mobile ad hoc network | |
| CN105392176B (en) | A kind of calculation method of actuator node executive capability | |
| CN105682170A (en) | Clustering-type wireless sensor network data collection method based on energy consumption balance |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |