CN101267404B - An Assistant-Based Clustering Method in Ad Hoc Networks - Google Patents
An Assistant-Based Clustering Method in Ad Hoc Networks Download PDFInfo
- Publication number
- CN101267404B CN101267404B CN2008101063816A CN200810106381A CN101267404B CN 101267404 B CN101267404 B CN 101267404B CN 2008101063816 A CN2008101063816 A CN 2008101063816A CN 200810106381 A CN200810106381 A CN 200810106381A CN 101267404 B CN101267404 B CN 101267404B
- Authority
- CN
- China
- Prior art keywords
- node
- bunch
- assistant
- network
- cluster
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 57
- 241000854291 Dianthus carthusianorum Species 0.000 claims abstract description 21
- 238000005303 weighing Methods 0.000 claims description 8
- 238000004891 communication Methods 0.000 claims description 6
- 238000000926 separation method Methods 0.000 claims description 6
- 238000012423 maintenance Methods 0.000 claims description 4
- 230000002452 interceptive effect Effects 0.000 claims description 3
- 238000001514 detection method Methods 0.000 claims description 2
- 230000000977 initiatory effect Effects 0.000 claims description 2
- 238000012544 monitoring process Methods 0.000 claims description 2
- 230000000737 periodic effect Effects 0.000 claims description 2
- 239000000523 sample Substances 0.000 claims 2
- 230000010365 information processing Effects 0.000 abstract description 3
- 230000009286 beneficial effect Effects 0.000 abstract 1
- 238000007726 management method Methods 0.000 description 5
- 230000005540 biological transmission Effects 0.000 description 4
- 230000006978 adaptation Effects 0.000 description 2
- 230000015572 biosynthetic process Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 238000005265 energy consumption Methods 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000010276 construction Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 238000003786 synthesis reaction Methods 0.000 description 1
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
本发明为一种Ad Hoc网络中基于助理的分簇方法，涉及的领域包括Ad Hoc网络以及网络中的分簇管理。Ad Hoc网络是一种无基础设施的无线网络，分簇管理是较为有效的网络模式。簇头的合理选择对采用分簇结构的Ad Hoc网络至关重要。本文提出了一种新的分簇方法——基于助理的分簇方法，该方法通过在簇内为簇头选出一个助理节点的建簇方式，减少簇头节点的数据信息处理，节省簇头能量，降低了在已有的分簇方法中簇头节点成为网络瓶颈的可能性，有利于网络的管理，提高了网络性能。
The invention relates to an assistant-based clustering method in an Ad Hoc network, and relates to the field of the Ad Hoc network and the clustering management in the network. Ad Hoc network is a wireless network without infrastructure, cluster management is a more effective network mode. The reasonable selection of cluster heads is very important for the Ad Hoc network adopting cluster structure. This paper proposes a new clustering method - the assistant-based clustering method. This method selects an assistant node for the cluster head in the cluster to reduce the data information processing of the cluster head node and save the cluster head. energy, which reduces the possibility that the cluster head node becomes a network bottleneck in the existing clustering method, is beneficial to network management, and improves network performance.
Description
Technical field
The present invention relates to the node administration in the radio mobile self-organizing network (also claiming Ad hoc network), consider the leader cluster node energy consumption to be higher than far away bunch in ordinary node, therefore select the partial data processing that assistant's node is shared leader cluster node for leader cluster node, save the energy of bunch head, be suitable for avoiding occurring in the Ad Hoc network branch cluster management of network bottleneck.
Background technology
Ad Hoc network does not rely on any basic fixed facility, and communicating between non-conterminous node needs the intermediate node relaying; Because the node in the network can move arbitrarily, so network topology is dynamic change.Because Ad Hoc network has independent networking capability, and self-organization, no center, dynamic, be easy to characteristics such as laying, thereby be widely used in the construction of temporary information systems such as emergency relief, road traffic, military battlefield, remote field and exploration.
The architecture of Ad Hoc network can be divided into planar structure and hierarchy.In the planar structure, the status of all nodes is an equality in the network, does not have theoretic bottleneck node, and network is relatively more healthy and stronger.But the expandability of planar structure is relatively poor, is difficult to implement centralized network management and control.Therefore, only be applicable to the Ad Hoc network that scale is less.Utilize hierarchy then can solve the problem that exists in the planar structure well.In hierarchy, usually whole Ad Hoc network is carried out sub-clustering, one bunch (Cluster) generally includes a bunch of head and several bunches member.Bunch head is responsible for coordinating and management bunch interior nodes, and is used for the communication between the adjacent cluster, and bunch member's function is comparatively single.In recent years, cluster structured obtained in Ad Hoc network widely used, comprise based on bunch the formation etc. of route, classification mobile management, resource allocation and channel access mechanism, inundation broadcasting, power control and bluetooth distribution network.In cluster structured, the task of bunch head is heavier relatively, might become the bottleneck of network.Therefore, the reasonable choosing of bunch head is most important for the performance of sub-clustering Ad Hoc network.
Summary of the invention
The objective of the invention is to reduce bunch consumption of an energy, prolong the time that leader cluster node is served as bunch head, the life span that also promptly prolongs bunch.
The present invention relates to two classical cluster-dividing methods---minimum ID (Lowest-ID) cluster-dividing method self adaptation weighting as required (AOW) cluster-dividing method.
Minimum ID is one of cluster-dividing method that proposes the earliest, and it is based on the cluster-dividing method of node ID.This method is distributed unique ID for each node, method regulation, the node that has minimum ID in the adjacent node be as bunch head, and one hop neighbor node becomes the member node at this bunch place bunch, and no longer participate in the election of cluster head process, further reduced the number of bunch head.In addition, at some in particular cases, in can consigning to its responsibility bunch, bunch head has the member node of minimum ID.
Minimum ID cluster-dividing method calculates simple, and it is convenient to realize, converges faster.Under mobile environment, bunch first watch of minimum ID method, new frequency was slower, safeguarded that the expense of bunch cost is less.But it does not consider the fairness factor equally, does not consider factors such as load balance yet.This be because, this method tends to select the less node of ID as bunch head, this part node expends too much resource (as energy, disposal ability etc.) owing to serving as bunch head, is unfavorable for prolonging the bulk life time of network.
Self adaptation weighting as required (AOW-Adaptive On-demand Weighting) cluster-dividing method is a kind of cluster-dividing method of considering multiple factor, in this method, each node distributes weights to indicate the degree that is fit to serve as bunch head by a kind of combined weighted method, and weights (Weight) can calculate by a general formula of considering multiple factor:
Weight＝a×mobility+b×degree+c×power+d×energy+x (1)
Wherein, mobility represents the mobility of node, and degree represents node degree, and power represents the through-put power of node, and energy represents the dump energy of node.Parameter a, b, c and d are weight factor, and their value is by concrete application and network environment decision, and x represents the influence of other possible factor to combining weights.This method has improved adaptability, flexibility and the versatility of cluster-dividing method.
The comprehensive above-mentioned existing methods characteristics of this method, a kind of new method of bunch head management in Ad Hoc network has been proposed, the minimum ID heuristic of this method utilization is selected a bunch head fast, but leader cluster node can consume excessive power, therefore again bunch in utilize the AOW method to select assistant's node (Assistant Node), and establishing in assistant's node a hop neighbor (except that bunch head) that adds bunch also is bunch interior nodes, Assistant can bunch in handle the data message of its neighbor node, thereby the energy consumption of saving leader cluster node.This method is called the cluster-dividing method (ABCA is Assistant-BasedClustering Algorithm) based on the assistant, and its target is to save the energy of leader cluster node, and equally loaded makes link more stable.
Leader cluster node and bunch initialization adopt minimum ID cluster-dividing method, the purpose of doing like this is to make it possible to fast run-up bunch and select a bunch head, to adapt to the requirement of the quickly networking in some actual environment.After last step sets up, for fear of the too much consumption of a bunch energy, will bunch in carry out choosing of bunch assistant's node.To choosing of assistant's node, take the AOW method, purpose is that load balance preferably can be provided, and avoids upgrading whole network configuration because of bunch consumption of an energy, reduces the expense of bunch maintenance.Because the AOW method itself is utilized comprehensive weights, every index comprehensive can be got up simultaneously, assistant's node of electing like this has good performance, is fit to help the leader cluster node processing information data.Information processing between bunch head is responsible for bunch, assistant's node then help the information processing of bunch head in being responsible for bunch, and the information between them can obtain by mutual interactive information.Assistant's node also has the information of bunch interior nodes simultaneously.It is as shown in Figure 1 cluster structured.
The specific descriptions of ABCA method are as follows:
Suppose that at first the node in the network satisfies following condition:
1) node uses omnidirectional antenna, is operated in semiduplex mode.
2) leader cluster node can use two power modes, uses bigger power be used for bunch between communication, use less power to communicate by letter in being used for bunch.The average power P that receives at range transmission antenna d place
rCan calculate by following formula:
P wherein
0Be the received power near the reference point place, this point and transmitting antenna have one less apart from d
0, n is the path attenuation index.According to this formula, because high-power, must guarantee that therefore bunch head in the network can both receive, and a bunch head spreads all over the whole network, so just will guarantee also can receive this power when d 〉=R (R is a network radius) for communication between being used for bunch.Also have own distinctive received power to calculate under different network models, the implementer can select network model according to concrete network condition, thereby determines powerful numerical value requirement.And low power choice relation to bunch in communication, therefore in the time of will guaranteeing d 〉=r (r is a bunch radius), also can receive this power.
3) each node has unique ID, periodic broadcasting " Hello " message, each node can obtain the information of neighbor node by mutual interactive information, comprise node ID, and the node weights (by mobility, node degree, through-put power and dump energy are formed), node state, node place bunch message (comprise leader cluster node and assistant's node, and this bunch member).
4) cluster-dividing method the term of execution, significant change does not take place in network topology structure.
It is as follows that bunch head of ABCA method and assistant's node are chosen process:
1) utilizes the initialization that minimum ID cluster-dividing method carries out bunch and select a bunch head.
2) each node n passes through periodically mutual " Hello " detection information, determine neighbor node number separately, as its number of degrees dn, and (the desirable number of degrees of node can be emphasized setting in various degree of node degree according to network to calculate its number of degrees and desirable node number of degrees Dideal, for example for Dideal=2 and Dideal=10, the latter more emphasizes node degree) poor, i.e. Dn=|dn-Dideal|.
3) each node n calculate its to all neighbor nodes apart from sum P
n
4) use the average translational speed of each node n to represent mobility M
n
5) because bunch head can consume energy more, the long more energy of time of therefore serving as bunch head will be more little, so can use the time T of each node n as bunch head
nRepresent the energy content of battery that node n has consumed, T
nThe dump energy of more little expression node n is many more, supposes that when initial, each node energy is identical, and a bunch spent energy content of battery is much larger than ordinary node.
6) to each node n calculation combination weights W n=a * D
n+ b * P
n+ c * M
n+ d * T
nWherein, a, b, c, d are weight factor, and a+b+c+d=1, and Mn is an amount of weighing node mobility, and Dn is an amount of weighing node degree, and Pn is an amount of weighing the node through-put power, Tn is an amount of weighing node energy, M
n, D
n, P
nAnd T
nMore little, the expression joint behavior is good more.Then, each node is placed on the Wn that obtains periodically with its node ID and broadcasts to neighbor node in " Hello " message.
7) a bunch hair plays " Weight Inquiry " message, adds up the weights of each node, and the node of therefrom selecting the weights minimum is as assistant's node.
8) assistant's node bunch in a broadcasting bunch of message " Assistant ", announce the assistant's node in oneself being bunch, and its hop neighbor that does not add any bunch also joined this bunch.
9) repeat above step, each node in network or become a bunch head, or all belong to ordinary node or assistant's node of certain bunch.
The method that more than is ABCA is described, and flow chart as shown in Figure 2.
Bunch maintenance of ABCA method is as follows:
The clustering architecture of ABCA cluster-dividing method we can to regard one as be the tree of root with bunch head, as shown in Figure 3.Assistant's node is its two-level node, and ordinary node is a leaf node.After adopting the ABCA cluster-dividing method to form clustering architecture, the node state that we are defined as follows:
CH (Cluster Head): leader cluster node
AN (Assistant Node): assistant's node
ONoCH (Ordinary Neighbor of Cluster Head): one of CH jumps common neighbor node in bunch
ONoAN (Ordinary Neighbor of Assistant Node): one of AN jumps common neighbor node (being that CH needs double bounce to arrive node by AN) in bunch
Its concrete bunch maintenance process is as follows:
1) ONoAN receives the signal strength signal intensity of AN by supervision, observes the separation degree of it and AN with this.(can establish this threshold value is-70dBm when signal strength signal intensity is lower than a certain threshold value, experimental results show that generally when signal strength signal intensity be lower than-during 70dBm, the reception of wireless network has just become unstable with the transmission data) time, then it notifies AN will leave this bunch, this node of AN notice CH will leave this bunch, seek other bunches adding.
2) ONoCH receives the signal strength signal intensity of CH by supervision, observes the separation degree of it and CH with this.(can establish this threshold value is-70dBm when signal strength signal intensity is lower than a certain threshold value, experimental results show that generally when signal strength signal intensity be lower than-during 70dBm, the reception of wireless network has just become unstable with the transmission data), if it is the hop neighbor of AN simultaneously, then by monitoring signal strength signal intensity, decide it to leave this bunch or become ONoAN from AN.When the signal strength signal intensity of AN was higher than threshold value, its state of notice bunch head became ONoAN, otherwise notice bunch head will leave this bunch, seek other bunches adding.
3) AN is by receiving the signal strength signal intensity of CH by supervision, observes the separation degree of it and CH with this.When signal strength signal intensity is lower than a certain threshold value (can establish this threshold value and be-70dBm, experimental results show that generally when signal strength signal intensity be lower than-during 70dBm, the reception of wireless network with send data and just become unstable), AN notifies ONoAN and CH will leave this bunch.CH change neighbor node table, new " Weight Inquiry " message of initiating of laying equal stress on is selected new assistant's node.ONoAN receives that the message of AN also announces to leave this bunch, seeks new bunch adding.
(residue energy of node Et was lower than value when 4) energy that detects oneself as CH was lower than the threshold value of setting
The time, E wherein
0Be node primary power, P
MinBe the minimum power that the node transmission data that drawn when the d=R by formula (2) need be used, P
0Be the received power near the reference point place, this point and transmitting antenna have one less apart from d
0, R is a network radius, n is the path attenuation index, t is the operating time of node), CH notice AN allows it serve as a bunch head, and oneself then transfers assistant's node to, and ONoCH becomes ONoAN, and ONoAN becomes ONoCH, this moment, this bunch member did not still become, and still was tree.If the energy of AN also is lower than this threshold value, then bunch head is announced to dismiss this bunch, and bunch interior nodes all goes to seek new bunch adding.
5) when a node be ONoCH be again ONoAN, then its state is defaulted as ONoCH.
6) node in network is by moving, and when entering in two bunches of scopes simultaneously, it is according to weights its last a hop neighbor node relatively, and the less node place of adding weights bunch becomes this bunch member.
This method is intended to propose new cluster-dividing method thought---band assistant's cluster-dividing method.Because assistant's node is the node of the optimum selected according to the weight size in bunch first hop neighbor, has higher combination property.When the leader cluster node energy was low, assistant's node can be served as the role of its bunch head, and the sub-clustering once more that produces because of bunch consumption of an energy has been avoided in equally loaded, has stablized clustering architecture.
Description of drawings
Fig. 1 is the network configuration after the sub-clustering that is drawn by the network topological diagram of Fig. 4 according to the ABCA algorithm, the black round dot is represented leader cluster node, the grey round dot is represented assistant's node, ordinary node in the white round dot representative bunch, comprising ONoCH and ONoAN, sequence number is represented unique ID value (node that has identical ID value among every some ID value and Fig. 4 is same node) of each node, and the node among the figure in each dashed circle is represented one bunch.
Fig. 2 is bunch forming process flow chart of this cluster-dividing method.
Fig. 3 is a clustering architecture after the typical ABCA of the execution method, the black round dot is represented leader cluster node, the grey round dot is represented assistant's node, ordinary node in the white round dot representative bunch, comprising ONoCH and ONoAN, and its structure can to regard one as be the tree of root with the leader cluster node.
Fig. 4 is the network topology structure of the not sub-clustering of an example.The white round dot is represented the node in the network, and sequence number is represented unique ID value (node that has same sequence number with Fig. 1 is same node) of each node.
Fig. 5 is the process that node weights in the example and this example are carried out the ABCA method.The node of "---" expression pending status in the table, weight is according to the result of each factor of AOW method synthesis by calculating in real network, the weight for providing at random in this example.
Embodiment
Fig. 4 is the network topology structure of this example, and Fig. 5 describes for the step of carrying out this algorithm.
Step 2: when carrying out ABCA sub-clustering algorithm, at first find node 1 with minimum ID number, leader cluster node as first bunch, degneracy size in the neighbor node of node 1, select the assistant node of the node 4 of weights minimum as it, other neighbor nodes of node 1 (node 5, node 13) are denoted as ONoCH.
Step 3: neighbor node 2 and the node 3 with node 4 is denoted as ONoAN again, and a bunch of foundation is finished.
Step 4: other does not find the node 6 of minimum ID in the node of sub-clustering in network again, as new bunch bunch head, and finds out it and does not have the assistant node of the node 9 of minimum weights as it in the neighbor node of cluster, and another neighbor node 7 is as ONoCH.
Step 5: with assistant's node 9 not the neighbor node 8 and the node 10 of cluster be denoted as ONoAN, second bunch of foundation is finished.
Step 6: choose in the network node 11 that has minimum ID in the cluster node not again, as new bunch bunch head, this moment, its neighbor node had only node 12, indicated the assistant node of this node for it.The equal cluster of all nodes in this moment network, the sub-clustering algorithm is finished.
Fig. 1 carries out result after the ABCA sub-clustering method for it.
Claims (1)
- In the Ad Hoc network based on assistant's cluster-dividing method, it is characterized in that: node uses omnidirectional antenna in the network, be operated under the semiduplex mode, has unique node ID, periodic broadcasting " Hello " probe message, each node is by the information of interactive information acquisition neighbor node, and information comprises node ID, node weights, node state, node place bunch message, and the node weights comprise mobility, node degree, through-put power and dump energy information; Leader cluster node uses two power modes, power of communications between high-power satisfied bunch, and small-power satisfies power of communications between bunch interior nodes;Execution in step:The first, bunch head and assistant's node are chosen process:1) initialization of carrying out bunch and select a bunch head: allow the node with minimum node ID as bunch head in adjacent node, its next hop neighbor node becomes the member node at this bunch place bunch, and no longer participates in the election of cluster head process;2) each node n passes through periodically mutual " Hello " detection information, determines neighbor node number separately, as its number of degrees d n, and calculate the poor of its number of degrees and desirable node number of degrees Dideal, i.e. D n=| d n-Dideal|, the desirable node number of degrees can be emphasized setting in various degree of node degree according to network;3) each node n calculate its to all neighbor nodes apart from sum P n4) use the average translational speed of each node n to represent mobility M n5) use the time T of each node n as bunch head nRepresent the energy content of battery that node n has consumed;6) to each node n computing node weights W n=a * D n+ b * P n+ c * M n+ d * T n, wherein, a, b, c, d are weight factor, and a+b+c+d=1, M nBe the amount of weighing node mobility, D nBe the amount of weighing node degree, P nBe the amount of weighing the node through-put power, T nBe the amount of weighing node energy, each node is with the W that obtains nBe placed on periodically with its node ID and broadcast to neighbor node in " Hello " probe message;7) a bunch hair plays " Weight Inquiry " message, adds up the node weights of each node, and the node of therefrom selecting node weights minimum is as assistant's node;8) assistant's node bunch in a broadcasting bunch of message " Assistant ", announce the assistant's node in oneself being bunch, and described assistant's node is not added a hop neighbor of any bunch also join this bunch;9) repeat above step, each node in network or become a bunch head, or all belong to ordinary node or assistant's node of certain bunch;The second, bunch maintenance:It is the tree of root with bunch head that clustering architecture is one, and assistant's node is its two-level node, and ordinary node is a leaf node, after bunch head and assistant's node are chosen process and are finished, and the node state that is defined as follows:CH: leader cluster nodeAN: assistant's nodeONoCH: one of CH jumps common neighbor node in bunchONoAN: one of AN jumps common neighbor node in bunch, and promptly CH needs double bounce to arrive node by AN1) ONoAN receives the signal strength signal intensity of AN by supervision, observes the separation degree of it and AN with this, when signal strength signal intensity be lower than-during 70dBm, then its notice AN will leave this bunch, AN notifies this node of CH will leave this bunch, seeks other bunches adding;2) ONoCH receives the signal strength signal intensity of CH by supervision, observe the separation degree of it and CH with this, when signal strength signal intensity be lower than-during 70dBm, when it is the hop neighbor of AN simultaneously,, decides it to leave this bunch or become ONoAN then by monitoring signal strength signal intensity from AN, when the signal strength signal intensity of AN be higher than-during 70dBm, its state of notice bunch head becomes ONoAN, otherwise notice bunch head will leave this bunch, seek other bunches adding;3) AN receives the signal strength signal intensity of CH by supervision, observe the separation degree of it and CH with this, when signal strength signal intensity be lower than-during 70dBm, AN notice ONoAN and CH will leave this bunch, CH change neighbor node table, new " Weight Inquiry " message of initiating of laying equal stress on is selected new assistant's node, ONoAN receives that the message of AN also announces to leave this bunch, seeks new bunch adding;4) energy that detects oneself as CH is lower thanThe time, E wherein 0Be node primary power, P 0Be the received power near the reference point place, described reference point and transmitting antenna have one less apart from d 0, R is a network radius, and n is the path attenuation index, and t is the operating time of node, CH notice AN allows it serve as a bunch head, and oneself then transfers assistant's node to, and ONoCH becomes ONoAN, and ONoAN becomes ONoCH, this moment, this bunch member still became, and still was tree, when the energy of AN also is lower than The time, then bunch head is announced to dismiss this bunch, and bunch interior nodes all goes to seek new bunch adding;5) when a node be ONoCH be again ONoAN, then its state is defaulted as ONoCH;6) node in network is by moving, and when entering in two bunches of scopes simultaneously, it is according to node weights its last a hop neighbor node relatively, and the less node place of adding node weights bunch becomes this bunch member.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101063816A CN101267404B (en) | 2008-05-13 | 2008-05-13 | An Assistant-Based Clustering Method in Ad Hoc Networks |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101063816A CN101267404B (en) | 2008-05-13 | 2008-05-13 | An Assistant-Based Clustering Method in Ad Hoc Networks |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101267404A CN101267404A (en) | 2008-09-17 |
| CN101267404B true CN101267404B (en) | 2010-06-02 |
Family
ID=39989546
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008101063816A Expired - Fee Related CN101267404B (en) | 2008-05-13 | 2008-05-13 | An Assistant-Based Clustering Method in Ad Hoc Networks |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101267404B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11270039B2 (en) | 2014-09-30 | 2022-03-08 | International Business Machines Corporation | Road network generation |
Families Citing this family (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101483935B (en) * | 2008-12-19 | 2011-11-16 | 北京邮电大学 | Topology drawing algorithm for wireless Ad-Hoc network |
| CN101801113B (en) * | 2009-02-05 | 2012-07-11 | 华为技术有限公司 | Network topology clustering processing method and processing system |
| JP5379529B2 (en) * | 2009-03-25 | 2013-12-25 | アズビル株式会社 | Wireless communication system and parent node search method |
| CN101707795B (en) * | 2009-07-31 | 2012-05-23 | 重庆重邮信科通信技术有限公司 | Method for eliminating interference between base station nodes of ad hoc network |
| CN101860874B (en) * | 2010-06-01 | 2013-06-26 | 财团法人交大思源基金会 | Backbone-oriented structure, establishment method and repair method in wireless sensor network |
| CN101908913B (en) * | 2010-08-20 | 2013-01-09 | 上海交通大学 | Scanning method of directive antenna-based Ad Hoc network neighbor nodes |
| CN102307373B (en) * | 2011-08-23 | 2014-01-22 | 哈尔滨工业大学 | VANET clustering method taking regard of vehicle traffic characteristic |
| CN102970722B (en) * | 2012-12-10 | 2015-07-15 | 北京科技大学 | Multicasting route algorithm of low-time-delay delay tolerant and disruption tolerant sensor network |
| CN103124421B (en) * | 2012-12-12 | 2016-06-08 | 南京邮电大学 | The cluster-dividing method of mobile node in a kind of wireless sensor network |
| CN104009913B (en) * | 2014-04-10 | 2017-01-25 | 浙江工商大学 | Broadcasting method based on distance and energy balance in mobile Ad Hoc network |
| CN104244170B (en) * | 2014-09-28 | 2018-11-09 | 成都维客亲源健康科技有限公司 | The autonomous network-building method of bluetooth nodes of low-power consumption |
| CN106921948B (en) * | 2015-12-24 | 2019-07-05 | 中国电信股份有限公司 | Method, network node and the system for dividing group are realized based on mark extreme value |
| CN105848241B (en) * | 2016-03-21 | 2019-03-01 | 广州供电局有限公司 | The cluster-dividing method and system of mobile ad hoc network |
| WO2018098748A1 (en) * | 2016-11-30 | 2018-06-07 | 深圳天珑无线科技有限公司 | Communication method in distributed network, node, and system |
| CN107396291B (en) * | 2017-07-26 | 2019-12-03 | 中国联合网络通信集团有限公司 | Vehicle sub-clustering processing method and system |
| CN107484247A (en) * | 2017-09-21 | 2017-12-15 | 天津光电通信技术有限公司 | A kind of self-organized network communication system of new high reliability |
| CN108600955B (en) * | 2018-03-02 | 2020-07-31 | 中山大学 | A wireless communication method suitable for disaster scene |
| CN108934054B (en) * | 2018-06-19 | 2021-07-16 | 昆明理工大学 | A Clustering Algorithm for Ad-hoc Networks Based on Node Data Values |
| CN108834195B (en) * | 2018-06-19 | 2020-10-02 | 中国联合网络通信集团有限公司 | Cluster merging method in cluster network structure and module and microcontroller thereof |
| CN109213242B (en) * | 2018-11-08 | 2020-11-27 | 王锐 | Intelligent home temperature and humidity real-time control system |
| CN109922511A (en) * | 2019-04-29 | 2019-06-21 | 中国联合网络通信集团有限公司 | Cluster-head node selection method, node clustering method and cluster-head node selection device |
| CN112929939B (en) * | 2021-02-07 | 2022-04-08 | 电子科技大学 | Ad Hoc network clustering method and device based on Bubble framework |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060227724A1 (en) * | 2005-04-08 | 2006-10-12 | Pascal Thubert | Arrangement for providing optimized connections between peer routers in a tree-based ad hoc mobile network |
| CN1925442A (en) * | 2006-08-01 | 2007-03-07 | 程伟明 | Automatic network-building method for wireless communication terminal in intelligent environment |
| CN101163158A (en) * | 2007-11-22 | 2008-04-16 | 复旦大学 | Cluster based service issuing and discovering method in self-organizing network facing to service |
-
2008
- 2008-05-13 CN CN2008101063816A patent/CN101267404B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060227724A1 (en) * | 2005-04-08 | 2006-10-12 | Pascal Thubert | Arrangement for providing optimized connections between peer routers in a tree-based ad hoc mobile network |
| CN1925442A (en) * | 2006-08-01 | 2007-03-07 | 程伟明 | Automatic network-building method for wireless communication terminal in intelligent environment |
| CN101163158A (en) * | 2007-11-22 | 2008-04-16 | 复旦大学 | Cluster based service issuing and discovering method in self-organizing network facing to service |
Non-Patent Citations (4)
| Title |
|---|
| Guangyuan Wang, etc..An adaptive assistant-aided clustering scheme for mobileAdHoc Networks.Proceedings of WiCOM2006＇.2006,1-4. |
| Guangyuan Wang,etc..An adaptive assistant-aided clustering scheme for mobileAdHoc Networks.Proceedings of WiCOM2006＇.2006,1-4. * |
| Inn Inn ER, etc..Mobility-based d-hop clustering algorithm for mobil adhocnetworks.Proceedings of WCNC2004＇4.2004,42359-2364. |
| Inn Inn ER,etc..Mobility-based d-hop clustering algorithm for mobil adhocnetworks.Proceedings of WCNC2004＇4.2004,42359-2364. * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11270039B2 (en) | 2014-09-30 | 2022-03-08 | International Business Machines Corporation | Road network generation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101267404A (en) | 2008-09-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101267404B (en) | An Assistant-Based Clustering Method in Ad Hoc Networks | |
| Sabet et al. | An energy efficient multi-level route-aware clustering algorithm for wireless sensor networks: A self-organized approach | |
| Elhabyan et al. | Two-tier particle swarm optimization protocol for clustering and routing in wireless sensor network | |
| CN102036308B (en) | Energy balancing wireless sensor network clustering method | |
| Kassan et al. | Game theory based distributed clustering approach to maximize wireless sensors network lifetime | |
| Chen et al. | A coverage-aware and energy-efficient protocol for the distributed wireless sensor networks | |
| Chiti et al. | Content sharing in Internet of Vehicles: Two matching-based user-association approaches | |
| Jurdak et al. | A framework for modeling sensor networks | |
| CN105142195B (en) | A wireless terminal communication strategy selection and resource allocation method based on Stackelberg game | |
| Azar et al. | Energy-and delay-efficient algorithm for large-scale data collection in mobile-sink WSNs | |
| CN101141388A (en) | A Method for Optimizing Energy Consumption in Ad hoc Network | |
| Dai et al. | An overlapping coalitional game for cooperative spectrum sensing and access in cognitive radio networks | |
| He et al. | A novel distributed resource allocation scheme for wireless-powered cognitive radio Internet of Things networks | |
| Meelu et al. | Energy efficiency of cluster‐based routing protocols used in wireless sensor networks | |
| Poonguzhali | Energy efficient realization of clustering patch routing protocol in wireless sensors network | |
| Patil et al. | A novel AEB-AODV based AADITHYA cross layer design hibernation algorithm for energy optimization in WSN | |
| Cai et al. | Game-Based Dynamic Clustering Routing Strategy for Mobile Wireless Sensor Networks | |
| Elhabyan et al. | Weighted tree based routing and clustering protocol for WSN | |
| Bi et al. | DAR: An energy-balanced data-gathering scheme for wireless sensor networks | |
| Moussa et al. | Synchronized region based clustering for energy saving in wireless sensor networks | |
| Yu et al. | Energy aware routing algorithm based on layered chain in wireless sensor network | |
| Torres et al. | Improving lifetime and availability for ad hoc networks to emergency and rescue scenarios | |
| Wu et al. | An efficient distributed clustering protocol based on game-theory for wireless sensor networks | |
| CN114095945A (en) | Node dormancy scheduling method and system comprehensively considering network coverage and energy efficiency | |
| Li et al. | Dynamic-P: A multi-beam directional antenna MAC protocol based on time slot states adjustment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100602 Termination date: 20140513 |