CN1338187A - Apparatus and methods for channel allocation - Google Patents

Abstract

This invention discloses a method for utilization of a first plurality of channels by a second plurality of transmitters, the method includes the steps of defining a third plurality of transmitter subsets such that at least one of the second plurality of transmitters is included in each transmitter subset; assigning at least one channel from among the first plurality of channels to each transmitter subset, to be shared among the transmitters in that transmitter subset, such that less than all of the first plurality of channels are assigned to the third plurality of transmitter subsets, thereby defining a reservoir of channels which have not been assigned to any transmitter subset, and sharing the channels in the reservoir of channels between all of the second plurality of transmitters. A system for utilization of a first plurality of channels by a second plurality of transmitters is also disclosed.

Description

The equipment of channel allocation and method

Invention field

The present invention relates to the equipment and the method for channel allocation.

Background of invention

Describe in the modern method for channel allocation file below:

" resource allocation of wireless network ", Scott Jordan, JHSN, 10, January1995.

" using the static state and the dynamic channel allocation of emulation heat treatment (simulated annealing) " of people such as Duque-Anton, at the 10th chapter of the neural net of telecommunications, Ben Yuhas and Nirwan Ansari (Ed.), Kluwer Academic Publishers, Buston, 1994.

" use and the priority channel (Prioritized channel borrowingwithout locking) that do not lock: a kind of Channel Sharing strategy that is used for the honeycomb fashion communication ", H.Jiang and S.S.Rappaport, IEEE/ACM Transactions on Networking, Vol.4, No.2, April 1996.

Disclosed publication of all that mention in specification and the publication quoted here are at this as a reference.

Summary of the invention

The present invention attempts to be provided for the improved equipment and the method for channel allocation.

Therefore, according to the preferred embodiment of the present invention, a kind of method of utilizing first group of channel by second group of transmitter is provided, this method comprises that the 3rd group of transmitter subclass of definition makes that at least one is included in each transmitter subclass in second group of transmitter, and at least one channel allocation in first group of channel is arrived each transmitter subclass, between the transmitter of this transmitter subclass, share, make and give the 3rd group of transmitter subclass less than all first group of channel allocation, therefore define the holder (reservoir) of not distributing to the channel of any transmitter subclass, and shared the channel in the channel holder in all second group of transmitters.

In addition according to a preferred embodiment of the invention, if do not comprise the contiguous clique (neighbor-clique) of first and second transmitters, even the channel in the holder is used by second transmitter, also qualified this channel of use of first transmitter, the contiguous clique of wherein independent transmitter subclass comprises all transmitter subclass of sharing at least one common transmitter with independent transmitter subclass.

A kind of method is provided in addition according to a further advantageous embodiment of the invention, utilize this method, first group of channel services under the situation of the second group of transmitter that comprises independent transmitter, this independent transmitter emission, if if this transmitter belongs to the transmitter subclass and first channel of first channel services is available, this method is included in the emission on first channel in first group of channel, otherwise, if the holder of channel comprises available second channel, then through the second channel emission, wherein holder comprises all channels in first group of channel of not serving any transmitter subclass.

In addition, according to a preferred embodiment of the invention, channel separates by their transmission frequency.

In addition, according to a preferred embodiment of the invention, channel separates by their transfer encoding.

In addition, according to a preferred embodiment of the invention, these channels comprise CDMA (code division multiple access) channel.

In addition, according to a preferred embodiment of the invention, at least some channels comprise wireless channel.

According to a preferred embodiment of the invention, the subset definition step also comprises for each subclass selects a subclass main frame from the transmitter of subclass, through control channel subclass host addressing channel assignment request.

In addition, according to a preferred embodiment of the invention, select the subclass main frame, be used for the transmitter of this subclass and the transmitter communication of other subclass that the subclass main frame belongs to so that farthest utilize control channel.

According to a preferred embodiment of the invention, the transmitter that belongs in the subclass of other subclass of maximum quantity is selected as the subclass main frame.

In addition, according to a preferred embodiment of the invention, this method comprises that also the subclass that belongs to from it by the transmitter that will lose (dropout) disconnects the transmitter of abandoning losing, and comprises that this transmitter of losing of main frame of only notifying each subclass disconnects.

According to a further advantageous embodiment of the invention, a system that utilizes first group of channel by second group of transmitter is provided equally, this system comprises channel dispenser, during operation with in three groups of transmitter subclass of at least one channel allocation to the in first group of channel each, each subclass comprises in second group of transmitter at least one, this channel is shared in the transmitter of this transmitter subclass, feasible three groups of transmitter subclass of all channel allocation to the less than first group of channel, therefore stipulate a holder that also is not assigned to the channel of any transmitter subclass, share the channel of channel holder in all second group of transmitters during the operation of Channel Sharing device.

The special advantage of the inventive method is that this method is typical NP complete (NP-complete).

Accompanying drawing is briefly described

In conjunction with the accompanying drawings, the present invention may be better understood by the following detailed description.

Fig. 1 is the simplification functional-block diagram according to the channel assigning system of preferred embodiment of the present invention structure and work, and it gives channel allocation in several transmitters of spatial distribution;

Fig. 2 is illustrated in as the Euclidean space between the obstacle of wall and distributes, simultaneously also at several transmitters of spatial distribution;

Fig. 3 is illustrated in several transmitters of the equal number of non-euclidean spatial distribution;

Fig. 4 is the description of some transmitter subclass;

Fig. 5 is a figured relation between the subclass I of Fig. 3 and the subclass VI;

Fig. 6 illustrates the result that the colouring of subclass figure is handled;

The contiguous clique of each among Fig. 7 A-7F explanation subclass I-VI;

Fig. 8 is the form that concerns between subclass and the contiguous clique in the example of summing up Fig. 2-7F;

Fig. 9 is one and is illustrated in the form that allocated channel belongs to each local holder to which channel before the subclass;

Figure 10 is one and is illustrated in channel A and B and has distributed to the form which channel after the subclass I-IV belongs to each local holder;

Figure 11 A be shown in the presentation graphs 11B use processing taken place after which channel belong to the form of each local holder;

Processing is used in Figure 11 B explanation, and wherein transmitter #1 uses channel C from its local holder;

Figure 12 A be shown in the presentation graphs 12B use processing taken place after which channel belong to the form of each local holder;

Processing is used in Figure 12 B explanation, and wherein transmitter #21 uses channel D from its local holder;

Figure 13 A be shown in the presentation graphs 13B use processing taken place after which channel belong to the form of each local holder;

Processing is used in Figure 13 B explanation, and wherein transmitter #15 uses channel C from its local holder;

Figure 14 A be shown in the presentation graphs 14B use processing taken place after which channel belong to the form of each local holder;

Processing is used in Figure 14 B explanation, and wherein transmitter #17 uses channel D from its local holder;

Figure 15 A be shown in the presentation graphs 15B use processing taken place after which channel belong to the form of each local holder;

Processing is used in Figure 15 B explanation, and wherein each of transmitter #1, #15, #17 and #21 has been returned channel and the transmitter #4 that their use and used channel C from its local holder;

Figure 16 A be shown in the presentation graphs 16B use processing taken place after which channel belong to the form of each local holder;

Processing is used in Figure 16 B explanation, and wherein transmitter #8 uses a channel (transmitter #4 does not also return its channel) from its local holder;

Figure 17 A be shown in the presentation graphs 17B use processing taken place after which channel belong to the form of each local holder;

Processing is used in Figure 17 B explanation, and wherein each of transmitter #7 and #9 is used a channel from their local holders separately;

Figure 18 A has described the time series of transmitter #1-#10 on 500 milliseconds high relatively channel request density time cycle.As shown, each transmitter can be " high (up) " state or at " low (down) " state." high " state is represented the free time (channel that does not promptly have request), otherwise " low " state represents to have the channel of request;

Figure 18 B is 100 milliseconds of time cycles of the time cycle interior " amplification " of Figure 18 A;

Figure 19 A is described in the time series of 500 milliseconds low relatively last transmitter #1-#10 of channel request density time cycle.As shown, each transmitter can be a " high " state or at " low " state." high " state is represented the free time (channel that does not promptly have request), otherwise " low " state represents to have the channel of request;

Figure 19 B is 100 milliseconds of time cycles of the time cycle interior " amplification " of Figure 19 A;

Figure 20 is the simplified flow chart explanation that is used for the preferred method of operation of Fig. 1 connection matrix generator;

Figure 21 is the simplified flow chart explanation that is used for the preferred method of operation of Fig. 1 transmitter subclass generator;

Figure 22 is the simplified flow chart explanation that is used for the preferred method of operation of Fig. 1 subclass graphic structure unit;

Figure 23 is the simplified flow chart explanation that is used for the preferred method of operation of color element on Fig. 1 subclass figure;

Figure 24 is a form that the pattern of the input that is applicable to annex A or accessories B is shown;

Figure 25 is the simplified flow chart explanation that is used for the preferred method of operation of the local holder administrative unit of Fig. 1;

Figure 26 is the simplified flow chart explanation of method for optimizing that is used to finish the minimum cost channel calculation of Figure 25 step 870;

Figure 27 A-27B is the spectral density figure of two transmitters, and this figure forms the pictorial definition of term " central channel ", " adjacent channel " and " alternate channel ";

Figure 28 is the illustrative that transmitter adopts three kinds of diverse ways and other network components communication;

Figure 29 is the illustrative of two transmitter communications simultaneously in the same subsets;

Figure 30 is the schematic diagram of progressively handling that subclass produces;

Figure 31 is the explanation that realizes colored colouring on the subclass figure.

Figure 32 is the explanation with undirected subclass figure of given edge length.

Figure 33 is the explanation of data flow in the basic cell structure.

Here Fu Jia annex can help to understand the preferred embodiments of the present invention, annex such as followingly illustrate and describe:

Annex A and B are the another embodiment of the present invention that realizes with software, and its receiver/transmitter connection matrix is as input, and finish following function: the transmitter subclass produces, subclass graphical configuration and contiguous clique are calculated;

Annex C is the software matrix of optimization technique that is used to provide the management optimization circulation of annex A or accessories B method;

Annex D is the initialization files that are used for annex A or B;

Annex E is the example by the output file of the ascii text file generation that comprises Figure 24 data of operation annex A or B; And

Annex F is a software matrix of finishing the Matlab process of the unit 60 of Fig. 1 and 70 functions.

Preferred embodiment is described in detail

The disclosed part of this patent file comprises material protected by copyright.When it occurred with patent and trademark office patent file or record, the copyright owner did not oppose accurately to duplicate any one patent document or disclosed patent, but keeps all copyright rights whatsoever in other cases.

Fig. 1 is the simplification functional-block diagram according to the channel assigning system of preferred embodiment of the present invention structure and work, and it gives channel allocation in first group of transmitter of spatial distribution.Typically, transmitter is as the access point of bigger one group of work station (not shown).

Term " channel " is used to comprise any device or instrument or the path or the line attachment that can send signal or data or information, includes but not limited to cable channel such as TV cable TV and long-distance underground cable; Wireless channel such as radio channel, optical fiber and satellite; And top any combination.

Term " connection " is defined as the mutual sensitivity between two or more transmitters.When comprising operation, the system of Fig. 1 produces the connection matrix generator 10 of matrix, the rank that is communicated with between the interior every pair of transmitter of first group of transmitter of its element representation.

Produce second group of subclass during 20 operations of transmitter subclass generator, each subclass comprises some transmitters.The transmitter of each subclass is typically shared at least one channel, without any this channel of the qualified use of transmitter beyond the subclass, except can be again with channel and can not disturb transmitter the subclass of transmitter in the subclass in fact.

Transmitter communication mutually in the subclass, for example when " common " transmitter by any wired or wireless device suitably during to the master transmitter requirement channel of subclass.Typically, in the subclass channel can be used for communication in subclass.This channel is called subclass " control channel ".

Should be appreciated that the transmitter in each subclass can suitably use their shared channels.Channel can be individually or partly (for example, is passed through time-sharing option (TSO)) and be used for following some or all of function, function (a) and (b) be controlled function and function (c) is normal function of use:

A. as described in detail later, particular transmitter is that self is to main memory request channel in the permission subclass.For example, transmitter can use channel B so that can receive channel C from main memory for it self request channel and according to response.

On the other hand, should be appreciated that transmitter can transmit for the request of this transmitter through specific channel by the main memory allocated channel, it promptly is not in the main memory channel one that this channel is not used in other purpose.Specific channel even can be through being different from the medium of channel in the main memory.

B. allow the work station request of subclass service to insert transmitter.For example, work station can use channel B so that " hope " of notifying it is to send data or by Internet service.According to response, (for example, transmitter No.3) in the transmitter can use specific channel to come self to ask a channel of main memory for it.According to response, main memory can send data to transmitter No.3 through channel C to transmitter No.3 and work station by allocated channel C subsequently.On the other hand, if suitable time-sharing option (TSO) is used for channel B, the request from transmitter No.3 to main memory can be through channel B emission.

C. typically allow particular transmitter to transmit data, so that serve specific work station.

Can use any appropriate protocol to come communication between management work station and the transmitter, for example TDMA (time division multiple access), loop agreement such as token ring; ALOHA, PPMA (the inquiry multiple access of trying to be the first), GRAP (grouping arbitrary access inquiry), CSMA (carrier sense multiple access connection) are as CSMA-CD (CSMA-collision detection mode) and CDMA (code division multiple access).Can use agreement or their any suitable combination of any appropriate protocol above for example any to manage the communication between the transmitter between communication between the transmitter in the subclass and the subclass.

The processing that realizes in annex A is finished before being preferably in the operational phase activation.

Return with reference to Fig. 1, during subclass graphical configuration unit 30 operation figure of structure with the connection of expression subclass, if here their nearest member (member) transmitters separately each other quite near subclass be considered to be communicated with.

Calculate during 34 operations of contiguous clique computing unit by all contiguous cliquish set in the subclass figure of unit 30 structures.The method for optimizing that is used for unit 34 operation that comprises a suitable source code example is at TAB Professional and Reference Books, BlueRidge Summit, and PA, USA, 1989 Lau describes in the pattern algorithm 59-69 page or leaf of H.T..

Make allocated channel give this subclass by the subclass figure colouring that unit 30 is produced when color element 40 is operated on the figure, the color showing of each subclass (node) is assigned to channel there.Allow to use the channel of minimum number by the channel allocation of figure colouring, guarantee that simultaneously each subclass can not disturb transmitter in any other subclass in fact to the use of channel.The functional-block diagram of the preferred embodiment of color element 40 on the figure has been described in Figure 23.The preferred embodiment that comprises color element on the figure of suitable source code example is at TAB Professional and Reference Books, Blue RidgeSummit, and PA, USA, 1989 Lau describes in pattern algorithm the 4th chapter of H.T..Pattern algorithm also provides the code of finishing the colouring of subclass figure.

Management comprises that all also are not assigned to the main memory of the channel of particular subset during 50 operations of storage management device.Storage management device 50 is functional units, and in fact, it is typically finished by each transmitter.Finishing each transmitter of holder management function can be scheduled to, but preferably they are selected.In the embodiment of explanation, distribution or selection transmitter are finished the holder management function during 60 operations of subclass host assignment subelement, typically master transmitter of each subclass.Preferably all master transmitters are identical states and do not have " master-master (master-master) transmitter ".Yet, in some applications, may preferably distribute or predetermined one " master-master transmitter ", it can comprise or not comprise in the master transmitter one.

Typically, the selected conduct of the master transmitter of each subclass belongs to the transmitter in the subclass of other subclass of maximum quantity, and promptly transmitter has maximum contiguous clique.Should be appreciated that if the master transmitter of subclass A also is the member among the subclass B then preferably the interior transmitter of subclass A can utilize the control channel of subclass A so that the control channel of control channel, master transmitter and the subclass B of process subclass A transmits the member of message to subclass B.This is typical situation, even the main frame of subclass A is not the main frame of subclass B.Best, this utilization only is allowed to when control channel is the free time, promptly from the channel of primary subset request through primary subset preferential and other subclass carry out general communication.

Usually, selection is that this selection utilizes control channel by using the not control channel of distributing to this subclass subsequently effectively maximumly as the special advantage with maximum contiguous cliquish transmitter of subclass main frame, makes that the connection between the subclass reaches maximum.

Each manager transmitter of serving particular subset comprises local holder administrative unit 70, and this unit is a functional unit, and the viewpoint from this subclass during operation is managed main memory.As described in detail later, here be also referred to as by the main memory of the particular subset manager administration of representing particular subset by " the local holder " of this subclass.Should be appreciated that subclass manager itself typically requires channel and in this case sometimes, typically, this subclass manager is to the oneself requirement channel, is similar in the subclass other transmitter to manager requirement channel.

Term " distribution (assign) " is used to represent to provide to subclass the processing of channel, and this channel " belongs to " this subclass and not only " used " by subclass.Term " is assigned (allocate) " and is used for representing " to lend " processing that a channel is given independent transmitter by main memory.

Fig. 2 is illustrated in as the Euclidean space between the obstacle 120 of wall and distributes, simultaneously also at several transmitters 110 of spatial distribution.

Fig. 3 is illustrated in several transmitters of the equal number of non-euclidean spatial distribution.Should be appreciated that a kind of typically non-euclidean tolerance of the tolerance that is used for distance between the regulation transmitter.For example, if use non-euclidean space such as Labochevsky or Minkowski tolerance, it is proportional that the signal strength signal intensity that exists between the distance between the transmitter and these transmitters is propagated (typically adopting electromagnetism dB to measure).Minkowski measures at Moyseyev, R., and Chapter 2, and Dover Books is described in 1942 the spatiotemporal motion.The use of Minkowski tolerance is at Dover, and Prentice-Hall is described during the theory of relativity of 1942 P.G.Bergmann is the ABC of.Being used for the network address that the present invention illustrates the suitable Minkowski tolerance department of physics of Virginia Commonwealth Univ. below of embodiment describes: http://astsun.astro.virginia, edu/～eww6n/math/MinkowskiSpace.html.

Several transmitters are typical, and making does not have cross-talk in fact, and promptly the distance between each transmitter and it self is infinite, and it is equivalent to zero distance under Labochevsky tolerance.

The transmitter that should be appreciated that Fig. 3 can be considered to a complete figure, and wherein each transmitter is that a node and the weighting that connects the edge of per two nodes are the distances between them.This distance for example can be the Labochevsky metric range, expresses with dB.If the location of two transmitters makes them not receive each other, then the distance between them typically is considered to infinitely great.

Definition transmitter subclass makes that at least one is included in each transmitter subclass in 21 transmitters (in current example) now, and preferably each transmitter is included at least one subclass.

Fig. 4 illustrates 6 subclass, and each comprises 5 or 6 transmitters, but should more generally understand, and any amount of transmitter comprises only having a transmitter to can be contained in the specific subclass.

In order to produce the subclass of Fig. 4, can use following criterion:

A. each subclass has the transmitter of predetermined maximum quantity and the transmitter that each subclass has predetermined minimum number.For example, as shown in Figure 4, this rule can be that each subclass must comprise 5 or 6 transmitters.

B. for each transmitter, there is the subclass of the qualified maximum quantity that belongs to of this transmitter.In the example of explanation, each transmitter is qualified to belong to only many to 2 subclass.Yet more generally, some transmitters can qualifiedly belong to only 3 subclass, and another transmitter for example can qualifiedly belong to only subclass.

In order to make transmitter belong to n subclass, typically, transmitter has the ability to work simultaneously in the different channel of n, for example typically comprises n that separate and independently transmitter unit, for example n different wireless device.For example, belong to 2 subclass in order to make a radio transmitter, this radio transmitter typically comprises two separate and radio units independently.This is a reason setting up the qualified maximum quantity subclass that belongs to of each transmitter.Yet, in some applications, be preferably used in the channel quantity that the subclass of the maximum quantity of particular transmitter can be launched less than this transmitter.

C. the quantity that only belongs to the transmitter of a single subclass should be minimum.

D. the subclass quantity of Lian Jieing should be minimum.If the distance between two subclass less than in predetermined communicating door limit value such as the case illustrated-91dB, then they are " connected ".

Do not have " distance " between two subclass of public member and be defined as in first subclass minimum range between any transmitter in any transmitter and second subclass.The distance that has between public member's the subclass is zero, has therefore that public member's subclass always is considered to connect.

E. the cliquish quantity of vicinity that belongs to of each subclass should be minimum.Each subclass S has one " contiguous clique ", and this clique comprises all subclass that are connected to S.Therefore, the cliquish quantity of vicinity that belongs to of each subclass S equals to be connected to the quantity of the subclass of S.

Can use any suitable technology to produce and satisfy the subclass of top criterion (a), as technology based on combination algebraically or neural net or artificial useful life (artificiallife) method or Monte Carlo (Monte Carlo) method to (e).The publication of describing artificial useful life method comprises:

At L.D.Whitley (Ed.), Morgan Kaufmann, San Mateo, CA is in primary (genetic) algorithm basis _ 2 of USA D.Whitley " but execution model of simple genetic algorithms ".

At L.D.Whitley (Ed.), Morgan Kaufmann, San Mateo, CA is in genetic algorithms basis _ 2 of USA M.D.Vose " simple genetic algorithms modeling ".

Then, produce the figure that concerns between the expression subclass.Typically, if corresponding subclass is connected, then each node represents that a subclass and a pair of node are adjacent (edge are promptly arranged) in the figure between them.Fig. 5 illustrates the subclass I of presentation graphs 3 to the figure that concerns between the VI.

Use the color of minimum number, with the exploitable channel color coding and now the node in the figure (subclass) is painted.In other words, the color by node identifies the channel that belongs to corresponding to the subclass of this node.Should be appreciated that the node of this subclass will have multiple color (promptly the color vector length of this node is a plurality of) if a plurality of channel allocation is given a specific subclass.Can use any suitable method that channel is painted, as at TABProfessional and Reference Books, Blue Ridge Summit, PA, the colour of describing in the chapter 4 of the H.T.Lau pattern algorithm of USA colouring.

The channel of not distributing to any subclass is considered to belong to a main memory, and this holder is used by transmitters all in all subclass usually.As described in more detail below, the channel in the main memory can be used by a plurality of transmitters sometimes simultaneously.This situation is called " channel is used again " here.

Typically, be convenient to channel and use again by obtain local holder from main memory.Typically obtain a local holder for each transmitter subclass.Channel in the local holder of t preset time always is included in channel subset in the main memory at time t.An and if only if channel can be by corresponding to any transmitter among the transmitter subclass I of holder I with when any transmitter uses simultaneously among the transmitter subclass II of holder II, and this channel is included among two local holder I and the II simultaneously.More generally, an and if only if channel can be respectively used and when in fact noiseless, this channel is included in n the local holder simultaneously simultaneously by a member of every n transmitter subclass of n holder.

Typically, if the predetermined costs functional value of transmission quality is lower than threshold value between two transmitters, then two transmitters are considered to work " in fact noiseless ".For example, cost function can comprise the BER (error rate) of channel between two transmitters.

At the beginning, each local holder comprises transmitters all in the main memory.Yet, should be appreciated that subsequently according to the relation of each subclass and other subclass and according to the degree of each subclass needs channel, each local holder dwindle to some extent and again expansion go back.

According to the example of Fig. 2-6, the example that develops into 6 local holders from the main memory of serving 6 transmitter subclass is described now.

Fig. 7 A-7F explanation is respectively applied among the subclass I-VI the contiguous clique 200,210,220,230,240 and 250 of each.These cliques are defined by the contiguous clique computing unit 34 of Fig. 1.Each clique is by the dotted line identification around all its members.

Fig. 8 is the form that concerns between subclass and the contiguous clique in the example of summing up Fig. 2-7F.Connection between two subclass of " X " expression.

Fig. 9 is an expression to which channel before the subclass belongs to each local holder as shown in Figure 6 at allocated channel a form.As described, each local holder comprises all channel A-G, and therefore, main memory also comprises all channel A-G certainly.

Figure 10 be an expression as shown in Figure 6 after channel A and channel B have distributed to subclass I-VI which channel belong to the form of each local holder.As described, each local holder only comprises channel C-G now, and therefore, main memory also only comprises channel C-G certainly.Should be appreciated that in this stage all 6 local holders are identical.

Figure 11 A be an expression such as Figure 11 B be shown in transmitter #1 after its local holder is used channel C which channel belong to the form of each local holder.Shown in Figure 11 B, because transmitter #1 (crosshatch) belongs to subclass II, and because subclass II only is connected to another subclass (subclass I), channel C only removes and still is retained in all other the local holder from the local holder of subclass I and II, promptly in the local holder of subclass III-VI.

Figure 12 A be an expression (shown in Figure 12 B) transmitter #21 after its local holder is used channel D and channel C be launched machine #1 return before which channel belong to the form of each local holder.Because transmitter #21 also belongs to subclass II shown in Figure 12 B, and because subclass II only is connected to another subclass (subclass I), channel D also only removes and still is retained in all other the local holder from the local holder of subclass I and II as channel C, promptly in the local holder of subclass III-VI.

Figure 13 A is an expression (shown in Figure 13 B) at transmitter #15 after its local holder is used channel C, even also be not launched under the situation that machine #1 returns at channel C, which channel belongs to the form of each local holder.Because transmitter #1 belongs to subclass II and the VI that is not connected respectively with #15, so this is possible.Because transmitter #15 belongs to subclass VI and only is connected to another subclass (subclass IV) because of subclass VI shown in Figure 13 B, channel C removes from the local holder of subclass VI and IV and still is retained in the local holder of subclass III and V.

Figure 14 A is a form expression (as shown in Figure 14B) which channel after transmitter #17 uses channel D from its local holder belongs to each local holder.Even because transmitter #17 is not connected with II with the subclass VI that #21 belongs to, channel D is launched machine #21 and uses, and this also is possible.Because transmitter #17 belongs to subclass VI and only is connected to another subclass (subclass IV) because of subclass VI as shown in Figure 14B, channel D removes from the local holder of subclass IV and VI and still is retained in the local holder of subclass III and V.

Figure 15 A be an expression (shown in Figure 15 B) at transmitter #1, #15, #17 and #21 each return channel that their use and transmitter #4 after its local holder is used channel C which channel belong to the form of each local holder.Shown in Figure 15 B, transmitter #4 belongs to subclass I and III.Because subclass I is connected to subclass II, III and IV and subclass III and is connected to subclass I and V, channel C removes from the local holder of subclass I-V and still is retained in the local holder of subclass VI.

