CN106034301A - Node-characteristic-based clustering method in ad-hoc network - Google Patents
Node-characteristic-based clustering method in ad-hoc network Download PDFInfo
- Publication number
- CN106034301A CN106034301A CN201510112713.1A CN201510112713A CN106034301A CN 106034301 A CN106034301 A CN 106034301A CN 201510112713 A CN201510112713 A CN 201510112713A CN 106034301 A CN106034301 A CN 106034301A
- Authority
- CN
- China
- Prior art keywords
- bunch
- node
- head
- information
- target
- 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.)
- Withdrawn
Links
Landscapes
- Information Transfer Between Computers (AREA)
Abstract
The invention discloses a node-characteristic-based clustering method in an ad-hoc network, comprising steps of dividing default clusters and distributing cluster ID and appointing cluster heads based on cluster identity characteristics and distributing intra-cluster IDs on the basis of node identity characteristics and node priority. Each cluster occupies a public control area to broadcast the cluster information and monitors information of the adjacent cluster; the intra-node of each cluster occupies an intra-cluster control area to broadcast the node information and monitors information of the adjacent node; the node enters an isolation state after leaving the cluster; and the node in the isolation state obtains cluster information around, chooses a target cluster and accesses through monitoring the cluster broadcast or the node broadcast.
Description
Technical field
The present invention relates to self-organizing network, particularly relate to the sub-clustering side of identity-based feature in a kind of MANET
Method.
Background technology
Ad Hoc network generally use cluster-dividing method to realize hierarchy, to support the extensibility of network
Ensure with QoS.At present, cluster algorithm mainly includes without a head bunch and has the big class of head bunch two.
Due to without a head bunch in node motion scene the expense of cluster management too big, mobile Ad Hoc network is blueer or green
Look in the hierarchy having head bunch.Such as link cluster algorithm (Link cluster based on node ID
Algorithm, LCA) realize simply, but bunch head is too many；Cluster algorithm bunch number based on node degree is less,
But when node mobility is stronger, bunch head updates frequently, and clustering architecture changes the most greatly；Based on ambulant point
Bunch algorithm requires to calculate the translational speed of neighbours, and computation complexity is bigger；And consider bunch stability and joint
The cluster algorithm of some energy consumption is more suitable for static network.These network scenarios interior joint are a jumping of bunch head simultaneously
Node, is not suitable for multihop network.
That supports multi-hop has head bunch, such as the cluster structured position seat needing to transmit node based on geographical position
Mark, expense is the biggest；Minimax jumps cluster algorithm by measuring node density, quantity, motor pattern and industry
The size that business demand dynamically adjusts bunch.This cluster algorithm do not account for yet service attribute between node and
Place tissue restricting relation, it is impossible to meet the mobile Ad Hoc network with node traffic feature to communication
Demand.
The selection of cluster algorithm depends on the demand of reality, network environment and node diagnostic.When network node it
Between when there is the sense of organization, hierarchical relationship, mobility and security requirements, without a head bunch presently, there are, one
Jumping bunch and multi-hop bunch are all not applied for this kind of network having strict organizational structure relation.
Summary of the invention
The present invention proposes cluster-dividing method based on node identities feature in a kind of MANET, including:
Divide acquiescence bunch, distribution bunch ID based on node identities feature and specify bunch head；
Node priority and bunch priority is determined based on node identities feature；
Based on ID in node identities feature and node priority distribution bunch；
Each bunch takies public control zone and broadcasts this bunch of information and intercept adjacent bunch information；In each bunch of interior nodes takies bunch
Control zone is broadcasted this nodal information and intercepts neighborhood information；
Enter isolated state after de-bunch of described node, be in the node of isolated state by intercepting bunch broadcast or joint
Bunch information that some broadcast obtains around selects target bunch and accesses.
Preferably, when bunch head disappears or Cu Toupai unit goes out bunch, described node is temporarily in isolated state,
The described node being temporarily in isolated state produces new bunch of head according to a bunch head strategy, and described new bunch is referred to as former bunch
Division bunch, has bunch ID identical with former bunch.
Wherein, the process producing new bunch of head includes: the described node being temporarily in isolated state continues to send joint
Point broadcast also intercepts neighbors, compares the most neighbour node of this node and more meets described bunch head strategy: if
Then in subsequent node is broadcasted, identity is a bunch head；If not then identifying in subsequent node broadcast
Identity is member.
Further, stopping a bunch broadcast after bunch head disappears, new bunch of head sends new bunch of broadcast after producing, described
New bunch of broadcast carry a bunch ID, new bunch of head bunch in ID.
Preferably, division bunch other divisions bunch with former bunch or former bunch carry out, from merging, specifically including when meeting:
If member node receives and more meets bunch head of described bunch head strategy than bunch head of self maintained and disappear in described bunch
Breath, then carry node ID, and bunch head message received described in forwarding in node broadcasts；Described bunch of head
If node receives bunch head message more meeting described bunch head strategy than self, then deletion bunch in node broadcasts
Leader is known, is carried node ID, and bunch head message received described in forwarding.
Additionally, bunch with bunch can mutually merge, including: after a bunch interior nodes finds other adjacent bunch, by random
Competition application accesses described neighbour bunch；Or, its adjacent bunch information is transmitted to this bunch of leader cluster node by bunch interior nodes,
Described leader cluster node is broadcasted to target bunch pooling information in this bunch, and described bunch of interior nodes random competition accesses institute
State target bunch；Or, its adjacent bunch information is transmitted to this bunch of leader cluster node, described leader cluster node by bunch interior nodes
Information reconciliation is carried out: if described target bunch can receive this bunch of all member, then described with target bunch bunch head
Leader cluster node is broadcasted to target bunch pooling information in this bunch, and described bunch of interior nodes random competition accesses described mesh
Mark bunch；If described target bunch can receive this bunch of few members, then a described bunch head randomly chooses corresponding number
Bunch member, and broadcast in target bunch pooling information, add described selected nodal information；Described selected
Bunch member node random competition access described target bunch；If described target bunch can not receive any new one-tenth
Member, then described bunch remains unchanged.
Described node accesses the process of target bunch and includes: described node sends access request；Leader cluster node receives
Described access request, determines whether to agree to access according to bunch access constraints, replys access and respond；In bunch
The node access request to receiving and access response forward；Described node receives described access and responds.
Wherein, access response to include: normally access, pattern of intercepting accesses or refusal accesses；Described node is received
After described normal access response, carry out the broadcast of this nodal information；Described node is intercepted pattern and is connect described in receiving
After entering response, keep intercepting this bunch of information, this bunch of broadcast message can be forwarded, but can not actively initiate business
Transmission.
Wherein constraints includes: bunch size, bunch jumping figure, bunch translational speed, node black-white-gray list.
When the access request that described bunch of interior nodes receives is multiple, described bunch of interior nodes is according to initiating access request
Node priority judge transfer sequence.
When described target bunch is the division bunch of acquiescence bunch or acquiescence bunch, described node sends in acquiescence on-position
Described access request；When described target bunch is non-default bunch, described node sends described in reserved on-position
Access request.
When described target bunch is saturated, if described node has high priority, then described bunch head to bunch in excellent
The node that first level is minimum is forced de-bunch and discharges ID in its bunch, then ID in described bunch is distributed to described height
Priority node.
Described bunch of information also includes allowing to access mark, and low priority node allows access mark to sentence according to described
Whether disconnected to target bunch initiation access request, priority node is without judging directly to initiate to access to target bunch
Request.
The present invention considers node identities feature, under the conditions of not concept transfer planning framework, it is achieved that safety
The communication of two-forty.
Detailed description of the invention
For making the purpose of the embodiment of the present invention, technical scheme and advantage clearer, below the present invention is implemented
Technical scheme in example is clearly and completely described, it is clear that described embodiment is the present invention one
Divide embodiment rather than whole embodiments；It should be noted that in the case of not conflicting, the application
In embodiment and feature in embodiment can be mutually combined.Based on the embodiment in the present invention, this area
The every other embodiment that those of ordinary skill is obtained under not making creative work premise, broadly falls into
The scope of protection of the invention.
The present invention proposes cluster-dividing method based on node identities feature in a kind of MANET, it is adaptable to have strict
The self-organizing network that the node of organizational structure relation is constituted, such as army, school, between business enterprice sector etc.,
Including:
The present invention proposes cluster-dividing method based on node identities feature in a kind of MANET, including:
Divide acquiescence bunch, distribution bunch ID based on node identities feature and specify bunch head；
Node priority and bunch priority is determined based on node identities feature；
Based on ID in node identities feature and node priority distribution bunch；
Each bunch takies public control zone and broadcasts this bunch of information and intercept adjacent bunch information；In each bunch of interior nodes takies bunch
Control zone is broadcasted this nodal information and intercepts neighborhood information；
Enter isolated state after de-bunch of described node, be in the node of isolated state by intercepting bunch broadcast or joint
Bunch information that some broadcast obtains around selects target bunch and accesses.
Preferably, when bunch head disappears or Cu Toupai unit goes out bunch, described node is temporarily in isolated state,
The described node being temporarily in isolated state produces new bunch of head according to a bunch head strategy, and described new bunch is referred to as former bunch
Division bunch, has bunch ID identical with former bunch.
Wherein, the process producing new bunch of head includes: the described node being temporarily in isolated state continues to send joint
Point broadcast also intercepts neighbors, compares the most neighbour node of this node and more meets described bunch head strategy: if
Then in subsequent node is broadcasted, identity is a bunch head；If not then identifying in subsequent node broadcast
Identity is member.
Further, stopping a bunch broadcast after bunch head disappears, new bunch of head sends new bunch of broadcast after producing, described
New bunch of broadcast carry a bunch ID, new bunch of head bunch in ID.
Preferably, division bunch other divisions bunch with former bunch or former bunch carry out, from merging, specifically including when meeting:
If member node receives and more meets bunch head of described bunch head strategy than bunch head of self maintained and disappear in described bunch
Breath, then carry node ID, and bunch head message received described in forwarding in node broadcasts；Described bunch of head
If node receives bunch head message more meeting described bunch head strategy than self, then deletion bunch in node broadcasts
Leader is known, is carried node ID, and bunch head message received described in forwarding.
Additionally, bunch with bunch can mutually merge, including: after a bunch interior nodes finds other adjacent bunch, by random
Competition application accesses described neighbour bunch；Or, its adjacent bunch information is transmitted to this bunch of leader cluster node by bunch interior nodes,
Described leader cluster node is broadcasted to target bunch pooling information in this bunch, and described bunch of interior nodes random competition accesses institute
State target bunch；Or, its adjacent bunch information is transmitted to this bunch of leader cluster node, described leader cluster node by bunch interior nodes
Information reconciliation is carried out: if described target bunch can receive this bunch of all member, then described with target bunch bunch head
Leader cluster node is broadcasted to target bunch pooling information in this bunch, and described bunch of interior nodes random competition accesses described mesh
Mark bunch；If described target bunch can receive this bunch of few members, then a described bunch head randomly chooses corresponding number
Bunch member, and broadcast in target bunch pooling information, add described selected nodal information；Described selected
Bunch member node random competition access described target bunch；If described target bunch can not receive any new one-tenth
Member, then described bunch remains unchanged.
Described node accesses the process of target bunch and includes: described node sends access request；Leader cluster node receives
Described access request, determines whether to agree to access according to bunch access constraints, replys access and respond；In bunch
The node access request to receiving and access response forward；Described node receives described access and responds.
Wherein, access response to include: normally access, pattern of intercepting accesses or refusal accesses；Described node is received
After described normal access response, carry out the broadcast of this nodal information；Described node is intercepted pattern and is connect described in receiving
After entering response, keep intercepting this bunch of information, this bunch of broadcast message can be forwarded, but can not actively initiate business
Transmission.
Wherein constraints includes: bunch size, bunch jumping figure, bunch translational speed, node black-white-gray list.
When the access request that described bunch of interior nodes receives is multiple, described bunch of interior nodes is according to initiating access request
Node priority judge transfer sequence.
When described target bunch is the division bunch of acquiescence bunch or acquiescence bunch, described node sends in acquiescence on-position
Described access request；When described target bunch is non-default bunch, described node sends described in reserved on-position
Access request.
When described target bunch is saturated, if described node has high priority, then described bunch head to bunch in excellent
The node that first level is minimum is forced de-bunch and discharges ID in its bunch, then ID in described bunch is distributed to described height
Priority node.
Described bunch of information also includes allowing to access mark, and low priority node allows access mark to sentence according to described
Whether disconnected to target bunch initiation access request, priority node is without judging directly to initiate to access to target bunch
Request.
The present invention considers node identities feature, under the conditions of not concept transfer planning framework, it is achieved that safety
The communication of two-forty.
Embodiment 1: cluster initialization
As a example by army, network node includes company commander, platoon leader, squad leader, soldier, it is assumed that bunch number is 16.
Distribution bunch ID: carrying out sub-clustering in units of class, each bunch has unique bunch of ID (0-15), between bunch
For sane level；Bunch ID distribution meets interclass establishment relation, and by known to the whole network, such as
0000,0001,0010 be platoon leader 1 time directly under three bunches, 0011,0100,0101 is straight for 2 times institutes of platoon leader
Three bunches belonged to.
ID in distribution bunch: acquiescence squad leader is a bunch head, ID minimum 0 in bunch, and class member is a bunch member,
In bunch, ID arranges successively according to 1,2,3,4；Company commander and platoon leader can add any bunch according to action demand, by
Bunch head is ID in its distribution bunch；
Bunch head strategy: according to bunch in ID value select bunch head, node minimum for ID in bunch be a bunch head, and other save
Point for bunch member, if bunch out of touch, then bunch in member id value minimum node automatically become new bunch of head,
The like.
Node priority: company commander > platoon leader > squad leader > soldier.
Bunch priority includes:
Acquiescence bunch priority is higher than non-default bunch；
Belong under same row bunch higher than be not belonging under same row bunch；
Receive power high bunch higher than receive power low bunch.
Enter isolated state after de-bunch of described node, be in the node of isolated state by intercepting bunch broadcast or joint
Bunch information that some broadcast obtains around selects target bunch and accesses.
Embodiment 2: bunch division
In the case of former bunch of head disappears or unit sends, a bunch fission process can be started, now lost a bunch head
Node can select to produce new bunch head, when forming new bunch according to based on bunch head strategy of ID in node cluster
After Tou, then support that node selects new bunch of addition.
Node passes through neighbor node broadcast message, confirms ID in the tuftlet that can communicate, this ID in tuftlet
It is new bunch head, in snoop procedure, closes bunch broadcast capability.Specific as follows:
1, node corresponding to bunch in the node broadcasts subframe sending node broadcast message of ID, while listening for it
His subframe, safeguards this node neighbor list；
2, neighbor uni-cast window terminates, compare neighbor list interior joint bunch in ID with oneself bunch in ID
If a) oneself bunch in ID value minimum, carry in the node broadcasts message that next superframe is corresponding
<bunch head>identifies；
If b) oneself bunch in ID value the most minimum, continue sending node broadcast message, identity be <
Member >；
3, after bunch capitiform becomes,
A) bunch head broadcasts bunch information in public control zone, carries<bunch ID, bunch head ID>；
B) node receives leader cluster node information, updates neighbor list, and carries < node in node broadcasts
ID>；
C), after bunch head receives the node ID that node reports, node ID is stored in corresponding grey black white list,
Meanwhile, have the right to reject illegal node；
D) a bunch head still finds in this bunch, if the node that in discovery bunch, ID value is less, then carries out a bunch conjunction
And.
Embodiment 3: bunch merging
1, division bunch bunch is met with former bunch or other divisions with former bunch, then carry out oneself and merge, specific as follows:
Node receives node broadcasts message, updates neighbor list；
For member node: receive a bunch head message, then compare in bunch head bunch oneself safeguarded ID and receive
ID in bunch head bunch: if ID is less in the original bunch head bunch safeguarded, the most only update neighbor list；If received
In the new bunch of head bunch arrived, ID is less, then update bunch header oneself safeguarded, takes in node broadcasts simultaneously
Node ID with oneself；
For leader cluster node: receive another bunch of header, compare oneself bunch in ID and bunch head received
ID in bunch；If oneself bunch in ID value less, then during node broadcasts, still carry oneself identity
Mark<bunch head>；If ID is less in bunch head bunch received, then in node broadcasts message, delete oneself
Identity, carries node ID, and forwards this bunch of header；
2, bunch can also merge between non-former bunch, available means is as follows:
Scheme one: bunch interior nodes finds that adjacent bunch exists, and random competition application accesses this bunch according to demand；
Scheme two: neighbour bunch information is transmitted to a bunch head by bunch interior nodes, by leader cluster node this bunch of broadcast " to mesh
Mark bunch pooling information ", node random competition accesses this target bunch；
Scheme three:
Neighbour bunch information is transmitted to a bunch head by node, and leader cluster node consults bunch pooling information with adjacent bunch of leader cluster node,
Including: division bunch attribute, divides cluster node attribute, adjacent bunch admissible newcomer's number etc..
If adjacent bunch can be received all of bunch member completely, then this bunch bunch head bunch in broadcast " to target
Bunch pooling information ", each node random competition accesses this target bunch；
If adjacent bunch can not be received all of bunch member completely, then this bunch bunch head randomly chooses corresponding number
Bunch member adds this bunch, and broadcast " merges " information to target bunch when, adds this nodal information.
If adjacent bunch can not be received any newcomer, then this bunch is remained stationary state.
Embodiment 4: node access bunch
One, constraints is accessed: only consider bunch size constraint and bunch black-white-gray list constraint, be described as follows:
1, bunch size: ID value in being presented as maximum bunch；
2, grey black white list: by a bunch head maintenance, grey black white list is not shared with adjacent bunch.In bunch maintenance process,
Gray list and blacklist are manually arranged by a bunch head.
1) blacklist: store illegal node ID, illegal node is manually pulled into blacklist by bunch head.
Drawn black node bunch in, bunch head initiates to force de-bunch of instruction to this node, carries de-bunch cause value and is
Blacklist node, is drawn black node to receive this instruction, triggers node and enters lock machine state；Drawn black node not
Bunch in, when node initiates access request to this bunch again when, bunch head refuses its access request automatically,
And to carry Reason For Denial value be blacklist node, drawn black node to receive this instruction, trigger node and enter lock machine
State；
Bunch head can also by the broadcast of blacklist nodal information to bunch in all nodes, a bunch interior nodes receives and safeguards
Blacklist, when blacklist node initiates access request when, is directly fed back refusal and accesses sound by bunch interior nodes
Should.
2) gray list: storage is identified as half legal node ID, and node is once arranged to gray list,
Can be its transfer of names list by a bunch head manual operation, transfer white list or blacklist to.
If the de-bunch time overtime window T of certain node, then bunch head is manually drawn in gray list；
When bunch saturated, priority node application adds this bunch, then bunch hand-operated forced require that priority is
De-bunch of low node, is drawn in gray list, discharges ID in its bunch, and ID in this bunch is distributed to Gao You
First level node；
3) white list: storage is identified as legal node ID, including 1) get rid of blacklist, gray list
Outside node ID；2) execution task is assigned away and the node ID of de-bunch by bunch head；White list node
Bunch access procedure is automatically performed.
Two, bunch information search
After de-bunch of node, start a bunch search, monitor and resolve bunch broadcast of CCCH, note
Bunch ID of record uppick, accesses flag bit, accesses jumping figure, receives the information such as energy.Timer terminates,
Judge bunch information record case, if adjacent bunch number is 0, then start again at a bunch search after waiting for a period of time.
Search bunch in without target bunch to be accessed, the most again initiate bunch search procedure；If it has,
Then enter access procedure.
Three, bunch access: node accesses and is divided into former cluster node to access and new node two kinds of scenes of access.Former cluster knot
Point accesses the access channel of the acquiescence distributed during taking cluster initialization for node；New node access take into
New node accesses reserved access channel.
1, former cluster node accesses: bunch member of acquiescence when former cluster node is to initialize.Comprise the steps:
A) node is accessing channel transmission access request, and content includes that node identities identifies, and accesses channel and accounts for
With acquiescence bunch in corresponding for ID node broadcasts position；
Bunch b) in, all nodes all can monitor access channel, if receiving access request, then at this node
Node broadcasts message next time carries this access request；
If receiving multiple access request before upper once node broadcasts, then according to the joint initiating access request
Point priority judges transfer sequence, is described as follows: company commander > directly under platoon leader > platoon leader > squad leader > soldier；
In receiving time window, same access request only forwards once；
C) leader cluster node receives access request, query node list in node broadcasts district, it may be judged whether with
Meaning node accesses, and carries access response in upper once node broadcasts message；
I) node is at blacklist, and bunch head is automatically refused it and accessed, and carries refusal access and refer in accessing response
Show；
Ii) node is at gray list, and whether leader cluster node manual operation agrees to that it accesses, and in node broadcasts
Message is carried normal access/refusal and accesses/intercept pattern access instruction；
Iii) node is at white list, and leader cluster node agrees to that it accesses automatically, and takes in node broadcasts message
Band is agreed to access instruction；
Bunch d) in, all nodes forward this access to respond in node broadcasts district；Same receiving in time window
Bar access request only forwards once；
E) node receives and accesses response:
Blacklist node and be denied access, node enter lock machine state, it is impossible to transmit/receive any information of eating dishes without rice or wine；
Gray list normally accesses, node take acquiescence bunch in resource broadcast nodal information, complete access procedure；
Gray list is intercepted pattern and is accessed, then node is only intercepted, but can not initiate the transmission of any business, permissible
Forward the part or all of broadcast message of this bunch, it is also possible to be arranged to forward broadcast；
Gray list refusal accesses, and node restarts a bunch search；
White list allow access, node take acquiescence bunch in resource broadcast nodal information, complete access procedure；
2, new node accesses: new node is other nodes being not belonging to former cluster node in network, and node accesses
Priority is defined as company commander > directly under platoon leader > platoon leader > squad leader > soldier；
A) node analytic varieties broadcast:
Judge to access directly under the node below platoon leader's priority and allow flag bit, it is allowed to access, then connect reserved
Enter channel position and send access request；Do not allow to access and the most do not initiate access request to this bunch；Directly under platoon leader and
Above priority node allows flag bit without judging to access, and directly sends at reserved access channel position and connects
Enter request；
Bunch b) in, all nodes all can monitor access channel, if receiving access request, then at this node
Node broadcasts message next time carries this access request；As this step accesses with former cluster node.
C) leader cluster node receives access request in node broadcasts district, according to the access procedure of gray list, main
See whether operation agrees to that it accesses, and in node broadcasts message, carry access respond, including normally accessing/
Refusal accesses/intercepts pattern and accesses instruction；If agreeing to access, then for ID in the distribution bunch of this node, arrange
Black-white-gray list；
If ID in the most available free bunch, i.e. bunch the most saturated, bunch head is that it distributes ID in random free cluster；
Without ID in idle bunch, de-bunch of bunch rigidity of the nape lowest priority node, send and force to take off bunch
Instruction message, and by release bunch in ID distribute to this priority node；
In bunch, all nodes receive de-bunch of instruction of pressure, forward this de-bunch of instruction in node broadcasts district；Treat de-bunch
Node receives de-bunch of instruction, discharges ID in this bunch, and selects other bunches to access；
Bunch d) in, all nodes forward new node to access response in node broadcasts district；
E) new node receive access response, according to distribution bunch in ID take correspondence node broadcasts subframe,
Broadcast this nodal information, complete access procedure.
One of ordinary skill in the art will appreciate that: all or part of step realizing said method embodiment can
Completing with the hardware relevant by programmed instruction, aforesaid program can be stored in an embodied on computer readable and deposit
In storage media, this program upon execution, performs to include the step of said method embodiment；And aforesaid storage
Medium includes: the various media that can store program code such as ROM, RAM, magnetic disc or CD.
Last it is noted that above example is only in order to illustrate technical scheme, rather than it is limited
System；Although the present invention being described in detail with reference to previous embodiment, those of ordinary skill in the art
It is understood that the technical scheme described in foregoing embodiments still can be modified by it, or to it
Middle part technical characteristic carries out equivalent；And these amendments or replacement, do not make appropriate technical solution
Essence departs from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (13)
1. a cluster-dividing method based on node identities feature in MANET, including:
Divide acquiescence bunch, distribution bunch ID based on node identities feature and specify bunch head；Special based on node identities
Levy and determine node priority and bunch priority；Based on ID in node identities feature and node priority distribution bunch；
Each bunch takies public control zone and broadcasts this bunch of information and intercept adjacent bunch information；In each bunch of interior nodes takies bunch
Control zone is broadcasted this nodal information and intercepts neighborhood information；
Enter isolated state after de-bunch of described node, be in the node of isolated state by intercepting bunch broadcast or joint
Bunch information that some broadcast obtains around selects target bunch and accesses.
Method the most according to claim 1, it is characterised in that also include: when bunch head disappear or bunch
When Tou Pai unit goes out bunch, described node is temporarily in isolated state, the described node being temporarily in isolated state
Producing new bunch of head according to a bunch head strategy, the division bunch of described new bunch referred to as former bunch, bunch ID is identical with former bunch.
Method the most according to claim 2, it is characterised in that the process bag of new bunch of head of described generation
Include: the described node being temporarily in isolated state continues sending node broadcasts and intercepts neighbors, compares this section
The most neighbour node of point more meets described bunch head strategy: if it is in subsequent node is broadcasted, identity is
Bunch head；If not then in subsequent node broadcast identity be member.
Method the most according to claim 2, it is characterised in that also include: described bunch disappears at a bunch head
Stopping a bunch broadcast after mistake, new bunch of head sends new bunch of broadcast after producing, and a bunch ID, newly is carried in described new bunch of broadcast
Bunch head bunch in ID.
Method the most according to claim 2, it is characterised in that described division bunch and former bunch or former bunch
Other divisions carry out, from merging, specifically including when bunch meeting:
If in described bunch member node receive than bunch head of self maintained more meet described bunch head strategy bunch
Head message, then carry node ID, and bunch head message received described in forwarding in node broadcasts；
If described leader cluster node receives bunch head message more meeting described bunch head strategy than self, then at node
Broadcast is deleted bunch leader know, carry node ID, and bunch head message received described in forwarding.
Method the most according to claim 1, it is characterised in that also include described bunch with bunch can phase
Merging mutually, described merging process includes:
After bunch interior nodes finds other adjacent bunch, access described neighbour bunch by random competition application；Or,
Its adjacent bunch information is transmitted to this bunch of leader cluster node by bunch interior nodes, and described leader cluster node is broadcasted in this bunch
To target bunch pooling information, described bunch of interior nodes random competition accesses described target bunch；Or,
Its adjacent bunch information is transmitted to this bunch of leader cluster node, described leader cluster node and target bunch bunch head by bunch interior nodes
Carrying out information reconciliation: if described target bunch can receive this bunch of all member, the most described leader cluster node is at this
Broadcasting to target bunch pooling information in bunch, described bunch of interior nodes random competition accesses described target bunch；If institute
State target bunch and can receive this bunch of few members, then described bunch head randomly chooses bunch member of corresponding number, and
In target bunch pooling information, described selected nodal information is added in broadcast；Described selected bunch member node
Random competition accesses described target bunch；If described target bunch can not receive any newcomer, then described bunch of dimension
Hold constant.
7. according to the method described in claim 1～6 any one, it is characterised in that described node accesses
The process of target bunch includes:
Described node sends access request；
Leader cluster node receives described access request, determines whether to agree to access according to bunch access constraints, returns
Multiple connection enters response；
Bunch interior nodes access request to receiving and access response and forward；
Described node receives described access and responds.
Method the most according to claim 7, it is characterised in that described access response includes: normal
Access, pattern of intercepting accesses or refusal accesses；After described node receives described normal access response, carry out this
Nodal information is broadcasted；Described node receive described in intercept pattern access response after, keep intercept this bunch of information,
This bunch of broadcast message can be forwarded, but can not actively initiate business transmission.
Method the most according to claim 7, it is characterised in that the access that described bunch of interior nodes receives
Request is for time multiple, and described bunch of interior nodes judges transfer sequence according to the node priority initiating access request.
Method the most according to claim 7, it is characterised in that described constraints includes: bunch big
Little, bunch jumping figure, bunch translational speed, node black-white-gray list.
11. methods according to claim 7, it is characterised in that also include: described target bunch is silent
Recognizing bunch or during the division bunch of acquiescence bunch, described node sends described access request in acquiescence on-position；Described
When target bunch is non-default bunch, described node sends described access request in reserved on-position.
12. methods according to claim 7, it is characterised in that also include: when described target bunch is satisfied
And time, if described node has high priority, then described bunch head to bunch in the minimum node of priority force
De-bunch and discharge ID in its bunch, then ID in described bunch is distributed to described priority node.
13. methods according to claim 7, it is characterised in that described bunch of information also includes allowing to connect
Inlet identity, low priority node accesses mark according to described permission and judges whether to initiate to access to target bunch to ask
Asking, priority node is without judging directly to initiate access request to target bunch.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510112713.1A CN106034301A (en) | 2015-03-14 | 2015-03-14 | Node-characteristic-based clustering method in ad-hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510112713.1A CN106034301A (en) | 2015-03-14 | 2015-03-14 | Node-characteristic-based clustering method in ad-hoc network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106034301A true CN106034301A (en) | 2016-10-19 |
Family
ID=57150041
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510112713.1A Withdrawn CN106034301A (en) | 2015-03-14 | 2015-03-14 | Node-characteristic-based clustering method in ad-hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106034301A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108834195A (en) * | 2018-06-19 | 2018-11-16 | 中国联合网络通信集团有限公司 | Cluster merging method and its module and microcontroller in clustered network structure |
| CN108934027A (en) * | 2018-07-04 | 2018-12-04 | 南京邮电大学 | A kind of MIMO multi-cell base station can caching system cluster-dividing method |
| CN110490266A (en) * | 2019-08-23 | 2019-11-22 | 北京邮电大学 | A kind of sensing data uploads, Transducer-fault Detecting Method and device |
| CN111093249A (en) * | 2019-12-05 | 2020-05-01 | 合肥中感微电子有限公司 | Wireless local area network communication method, system and wireless transceiving equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101925066A (en) * | 2010-03-05 | 2010-12-22 | 北京北大众志微系统科技有限责任公司 | Multi-channel wireless mesh network system and channel distribution method thereof |
| CN102752844A (en) * | 2012-07-23 | 2012-10-24 | 重庆大学 | Multistage distribution method of channel resources of wireless sensor network |
| CN103873485A (en) * | 2014-04-03 | 2014-06-18 | 重庆邮电大学 | Cluster MAC protocol implementation method based on link duration time in vehicle-mounted self-organizing network |
| US20150023214A1 (en) * | 2012-05-16 | 2015-01-22 | Fujitsu Limited | Node apparatus and communication method |
-
2015
- 2015-03-14 CN CN201510112713.1A patent/CN106034301A/en not_active Withdrawn
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101925066A (en) * | 2010-03-05 | 2010-12-22 | 北京北大众志微系统科技有限责任公司 | Multi-channel wireless mesh network system and channel distribution method thereof |
| US20150023214A1 (en) * | 2012-05-16 | 2015-01-22 | Fujitsu Limited | Node apparatus and communication method |
| CN102752844A (en) * | 2012-07-23 | 2012-10-24 | 重庆大学 | Multistage distribution method of channel resources of wireless sensor network |
| CN103873485A (en) * | 2014-04-03 | 2014-06-18 | 重庆邮电大学 | Cluster MAC protocol implementation method based on link duration time in vehicle-mounted self-organizing network |
Non-Patent Citations (5)
| Title |
|---|
| 吕天慧: "Ad_Hoc网络分簇算法的研究", 《吉林大学硕士学位论文》 * |
| 周贤伟: "一种无线传感器网络分簇规模约束算法", 《传感器技术学报》 * |
| 池万红，孙鹏: "一种基于分级路由的空地编队自组网方案", 《通信技术》 * |
| 陈培菊: "车载自组织网络簇机制及路由协议研究", 《重庆邮电大学硕士学位论文》 * |
| 黄荣久: "基于分簇算法的军用无线自组网研究", 《重庆大学硕士学位论文》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108834195A (en) * | 2018-06-19 | 2018-11-16 | 中国联合网络通信集团有限公司 | Cluster merging method and its module and microcontroller in clustered network structure |
| CN108834195B (en) * | 2018-06-19 | 2020-10-02 | 中国联合网络通信集团有限公司 | Cluster merging method in cluster network structure and module and microcontroller thereof |
| CN108934027A (en) * | 2018-07-04 | 2018-12-04 | 南京邮电大学 | A kind of MIMO multi-cell base station can caching system cluster-dividing method |
| CN108934027B (en) * | 2018-07-04 | 2021-04-06 | 南京邮电大学 | Clustering method of MIMO multi-cell base station caching system |
| CN110490266A (en) * | 2019-08-23 | 2019-11-22 | 北京邮电大学 | A kind of sensing data uploads, Transducer-fault Detecting Method and device |
| CN111093249A (en) * | 2019-12-05 | 2020-05-01 | 合肥中感微电子有限公司 | Wireless local area network communication method, system and wireless transceiving equipment |
| CN111093249B (en) * | 2019-12-05 | 2022-06-21 | 合肥中感微电子有限公司 | Wireless local area network communication method, system and wireless transceiving equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Feng et al. | Resource allocation for 5G D2D multicast content sharing in social-aware cellular networks | |
| CN101697635B (en) | Access method and control method of cognitive wireless MESH network | |
| CN104202821B (en) | Device-to-device Communication Jamming avoiding method and device | |
| CN105451250B (en) | A kind of Network Access Point dynamic networking method and equipment | |
| CN101094131B (en) | Method for selecting hierarchy type route of wireless sensor network based on game theory | |
| CN102883403B (en) | Construction method for mobile ad hoc network | |
| CN106034301A (en) | Node-characteristic-based clustering method in ad-hoc network | |
| CN111800758B (en) | Unmanned aerial vehicle swarm layered consensus method based on block chain | |
| US20060039298A1 (en) | Logical and physical mesh network separation | |
| JP2009543397A (en) | QoS request and information distribution for wireless relay networks | |
| CN103813340B (en) | Method for sharing network load, AP and system based on resource pool | |
| WO2008011149A2 (en) | Managing wireless base stations using a distributed virtual base station manager | |
| KR20080018258A (en) | Resource allocation in multi-access point wireless networks | |
| US11140644B2 (en) | Method for sending sync beacon message by NAN device, and device | |
| CN101472339A (en) | Method for coordinating district interference | |
| KR101303649B1 (en) | Method of multi-hop communication based on distributed medium access control | |
| CN115552933A (en) | Federal learning in a telecommunications system | |
| CN104640177B (en) | Cell selecting method based on efficiency in multilayer heterogeneous network | |
| Conti et al. | Towards scalable P2P computing for mobile ad hoc networks | |
| CN110972228B (en) | Clustering routing method based on cognitive wireless sensor network | |
| CN106034280A (en) | Node-identity-feature-based clustering method in Ad-Hoc network | |
| CN106162637B (en) | The implementation method and device of the broadband LTE cluster multinode mirror image networking | |
| CN106034305A (en) | Clustering method based on node identity characteristic in ad-hoc network | |
| CN104735625B (en) | A kind of LTE cluster management system and method | |
| CN110996371A (en) | Clustering algorithm for prolonging life cycle of wireless sensor network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WW01 | Invention patent application withdrawn after publication | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20161019 |