CN104093208B - A kind of non-slotted channel distribution method based on maximum matching in industry wireless network - Google Patents
A kind of non-slotted channel distribution method based on maximum matching in industry wireless network Download PDFInfo
- Publication number
- CN104093208B CN104093208B CN201410286957.7A CN201410286957A CN104093208B CN 104093208 B CN104093208 B CN 104093208B CN 201410286957 A CN201410286957 A CN 201410286957A CN 104093208 B CN104093208 B CN 104093208B
- Authority
- CN
- China
- Prior art keywords
- network
- link
- matching
- node
- point
- 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.)
- Active
Links
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses the non-slotted channel distribution method based on maximum matching in a kind of industry wireless network, this method is allocated using maximum matching algorithm to the time interval resource in network, the data traffic in unit time slot in network is improved, ensures the dormancy time of node；The channel resource in network is allocated by Point Coloring algorithm, solves the interference problem in network.Comprehensive two kinds of distribution methods are that communication network establishes dispatch list, realize the management and running to nodes behavior, increase the dormancy time of node, save node energy while slotted communication certainty, reliability is ensured, extend the life cycle of network.
Description
Technical field
The invention belongs to industrial wireless communication field, and in particular in industry wireless network it is a kind of based on maximum matching when
The implementation method of gap channel distribution.
Background technology
In recent years, the research of industrial wireless communication field correlation technique has obtained the extensive concern of academia and industrial quarters,
And achieve swift and violent development.Industry wireless communication network, due to its special application scenarios, is deposited compared with conventional wired networks
Limited in the constraintss of much reality, such as limitation of sensor node energy, communication capacity limitation and calculating and storage capacity
Deng, how under many restrictions realize in industry wireless communication network the communication resource carry out rational management distribution turn into should
One important research content in field.
In industry wireless communication network, the communication resource refer to data source point to oriented communication path between point of destination and its
Communicate shared time and frequency between a series of used point-to-points.Wherein the time is embodied in the form of time slot, time slot
Communication mechanism will be divided into continuous timeslice the time by time division multiplexing, ensure in different time piece to enter between different nodes
Row data communication, different nodes carries out rational transmitting-receiving configuration in different time-gap in network can effectively avoid between node
Data collision.Frequency is embodied in the form of channel, and hop channel mechanism transmits data by frequency division multiplexing in different frequencies, no
Network throughput can only be increased, moreover it is possible to effectively reduce interference and the influence of multipath fading.
In order to realize effective distribution to the communication resource in network, industry wireless communication network using time slot by rationally being led to
Letter mechanism formulates dispatch list with hop channel mechanism, and dispatch list arranges node to exist by communication resources such as reasonable distribution time slot and channels
Behavior in network, the node in network perform respective behavior, such as node a certain according to the dispatch list made
Data are sent or received on time slot and a certain channel, enter resting state in some time slots.It is this to be based on slotted communication and jump
The node that the non-slotted channel method of salary distribution of channel Mechanism establishing dispatch list can ensure to vie each other in network obtains rational logical
Believe resource, can effectively avoid conflicting, improve handling capacity and bandwidth availability ratio, the determination for solving data communication between field apparatus
Property, integrity problem.
In industrial wireless communication field, the timeslot-based dispatching method of tradition often only considers in the course of the study
Timeslot-based scheduling is carried out above single channel, directly the problem of dispatch channel resource is avoided mentioning, or by channel
Scheduling of resource process idealizes, and this causes the waste of channel resource to a certain extent, limits the communication resource in network and dispatches
The reasonability of distribution.
The defects of present invention is directed to above industrial wireless communication field conventional scheduling method, innovatively proposes a kind of base
In the implementation method of the non-slotted channel distribution of maximum matching, the dispatching method can be directly applied to be based on slotted communication and jump to believe
In the industry wireless communication network of road mechanism, the real-time of Logistics networks operation, reliability and higher network throughput.
The content of the invention
The deficiency of the prior art for more than, it is an object of the invention to provide it is a kind of add network up to handling up
Rate, reduce delay, save the non-slotted channel point based on maximum matching in substantial amounts of energy, the industry wireless network that certainty is strengthened
Method of completing the square, technical scheme are as follows：A kind of non-slotted channel distribution method based on maximum matching in industry wireless network,
It comprises the following steps：
101st, industry wireless network is initialized, setting initial slot kInitially=0, now initial slot k=0 it will correspond to
Dispatch list part initialized, i.e. part=0；
102nd, initial slot k in industry wireless network time slot frame slotframe is countedInitially=0 untill k time slots from leaf
Node converges to the total flow number q of host node PAN telegons0(k) total flow number Q, works as q and in industry wireless network0(k)=Q
When, then show that dispatch list part has been generated, non-slotted channel distribution is carried out according to dispatch list, terminated；Work as q0(k) ≠ Q when, then table
Bright dispatch list does not generate also completely, jumps to step 103；
103rd, obtain k time slots when network topological diagram and k time slots when physical connection figure, and use maximum matching algorithm breast
Network topological diagram when tooth profit algorithm tries to achieve k time slots exempts from more conflict link set VMCL (k)；
104th, exempt from more conflict link set VMCL (k) and physical connection figure during k time slots for trying to achieve step 103 are carried out pair
Than using k slotted physicals connected graph as reference, being modified, being rejected in VMCL (k) link set to VMCL (k) link sets
In the presence of and the link that is not present in k slotted physical connected graphs, will exist and VMCL (k) link sets in k slotted physical connected graphs
In be not present and do not produce the link to conflict with existing VMCL (k) link set and fill up into VMCL (k) link sets, thus shape
Into conflict interference figure IC (k)={ VI(k),EI(k) }, wherein VI(k) set of conflict interference figure IC (k) interior joint, E are representedI
(k) set of conflict interference figure IC (k) link is represented.
105th, by the conflict interference figure IC (k) obtained in step 104={ VI(k),EI(k) order Point Coloring algorithm } is used
Coloring, choose the preferable channel of quality and be fabricated to the distribution that anti-interference channel sequence carries out channel to the point of coloring, by above-mentioned mistake
That obtained time slot and channel information are distributed in journey inserts dispatch list part, and the dispatch list part is carried out into upgrading renewal, net
Non-slotted channel distribution information of the network in dispatch list is scheduled operation.
Further, the maximum matching algorithm Hungary Algorithm step in step 104 is as follows：
201st, it is two mutually disjoint subsets X, Y by network topological diagram vertex partition during k time slots, and it is every in topological diagram
Associated two summit on bar side is belonging respectively to the two different vertex sets, is consequently formed the network topology and is drawn with two
Divide the bipartite graph of (X, Y), the arbitrarily selected initial matching set M in bipartite graph；
The 202nd, if each summit in set M is matched, claims matching set M saturations in vertex set X or Y, if matching
Set M saturations, then skip to step 207, if matching set M is unsaturated, skips to step 203；
The 203rd, if not in set M is matched, the summit is referred to as non-M saturation points, is arbitrarily selected in set X on a summit in figure
Determine an initial matching set M non-M saturation points x, x is stored in unsaturation point set S corresponding to set X, i.e. S={ x }, collection
Unsaturation point set T corresponding to closing Y is empty set, i.e. T=φ；
204th, the set N (S) of all points adjacent with x in unsaturation point set S is obtained, if N (S)=T, jumps to step
Rapid 207；Otherwise optional point y ∈ N (S)-T；
If the 205, y is a matching set M summit, i.e. y is M saturation points, then goes to step 206, otherwise chooses one
M augmentative path P from x to y, set M and set P union are removed to gathering as newly after set M and set P common factor
Set M is matched, be i.e. M=M ⊕ P, goes to step 202；
206th, because y is to match the M saturation points in set M, then match in set M and certainly exist a line { y, u }, by this
Another summit u on bar side is added in unsaturation point set S corresponding to X, i.e. S=S ∪ { u }, y is added to non-corresponding to Y
In saturation point set T, be i.e. T=T ∪ { y }, finally select non-M saturation points from the set of summit u adjacent point and be added to N
(S) in, step/204 are gone to；
207th, terminate to find, obtain maximum matching set M'.
Further, in the order Point Coloring algorithm steps in the step 105, in addition to using selection function Qi(k)
=max { Qj(k)|nj∈ch(pi)∧qj(k) ≠ 0 }, to the flow Q of node ii(k) the step of being reversed, wherein ch
(pi) represent node piAll child nodes.
Advantages of the present invention and have the beneficial effect that：
Non-slotted channel distribution method proposed by the present invention is by using maximum matching algorithm and Point Coloring algorithm to network
In time interval resource and channel resource reasonably distributed, and solve by matching problem the hidden end in network and ask
Topic, maximum matching improves the reachable throughput that maximum requirement is sent to flow, adds network in network, by lighting
Interference problem in color Resolving probiems network, make network more stable.The combination of two methods reduces the delay in network, really
Qualitative reinforcement, because dispatch list in each time slot arranges most data to send, node can be made there are more time dormancy,
Therefore substantial amounts of energy can be saved, makes the life cycle of node longer.Therefore algorithm proposed by the present invention meets resource-constrained nothing
Line Sensor Network is to real-time, certainty and the design requirement of low-power consumption.
Distribution method proposed by the present invention effectively realizes the reasonable distribution of time slot and channel resource, according to the distribution side
The dispatch list that method is formulated, can be directly applied in the industry wireless communication network based on slotted communication and hop channel mechanism, full
To the demand of Internet resources reasonable distribution in foot wireless industrial field, the operation reliably and with long-term of industry wireless network is realized.
Brief description of the drawings
Fig. 1 is preferred embodiment of the present invention non-slotted channel allocation algorithm flow chart；
Fig. 2 network topological diagrams and corresponding bipartite graph；
Any matching figures of Fig. 3 mono-；
The matching obtained after the circulation of Fig. 4 step 1~4；
Fig. 5 simple network topological diagrams；
Fig. 6 2.4Ghz channel distribution exemplary graphs.
Embodiment
Providing a non-limiting embodiment below in conjunction with the accompanying drawings, the invention will be further elaborated.
Shown in reference picture 1-6, overall technological scheme of the invention is as follows, keeps closing before each node device is not powered in network
Closed state, on telegon after electricity, initialization network parameter first forms a new PAN network, network physical connected graph is
Sky, each node flow in network are 0.
(1) network is initialized, it is specified that time slot is started from scratch, i.e. k=0；Dispatch list is initialized, i.e. part=0；
(2)q0(k) the host node PAN untill k time slots, converged on slotframe frames in network from other leaf nodes is represented
Total flow number in telegon, Q represent flow number total in network.Work as q0(k) ≠ Q when, the stream of the host node in k time slot networks
Amount number differs with the flow number in network, represents that dispatch list does not generate also completely, continues to perform (3)-(7)；Otherwise
Represent that dispatch list has been completed to generate, return to the dispatch list of generation, and terminate algorithm.
(3) according to the network topological diagram in k time slots, made with matching relevant knowledge and exempt from more conflict links, at this moment looked into
The link found can be placed on same time slot, but the number of links found is not necessarily most, i.e. this when sends
Flow number be not necessarily maximum, therefore the concept of maximum matching is at this moment introduced, with maximum matched and searched network topological diagram
In link, the number of links now found is most, and the flow number that this when can send is maximum, the net of the time slot
More conflict link set VMCL (k) of exempting from network topological diagram search completion.
(4) more conflict link set VMCL (k) will be exempted to be contrasted with physical connection figure during k time slots, with k slotted physicals
Connected graph is modified to VMCL (k) link sets as reference, rejects and exist and k slotted physicals in VMCL (k) link set
The link being not present in connected graph, will exist in k slotted physical connected graphs and be not present in VMCL (k) link sets and with it is existing
The link that VMCL (k) link sets do not produce conflict is filled up into VMCL (k) link sets, is consequently formed conflict interference figure IC
(k)={ VI(k),EI(k) }, wherein VI(k) set of conflict interference figure IC (k) interior joint, E are representedI(k) conflict interference is represented
Scheme the set of IC (k) link.
(5) using obtained conflict interference figure IC (k), each node in IC (k) figures is entered according to the principle of Point Coloring
Row colours and generates the figure after Point Coloring.
(6) choose the preferable channel of channel quality and be fabricated to minute that anti-interference channel sequence carries out channel to the point of coloring
Match somebody with somebody.
(7) transmission link of k time slots is arranged in dispatch list, records the flow in now q flow number and network
Count and upgrade dispatch list, finally time slot k is carried out plus 1 is handled, step (2) is jumped to and carries out cycle criterion.
Specifically, maximum matching algorithm is described below；
(1) maximum matching algorithm
The present invention network topological diagram is exempted from using maximum matching algorithm in graph theory more than conflict link VMCL (k) look into
Look for, found on time slot k network it is most exempt from more conflict links, it is possible to achieve it is maximum that the time slot sends data traffic.It is right first
Maximum matching problem is illustrated：
Because sensor node energy resource is limited, can be consumed when sending and receiving data and idle condition a lot
Energy, and the hardly consumed energy in sleep procedure.If a kind of dispatching method can ensure that data are all arranged in a phase
To receiving or sending in the time slot of concentration, then the total energy expense of nodes will be saved, make network life all
Phase maximizes.Therefore the concept of maximum matching is introduced in this algorithm, i.e., is arranged at most on each time slot in a network
Link is transmitted, and in the case that transmission data volume is certain in a network, data will be sent in a manner of a kind of maximum flow to be made
Node in network has the more time to carry out dormancy.
Maximum matching is further described below, any matching m in a figure, m≤M be present, then M is exactly this
The maximum matching of figure.That is, maximum matching problem is exactly in order that exempting from more conflict link VMCL (k) in network topological diagram
The problem of number is maximum, that is, solve the problems, such as that most not colliding datas can be sent in k time slot networks.From the angle of network overall operation
Degree is seen, more by dispatching the data that can be sent on same time slot k, with regard to network throughput can be greatly improved,
The data in network can be made to enter idle condition after transmitting as early as possible, and then save substantial amounts of electric energy, enable the network to transport
The row longer time, extend the life-span of network.
In order to preferably explain maximum matching algorithm, introduced below by citing a kind of based on the maximum matching of matched and searched
Algorithm.
In mathematical region, the maximum algorithm appellation Hungary Algorithm matched is extended for by scheming any matching M in G, it is assumed that give
The figure gone out is all the bipartite graph with two divisions (X, Y).Hungary Algorithm step is as follows：
(1) it is two mutually disjoint subsets X, Y by network topological diagram vertex partition during k time slots, and it is every in topological diagram
Associated two summit on bar side is belonging respectively to the two different vertex sets, is consequently formed the network topology and is drawn with two
Divide the bipartite graph of (X, Y), the arbitrarily selected initial matching set M in bipartite graph；
(2) if each summit is in set M is matched in vertex set X or Y, matching set M saturations are claimed, if set of matches
M saturations are closed, then skip to step (7), if matching set M is unsaturated, skip to step (3)；
(3) if not in set M is matched, the summit is referred to as non-M saturation points, is arbitrarily selected in set X on a summit in figure
Determine an initial matching set M non-M saturation points x, x is stored in unsaturation point set S corresponding to set X, i.e. S={ x }, collection
Unsaturation point set T corresponding to closing Y is empty set, i.e. T=φ；
(4) the set N (S) of all points adjacent with x in unsaturation point set S is obtained, if N (S)=T, jumps to step
Suddenly (7)；Otherwise the optional point y in set N (S)-T, i.e. y ∈ N (S)-T；
(5) if point y is a matching set M summit, i.e. y is M saturation points, then goes to step (6), otherwise chooses one
M augmentative path P from x to y, set M and set P union are removed to gathering as newly after set M and set P common factor
Set M is matched, be i.e. M=M ⊕ P, goes to step (2)；
(6) because y is to match the M saturation points in set M, then match in set M and certainly exist a line { y, u }, by this
Another summit u on bar side is added in unsaturation point set S corresponding to X, i.e. S=S ∪ { u }, y is added to non-corresponding to Y
In saturation point set T, be i.e. T=T ∪ { y }, finally select non-M saturation points from the set of summit u adjacent point and be added to N
(S) in, step (4) is gone to；
(7) terminate to find, obtain maximum matching set M'.
Description below is carried out to the term occurred in above-mentioned algorithmic procedure, M- summits are M saturation points, and M is figure G
Match somebody with somebody, the summit joined in G with the frontier juncture in M.Non- M- summits are then that the part summit in G is not the summit that frontier juncture joins in M matchings.S
Represent unsaturation point set, the set of the consecutive points at N (S) set expression set S midpoints.The bipartite graph of two divisions, the algorithm
Definition in operational network to network conflict can be understood as odd number node layer in network topology when data are sent, even
Several layers of node can not retransmit data certainly, and similarly the node of even level is when data are sent, the node of odd-level
Data can not be sent.Then the network topology of this algorithm research can two be divided into bipartite graph.
In order to preferably explain above-mentioned algorithm, the network topology structure of A figures, obtains its corresponding bipartite graph in analysis chart 2
B, and maximum matching algorithm is discussed in detail according to bipartite graph B, and find out and at most exempt from the chain that conflicts in the network topological diagram in k time slots
Road set VMCL (k).
Concrete operation step is as follows：
(1) original bipartite graph B, figure B interior joints y1-y6 composition set Y, section are being drawn according to network topological diagram A first
Point x1-x7 forms set X, and an arbitrary initial matching is then found out in bipartite graph and exempts from the link set that conflicts.Such as Fig. 3,
It is M={ (y to find initial matching1,x1),(y2,x2),(y3,x4),(y4,x3)}。
(2) due to still having summit in set Y not in M is matched, therefore set Y not yet saturations, appoint in set Y and take
One unsaturation point y5It is put into Y unsaturation point set S, now S={ y5, unsaturation point set is combined into sky corresponding to set X,
That is T=φ.
(3) set S={ y are found from Fig. 35Adjacent point set N (S)={ x4, because { x4,y3It is the son matched
Collect, now x4For saturation point, by point x4It is added in set T, then T={ x4}.Will point y3It is added in set S, now set S
={ y3,y5}。
(4) continue to search set S={ y in figure 33,y5Adjacent collection N (S)={ x1,x4,x7, set midpoint x7Right and wrong
Saturation point, then one is done from point y5To point x7Augmentative path P, p={ (y3,x7),(y3,x4),(y5,x4)}.By set M and collection
The set after P union removal set M and set P common factor is closed as new matching set M, be i.e. M=M ⊕ P, is then now matched
Set M={ (y1,x1),(y2,x2),(y3,x7),(y4,x3),(y5,x4)}。
(5) pass through the circulation of step 1~4, obtain the new matching set M shown in Fig. 4.Whether most matching now
Big matching also needs to repeat the above steps to continue to search and just can confirm that.Take the unsaturation point y of set Y in Fig. 46, then now
There are S={ y6, T=φ, N (S)={ x4, due to x4It is saturation point, is added in set T, now T={ x4}；{x4,y5It is
With the subset in M, then by y5It is added in set S, now S={ y5,y6, N (S)={ x4Due to now N (S)=T, it is maximum
The search procedure of matching stops, and has obtained maximum matching M={ (y1,x1),(y2,x2),(y3,x7),(y4,x3),(y5,x4)}。
For network topological diagram Fig. 2-A, maximum of figure has been obtained by reckoning according to the general principle of Hungary Algorithm
Match somebody with somebody, then the link in maximum set of matches, which can be arranged on same time slot k, sends data, and can ensure between link
Any interference will not be produced, network is sent the data volume of maximum within the unit interval, add gulping down for network
The amount of telling.Data in network can be completed to send in the relatively short time, then the node in sensor network has more times
For dormancy, the energy of node device is saved, this is of great importance for resource-constrained industry wireless communication network.
(2) Point Coloring algorithm
Point of channel is carried out to interference conflict link present in the physical connection figure in k time slots using Point Coloring algorithm
Match somebody with somebody, solve at the same time in gap in network transmission link interference collision problem.
On time slot k, the VMCL (k) established in network gathers, when will exempt from more conflict link set VMCL (k) with k time slots
Physical connection figure contrasted, using k slotted physicals connected graph as reference, VMCL (k) link sets are modified, reject
The link for existing and being not present in k slotted physical connected graphs in VMCL (k) link sets, will exist in k slotted physical connected graphs
And it is not present in VMCL (k) link sets and does not produce the link to conflict with existing VMCL (k) link set and filled up into VMCL (k)
In link set, conflict interference figure IC (k)={ V is consequently formedI(k),EI(k) }, wherein VI(k) conflict interference figure IC (k) is represented
The set of interior joint, EI(k) set of conflict interference figure IC (k) link is represented.Obtain conflict interference figure IC (k) and give IC afterwards
(k) link in distributes different channels, can so make node in network in the case of not causing interference simultaneously when
Gap k sends data.
The present invention simplifies the frequency-assignment problem in wireless sensor network the Point Coloring problem for turning into a related figure,
Coloring treatment is carried out to conflict interference figure IC (k), due to being used for determining graph coloring number currently without an effective algorithm, I
Used a kind of approximate efficient algorithm for seeking node color number, sequential color algorithm, its core thinking is as follows：
If G=(V, E) is non-directed graph, V={ x1,x2,L,xnUse N (xi) represent and xiAdjacent whole vertex sets；It is right
Summit xiC is coloured, is designated as π (xi)=C
(1)i:=1
(2)c:=1
(3) it is if rightThen make π (xi)=c is simultaneously transferred to the 5th step.
(4)c:=c+1 is simultaneously transferred to the 3rd step.
(5) if i<N, then i:=i+1 simultaneously goes back to the 2nd step, otherwise stops
Simple illustration is carried out to sequential color method by taking Fig. 5 as an example.
First node x is given first1The first color, i.e. i=1, c=1；
For with node x1Adjacent node set N (x1)={ x2,x3, because sequential color law regulation and x1Adjacent point
Can not same color, it is necessary to second of color, now c=c+1.
Look for node x2, x3Neighbor node N (x2,x3)={ x1,x4,x5,x6, due to node x1The first color, and
And x1Node and x4,x5,x6Node is all non-conterminous, then node x4,x5,x6Can be with node x1Same color.Now stop,
The chromatic number of the figure is 2.
Application of the sequential color method in channel distribution is discussed in detail now.
V firstI(k) node in gathering is according to Qi(k) uninterrupted is arranged according to backward in, then according to network
In Global Queue's horizontal sizes of all nodes be compared, colour for the first time to the section for possessing maximum flow in network in network
Point ni, remaining node is divided into two groups according to following group forming criterion：With the node n of coloringiThere is interference (adjacent point i.e. in figure)
Node be divided into a group, with colour node niThe node not interfered with is divided into second group.One is found out from non-interference node
Individual node, then this node with first node identical color, other nodes profit in following remaining list
It is divided into two groups again with above-mentioned rule.After the completion of being coloured according to the method, the link set of same colored can when
It is arranged in the enterprising row data of same channel c on gap k to send, VCLc(k) it is established like this.
Finally, different VCLs of the network application identical method foundationc(k) link set arranges on a different channel
Face, and the distribution of the scheduling resource at time slot k moment is completed, form dispatch list.
It is 5 according to the chromatic number that five-color theorem is connection simple plan view G, can analyzes and enter to finding interference conflict graph IC
Row vertex coloring, it can be no more than 5 using the number of channel in theory.Another method is provided below to letter according to five-color theorem
Road sequence is arranged.
To connected graph after the implementation of sequential color algorithm, draw there is abundant channel in network according to five-color theorem analysis
It can be allocated, industry wireless network 2.4Ghz frequency allocations are turned into 5 parts by this problem.
As shown in fig. 6, will turn into 5 parts in 2.4Ghz frequency allocations, scan channel first determines 2.4Ghz 16 letters
The quality in road, the channel of every part relative distance farther out is selected according to corresponding division in figure as far as possible, in channel quality identical
In the case of, this problem suggestion selection can so avoid the mutual interference of heterogeneous networks and letter per the channel among part
Interference between road.
(3) function is selected
In the non-slotted channel distribution method, function is selected to use the mode of iteration, from the root section in network topological diagram
Point is begun stepping through, and until having traveled through all leaf nodes, this function can be expressed as：
Qi(k)=max { Qj(k)|nj∈ch(pi)∧qj(k)≠0}
In time slot k, only child node n it can be seen from expression formulaiThere is the father node p that data are sent to itiWhen, link
(ni,pi) can just be activated, if no data need to send in the time slot, this link will not be activated.Exactly because choosing
Such a kind of ability that function has is selected, just avoids the distributing slot resources by preciousness to greatest extent to no any data
The empty node of transmission, reduces the waste of scheduling resource.Selection in network topology to link is to be based on local link and the overall situation
Link flow, exempt from more conflict link sets by the network traffics in each of the links in network to select to search matching, this
The link that sample can make to find has the feature for now carving maximum flow in a network.It is meanwhile more in order to save
The energy, VMCL (k) links designed in the dispatching method, therefore can also be by continuous time slots by selecting function to be selected
It is reserved to the link for possessing mass data transmission.
During to Point Coloring, function is selected also to play its due effect, VI(k) gather in node according to
Qi(k) uninterrupted is arranged according to backward in, here Qi(k) size of flow is exactly to select function to be counted, Ran Hougen
According to the Q of nodesi(k) first node being compared every time.Give max-flow Slot format first every time
The link of amount is transmitted, and is so advantageous to the data in network and is transmitted completion as soon as possible.
By selecting this mechanism of function, it is possible to reduce the delay of network, algorithm is enhanced to the deterministic support of network,
Increase network throughput, reduce the wasting of resources and saved energy consumption, enable the steady of wireless sensor network longer time
Fixed operation.
The above embodiment is interpreted as being merely to illustrate the present invention rather than limited the scope of the invention.
After the content for having read the record of the present invention, technical staff can make various changes or modifications to the present invention, these equivalent changes
Change and modification equally falls into the inventive method claim limited range.
Claims (3)
1. the non-slotted channel distribution method based on maximum matching in a kind of industry wireless network, it is characterised in that including following step
Suddenly：
101st, industry wireless network is initialized, setting initial slot kInitially=0, now it will adjust corresponding to initial slot k=0
Degree table part is initialized, i.e. part=0；
102nd, initial slot k in industry wireless network time slot frame slotframe is countedInitially=0 untill k time slots from leaf node
Converge to the total flow number q of host node PAN telegons0(k) total flow number Q, works as q and in industry wireless network0(k)=Q when,
Then show that dispatch list part has been generated, non-slotted channel distribution is carried out according to dispatch list, terminated；Work as q0(k) ≠ Q when, then show
Dispatch list does not generate also completely, jumps to step 103；
Physical connection figure during network topological diagram and k time slots when the 103, obtaining k time slots, and using maximum matching algorithm Hungary
Network topological diagram when algorithm tries to achieve k time slots exempts from more conflict link set VMCL (k)；
104th, the more conflict link set VMCL (k) of exempting from for trying to achieve step 103 are contrasted with physical connection figure during k time slots,
Using k slotted physicals connected graph as reference, VMCL (k) link sets are modified, rejects and exists in VMCL (k) link set
And the link being not present in k slotted physical connected graphs, will exist in k slotted physical connected graphs and in VMCL (k) link sets not
The link to conflict is not produced in the presence of and with existing VMCL (k) link set to fill up into VMCL (k) link sets, is consequently formed punching
Prominent interference figure IC (k)={ VI(k),EI(k) }, wherein VI(k) set of conflict interference figure IC (k) interior joint, E are representedI(k) table
Show the set of conflict interference figure IC (k) link；
105th, by the conflict interference figure IC (k) obtained in step 104={ VI(k),EI(k) } coloured using order Point Coloring algorithm,
Choose the preferable channel of quality and be fabricated to the distribution that anti-interference channel sequence carries out channel to the point of coloring, by said process points
Insert dispatch list part with obtained time slot and channel information, the dispatch list part be subjected to upgrading renewal, network according to
Non-slotted channel distribution information in dispatch list is scheduled operation.
2. the non-slotted channel distribution method based on maximum matching in industry wireless network according to claim 1, its feature
It is：Maximum matching algorithm Hungary Algorithm step in step 103 is as follows：
201st, it is two mutually disjoint subsets X, Y by network topological diagram vertex partition during k time slots, and each edge in topological diagram
Associated two summit be belonging respectively to the two different vertex sets, be consequently formed the network topology with two division
The bipartite graph of (X, Y), the arbitrarily selected initial matching set M in bipartite graph；
If the 202, each summit in set M is matched, claims matching set M saturations in vertex set X or Y, if matching set M
Saturation, then step 207 is skipped to, if matching set M is unsaturated, skip to step 203；
It is arbitrarily selected first in set X if the 203, not in set M is matched, the summit is referred to as non-M saturation points on a summit in figure
A beginning matching set M non-M saturation points x, x is stored in unsaturation point set S corresponding to set X, i.e. S={ x }, set Y
Corresponding unsaturation point set T is empty set, i.e. T=φ；
204th, the set N (S) of all points adjacent with x in unsaturation point set S is obtained, if N (S)=T, jumps to step
207；Otherwise optional point y ∈ N (S)-T；
If the 205, y is a matching set M summit, i.e. y is M saturation points, then goes to step 206, otherwise selection one from x to
Y M augmentative path P, set M and set P union is removed to the set after set M and set P common factor as new matching
Set M, i.e. M=M ⊕ P, go to step 202；
206th, because y is to match the M saturation points in set M, then match in set M and certainly exist a line { y, u }, by this edge
Another summit u be added in unsaturation point set S corresponding to X, i.e. S=S ∪ { u }, y is added to unsaturation corresponding to Y
In point set T, be i.e. T=T ∪ { y }, finally select non-M saturation points from the set of summit u adjacent point and be added in N (S),
Go to step/204；
207th, terminate to find, obtain maximum matching set M'.
3. the non-slotted channel distribution method based on maximum matching in industry wireless network according to claim 1, its feature
It is：In order Point Coloring algorithm steps in the step 105, in addition to using selection function Qi(k)=max { Qj(k)|nj
∈ch(pi)∧qj(k) ≠ 0 }, to the flow Q of node ii(k) the step of being reversed, wherein ch (pi) represent node pi's
All child nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410286957.7A CN104093208B (en) | 2014-06-24 | 2014-06-24 | A kind of non-slotted channel distribution method based on maximum matching in industry wireless network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410286957.7A CN104093208B (en) | 2014-06-24 | 2014-06-24 | A kind of non-slotted channel distribution method based on maximum matching in industry wireless network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104093208A CN104093208A (en) | 2014-10-08 |
| CN104093208B true CN104093208B (en) | 2017-11-17 |
Family
ID=51640875
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410286957.7A Active CN104093208B (en) | 2014-06-24 | 2014-06-24 | A kind of non-slotted channel distribution method based on maximum matching in industry wireless network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104093208B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106209210B (en) * | 2016-07-29 | 2019-01-25 | 西安电子科技大学 | The Information Network method for managing resource of oriented mission |
| CN109413752A (en) * | 2018-11-21 | 2019-03-01 | 华中科技大学 | A kind of real time resources dispatching method towards wireless low-power consumption network |
| CN112953759B (en) * | 2021-01-27 | 2023-10-03 | 上海七牛信息技术有限公司 | Node optimal resource coverage analysis adjustment method and device and computer equipment |
| CN113660638B (en) * | 2021-07-11 | 2023-03-24 | 西北工业大学 | Network resource scheduling method suitable for wireless avionic internal communication network |
| CN114531444B (en) * | 2022-01-28 | 2023-03-10 | 西安电子科技大学 | Incremental scheduling table generation method with decreasing conflict degree |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101626585A (en) * | 2008-07-10 | 2010-01-13 | 日电（中国）有限公司 | Network interference evaluation method, dynamic channel distribution method and equipment in wireless network |
| CN102355672A (en) * | 2011-08-17 | 2012-02-15 | 南京邮电大学 | Method for allocating adaptive resources in cognitive OFDM (orthogonal frequency division multiplexing) system |
| CN103079262A (en) * | 2012-12-28 | 2013-05-01 | 浙江大学 | Mode selection and resource allocation method of device-to-device (D2D) users in cellular system |
| CN103297927A (en) * | 2012-03-04 | 2013-09-11 | 山东大学威海分校 | Distributed graph coloring link dispatch of wireless sensor network |
-
2014
- 2014-06-24 CN CN201410286957.7A patent/CN104093208B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101626585A (en) * | 2008-07-10 | 2010-01-13 | 日电（中国）有限公司 | Network interference evaluation method, dynamic channel distribution method and equipment in wireless network |
| CN102355672A (en) * | 2011-08-17 | 2012-02-15 | 南京邮电大学 | Method for allocating adaptive resources in cognitive OFDM (orthogonal frequency division multiplexing) system |
| CN103297927A (en) * | 2012-03-04 | 2013-09-11 | 山东大学威海分校 | Distributed graph coloring link dispatch of wireless sensor network |
| CN103079262A (en) * | 2012-12-28 | 2013-05-01 | 浙江大学 | Mode selection and resource allocation method of device-to-device (D2D) users in cellular system |
Non-Patent Citations (1)
| Title |
|---|
| OFDMA无线多跳网络中基于图论的资源分配算法;常勤;《中国优秀硕士学位论文全文数据库 信息科技辑》;中国学术期刊（光盘版）电子杂志社;20131215(第S2期);21-45页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104093208A (en) | 2014-10-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104093208B (en) | A kind of non-slotted channel distribution method based on maximum matching in industry wireless network | |
| Gasieniec et al. | Faster communication in known topology radio networks | |
| US9730100B2 (en) | Terse message networks | |
| Sagduyu et al. | The problem of medium access control in wireless sensor networks | |
| CN102316594B (en) | Method for cross layer resource distribution and grouped dispatch in cognitive wireless network | |
| EP1835668A1 (en) | Method and apparatus for controlling transmission of data from a plurality of sensor nodes | |
| CN102065544A (en) | Resource management method and system | |
| Li et al. | A distributed TDMA scheduling algorithm based on energy-topology factor in Internet of Things | |
| CN109194746A (en) | Heterogeneous Information processing method based on Internet of Things | |
| CN105848295A (en) | Heterogeneous Internet of Vehicles time slot allocation method | |
| CN109413752A (en) | A kind of real time resources dispatching method towards wireless low-power consumption network | |
| Dezfouli et al. | REWIMO: A real-time and reliable low-power wireless mobile network | |
| Mir et al. | Collaborative topology control for many-to-one communications in wireless sensor networks | |
| CN101252543B (en) | Rapid data anastomosing algorithm used for wireless sensor network | |
| CN103297927A (en) | Distributed graph coloring link dispatch of wireless sensor network | |
| CN101299699A (en) | Node device and method for beacon scheduling in AD-HOC network and data transmitting method thereof | |
| Pan et al. | Low latency scheduling for convergecast in ZigBee tree-based wireless sensor networks | |
| Ajmi et al. | SPEECH‐MAC: Special purpose energy‐efficient contention‐based hybrid MAC protocol for WSN and Zigbee network | |
| Wang et al. | Deterministic scheduling with optimization of average transmission delays in industrial wireless sensor networks | |
| CN1674546A (en) | Topological project based on mobile agency in large scale network | |
| CN104994508A (en) | Cognitive radio mesh network resource distribution and routing method | |
| CN104540229B (en) | Method for managing resource and system | |
| CN103796325B (en) | The distribution of wireless Mesh netword multicast portions overlapped channels and dispatching method | |
| Buratti et al. | A hybrid hierarchical architecture: From a wireless sensor network to the fixed infrastructure | |
| Li et al. | Conflict-free many-to-one data aggregation scheduling in multi-channel multi-hop wireless sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |