CN107071849A - A kind of method and apparatus for electing leader cluster node - Google Patents
A kind of method and apparatus for electing leader cluster node Download PDFInfo
- Publication number
- CN107071849A CN107071849A CN201710471798.1A CN201710471798A CN107071849A CN 107071849 A CN107071849 A CN 107071849A CN 201710471798 A CN201710471798 A CN 201710471798A CN 107071849 A CN107071849 A CN 107071849A
- Authority
- CN
- China
- Prior art keywords
- node
- target area
- leader cluster
- cluster node
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 49
- 238000004891 communication Methods 0.000 abstract description 30
- 230000008859 change Effects 0.000 abstract description 8
- 241000854291 Dianthus carthusianorum Species 0.000 description 13
- 238000012545 processing Methods 0.000 description 10
- 238000010586 diagram Methods 0.000 description 9
- 230000005540 biological transmission Effects 0.000 description 7
- 238000005516 engineering process Methods 0.000 description 6
- 238000009795 derivation Methods 0.000 description 5
- 238000012360 testing method Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 4
- 230000000712 assembly Effects 0.000 description 3
- 238000000429 assembly Methods 0.000 description 3
- 238000004422 calculation algorithm Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000006978 adaptation Effects 0.000 description 2
- 230000001413 cellular effect Effects 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000012163 sequencing technique Methods 0.000 description 2
- 238000013316 zoning Methods 0.000 description 2
- KLDZYURQCUYZBL-UHFFFAOYSA-N 2-[3-[(2-hydroxyphenyl)methylideneamino]propyliminomethyl]phenol Chemical compound OC1=CC=CC=C1C=NCCCN=CC1=CC=CC=C1O KLDZYURQCUYZBL-UHFFFAOYSA-N 0.000 description 1
- 208000032370 Secondary transmission Diseases 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 201000001098 delayed sleep phase syndrome Diseases 0.000 description 1
- 208000033921 delayed sleep phase type circadian rhythm sleep disease Diseases 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000004069 differentiation Effects 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 230000004927 fusion Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The disclosure is directed to a kind of method and apparatus for electing leader cluster node, belong to communication technical field.Method includes：According to the scope of target area in the positional information and target house of target house interior joint, the node that target area is included in target house is determined；According to the area attribute information of target area, the corresponding leader cluster node number in target area is determined；The leader cluster node of leader cluster node number is elected in the competition value of node in target area, node in the target area.For the target area of different range, with different zones attribute, then area attribute information is also all not quite similar, and then determining that obtained leader cluster node number is also to change according to target area attribute, the leader cluster node number of dynamic change is more suitable for the target area of different range compared to fixed leader cluster node number.
Description
Technical field
The disclosure is directed to communication technical field, especially with respect to a kind of method and apparatus for electing leader cluster node.
Background technology
The node (i.e. equipment) that LAN can be divided into multiple regions, each region constitutes a cluster, each cluster
May each comprise all nodes in multiple nodes, each region is one cluster of composition.Node in cluster can be divided into cluster head again
Node and bunch member node.Leader cluster node can be used for managing or control bunch member node in whole cluster, and coordinate cluster member
Work between node.
In the related art, the quantity of the leader cluster node in each region that the LAN of one family is included is one.
The content of the invention
In order to overcome problem present in correlation technique, present disclose provides following technical scheme：
According to the first aspect of the embodiment of the present disclosure there is provided a kind of method for electing leader cluster node, methods described includes：
According to the scope of target area in the positional information of target house interior joint and the target house, the mesh is determined
The node included in mark region；
According to the area attribute information of the target area, the corresponding leader cluster node number in the target area is determined；
The cluster head is elected in the competition value of node in the target area, the node in the target area
The leader cluster node of interstitial content.
Alternatively, the area attribute information of the target area includes interstitial content, the maximal side of the target area
And the node in the target area is to the average distance of base station.
Alternatively, the target area is a room in the target house.
Alternatively, according to the competition value of the target area interior joint, institute is elected in the node in the target area
The leader cluster node of leader cluster node number is stated, including：
The node in the target area is ranked up from large to small according to the competition value of the target area interior joint；
Election comes the node of top N as leader cluster node, wherein, N is the leader cluster node number.
Alternatively, it is described when having detected in the new node addition target area after election leader cluster node is finished
Method also includes：
According to the competition value of new node in the target area and leader cluster node, in the new node and the cluster head
The node for coming top N is elected in node as leader cluster node, wherein, N is the leader cluster node number.
According to the second aspect of the embodiment of the present disclosure there is provided a kind of device of election leader cluster node, described device includes：
Node determining module, for target area in the positional information according to target house interior joint and the target house
Scope, determine the node included in the target area；
Number determining module, for the area attribute information according to the target area, determines the target area correspondence
Leader cluster node number；
First election module, for the competition value according to the target area interior joint, the section in the target area
The leader cluster node of the leader cluster node number is elected in point.
Alternatively, the area attribute information of the target area includes interstitial content, the maximal side of the target area
And the node in the target area is to the average distance of base station.
Alternatively, the target area is a room in the target house.
Alternatively, the first election module includes：
Sequencing unit, for the competition value according to the target area interior joint from large to small in the target area
Node is ranked up；
Unit is elected, the node of top N is come for electing as leader cluster node, wherein, N is the leader cluster node number
Mesh.
Alternatively, after described device election leader cluster node is finished, the target area is added when having detected new node
When middle, described device also includes：
Second election module, for the competition value according to new node in the target area and leader cluster node, described
The node for coming top N is elected in new node and the leader cluster node as leader cluster node, wherein, N is the leader cluster node
Number.
According to the third aspect of the embodiment of the present disclosure there is provided a kind of terminal, the terminal includes processor and memory, institute
State at least one instruction that is stored with memory, at least one section program, code set or instruction set, at least one instruction, institute
At least one section program, the code set or instruction set is stated to be loaded by the processor and performed to realize above-mentioned election leader cluster node
Method.
According to the fourth aspect of the embodiment of the present disclosure there is provided a kind of computer-readable recording medium, in the storage medium
Be stored with least one instruction, at least one section program, code set or instruction set, at least one instruction, described at least one section
Program, the code set or instruction set are loaded by processor and performed the method to realize above-mentioned election leader cluster node.
The technical scheme provided by this disclosed embodiment can include the following benefits：
The method provided by the present embodiment, according to the area attribute information of target area, determines that target area is corresponding
Leader cluster node number, determines what is obtained, for not homotype during this leader cluster node number according to the area attribute information of target area
The target area enclosed, with different zones attribute, then area attribute information is also all not quite similar, and then the cluster head section that determination is obtained
It is also to change according to target area attribute to count out, and the leader cluster node number of dynamic change is compared to fixed leader cluster node
Number is more suitable for the target area of different range.
It should be appreciated that the general description of the above and detailed description hereinafter are only exemplary and explanatory, not
The disclosure can be limited.
Brief description of the drawings
Accompanying drawing herein is merged in specification and constitutes the part of this specification, shows the implementation for meeting the disclosure
Example, and be used to together with specification to explain the principle of the disclosure.In the accompanying drawings：
Fig. 1 is a kind of flow chart of the method for election leader cluster node according to an exemplary embodiment；
Fig. 2 is a kind of schematic diagram of region division according to an exemplary embodiment；
Fig. 3 is a kind of flow chart of the method for election leader cluster node according to an exemplary embodiment；
Fig. 4 is a kind of schematic diagram of cluster connection according to an exemplary embodiment；
Fig. 5 is a kind of schematic diagram of data transmission link according to an exemplary embodiment；
Fig. 6 is a kind of schematic diagram of the device of election leader cluster node according to an exemplary embodiment；
Fig. 7 is a kind of schematic diagram of the device of election leader cluster node according to an exemplary embodiment；
Fig. 8 is a kind of structural representation of node according to an exemplary embodiment.
Pass through above-mentioned accompanying drawing, it has been shown that the clear and definite embodiment of the disclosure, will hereinafter be described in more detail.These accompanying drawings
It is not intended to limit the scope that the disclosure is conceived by any mode with word description, but is by reference to specific embodiment
Those skilled in the art illustrate the concept of the disclosure.
Embodiment
Here exemplary embodiment will be illustrated in detail, its example is illustrated in the accompanying drawings.Following description is related to
During accompanying drawing, unless otherwise indicated, the same numbers in different accompanying drawings represent same or analogous key element.Following exemplary embodiment
Described in embodiment do not represent all embodiments consistent with the disclosure.On the contrary, they be only with it is such as appended
The example of the consistent apparatus and method of some aspects be described in detail in claims, the disclosure.
The embodiments of the invention provide a kind of method for electing leader cluster node, this method can be realized by base station, and by family
Each node in front yard coordinates realization jointly, wherein, node can include computer, tablet personal computer, mobile phone, refrigerator, television set, wash
Clothing machine and sensor etc..Base station can include the parts such as processor, memory, transceiver.Processor, can be CPU
(Central Processing Unit, CPU) etc., can be used for calculating the leader cluster node number in target area
And the competition value of each node is calculated, wait processing.Memory, can be RAM (Random Access Memory, arbitrary access
Memory), Flash (flash memory) etc. can be used for storing the data needed for the data received, processing procedure, in processing procedure
Data of generation etc..Transceiver, can be used for carrying out data transmission with node, other base stations.Transceiver can include antenna,
With circuit, radio circuit etc..
The exemplary embodiment of the disclosure one provides a kind of method for electing leader cluster node, as shown in figure 1, the place of this method
Reason flow can include the steps：
Step S110, according to the scope of target area in the positional information and target house of target house interior joint, it is determined that
The node included in target area.
In force, first, base station, which can be prestored, includes each room in the floor plan in target house, the floor plan
Between positional information and size.Then, base station can receive the positional information for each node that each node is uploaded.With
Afterwards, base station can be according to the floor plan and the positional information of each node in the target house, it is determined that each node tool
Body is in which of target house position.Finally, each node that target area is included in target house is determined.For example, such as Fig. 2
Shown, target house includes a toilet, a kitchen, two bedrooms and a parlor.If with the visitor in target house
The Room is target area, then comprising 6 nodes in the corresponding region 6 in parlor, it may be determined that they be respectively node A, node B,
Node C, node D, node E and node F.
Alternatively, target area is a room in target house.
In force, during zoning, divided in units of the room in target house, for example, will
Toilet is divided into a region, and parlor is divided into another region.It can so ensure to divide obtained any region all
Be not in the phenomenon through wall, and then the cluster intercommunication in any region is all without through wall, thus avoid because
The problem of signal attenuation, communication performance decline caused by carrying out communication meeting through wall.
Step S120, according to the area attribute information of target area, determines the corresponding leader cluster node number in target area.
In force, due to the process of zoning, be in units of the room in target house, therefore divide obtain
The size in region all may be different, so all elect a leader cluster node to be possible to so that a cluster head section in the zone again
The entrained bunch member node of point is excessive or very few, and then influences communication efficiency in cluster.In the method that the present embodiment is provided,
Before election leader cluster node, it is necessary first to according to the area attribute information of target area, determine the corresponding cluster head in target area
Interstitial content.
Alternatively, the area attribute information of target area includes interstitial content, maximal side and the target of target area
The average distance of node in region to base station.
Alternatively, step S120 can include：The corresponding leader cluster node number in target area is determined according to following calculation formula
Mesh：
Wherein, koptFor leader cluster node number, n is the interstitial content of target area, and M is maximal side, dtoBSFor target area
Average distance of each node to base station in domain.It should be noted that M can be the maximal side in target area boundaries line.Example
Such as, as shown in Fig. 2 10 meters of the corresponding parlor length in region 6, wide 5 meters, then its maximal side is 10 meters.dtoBSIt is a statistical number
According to, specifically, plan and erect base station during, periphery place can be counted to the distance of base station, for example, certain house A
Distance of the cell apart from base station is 5 kms, then corresponding with certain house A cells can will be identified in the memory of base station with being somebody's turn to do
Base station is accordingly stored in list with the distance of certain house A cells.When the base station is got and certain house A cell phases
During the mark answered, it is possible to, according to being inquired about with corresponding identify of certain house A cells, lived in list with determination with certain
Residence A cells identify the distance of corresponding base station and certain house A cells accordingly.When base station gets the positional information of each node
When, it can substantially judge that these nodes come from which place, and then the rough determination place being averaged to the base station
Apart from dtoBS。
Above-mentioned formula 1 is to carry out first derivation, another derivation knot by simultaneous following equation 2 to 6, and to parameter k therein
What fruit drew for 0.
Formula 2 is as follows：
Wherein, ECHFor the gross energy that all leader cluster nodes are consumed in a cluster in target area, n is the node of target area
Number, k is the corresponding leader cluster node number in target area, EDAThe energy for for leader cluster node consume required for data fusion,
dtoBSFor each node in target area to the average distance of base station, EelecIt is every for the radiating circuit or receiving circuit in leader cluster node
Send or receive the energy that 1 bit data is consumed, εfsDepending on the signal amplifier model in radiating circuit or receiving circuit,
The bit number for the data that L transmits for needs.Wherein, ECH, k, L be unknown parameter.EDA、EelecFor test data.Usually, setting
Count the stage of node circuit, it is possible to which each performance to node is tested, including to node EDA、EelecTest.
Carry out after repeatedly testing, E can be drawnDA、EelecTest value, E is applied to afterDA、EelecTest value when, Ke Yizhi
E can just be learnt by connecing the service manual of query nodeDA、Eelec.In the present embodiment, can be in advance in the memory of each node
In advance by its EDA、EelecCorresponding value is stored respectively.When base station needs to obtain these values, base station is transmitted directly to
.
Formula 3 is as follows：
EnonCH=LEelec+L·εfs·d2 toCH(formula 3)
Wherein, EnonCHIt is the gross energy of all bunch member nodes consumption in a cluster in target area, dtoCHIt is cluster member
Distance of the node to leader cluster node.Wherein, EnonCH、L、dtoCHFor unknown parameter.dtoCHCalculation formula can see formula 4：
Wherein, ρ (x, y) is the distribution density function of node, and x, y are the position coordinates of each node in target area.Need
Illustrate, during derivation formula 1, formula 4 can be substituted into formula 3 first, you can by the d in formula 32 toCHDirectly
Disappear.
Formula 5 is as follows：
Wherein, EclusterFor the gross energy that all nodes are consumed in a cluster in target area.
Formula 6 is as follows：
Etot=L (2nEelec+nEDA+εfs(kd2 toBS+nd2 toCH)) (formula 6)
Wherein, EtotFor the gross energy of all node consumption in target area.
By simultaneous above-mentioned formula 2 to 6, the unknown parameter that can disappear is disappeared, and single order is carried out to parameter k therein
Derivation, another derivation result can draw k for 0optExpression formula (formula 1).
Cluster head section is elected in step S130, the competition value of the node in target area, node in the target area
The leader cluster node counted out.
In force, the present embodiment can provide a kind of value-based algorithm that competes and carry out the competition value of each node in target area
Calculate.For the calculating physical presence many algorithms of competition value, differ a citing in this present embodiment.
Alternatively, before the competition value of target area interior joint is calculated, it can first confirm which node participates in cluster head section
The election of point, and the calculating for the value that is not at war with to the node for needing not participate in leader cluster node election.Specifically, can first it sentence
Whether disconnected node is the strong node of communication capacity.The node of cellular network communication can will be used as the strong node of communication capacity,
The mobile phone node such as communicated using SIM card.Furthermore it is possible to which remaining is used into WiFi, bluetooth, Zigbee (ZigBee protocol), D2D
The node of (Device-to-Device Communication, neighbouring communication network) communication is used as the weak node of communication capacity.
The differentiation of the communication capacity power carried out above in relation to node, mainly distance according to its communication are divided.For example, hand
Machine can be connected to the base station outside km by Cellular Networks, however, tablet personal computer by WiFi can only connect to 30 meters it
Interior router.Obviously, the communication capacity of mobile phone will be far longer than the communication capacity of tablet personal computer.According to decision node whether be
The judged result of the strong node of communication capacity, determines the strong node of the communication capacity included in target area.Then, it can be determined that
Whether the strong node of these communication capacities has set up the connection with base station.If, it is determined that set up the section being connected with base station
Point participates in the election of leader cluster node.
Then, the competition value for the node that leader cluster node election is participated in target area is calculated.Specifically, node can be passed through
Signal bonding strength, node link information with base station carry out the competition value of calculate node.Wherein, node and the signal of base station are connected
The strength information that intensity can be sent by direct receiving node is obtained.Node link information includes Connected degree, load greatly
Small, residue energy of node, node remaining bandwidth, node life span.Wherein, Connected degree can be the surrounding neighbours section of this section point
One hop node number of point.Residue energy of node, node remaining bandwidth can be obtained directly from node.Node life span is represented
Mobile node time present in this target area.It can determine that node is in by the positional information of node first
Position in target area, the movement velocity further according to node determines that joint movements are node life the time required to going out target area
Deposit the time.The calculation formula of load can be shown in formula 7：
Wherein, Δ t is time of measuring, QmaxIt is the data queue head transmitted the need for maximum in the interior joint i of target area
Degree, Qavg(t) it is the data average queue size transmitted the need for t- Δ t to t time region of interest within interior joints i.
Can be with come the method for the competition value of calculate node by node and the signal bonding strength of base station, node link information
See formula 8：
Wherein, N is the interstitial content for participating in leader cluster node election, pjIt is the Connected degree, negative that node link information includes
Size, residue energy of node, node remaining bandwidth, the normalized value of each parameter of node life span are carried, w represents each parameter pair
The weight answered.Wherein, different parameters and its weight can be determined according to different application environments.
Alternatively, the node in target area can also send the network topological diagram of itself and surrounding neighbours node to base
Stand.Node and the network topological diagram of surrounding neighbours node that base station can be in target area obtain the net in whole target house
Network topological diagram.
Alternatively, the method for election leader cluster node can be as follows.As shown in figure 3, step S130 can include：Step
S310, is ranked up to the node in target area from large to small according to the competition value of the node in target area；Step S320,
Election comes the node of top N as leader cluster node, wherein, N is leader cluster node number.
In force, as shown in Fig. 2 for example, target area is region 6, according to the competition value of each node in region 6 by big
Each node is ranked up to small, ranking results are：Node C, node E, node F, node A, node D, node B.Leader cluster node
Number is 2, then can elect the node C and node E that come first 2 as leader cluster node.
Alternatively, after election finishes leader cluster node, for example, connect row, can by the node A around leader cluster node C and
Node B can regard the node D and node F around leader cluster node E as its bunch member node as its bunch member node.Or,
Sub-clustering can also be carried out according to the size of data of other node-node transmissions in addition to leader cluster node.For example, node A is TV, node B
It is that temperature sensor, node D are that computer, node F are humidity sensors.It can be generally considered as the number that TV, computer need to transmit
Big according to amount, temperature sensor, humidity sensor need the data volume transmitted small.It therefore, it can the data volume transmitted as needed,
The big node of data volume is separated, with avoid they simultaneously in a cluster, leader cluster node can not effectively handle cluster intra-cluster into
The data of member's node.For example, can be using the TV and temperature sensor around leader cluster node C as its bunch member node, can be with
It regard the computer and humidity sensor around leader cluster node E as its bunch member node.It is, of course, also possible to be entered by the algorithm of reservation
Row sub-clustering.Finally, after election finishes leader cluster node and determines which bunch member node finishes which leader cluster node carries, base
Stand and election results and sub-clustering result are issued to the node of each participation leader cluster node election.Unsuccessful node can disconnect and base station
Connection, then be connected with its leader cluster node.The node of elected leader cluster node can notify its bunch member node to be set up with oneself
Connection.
Alternatively, optimal node can also be continuously updated as leader cluster node.Correspondingly, it is complete in election leader cluster node
Bi Hou, when having detected in new node addition target area, the method that the present embodiment is provided also includes：According in target area
The competition value of new node and leader cluster node, election comes the node of top N as cluster head in new node and leader cluster node
Node, wherein, N is leader cluster node number.
In force, open and when in the LAN that is added in family when detecting new node, new section can be calculated
The competition value of point, according to the competition value of new node in target area and each leader cluster node, in new node and each leader cluster node
It is middle to elect the node for coming top N as leader cluster node.
Alternatively, in addition to method of the optimal node of above-mentioned renewal as leader cluster node, another renewal can also be provided
Optimal node as leader cluster node method.After every time T by reservation, all recalculate in a target area
The competition value of node, and the election of leader cluster node is carried out according to new competition value again.
After election finishes leader cluster node and completes sub-clustering, as shown in Figure 4, so that it may to set up a complete network.
Wherein, base station can be connected with leader cluster node, and leader cluster node can be connected with its bunch member node.Can also between leader cluster node
Communicated.
Alternatively, after election finishes leader cluster node and completes sub-clustering, base station can open up the network in whole target house
Flutter figure and be sent to each node, each node can calculate routing table according to the network topological diagram in whole target house.If node is
Communicated inside LAN in the family, then each node can be determined how by table of query and routing saves data from source
Point is sent to destination node.It should be noted that in LAN in the family, except the cluster that can be joined directly together with leader cluster node
Outside member node, also there are the two grades of bunch member nodes that directly can not be joined directly together with leader cluster node, they are needed by them
Between communication and transmit data with the communication between the bunch member node that can be joined directly together with leader cluster node.Therefore,
A plurality of path is there may be between source node to destination node.
Alternatively, as shown in figure 5, the data for needing to transmit can be cut into three parts, and entered by three preferred paths
Row data transfer.For any node in transmission, when the node receives any data bag, it can be determined that oneself be
Destination node, if then untiing the packet, if not it is to receive the packet for the first time then to judge whether.If for the first time
The packet is received, then directly forwards the packet.If not being connected to the packet for the first time, then the packet the is judged
Whether the path of secondary transmission intersects with the path of first time transmission, if so, then abandoning the packet.For example, as shown in figure 5,
Packet Bag is sent to node B by source node from node A, and node B judges it is to receive packet Bag for the first time, works as source node
When packet Bag is sent into node B from node C again, node B judges it is not to receive packet Bag for the first time, then sentences
Whether intersect with the path of first time transmission in the path of disconnected second of transmission.Specifically, packet Bag is for the first time from source node hair
It is sent to node A and re-sends to node B and re-send to node D, packet Bag is to be sent to node C from source node to send out again for the second time
It is sent to node B and re-sends to node D, this two paths is intersecting, and intersection point is exactly node B, therefore can lose packet Bag
Abandon, to avoid repeating sending packet Bag to destination node, the communication resource of waste LAN.In addition, when source node is local
Net internal node, and destination node when being LAN external node, it is necessary to be forwarded the data to by the leader cluster node of source node
Base station, then destination node institute is forwarded in a network by base station.
The method provided by the present embodiment, according to the area attribute information of target area, determines that target area is corresponding
Leader cluster node number, determines what is obtained, for not homotype during this leader cluster node number according to the area attribute information of target area
The target area enclosed, with different zones attribute, then area attribute information is also all not quite similar, and then the cluster head section that determination is obtained
It is also to change according to target area attribute to count out, and the leader cluster node number of dynamic change is compared to fixed leader cluster node
Number is more suitable for the target area of different range.
Disclosure further example embodiment provides a kind of device of election leader cluster node, as shown in fig. 6, the device bag
Include：
Node determining module 610, for target area in the positional information and target house according to target house interior joint
Scope, determine the node included in the target area；
Number determining module 620, for the area attribute information according to the target area, determines the target area pair
The leader cluster node number answered；
First election module 630, for the competition value of the node in the target area, in the target area
Node in elect the leader cluster node of the leader cluster node number.
Alternatively, the area attribute information of the target area includes interstitial content, the maximal side of the target area
And the node in the target area is to the average distance of base station.
Alternatively, the target area is a room in the target house.
Alternatively, as shown in fig. 7, the first election module 630 includes：
Sequencing unit 731, for the competition value according to the node in the target area from large to small to the target area
Node in domain is ranked up；
Unit 732 is elected, the node of top N is come for electing as leader cluster node, wherein, N is the leader cluster node
Number.
Alternatively, after described device election leader cluster node is finished, the target area is added when having detected new node
When middle, described device also includes：
Second election module, for the competition value according to new node in the target area and leader cluster node, described
The node for coming top N is elected in new node and the leader cluster node as leader cluster node, wherein, N is the leader cluster node
Number.
On the device in above-described embodiment, wherein modules perform the concrete mode of operation in relevant this method
Embodiment in be described in detail, explanation will be not set forth in detail herein.
The method provided by the present embodiment, according to the area attribute information of target area, determines that target area is corresponding
Leader cluster node number, determines what is obtained, for not homotype during this leader cluster node number according to the area attribute information of target area
The target area enclosed, with different zones attribute, then area attribute information is also all not quite similar, and then the cluster head section that determination is obtained
It is also to change according to target area attribute to count out, and the leader cluster node number of dynamic change is compared to fixed leader cluster node
Number is more suitable for the target area of different range.
It should be noted that：Above-described embodiment provide election leader cluster node method elect leader cluster node when, only with
The division progress of above-mentioned each functional module is for example, in practical application, as needed can distribute above-mentioned functions by not
Same functional module is completed, i.e., the internal structure of base station is divided into different functional modules, to complete whole described above
Or partial function.In addition, the method for the device and election leader cluster node for the election leader cluster node that above-described embodiment is provided is implemented
Example belongs to same design, and it implements process and refers to embodiment of the method, repeats no more here.
The another exemplary embodiment of the disclosure shows a kind of structural representation of base station.
Reference picture 8, base station 900 can include following one or more assemblies：Processing assembly 902, memory 904, power supply
Component 906, the interface 912 of input/output (I/O), sensor cluster 914, and communication component 916.
The integrated operation of the usual control base station 900 of processing assembly 902, such as with display, call, data communication, phase
Machine operates the operation associated with record operation.Treatment element 902 can refer to including one or more processors 920 to perform
Order, to complete all or part of step of above-mentioned method.In addition, processing assembly 902 can include one or more modules, just
Interaction between processing assembly 902 and other assemblies.
Memory 904 is configured as storing various types of data supporting the operation in base station 900.These data are shown
Example includes the instruction of any application program or method for being operated on base station 900, and contact data, telephone book data disappears
Breath, picture, video etc..Memory 904 can be by any kind of volatibility or non-volatile memory device or their group
Close and realize, such as static RAM (SRAM), Electrically Erasable Read Only Memory (EEPROM) is erasable to compile
Journey read-only storage (EPROM), programmable read only memory (PROM), read-only storage (ROM), magnetic memory, flash
Device, disk or CD.
Electric power assembly 906 provides electric power for the various assemblies of base station 900.Electric power assembly 906 can include power management system
System, one or more power supplys, and other components associated with generating, managing and distributing electric power for audio output apparatus 900.
I/O interfaces 912 is provide interface between processing assembly 902 and peripheral interface module, above-mentioned peripheral interface module can
To be keyboard, click wheel, button etc..These buttons may include but be not limited to：Home button, volume button, start button and lock
Determine button.
Sensor cluster 914 includes one or more sensors, and the state for providing various aspects for base station 900 is commented
Estimate.Sensor cluster 914 can include proximity transducer, be configured in not any physical contact thing near detection
The presence of body.
Communication component 916 is configured to facilitate the communication of wired or wireless way between base station 900 and other equipment.Base station
900 can access the wireless network based on communication standard, such as WiFi, 2G or 3G, or combinations thereof.In an exemplary implementation
In example, communication component 916 receives broadcast singal or broadcast related information from external broadcasting management system via broadcast channel.
In one exemplary embodiment, the communication component 916 also includes near-field communication (NFC) module, to promote junction service.Example
Such as, NFC module can be based on radio frequency identification (RFID) technology, Infrared Data Association (IrDA) technology, ultra wide band (UWB) technology,
Bluetooth (BT) technology and other technologies are realized.
In the exemplary embodiment, base station 900 can be believed by one or more application specific integrated circuits (ASIC), numeral
Number processor (DSP), digital signal processing appts (DSPD), PLD (PLD), field programmable gate array
(FPGA), controller, microcontroller, microprocessor or other electronic components are realized, for performing the above method.
In the exemplary embodiment, additionally provide a kind of including calculation machine readable storage medium storing program for executing, such as storage including instruction
Device 904, above-mentioned instruction can be performed to complete the above method by the processor 920 of terminal 900.Computer-readable deposited for example, described
Storage media can be ROM, random access memory (RAM), CD-ROM, tape, floppy disk and optical data storage devices etc..
The another embodiment of the disclosure provides a kind of computer-readable recording medium, the instruction in the storage medium
By the computing device of terminal when so that terminal is able to carry out：
According to the scope of target area in the positional information of target house interior joint and the target house, the mesh is determined
Each node included in mark region；
According to the area attribute information of the target area, the corresponding leader cluster node number in the target area is determined；
The cluster head is elected in the competition value of node in the target area, the node in the target area
The leader cluster node of interstitial content.
Alternatively, the area attribute information of the target area includes interstitial content, the maximal side of the target area
And the node in the target area is to the average distance of base station.
Alternatively, the target area is a room in the target house.
Alternatively, elected in the competition value of the node in the target area, the node in the target area
The leader cluster node of the leader cluster node number, including：
The node in the target area is arranged from large to small according to the competition value of the node in the target area
Sequence；
Election comes the node of top N as leader cluster node, wherein, N is the leader cluster node number.
Alternatively, it is described when having detected in the new node addition target area after election leader cluster node is finished
Method also includes：
According to the competition value of new node in the target area and leader cluster node, in the new node and the cluster head
The node for coming top N is elected in node as leader cluster node, wherein, N is the leader cluster node number.
Those skilled in the art will readily occur to its of the disclosure after considering specification and putting into practice disclosure disclosed herein
Its embodiment.The application is intended to any modification, purposes or the adaptations of the disclosure, these modifications, purposes or
Person's adaptations follow the general principle of the disclosure and including the undocumented common knowledge in the art of the disclosure
Or conventional techniques.Description and embodiments are considered only as exemplary, and the true scope of the disclosure and spirit are by following
Claim is pointed out.
It should be appreciated that the precision architecture that the disclosure is not limited to be described above and is shown in the drawings, and
And various modifications and changes can be being carried out without departing from the scope.The scope of the present disclosure is only limited by appended claim.
Claims (10)
1. a kind of method for electing leader cluster node, it is characterised in that methods described includes：
According to the scope of target area in the positional information of target house interior joint and the target house, the target area is determined
The node included in domain；
According to the area attribute information of the target area, the corresponding leader cluster node number in the target area is determined；
The leader cluster node is elected in the competition value of node in the target area, the node in the target area
The leader cluster node of number.
2. according to the method described in claim 1, it is characterised in that the area attribute information of the target area includes the mesh
The node in interstitial content, maximal side and the target area in region is marked to the average distance of base station.
3. according to the method described in claim 1, it is characterised in that the target area is a room in the target house
Between.
4. according to the method described in claim 1, it is characterised in that the competition value of the node in the target area, exist
The leader cluster node of the leader cluster node number is elected in node in the target area, including：
The node in the target area is ranked up from large to small according to the competition value of the node in the target area；
Election comes the node of top N as leader cluster node, wherein, N is the leader cluster node number.
5. according to the method described in claim 1, it is characterised in that after election leader cluster node is finished, when having detected new section
When point is added in the target area, methods described also includes：
According to the competition value of new node in the target area and leader cluster node, in the new node and the leader cluster node
It is middle to elect the node for coming top N as leader cluster node, wherein, N is the leader cluster node number.
6. a kind of device of election leader cluster node, it is characterised in that described device includes：
Node determining module, the model for target area in the positional information according to target house interior joint and the target house
Enclose, determine the node included in the target area；
Number determining module, for the area attribute information according to the target area, determines the corresponding cluster in the target area
Cephalomere is counted out；
First election module, for the competition value of the node in the target area, in the node of the target area
Elect the leader cluster node of the leader cluster node number.
7. device according to claim 6, it is characterised in that the area attribute information of the target area includes the mesh
The node in interstitial content, maximal side and the target area in region is marked to the average distance of base station.
8. device according to claim 6, it is characterised in that the target area is a room in the target house
Between.
9. a kind of terminal, it is characterised in that the terminal includes being stored with least one in processor and memory, the memory
Bar instruction, at least one section program, code set or instruction set, at least one instruction, at least one section program, the code
Collection or instruction set loaded as the processor and performed with realize as claim 1-5 it is any as described in elect leader cluster node side
Method.
10. a kind of computer-readable recording medium, it is characterised in that at least one instruction that is stored with the storage medium, extremely
Few one section of program, code set or instruction set, at least one instruction, at least one section program, the code set or instruction
Collection load as processor and is performed with realize claim 1-5 it is any as described in elect leader cluster node method.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710471798.1A CN107071849B (en) | 2017-06-20 | 2017-06-20 | Method and device for electing cluster head node |
| PCT/CN2017/104997 WO2018233139A1 (en) | 2017-06-20 | 2017-09-30 | Method, base station, and storage medium for selecting cluster head node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710471798.1A CN107071849B (en) | 2017-06-20 | 2017-06-20 | Method and device for electing cluster head node |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107071849A true CN107071849A (en) | 2017-08-18 |
| CN107071849B CN107071849B (en) | 2020-08-04 |
Family
ID=59594429
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710471798.1A Expired - Fee Related CN107071849B (en) | 2017-06-20 | 2017-06-20 | Method and device for electing cluster head node |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN107071849B (en) |
| WO (1) | WO2018233139A1 (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018233139A1 (en) * | 2017-06-20 | 2018-12-27 | 海信集团有限公司 | Method, base station, and storage medium for selecting cluster head node |
| CN111586789A (en) * | 2020-05-19 | 2020-08-25 | 北京理工大学 | Data transmission method and device, computer equipment and storage medium |
| CN113588001A (en) * | 2021-08-12 | 2021-11-02 | 上海宏英智能科技股份有限公司 | Engineering machine tool state monitoring system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101729331A (en) * | 2008-10-28 | 2010-06-09 | 华为技术有限公司 | Clustering method and device, routing method and device of cluster head and base station |
| CN102036308A (en) * | 2010-12-09 | 2011-04-27 | 江南大学 | Energy balancing wireless sensor network clustering method |
| CN103826282A (en) * | 2014-02-24 | 2014-05-28 | 南昌大学 | Set partitioning multi-hop routing method based on dump energy |
| WO2014180261A1 (en) * | 2013-05-08 | 2014-11-13 | 索尼公司 | Network management apparatus, method and apparatus in wireless communication system |
| CN105704775A (en) * | 2016-01-13 | 2016-06-22 | 湖南工业大学 | Improved low energy adaptive clustering hierarchy (LEACH) method |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102176149A (en) * | 2011-02-24 | 2011-09-07 | 浙江工业大学 | Intelligent building energy consumption monitoring system based on wireless sensor network |
| CN102695190B (en) * | 2012-05-16 | 2014-10-29 | 东南大学 | Data acquisition method in wireless sensor network |
| CN107071849B (en) * | 2017-06-20 | 2020-08-04 | 海信集团有限公司 | Method and device for electing cluster head node |
-
2017
- 2017-06-20 CN CN201710471798.1A patent/CN107071849B/en not_active Expired - Fee Related
- 2017-09-30 WO PCT/CN2017/104997 patent/WO2018233139A1/en active Application Filing
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101729331A (en) * | 2008-10-28 | 2010-06-09 | 华为技术有限公司 | Clustering method and device, routing method and device of cluster head and base station |
| CN102036308A (en) * | 2010-12-09 | 2011-04-27 | 江南大学 | Energy balancing wireless sensor network clustering method |
| WO2014180261A1 (en) * | 2013-05-08 | 2014-11-13 | 索尼公司 | Network management apparatus, method and apparatus in wireless communication system |
| CN103826282A (en) * | 2014-02-24 | 2014-05-28 | 南昌大学 | Set partitioning multi-hop routing method based on dump energy |
| CN105704775A (en) * | 2016-01-13 | 2016-06-22 | 湖南工业大学 | Improved low energy adaptive clustering hierarchy (LEACH) method |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018233139A1 (en) * | 2017-06-20 | 2018-12-27 | 海信集团有限公司 | Method, base station, and storage medium for selecting cluster head node |
| CN111586789A (en) * | 2020-05-19 | 2020-08-25 | 北京理工大学 | Data transmission method and device, computer equipment and storage medium |
| CN113588001A (en) * | 2021-08-12 | 2021-11-02 | 上海宏英智能科技股份有限公司 | Engineering machine tool state monitoring system |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2018233139A1 (en) | 2018-12-27 |
| CN107071849B (en) | 2020-08-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105190348B (en) | System and method for sharing contextual information in neighborhood aware network | |
| Wang et al. | Social overlapping community-aware neighbor discovery for D2D communications | |
| US9094884B2 (en) | Method and apparatus for video communication | |
| CN107071849A (en) | A kind of method and apparatus for electing leader cluster node | |
| CN110139337A (en) | A kind of selection method and equipment of relay node | |
| JP6336732B2 (en) | COMMUNICATION SYSTEM, COMMUNICATION DEVICE, PROGRAM, AND COMMUNICATION METHOD | |
| CN105636143A (en) | Wireless sensor network clustering collaborative routing algorithm based on cooperative game | |
| CN107113564A (en) | Message processing device, information processing method and non-transitory computer-readable medium | |
| CN103477608A (en) | Sensor network information collection via mobile gateway | |
| CN103415069A (en) | Mobile node positioning algorithm based on integration of sensor network and cellular network | |
| CN107295533A (en) | A kind of method and apparatus for electing leader cluster node | |
| US10383134B2 (en) | Information processing device, information processing method and program | |
| JP2017216682A (en) | Radio network establishment method, device, and terminal apparatus | |
| CN106664296A (en) | Seamless peer to peer internet connectivity | |
| JP2010045525A (en) | Autonomous group construction method in wireless ad-hoc network, and data distribution method and data collection method using the same | |
| CN101160870A (en) | Method and device of completing sensor network task | |
| CN106455055A (en) | Method for determining gateway and terminal | |
| CN106204096A (en) | Send the method and device of equipment recommendation information | |
| JP2017175619A (en) | Auxiliary device for constructing radio network, mobile terminal and radio network construction method | |
| US20190281444A1 (en) | Wireless communication apparatus, communication system and wireless communication apparatus control method to exchange services | |
| CN107801226A (en) | Based on node society similitude and the central data forwarding method of individual and device | |
| CN106488531A (en) | A kind of method of quick connection WLAN | |
| CN106255167B (en) | Wireless sensor network based on low-power consumption lossy network routing protocol | |
| CN106102133A (en) | A kind of realization method and system of dynamic wireless network based on mobile terminal | |
| CN106954245B (en) | Data transmission method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200804 |