Figure 16 A be an expression (shown in Figure 16 B) transmitter #8 from its local holder use a channel (transmitter #4 does not also return its channel) afterwards which channel belong to the form of each local holder.

Figure 17 A be an expression (shown in Figure 17 B) transmitter #7 and #9 each from their local holders separately use channel (transmitter #4 and #8 also do not return its channel) afterwards which channel belong to the form of each local holder.

Figure 18 A has described the time series at relative high channel request density transmitter #1-#10 on the time cycle of 500 milliseconds.As shown, each transmitter can be a " high " state or at " low " state." high " state is represented the free time (channel that does not promptly have request), otherwise " low " state represents to have the request channel;

Figure 18 B is 100 milliseconds of time cycles of the time cycle interior " amplification " of Figure 18 A.

Figure 19 A is described in the time series of 500 milliseconds last transmitter #1-#10 of low relatively channel request density time cycle.As shown, each transmitter can be a " high " state or at " low " state." high " state is represented the free time (channel that does not promptly have request), otherwise " low " state represents to have the request channel.

Figure 19 B is 100 milliseconds of time cycles of the time cycle interior " amplification " of Figure 19 A.

Figure 20 is the simplified flow chart explanation that is used for the preferred method of operation of Fig. 1 connection matrix generator.The input of Figure 20 method is the expression of for example using transmitter site in the space of conventional euclidian metric system.According to the rule of FCC (Federal Communications Committee) the 15th part, for 8 grades of FSK of typical case (frequency shift keying) modulating system of ISM frequency band, the official hour cycle as being similar to for 2 seconds, each transmitter is finished for all other carrier of transmitter and is measured.

Preferably except carrier wave is measured, by provide the coherent detection rate (CDR) that a FOM (quality factor) comes measurand transmitter for the clock that exists in the carrier wave.Unit 330 has connected paired information, and this information i.e. the information of the 310 and 320 relevant same transmit machines that arrive from the unit.The output of unit 330 is fed and is comprised the connection matrix computational process 334 of loop blocks 340,350 and 360.

Produce a matrix during connection matrix generator 10 operation, the connectivity-level in the plain expression of this entry of a matrix system between the every pair of transmitter.In the case illustrated with 21 transmitters, connection matrix is the matrix of one 21 * 21 symmetry, and its diagonal is zero.

Figure 21 is the simple and clear flowchart text of preferred method of work of the transmitter subclass generator 20 of Fig. 1.In step 410, criterion (a) is the criterion of describing with reference to top Fig. 4 (a).

In step 430, for each unallocated transmitter, typically by the beeline between the transmitter that calculates any distribution in it and the different transmitter that distributes, and select to have the unallocated transmitter of minimum " beeline " conduct " nearest " and determine " nearest ".The tolerance of using in this step is not euclidean, but the connection matrix tolerance of Minkowski for example.

In step 440, criterion (a)-(e) is the criterion of describing with reference to top Fig. 4 (a)-(e).

Selectively completing steps 460.In this step, use the method for the genetic algorithms of the expansion of describing in the conventional publication of method as the Vose of reference here, optimize the distribution of the transmitter of finishing at step 400-450.

The output of Figure 21 method is typical transmitter subset vector, shown in annex E.

Figure 22 is the simplified flow chart explanation that is used for the subclass graphical configuration unit 30 preferred method of works of Fig. 1.The method of Figure 22 receives the transmitter subset vector as the method generation of Figure 21, and each subclass is handled as node in the figure.This method adds top edge and has every pair of subclass of common transmitter with connection, so produces the transmitter subclass figure as Fig. 5 figure.

Figure 23 is the simplified flow chart explanation that is used for the preferred method of work of color element 40 on the subclass figure of Fig. 1.The input of Figure 23 method is the subclass figure by the method generation of Figure 22.In step 610, " available " color is also not distribute to the color of any node.The output of Figure 23 is the subclass figure of colouring.The example of colouring subclass figure has been described among Fig. 6.

Figure 25 is the state machine explanation of simplification of the local holder administrative unit 70 of Fig. 1.Each transmitter has two states: idle and " needing channel ".

In step 830, term " subclass main frame " refers to the main frame of the subclass that transmitter belongs to, if perhaps this transmitter belongs to a plurality of subclass, refers to any main frame of any subclass that transmitter belongs to.

Figure 26 is a method for optimizing of finishing the least cost channel calculation step 870 of Figure 25.

Figure 27 A-27B has formed the definition of the explanation of term " central channel ", " adjacent channel " and " alternate channel ".Figure 27 A and 27B are respectively the spectral density figure of first and second transmitters.As shown, the frequency spectrum of first transmitter (Figure 27 A) comprises main lobe 1010, first secondary lobe 1020 and 1030, second secondary lobe 1040 and 1050.The frequency spectrum of second transmitter (Figure 27 B) comprises main lobe 1060, first secondary lobe 1070 and 1080, second secondary lobe 1090 and 1100.The main lobe of each transmitter has taken the channel that is called this transmitter ' central channel '.When specification is spoken of transmitter and " used channel ", this means that the channel of using becomes the central channel of this transmitter.

Two first secondary lobes of each transmitter take two channels separately, and they are called two " adjacent channels " of transmitter.Two second secondary lobes of each transmitter take two channels separately, and they are called two " alternate channels " of transmitter.Therefore, if the central channel of transmitter A be adjacent channel or or even the alternate channel of another transmitter B, then the interference between transmitter A B is shown in Figure 27 A-B.

From the viewpoint of transmitter A with respect to transmitter B, " zero cost (zerocost) " uses and refers to B and used a channel, and the overlapping situation of central channel, adjacent channel or alternate channel of neither one and A in the adjacent channel of this channel or the alternate channel.

From the viewpoint of transmitter A with respect to transmitter B, " non-zero cost (non-zerocost) " uses and refers to B and used a channel, and at least one overlapping situation in central channel, adjacent channel or the alternate channel of at least one and A in the adjacent channel of this channel or the alternate channel.

Typically, if for every other transmitter T, in fact, just allow transmitter A to use this channel owing to use and handle the ratio of amplitude that the interference cause is not more than the adjacent channel of the central channel of T and any one T.

If the ratio of the amplitude of the amplitude of the central channel of A and the central channel of B equals the central channel of A and the ratio of adjacent channel amplitude, the interference level for transmitter A that is caused by transmitter B is called " adjacent-channel interference level ".

Similarly, if the ratio of the amplitude of the central channel of the amplitude of the central channel of A and B equals the ratio of the amplitude of the central channel of A and alternate channel, the interference level for transmitter A that is caused by transmitter B is called " alternate channel interference level ".

Typically, if two channels in identical holder, then do not disturb between them.

Figure 28 is the illustrative of transmitter 1500, and as outputting communication channel A, B and C (dotted line) and incoming traffic channel D, E and F (solid line) expression, it is with three kinds of different modes and other network components communications.

As shown, transmitter 1500 is sent in the wireless telecommunications envelope of transmitter 1500 independent network components 1510 ' in the plurality of network part 1510 through channel A with information, transmitter 1500 can with these network components communications of regulation.Transmitter 1500 through channel B transmission information to another network components 1520, this part be described as with transmitter 1500 in identical subclass 1530, but also need not to be this situation.Channel B is a channel of tasking transmitter 1500 according to preferred embodiment of the present invention branch.Transmitter 1500 is through channel C and through for subclass 1530 and the 1550 public subclass main frame 1540 other transmission information transmitter 1560 in the subclass 1550.

Transmitter 1500 is through channel D independent network components 1510 from plurality of network part 1510 in the wireless telecommunications envelope of transmitter 1500 " reception information.Transmitter 1500 through channel E from another network components 1520 reception information, this part be described as with transmitter 1500 in identical subclass 1530, but also need not to be this situation.Channel B is a channel of tasking transmitter 1500 according to preferred embodiment of the present invention branch.Transmitter 1500 is through channel F and through receiving from the transmitter 1560 in transmitter in the subclass 1550 such as the subclass 1550 or the information of any other transmitter in addition for subclass 1530 and 1550 public subclass main frames 1540.

Figure 29 is the illustrative of two transmitters 1500 and 1540 communications simultaneously (respectively with transmitter 1540 and 1520) in the same subsets 1530.This situation is possible, because a channel that is using branch to task subclass 1530 in the transmitter 1500, and other transmitters (subclass main frame 1540) are using the control channel of subclass 1530.

The preferred process that is used to produce subclass is described now.

Suppose several transmitters of random distribution (access point) in a limited range, some in them can be connected to cable network, transmitter may phase mutual interference, and cause in the network and disturb.

Following description has stipulated to keep intelligent network segmentation and the access engine that relates in maximum frequency reuse and the robustness simultaneously again at the segmentation topological structure that maximum network efficient and performance are provided, and promptly sets up the network of powerful connection between the transmitter with maximum network data flow.

Following method is grouped into transmitter in the subclass of logic, and its actual characteristic is a complete figure (transmitter is the summit of figure here).After the segmentation of a plurality of transmitter subclass, the subclass figure produces.In order to strengthen the property, the figure of generation will satisfy ask for something (following discussion).

Suppose to utilize limited and frequency not enough quantity, the figure colouring is used to distribute the frequency state of minimum essential requirement to the subclass figure.This processing is called FCA (fixing channel allocation).During operation, local group of frequencies is defined (frequency holder group), and subclass will require to use frequency from this subclass according to channel.

In the structure of a plurality of subclass, by many intrinsic topological structure characteristics, travelling carriage for subclass cover show non-dynamically and each travelling carriage preferably be relevant at least one subclass in this group.Follow time slot formula-aloha (slotted-aloha) device that the channel request of R-TDMA data sorting catches by the back and finish access.Data entity by each emission of particular transmitter acceptance in the subclass will be analyzed for the target that its solves.Judgement subsequently will be passed on the purpose transmitter (be responsible for for destination at last insert the transmitter of step) of this data entity to it through subclass (at this moment it suppose to be connected).

Initial and boundary condition comprises:

Emission unit { AP};

When dB is a transformation matrix, and dB _IjDisturb conversion in the transmitter when being the absolute value of interference ratio of transmitter (I) and transmitter (J);

Threshold value for the regulation of the relative interference ratio that provides with absolute value dB;

The transmitter α of minimum number on the subclass _Min

The transmitter α of maximum quantity on the subclass _Max

Greatest number of wireless electrical interface p on each transmitter;

One group of limited discrete frequency { f}; And

The channel κ that is used for the fixed qty of a subclass.

Topological structure produces

The model that describes below will launch unit be mapped to the subclass group R} keeps simultaneously:

1) boundary condition: d, e and f

2) make the transmitter that belongs to single subclass minimum, this can pass through $(\underset{i}{\overset{\left\{R_j\right\}}{\mathrm{\Σ}}}\frac{{\mathrm{\α}}_{{\mathrm{Rm}}_i}-{\mathrm{\α}}_{{\mathrm{Rs}}_i}}{{\mathrm{\α}}_{{\mathrm{Rm}}_i}+{\mathrm{\α}}_{{\mathrm{Rs}}_i}},\frac{1}{R}\underset{i=1}{\overset{1}{\mathrm{\Σ}}}{\mathrm{\α}}_{{\mathrm{Rs}}_i}\·{({\mathrm{\α}}_{{\mathrm{Rm}}_i}-\stackrel{\‾}{{\mathrm{\α}}_{\mathrm{Rm}}})}^2)$ Minimize expression.

3) subclass of not disturbing of maximum quantity, frequency reuse can realize like this.Noiseless being defined as $\mathrm{\φ}=\left\{\mathrm{AP}\right\}|\mathrm{AP}\∉R_i\∩R_j$ ，i＝1…R，j＝1…R，i≠j

4) be defined as when being close to clique $\left\{C_i\right\}=\left\{\mathrm{AP}\right\}|\mathrm{AP}\∉R_i\∩R_j$ , j=1 ... when R, i ≠ j, the clique that subclass belongs to minimizes.

Work as Cost _iBe defined as Cost _i=Cost _c+ ω Cost _φ, ${\mathrm{Cost}}_c=\min \left(\underset{i=1}{\overset{{\left|\right|c}_R\left|\right|}{\mathrm{\Σ}}}{\mathrm{\α}}_{\mathrm{Ri}}\right),$ Cost _φ=min φ, d are the quantity (possible combination) of not isomorphic map, and ω is when being weighted factor, and the arrangement of given subclass topological structure is defined as min (Cost ₁..., Cost _d).

Suppose that the generation of subclass following the generation of each transmitter (possible power transfer), the removal of transmitter simultaneously do not cause subclass change till some predetermined costs functions are destroyed (this cost function can be the throughput criterion, be communicated with lose, special external disturbance etc.).

The channel allocation engine that operates in the system is finished distributions (figure colouring) through the subclass topological structure, comprises less subclass because of figure clique like this, so the quantity (vertex color) of the fixed frequency of the figure that need be used to paint becomes less.

Figure 30 and following description be used under initial condition that subclass produces and satisfy above the model that progressively carries out of the requirement listed.

The AP of Xuan Zeing at the beginning _kBe positioned at " barycenter " of an emission group of planes, promptly satisfy following conditions,

