CN102685808A - Distribution type clustering method based on power control - Google Patents
Distribution type clustering method based on power control Download PDFInfo
- Publication number
- CN102685808A CN102685808A CN2012101553898A CN201210155389A CN102685808A CN 102685808 A CN102685808 A CN 102685808A CN 2012101553898 A CN2012101553898 A CN 2012101553898A CN 201210155389 A CN201210155389 A CN 201210155389A CN 102685808 A CN102685808 A CN 102685808A
- Authority
- CN
- China
- Prior art keywords
- bunch
- node
- head
- broadcast
- member node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- Y02B60/50—
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a distribution type clustering method based on power control and provides a novel a distribution type clustering method which combines three aspects including power detection, node connection degree and density estimating parameters. The method guarantees cluster number reasonability, cluster head selection reasonability, and the uniformity of cluster distances and quantity of members in clusters, so that the system delaying is reasonably reduced, the node quantity of the members of a large part of the clusters is relatively uniform, a management load of the cluster head of each cluster is balanced, the energy consumption is reduced and the life cycle of the whole system is prolonged. Meanwhile, the problem of an interference node ratio is considered and the ratio of an interference node is further reduced, so that not only can the energy consumption be further reduced, but also the quantity of the interfered node in the system is greatly reduced; and therefore, a communication process based on the clusters of a virtual MIMO (Multiple Input Multiple Output) system is greatly reduced, the possibility of interfering the node by a wireless signal is reduced, and the performance of the virtual MIMO system is effectively improved.
Description
Technical field
The invention belongs to wireless communication technology field, more specifically, a kind of distributed method that clusters based on power control in the transmission technology is worked in coordination with in the self-organizing that relates to virtual MIMO system.
Background technology
Along with the continuous development of mobile communication technology, and people have higher requirement to the message transmission rate of wireless communication system to the ever-increasing demand of wireless mobile multi-media service.
MIMO (Multiple-Input Multiple-Output) technology can provide the power system capacity of better space diversity and Geng Gao; And can significantly improve the performance of system; Therefore the MIMO technology receives much concern, and becomes the key technology of next generation communication system.MIMO specification requirement portable terminal adopts many antennas, but the development trend of modern portable terminal is the miniaturization at terminal, is subject to portable terminal size and hard-wired level, can not be at the terminal integrated many antennas.Portable terminal still is a single antenna at present, and in order to give full play to the advantage of MIMO technology, people have proposed virtual MIMO technology.
In the wireless network based on the self-organizing multi-hop, applying virtual MIMO technology can significantly improve power system capacity, and it can satisfy a plurality of independent channel conditions of mimo system better, overcomes the harsh requirement of mimo system to terminal antenna quantity simultaneously.The basic thought of virtual MIMO technology is based on the terminal and clusters and form the virtual antenna array sub-district relay communication of cooperating.Therefore it is extremely important to design a kind of rational relay user bunch division (promptly clustering) mechanism.At home and abroad research is scarcely out of swaddling-clothes to virtual MIMO technology at present, and still relates to very few for the Study on Mechanism that clusters.Yet in Ad Hoc network research field, existing multiple sub-clustering algorithm clusters in the similar virtual MIMO system.But, can not indiscriminately imitate sub-clustering thought in the Ad Hoc network in view of the basic thought of virtual MIMO technology.
Sub-clustering algorithm in the Ad Hoc network mainly comprises minimum ID algorithm, maximum connection degree algorithm, general combined weighted sub-clustering algorithm, responsive sub-clustering algorithm and the passive sub-clustering algorithm of mobility.The novel sub-clustering algorithm that present some that are proposed are used for Ad Hoc network all is based on the improvement algorithm of above-mentioned sub-clustering algorithm.Yet; In the research process of above-mentioned sub-clustering algorithm, find, these algorithms only proposed bunch head formation, bunch formation theory and thought, only list framework and general steps; But do not provide implementation detail, and receive interfering nodes ratio problem of higher after having ignored bunch formation.The interfering nodes ratio that the sub-clustering algorithm more than mentioned produces is all very high, have in addition reach more than 50%.The too high meeting of the ratio of interfering nodes in system reduces the performance of system greatly, and causes information to be correctly validated and cause communication failure, has therefore reduced the success rate of transfer of data.
Summary of the invention
The objective of the invention is to overcome the deficiency of prior art, a kind of distributed method that clusters based on power control is provided,, improve the performance of virtual MIMO system to reduce the ratio of interfering nodes.
For realizing the foregoing invention purpose, the present invention is based on the distributed method that clusters of power control, it is characterized in that, may further comprise the steps:
(1), in given zone, each node all has one's own unique ID sign, all nodes are all known node sum N, and draw a bunch total desired value N according to node sum N
Ch, N
Ch≈ N
1/2, N
ChAlso be single bunch bunch of interior nodes sum desired value;
Each node is all with constant power P
0Broadcasting comprises the message of this node ID;
(2), the broadcast singal power P that receives of each node detection
Ij, wherein, i representes local node, i.e. receiving node ID, and j representes neighbor node, i.e. broadcast node ID;
If receiving node is near more apart from broadcast node, it is strong more to receive signal, the broadcast singal power P
IjBig more, on the contrary then more a little less than, the broadcast singal power P
IjMore little; Receiving node is through the broadcast singal power P
IjDistance parameter l between estimation and the broadcast node
Ij, and to each distance parameter summation ∑ l
Ij, add up the broadcast quantity that receives simultaneously, promptly neighbours count d
i, neighbor node ID and distance parameter l
Ij, and set up neighbor table according to this, the record above-mentioned parameter;
(3), each node neighbours of broadcasting oneself for the second time count d
iWith local node ID, each node receives the secondary broadcast from different broadcast nodes then, and the neighbours of each neighbor node are counted d
IjSummation D
i=∑ d
Ij, and calculate primary cluster head contention parameter α
i=∑ l
Ij/ (d
i* D
i) and a second cluster contention parameter β
i=∑ l
Ij/ d
i
(4), each node is broadcasted the primary cluster head contention parameter α of oneself for the third time
iWith local node ID; Each node receives the broadcast message from different broadcast nodes; Neighbours count d if this node satisfies condition
i>[N
Ch/ 2], [] expression rounds downwards, then compares the primary cluster head contention parameter a in each broadcast message
jWith the primary cluster head contention parameter α of oneself
i, and the node of selecting tuftlet contention parameter is as primary election bunch head, and the ID of primary election bunch head broadcasts away, if but the primary cluster head contention parameter a of oneself
iMinimum then need not broadcasted, and directly self-defined oneself is primary election bunch head; If neighbours count d
i≤[N
Ch/ 2], then do not do any operation;
(5) if certain node receives the broadcast that comprises a primary election bunch ID, and the ID in the broadcast conforms to local node ID, and then this node is defined as primary election bunch head;
(6), primary election bunch head broadcasting comprises a local node ID and a second cluster contention parameter β
iMessage; If there is primary election bunch head to receive broadcast, then compare the second cluster contention parameter β in this broadcast from other primary election bunch head
jWith the second cluster contention parameter β of oneself
iIn case, the second cluster of oneself a contention parameter β
iNot minimum, then abandon a bunch identity automatically;
(7), primary election bunch head begins to add up the quantity that receives interfering nodes in the local node one jumping scope; Receiving interfering nodes is the node that is in two or more bunches overlay area simultaneously; Method is: primary election bunch head is selected a number of sub-carrier at random; Broadcasting statistics solicited message if certain node receives two or more statistics solicited messages from different primary election bunch head, perhaps receives a broadcast singal that causes broadcast type to discern through aliasing; Then think oneself as and receive interfering nodes, the affirmation information that comprises own ID is replied in broadcasting;
Primary election bunch head is added up from the affirmation information of different nodes and is write down its quantity, if confirmation quantity is more than or equal to [d
i/ 2], [] expression rounds downwards, then abandons a bunch identity automatically and gets into wait state, otherwise then be defined as formal bunch of head, is called for short bunch head;
(8) if the neighbours of bunch head count d
i≤N
Ch-1, then all neighbor nodes all are defined as the primary election member node, if the neighbours of bunch head count d
i>N
Ch-1, then bunch head is according to neighbor table, according to distance parameter l
IjAscending selective sequential N
Ch-1 neighbor node is as the primary election member node of this bunch;
After bunch head was confirmed the primary election member node, bunch head was according to distance parameter l
IjJudge primary election member node farthest, simultaneously with reference to corresponding distance parameter l
IjReduce transmitting power, so that only can cover primary election member node farthest, and send the broadcast announcement message that comprises a bunch ID with this power; Receive the primary election member node of this type of broadcast, ifndef is the member node of other bunches, then is defined as member node, and a bunch ID that will receive simultaneously is as an affiliated bunch of ID; Member node is also according to broadcast singal power P own and bunch head
IjReduce transmitting power, a bunch head gets final product under guaranteeing only to cover, and send acknowledge message to affiliated bunch of hair;
After bunch head is received the affirmation message of member node, with the primary election member node of having sent acknowledge message as member node.
The objective of the invention is to realize like this:
The present invention proposes a kind of combination power detection, node connectivity (being neighbours' numbers) and density Estimation parameter (is primary cluster head contention parameter α
iAn and second cluster contention parameter β
i) new distribution type of three aspects method that clusters; Guaranteed number of clusters order reasonability, bunch head select reasonability, bunch spacing and bunch in the uniformity of number of members; So reasonable minimizing system delay can make most of bunch member node quantity even relatively, the administrative loads of each bunch of balance bunch head; Reduce energy consumption, prolonged the life cycle of whole system.Also considered the problem of interfering nodes ratio simultaneously; And further reduced the ratio of interfering nodes through the method for power control; Not only can further reduce energy consumption, can also significantly reduce the quantity that receives interfering nodes in the system, therefore reduce significantly virtual MIMO system based on bunch communication process in; Node receives the probability that wireless signal disturbs, and effectively improves the performance of virtual MIMO system.
Description of drawings
Fig. 1 is the sketch map that clusters that the present invention is based on the distributed method that clusters of power control;
Fig. 2 is a kind of embodiment flow chart of the distributed method that clusters that the present invention is based on power control.
Fig. 3 is node connectivity d among the present invention
iAnd distance estimations parameter l
IjSketch map;
Fig. 4 calculates sketch map for Di among the present invention.
Fig. 5 is for selecting member's node process sketch map under a bunch di≤NCH-1 situation among the present invention.
Fig. 6 is for selecting member's node process sketch map under a bunch di＞NCH-1 situation among the present invention.
Fig. 7 receives interfering nodes redistribution process sketch map for adjacent cluster member node among the present invention differs more than two.
Fig. 8 receives interfering nodes redistribution process sketch map for adjacent cluster member node among the present invention only differs one.
Fig. 9 is a bunch transfer process sketch map among the present invention.
Embodiment
Describe below in conjunction with the accompanying drawing specific embodiments of the invention, so that those skilled in the art understands the present invention better.What need point out especially is that in the following description, when perhaps the detailed description of known function and design can desalinate main contents of the present invention, these were described in here and will be left in the basket.
Fig. 1 is the sketch map that clusters that the present invention is based on the distributed method that clusters of power control.
The given area is a rectangular area, and N the node that in the rectangular area, evenly distribute at random is shown in (a) among Fig. 1.The purpose that clusters is that this N node is divided into some bunches, require that the number of clusters order is suitable, bunch interior nodes number suitable, the number of nodes in each bunch relatively evenly, bunch between centre distance evenly, reduced to by the interfering nodes ratio minimum, shown in (b) among Fig. 1.
Each node all has unique ID sign, and each node when initial all with constant power P
0Message, each node are in the process of clustering, and transmitting power can be regulated as required.Each node has been learnt rectangular area interior nodes sum N, and possesses the signal power measuring ability, can detect the reception signal strength signal intensity.
Fig. 2 is a kind of embodiment flow chart of the distributed method that clusters that the present invention is based on power control.
Step 201: each node is according to node sum N, all compute cluster sum desired value N
ChBunch total desired value N
ChIt also is the desired value of single bunch bunch of interior nodes number.The implication of this desired value is that under the ideal situation, the number of clusters order (or a bunch internal segment is counted) that clusters after finishing equals N
Ch, approach N under the non-ideality
ChN in the present invention
Ch≈ N
1/2, i.e. N
ChBut get root near the evolution integer of node sum N.
For example during node sum N=40, but be 36 apart from 40 nearest evolution integers, so N
Ch=6.
For example during node sum N=50, but be 49 apart from 50 nearest evolution integers, so N
Ch=7.
In Fig. 1 (a), the node number that distributes in the rectangular area is 46, so NCH=7.Cluster accomplish after like Fig. 1 (b), bunch add up to 6.Bunch mean value that internal segment is counted is 8 behind the round, and both all approach N
Ch
Step 202: each node calculates N
ChAfter, all select different carrier frequency and time slot, with constant power P
0Broadcasting comprises the message (physical layer neighbor discovery mechanisms) of local node ID.The implication of this broadcast is that each node is informed the ID of all neighbor nodes oneself in the jumping scope, also can learn the ID of all neighbor nodes in the jumping scope.
Step 203: each node receives the broadcast singal from different neighbor nodes, earlier the broadcast singal that receives is carried out power measurement, obtains receiving the broadcast singal power P of signal
Ij, wherein, i representes local node, i.e. receiving node ID, and j representes neighbor node, i.e. broadcast node ID.
Total at present embodiment, if certain node is repeatedly received the identical broadcasts information that same neighbor node sends, then the repeated detection result is averaged and obtain the broadcast singal power P
IjIf receiving node is near more apart from broadcast node, the signal strength signal intensity that receives is high more, P
IjBig more, on the contrary P
IjMore little.Can parse the neighbor node ID in the respective broadcast information with posterior nodal point, and statistics is from the broadcast message quantity of different neighbor nodes, i.e. neighbours' number is also referred to as the connection degree d of node i
i
Connection degree d
iStatistics as shown in Figure 3, for example: the Initial Trans of node ID 1 is constant power P
0, corresponding covering radius is r
0, the overlay area is with r
0Disc for radius.Each node Initial Trans is constant power P
0, covering radius then is r
0If node ID 1 can cover node ID 2, node ID 1 also must be in the overlay area of node ID 2 so.Therefore, node ID 1 can be received the broadcast message of local node overlay area interior nodes ID2 node ID 7, its connection degree d
ID1=6.In like manner, other node also can access connection degree d separately
i
Step 204: each node computed range estimated parameter l
Ij, l
Ij=C/P
Ij, C is a constant.The distance estimations parameter l
IjEstimated distance between expression receiving node i and certain the neighbor node j, as shown in Figure 3, it only is an estimated parameter, and is not equal to two internodal actual ranges.Each node is with the distance estimations parameter l
IjSue for peace ∑ l
Ij, for a subsequent calculations bunch contention parameter is prepared.ID, neighbours that each node connects according to neighbours count d
iWith distance parameter l
IjSet up the neighbor table of oneself.Node is when setting up neighbor table, according to distance parameter l
IjAll neighbor nodes are from the close-by examples to those far off sorted, for the selection of member node in the later step provides foundation.Come neighbor table foremost be distance own nearest neighbor node, i.e. distance parameter l
IjThe neighbor node that value is minimum, the rest may be inferred.
Step 205: when the local node connection degree of node i acquisition oneself, promptly neighbours count d
iAfter, neighbours are counted d
iBroadcast away for the second time, still carry the ID of local node in the broadcast message, so receiving node all can obtain the local node degree of connection of broadcast node ID and this broadcast node when receiving this type of broadcast message.
Step 206: each node i all receives this type of broadcast message of interior all neighbor nodes of oneself jumping scope, and the neighbours that obtained each neighbor node count d
Ij, and the neighbours of each neighbor node are counted d
IjSue for peace local D
i=∑ d
Ij, as shown in Figure 4, D
I1=∑ d
ID1j=d
ID1ID2+ d
ID1ID3+ ... + d
ID1ID7=37.
Neighbours to each neighbor node count d
IjThe purpose of summation is, estimates the node number in the node i double bounce scope roughly.D here
iThe actual value of obviously counting greater than node i double bounce scope internal segment, it only is an estimated parameter, is used for compute cluster head contention parameter.
Step 207: the D of each node statistics oneself
iAfterwards, calculate primary cluster head contention parameter α
i=β
i/ D
iWith a second cluster contention parameter β
i=∑ l
Ij/ d
iSo, α
i=∑ l
Ij/ (d
i* D
i)=(∑ (C/P
Ij))/(d
i* ∑ d
Ij).
Primary cluster head contention parameter α
iC is a constant in the calculating formula, in the present embodiment, might as well make C=1, then α
i=(∑ (1/P
Ij))/(d
i* ∑ d
Ij), wherein i is the ID of local node, j is certain the neighbor node ID in the node i one jumping scope.A second cluster contention parameter β
iNode density in the expression node i one jumping scope is a density Estimation parameter.Primary cluster head contention parameter α
iIt is rough estimate to the node density of node i double bounce scope.
Step 208: each node is broadcasted the primary cluster head contention parameter α of oneself for the third time
iWith local node ID, purpose is, makes all neighbor nodes can both obtain the primary cluster head contention parameter α of oneself
i
Step 209: after node i is sent for the third time broadcast message, judge at first that then the neighbours of oneself count d
iWhether satisfy d
i>[N
Ch/ 2], [] expression rounds downwards.If node i does not satisfy above-mentioned condition, then do not carry out ensuing bunch of head competition, get into wait state, wait for that bunch hair of competition success send broadcast announcement message.
Step 210: d if node i satisfies condition
i>[N
Ch/ 2], the primary cluster head contention parameter a in each broadcast message relatively then
jWith the primary cluster head contention parameter a of oneself
i, and the node of selecting tuftlet contention parameter is as primary election bunch head, and the ID of primary election bunch head broadcasts away; If but the primary cluster head contention parameter a of oneself
iMinimum then need not broadcasted, and directly self-defined oneself is primary election bunch head.
Step 211: if certain node receives broadcast message the 4th time, in a single day bunch ID of the primary election in the information conforms to the local node ID of oneself, then be customized for primary election bunch head, and all the 4th broadcast messages that receive after ignoring.If certain node is in the 4th broadcast message that all receive, a neither one primary election bunch ID is consistent with the ID of oneself, then gets into wait state automatically.
Said process in the neighbor node of some primary election bunch head, other primary election bunch head may occur after accomplishing.In this case, two primary election bunch hypotelorisms, the covering area overlapping part is too high, certainly will cause occurring in the system a large amount of unnecessary receipts interfering nodes.Therefore, need screen this type of primary election bunch head.
For example, in Fig. 4, node ID 1 all is defined as primary election bunch head with ID3, and the two is neighbor node each other.Therefore, need with a second cluster contention parameter β between the two
jBe reference, irrational relatively primary election bunch head is got rid of.
Screening technique: primary election bunch head broadcasting secondary challenge message, promptly the 5th broadcast message comprises a local node ID and second cluster contention parameter β in the information
iIf certain primary election bunch head is received this type of broadcast message, then with oneself a second cluster contention parameter β
iWith the second cluster contention parameter β in the broadcast message
jValue is made comparisons, if the β value of oneself is not minimum, then abandons a bunch identity, gets into wait state.If do not receive this type of any broadcast message at the appointed time, then keep a bunch identity and get into next procedure.
Step 212: the primary election bunch head through top step remains begins to add up the quantity that receives interfering nodes in the local node one jumping scope.Receiving interfering nodes is the node that is in two or more bunches overlay area simultaneously.Method is: primary election bunch head (is for example selected a number of sub-carrier at random; The OFDM technology); Broadcasting statistics solicited message (comprises two) from the statistics solicited message of different primary election bunch head if certain node receives more than two, perhaps receives a broadcast singal (under the frequency disturbed condition) that causes broadcast type to discern through aliasing; Then think oneself as and receive interfering nodes, the affirmation information that comprises own ID is replied in broadcasting.
Primary election bunch head is added up from the affirmation information of different nodes and is write down its quantity, if confirmation quantity is more than or equal to [d
i/ 2], [] expression rounds downwards, then abandons a bunch identity automatically and gets into wait state; Otherwise get into step 213;
Step 213: remaining primary election bunch head then is defined as formal bunch of head, is called for short bunch head below.These bunches head will be in the neighbor node of oneself, select some unallocated, promptly not by other bunches as member's node as member node, form one by the management of this bunch head bunch.Bunch head need be selected member node according to rule, if member node quantity is too much, then the administrative loads of bunch head is overweight, and the life cycle that causes bunch is too short, thereby reduces systematic function.Bunch head needs purpose and selects some and the rational node in position as member node.
Step 214: if the neighbours of bunch head count d
i≤N
Ch-1, then all neighbor nodes all are defined as the primary election member node.As shown in Figure 5, N
Ch=7, the neighbours of leader cluster node ID5 count d
ID5=5<n
Ch-1, therefore, all neighbor node ID3, ID14, ID22, ID39, ID46 are all as the primary election member node.
Step 215: if the neighbours of bunch head count d
i>N
Ch-1, then bunch head is according to neighbor table, according to distance parameter l
IjAscending selective sequential N
Ch-1 neighbor node is as the primary election member node of this bunch, and is as shown in Figure 6, N
Ch=7, the neighbours of leader cluster node ID5 count d
ID5=9＞N
Ch-1, therefore, according to the ascending selective sequential N of distance parameter
Ch-1, promptly 6 neighbor node ID3, ID14, ID22, ID39, ID46 are as the primary election member node of this bunch, and other neighbor nodes ID1, ID19, ID26 then abandon.
Step 216: after a bunch head was confirmed the primary election member node, bunch head was according to distance parameter l
IjJudge primary election member node farthest, simultaneously with reference to corresponding distance parameter l
IjReduce transmitting power, so that only can cover primary election member node farthest, and send the broadcast announcement message that comprises a bunch ID with this power, like Fig. 5 and shown in Figure 6, the coverage of leader cluster node ID5 is by radius r
0Be reduced to radius r
1
Receive the primary election member node of this type of broadcast, ifndef is the member node of other bunches, then is defined as member node, and a bunch ID that will receive simultaneously is as an affiliated bunch of ID; Member node is also according to broadcast singal power P own and bunch head
IjReduce transmitting power, a bunch head gets final product under guaranteeing only to cover, and like Fig. 5 and shown in Figure 6, the coverage of leader cluster node ID39 is a radius r
2, bunch head under just covering, promptly node ID 5.
Member node is also sent acknowledge message to affiliated bunch of hair, after bunch head is received the affirmation message of member node, with the primary election member node of having sent acknowledge message as member node.
Through above-mentioned steps 201 ~ 216, most bunch forms.Except bunch head with divided, promptly be confirmed as outside the node of member node, still there is a spot of node not to be allocated to any bunch of head management.At these nodes is in the unallocated node, can independently again form a small amount of rational bunch, is designated as additional bunch.
Additional bunch bunch head is arbitrated from remaining unallocated node.Replenishing bunch principle of head arbitration is in the neighbor node of unallocated node, seeks bigger unallocated node connectivity and the less node connectivity of division.Concrete grammar:
Step 218: d '>=N if unallocated node satisfies condition
Ch/ 3 and d "≤d '/2, then this unallocated node is customized for and replenishes bunch head, otherwise gets into wait state.
Step 219 ~ 224: replenish bunch head broadcasting and comprise own ID, unallocated node connectivity d ' and a second cluster contention parameter β
iMessage.Have only bunch head of replenishing to receive this type of broadcast message and just it is handled, and Record ID and unallocated node connectivity d '.Do not receive any broadcast message if replenish bunch head, then be customized for primary election bunch head, prepare to select member node from other additional bunch heads.Bunch head that replenishes of receiving broadcast message then compares unallocated node connectivity d ' of oneself and the unallocated node connectivity d ' in all broadcast messages; As long as the unallocated node connectivity d ' of oneself is not maximum, just abandon automatically replenishing a bunch identity and getting into wait state.Because each unallocated node connectivity d ' is an integer, so in comparison procedure, possibly have equal situation.If the unallocated node connectivity d ' of oneself is maximum, there is not equal situation simultaneously yet, so just be customized for primary election bunch head, prepare to select member node.If the unallocated node connectivity d ' of oneself is maximum; But the unallocated node connectivity d ' of some other additional bunch head equates with; Just represent to exist in the jumping scope conflict bunch head, just need a second cluster contention parameter β relatively more own and bunch head that conflicts this moment
iIf, a local node second cluster contention parameter β
iNot minimum, then abandon replenishing a bunch identity, get into wait state.Otherwise, be customized for primary election bunch head.After from replenish bunch head, filtering out primary election bunch head, each bunch head still selects member node to form new bunch according to step 213 ~ 216, and each node in bunch reduces transmitting power and adjusts the area of coverage.
Step 225: because the difference on the node geographical position, the member node quantity that may cause some bunch that clusters early stage is inhomogeneous, and promptly a bunch internal segment is counted and differed bigger.Between adjacent bunch; If bunch interior nodes quantity gap is excessive; Then need heavily distribute member node, member node more bunch can with some member node be allocated to adjacent member node less bunch, with maximum guarantee bunch with bunch between the member node number equate; Implementation method is: bunch head chooser carrier wave transmission at random heavily distributes broadcast message, carries the member node quantity and a bunch ID of this bunch in the information.The broadcast message of bunch bunch head under member node will inevitably be received.If certain member node is also received the broadcast message of adjacent cluster bunch head, just compare this bunch member node number and adjacent cluster member node number.Below in conjunction with Fig. 7 and Fig. 8,, set forth relatively decision rule based on different situations.
Certain member receives the heavily distribution broadcast message of this bunch bunch head, also receives the heavily distribution broadcast message of adjacent cluster bunch head, and then this member node might heavily be assigned in the adjacent cluster.The member node quantity of remembering affiliated bunch of this member node is N ', and the member node quantity of adjacent cluster is N ", both sides relation is different, and court verdict is then different.
Situation 1: if N '≤N ", this member node can heavily not distributed.
Situation 2: if N ' >=N "+2, as shown in Figure 7, then this member node directly is assigned to neighbours bunch, and promptly bunches 2.If original affiliated bunch of member node distance; Promptly bunch 1 bunch nearer (through judge member node with under bunch bunch head distance parameter l ' and with the distance parameter l of neighbours' bunch bunch head " draw); then this member node is according to the distance parameter l of neighbours' bunch bunch head " regulates transmitting power, only covers a bunch head of bunches 2 and get final product.If apart from neighbours bunch, promptly bunches 2 bunch nearer, then this member node need not adjusted transmitting power.
And then this member node is sent judgement broadcast, carries neighbours bunch, i.e. a bunch ID of bunches 2.Neighbours bunch, promptly a bunch head of bunches 2 is received the judgement broadcast, bunch ID in the information conforms to the ID of oneself, then this member node is added this bunch.Originally bunch, promptly bunch 1 bunch head receives identical judgement broadcast, if bunch ID in the information does not conform to the ID of oneself; And this member node originally was not a member node farthest, and then bunch head need not adjusted transmitting power, otherwise; One of guaranteeing to cover in the residue member node farthest gets final product the adjustment transmitting power; As shown in Figure 7, last original under bunch, promptly bunch 1 bunch head is deleted this member node from own member's tabulation.
Situation 3: if N '=N "+1, as shown in Figure 8, remember this member node to affiliated bunch, promptly the distance parameter of bunch 1 bunch of head is l ', to neighbours bunch, promptly the distance parameter of bunch 2 bunches of heads is l ".If l '≤l ", then this member node can heavily not distributed, otherwise it will be assigned to neighbours bunch.By the member node reference distance parameter redistributed is l, and " the adjustment transmitting power only covers neighbours bunch, and promptly a bunch head of bunches 2 get final product, and broadcasting adjudicates broadcast and notify neighbours bunch, i.e. bunches 2 bunch head.Neighbours bunch, promptly bunches 2 bunch head adds newcomer's node according to method identical in the situation 2, former under bunch, 1 bunch head adjustment transmitting power promptly bunch.
Step 226:, further improve systematic function in order to reduce the quantity that receives interfering nodes.After all bunch formation and process member node were heavily distributed, each bunch still need carry out once oneself's detection, judged whether to carry out bunch head and shifted.If certain bunch of member node to neighbours bunch has interference, in Fig. 9, bunch 1 pair bunch 2 member node has interference, and then this has clustered round bunch head and has shifted power.
For have bunch head shift power bunch, if, when certain member node is taken on bunch in bunch; Under the situation that does not produce new interference, can also eliminate interference to neighbours' bunch member node, and; The member node number is no less than original bunch in guaranteeing again bunch, then a bunch head is shifted so far member node to form new bunch, new bunch bunch head and member node adjustment transmitting power; Accomplish the minimum of bunch head and member node and cover each other, like bunch 1 (newly) among Fig. 9.
Implementation method: have bunch head shift power bunch; To bunch in member node send bunch head and shift a broadcast message; Comprise the ID that receives interfering nodes among a bunch ID, member node number and the neighbours bunch in the information, after member node is received this broadcast message, search for the neighbor table of oneself.If do not comprise the ID that receives interfering nodes in certain member node neighbor table, and the neighbor node number is not less than the member node number in the broadcast message, and then this member node can be taken on new bunch head.If a plurality of member node can be taken on new bunch head, then select a second cluster contention parameter β
iMinimum member node is as new bunch bunch head.Still select member node and adjustment transmitting power for new bunch according to the method for step 213 ~ 216.
Although above the illustrative embodiment of the present invention is described; So that the technical staff of present technique neck understands the present invention, but should be clear, the invention is not restricted to the scope of embodiment; To those skilled in the art; As long as various variations appended claim limit and the spirit and scope of the present invention confirmed in, these variations are conspicuous, all utilize innovation and creation that the present invention conceives all at the row of protection.
Claims (4)
1. the distributed method that clusters based on power control is characterized in that, may further comprise the steps:
Step 1: in given zone, each node all has one's own unique ID sign, and all nodes are all known node sum N, and draw a bunch total desired value N according to node sum N
Ch, N
Ch≈ N
1/2, N
ChAlso be single bunch bunch of interior nodes sum desired value;
Each node is all with constant power P
0Broadcasting comprises the message of this node ID;
Step 2: the broadcast singal power P that each node detection receives
Ij, wherein, i representes local node, i.e. receiving node ID, and j representes neighbor node, i.e. broadcast node ID;
If receiving node is near more apart from broadcast node, it is strong more to receive signal, the broadcast singal power P
IjBig more, on the contrary then more a little less than, the broadcast singal power P
IjMore little; Receiving node is through the broadcast singal power P
IjDistance parameter l between estimation and the broadcast node
Ij, and to each distance parameter summation ∑ l
Ij, add up the broadcast quantity that receives simultaneously, promptly neighbours count d
i, neighbor node ID and distance parameter l
Ij, and set up neighbor table according to this, the record above-mentioned parameter;
Step 3: the neighbours that each node is broadcasted oneself for the second time count d
iWith local node ID, each node receives the secondary broadcast from different broadcast nodes then, and the neighbours of each neighbor node are counted d
IjSummation D
i=∑ d
Ij, and calculate primary cluster head contention parameter α
i=∑ l
Ij/ (d
i* D
i) and a second cluster contention parameter β
i=∑ l
Ij/ d
i
Step 4: each node is broadcasted the primary cluster head contention parameter α of oneself for the third time
iWith local node ID; Each node receives the broadcast message from different broadcast nodes; Neighbours count d if this node satisfies condition
i>[N
Ch/ 2], [] expression rounds downwards, then compares the primary cluster head contention parameter a in each broadcast message
jWith the primary cluster head contention parameter a of oneself
i, and the node of selecting tuftlet contention parameter is as primary election bunch head, and the ID of primary election bunch head broadcasts away, if but the primary cluster head contention parameter a of oneself
iMinimum then need not broadcasted, and directly self-defined oneself is primary election bunch head; If neighbours count d
i≤[N
Ch/ 2], then do not do any operation;
Step 5: if certain node receives the broadcast that comprises a primary election bunch ID, and the ID in the broadcast conforms to local node ID, and then this node is defined as primary election bunch head;
Step 6: primary election bunch head broadcasting comprises a local node ID and a second cluster contention parameter β
iMessage; If there is primary election bunch head to receive broadcast, then compare the second cluster contention parameter β in this broadcast from other primary election bunch head
jWith the second cluster contention parameter β of oneself
iIn case, the second cluster of oneself a contention parameter β
iNot minimum, then abandon a bunch identity automatically;
Step 7: primary election bunch head begins to add up the quantity that receives interfering nodes in the local node one jumping scope; Receiving interfering nodes is the node that is in two or more bunches overlay area simultaneously; Method is: primary election bunch head is selected a number of sub-carrier at random; Broadcasting statistics solicited message if certain node receives two or more statistics solicited messages from different primary election bunch head, perhaps receives a broadcast singal that causes broadcast type to discern through aliasing; Then think oneself as and receive interfering nodes, the affirmation information that comprises own ID is replied in broadcasting;
Primary election bunch head is added up from the affirmation information of different nodes and is write down its quantity, if confirmation quantity is more than or equal to [d
i/ 2], [] expression rounds downwards, then abandons a bunch identity automatically and gets into wait state, otherwise then be defined as formal bunch of head, is called for short bunch head;
Step 8: if the neighbours of bunch head count d
i≤N
Ch-1, then all neighbor nodes all are defined as the primary election member node, if the neighbours of bunch head count d
i>N
Ch-1, then bunch head is according to neighbor table, according to distance parameter l
IjAscending selective sequential N
Ch-1 neighbor node is as the primary election member node of this bunch;
After bunch head was confirmed the primary election member node, bunch head was according to distance parameter l
IjJudge primary election member node farthest, simultaneously with reference to corresponding distance parameter l
IjReduce transmitting power, so that only can cover primary election member node farthest, and send the broadcast announcement message that comprises a bunch ID with this power; Receive the primary election member node of this type of broadcast, ifndef is the member node of other bunches, then is defined as member node, and a bunch ID that will receive simultaneously is as an affiliated bunch of ID; Member node is also according to broadcast singal power P own and bunch head
IjReduce transmitting power, a bunch head gets final product under guaranteeing only to cover, and send acknowledge message to affiliated bunch of hair;
After bunch head is received the affirmation message of member node, with the primary election member node of having sent acknowledge message as member node.
2. the distributed method that clusters based on power control according to claim 1 is characterized in that, and is further comprising the steps of:
Step 9: remaining all unallocated node broadcasts are replenished the information that clusters, and receive that the neighbor node of this broadcast message is all broadcasted the state of replying oneself: divided or unallocated;
All unallocated nodes are added up unallocated node connectivity d ' in the own neighbor node, promptly unallocated number of nodes and divided node connectivity d ", promptly divided number of nodes; Unallocated node is measured from the broadcast signal strength of other unallocated nodes and is calculated a second cluster contention parameter β according to the method for step 2 ~ 3 in receiving broadcast signal
i
Step 10: d '>=N if unallocated node satisfies condition
Ch/ 3 and d "≤d '/2, then this unallocated node is customized for and replenishes bunch head, otherwise gets into wait state;
Step 11: replenish bunch head broadcasting and comprise own ID, unallocated node connectivity d ' and a second cluster contention parameter β
iMessage;
Have only bunch head of replenishing to receive this type of broadcast message and just it is handled, and Record ID and unallocated node connectivity d '; Do not receive any broadcast message if replenish bunch head, then be customized for primary election bunch head, prepare to select member node from other additional bunch heads; Bunch head that replenishes of receiving broadcast message then compares unallocated node connectivity d ' of oneself and the unallocated node connectivity d ' in all broadcast messages; As long as the unallocated node connectivity d ' of oneself is not maximum, just abandon automatically replenishing a bunch identity and getting into wait state;
If the unallocated node connectivity d ' of oneself is maximum, there is not equal situation simultaneously yet, so just be customized for primary election bunch head, prepare to select member node; If the unallocated node connectivity d ' of oneself is maximum, but the unallocated node connectivity d ' of some other additional bunch head equates with, then compares a second cluster contention parameter β of own and bunch head that conflicts
iIf, a local node second cluster contention parameter β
iNot minimum, then abandon replenishing a bunch identity, get into wait state; Otherwise, be customized for primary election bunch head;
After from replenish bunch head, filtering out primary election bunch head, each bunch head still selects member node to form new bunch according to step 7 ~ 8, and each node in bunch reduces transmitting power and adjusts the area of coverage.
3. the distributed method that clusters based on power control according to claim 1 is characterized in that, and is further comprising the steps of:
Bunch head chooser carrier wave at random sends and heavily distributes broadcast message; Carry the member node quantity and a bunch ID of this bunch in the information; The broadcast message of bunch bunch head under member node is received; If certain member node is also received the broadcast message of adjacent cluster bunch head, remember that the member node quantity of affiliated bunch of this member node is N ', the member node quantity of adjacent cluster is N ";
Situation 1: if N '≤N ", this member node can heavily not distributed;
Situation 2: if N ' >=N "+2; then this member node directly is assigned to neighbours bunch; if the member node distance original under bunch bunch nearer, then this member node is based on the distance parameter l of neighbours' bunch bunch head " regulates transmitting power, only covers a bunch head of bunches 2 and get final product; If bunch nearer apart from neighbours bunch, then this member node need not adjusted transmitting power;
And then this member node is sent judgement broadcast, carries neighbours' bunch a bunch ID; Neighbours' bunch a bunch head is received the judgement broadcast, and bunch ID in the information conforms to the ID of oneself, then this member node is added this bunch; Originally affiliated bunch bunch head receives identical judgement broadcast; If bunch ID in the information does not conform to the ID of oneself; And this member node originally was not a member node farthest, and then bunch head need not adjusted transmitting power, otherwise; One of guaranteeing to cover in the residue member node farthest of adjustment transmitting power get final product, last original under bunch bunch head this member node is deleted from own member tabulates;
Situation 3: if N '=N "+1, member node is l ' to the distance parameter of affiliated bunch of bunch head, is l to the distance parameter of neighbours' bunch bunch head ".If l '≤l ", then this member node can heavily not distributed, otherwise it will be assigned to neighbours bunch; By the member node reference distance parameter redistributed is l, and " the adjustment transmitting power, a bunch head that only covers neighbours bunch get final product, and bunch head that broadcast is notified neighbours bunch is adjudicated in broadcasting.Neighbours' bunch bunch head adds newcomer's node according to method identical in the situation 2, former under bunch bunch head adjustment transmitting power.
4. the distributed method that clusters based on power control according to claim 1 is characterized in that, and is further comprising the steps of:
All bunches form and heavily distribute through member node after, each bunch need carry out still once that the oneself detects, and judges whether to carry out bunch head and shifts, if certain bunch of member node to neighbours bunch has interference, then this has clustered round bunch head and has shifted power.
Have bunch head shift power bunch, to bunch in member node send bunch head and shift a broadcast message, comprise the ID that receives interfering nodes among a bunch ID, member node number and the neighbours bunch in the information, after member node is received this broadcast message, search for the neighbor table of oneself; If do not comprise the ID that receives interfering nodes in certain member node neighbor table, and the neighbor node number is not less than the member node number in the broadcast message, and then this member node can be taken on new bunch head; If a plurality of member node can be taken on new bunch head, then select a second cluster contention parameter β
iMinimum member node is as new bunch bunch head;
Select member node to form new bunch according to step 7 ~ 8, each node in bunch reduces transmitting power and adjusts the area of coverage.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012101553898A CN102685808A (en) | 2012-05-18 | 2012-05-18 | Distribution type clustering method based on power control |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012101553898A CN102685808A (en) | 2012-05-18 | 2012-05-18 | Distribution type clustering method based on power control |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102685808A true CN102685808A (en) | 2012-09-19 |
Family
ID=46817028
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012101553898A Pending CN102685808A (en) | 2012-05-18 | 2012-05-18 | Distribution type clustering method based on power control |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102685808A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104010344A (en) * | 2014-06-09 | 2014-08-27 | 河南科技大学 | Wireless sensor network virtual MIMO communication strategy based on cooperative groups |
| CN105554807A (en) * | 2016-01-26 | 2016-05-04 | 北京博信视通科技有限公司 | Device-to-device communication method and apparatus |
| CN106537287A (en) * | 2014-08-22 | 2017-03-22 | 英特尔公司 | Methods and apparatus to estimate power performance of a job that runs on multiple nodes of a distributed computer system |
| CN108243491A (en) * | 2018-01-08 | 2018-07-03 | 桂林航天工业学院 | A kind of uplink power control method based on the interference of adjacent cluster |
| WO2020006733A1 (en) * | 2018-07-05 | 2020-01-09 | Qualcomm Incorporated | Methods and apparatus related to forming and/or managing a group of devices |
| CN112261665A (en) * | 2020-10-15 | 2021-01-22 | 天津津航计算技术研究所 | Networking method of self-organizing network |
| CN117812614A (en) * | 2023-12-29 | 2024-04-02 | 杭州芯享科技有限公司 | Multi-target dynamic optimization decision method of wireless sensor network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101207572A (en) * | 2007-12-14 | 2008-06-25 | 北京科技大学 | Method for clustering vehicle mounted Ad hoc network based on signal strength |
| CN101227413A (en) * | 2008-02-22 | 2008-07-23 | 北京交通大学 | Cluster energy saving route algorithm applied in wireless sensor network |
| KR20090041769A (en) * | 2007-10-24 | 2009-04-29 | 고려대학교 산학협력단 | Method for forming clustering topology in sensor network and system using by the same |
-
2012
- 2012-05-18 CN CN2012101553898A patent/CN102685808A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20090041769A (en) * | 2007-10-24 | 2009-04-29 | 고려대학교 산학협력단 | Method for forming clustering topology in sensor network and system using by the same |
| CN101207572A (en) * | 2007-12-14 | 2008-06-25 | 北京科技大学 | Method for clustering vehicle mounted Ad hoc network based on signal strength |
| CN101227413A (en) * | 2008-02-22 | 2008-07-23 | 北京交通大学 | Cluster energy saving route algorithm applied in wireless sensor network |
Non-Patent Citations (2)
| Title |
|---|
| OSSAIIIA YOUNIS, SONIA FAHMY: "《INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer Societies》", 11 March 2004 * |
| 温达: "虚拟 MIMO 系统 VAA 小区分布式聚簇算法研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104010344A (en) * | 2014-06-09 | 2014-08-27 | 河南科技大学 | Wireless sensor network virtual MIMO communication strategy based on cooperative groups |
| CN104010344B (en) * | 2014-06-09 | 2017-06-13 | 河南科技大学 | A kind of wireless sensor network virtual MIMO communication strategy based on cooperative groups |
| CN106537287A (en) * | 2014-08-22 | 2017-03-22 | 英特尔公司 | Methods and apparatus to estimate power performance of a job that runs on multiple nodes of a distributed computer system |
| CN106537287B (en) * | 2014-08-22 | 2019-12-17 | 英特尔公司 | Method and apparatus for estimating power performance of jobs running on multiple nodes of a distributed computer system |
| CN105554807A (en) * | 2016-01-26 | 2016-05-04 | 北京博信视通科技有限公司 | Device-to-device communication method and apparatus |
| CN108243491A (en) * | 2018-01-08 | 2018-07-03 | 桂林航天工业学院 | A kind of uplink power control method based on the interference of adjacent cluster |
| CN108243491B (en) * | 2018-01-08 | 2020-11-27 | 桂林航天工业学院 | Uplink power control method based on adjacent cluster interference |
| WO2020006733A1 (en) * | 2018-07-05 | 2020-01-09 | Qualcomm Incorporated | Methods and apparatus related to forming and/or managing a group of devices |
| CN112261665A (en) * | 2020-10-15 | 2021-01-22 | 天津津航计算技术研究所 | Networking method of self-organizing network |
| CN117812614A (en) * | 2023-12-29 | 2024-04-02 | 杭州芯享科技有限公司 | Multi-target dynamic optimization decision method of wireless sensor network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102685808A (en) | Distribution type clustering method based on power control | |
| CN101697635B (en) | Access method and control method of cognitive wireless MESH network | |
| CN102196580B (en) | Method for dynamically configurating TDD (Time Division Duplex) base station uplink and downlink subframe scale | |
| CN107466099B (en) | Interference management self-optimization method based on non-orthogonal multiple access | |
| US8307070B2 (en) | Resource allocation method in wireless network | |
| US11451971B2 (en) | Networking method, networking apparatus, network access method, and user equipment for coordinated multiple points transmission/reception | |
| CN101341681B (en) | Distributed intelligent scheduling compensation optimizing system and method for wireless self-organizing network and personal domain network | |
| KR101196811B1 (en) | Method And Apparatus For Dynamic Inter-Cell Interference Avoidance | |
| CN101494896B (en) | Method for coordinating interference between districts of relay wireless communication network | |
| US10420101B2 (en) | Traffic-aware slot assignment | |
| CN101472339B (en) | Method for coordinating district interference | |
| CN105263143B (en) | The slot allocation method of adaptive session dot density and load in self-organizing network | |
| Choudhury et al. | Beacon synchronization and duty-cycling in IEEE 802.15. 4 cluster-tree networks: A review | |
| CN103826306B (en) | A kind of descending dynamic interference coordination method in highly dense set network based on game | |
| CN104320814B (en) | Coordinated multipoint transmission CoMP cluster-dividing methods and method for scheduling resources among cells | |
| CN101594617A (en) | A kind of control channel method for building up of hierarchical spectrum sharing network | |
| JP6362150B2 (en) | Method and system for muting radio resources in a radio communication system | |
| CN105188117B (en) | The farmland wireless sensor network frequency interlace cut-in method of time-space domain multiplexing | |
| Mishra et al. | Survey on recent clustering algorithms in wireless sensor networks | |
| CN110769444A (en) | Transmission method of wireless energy-carrying communication based on power distribution | |
| CN102833755B (en) | Method and device for constructing CoMP (Coordinated Multi-Point) cell coordination set | |
| WO2014057138A1 (en) | White space channel selection for cellular networks | |
| Li et al. | Base station sleeping with dynamical clustering strategy of CoMP in LTE-advanced | |
| CN110662190A (en) | Dynamic clustering LEACH method in wireless sensor network | |
| CN103874158A (en) | Novel clustering routing algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20120919 |