CN102497615A - Location-information-based clustering method for node mobile network - Google Patents
Location-information-based clustering method for node mobile network Download PDFInfo
- Publication number
- CN102497615A CN102497615A CN2011103912157A CN201110391215A CN102497615A CN 102497615 A CN102497615 A CN 102497615A CN 2011103912157 A CN2011103912157 A CN 2011103912157A CN 201110391215 A CN201110391215 A CN 201110391215A CN 102497615 A CN102497615 A CN 102497615A
- Authority
- CN
- China
- Prior art keywords
- node
- bunch
- virtual network
- information
- central service
- 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.)
- Pending
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a location-information-based clustering method for a node mobile network. The method comprises the following steps that: 1, each node acquires own location information and own speed information; 2, each node periodically updates own location information and own speed information, and performs one-hop broadcasting on the updated location information and the updated speed information, so that each node knows the location information and speed information of neighbor nodes; 3, a virtual network central node is introduced and located in the center of the network, and moves at the average speed of the nodes in the network, and at least one node is selected from real nodes as a virtual network center maintenance node which is used for updating and broadcasting the information of the virtual network center node; 4, a working area is covered and divided into a plurality of areas by taking the virtual network center node as a center, each area is a cluster area and represents a cluster, a node with the longest intra-cluster survival time is selected as a cluster head node in each cluster, and the other nodes in each cluster serve as ordinary nodes; and 5, the clusters are maintained.
Description
Technical field
The invention belongs to communication technical field, relate to the cluster-dividing method of mobile communication networking, specifically design a kind of cluster-dividing method based on the auxiliary node motion network of locating information.
Background technology
The application of mobile ad hoc network in scenes such as battlefield communication, Internet of Things, disaster and accident rescue, mobile office is increasingly extensive.Along with the increase of number of nodes, mobile ad hoc network gradually adopts cluster structured to strengthen network extensibility.Research shows, cluster structuredly can not only strengthen network extensibility, also can be used for work such as auxiliary channel access, route, network security, energy control, is extremely important to improving network performance.
Node motion speed improves gradually, and network topology structure changes to be accelerated, and has brought new challenge for the sub-clustering algorithm.To this problem, produced some and be applicable to the sub-clustering algorithm of high speed mobile environment.These algorithms are cluster through the node division that movement velocity is close, improved node bunch in life span, strengthened cluster structured stability, solved the problem that the high speed mobility is brought to a certain extent.But the general more complicated of these algorithms, sub-clustering and maintenance costs are big.And each bunch overlaps in space too much, and more often phase mutual interference is difficult to carry out frequency planning in motion process.
Sub-clustering is meant through certain rule network is divided into several virtual groups.Each group is called cluster.Each bunch is made up of leader cluster node, gateway node and ordinary node.Leader cluster node produces through various sub-clustering algorithms, resource in being in charge of bunch.Gateway node then is positioned at the lap of an adjacent cluster overlay area, work such as information forwarding between being responsible for bunch.Remove leader cluster node and gateway node, the remaining ordinary node that is referred to as.The generation that the sub-clustering algorithm generally is divided into bunch and bunch two stages of maintenance.Bunch the processes such as generation of the generation phase division, bunch head and the gateway node that mainly comprise bunch.Bunch maintenance then be after the node role confirms, continue to safeguard cluster structured process.
Cluster structured, will make network have plurality of advantages.At first, can carry out frequency division multiplexing, improve power system capacity.The second, bunch head can better be coordinated a bunch interior nodes, alleviates because the efficiency that factors such as conflict cause.The 3rd, on the backbone network that route can be confined to be made up of bunch head and gateway node, network scalability is strengthened.The cluster structured while also will produce some shortcomings.The first, for set up and safeguard cluster structured, need be between node exchange message, increased overhead.The second, local bunch nose heave newly-generatedly possibly cause all bunch nose heave newly-generated of the whole network, i.e. sub-clustering chain reaction again.
Be applicable to the sub-clustering algorithm of high speed mobile environment at present; Though in the high speed mobile environment, realized prolongation node life span to a certain extent, made up and stablize cluster structured purpose; But these algorithm ubiquities complex algorithm, the shortcoming that the sub-clustering expense is big.And each sub-clustering is spatially too much overlapping, and more often phase mutual interference is difficult to carry out effective frequency planning in motion process.
Can find out from flat structures routing algorithm characteristic and cluster structured pluses and minuses, when interstitial content more for a long time, must adopt the cluster structured key property that could guarantee network.Can find out from the characteristic of various sub-clustering algorithms; Along with the ambulant increase of node, topology of networks changes rapidly, bunch head, gateway and ordinary node bunch in life span descend; And then causing problems such as packet loss, throughput descend, time-delay increase, network performance significantly worsens.And to the sub-clustering algorithm of high mobility; From improving the angle of life span in the node cluster; Node through variety of way is close with speed or relative velocity is less is divided into cluster; Prolong the life span of bunch head, gateway and ordinary node, strengthened cluster structured stability under the high speed mobile environment to a certain extent.
Frequency resource must take the frequency planning technology to improve network capacity as the keystone resources of mobile communication.But to the sub-clustering algorithm of high mobility, because the spatially overlapping more and easy at the volley phase mutual interference of each bunch of each bunch is difficult to carry out frequency planning.
Summary of the invention
The technical problem that (one) will solve
To above problem; The present invention is from cluster structured and angle frequency planning; A kind of sub-clustering algorithm LIBC (Location Information Based Clustering algorithm) based on the auxiliary node motion network of positioning position information has been proposed; Can be applicable to the high speed mobile environment, can be convenient to the sub-clustering algorithm of frequency planning again, can reduce algorithm complex and sub-clustering expense simultaneously again.
(2) technical scheme
In order to solve the problems of the technologies described above, the present invention provides a kind of cluster-dividing method based on the auxiliary node motion network of locating information, comprises step:
S1: each node obtains positional information and the velocity information of self;
S2: each node periodically upgrades self positional information and velocity information and and jumps broadcasting, makes each node that the positional information and the velocity information of adjacent node all arranged;
S3: introduce the virtual network Centroid, it is in the center of network on the position, and moves with the average speed of network node; In real node, select at least one node as virtual network central service node, be responsible for the information updating and the broadcasting of virtual network Centroid;
S4:, as the center working region is covered and is divided into several zones with the virtual network Centroid, each zone is a bunch of zone, represents one bunch; Each bunch selection has the node of life span in maximum bunch as leader cluster node, and other nodes are as ordinary node in bunch;
S5: the maintenance of carrying out bunch comprises that leader cluster node is safeguarded, ordinary node is safeguarded and the adding of new node.
Preferably, each node adopts Kalman's method to estimate self velocity information among the said step S1.
Preferably, selection is numbered maximum real node as main virtual network central service node among the said step S3, and selection is numbered second, third real node as standby virtual network center Maintenance Point; Main virtual network central service node and two standby virtual network center Maintenance Points are safeguarded the positional information and the velocity information of virtual network Centroid simultaneously, and broadcast at the whole network; Virtual network central service node receives after the virtual network Centroid information of other virtual network central service node that the virtual network Centroid information of selecting wherein to number maximum virtual network central service node is carried out synchronously; After other node is received the virtual network Centroid information of separate sources, wherein to be as the criterion from the virtual network Centroid information of numbering maximum virtual network central service node; If it is maximum that certain non-virtual network central service node is only received from the virtual network Centroid information of two virtual network central service nodes and self numbering numbering in all non-virtual network central service nodes, then become virtual network central service node and start working; If certain virtual network central service node receives three and above virtual network Centroid information, and self numbering is not in first three in all virtual network central service nodes, then no longer bears the work of virtual network central service node.
Preferably; Said step S4 cluster become after; Virtual network central service node obtains the positional information and the velocity information of the whole network node from bunch head, and the mean value of the whole network node speed is upgraded as the translational speed of the virtual network Centroid line position of going forward side by side behind smothing filtering.
Preferably, among the said step S4 with the virtual network Centroid as the center, the working region is covered with several squares, each square is a bunch of zone, represents one bunch (X ', Y '); Node obtain self-position information (x, y) after, according to the relative position of self and virtual network Centroid confirm oneself place bunch, use formula
Confirm the place bunch, wherein ROUND representes to round nearby, L representes communication range.
Preferably, consider frequency planning, two bunches of then reusable channels in zone in interval are according to formula F
X ', Y '=mod (X ', 3)+3*mod (Y ', 3)+1 is that each bunch distributes physical channel, wherein F
(X ', Y ')The physical channel numbers that expression distributes; And will be placed on the transmission of control information on the independent channel.
Preferably, said step S5 is after the maintenance that gets into bunch, and leader cluster node will periodically be collected bunch an interior nodes positional information and a velocity information, and between bunch head, broadcast, and make each leader cluster node that the positional information and the velocity information of the whole network node all arranged; Under the unified control of leader cluster node, the function of data forwarding between all ordinary nodes all have bunch.
Preferably, the process of bunch head maintenance is among the said step S5: leader cluster node is at first calculated self positional information and velocity information with respect to the virtual network Centroid; If through calculating bunch number with last one constantly bunch number different, then leader cluster node directly changes new node into, application networking again; If identical, then estimate bunch head bunch in life span, a bunch head is left this incident of bunch zone carries out early warning; When leader cluster node find self bunch in life span during less than a certain thresholding, just trigger a new bunch of generating routine, then accomplish the transition of new and old bunch of head.
Preferably; The maintenance process of ordinary node is among the said step S5: leader cluster node periodically bunch in one jump the broadcasting handshaking information, ordinary node is if lose a bunch handshaking information of some continuously, then thinks to lose with a bunch head and gets in touch; Thereby become a new node, application networks again.
Preferably, the process that new node adds among the said step S5 is: leader cluster node will with the communication delay sum of each bunch interior nodes as this bunch bunch in the integrated load coefficient; When new node networked, then acquiescence was clustered into the stage and is accomplished, the maintenance phase that network is in bunch; This locality that new node calculating earlier oneself belongs to bunch number also jumping broadcasting transmission adding bunch application; The leader cluster node that all receive this application, return one contain oneself bunch in the adding of integrated load coefficient bunch reply; After new node was waited for certain hour, if having from local bunch reply, and this bunch integrated load coefficient then added local bunch less than a certain threshold value; Otherwise in all were replied, the integrated load coefficient is minimum in selecting bunch bunch sent to add and bunch confirms, and adds this bunch; If no response then resends adding bunch application; Repeat send to add after bunch certain number of times of application, still no response, the generation phase that then gets into bunch, each node foundation and the relative position of virtual network Centroid confirm self place bunch, and produce leader cluster node and ordinary node.
(3) beneficial effect
The present invention is through carrying out Kalman filtering to the speed measured value, and the accuracy of the information that not only gathers way has more reduced because the velocity information instantaneous mutation is given the tremendous influence that network brought.Through introducing the in groups motion conditions of virtual network Centroid with the reflection network; The division of carrying out bunch with relative position; Make of the mass motion campaign of bunch zone boundary with network node; Realized that to a certain extent the whole network node minimizes relative to what VNC moved, prolonged node bunch in life span.Lost efficacy through early warning bunch head, triggered new election of cluster head program in advance, reduced the required time of replacing bunch first watch greatly, reduced the network jitter of losing efficacy and causing because of bunch head.Through integrated load coefficient in introducing bunch, load balancing between realizing bunch, communication efficiency in having improved bunch.
Description of drawings
Fig. 1 is the flow chart of the inventive method;
Fig. 2 is preparation method flow diagram among the present invention;
Fig. 3 is virtual network central service flow chart among the present invention;
Fig. 4 is among the present invention bunch the generation and the flow chart of service portion;
Fig. 5 is the distribution sketch map of bunch dividing region and physical channel in one embodiment of the invention;
Fig. 6 safeguards flow chart for leader cluster node among the present invention;
The flow chart that Fig. 7 networks for new node among the present invention.
Embodiment
Below in conjunction with accompanying drawing and embodiment, specific embodiments of the invention describes in further detail.Following examples are used to explain the present invention, but are not restriction scopes of the present invention.
As shown in Figure 1, the cluster-dividing method based on the auxiliary node motion network of locating information of the present invention comprises step: S1: each node obtains positional information and the velocity information of self; S2: each node periodically upgrades self positional information and velocity information and and jumps broadcasting, makes each node that the positional information and the velocity information of adjacent node all arranged; S3: introduce the virtual network Centroid, it is in the center of network on the position, and moves with the average speed of network node; In real node, select at least one node as virtual network central service node, be responsible for the information updating and the broadcasting of virtual network Centroid; S4:, as the center working region is covered and is divided into several zones with the virtual network Centroid, each zone is a bunch of zone, represents one bunch; Each bunch selection has the node of life span in maximum bunch as leader cluster node, and other nodes are as ordinary node in bunch; S5: the maintenance of carrying out bunch comprises that leader cluster node is safeguarded, ordinary node is safeguarded and the adding of new node.
For ease of setting forth, with the present invention be divided into preparation, bunch generation with safeguard two parts.
1.LIBC the preparation of algorithm
As far as the sub-clustering algorithm, bunch generation with bunch maintenance be the main part of algorithm.Preparation then be for bunch generation with bunch maintenance carry out place mat.This part work comprises the maintenance of velocity estimation and virtual network Centroid.Preparation be periodically carry out and when algorithm begins, carry out and last till that always algorithm stops.Fig. 2 is the flow chart of preparation part.
1.1 displacement velocity estimation
Through modes such as global positioning system, the Big Dippeves, node can obtain the positional information of self.Through the positional information of double acquisition, and the time difference, just can obtain current velocity information.But because factors such as error, time-delay, velocity attitude variation must be carried out Filtering Processing to the velocity information that obtains.Velocity information is carried out can the gather way accuracy of information of filtering, the more important thing is to reduce because the velocity information instantaneous mutation is given the tremendous influence that network brought.
Weiner filter and Kalman filter are two kinds of linear filters commonly used.When being input as wide stationary signal, the output of Weiner filter and Kalman filter comes to the same thing, and all is optimal filter.But Kalman filter adopts the recursion mode to represent, not only can be used for steady environment, more is applicable to non-stationary environment and non linear system.Because the broad applicability that the Kalman estimates, this algorithm has been taked Kalman's method to the estimation of speed.
Suppose that node A was respectively (X in the positional information of a last moment and current time
N-1, Y
N-1), (X
N, Y
N), the time difference of the two is Δ t, then through type (1) can obtain the measured value (V of present speed
X, N, V
Y, N).Suppose that node is separate in the movement velocity of X, Y two directions, and state and observational equation are all suc as formula (2), wherein τ
n, ω
nIt is mutual incoherent white noise.Then through type (3) can obtain next scalar Kalman estimation
of X, Y direction speed constantly of node respectively
Each node periodically upgrades self speed information and one and jumps broadcasting, makes each node that the position and speed information of adjacent node all arranged.The maintenance phase that gets into bunch, after promptly bunch head produces, leader cluster node will periodically be collected a bunch interior nodes position, velocity information, and between bunch head, broadcast, and make each leader cluster node that the velocity information of the whole network node all arranged.
1.2 introduce the virtual network Centroid
Virtual network Centroid VNC (Virtual Network Center node) introduces for bunch dividing region.The virtual network Centroid is an in fact also non-existent dummy node, but has information such as position, speed.Suppose that the virtual network Centroid spatially is in the center of network, and move with the average speed of network node.
Optional node in real node, the renewal and the broadcasting of responsible VNC information are referred to as virtual network central service node M VNC (Maintenance node for Virtual Network Center).
The positional information and the velocity information of virtual network Centroid are expressed as (X respectively
VNC, Y
VNC), (VX
VNC, VY
VNC), and all be initialized as (0,0).Virtual network central service node M VNC can obtain the velocity information of the whole network node from bunch head.The mean value of the whole network node speed is upgraded as the translational speed of the VNC line position of going forward side by side behind smothing filtering again.Promptly according to formula (4) to VX
VNC, X
VNCUpgrade, to VY
VNC, Y
VNCRenewal also can in like manner carry out, and result of calculation the whole network is broadcasted.
Consider network security, can take strategies such as hard backup virtual network central service node.In case current MVNC lost efficacy, and can launch the maintenance work that backup node is responsible for VNC.For the sake of simplicity, select the maximum node of numbering, select second, third node of node serial number as standby virtual network center Maintenance Point as main virtual network central service node M VNC.Main virtual network central service node and two standby virtual network center Maintenance Points are safeguarded position, the velocity information of virtual network Centroid simultaneously, and broadcast at the whole network.Virtual network central service node receives after the VNC information of other virtual network central service node, selects wherein the maximum VNC information of node serial number to carry out synchronously.After other node is received the virtual network central service nodal information of separate sources, wherein to be as the criterion from the VNC information of numbering maximum node.If it is maximum that certain non-virtual network central service node is only received from the VNC information of two Maintenance Points and self numbering numbering in all non-Maintenance Points, then become Maintenance Point and start working.If certain Maintenance Point receives three and above VNC information, and self numbering is not in first three in all Maintenance Points, then no longer bears the work of Maintenance Point.The virtual network center safeguard that flow chart is as shown in Figure 3.
2. bunch generation and maintenance
Bunch generation with safeguard it is the main part of sub-clustering algorithm.Bunch generation mainly comprise the generation of bunch dividing region and leader cluster node.Bunch maintenance comprise mainly then that leader cluster node is safeguarded, member node is safeguarded and the processes such as adding of new node.The generation that Fig. 4 is bunch and the flow chart of service portion.
2.1 bunch generation
, as the center working region is covered with square with virtual network Centroid VNC.Each square is a bunch of zone, represents one bunch, bunch number with (X ', Y ') expression.Node through modes such as global positioning system or Beidou satellite navigation system obtain self-position information (x, y) after, according to the relative position of self and virtual network Centroid VNC confirm oneself place bunch.Promptly use formula (5) confirm the place bunch, wherein ROUND representes to round nearby, L representes communication range.Consider frequency planning, two bunches of then reusable channels in zone can be that each bunch distributes physical channel, wherein F according to formula (6) then at interval
(X ', Y ')The physical channel numbers that expression distributes.
F
X′，Y′＝mod(X′，3)+3*mod(Y′，3)+1 (6)
The distribution of bunch dividing region and physical channel is as shown in Figure 5.So then 9 physical channels can cover the whole network.In view of control information to the importance of system, for guaranteeing that the network cluster dividing structure still can access maintenance when load is big, the transmission of control information is placed on the independent channel.Therefore add that 1 channel as common signal channel, is used for control information transmission.Then native system needs 10 subchannel altogether.
For reduce the frequency of changing bunch first watch as far as possible, the node of selecting to have life span in maximum bunch is as bunch head.After bunch area dividing, each node can be according to the speed of related movement and the relative position of self and VNC node, calculate self bunch in life span, and on common signal channel, one jump broadcasting.Each node is in self and all with the node of cluster compares, if bunch in life span maximum, then on common signal channel, send message, declaring self becomes leader cluster node.
After leader cluster node generated, other nodes became ordinary node in bunch.Under the unified control of leader cluster node, the function of data forwarding between all ordinary nodes all have bunch.So in the LIBC algorithm that this paper proposed, do not produce the special gateway node.
The LIBC algorithm is introduced the in groups motion conditions of virtual network Centroid with the reflection network; And carry out a bunch dividing region with relative position with the virtual network Centroid; Make of the mass motion campaign of bunch zone boundary with network node; Thereby realized that to a certain extent the whole network node minimizes relative to what VNC moved, prolonged node bunch in life span, and then improved the performance of network under mobile environment.This characteristic is in that moving scene is next more obvious in groups.
2.2 the maintenance of leader cluster node and member node
Leader cluster node be in charge of the scheduling bunch in resource, network performance is had material impact.In case, just need to produce new bunch head to substitute its work because reasons such as motion can not continue to fulfil a bunch responsibility.But from find leader cluster node lost efficacy, to produce new bunch of head, again to new bunch of head begin operate as normal during this period of time in, all data through these bunches all will be affected.
Among the LIBC, leader cluster node is at first calculated self position, velocity information with respect to VNC.If through formula (6) calculate bunch number with last one constantly bunch number different, then node directly changes new node into, application networking again.If identical, then estimate bunch head bunch in life span, a bunch head is left this incident of bunch zone carries out early warning.When leader cluster node find self bunch in life span during less than a certain thresholding, just trigger a new bunch of generating routine, then accomplish the transition of new and old bunch of head.So just, can reduce bunch first watch greatly for the required time, reduce the network jitter of losing efficacy and causing because of bunch head.Bunch head maintenance process in Here it is the LIBC algorithm, respective flow chart is as shown in Figure 6.
The maintenance of member node is then simple relatively, mainly depends on and the getting in touch of bunch head.Leader cluster node periodically bunch in one jump the broadcasting handshaking information.Member node is if lose bunch handshaking information of some continuously, then thinks to lose with a bunch head and gets in touch, thereby become a new node, and application networks again.
2.3 the networking of new node
If the division of carrying out bunch merely according to geographical location information, often occur some bunch Area Node too much, the but less situation of node of its adjacent area simultaneously.Interstitial content and load unbalanced influenced network performance greatly.Simultaneously, jump and can reach for guaranteeing bunch interior nodes one, the regional catercorner length of each bunch is set at communication range L, then single bunch region area is: L
2/ 2.And the actual area coverage of each leader cluster node is: π L
2, be about 6 times of single bunch of region area.Be that each bunch head has great covering power to a bunch exterior domain.So integrated load coefficient in introducing bunch, load balancing between realizing bunch.
In the LIBC algorithm, leader cluster node will with the communication delay sum of each bunch interior nodes as this bunch bunch in the integrated load coefficient.The integrated load coefficient is directly proportional with interstitial content in such bunch, is inversely proportional to communication quality.When new node networked, then acquiescence was clustered into the stage and is accomplished, the maintenance phase that network is in bunch.New node earlier calculates own this locality that belongs to bunch number (X ', Y ') according to formula (5).New node is jumped broadcast transmission from common signal channel one and is added bunch application.The leader cluster node that all receive this application, return one contain oneself bunch in the adding of integrated load coefficient bunch reply.After new node was waited for certain hour, if having from the replying of local bunch (X ', Y '), and this bunch integrated load coefficient was less than a certain threshold value, then added local bunch (X ', Y '); Otherwise in all were replied, the integrated load coefficient is minimum in selecting bunch bunch sent to add and bunch confirms, and adds this bunch.If no response then resends adding bunch application.Repeat send to add after bunch certain number of times of application, still no response, the generation phase that then gets into bunch, each node foundation and the relative position of VNC confirm self place bunch, and produce leader cluster node.The flow chart that new node networks is as shown in Figure 7.
The present invention is as explanation with no gateway node; Certainly, can in node, increase gateway node if desired.
The above only is a preferred implementation of the present invention; Should be pointed out that for those skilled in the art, under the prerequisite that does not break away from know-why of the present invention; Can also make some improvement and replacement, these improvement and replacement also should be regarded as protection scope of the present invention.
Claims (10)
1. the cluster-dividing method based on the auxiliary node motion network of locating information is characterized in that, comprises step:
S1: each node obtains positional information and the velocity information of self;
S2: each node periodically upgrades self positional information and velocity information and and jumps broadcasting, makes each node that the positional information and the velocity information of adjacent node all arranged;
S3: introduce the virtual network Centroid, it is in the center of network on the position, and moves with the average speed of network node; In real node, select at least one node as virtual network central service node, be responsible for the information updating and the broadcasting of virtual network Centroid;
S4:, as the center working region is covered and is divided into several zones with the virtual network Centroid, each zone is a bunch of zone, represents one bunch; Each bunch selection has the node of life span in maximum bunch as leader cluster node, and other nodes are as ordinary node in bunch;
S5: the maintenance of carrying out bunch comprises that leader cluster node is safeguarded, ordinary node is safeguarded and the adding of new node.
2. the method for claim 1 is characterized in that, each node adopts Kalman's method to estimate self velocity information among the said step S1.
3. the method for claim 1 is characterized in that, selection is numbered maximum real node as main virtual network central service node among the said step S3, and selection is numbered second, third real node as standby virtual network center Maintenance Point; Main virtual network central service node and two standby virtual network center Maintenance Points are safeguarded the positional information and the velocity information of virtual network Centroid simultaneously, and broadcast at the whole network; Virtual network central service node receives after the virtual network Centroid information of other virtual network central service node that the virtual network Centroid information of selecting wherein to number maximum virtual network central service node is carried out synchronously; After other node is received the virtual network Centroid information of separate sources, wherein to be as the criterion from the virtual network Centroid information of numbering maximum virtual network central service node; If it is maximum that certain non-virtual network central service node is only received from the virtual network Centroid information of two virtual network central service nodes and self numbering numbering in all non-virtual network central service nodes, then become virtual network central service node and start working; If certain virtual network central service node receives three and above virtual network Centroid information, and self numbering is not in first three in all virtual network central service nodes, then no longer bears the work of virtual network central service node.
4. the method for claim 1; It is characterized in that; Said step S4 cluster become after; Virtual network central service node obtains the positional information and the velocity information of the whole network node from bunch head, and the mean value of the whole network node speed is upgraded as the translational speed of the virtual network Centroid line position of going forward side by side behind smothing filtering.
5. the method for claim 1 is characterized in that, among the said step S4 with the virtual network Centroid as the center, the working region is covered with several squares, each square is a bunch of zone, represents one bunch (X ', Y '); Node obtain self-position information (x, y) after, according to the relative position of self and virtual network Centroid confirm oneself place bunch, use formula
Confirm the place bunch, wherein ROUND representes to round nearby, L representes communication range.
6. method as claimed in claim 5 is characterized in that, considers frequency planning, and two bunches of then reusable channels in zone in interval are according to formula F
X ', Y '=mod (X ', 3)+3*mod (Y ', 3)+1 is that each bunch distributes physical channel, wherein F
(X ', Y ')The physical channel numbers that expression distributes; And will be placed on the transmission of control information on the independent channel.
7. the method for claim 1; It is characterized in that said step S5 is after the maintenance that gets into bunch, leader cluster node will periodically be collected bunch an interior nodes positional information and a velocity information; And between bunch head, broadcast, make each leader cluster node that the positional information and the velocity information of the whole network node all arranged; Under the unified control of leader cluster node, the function of data forwarding between all ordinary nodes all have bunch.
8. the method for claim 1 is characterized in that, the process of bunch head maintenance is among the said step S5: leader cluster node is at first calculated self positional information and velocity information with respect to the virtual network Centroid; If through calculating bunch number with last one constantly bunch number different, then leader cluster node directly changes new node into, application networking again; If identical, then estimate bunch head bunch in life span, a bunch head is left this incident of bunch zone carries out early warning; When leader cluster node find self bunch in life span during less than a certain thresholding, just trigger a new bunch of generating routine, then accomplish the transition of new and old bunch of head.
9. the method for claim 1; It is characterized in that; The maintenance process of ordinary node is among the said step S5: leader cluster node periodically bunch in one jump the broadcasting handshaking information, ordinary node is if lose a bunch handshaking information of some continuously, then thinks to lose with a bunch head and gets in touch; Thereby become a new node, application networks again.
10. the method for claim 1 is characterized in that, the process that new node adds among the said step S5 is: leader cluster node will with the communication delay sum of each bunch interior nodes as this bunch bunch in the integrated load coefficient; When new node networked, then acquiescence was clustered into the stage and is accomplished, the maintenance phase that network is in bunch; This locality that new node calculating earlier oneself belongs to bunch number also jumping broadcasting transmission adding bunch application; The leader cluster node that all receive this application, return one contain oneself bunch in the adding of integrated load coefficient bunch reply; After new node was waited for certain hour, if having from local bunch reply, and this bunch integrated load coefficient then added local bunch less than a certain threshold value; Otherwise in all were replied, the integrated load coefficient is minimum in selecting bunch bunch sent to add and bunch confirms, and adds this bunch; If no response then resends adding bunch application; Repeat send to add after bunch certain number of times of application, still no response, the generation phase that then gets into bunch, each node foundation and the relative position of virtual network Centroid confirm self place bunch, and produce leader cluster node and ordinary node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011103912157A CN102497615A (en) | 2011-11-30 | 2011-11-30 | Location-information-based clustering method for node mobile network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011103912157A CN102497615A (en) | 2011-11-30 | 2011-11-30 | Location-information-based clustering method for node mobile network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102497615A true CN102497615A (en) | 2012-06-13 |
Family
ID=46189396
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011103912157A Pending CN102497615A (en) | 2011-11-30 | 2011-11-30 | Location-information-based clustering method for node mobile network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102497615A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103987015A (en) * | 2014-05-22 | 2014-08-13 | 东南大学 | Generalized mobility management method in ubiquitous network group mobile context |
| CN104811328A (en) * | 2014-01-27 | 2015-07-29 | 杭州华三通信技术有限公司 | Virtual network resource management method and device |
| CN104838597A (en) * | 2012-12-13 | 2015-08-12 | 高通股份有限公司 | Adaptive channel reuse mechanism in communication networks |
| CN106332211A (en) * | 2016-08-18 | 2017-01-11 | 北京邮电大学 | Routing selection method and device |
| CN109041158A (en) * | 2018-06-30 | 2018-12-18 | 沈阳师范大学 | A kind of the wireless sensor neural network intelligent control method and system of the hierarchical routing based on data aggregate |
| CN111491359A (en) * | 2020-03-23 | 2020-08-04 | 北京诚一科技有限公司 | Dynamic networking method, node and storage medium for wireless self-organizing network |
| CN112887947B (en) * | 2021-01-14 | 2021-12-03 | 南通大学 | Bluetooth Mesh clustering networking method for double-layer block chain |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1675321A1 (en) * | 2004-12-21 | 2006-06-28 | NTT DoCoMo INC. | Controller apparatus, mobile terminal, and communication control method |
| CN101291284A (en) * | 2008-05-23 | 2008-10-22 | 西安交通大学 | Local topology perception method for heterogeneous AdHoc network |
| CN101656624A (en) * | 2008-08-18 | 2010-02-24 | 中兴通讯股份有限公司 | Multi-node application-level disaster recovery system and multi-node application-level disaster recovery method |
| CN101917750A (en) * | 2010-07-30 | 2010-12-15 | 南京工业大学 | Least effort delivering zone-spanned virtual cluster multi-hop routing method |
-
2011
- 2011-11-30 CN CN2011103912157A patent/CN102497615A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1675321A1 (en) * | 2004-12-21 | 2006-06-28 | NTT DoCoMo INC. | Controller apparatus, mobile terminal, and communication control method |
| CN101291284A (en) * | 2008-05-23 | 2008-10-22 | 西安交通大学 | Local topology perception method for heterogeneous AdHoc network |
| CN101656624A (en) * | 2008-08-18 | 2010-02-24 | 中兴通讯股份有限公司 | Multi-node application-level disaster recovery system and multi-node application-level disaster recovery method |
| CN101917750A (en) * | 2010-07-30 | 2010-12-15 | 南京工业大学 | Least effort delivering zone-spanned virtual cluster multi-hop routing method |
Non-Patent Citations (2)
| Title |
|---|
| 《数字通信世界》 20110815 马正新 "大区域宽带自组织网络中定位信息的作用(上)、(下)" , * |
| 马正新: ""大区域宽带自组织网络中定位信息的作用(上)、(下)"", 《数字通信世界》 * |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104838597A (en) * | 2012-12-13 | 2015-08-12 | 高通股份有限公司 | Adaptive channel reuse mechanism in communication networks |
| CN104838597B (en) * | 2012-12-13 | 2017-11-07 | 高通股份有限公司 | Adaptive channel reuse mechanism in communication network |
| CN104811328A (en) * | 2014-01-27 | 2015-07-29 | 杭州华三通信技术有限公司 | Virtual network resource management method and device |
| WO2015110083A1 (en) * | 2014-01-27 | 2015-07-30 | Hangzhou H3C Technologies Co., Ltd. | Virtual network resource management |
| CN103987015A (en) * | 2014-05-22 | 2014-08-13 | 东南大学 | Generalized mobility management method in ubiquitous network group mobile context |
| CN106332211A (en) * | 2016-08-18 | 2017-01-11 | 北京邮电大学 | Routing selection method and device |
| CN106332211B (en) * | 2016-08-18 | 2019-08-13 | 北京邮电大学 | A kind of method and device of selection routing |
| CN109041158A (en) * | 2018-06-30 | 2018-12-18 | 沈阳师范大学 | A kind of the wireless sensor neural network intelligent control method and system of the hierarchical routing based on data aggregate |
| CN111491359A (en) * | 2020-03-23 | 2020-08-04 | 北京诚一科技有限公司 | Dynamic networking method, node and storage medium for wireless self-organizing network |
| CN112887947B (en) * | 2021-01-14 | 2021-12-03 | 南通大学 | Bluetooth Mesh clustering networking method for double-layer block chain |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102497615A (en) | Location-information-based clustering method for node mobile network | |
| Arafat et al. | A survey on cluster-based routing protocols for unmanned aerial vehicle networks | |
| CN107949047B (en) | Wireless sensor network consistency time synchronization method for reducing network communication traffic | |
| CN100379183C (en) | Inter-synchronuos method for mobile wireless self-organized network | |
| TW200408232A (en) | Intelligent communication node object beacon framework(ICBF) with temporal transition network protocol (TTNP) in a mobile AD hoc network | |
| Yuan et al. | Dynamic controller assignment in software defined internet of vehicles through multi-agent deep reinforcement learning | |
| CN113260012B (en) | Unmanned aerial vehicle cluster topology control method based on position track prediction | |
| Chandrashekar et al. | Providing full connectivity in large ad-hoc networks by dynamic placement of aerial platforms | |
| CN104202772A (en) | Mobile Sink data collection method applied to wireless sensor network and used for node internal-memory resource sharing | |
| CN103259744A (en) | Method for mapping mobile virtual network based on clustering | |
| Liu et al. | Sweep coverage with return time constraint | |
| Zhu et al. | A high-available and location predictive data gathering scheme with mobile sinks for wireless sensor networks | |
| Lu et al. | Relay in the sky: A UAV-aided cooperative data dissemination scheduling strategy in VANETs | |
| Mai et al. | Load balanced rendezvous data collection in wireless sensor networks | |
| CN102291743A (en) | Clustering method based on geographic position information | |
| CN110995601B (en) | Software-defined space-based backbone network topology construction method | |
| CN112672398A (en) | 3D-GPSR routing method based on self-adaptive kalman prediction | |
| Chouikhi et al. | Routing-based multi-channel allocation with fault recovery for wireless sensor networks | |
| Harchi et al. | WSN dynamic clustering for oil slicks monitoring | |
| Liu et al. | A Position Sensitive Clustering Algorithm for VANET. | |
| Gautam et al. | Data dissemination in wireless sensor networks: A state-of-the art survey | |
| Rana et al. | Consensus time synchronization with clustering in wireless sensor networks | |
| Li et al. | A New Distributed CDS Algorithm of Ad Hoc Network Based on Weight | |
| Anuradha et al. | Reliable and energy efficient cluster-based architecture for underwater wireless sensor networks | |
| Rho et al. | Group mobility model based on mobility prediction in tactical network on-the-move |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20120613 |