When NN=‖ during AP} ‖, ${\mathrm{\Σ}}_{j}d{B}_{\mathrm{kj}}\min {\left\{{\mathrm{\Σ}}_{j}d{B}_{\mathrm{ij}}\right\}}_{i=1}^N$

Construct first subclass by using following mode that transmitter is integrated into to distribute for the first time, ${\mathrm{<figure-callout\; id="1"\; label="R"\; filenames="A99815468.700661.png,A99815468.700691.png"\; state="\{\{state\}\}">R</figure-callout>}}_1=\left\{A{P}_k\right\}+{\left\{{\mathrm{AP}}_s\right\}}_{s=2}^{{\mathrm{\&alpha;}}_{\max }}|{\mathrm{dB}}_{\mathrm{ks}}\&le;{\mathrm{dB}}_{\mathrm{kl}}\&ForAll;l=s+1..N,{\mathrm{dB}}_{\mathrm{ks}}\&le;{\mathrm{dB}}^{\left(\mathrm{th}\right)}$

Remaining subclass is set up with the step of two iteration, and the transmitter that step 1 is selected is for the nearest transmitter of all ready existing subclass, and the integrated transmitter of step 2 will be the connection transmitter between previous subclass and the current subclass.In step 3, select other free transmitter till the border of definition.Step 1: the AP of selection _kBe positioned at " barycenter " of an emission group of planes, promptly satisfy following conditions,

Operate in as j on the transmitter of existing subclass, and AP _kWhen from transmitter freely, selecting, ∑ _jDB _Kj=min{ ∑ _jDB _Ij.

Step 2: select { AP} _i ^MinMake each AP _jBelong to existing subclass, and AP _jReserve f does not have other transmitter in any existing subclass, it for the dB of APk less than the dB of APj for APk.

Finish subclass to α through step 1 and 2 from launching unit freely _Max

HCA

Suppose not expansion, require this system to solve the channel allocation problem.Usually, channel allocation speed is by its spectrum intervals (it preferably required minimum) and blocking probability (obstruction is defined as when needing channel but situation can not utilize the time) weighting.

Channel allocation process can be divided into two different modes of operation (so this is a mixed processing):

The channel that fixed channel assignment (FCA)-it distributes to determined number is to each subclass κ, and guarantees that by doing like this subclass traffic carrying capacity is communicated with.

The channel holder that dynamic channel allocation (DAC)-it requires as the subclass channel.Because it is space-time (time and scope are the function of subclass) that the subclass channel requires speed, different holders forms during in working order gradually.

FCA

In channel group, on the subclass figure, finish colored colouring, by κ kind color assignment being given each subclass and passing through referring to the explanation of Figure 31 colouring with these color map.After doing like this, new channel group is defined (channel group that does not have distribution) and names it as channel holder group.

The colouring of non-directional figure G is that branch mixes colours to the node of G, makes to have identical color without any the adjacent node of G.The colored quantity of G is the color that need be used to cover the minimum number of G.

Work as C _n(G _R) be G _RColored quantity the time ‖ { f} _Res‖=‖ { f} ₀‖-κ C _n(G _R).

Finish colouring by simple implicit expression counting tree searching method.At the beginning, node 1 is assigned with color 1, and remaining node is made node I adopt the color colouring of lowest number by colouring sequentially, and this color also is not used in any node colouring adjacent to node i.Suppose that p is the number of colors by this rational colouring requirement.Attempt using q＜p kind color to produce reasonably colouring.In order to realize this point, all adopt the node of p colouring to be painted again.Like this, trace back step may proceed to node u, and node u+1 is the mix colours minimum subscript of p of branch here.Attempt to adopt the another kind of color of the minimum operational bigger than current color for colored node u.If do not have such another kind of color, then trace back to node u-1 less than p.Otherwise the color of employing minimum operational is painted again to node u and is continued forward, node u+1, the u+2 that sequentially paints all again ..., painted or some node v reach the requirement of color p up to node n.In the previous case, found the improved colouring of using q kind color; Review in this case and attempt to use and find better colouring less than q kind color.Under latter event, as reviewing by node v and continue forward in the front.Algorithm stops when reviewing arrival node 1.

DCA

As defined above, after the FCA process, in holder, there is ‖ { f} _ResThe ‖ exploitable channel.{ f} _ResBe assigned to G _RIn each subclass.Each subclass is used channel according to internal request from this group.The criterion of using channel from holder is as giving a definition:

Nearest figure G for given subclass request _NnDefined like this: work as V={R ₁... R _RAnd E={R _i, R _jMake R _i∩ R _jG during ≠ 0|i ≠ j _Nn={ V, E}.As { f} _{The R of clique}={ f} _Self-{ f} _NnRThe time, for given subclass from { f} _ResExploitable channel be defined as { f} _R={ f} _Res-{ f} _{The R of clique}

The blocking probability that present regulation is used based on the channel of DCA suggestion, and prove that like this subclass topological structure produces the model condition.

When Be that the unified of all channels that uses in clique or subclass R organized and { f} _{Conflict R}When being channel (the discussing later on) group of conflict

_{The R of group}-{ f} _{Conflict R}In other words,

The contiguous request of expression, and

From these symbols, very clear { f} _{The R of clique}Depend on contiguous cliquish traffic carrying capacity.Should be appreciated that and preferably need be used to construct ‖ { f} _ResThe channel quantity of ‖ makes can not occur blocking in system by this way.

The R subclass needs the α as the peak value requirement after FCA _R-1 channel is like this so that eliminate blocking probability

And By this point, minimum α _ROr ‖ c _R‖ will cause ‖ { f} _Res‖ _MinMinimize, remember ‖ { f} _Res‖ _MinIt is the vector on the R.

Suppose ‖ { f} _{Conflict R}‖ is given constant, and then the system level optimization is passed through $\underset{i=1}{\overset{R\&Element;G_m}{\mathrm{\&Sigma;}}}{\left|\right|{\left\{f\right\}}_{{\mathrm{res}}_i}\left|\right|}_{\min }$ Minimize and provide.Like this, blocking probability P _B() _RCan pass through $P_B{\left(\right)}_R=\min (1,\frac{{\left|\right|{\left\{f\right\}}_{\mathrm{resR}}\left|\right|}_{\min }}{\left|\right|{\left\{f\right\}}_{\mathrm{resR}}\left|\right|})$ Provide.Attention: the abruptness of probability decay is the function of traffic carrying capacity requirement and access device.

Insert

Produce description as subclass, transmitter is used as the summit addressing of line graph, and is grouped in the high subclass that connects.Each subclass is as network segmentation in logic, and the same with network like this, each subclass becomes wireless area.The travelling carriage of roaming under the overlay area of particular subset (mobile subscriber) receives and transmission information (based on the mode of packets of information) through subclass " gateway "-transmitter.How its information of transmitter collection and this information are transmitted for travelling carriage on network is unessential.

Describe two layered protocols now: agreement is also referred to as radio MAC agreement in the subclass, and it is responsible for coordination and the message output that radio is handled; And

The subclass agreement is responsible for the connectivity in the control of subclass transmitter, Frequency Distribution and the subclass.

The generality that is agreement is below described and relevant Mathematical Modeling.

The cut-in method of describing is finished two main tasks: coordinate and aerial high capacity data processing.The coordination function that each task is restricted to some boundary conditions: MAC be restricted to finish the transmission request catch with subclass on the timing of transmitter synchronous.The processing section of MAC is called LLC (link layer control) and its purpose is processing channel request (from the angle of Frequency Distribution), and handles the data business volume on the radio channel.

Each transmitter is finished individually based on the access request of time slot formula-Aloha and is caught and with the transmission under the reprocessing R-TDM state on the subclass.In order to finish the R-TDM part of agreement, the DCA algorithm activates (these requests send to through subclass media the subclass main frame-it is in the transmitter one) by the transmitter of request.

Transmitter is accepted permission periodically to produce time slot formula-aloha contention window.Use special-purpose channel, it is through radio transmitting CCLR broadcast message bag (contention begins notice).In response, by sending the control frame based on the RTS that inserts at random (request sends), all active mobile station that do not engage with some transmitter are carried out contention in this is handled.Transmitter is stored all access requests in the request buffer (RTS formation).The formation of using regulation is as FIFO, and the travelling carriage that its inquiry is waited for is used for transfer of data.Under the situation of subclass one side addressing travelling carriage, use oppositely inquiry.

Because time slot formula aloha device is very responsive for the correctness of randomization seed (seed), by discussing with remaining transmitter of same subsets, this transmitter should calculate the estimate amount of active mobile station in the subclass of next aloha contention window, and subsequently this understanding is included among the contention person possible on the CCLR control frame.

Second layer agreement is finished three kinds of main tasks:

Be used for time slot formula-aloha contention Token Control transmission regularly of transmitter sub-cluster,

Trunk as the channel allocation coordination: request and release frequency baseband; And

Data business volume in control and the contiguous clique of transmission subclass between the transmitter.

This is an agreement based on token, and can have two types token on same subclass.The purpose that subclass is coordinated token is to coordinate time slot formula-aloha contention regularly.In case receive such token, pass on return request (different or identical transmitter) from subclass main frame through (the RTS formation is not empty, perhaps exists and can utilize data to be used for radio station) transmitter under the situation of wireless radio transmission at the subclass channel at needs.Main frame is preferably by allowing or refuse this channel to respond (at this moment notifying all contiguous sub-cluster) at once.Notice that this token only rolls in the subclass under it (home Subset), and it is transparent for the contiguous subclass in the contiguous clique.Second token type rolled in contiguous clique, promptly in all contiguous subclass cocycles.It allows as inserting as the token subclass, in case receive it, just allows not idle transmitter to transmit its data packets (reaching some predetermined burst lengths that provide in chronomere).

Finish the destination address analysis in the following manner.In case receive data packets (source position for it is constant), transmitter compares it and the current faciation of subclass, supposes that promptly each transmitter has the complete information about the current address quene state of all transmitters on same subsets.If destination address is positioned at subclass (not having information on the contiguous subclass), transmitter is transferred to affiliated transmitter (home-transmitter) with this packets of information, otherwise this packets of information is addressed for not solution, and be sent to contiguous subclass, this packets of information will circulate in whole contiguous clique by this way.

Each transmitter is finished the IP route from subclass topological structure viewpoint.Each data packets that transmits through the subclass topological structure adopts its initial radio transmitter (affiliated transmitter) IP address to encapsulate.Purpose transmitter subclass (the transmitter subclass that the purpose travelling carriage is positioned at the back can be wired lan or travelling carriage) is peelled off this encapsulation, and source transmitter IP is mapped to MAC packets of information address.

For fear of packets of information circulation and broadcast storm disturbance (storm), realize the minimum spanning tree self-configuring.

Because system condition disturbs as time correlation and the function of the traffic carrying capacity state of change, generates tree graph shape and is recomputated periodically.Target is defined as follows: adopt given edge length (traffic carrying capacity under our situation and its typical B ER) to consider non-directed graph G.Target is the edge length summation minimum in the feasible tree of finding out among the G of generation tree, referring to Figure 32.

Following processing is gone up at G (subclass figure) and is obtained this target.At the beginning, it is empty T being set.CONSIDERING EDGE is included among the T with the non-reduction order of their length (cost).If edge discord edge in T forms a ring then it is included among the T.When being included among the T, n-1 edge form minimum generation tree.In realization, the edge adopts ground, the marginal portion classification (binary tree, wherein the weighting of each node is not more than its son's (son) weighting) of their minimums in the bottom of pile structure.Be 0 (mlogm) running time of handling above, and m is the quantity at edge in the figure here.

Basic cell structure is as following description and illustrate in Figure 33.Arrow is represented data flow.The formation performance of the transmitter of its hypothesis investigation is managed by 6 random processes:

A. pass through the formation addition (not considering destination locations) of aerial agreement in the subclass;

B. process subclass agreement is from the formation addition that is arranged in another transmitter of same subsets, and promptly destination address is in the transmitter queue of investigation;

C. through the formation addition of subclass agreement from another transmitter that is not positioned at same subsets, promptly destination address is in the transmitter queue of investigation;

D. subtract each other through the formation of agreement in the subclass, promptly the destination is positioned at after the transmitter of investigation, and reflects in transmitter queue;

E. subtract each other through the formation of subclass agreement, promptly the destination is positioned at after the transmitter of same subsets; And

F. subtract each other through the formation of subclass agreement, promptly the destination is positioned at after the transmitter of same subsets, but its purpose transmitter is not the subclass member.

Suppose the hidden Markov model of a formation dynamic characteristic.System-level model of structure from these formations integrated.The formation dynamic characteristic is determined through the stochastic equation formula, gets over the redirect time (event-step-jump time) on the incident rank and calculates.The derivation that these equations and they connect each other is as follows.

{Q} ₀{P}{dQ}{Q} _Δt

{dQ}{Uy} _Δt

{Q} _Δt{DL} _Δt

As { Q} _{Δ t}={ Q} _{-Δ t}+ { during dQ}

1) structure of A process

Single mobile station passes through for the probability that enters substantially of single time slot formula-aloha $\frac{1}{n_E}{(1-\frac{1}{n_E})}^{n_n-1}$ Provide.n _EBe the estimate amount of contention travelling carriage, n _aBe actual contention travelling carriage quantity.Suppose that any two travelling carriages in probability distribution Γ (n) the regulation subclass have the probability that a certain dB threshold value difference promptly has part to disturb on identical time slot, the probability that successfully obtains for the time slot of u travelling carriage conflict on the identical time slot can be estimated as $\frac{1}{{n_E}^u}{(1-\frac{1}{n_E})}^{n_n-u}\&CenterDot;{\mathrm{\&Gamma;}}^k\left(n\right),k=\frac{u(u-1)}{2}$ Like this, there is the whole time slot access probability of BER to pass through $P_A=S\&CenterDot;\underset{u=1}{\overset{n_u}{\mathrm{\&Sigma;}}}\frac{1}{n_E^u}{(1-\mathrm{fer})}^u{(1-\frac{1}{n_E}(1-\mathrm{fer}))}^{n_u-u}\&CenterDot;{\mathrm{\&Gamma;}}^k\left(n\right)$ Provide; S is the quantity of time slot in time slot-aloha window.

The quantity of active mobile station is passed through Be the quantity of travelling carriage in the RTS formation of transmitter in the subclass.

The estimate amount of representing activating moving platform through some algorithm patterns best.Along with evaluated error increases, through the nonlinear increase of access stand-by period of aloha device.

Suppose that a travelling carriage enters the probability of transmission request queue, it preferably is converted to actual packets of information quantity: Δ Q _RTS=min (1, P _A) n _aBecause be used for the Δ t that the aloha token of duration is transmitted on the time rank of probability Estimation _CCLR, and it is very short, Δ Q _RTSCan not be transformed into packet queue at once.Like this, calculate and distribute the time of advent of reality.Suppose that definition arrives time arrow $Q_{\mathrm{arr}}=\{{\mathrm{<figure-callout\; id="0"\; label="t"\; filenames="A99815468.700821.png,A99815468.700871.png"\; state="\{\{state\}\}">t</figure-callout>}}_0+\frac{P_{L_t}}{{\mathrm{Rate}}_{\mathrm{Air}}},\&hellip;,{\mathrm{<figure-callout\; id="0"\; label="t"\; filenames="A99815468.700821.png,A99815468.700871.png"\; state="\{\{state\}\}">t</figure-callout>}}_0+\frac{P_{L_{\mathrm{\&Delta;QRTS}}}}{{\mathrm{Rate}}_{\mathrm{Air}}}\},$ ${\mathrm{<figure-callout\; id="0"\; label="t"\; filenames="A99815468.700821.png,A99815468.700871.png"\; state="\{\{state\}\}">t</figure-callout>}}_0=t_{\mathrm{prev}}+\frac{{\mathrm{\&Delta;}t}_{\mathrm{CCLR}}}{P_f}$ P _fBe probability through the tolerance frequency of DCA processing, t _PrevIt is the time (initial time is the time t that floats) that previous packets of information arrives.

2) structure of B and C process

Definition P _DRIt is the probability that the packets of information that produces in given subclass sends to the travelling carriage in the same subsets.Destination address is positioned at the probability of transmitter queue of investigation by t _PrevProvide; Work as n ^(Ri)When being travelling carriage quantity total in the subclass (activation with free time), the destination address of this expression formula hypothesis packets of information distributes on address realm equably.Like this, the quantity of the packets of information that preferably can control of the transmitter of investigation is passed through $R_{Q_B}=\left(\frac{Q_{\mathrm{RTS}}^j}{n^{\left(R_i\right)}}\right)\&CenterDot;\underset{\stackrel{k=1}{k\&NotEqual;j}}{\overset{{\mathrm{\&alpha;}}_{R_1}}{\mathrm{\&Sigma;}}}\left(P_{\mathrm{DR}}{\&CenterDot;Q}_{\mathrm{RTS}}^k\right)$ Provide; At this moment j is the transmitter of investigation.C process-formation addition be since packets of information from the cliquish far-end subclass of identical vicinity.Such packets of information of probability control to(for) the transmitter of investigation passes through $P_{\mathrm{Qc}}=\frac{Q_{\mathrm{RTS}}^j}{\underset{i=1}{\overset{\left|\right|c\left|\right|-1}{\mathrm{\&Sigma;}}}{R}^{\left(i\right)}}$ Provide; At this moment $\underset{i=1}{\overset{\left|\right|C\left|\right|-1}{\mathrm{\&Sigma;}}}{R}^{\left(i\right)}$ Be the quantity of subclass in the contiguous clique, do not comprise the subclass of the transmitter of investigation.Here suppose that all subclass are operated in identical operating state.

In conjunction with two processes (B and C), be provided at Δ t _CCLRThe quantity of the packets of information that produces in the whole contiguous clique of interval transmitter control by inquiry.Suppose that the subclass token gives transmitter, it can ${\mathrm{\&Delta;t}}_{\mathrm{TR}}=\frac{\mathrm{Br}}{{\mathrm{Rate}}_R}$ Given cycle stipulated time transmits through subclass; At this moment Br is a burst lengths in the minimal information bag.The quantity of the packets of information of like this, by inquiry transmitter control by ${\mathrm{\&Delta;Q}}_{B+C}=\left(\frac{P_{Q_B}+P_{Q_C}}{\underset{k=1,k\&NotEqual;j}{\overset{\left|\right|C\left|\right|}{\mathrm{\&Sigma;}}}{R}^{\left(k\right)}}\right)\&CenterDot;\&lsqb;\frac{{\mathrm{\&Delta;t}}_{\mathrm{CCLR}}}{{\mathrm{\&Delta;t}}_{\mathrm{TR}}}{\&CenterDot;\mathrm{Rate}}_R\&rsqb;$ Provide; At this moment $\&lsqb;\frac{{\mathrm{\&Delta;t}}_{\mathrm{CCLR}}}{{\mathrm{\&Delta;t}}_{\mathrm{TR}}}\&CenterDot;{\mathrm{Rate}}_R\&rsqb;$ Be at Δ t _CCLRThe packets of information quantity (this can be the packets of information percentage) that duration transmits.

3) structure of E and F process

The probability that the transmitter of investigation need send contiguous clique (not being the aerial of it) to passes through $P_{E+F}=1-P_{\mathrm{DR}}\&CenterDot;\frac{Q_{\mathrm{RTS}}^j}{n^{\left(R_i\right)}}-(1-R_{\mathrm{DR}})\&CenterDot;Q_{\mathrm{RTS}}^j$ Provide and simplifying this expression formula $P_{E+F}=1-Q_{\mathrm{RTS}}^j(P_{\mathrm{DR}}\&CenterDot;(\frac{1}{n^{\left(R_i\right)}}+1)-1)$ Afterwards; With this probability expression be transformed to by $q_{\mathrm{RTS}}^j\&CenterDot;\&lsqb;1-Q_{\mathrm{RTS}}^j(P_{\mathrm{DR}}\&CenterDot;(\frac{1}{n^{\left(R_i\right)}}+1)-1)\&rsqb;$ The packets of information quantity that provides; Like this, by the investigation transmitter be sent to contiguous clique (representing on its subclass) packets of information quantity by $\mathrm{\&Delta;}{Q}_{E+F}=\frac{Q_{\mathrm{RTS}}^j\&CenterDot;\&lsqb;1-Q_{\mathrm{RTS}}^j(P_{\mathrm{DR}}\&CenterDot;(\frac{1}{n^{\left(R_i\right)}}+1)-1)\&rsqb;}{N\&CenterDot;\underset{k=1}{\overset{\left|\right|C\left|\right|}{\mathrm{\&Sigma;}}}{Q}_{\mathrm{RTS}}^k}\&CenterDot;\&lsqb;\frac{\mathrm{\&Delta;}{t}_{\mathrm{CCLR}}}{\mathrm{\&Delta;}{t}_{\mathrm{TR}}}\&CenterDot;{\mathrm{Rate}}_R\&rsqb;$ Provide; At this moment N be transmitter in whole contiguous clique quantity and by $N=\underset{k=1}{\overset{\left|\right|c\left|\right|}{\mathrm{\&Sigma;}}}{\mathrm{\&alpha;}}_{R_k}$ Provide.

Here the top description hypothesis that comprises is used for the loop agreement of communication between the interior transmitter of subclass and is used for the circulation time slot formula ALOHA of communication between the subclass transmitter.

The applicability that a special advantage of the preferred embodiment of the present invention is this equipment is not limited to have the communication system that the interference space particular transmitter distributes.Typically, Chang Gui system is applicable to transmitter topological structure specific, symmetry.According to the preferred embodiment of the present invention, this equipment is applicable in fact any transmitter topological structure, and to be specially adapted to transmitter be in the application of moving and therefore the transmitter topological structure changed along with the time.

The special advantage of another of the preferred embodiment of the present invention is that the transmitter that belongs to a plurality of subclass is specially adapted to as transmitting, i.e. information between the subclass that belongs to of retransmitter.

The transmitter of the maximum quantity of each subclass is typically determined by the subclass transmission rate.For example, can transmit maximum 10mbps, then typically can not have to be allowed to belong to each subclass so that prevent channel wastage more than 10 transmitters if the speed of subclass medium is 100mbps and each transmitter.

Optimization software of the present invention is implemented among the annex A-C and illustrates, it comprises the computer-list of software implementation example of the present invention.

Annex A and B are the additional embodiments that realizes in software of the present invention, and the transmitter connection matrix that their receive as Fig. 1 unit 10 produces is as input, and the unit 20,30,34 of realization Fig. 1 and 40 function.

Annex C is the software matrix of optimization technique that is used to provide the management optimization circulation of annex A or accessories B method.

Be used for providing the Vose publication of the management method for optimizing reference in the above that optimization circulates to describe.

Annex D is the initialization files that are used for annex A or B.

Annex E is the example that comprises the output file that the ascii text file of the annex A of Figure 24 data or accessories B produces by operation.

Annex F is a software matrix of finishing the Matlab process of the unit 60 of Fig. 1 and 70 functions.This process operation is at Matlab (matrix experiment chamber) for Windows, and Version5.0 is above and can be from MathWorks Inc., Cochituate Place, and 24 PrimePark Way, Natick, MA 01760, and USA obtains on the market.This process receives the output of annex A or B as input, as the demonstration output of annex E.

Figure 24 is a form that is applicable to the pattern of the input of annex A or accessories B.The table content of Figure 24 is the input example that is fit to Fig. 2-Figure 19 B example in the expression present description.

Utilize the method for optimizing of computer-list of annex A-annex C as follows:

A. use the PC 486 that has Delphi Pascal, under the suitable title shown in annex A-C (unit, interface use constant etc.), produce the unit and the keying of the content of annex A and B or C.

B. use " master " program editing and the operating software of Delphi Pascal.

Should be appreciated that if desired software section of the present invention can use ROM (read-only memory) form to realize.Usually, if desired, software section can use conventional technology to adopt hardware to realize.

Should be appreciated that the specific embodiment of describing in the annex only provides details disclosed by the invention and is not intended for use restriction.

Should be appreciated that the various characteristics of describing from the embodiment angle of separating of the present invention also can provide in combination for for the purpose of clear among single embodiment.On the contrary, for the sake of brevity, the various characteristics of describing from single embodiment angle of the present invention also can provide individually or the combination of any suitable part.

It should be appreciated by those skilled in the art the content that illustrates especially and describe above the invention is not restricted to.Scope of the present invention is only stipulated by following claims.

Annex A

   unit Ring_generation_routine；   interface   uses      Windows，Messages，SysUtils，Classes，Graphics，Controls，Forms，   Dialogs，      StdCtrls，ExtCtrls；  const           MaxNumofAP＝500；           MaxNumOfRings＝50；  type      TForml＝class(TForm)         Button1：TButton；         Button2：TButton；         Panell：TPanel；         Edit1：TEdit；         Button3：TButton；         procedure Button1Click(Sender：TObject)；         procedure Button2Click(Sender：TObject)；         procedure Button3Click(Sender：TObject)；     private         (Private declarations)     public         (Public declarations)     end； var     Forml：TForml；     (I/O related variables)    K_File          ： string；    Mass_File       ： string；    R_File          ： string；    V_File          ： string；    A_File          ： string；    inifile         ： string；    WriteOut        ： string；    Ini_file        ： TextFile；    Out_File        ： TextFile；    (Common variables)    NumofAP         ： Word；   MaxP_onRing      ： Word；   MaxRing_forAP    ： Word；   Sensitivity      ： Integer；   Rings            ： Word；   Ring             ： array [1..MaxNumOfRings，1..MaxNumofAP] of Integer；   procedure Initiation；   procedure Main_Loop；   procedure Generate_Rings；   procedure Output；implementation<!-- SIPO <DP n="35"> --><dp n="d35"/>(SR  *.DFM) Procedure main_loop begin　　　　    initiate；　　      Generate_Rings；　　      Output； end； procedure Initiation； var　　  i，j；Word； begin　　     Randomize；　　     inifile：＝′d：\sim\MAC-Sim\5GHz\ring.ini′；　　     AssignFile(Ini_File，inifile)；　　     Reset(Ini_File)；　　          Readln(Ini_File，NumofAP)；　　          Readln(Ini_File，Sensitivity)；　　          Readln(Ini_File，MaxAP_onRing)；　　          Readln(Ini_File，MaxRing_forAP)；　　          Readln(Ini_File)；　　          Readln(Ini_File，K_File)；　　          Readln(Ini_File，WriteOut)；　　     CloseFile(Ini_File)；　　     (read the K Map)　　     AssignFile(Ini_File，K_File)；　　     Reset(Ini_File)；　　          for i：＝1 to NumofAP do　　              begin　　                for j：＝i to NumofAP do read(Ini_File，K_Map[i，j])；　　                readln(Ini_File)；　　              end；　　     CloseFile(Ini_File)；end；procedure Generate_rings；varTemp，i：Word；Distance：array[1..MaxAP，1..MaxAP]of Word；Temp_Distance，Pointr：array[1..MaxAP]of Word；NumOfRings：Word；begin　　 NumOfRings：＝0；(CALCULATE THE DISTANCE MATRIX FROM AP LOCATION MATRIX-THE EUCLIDEANCASE)　　 for AP_a：＝1 to NumofAP do　　   for Ap_b：＝1 to NumOfAP do　　     Distance[AP_a，AP_b]：＝Sqrt(Sqr(Field[AP_a，1]-Field[AP_b，1])<!-- SIPO <DP n="36"> --><dp n="d36"/>　　                                                 +     Sqr(Field[AP_a，2]-Field[AP_b，2]))；　　       for i：＝1 to NumofAP do　　          for AP_a：＝1 to NumofAP-1 do　　              for AP_b：＝AP_a+1 to NumOfAP dp　　                 if Distance[i，AP_a]＞Distance[i，AP_b] then　　                    begin　　                      Temp：＝Distance[i，AP_b]；　　                      Distance[i，AP_b]：＝Distance[i，AP_a]；　　                      Distance[i，AP_a]：＝Temp；　　                    end；　　      for AP_a：＝1 to NumofAP do　　          for AP_b：＝1 to NumOfAP dp  (FIND THE AP THAT IS THE MASS CENTER OF THE CLOUD)　　   for AP_a：＝1 to NumOfAP do Temp_Distance[AP_a]：＝0；　　   for AP_a：＝1 to NumOfAP do　　     for AP_b：＝1 to NumOfAP do　　       Temp_Distance[AP_a]：＝Temp_Distance[AP_a]+Distance(AP_a，AP_b]；　　   Temp：＝1；　　   for AP_a：＝2 to NumOfAP do　　     if Tamp_Distance[AP_a)＜Temp_Distance[Temp)then Temp：＝AP_a； (GENERATE FIRDT RING)　　  Pointr[1]：＝1；　　  Ring[1，1]：＝Temp；　　  Inc(RingsOnAP[Temp])；　　  for AP_a：＝1 to MaxAP_onRing-1 do　　    begin　　      Inc(Pointr[1])；　　      Ring(1，procedure Output；var   i，j：Word；begin　　 AssignFile(Out_File，WriteOut)；　　 Rewrite(Out_File)；　　 for i：＝1 to Rings do　　     begin　　        write(Out_File，′Ring′，i：3，′：′)；　　        for j：＝1 to NumofAP do　　             write(Out_File，K_Map[NumofAP+1-i，j])；　　        writeln(Out_File)；　　     end；　　 CloseFile(Out_File)；end；procedure TForml.ButtonlClick(Sender：TObject)；begin　　Panell.visible：＝true；　　Main_Loop；<!-- SIPO <DP n="37"> --><dp n="d37"/>　　   Panell.Visible：＝false；end；procedure TForml.Button2Click(Sender：TObject)；begin　　Halt；end；procedure TForml.Button3Click(Sender：TObject)；begin　　  inifile：＝editl.text；　　  Button1.Visible：＝true；　　  Button2.Visible：＝true；　　  Edit1.Visible：＝false；　　  Button3.Visible：＝false；end；end.

Accessories B

 unit MAC_5GHz； interface uses　　Windows，Messages，SysUtils，Classes，Graphics，Controls，Forms， Dialogs，   StdCtrls，ExtCtrls； const　　  MaxNumofAP      ＝    200；　　  MaxNumofRings   ＝     80；　　  MaxNumofRings3  ＝    210；　　  H_MaxNumofAP    ＝     50；type  TForml＝class(TForm)　　Button1：TButton；　　Bunton2：TButton；　　Panell：TPanel；　　Edit1：TEdit；　　Button3：TButton；　　procedure Button1Click(Sender：TObject)；　　procedure Button2Click(Sender：TObject)；　　procedure Button3Click(Sender：TObject)；  private　　(Private declarations)  public　　(Public declarations)  end；var  Form1：TForml；  (I/O related variables)  K_File             ： string；  Mass_File          ： string；  R_File             ： string；  V_File             ： string；  A_File             ： string；  inifile            ： string；  WriteOut           ： string；  Ini_file           ： TextFile；  Out_File           ： TextFile；  (Common variables)  NumofAP         ： Word；  MaxAP onRing    ： Word；  MaxRing_forAP   ： Word；  Sensitivity     ： Word；  Rings           ： array[1..MaxNumofRings，1..H_MaxNumofAP]of Word；  MinAP_onRing    ： Word；  R               ： Word；  Termination     ： Boolean；  R_Point         ： array[1..MaxNumofRings]of Word；  First_In_Ring   ： array[1..MaxNumofRings]of Word；  Free Pointr     ： Word；  Treshold        ： Single；  Option          ： Word；<!-- SIPO <DP n="40"> --><dp n="d40"/>   Distance_Parameter ： Word；   Rings_OnAP       ： array [1..MaxNumofAP]of Byte；   K_Map            ： array [1..MaxNumofAP，1..NaxNumofAP]of Word；   Distance， d     ： array [1..MaxNumofAP，1..MaxNumofAP]of Single；   Free_List        ： array [1..MaxNumofAP]of Word；   Graph            ： array [1..MaxNumofRings，1..MaxNumofRings]of Word；   procedure Generate_Locations；   procedure Initiation；   procedure Generate_rings；   procedure Generate_Ring_Graph；   procedure Output；   procedure Main_Loop；implemantation(SR *，DFM)(****************************)procedure main_loop；begin　　 initiation；　　 Generate_rings；　　 Generate_Ring_Graph；　　 Output；end；(****************************)procedure Generate_Locations；var   i，j：Word；begin　　 Randomize；　　 AssignFile(Ini_File，K_File)；　　 Rewrite(Ini_File)；　　 Case Option of　　      1：for i：＝1 to NumofAP do　　           writeln(Ini_File，Random(300)+1，′′，Random(300)+1)；　　                                 ′　　      2：for i：＝1 to Trunc(Sqrt(NumofAP)+1) do　　           for j：＝1 to Trunc(Sqrt(NumofAP)+1) do　　             writeln(Ini_File，10+i*10，′′，10+j*10)；　　end；(of Case)　　ClcseFile(Ini_File)；end；procedure Initiation；<!-- SIPO <DP n="41"> --><dp n="d41"/>  var　　 i，j：Word；　　 Location：array[1..MaxNumofAP，1..2]of Word；  begin　　   inifile：＝′d：\sim\MAC-Sim\5GHz\ring.ini′；　　   AssignFile(Ini_File，inifile)；　　   Reset(Ini_File)；　　        Readln(Ini_File，NumofAP)；　　        Readln(Ini_File，Sensitivity)；　　        Readln(Ini_File，MinAP_onRing)；　　        Readln(Ini_File，MaxAP_onRing)；　　        Readln(Ini_File，MaxRing_forAP)；　　        Readln(Ini_File)；　　        Readln(Ini_File，Option)；　　        Readln(Ini_File，K_File)；　　        Readln(Ini_File，WriteOut)；　　   CloseFile(Ini_File)；　　   Generate_Locations；　　   (read the the AP Location Map ＝＝＝＝  if the user choice is″Random″ then　　    skipp this reading loop)　　   AssignFile(Ini_File，K_File)；　　   Reset(Ini_File)；　　        for i：＝1 to NumofAP do　　            readln(Ini_File，Location(i，1)，Location[i，2])；　　   CloseFile(Ini_File)；　　   (Calculate the Distance Matrix)　　   Distance_Parameter：＝1；(Euclidian)　　   Case Distance Parameter of　　     1：for i：＝1 to NumofAP do　　                      for j：＝1 to NumofAP do　　                        Distance[i，j]：＝SQRT(Sqr(Location[i，1]-Location[j，1])+　　                                               Sqr(Location[i，2]-Location[j，2]))；　　   2：        for i：＝1 to NumofAP do　　                     for j：＝1 to NumofAP do　　                       if i＜＞j then　　                          Distance[i，j]：＝Location[i，1]-Location[j，1]else　　                          Distance[i，j]：＝0；　　 end；(of case)　　 (initiate working arrays and variables)　　 for i：＝1 to MaxNumofRings do　　   begin　　     R_Point[i]：＝0；　　     First_In_Ring[i]：＝0；　　   end；   R：＝0；end；procedure Generate_Rings；<!-- SIPO <DP n="42"> --><dp n="d42"/>  procedure WorkArea；(generate a working metrix for the distances]  var　　 i，j ：Word；  begin　   for i：＝1 to NumofAP do　　       for j：＝1 to NumofAP do d[i，j]：＝Distance[i，j]；  end；  procedure FreeAP；(Find the free-APs)  var　　 i，j，k：word；　　 K_Not_Free：Boolean； begin　　         for k：＝1 to NumOfAP do　　           begin　　             K_Not_Free：＝False；　　             for i：＝1 to R do　　                 for j：＝1 to R_Point[i] do　　                     if Rings[i，j]＝k then K_Not_Free：＝True；　　             if not(K_Not_Free)then　　                begin　　                 Inc(Free_Pointr)；　　                 Free_List[Free_Pointr]：＝k；　　                end；　　           end；　　  (check if all APs are assigned)　　  if Free Pointr＝0 then Termination：＝True　　    else Termination：＝False； end； var (of ring-generation Procedure) i，j，Min_Indx，Min_Indx_to：Word； k，l，m：Word； Left：Word； Min：Single； Temp，Temp_indx：array[1..MaxNumofAP]of Word； begin　　  Min_Indx：＝65000；　　  WorkArea；　　  (find Cluster center)　　  for i：＝1 to NumofAP do Temp[i]：＝0；　　  for i：＝1 to NumofAP do　　      for j：＝1 to NumofAP do Temp[i]：＝Temp[i]+Trunc(1+d[i，j])；　　Min：＝65000；　　for i：＝1 to NumofAP do　　    if Temp[i]＜Min then　　      begin　　           Min：＝Temp[i]；　　           Min_Indx：＝i；　　      end；　　Inc(R)；　　Inc(R_Point[R])；　　Rings[R，R_Point[R]]：＝Min_Indx；<!-- SIPO <DP n="43"> --><dp n="d43"/>　　       First_In_Ring[Min_Indx]：＝1；　　       (update number of rings per AP)　　       Inc(Rings_OnAP[Min_Indx])；　　       (add the rest of the APs to the ring)　　       for j：＝1 to MaxAP_onRing-1 do　　         begin　　           Min：＝65000；　　           for i：＝1 to NumofAP do　　             if(d[Rings[R，1]，i]＜Min) and　　               (d[Rings[R，1]，i]＞0) then　　               begin　　                    Min：＝d[Rings[R，1]，i]；　　                    Min_Indx：＝i；　　               end；　　          Inc(R_Point[R])；　　          Rings[R，R_Point[R]]：＝Min_Indx；　　          d[Rings[R，1]，Min_Indx]：＝0；　　          (update number of rings per AP)　　          Inc(Rings_OnAP[Min_Indx])；　　        end；　　      (GENERATE ALL OTHER RINGS)　　      (find the nearest Free-AP to one of the rings APs)　　       Termination：＝False；　　       While not(Ternination) do　　         begin　　           WorkArea；　　           Free_Pointr：＝0；　　           FreeAP；　　           [For all Free APs find the AP that has the closest NOT-FreeAP)　　           Min：＝65000；　　           for i：＝1 to Free_Pointr do　　               for j：＝1 to NumofAP do　　                 if (d[Free_List[i]，j]＜Min) and (d[Free_List[i]，j]＜0) and　　                    (First_In_Ring[i]＝0)and(Rings_OnAP[j]＞0) then　　                   begin　　                     Min：＝d[Free_List[i]，j]；　　                     Min_Indx：＝i；　　                   end；　　          if Min＜65000 then　　             begin　　               Inc(R)；　　               Inc(R_Point[R])；　　               Rings[R，R_Point[R]]：＝Free_List[Min_Indx]；　　               d[Rings[R，1]，Free_List[Min_Indx]]：＝0；　　               First_In_Ring[Free_List[Min_Indx]]：＝1；　　               (update number of rings per AP]　　               Inc(Rings_OnAP[Free_List[Min_Indx]])；　　             end；<!-- SIPO <DP n="44"> --><dp n="d44"/>　　            (perform the first stage of generation：co-locate all   connected　　             APs up to min treshold)　　            for j：＝1 to MinAP_onRing do　　                begin　　                     Min：＝65000；　　                     for i：＝1 to NumofAP do　　                         if(d[Rings[R，1]，i]＜Min)and(Rings_0nAP[i]＞0)  and　　                           (Rings_OnAP[i]＜MaxRing_forAP) and　　                           (d[Rings[R，1]，i]＞0)then　　                           begin　　                                Min：＝d[Rings[R，1]，i]；　　                                Min_Indx：＝i；　　                           end；　　                   if Min＜65000 then　　                     begin　　                       Inc(R_Point[R])；　　                       Rings[R，R_Point[R]]：＝Min_Indx；　　                       d[Rings[R，1]，Min_Indx]：＝0；　　                       (update number of rings per AP)　　                       Inc(Rings_OnAP[Min_Indx])；　　                     end；　　             end；　　         (perform the second stage of generation：co-locate all free　　          APs up to max treshold)　　         (calculate treshold：the maximal distance to a connected AP)　　         (this parameter should be changed to a better criterion to sute the　　          non-Euclidian spase.the best will be if the ap in a given ring　　          will be at the most equal distance from one to the other.　　          There is a possibility that a cetrain ap will not be able to　　          connect，thus it should generate a seperate ring，and skipp the　　          first stage of the connected ap acquisition)　　         Treshold：＝0；　　         for j：＝2 to R_Point[R]do　　             if distance[Rings[R，l]，Rings[R，j]]＞Treshold then　　                Treshold：＝distance[Rings[R，1]，Rings[R，j]]；　　         j：＝1；　　         While(j＜＝MaxAP_onRing-MinAP_onRing-1)or(Termination) do　　             begin　　                  Min：＝65000；　　                  for i：＝1 to NumofAP do　　                      if(d[Rings[R，1]，i]＜Min)and(Rings_OnAP[i]＝0)and　　                        (d[Rings[R，1]，i]＞0)and　　                        (d[Rings[R，1]，i]＜Treshold)then　　                        begin　　                             Min：＝d[Rings[R，1]，i]；　　                             Min_Indx：＝i；　　                        end；　　                if Min＜65000 then　　                  begin　　                    Inc(R_Point[R])；<!-- SIPO <DP n="45"> --><dp n="d45"/>　　                      Rings[R，R_Point[R]]：＝Min_Indx；　　                      d[Rings[R，1]，Min_Indx]：＝0；　　                      (update number of rings per AP)　　                      Inc(Rings_OnAP[Min_Indx])；　　                    end；　　                  Inc(j)；　　             end；　　             if Not(Termination) then　　               begin　　                 Free_Pointr：＝0；　　                 FreeAP；　　               end；　　      end；(of While) end； procedure Generate_Ring_Graph； var　　i，j，k，Count：Word；　　Graph_Temp：array[1..MaxNumofRings3]of Word； begin　　  for i：＝1 to R do for j：＝1 to R do Graph[i，j]：＝0；　　  for i：＝1 to MaxNumofRings3 do Graph_Temp[i]：＝0；　　  Count：＝0；　　  for k：＝1 to NumOfAP do　　    (if Rings_OnAP[k]＞1 then)　　      begin　　        for i：＝1 to R do　　          for j：＝1 to R_Point[i] do　　            if Rings[i，j]＝k then　　              begin　　                Inc(Count)；　　                Graph_Temp[Count]：＝i；　　              end；　　        if Count＞＝2 then　　           for j：＝2 to Count do　　             begin　　               Graph[Graph_Temp[1]，Graph_Temp[j]]：＝1；　　               Graph[Graph_Temp[j]，Graph_Temp[1]]：＝1；　　             end；　　        Count：＝0；　　      end；end；procedure Output；var   i，j：Word；begin　　 AssignFile(Out_File，WriteOut)；　　 Rewrite(Out_File)；　　 Writeln(Out_File，′APs to Ring Mapping，and Ring connectivitylist′)；　　 Writeln(Out_File)；　　 for i：＝1 to R do　　     begin<!-- SIPO <DP n="46"> --><dp n="d46"/>　　        write(Out File，′Ring′，i：3，′：′)；　　        for j：＝1 to R_Point[i]do write(Out_File，Rings[i，j]：4]；　　        (write out the ring connectivity information)　　        for j：＝1 to (MaxAP_onRing-R_Point[i])do write(Out_File，′　　        write(Out_File，′**′)；　　        for j：＝1 to R do if Graph[i，j]＝1 then Write(Out_File，j：4)；　　        writeln(Out_File)；　　     end；　　 (　　 Writeln(Out_File)；Writeln(Out_File)；　　 Writeln(Out_File，′Ring Graph Connectivity Matrix′)；　　 Writeln(Out_File)；)　　 (for i：＝1 to R do　　   begin                                                            　　     write(Out_File，′Ring′，i：3，′；′)；　　     for j：＝1 to R do if Graph[i，j]＝1 then Write(Out_File，j：4)； 　　     writeln(Out_File)；　　   end；)　　 CloseFile(Out_File)；end；procedure TForml.ButtonlClick(Sender：TObject)；begin　　Panell.visible：＝true；　　Main_Loop；　　Panell.Visible：＝false；end；procedure TForml.Button2Click(Sender：TObject)；begin　　Halt；end；procedure TForml.Button3Click(Sender：TObject)；begin　　   inifile：＝edit1.text；　　   Button1.Visible：＝true；　　   Button2.Visible：＝true；　　   Edit1.Visible：＝false；　　   Button3.Visible：＝false；end；end.

Annex C

  program GA；  uses    crt；  const  (      PopMaxSize          ： Maximal number of genes in the system     GenaMaxSize         ： Maximal number of Allels in every gene　　     MutationSeed        ： Mutation rate for gene level　　     Threshold23read     ： Selection Strength　　     NumOfGenerations    ： Maximal number of generations in a search　　     AllelDimension      ： Numerical diversity of each　　　                            Allel[0，AllelDimension]　　     MutationSchemaBin   ： Time bin for mutation schema calculations　　                            in terms of number of generations.　　     WriteFrequency      ： The frequency of output schedule.　　     Generation          ： Generation countr.　　     PopSize             ： A matrix containing the genes and their allel　　                            information.　　     GeneSize            ： Number of allels.　　     PopCountr           ： General purpose countr for population scanning.　　     AllelCountr         ： Counter for the Gene level scanning.　　     CrossoverPointr     ： The location of the gene breaking point for the　　                            purpose of crossover.　　     NextPopCountr       ： The number of surviving individuals after the　　                            selection stage.　　     TotFitness          ： Mean population fitness.　　     PopFitness          ： An array containing the fitnesses of each gene　　                            in the population.　　    OffspringList        ： An array containing the offspringsinformation.　　    ModelGene            ： A golden gene.　　    MutationSchema       ： Low path filter over mutation to fitnesscrossing　　                            on an allel basis scale.　　    GenerationOutFile    ： Global log file.　　    f                    ： Output file.　　    PopMaxSize                    ＝  400；　　  GeneMaxSize                     ＝   30；　　  MutationSeed                    ＝   10；　　    AllelMutationSeed             ＝    8；　　    Threshold23reed               ＝    5；　　    AllelDimension                ＝   20；　　    NumOfGenerations              ＝ 2000；　　    MutationSchemaBin             ＝    1；　　    WriteFrequency                ＝  100；type　　  field      ＝  array[1..PopMaxSize]of single；　　  GenePop    ＝  array[1..PopMaxSize，1..GeneMaxSize]of integer；　　    TargetGene ＝  array[1..GeneMaxSize]of word；var<!-- SIPO <DP n="49"> --><dp n="d49"/>　　    Generation          ：word       ；　　  PopSize             ：word       ；　　    GeneSize            ：word       ；　　  PopCountr           ：word       ；　　  AllelCountr         ：word       ；　　  CrossOverPointr     ：word       ；　　     NextPopCountr      ：word       ；　　     TotFitness         ：single     ；　　  PopFitness          ：Field      ；　　  PopList             ：GenePop    ；　　  OffspringList         ：GenePop    ；　　    MocelGene           ：TargetGene ；　　    MutationSchema      ：TargetGene ；　　    GenerationOutFile   ：text       ；　　    f                   ：text      ；(---------------------------------------------------)Procedure NullArrays；begin　　 for PopCountr：＝1 to PopSize do　　     begin　　          PopFitness[PopCountr]：＝0；　　          for AllelCountr：＝1 to GeneSize do　　              OffspringList[PopCountr，AllelCountr]：＝0；　　     end；　　 For AllelCountr：＝1 to GeneSize do　　     MutationSchema[AllelCountr]：＝0；end；(---------------------------------------------------------)Procedure GenerateModelGene；begin　　 for AllelCountr：＝1 to GeneSize do　　     ModelGene[AllelCountr]：＝Random(AllelDimension+1)；end；(--------------------------------------------------------------------)Procedure InitiateIO；begin　　 Assign(GenerationOutFile，′c：\algrthms\ga\ga.out′)；　　 Rewrite(GenerationOutFile)；　　 ClrScr；end；(-----------------------------------------------------------------------)Procedure WriteOut；begin　　 writeln(GenerationOutFile)；　　 writeln(GenerationOutFile，′Generation：′，Generation，　　         ′； Mean Fitness：′，TotFitness：7∶5)；　　 writeln(GenerationOutFile)；　　 writeln(GenerationOutFile)；　　 for PopCountr：＝1 to Popsize do　　     begin　　          for AllelCountr：＝1 to GeneSize do　　              write(GenerationOutFile，PopList[Popcountr，<!-- SIPO <DP n="50"> --><dp n="d50"/>AllelCountr]：3)；               writeln(GenerationOutFile，′′，PopFitness[PopCountr]：7∶5)；                writeln(GenerationOutFile)；          end；      writeln(GenerationOutFile)；      writeln(GenerationOutFile)；end；(-------------------------------------------------------------)Procedure GeneratePop；begin      for PopCountr：＝1 to PopSize do　　      for AllelCountr：＝1 to GeneSize do　　            PopList[PopCountr，AllelCountr]：＝Random(AllelDimension+1)；end；(---------------------------------------------------------------------------------------)Function MutationRate：word；begin　　     MutationRate：＝Round(100*Sqrt(1-PopFitness[PopCountr]))；end；(-----------------------------------------------------------------------------------)Procedure AllocatePopFitness；var　　  Temp_Fitness：array[1..PopMaxSize] of single；begin　　 for PopCountr：＝1 to PopSize do Temp_Fitness[PopCountr]：＝0；　　     for PopCountr：＝1 to PopSize do　　         for AllelCountr：＝1 to GeneSize do　　             Temp_Fitness[PopCountr]：＝Temp_Fitness[PopCountr]+　　                ABS(PopList[PopCountr，AllelCountr]-ModelGene[AllelCountr])；　　 for PopCountr：＝1 to PopSize do　　     if Temp_Fitness[PopCountr]＝0 then Temp_Fitness[PopCountr]；＝1　　        else Temp_fitness[PopCountr]：＝0.9/Temp_Fitness[PopCountr]；　　   for PopCountr：＝i to PopSize do　　         PopFitness[PopCountr]：＝Temp_Fitness[PooCountr]；end；(---------------------------------------------------------------------------------------)Function OneGeneFitness：Boolean；var　　 TempOneGeneFitness：single；begin　　 TempOneGeneFitness：＝0；　　 for AllelCountr：＝1 to GeneSize do　　     TempOneGeneFitness：＝TempOneGeneFitness+　　        ABS(PopList[PopCountr，AllelCountr]-<!-- SIPO <DP n="51"> --><dp n="d51"/>ModelGene[AllelCountr])；　　 if PopFitness[PopCountr]＞＝TempOneGeneFitness then OneGeneFitness：＝False　　    else OneGeneFitness：＝True；end；(-------------------------------------------------------------------------------)Function AllelMutationRate：word；begin　　 if MutationSchema[AllelCountr]＜＝0 then AllelMutationRate：＝AllelMutationSeed　　    else AllelMutationRate：＝　　         AllelMutationSeed*(1+Trunc(Sqrt(MutationSchema[AllelCountr])))；end；(----------------------------------------------)Procedure PcpMutation；var　　  AllelMutationDirection：integer；begin　　  for PopCountr：＝1 to PopSize do　　        if Random(100)＜MutationRate then　　             for AllelCountr：＝1 to GeneSize do　　               if Random(100)＜AllelMutationRate then　　                  Begin  　　                     PopList[PopCountr，AllelCountr]：＝Random(AllelDimension+1)；　　                           if OneGeneFitness thenInc(MutationSchema[AllelCountr])　　                              else Dec(MutationSchema[AllelCountr])；　　                end；end；(---------------------------------------------------------------------------------------------------)Procedure CrossOver；var　　    PopChildren         ：word；　　    CrossOverLocation ：word；　　      GeneOne，GeneTwo  ：word；　　      POpLack           ：word；begin　　      If NextPopCountr * 3  ＞ 2 * PopSize then　　         NextPopCountr：＝(2*PopSize)div 3；　　      PopChildren：＝NextPopCountr+1；　　    PopCountr   ：＝1；　　    While PopCountr＜＝(NextPopCountr-1)do　　          begin　　                CrossOverLocation：＝Random(GeneSize-1)+1；　　                for AllelCountr：＝1 to CrossOverLocation do　　                    PopList[PopChildren，AllelCountt]：＝　　                          PopList[PopCountr，AllelCountr]；　　                      Inc(PopCountr)；　　                For AllelCountr：＝(CrossOverLocation+1)to GeneSizedo　　                    PopList[PopChildren，AllelCountr]：＝　　                          PopList[PopCountr，AllelCountr]；<!-- SIPO <DP n="52"> --><dp n="d52"/>　　                           Inc(PopCountr)；　　                                 Inc(PopChildren)；　　                 end；　　                for PopCountr：＝PopChildren to PopSize do　　                    begin　　                         GeneOne：＝Random(NextPopCountr)+1；　　                         GeneTwo：＝GeneOne；　　                         While GeneTwo＝GeneOne do　　                             GeneTwo：＝Random(NextPopCountr)+1；　　                         CrossOverLocation：＝Random(GeneSize-1)+1；　　                       for AllelCountr：＝1 to CrossOverLocation do　　                           PopList[PopCountr，AllelCountr]：＝　　                                 PopList[GeneOne，AllelCountr]；　　                       For AllelCountr：＝(CrossOverLocation+1)to GeneSizedo　　                           OffspringList[PopCountr，AllelCountr]：＝　　                                     PopList[GeneTwo，AllelCountr]；　　               end；end；(---------------------------------------------------------------------------------------)Procedure Selection；var　　  AddGene               ： word；　　  MaxGeneFitness        ： single；　　    MinGeneFitness      ： single；　　  ReproducingSpicies    ： array[1..PopMaxSize]of word；　　    TempPop             ： array[1..PopMaxSize，1..GeneMaxSize]ofword；begin　　    TotFitness      ：＝   0；　　  NextPopCountr  ：＝   0；　　  MaxGeneFitness ：＝   PopFitness[1]；　　  MinGeneFitness ：＝   PopFitness[1]；　　  for PopCountr  ：＝ 1to Popsize do　　      begin　　          TotFitness：＝Tot Fitness+PopFitness[PopCountr]；　　          if PopFitness[PopCountr]＞MaxGeneFitness then　　           MaxGeneFitness：＝PopFitness[PopCountr]　　               else if PopFitness[PopCountr]＜MinGeneFitness then　　                     MinGeneFitness：＝PopFitness[PopCountr]；　　       end；　　   TotFitness：＝TotFitness/PopSize；　　   writeln(f，Generation，′，′，MaxGeneFitness，′，′，MinGeneFitness，′，′，TotFitness)；　　    if (MaxGeneFitness＝1)and(TotFitness＞＝0.9)then　　    begin　　         WriteOut；　　         Close(GenerationOutFile)；　　         Close(f)；　　         Halt；<!-- SIPO <DP n="53"> --><dp n="d53"/>　　         end；　　       for PopCountr：＝1 to PopSize do　　           if (MaxGeneFitness-PopFitness[PopCountr])＜＝　　              (MaxGeneFitness-MinGeneFitness)/Threshold2Breed then　　                 begin　　                      Inc(NextPopCountr)；　　                  ReproducingSpicies[NextPopCountr]：＝PopCountr；　　                 end；　　         if NextPopCountr＝0 then　　            begin     　　                 writeln(′Population died out. Search not completed′)；　　                 Close(f)；　　                 Close(GenerationOutFile)；　　                 HALT；　　            end；　　         for PopCountr：＝1 to NextPopCountr do　　             for AllelCountr：＝1 to GeneSize do　　                 TempPop[PopCountr，AllelCountr]：＝　　                    PopList[ReproducingSpicies[PopCountr]，AllelCountr]；　　         for PopCountr：＝1 to NextPopCountr do　　             for AllelCountr：＝1 to geneSize do　　                 PopList[PopCountr，AllelCountr]：＝　                    TempPop[PopCountr，AllelCountr]；　　         if  NextPopCountr＜＞Trunc(NextPopCountr/2)*2 then　　             begin　　                  Inc(NextPopCountr)；　　                  AddGene：＝Random(NextPopCountr-1)+1；　　                  for AllelCountr：＝1 to GeneSize do　　                      PopList[NextPopCountr，AllelCountr]：＝　　                         PopList[AddGene，AllelCountr]；　　            end；end；(--------------------------------------------------------------------------------------)(                          MAIN       ROUTINE    )begin　　 Randomize；　　 Assign(f，′c：\algrthms\ga\fitness.out′)；　　 Rewrite(f)；　　 PopSize  ：＝  300；　　 GeneSize ：＝   10；　　 InitiateIO；　　 GenerateModelGene；　　    write(GenerationOutFile，′Model Gene：′)；<!-- SIPO <DP n="54"> --><dp n="d54"/>　　    for AllelCountr：＝1 to GeneSize do　　        write(GenerationOutFile，ModelGene[AllelCountr]：3)；　　        writeln(GenerationOutFile)；　　        writeln(GenerationOutFile)；　　 Generation：＝1；　　 GeneratePop；　　 While Generation＜NumOfGenerations do　　       begin　　            NullArrays；　　            AllocatePopFitness；　　            if Generation＝　　               Trunc(Generation/WriteFrequency)*WriteFrequency　　                 then WriteOut；　　            Selection；　　            CrossOver；　　            PopMutation；　　            writeln(′Generation：′，Generation)； 　　           if Generation＝　　               Trunc(Generation/MutationSchemaBin)*MutationSchemaBin then　　                 for AllelCountr：＝1 to GeneSize do　　                     MutationSchema[AllelCountr]：＝0；　　            inc(generation)；　　       end；　　 WriteOut；　　 Close(GenerationOutFile)；　　 Close(f)；end.

Annex D

　　                              ring.iniApendix  A  and  B  Initialization  file----------------------------------------　　  20                   Number of APs　　  90                   Lowest sensitivity for Rx in dBm　　   2                   Mininmal number of AP on ring　　   4                   Maximal Number of APs on the Ring　　   2                   Upper bound of rings on AP　　   2                   1-random position，2-grid positiond：\sim\mac-sim\5GHz\Ring_dBm.TBLd：\sim\mac-sim\5GHz\Ring.outi：\users\common\zvika\aviw\Ring_dBm.TBLi：\users\common\zvika\aviw\Ring.out

Annex E

　　　　                         Ring.outTransmitter to Subset Mapping       Subset connectivity list----------------------------      ----------------------Ring  1：  8    3    7    9         **    2  3  4Ring  2：  2    3    7              **    1  3Ring  3：  1    2    8    6         **    1    2    4    5Ring  4：  10   9    6    5         **    1    3    5    6Ring  5：  12   1   10   11         **    3    4    6    7Ring  6：  14   12   5   13   20    **    4    5    7    8Ring  7：  16   11  13   17         **    5    6    8Ring  8：  18   17  14   19   21    **    6    7

Annex F

   runction cbwl＝CBWL()   ％This function computes and manages a channel reservoirs of six   ％cliques.The cliques are defined by the example in Fiqure 7.   ％   ％Function′s input：   ％1)Mapping vector between transmitters and Subsets   ％2)Subset graph，defined as a connectivity matrix   ％3)A Carrier-sense matrix that defines levels of   ％  interference between the transmitters   ％4)transmitter load vector-a matrix that defines the   ％  communication intencity of each transmitter in terms   ％  of frames per second   ％   ％Function′s output：   ％1)Complete time/event map of the system，as presented in the  ％   following example：  ％  ％   Time   Tx-1  Tx-2   ...  Tx-21  ％     #      i     i           i  ％     #      i     6           1  ％     ..     ..    ..          ..  ％     ..     ..    s           s  ％2)Each local reservoir behavior，as presented in the  ％  following example：  ％  ％            Time -##  ％   Res-1  Res-2  ...  Res-6  ％    A       A         A  ％    B                 B  ％    C       C  ％    D       D  ％    ..      ..        ..subnets＝zeros(6，21)；％Filling the subnet matrix with he relevant datan(1，1)＝2；n(1，2)＝2；n(1，3)＝2；n(2，3)＝1；n(1，4)＝1；n(2，4)＝3；n(1，5)＝3；n(1，6)＝3；n(2，6)＝5；n(1，7)＝5；n(1，8)＝5；n(1，9)＝5；n(1，10)＝3；n(2，10)＝5；n(1，11)＝1；n(2，11)＝3；n(1，12)＝1；n(2，11)＝4；n(1，13)＝4；n(1，14)＝4；n(2，14)＝6；n(1，15)＝6；n(1，16)＝6；n(1，17)＝6；n(1，18)＝4；n(2，18)＝6；n(1，19)＝1；n(2，19)＝4；n(1，20)＝1；n(2，20)＝2；n(1，21)＝2；％Neiqbor Clique connectivity graphclique＝zeros(6)；z＝1：6；clique(z，z)＝1；clique(1，2)＝1；clique(1，3)＝1；clique(1，4)＝1；clique(2，1)＝1；clique(3，1)＝1；clique(3，5)＝1；clique(4，1)＝1；clique(4，6)＝1；clique(5，3)＝1；clique(6，4)＝1；<!-- SIPO <DP n="61"> --><dp n="d61"/>％Inicial reservoir of all cliquesnum_cliques＝；％For the specific exampla％It is important to assign less channels than transmitters，％i.e，otherwise no reservoir nulling will occurnum_channels＝10；reservoir＝ones(num_cliques)；％Assign initial reservoirsreservoir(：)＝num_channels；％Channel request vectorchannel_need＝teros(1，21)；％For the specific example case％Channel request intencity expressed thresholdchannel_Need_threshold＝.S；％Associate output filesf1＝″C：\data\simout\rsservoirs.out″；f1＝″C：\data\simout\channel_need.out″％Initial time anf the total simulation duration in event unitstime＝1；fin＝5000；％Main loop.Perform execution for time＝0 to time＝fin％At each point calculate the reservoirs of every clique％and print it outfor time＝1：fin   ％Initiate the reservoir vectors-it is assumed that each borrowing   ％duration is equal to one time step   reservcir(：)＝num_channels；   ％first，generate the channel request vector   channel_need(：)＝in(random)，channel_Need_threshold)；   ％For all nodes(transmitters in the network，chack whether they   ％need a channel and then borrow one-iff available and update all   ％reservcirs accordingly　  for node＝1∶21　　  if channel need(node)＞0　　     ％Check to what cliques this node(transmitter) is associated　　     ％and if possible borrow a channel　　     if reservoir(n(1，node))＞0　　        reservoir(n(1，node)＝reservoir(n(1，node)-1　　        else if n(2，node)＞0 && reservoir(n(1，node))＞0　　                reservoir(n(1，node)＝reservoir(n(1，node)-1；　　              end；　　     end；％reservoir not emply　　     printf(f1，reservoir)；　　     printf(f2，channel_need)；　　  end；％channel_need   end；％for loopend；％main for loopclose(f1)；close(f2)。return；

Claims (12)

1. one kind is utilized the method for first group of channel by second group of transmitter, and this method comprises:

Stipulate that the 3rd group of transmitter subclass makes that at least one is included in each transmitter subclass in second group of transmitter;

Distribute in first group of channel at least one channel to each transmitter subclass, in the transmitter of this transmitter subclass, share, make to be assigned to the 3rd group of transmitter subclass less than all first group of channels, therefore regulation is not also distributed to the holder of the channel of any transmitter subclass; And

Share the channel in the channel holder between all second group of transmitters.

2. the method for claim 1, if wherein do not comprise the contiguous clique of first and second transmitters, channel in the qualified use holder of first transmitter, even this channel is used by second transmitter, the contiguous clique of wherein independent transmitter subclass comprises all transmitter subclass of sharing at least one common transmitter with independent transmitter subclass.

3. one kind in first group of channel services independent transmitter method for transmitting under the situation of the second group of transmitter that comprises independent transmitter, and this method comprises:

If this transmitter belongs to the transmitter subclass of first channel services in first group of channel, and if first channel be available, then through first channels transmit;

Otherwise if the holder of channel comprises available second channel, then through the second channel emission, wherein holder comprises all channels in first group of channel of not serving any transmitter subclass.

4. the method for claim 1, wherein said channel by they transmission frequency separately.

5. the method for claim 1, wherein said channel by they transfer encoding separately.

6. method as claimed in claim 5, wherein said channel comprise CDMA (code division multiple access) channel.

7. the method for claim 1, at least some comprise wireless channel in the wherein said channel.

8. the method for claim 1, wherein the step of subclass regulation also comprises for each subclass selects the subclass main frame from the transmitter of subclass, channel assignment request is passed through control channel and is addressed to this subclass main frame.

9. method as claimed in claim 8, wherein the subclass main frame is selected so that utilize described control channel to be used for transmitter communication in other subclass that subclass transmitter and subclass main frame belong to maximumly.

10. method as claimed in claim 8, the transmitter that wherein belongs in the subclass of other subclass of maximum quantity is selected as the subclass main frame.

11. the method for claim 1 also comprise by the transmitter that will lose with lose the subclass that transmitter belongs to and disconnect the transmitter of abandoning losing, comprise that this transmitter of losing of main frame of only notifying each subclass disconnects.

12. one kind is utilized the system of first group of channel by second group of transmitter, this system comprises:

Channel dispenser, distribute each of three groups of transmitter subclass of at least one channel to the in first group of channel during operation, each comprises in second group of transmitter at least one, this channel is shared in the transmitter of this transmitter subclass, make to be assigned to the 3rd group of transmitter subclass less than all first group of channels, therefore regulation is not also distributed to the holder of the channel of any transmitter subclass; And

The Channel Sharing device is shared the channel in the channel holder in all second group of transmitters during operation.

Images