CN100479573C

CN100479573C - Communications meshes

Info

Publication number: CN100479573C
Application number: CNB2005100833815A
Authority: CN
Inventors: 斯蒂芬·亚德斯
Original assignee: Intel Corp
Current assignee: Intel Corp
Priority date: 2000-10-10
Filing date: 2001-10-09
Publication date: 2009-04-15
Anticipated expiration: 2021-10-09
Also published as: CN1728652A

Abstract

Methods are disclosed for forming a network (1) of nodes (A-H) from a plurality of nodes (A-H) and a plurality of potential transmission links (2) between respective nodes (A-H). Methods are also disclosed for adapting an initial mesh communications network configuration to a final mesh communications network communications configuration. Methods are also disclosed such that at least some of the changes to the initial mesh communications network configuration that are required as part of the adaptation to the final mesh communications network configuration form a group of changes such that all of the changes within the group can occur substantially simultaneously.

Description

Communications meshes

The application is that application number is the dividing an application for the patent application of " communications meshes " that 01820337.X, the applying date be October 9 calendar year 2001, denomination of invention.

In a kind of mode, the present invention relates to be used to form the method and apparatus of knot-net, particularly in the occasion of communications meshes of interconnection node.In another way, the present invention relates to be used for the method and apparatus of adaptive communications meshes.In another way, the present invention relates to the graticule mesh communication network.In another mode, the present invention relates to the method for the graticule mesh communication network behavior in the proposal of when operation has the graticule mesh communication network now, measuring.The invention still further relates to the relevant software and hardware of these methods of realization.

In this specification, various titles and subtitle have been used.It should be noted that title and subtitle are that network is clear and convenient, and do not have any effect in logic.

Background

In our International Patent Application WO-A-98/27694, they are whole is disclosed in this in conjunction with as a means of contrast, discloses the communication equipment that comprises with the network of the form of " graticule mesh " of interconnection node.By means of along unidirectional basically (the being short transverse) wireless transmission of link, each node can be communicated by letter with a plurality of other nodes by each point point-to-point wireless link between the node in the graticule mesh, be signal be not broadcasting but be directed to specific node, signal can be passed through at both direction along link.The frequency of using for example is at least about 1GHz.Can use the frequency that is higher than 2.4GHz or 4GHz.In fact, 40GHz, the frequency of 60GHz even 200GHz also can be used.Surpass radio frequency, can use other higher is 100 such as magnitude, the frequency of 000GHz (infrared).In a preferred embodiment, each node has a plurality of antennas in the graticule mesh, and they provide a plurality of potential point-to-point transmission links to other node.For example, each node can have four or eight antennas, and each is provided to a link of another node respectively.(should be appreciated that in this manual " antenna " extensively constituted, and comprise the structure that can send and receive high directed beams.For example a plurality of antennas can be by a plurality of physically discrete selectable antennas of difference, by one or more physically steerable antennas, or are provided by phased array antenna).In an example,, use the time-division two-way (TDD) to replace at node and send and receive by transmission and time of reception frame are divided into the discrete time sheet.

The major advantage of this " graticule mesh " method is set forth at WO-A-98/27694, and comprises the distribution of bandwidth on whole graticule mesh, and surpasses the advantage of the relevant capacity of other system (such as any to multiple spot or broadcast system); At least can use multiple different communication path to most of nodes,, thereby provide the elasticity of height no matter this allows the service of can both keeping of whether losing efficacy of specific node potentially; Provide the extensively potential of the level of variation of data traffic to different node, need not Radio Link, as long as the simple data path carry data communication amount of using variable number more than one type.Wireless system is the tangible advantage of wired system, does not need to excavate road etc. and lays and maintenance cable.

At least some and preferably most of nodes will be associated with the user in the graticule mesh of the interconnection node of setting up fully, and the user can be natural person or tissue, such as company, and university etc.The effect of each user's node generally will be the terminal point Yuan Hehui of data traffic (promptly as) as this user's dedicated link, and also be used to transmit the data that other node is provided as the integration section of distributed network.Yet the operator of graticule mesh network can adopt " seed " nodal set in " kind sub-network " at first.Kind of child node was generally with right and wrong user node (though can be exchanged into user's node afterwards), and this is to be provided with by network operater before potential user is provided services on the Internet, and generally to be used as a large amount of potential users are highly-visible.(word " as seen " and phrase " sight line " or similarly term here will be to be called as each other " as seen " or to be in each other on the meaning in " sight line " at two nodes or website to use, when suitable transmitting and receiving device is installed in the website place, node or be arranged in frequency or a plurality of frequency radio communications that the node at website place can use with network in principle each other).In kind of sub-network, each node is visible to other node at least.When the network service is provided by the operator, plant sub-network and allow user's node of suitable minimal amount directly to be connected to graticule mesh by these kinds child node.Kind of child node generally will be as the transition node of Internet traffic rather than as source and remittance (for example or the user traffic or the network management traffic).Planting child node can be in time relevant with the user, thereby becomes user's node.

Form

In case set up suitable kind subnet or other nodal set, wherein each node is visible for other node at least basically, just must be suitably used as all possible sight line of wireless transmission link actual between the node most from selecting those between the node.This process here will be with " graticule mesh formation " or similar phrase appellation.Should be appreciated that the graticule mesh forming process can be used in any graticule mesh, and for example can be used for during the initial formation of graticule mesh and the graticule mesh growing period, and can be used repeatedly.Should be kept in mind that it is a problem that does not cause that open and above among the WO-A-98/27649 discussed the formation problem of graticule mesh of the interconnection node of type in other network system.For example, at common telephone network or for example in the internet, there has been a kind of network that link is arranged between the user; Network problem in this network only relates to a user from existing network to another user's routing issue, considers that some link may lose efficacy or otherwise can not use such fact.Otherwise, given WO-A-98/27649 as us is disclosed and at a nodal set that will be connected with the graticule mesh that forms the interconnection node discussed above, and generally the communication link for any one node can be established so that link one of this node and many other nodes (or other predetermined number).In other words, the mode that much provides the chain of graticule mesh binding place to select is arranged.Thereby at first one of the problem that will mention is that the node that how to form interconnection is the graticule mesh of given nodal set, and which node how to determine to provide communication link to which other node to.This link preferably should be selected like this, makes these links provide suitable capacity to all data traffics that are routed by these links.

It will be the problem of difficulty on the mathematics usually that lattice net-shape is a problem, (disconnected) nodal set of given type, given a large amount of potential link will be had, and the combined number of potential communication link increases such fact than node number fasterly.In addition, because actual problem, such as there is the limited available antenna of number at each node place, the data traffic restriction at each node place or available RF spectrum (comprise and send and receive available timeslice limited in number), and the restriction (the transition node number that passes through from the source node to destination node by the physical length and the data of each link is measured) of communication path length between the node, thereby correct graticule mesh all is suitable for as the graticule mesh network on the not every topological structure.

In a kind of realization of graticule mesh, graticule mesh will be a network self-contained or " non-visit ", and promptly network is free of attachment to any external network.This non-accesses network is useful as local area network (LAN) or wide area network for example, and they for example can be used for by single tissue providing services on the Internet to its user.

Yet in preferred the realization, graticule mesh generally will be connected to external network.For example graticule mesh is an accesses network, and external network is that core network is such as backbone network.The traffic enters graticule mesh and otherwise clicking here of passing through will be called as backbone network tie point (" TNCP ") from external network; Should be appreciated that this term will be interpreted as the tie point to any external network widely, and be not limited to be connected to traditional backbone network.The special node that is called as graticule mesh insertion point (" MIPs ") in the detailed description here generally will be placed by network operater, and will have the link (generally using any technology) of additional sensing TNCP.The process that graticule mesh forms under this situation will need usually to guarantee that all nodes in the graticule mesh (directly, or non-direct by other node) are connected to MIP.This process preferably also should guarantee to provide enough capacity to all data traffics that are routed, and considers all links (using any technology) up to TNCP.Under other situation, or only in some part of network, MIP and TNCP can be with being identical device, and still the situation with described here is identical for the graticule mesh forming process under this situation.

According to first mode of the present invention, a kind of method that forms knot-net from a plurality of potential transmission links between a plurality of nodes and each node is provided, at least one of node provides the link node of the data connection of the network of being to and from formation, and wherein to not being each node of the node of connection, there is a maximum can accept number of links for transmission channel from described node to link node, each node can be communicated by letter by other node of a transmission link and at least one between described each node and described at least one other node in the network that forms, each node different with described link node or a plurality of link node is linked at least one link node by at least one transmission channel in the network that forms, this transmission channel or comprise a single transmission link between this node and the link node, perhaps pass through each transmission channel of one or more intermediate nodes between this node and the link node, this method may further comprise the steps:

For not being node that connects and the node that also is not linked to link node:

(a) a single link node is wherein arranged, identification is no more than all transmission channels of described maximum number of links to described single link node from described node, or a plurality of link nodes are wherein arranged, identification is no more than all transmission channels of described maximum number of links to any described link node from described node;

(b) to the described path of at least one acceptable standard testing, can accept path up to finding, and can accept to provide link between node on the path or each node, make and to accept on the path node or each node is linked to link node by transmission channel, this transmission channel or comprise node and link node between single transmission link, perhaps comprise between node and the link node each transmission link by one or more intermediate nodes; And,

(c) not link node and the node repeating step (a) that also is not linked to link node and (b) to all.

According to second mode of the present invention, a kind of method is provided, this method becomes transmission link actual between the node by which that determine to make a plurality of potential transmission links between the node, network to transmission link actual between node and the node provides topological structure, at least one node provides the link node of the data connection of the established network of turnover, and wherein one maximum number for the acceptable link of transmission channel from described node to link node is arranged for each node that is not link node, other node of each node and at least one in the network that forms is communicated by letter with the transmission link between described at least one other node by described each node, each node of non-described link node or a plurality of link nodes is linked at least one link node by at least one transmission channel in the network that forms, this transmission channel or comprise a single transmission link between this node and the link node, perhaps pass through each transmission channel of one or more intermediate nodes between this node and the link node, this method may further comprise the steps:

(a) a single link node is wherein arranged, identification is no more than all transmission channels of described link maximum number to described single link node from described node, or a plurality of link nodes are wherein arranged, identification is no more than all transmission channels of described link maximum number to any described link node from described node;

(b) to the described path of at least one acceptable standard testing, up to finding one can accept path, and mark represents that this can accept a variable of node on the path or each node in Computer Database or data structure, so that indicate this can accept the node that the above node of path or each node are linked to connection; And,

(c) not link node to all and also be not marked as all node repeating steps (a) of being linked to a link node and (b);

Thereby provide the data set of transmission link between the topological structure of expression knot-net and the node.

These first and second modes allow to comprise the formation of the accesses network of node.A kind of method is provided, has made the operator how can in the limited in fact very short time, to determine the chain binding place, so that node is provided the service of required degree.In a typical embodiment, the result of this method will be indication or represent a kind of a kind of database or data structure of topological structure, this topological structure show to all can be connected to graticule mesh node they should how to be linked to other node.In fact network operater can obtain this database or data structure then, and according to topological structure by this database or data structure indication or expression, by using the actual actual node of transmission link link, carry out general as mentioned above or in the physics realization of the graticule mesh described in our WO-A98/27694.

In two kinds of formulas, each transmission link can be a Radio Link.In addition, some transmission link can be a Radio Link, connects transmission link and remaining transmission link is a cable.Should be understood that, constitute on " cable knot " broad sense, comprise any suitable tangible medium, for example comprise that lead connects optical fiber etc.

In dual mode, step (a) to (c) preferably is applied to node with the descending for the stream rate demand of node expection.Like this, in this embodiment, the node with high bandwidth requirements at first is connected, and minimizes thereby help to make by the bandwidth hop of network or the product of bandwidth-distance.On average, the data of maximum will have the shortest travel distance of being to and from node." data flow demand " for example can be for the source speed of being promised to undertake (committed) of node or the remittance speed of being promised to undertake or they and.Comprise the fixing or variable overhead that is used for the network management communication amount alternatively.

This method step (a) afterwards and step (b) can comprise the step of the priority preface of determining described path before, and wherein in step (b), described path is tested with regard to the acceptability of described priority preface.

At some link at least is in this method of wireless transmission link, and step (a) can comprise identification all paths from described node at least one link node, and the priority of path can be determined by the ascending order of wireless transmission link number in those paths.In this example, the node that has the minimum number wireless transmission link in the path that is connected to a link node is at first connected, and this helps again to reduce by the bandwidth hop of network or the product of bandwidth-distance as far as possible.

In the method, step (a) can comprise identification all paths from described node at least one link node, and can determine the priority preface of path by the stream rate ascending order of the current total promise of the link node that described path leads to.In this example, the link node with stream rate of minimum current promise is first-selected, should be understood that, when node was linked to link node during repeating the iteration of this method, the stream rate of the promise of this link node increased.

Wherein some link is a wireless transmission link at least, and the preface of path can be determined by the ascending order of the physics length overall of wireless transmission link in the described path.In this example, the path that has the shortest physics length overall of any wireless transmission link in the path is first-selected.

The preface of path can be determined by the descending that forms number of links at least a portion path that before has been defined as acceptable path.In this example, be determined can accept the time as path, on this path, will there be link to promise to undertake in the carry data communication amount.When having determined the preface of path, preferably reuse the previous link of promising to undertake of most probable number MPN purpose, so that reduce the employed link sum of this stage that forms at network as far as possible.

In a preferred embodiment, the preface of path is determined by using these standards in the following order: by the ascending order of wireless transmission link number in these paths, the ascending order of the current total data flow rate of link node of leading to by described path, press the ascending order of the physics length overall of any wireless transmission link in the described path, and by the descending that forms number of links in the path that before has been confirmed as acceptable path at least a portion.In another embodiment, the preface of path is determined by using these standards in the following order: the ascending order of pressing the physics length overall of any wireless transmission link in the described path, the ascending order of the current total data flow rate of link node of leading to by described path, by the ascending order of wireless transmission link number in these paths, and by the descending that forms number of links in the path that before has been confirmed as acceptable path at least a portion.

In step (b), if node or each node of link on the path surpasses maximum data traffic flow rate for this link node to link node, then definite path is unacceptable.

In formed graticule mesh, may be to and from the transmission of a link node in different timeslices, if under this situation on the link path node or each node to link node above the timeslice number that can use at this link node, be preferably in step (b) and determine that path is unacceptable.

In the graticule mesh that forms, the transmission of being to and from link node can take place in different timeslices, if under this situation on the link path node or each node surpass the available timeslice number in any node place on this path to link node, be preferably in step (b) and determine that path is unacceptable.

Node or each node on the tested path of step (b) can have a plurality of antennas, each antenna can provide separately and wireless transmission link other node, if under this situation on the link path node or each node be that any node does not have at least one free antenna to the result of link node, then be preferably in step (b) and determine that path is unacceptable.In this example, if the result is that any node does not have free antenna on the path, then path is rejected.Wish that each node has free antenna, this antenna is not what to promise to undertake in the common operation of network, so that allow to carry out actual signal or interferometry.In addition, having free antenna makes it possible to check each sight line that proposes using in following and then preferred " adaptive " step that will discuss to can be used as a Radio Link.Having free antenna also makes it possible to or has simplified the check that adaptation order will correctly be operated link after having realized at least.In addition, free antenna makes it possible to carry out the adaptive of graticule mesh and need not interrupt communication stream.

Node or each node on the tested path of step (b) can have a plurality of antennas, each antenna can provide separately and wireless transmission link other node, step under this situation (b) preferably includes further step, if this node is linked to a link node and has only a free antenna, if perhaps this node is link node and has only a free antenna, then all potential links of being to and from a node of this step mark are disabled for using in the path.This example prevented this method detect specify to node known infeasible or be not preferred link.

Step (b) can comprise further step, if described two nodes are linked to a link node, then all potential links are disabled for the use in the path between these two nodes of this step mark.This example has been exempted the link between the node of considering no longer to be suitable for, because at this embodiment or do not allow redundant via in this stage of this method at least.

Step (b) can comprise further step, if described node is linked to a link node, then all the potential links between this step mark one node and the link node are for being disabled for the use in the path.This example has been exempted the link between the node of considering no longer to be suitable for once more, because at this embodiment or do not allow redundant via in this stage of this method at least.

Before a node is linked to a link node, preferably all other nodes that also are not linked to a link node are tested, if, whether make any described other node can not be connected to this link node to determine that described first node is linked to described link node.Make have any node can not be connected to a link node if described first node is linked to described link node, then preferably described first node is not linked to this link node.

In step (a) before, this method can comprise such step for the node with single potential link to another node, use described single potential link to link this node, and the described single potential link of mark use to unavailable in another path to another node.This is the part that is called " anti-isolated " process here, and prevents that this node from " being isolated " or separate from the graticule mesh remainder.

This method can comprise provides the step of further link between some node at least, so that be generated to the redundant via of link node at least one link node.In this preferred embodiment, preferably add redundant via as possible, make path as much as possible have to link node path fully independently, so that elasticity (on the meaning that stand-by channel can be used under the situation of any component failures in original path) is provided, and provide diversity (for example feasible lot of data from a node can be divided the data in a small amount that send by different paths).

According to Third Way of the present invention, a kind of network method that forms node from a plurality of potential transmission links between a plurality of nodes and each node is provided, each node is by described each node and described transmission link between another node at least in the network that forms, can communicate by letter with another node at least, each node is linked at least one appointed grappling node by at least one transmission channel in the formed network, this transmission channel or comprise this node and appointed grappling node between a single transmission link, perhaps comprise this node and appointed grappling node each transmission link by one or more intermediate nodes, wherein all nodes are linked to all other node in the network that forms, and wherein for each node that is not appointed grappling node, have a pair of transmission channel maximum from described node to appointed grappling node can accept number of links, this method may further comprise the steps:

For not being appointed grappling node and the node that is not linked to appointed grappling node:

(a) a single appointed grappling node is wherein arranged, identification is no more than all transmission channels of described link maximum number to described single appointed grappling node from described node, a plurality of appointed grappling nodes are wherein arranged, and identification is no more than all transmission channels of described maximum number of links to any described appointed grappling node from described node;

(b) to the described path of at least one acceptable standard testing, can accept path up to finding, and can accept to provide link between node on the path or each node, make and to accept on the path node or each node is linked to appointed grappling node by a transmission channel, this transmission channel or comprise node and appointed grappling node between single transmission link, perhaps comprise between node and the appointed grappling node each transmission link by one or more intermediate nodes; And,

(c) not appointed grappling node and the node repeating step (a) that also is not linked to appointed grappling node and (b) to all.

According to cubic formula of the present invention, a kind of method is provided, this method becomes transmission link actual between the node by which that determine to make a plurality of potential transmission links between the node, network to transmission link actual between node and the node provides topological structure, each node in the network that forms is communicated by letter with other node of transmission link and at least one between described at least one other node by described each node, each node is linked at least one appointed grappling node by at least one transmission channel in the network that forms, this transmission channel or comprise this node and appointed grappling node between a single transmission link, perhaps pass through each transmission channel of one or more intermediate nodes between this node and the appointed grappling node, wherein all nodes are linked to all other node in the network that forms, and wherein for each node that is not appointed grappling node, have a maximum can accept number of links for the transmission channel from described node to appointed grappling node, this method may further comprise the steps:

For not being appointed grappling node and the node that also is not linked to appointed grappling node:

(a) a single appointed grappling node is wherein arranged, identification is no more than all transmission channels of described maximum number of links to described single appointed grappling node from described node, or a plurality of appointed grappling nodes are wherein arranged, identification is no more than all transmission channels of described maximum number of links to any described appointed grappling node from described node;

(b) to the described path of at least one acceptable standard testing, up to finding one can accept path, and mark represents that this can accept a variable of node on the path or each node in Computer Database or data structure, so that indicate this can accept the node that the above node of path or each node are linked to appointed grappling; And,

(c) not appointed grappling node to all and also be not marked as all node repeating steps (a) of being linked to an appointed grappling node and (b);

Thereby the data set of the network topology structure of transmission link between expression node and the node is provided, and wherein all nodes are linked to all other nodes in the network of Xing Chenging.

These third and fourth modes allow network self-contained or " non-visit ", and this network comprises node and depends on as the similar step that interrelates for above-mentioned and first and second modes.If a grappling node is arranged, then these methods produce the node set of interconnection fully.Under the situation of an above grappling node,, then produce a node set that interconnects fully if the grappling node itself interconnects.This can be after using this method or before undertaken by any device.This can the sight line set realizes between the grappling node by method described here is used for.

The preferred embodiment of these third and fourth modes and specific example generally are similar to for the described example of above-mentioned first and second modes.

According to another way of the present invention, a kind of computer program is provided, this program comprises the program command that is used to cause computer execution said method.

According to another way of the present invention, a kind of storage medium is provided, stored aforementioned calculation machine program thereon or wherein.

This storage medium can be a computer storage.Storage medium can be read-only storage medium.The read-only storage medium that is suitable for comprises CD-ROM or semiconductor ROM.Storage medium can be a rewritable storage medium.The rewritable storage medium that is suitable for comprises hard and floppy disc and can rewrite CD.

According to another mode of the present invention, provide a kind of and be programmed to carry out the computer of said method.

Should be understood that term " computer " is extensively constituted.Term " computer " can comprise calculation element or its assembly of some distributed separation.

In many wireless systems, radio transmitting method is divided into transmission relevant or a plurality of, such as the repeat pattern of timeslice in the TTD system, is simply mentioning about one of preferred embodiment of formation method as above.In addition, can design the wireless nodes that has a plurality of antennas like this, make each timeslice can be used once at the most for the purpose that sends or receive at whole inter-node.Preferred formation method discussed further below is by guaranteeing to require each node to use no more than timeslice to calculate the graticule mesh compatible with this restriction with sum.

Preferred formation method allows to wish the requirement of network imposed is provided with a number of targets to it according to the operator.These comprise:

1. provide transmission to or each node in graticule mesh between the ability of the required regulation hierarchical communication amount of service is provided;

2. be provided for the stand-by channel of this traffic, to avoid the interruption of this service under graticule mesh link or node fails situation;

3. limit certain site position in the whole graticule mesh topological structure.

An example of the 3rd above-mentioned clause relates to the node that will be mounted, dismantle or make its inefficacy for the purpose of safeguarding.Preferred formation method allows these nodes in place like this in graticule mesh, if the traffic that makes these nodes can not operate other node is not destroyed.Like this, before installing, after the dismounting or during safeguarding, can operate preferred formation method and can transmit by graticule mesh with the traffic that guarantees other.

Form the graticule mesh that method forms and have following assembly by preferred:

1. a set of Radio Link or cable chain link road or Radio Link and cable chain link road combination between the node;

2. for each Radio Link, several timeslices that each direction is required.And

3. pass a set of the communication path of graticule mesh, one or more according to the every service of object set that the formation method is provided with.

The process that forms is carried out the calculating of graticule mesh like this, so that be embodied as one or more targets of its setting.

The peaked traffic load is provided

According to another way of the present invention, a kind of method that forms knot-net from a plurality of potential transmission links between a plurality of nodes and each node is provided, each node can be communicated by letter with other node of transmission link and at least one between described at least one other node by described each node in the network that forms, wherein at least one node has the requirement to the traffic peak communication rate of another point of network, and described node has to the communication path originally of point described in the network, and this method may further comprise the steps:

Determine described script message capacity originally;

Be different from described script other path originally from described node to described point in the marked network, make the message capacity of described script script and the message capacity sum of described other path to be equal to or greater than requirement the described peak communication rate of described node; And

Except described script script, make described other path can be used for transmitting the traffic to described point from node described in the network;

Thereby in the network that forms, if surpass described script message capacity originally for communication rate from described node to the traffic of putting described in the network, then the traffic can be divided into separated portions, and they are carried to point described in the network by script and described other path respectively.

This method allows the peak communication rate to be provided for the user.Should be appreciated that in fact the peak communication rate can provide in some time, but these times fully with depend on other user traffic level and network in disabling devices or link any related.Preferable methods has been used here and has been called " inverse multiplexing ", this process is that the single data flow that must send from A to B is divided into separated portions at A, each part is along the transmission of one of a plurality of (promptly originally and other) path, and these parts are integrated at the B place and regenerate original stream together.

According to another way of the present invention, a kind of method that forms knot-net from a plurality of potential transmission links between a plurality of nodes and each node is provided, each node can be communicated by letter with other node of transmission link and at least one between described at least one other node by described each node in the network that forms, wherein at least one node has the requirement to the traffic peak communication rate of another point in the network, and each described node has in the network each described communication path originally and adds zero or more other path, and this method may further comprise the steps:

Determine the message capacity of each described path; And

Link in network adds capacity by precedence, so that be provided at the demand of described node peaked traffic.

This provides a kind of alternative additional method, and allowing provides the peak communication rate to the user.

Chain

According to another way of the present invention, a kind of graticule mesh communication network is provided, this network comprises the transmission link between a plurality of nodes and the node, and wherein timeslice is distributed to and is used for sending between node and the transmission link of received signal by link, wherein at least two timeslice branches in succession are used in transmission at least one link, make user traffic in use transmit on described at least one link by an above timeslice continuously.

As following more detailed discussion, timeslice in succession can be combined on wireless transmission link, wherein same direction needs two or more timeslices on this link, so that additional capacity can be provided on this link, or required timeslice number can be reduced on this link.

All timeslices preferably have the identical duration.

Painted

" painted " here is to be used to refer in graticule mesh the process that each timeslice on the link is distributed timeslice.Use this term to be here because can carry out analogy with graph theory.In the preferred realization of the graticule mesh time remembered is divided into the timeslice of the separation of being numbered in time frame.For example, during the wireless transmission from first node to another node can occur in timeslice 1 on the wireless transmission link; During the wireless transmission from first node to another different nodes can occur in follow-up timeslice 2 on another wireless transmission link; During first node can occur in timeslice 3 from the reception of the wireless transmission of another node; Or the like.Following, use term " painted " to represent these timeslice numbers, make that different timeslices is associated in conceptive with different " color " in the time frame.If any specific node is wished to avoid during identical timeslice number to take place from the reception of other node or to the transmission (promptly preferably any specific node just transmits or receives from another node to other node at any time) of other node, each link of then being to and from this node in this embodiment must have different timeslice numbers or " color ".(this supposes that all transmission and reception occur in same carrier.Can use the discussion of the more generally situation of different channel to provide) following.Like this, the question marks of the link assignment different time sheet on node are similar to coloring problem known in the graph theory.

The theme of painted common pending application application no..

In this common pending application application, disclose to being used between the contact node transmitting and a kind of method of the timeslice fixed time sheet number of received signal, wherein each node can be communicated by letter by described each node and described transmission link between another node at least with another node at least, at least some node has to the transmission link separately of each of a plurality of other nodes, each transmission from first node to second node occurs in during the timeslice signal by link, and this method may further comprise the steps:

The number ascending order order of the selection that can use by the timeslice number at each timeslice place is to each timeslice fixed time sheet number.

In this common pending application application, also disclose between the node that is used at knot-net and to have transmitted and a kind of method of the timeslice fixed time sheet number of received signal, wherein each node can be communicated by letter by described each node and described transmission link between another node at least with another node at least, at least some node has to the transmission link separately of each of a plurality of other nodes, each transmission from first node to second node occurs in during the timeslice signal by link, and this method may further comprise the steps:

(a) identification have the transmission that is used for signal and reception maximum time the sheet sum node;

(b), specify different timeslice numbers to each described timeslice at this node place for the node that identifies in the step (a);

(c) determine that those timeslices that also do not have designated timeslice number have the minimum available selection of timeslice number, and specify a timeslice number to uncertain like this this timeslice; And,

(d) repeating step (c) is till the designated timeslice number of all timeslices.

In the step (a) of this mode, if the identical timeslice sum that has a plurality of nodes to have to be used for signal to transmit and receive, then any those nodes all selected.

In the step (b) of this mode, the timeslice number can be specified arbitrarily.

(a), a variable is set has the value that equals twice up duration sheet number maximum number for not free sheet;

(b) identification have the transmission that is used for signal and reception maximum time the sheet sum node;

(c), specify different timeslice numbers to each described timeslice at this node place for the node that identifies in the step (b);

(d) to step (c) designated the timeslice of timeslice number each sheet At All Other Times of sharing node, reduce variate-value by a described constant of sharing each situation for node;

(e) select to have the timeslice of minimum variate-value;

(f) for each sheet At All Other Times of sharing a node at step (e) times selected sheet, reduce variate-value by a described constant of sharing each situation for node;

(g) repeating step (e) and (f) till all timeslices are selected; And,

(h) with according to the selection of being done to (g) in step (e), to each timeslice fixed time sheet number of selecting to (g) in step (e).

In the step (b) of this mode, if the identical timeslice sum that has a plurality of nodes to have to be used for signal to transmit and receive, then any those nodes all selected.

In the step (c) of this mode, the timeslice number can be specified arbitrarily.

In any of these mode, the timeslice number that is assigned to a timeslice is preferably at the very first time number of node place free time at these timeslice two ends.

The timeslice number can be confirmed as available, considers the interference that causes in may using on a link as the result of transmitting on another link.

When specifying a timeslice number to timeslice, for example can attempt by the following method to realize reducing to disturb, (i) select the minimum timeslice number that uses, or the timeslice number of (ii) selecting maximum to use, or (iii) for minimum but the designated timeslice number of timeslice number selects to reduce the timeslice number of option.

This method can comprise the step of specifying a channel during this timeslice to each timeslice that wireless transmission takes place.This can also be used as and reduce a kind of method of disturbing between the node.Appointed frequency for example can be minimum use or maximum frequency of using.

Be assigned to the selection of the channel of timeslice at least one link or each timeslice, can consider during by described at least one link transmission, may be in use for be not described knot-net a part transmission/receiving system or from its interference that causes.Like this, otherwise may can before graticule mesh work, be taken into account, thereby prevent that this interference from taking place to another (" external ") transmission or from its interference effect that causes.

Available channel is preferably by the descending sort from a node to the number of links of another node, the interference of being to and from the transmission of non-described knot-net part for this node during the transmission will be unacceptable, and the channel that wherein is assigned to timeslice on described at least one link or each timeslice is by first acceptable channel of described ordering.

Determine whether a channel can accept preferably to consider the interference that in use may cause, this interference during the transmission may be to not being that the transmission/receiving system of a described knot-net part causes or from its generation on this channel.

On at least one link, at least two timeslices in succession can be allocated for transmission, make user traffic in use be transmitted continuously by an above timeslice on described at least one link.Be preferably in the timeslice number and be assigned to and anyly be not allocated for two of transmission in succession before any link of timeslice, the timeslice number is assigned to described at least one link.

All timeslices preferably have the identical duration.

Adaptive

When the graticule mesh network operation, in fact generally when being changed, seem that the graticule mesh that needs are new disposes for the target of graticule mesh and parameter.These examples are, when a node is added to network or when it is removed; When existing user's communications amount demand changes; When the operator of network determines interpolation or removes seed or other node; When two nodes are no longer visible each other (may because tree has grown or building is set up between two nodes); When current graticule mesh topological structure becomes when not being optimum or falling under certain quality threshold; When between two existing nodes, adding or removing wireless or during other transmission link; When adding, removing or redistribute between two existing nodes the timeslice on the wireless transmission link; When being used for the main or standby path of existing user traffic and being reconfigured; And any combination of these incidents.

In principle, can form the configuration that new graticule mesh obtains new graticule mesh effectively, promptly use the formation method to satisfy new demand, and do not consider the configuration of any current graticule mesh to form new graticule mesh by " starting from scratch ".At this moment for during the new graticule mesh of formation, current graticule mesh is not worked.Yet this operation is owing to be unacceptable in the general commercialization of the loss of the interim service that the active user suffered.Another kind of operation may be effective by " repetition test ", wherein for example the operator attempts to add new node by reality simply and attempt its given link and timeslice etc. with ad hoc fashion, and add a new node, and test new graticule mesh then to determine whether new graticule mesh configuration can successfully be operated.Yet because the operation that the correlation between node and each other node will be succeedd on the whole graticule mesh, particularly including their link and the appointment of timeslice etc., this method generally seems unlikely success.

As if so in fact,, need a kind of process, to the configuration change of a graticule mesh so that be the configuration of another graticule mesh in a kind of controlled and foreseeable mode.Term " graticule mesh is adaptive " or similarly here be used for usually referring to disposes required process to a graticule mesh configuration change for another graticule mesh by this mode.Graticule mesh is adaptive preferably should carry out like this, makes graticule mesh keep it to transmit the ability of all customer data traffic during adaptation procedure.

The problem that graticule mesh is adaptive, form as graticule mesh, a difficult problem normally on mathematics is because there is the potential link of a large amount of existence, cause typical (not connecting) node set, and the number of combinations of potential communication link increases faster such fact than nodal point number.In addition, as mentioned above, effective graticule mesh is suitable for using as the graticule mesh network on the not all topological structure, because actual problem, such as restricted in the available antenna number in each node place, the restriction of each node place data communication capacity, or available RF spectrum restricted (comprising) to transmitting and receive the restriction of available timeslice number, and to the restriction of communication path length between the node (by each link physical length, and data from the source node to destination node the transition nodal point number purpose by its transmission measure).Under adaptive situation, in fact problem is increased the weight of by the adaptive selected objective target that is carried out, and this target is to make graticule mesh keep it to transmit the ability of all customer data traffic in whole adaptation procedure.

According to another way of the present invention, provide a kind of method like this, initial graticule mesh communication network configuration has been adapted for final graticule mesh communication network configuration, wherein:

Initial graticule mesh communication network configuration comprises first nodal set, and the transmission link between the node is to the distribution of transmission link timeslice and the communication path by graticule mesh;

Final graticule mesh communication network configuration comprises second nodal set, and the transmission link between the node is to the distribution of transmission link timeslice and the communication path by graticule mesh;

First nodal set, the transmission link between the node to the distribution of transmission link timeslice, and is different from second nodal set by the communication path of graticule mesh, the transmission link between the node, to the distribution of transmission link timeslice, and the communication path by graticule mesh; And,

A kind of method is wherein arranged, form the configuration of graticule mesh communication network, and distribute timeslice to transmission link from transmission link potential between nodal set and the node;

This method comprises such step, promptly by by following both or one of operation form the method for graticule mesh, form the final graticule mesh communication network configuration of at least a portion, (i) based on potential transmission link between second assembly place be limited the set, restricted passage graticule mesh like this forms the result who produces, make initial graticule mesh configuration adaptive final graticule mesh to dispose, and (ii) by adding one or more additional steps or test to the method that forms graticule mesh, the restricted passage graticule mesh forms the result who produces, and makes that initial graticule mesh configuration can adaptive final graticule mesh configuration.

With regard to one or more nodes (being whether they occur), the transmission link between the node distributes and communication path by graticule mesh available second collection that is different from of first collection to the timeslice of transmission link.With regard to other factors, for example comprise their targets of realizing of requirement, the example of this target provides following, and first collection can be different from second collection by additional or other mode.

In one embodiment, the configuration of initial graticule mesh communication network, have from the initial script topological structure of the nonredundancy way set of the link node of first each node to the first of set set, and the configuration of final graticule mesh communication network, have from the final script topological structure of the nonredundancy way set of the link node of second each node to the second of set set, and it is not in initial graticule mesh communication network configuration that at least one new node is wherein arranged in final graticule mesh communication network configuration

The step that forms at least a portion of final graticule mesh communication network configuration preferably includes, operate in the method that forms graticule mesh on the limitations set of potential transmission link between the node of second collection, so that produce final script topological structure, it is identical that this structure and initial topological structure originally add at least one transmission link to node new or that each is new, and wherein new or each new node is configured to be in a terminal originally node, and it is not the interior transition node of final script topological structure that is configured to be used for other node traffic.In this embodiment, existing script topological structure is not made change like this, thereby the script communication path of existing traffic service is not made change; Except at least one end of each link wherein is in the transmission link at new node place, there is not transmission link to be used for not being included in the new graticule mesh of current graticule mesh.This embodiment has comprised the adaptation method that is called " supply " here.

The restriction set of potential transmission link between the second set node, can be all the script topological structure transmission links in the initial graticule mesh communication network configuration, add the combination of all the potential transmission links between the node in node new or that each is new and the initial graticule mesh network configuration, thereby final script topological structure, to add at least one transmission link to node new or that each is new identical with the topological structure of initial script.This embodiment provides a kind of method, and as the adaptive class that is called as " supply " here was desired, this method had guaranteed the topological structure of final script, and to add at least one initial link circuit to node new or that each is new identical with the initial topology structure.In general, supply need be made minimum change to graticule mesh, thereby is to realize the most easily, and generally should at first be attempted, though as if this method seldom can be successful on average.

In one embodiment, the topological structure of the initial script of initial graticule mesh communication network configuration, it is nonredundancy set from the path of the link node of each node to the first collection of first collection, and the step that forms final graticule mesh communication network configuration is limited, originally be added so that prevent, promptly any transmission link in initial script topological structure adds timeslice, perhaps needs timeslice to be removed from any transmission link.This is corresponding to the situation that is called as " supply on restriction " in a preferred embodiment here, and wherein whole current graticule mesh without any revising ground, forms the part of new graticule mesh to it.Do not need that current graticule mesh is made any influence and be used for the existing graticule mesh link of existing service or the change of path.Unique change to graticule mesh required in the realization of reality is, adds or removes node, leads to their link, and the service and the communication path that lead to them are parts as the attachment/detachment process.

In another embodiment, the topological structure of the initial script of initial graticule mesh communication network configuration, it is nonredundancy set from the path of the link node of each node to the first collection of first collection, wherein in the step that forms final graticule mesh communication network configuration, the link in initial script topological structure has added one or more timeslices.This is corresponding to the mode that is called " additional supply " in the preferred embodiment here.Preferably execute in the example at this, timeslice is added to existing link, if be not change on any link under the situation that existing timeslice disposes in the use to do like this in current graticule mesh.

In another embodiment, the topological structure of the initial script of initial graticule mesh communication network configuration, it is nonredundancy set from the path of the link node of each node to the first collection of first collection, the step that wherein forms final graticule mesh communication network configuration comprises the step of removing one or more links, and these links are not in initial graticule mesh communication network configuration and in initial topological structure originally.This is corresponding to the mode that is called " removing supply " in the preferred embodiment here, wherein " resilient link " is (promptly as following and then want path, those are not in the script topological structure and be used for providing other to the traffic link of stand-by channel) can be removed on demand so that give way in the script topological structure, for new link.

In another embodiment, the topological structure of the initial script of initial graticule mesh communication network configuration, it is nonredundancy set from the path of the link node of each node to the first collection of first collection, and the final script topological structure of final graticule mesh communication network configuration, it is nonredundancy set from the path of the link node of each node to the second collection of second collection, and wherein in final graticule mesh communication network configuration, at least one new node can be arranged, it not in initial graticule mesh communication network configuration, and

In the step of at least a portion that forms final graticule mesh communication network configuration, the described confined set of potential transmission link between the node in second set, all transmission links in the preferably initial graticule mesh network configuration, add all potential transmission links between the node in node new or that each is new and the initial graticule mesh communication network configuration, wherein in final graticule mesh communication network configuration, have a new node at least not in initial graticule mesh network configuration.This embodiment is corresponding to the adaptive class that is called as " distributing again " here.In the preferred realization of these methods, except at least one end of each link is the transmission link of a new node, be used for not being included in the new graticule mesh of current graticule mesh without any transmission link, wherein in final graticule mesh communication network configuration, have a new node at least not in initial graticule mesh communication network configuration.Yet the restriction of not forcing other is so new script topological structure can use any existing link in the graticule mesh.May not necessarily appear at the new graticule mesh from the link of current graticule mesh.These methods for example can be used in one or more new nodes will be installed to situation in the existing graticule mesh.These methods also are suitable for conduct and regulate the method for topological structure originally, and the node of feasible regulation leaves or need controlled situation in all parameters of graticule mesh.

Be configured to the change that final graticule mesh communication network disposes from initial graticule mesh communication network, preferably carry out as the independent step that is triggered.

According to another way of the present invention, a kind of method is provided, initial graticule mesh communication network configuration is adapted for final graticule mesh communication network configuration, wherein:

Initial graticule mesh communication network configuration comprises first nodal set, the transmission link between the node, and to the distribution of transmission link timeslice, and the communication path by graticule mesh;

Final graticule mesh communication network configuration comprises second nodal set, the transmission link between the node, and to the distribution of transmission link timeslice, and the communication path by graticule mesh;

First nodal set, the transmission link between the node to the distribution of transmission link timeslice, and is different from second nodal set by the communication path of graticule mesh, the transmission link between the node, to the distribution of transmission link timeslice, and the communication path by graticule mesh;

Initial graticule mesh communication network disposes the topological structure of initial script, it is nonredundancy set from the path of the link node of each node to the first collection of first collection, and final graticule mesh communication network disposes final script topological structure, is the nonredundancy set from the path of the link node of each node to the second collection of second collection;

Wherein there is a kind of method, forms a kind of script topological structure for the configuration of graticule mesh communication network from transmission link set potential between node and the node, and distribute timeslice to transmission link;

This method comprises the step of using the method that forms graticule mesh, so that form final topological structure originally, makes it to coexist with initial script topological structure, thereby can make initial graticule mesh dispose adaptive final graticule mesh configuration.

This mode of the present invention is corresponding to the adaptive class that is called as " former color method coexists " here.In the preferred realization of these methods, produced a kind of new graticule mesh, wherein between existing node, added new transmission link.Like this, in these methods, generally need be in existing graticule mesh the moving of some antenna.These methods preferably retrain forming process producing new graticule mesh, and making only needs one or two antenna horde, and make that the step that changes relates to just operate one in the middle of graticule mesh.These methods attempt to find a new graticule mesh, make experienced script topological structure and new all required antennas of topological structure to be assigned with simultaneously.Thereby, can reach for the new required aerial position of graticule mesh script topological structure, and can not damage current script topological structure one transmits all traffics of having promised to undertake by graticule mesh ability.

In the method that forms final topological structure originally, determine preferably that under following situation path is unacceptable, if i.e. any node place on the path, those potential chain ways that can be used for the link in path rather than the initial topological structure originally, by when the link of the initial topological structure originally of operation based in the timeslice at node place with wait until idle number of antennas and calculate, surpass the new number of links that node can be supported in the final topology structure.

This method may further comprise the steps:

(A) utilization forms the method for graticule mesh, so that script topological structure in the middle of forming makes it to coexist with initial script topological structure,

(B) use the method that forms graticule mesh, so that form a further middle topological structure originally, it can coexist with previous intermediate topology structure,

(C) repeating step (B), till further intermediate topology structure can coexist with final script topological structure,

Thereby, can make initial graticule mesh configuration adapt to final graticule mesh configuration by the script topological structure of a series of coexistences.

This mode of the present invention is corresponding to alleged here " repeating the crossover primary colors " mode.In general, this is a most probable successful method in the adaptation method described here, although may need maximum changes, and thereby maximum destruction, and maximum calculating strength.

In one embodiment, adaptation procedure uses forming process to carry out, so that produce the target graticule mesh that reaches its target.At this moment this adaptation procedure or from target with from current graticule mesh, and the revision of the process that forms of utilization then, wherein revise be to calculate one or more in the middle of graticule mesh.Can carry out the change step of corresponding number then in practice, so that current graticule mesh is converted to the target graticule mesh.Be to be understood that, the calculating of middle graticule mesh (a plurality of) can from or current graticule mesh or target graticule mesh, because graticule mesh in the middle of middle graticule mesh or each, in changing sequence, must have the script topological structure of the graticule mesh topological structure coexistence originally that can be adjacent.

In above-described adaptation method, described formation method is preferably by usually above and in following method in greater detail.The embodiment of the reality of the formation method that need use in any specific adaptation method will depend on the demand to adaptation procedure itself, and the character of initial and final graticule mesh communication network configuration.Thereby the formation method of the actual reality of using can be used the one or more mutation for the formation method that goes through here in adaptation method.

So in short, generally according to these modes of the present invention, in fact adaptation method uses any method that is used for forming the above-mentioned type graticule mesh, uses the suitably formation method of constraint when as adaptation method a part of.The formation method that adaptation method uses preferably provides aforementioned capabilities, that is: 1. capacity that the traffic level that transmits regulation is provided, this capacity be to or in graticule mesh, provide service needed between each node; 2. provide stand-by channel to this traffic, to avoid the interruption of this service under graticule mesh link or node fails situation; And, 3. be limited in the position of node certain in the whole graticule mesh topological structure.

Like this, in general the preferred embodiment of this mode of the present invention provides a kind of adaptation method, wherein revise the formation method to produce a graticule mesh, this graticule mesh not only satisfies new target but also can be implemented a series of one or more change steps from the graticule mesh of work at present, and make that each changes step in sequence, graticule mesh keeps it to transmit the ability of all customer data traffic in whole adaptation procedure.Produced a new graticule mesh by adaptation procedure like this, it satisfies the target to its setting, and can realize a series of one or more change steps from the graticule mesh of work at present.

The modification that puts on this formation method preferably belongs to one of following category or both:

1. allow to carry out the link set of forming process with the various assemblies of selecting new graticule mesh from it, be limited in one or more stages of forming process, confined set (a plurality of) is selecteed like this, can guarantee that new graticule mesh can reach a series of one or more change steps from the graticule mesh of work at present; And

2. add one or more additional restrictions or test in one or more stages of forming process, the result of this restriction or test has guaranteed and can reach new graticule mesh in one or more change steps from the graticule mesh of work at present.

Should be appreciated that when adaptation procedure needs the restriction of link set allow forming process to select the various assemblies of new graticule mesh from it, at this moment different limitations set can be used for the different phase of forming process.

Adaptation method by much being made up of different modification set can be used in forming process and is used for adaptive effective change sequence of steps with generation.In other words, in general, a plurality of different change sequences can be arranged,, and, can obtain these different change sequences by applying different modification set to process originally so that be fitted to final graticule mesh configuration from the configuration of initial graticule mesh.The change sequence that forms adaptation procedure will be different on the number of approach.Some key property of adaptive sequence will comprise in the actual realization:

1. suppose the set of feasible change step.The set of feasible change step is depended on from the standard of the networked devices of its process graticule mesh.This standard can be selected by this way, makes it cause concrete method.The key element of the standard that adaptation method best and described here provides in combination is in following proposition.

2. the change number of steps that is produced.

3. carry out each and change the required time of step.

4. the characteristic of graticule mesh during these steps.

5. the characteristic of final graticule mesh.

6. may hinder inefficacy set possible in the networked devices of sequence correct execution, and these possibilities that lost efficacy and take place.Can hinder the example of the inefficacy of adaptive sequence correct execution, can be that direction is remote-controlled so that move to the inefficacy of the antenna of new desired location.So long as need one or more antennas to reorientate, then adaptation method will be fragile to this inefficacy.

These above-mentioned factors will influence graticule mesh during adaptive or the reliability of working afterwards, thereby influence the reliability of whole network.For example, the characteristic of graticule mesh may comprise than the very low-level marginal capacity of the situation of initial or final graticule mesh during the intermediate steps.Thereby will bear the excessive risk of serv-fail in the inefficacy of this step equipment or Radio Link.Because the final graticule mesh that produces with distinct methods also has variation on its marginal capacity level, thereby the long-term reliability of graticule mesh that as far as possible reduces serv-fail also depends on employed method.What change between the graticule mesh that produces with distinct methods has many other characteristics, handles the ability of peak communication load such as their.

7. the possibility that exists according to the adaptive sequence of this method.Each adaptation method becomes process selection applicatory to apply different restrictions to lattice net-shape potentially, has influence on the possibility that can produce solution by this method like this.

For each method, result's adaptive sequence can be estimated at one or more above standards.By the operation of this and particular network is required to make up, can select optimal method.

Common operation requires to be that each adaptive carrying out will reduce the risk of step failure as far as possible, so that can correctly finish.For example, if find that it is an insecure especially process that antenna is reorientated, it may be best then using minimal amount to reorientate method of operating.

The example that adaptation method described here is different is different producing on the possibility of successful adaptive sequence generally.In preferred the realization, these methods can be sorted by the order that makes this possibility increase, and the length of complexity and adaptive sequence all increases and calculates the required time of ordered sequence in addition and also increases.Thereby, in preferred a realization, by testing these methods by the ascending order (promptly at first testing the method for possibility minimum successfully) of the solution reliability of their generations and/or the adaptive sequence of complexity calculations of adaptation method, till a kind of method has produced a solution.

So, according to another way of the present invention, provide a kind of initial graticule mesh communication network configuration has been adapted for the method that final graticule mesh communication network disposes, wherein:

First nodal set, the transmission link between the node to the distribution of transmission link timeslice, and is different from second nodal set by the communication path of graticule mesh, the transmission link between the node, to the distribution of transmission link timeslice, and the communication path by graticule mesh; And

Wherein have a set of adaptation technique, can be used for initial graticule mesh communication network configuration is adapted for final graticule mesh communication network configuration, these technology can be by the ascending sort of the complexity of adaptive possibility of success and/or execution;

This method comprises the step that applies the set of described adaptation technique by described ascending order, till the success of one of described technology is adapted for final graticule mesh communication network configuration to initial graticule mesh communication network configuration.

Prestrain and trigger function

As needs for an adaptive final graticule mesh communication network configuration part, at least some change to initial graticule mesh communication network configuration forms one group of change, make the interior all changes of this group to take place simultaneously basically, this method comprises the step by one group of such change of following execution:

To each node that will participate in any change of described group during adaptive, transmit the relevant information that changes about in the group; And,

Transmit an instruction in succession to each described node, carrying out described group described change, thereby cause that each described node side by side realizes described group described change basically.

In another way of the present invention, a kind of method is provided, initial graticule mesh communication network configuration is adapted for final graticule mesh communication network configuration, wherein:

Wherein as needed for an adaptive final graticule mesh communication network configuration part, at least some change to initial graticule mesh communication network configuration forms one group of change, make the interior all changes of this group to take place simultaneously basically, this method comprises the step by one group of such change of following execution:

When described changes of many groups arranged, information transfer step preferably included to each node that will participate in any change during adaptive, and transmission is about the step of the change relevant information of all groups.

After with instruction transfer step preset time, this method preferably includes each described node of inquiry to determine to change the step whether success takes place.

Discuss further as following, be adapted for from the configuration of initial graticule mesh communication network that final graticule mesh communication network configuration is best to be carried out as one or more change steps.Carrying out the used time of these steps generally will influence the whole reliability of network.So it is adaptive that general preferably use number of steps is in a small amount carried out, and reduces for the used time of each step to try one's best, and increase the possibility that each step is successfully ordered as far as possible.As discussed above, the order that changes step is preferably carried out by " prestrain and trigger " sequence, and its specific example is at following detailed description.

The management connectivity

For the practical operation graticule mesh, between each graticule mesh node and one or more management system, connectivity is arranged usually.In general, for the state from one or more control centres monitoring network, this connectivity is necessary.Generally, this connectivity also is used for disposing and reconfiguring node.In adaptive occasion discussed above, this connectivity can be used to send adaptive instruction from adaptation controller to node, and monitors the success of each adaptive change step.Wish to manage to connect very much to use any possible path from control centre to any node: for example, suppose to have management to connect, this can be used for storing non-management or telex network connectivity.When a series of adaptation step were performed, the management connectivity of maximum possible was important.This mistake that allows to take place during adaptive can be detected, and causes the generation corrective action at relevant node.Yet because the network topology structure that is taken place changes, the adaptive duration is to guarantee the continuous internuncial hard time of management.

According to another way of the present invention, a kind of graticule mesh communication network is provided, this network comprises the transmission link of arranging by a kind of network topology structure between a plurality of nodes and the node, at least some node is linked to a plurality of other nodes by transmission link, each of described some node at least has a routing table, be used for by the regulation link through the network route signal, signal is sent out to another node from a node along these links, and can upgrade routing table according to the state of link in the network, each of described some node is at least arranged like this, make that for the certain predetermined change of network topology the routing table that is updated also is applicable to immediately by the network route signal.

Preferably each of adaptive described some node at least enters the partition table schema for the described predetermined change necessarily of network topology structure, the routing table of before certain predetermined change of described generation, once this network topology being used, continue on for by the network route signal, calculate simultaneously and the routing table of the renewal that separate storage one is separated, after the table schema that splits withdrawed from, the routing table of renewal was used for by the network route signal.

Described certain predetermined change comprise one or more inefficacies or recovery, the generation of link or the modification of link desired function.In this case, " desired function " can refer to that following " cost " as link is alleged in describing.

According to another way of the present invention, a kind of method is provided, measure the behavior of the graticule mesh communication network that proposes, operate an existing graticule mesh communication network simultaneously, wherein:

The graticule mesh communication network that proposes comprises a knot-net that proposes, wherein each node can be communicated by letter with the Radio Link between described at least one other node by described each node with at least one other node, during signal occurs in a timeslice from first node to second node by each transmission of link; And wherein:

Existing graticule mesh communication network comprises an existing knot-net, wherein each node can be communicated by letter with the Radio Link between described at least one other node by described each node with at least one other node, during signal occurs in a timeslice from first node to second node by each transmission of link;

This method may further comprise the steps:

Use in existing graticule mesh communication network one or more non-cutting time sheet, simulation is by the wireless transmission environment of the transmission configuration of one or more propositions of link, these links exist in the graticule mesh communication network that is proposed.

Whether this method for example can be used between new node installation period, can operate consistently with existing graticule mesh so that verify it.As another example, when to the change of a new link and painted arranging when taking place, at this moment Fu Zhu timeslice can be used for verifying this new whether arranging in whole graticule mesh compatibility, simultaneously former link and painted the arranging of operation still.Can test arranging of making new advances in turn to each regular timeslice.

Now will be by example with reference to the description of drawings embodiments of the invention, wherein:

Example by the node network that provide and that be connected to trunk of interconnection simply is provided Fig. 1;

Fig. 2 A and 2B together illustrate a flow chart of simplifying for an example of formation method according to the present invention;

Fig. 3 is a schematic diagram, the operation of an example of the anti-isolated process of expression;

Another example by the node network that provide and be connected to trunk by switching center of interconnection simply is provided Fig. 4;

Fig. 5 simply illustrates first example that is used for determining that a link set whether will the transmission mode that (selfconsistently) operates from as one man; And

Fig. 6 simply illustrates and is used for determining whether a link set will be from second example of the transmission mode of as one man operating.

I. graticule mesh network

At first referring to Fig. 1 of accompanying drawing, communication network 1 has a plurality of node A-H (Fig. 2 only illustrates eight), and they to the interconnection in logic each other of each point-to-point data transmission link 2 between the A-H, provide the graticule mesh of an interconnection node by node.Node is provided by single direction basically (being short transverse) wireless transmission the link between the A-H 2, and promptly signal is not broadcasted, but points to specific node, and signal can pass through at both direction along link 2.Transmission frequency is generally at least at 1GHz.Each node A-H has a plurality of antennas, is provided to the potential point-to-point transmission link of other node.In a typical example, each node A-H has four antennas, thereby can be connected to nearly four or more other node.

In the example shown in Fig. 1 is simple, the graticule mesh 1 of interconnection node A-H is connected to trunk 3.Pass through at it from the data traffic of trunk 3 is called backbone network here and connects (" TNCP ") point 4.As mentioned above, be to be understood that this term should be interpreted broadly and be the link node to any external network, and is not limited to the connection of traditional backbone network.Being connected between TNCP 4 and the graticule mesh network 1 typically by graticule mesh insertion point (" MIP ") 5.MIP 5 typically will be made up of standard node 51, and this node has identical physical structure with the node A-H of graticule mesh network 1, and is connected to adaptive especially node 52 by feeder link 53.Adaptive especially point 52 is provided to the high data transmission rates of TNCP 4 by suitable (wireless) link 54 and connects, TNCP 4 then have suitable equipment to be used for sending and receiving with these high data transmission rates.In an example, a MIP 5 and a TNCP4 will be arranged.In other examples, at least two MIP 5 and two TNCP 4 will be arranged, and have some MIP 5 are provided to trunk 3 (or to a plurality of trunks) by each TNCP 4 some connections.TNCP 4 or each TNCP 4 can be connected to more than one MIP 5.

Generally, the place of TNCP 4 will be mainly by forming the route via decision of existing trunk 3 cables institute.The position of MIP 5 will be considered that generally some factors select by the operator of graticule mesh network 1, and these factors comprise the position of the node A-H of the place of available TNCP 4 and graticule mesh network 1.As mentioned above, that the operator of graticule mesh network 1 may dispose one group of key at first or " seed " node, so that before providing services on the Internet, set up a kind sub-network, can be connected to graticule mesh network 1 immediately when needed to guarantee a large amount of potential users to potential user.Should be understood that position and the place of node A-H (user's node or kind child node) are mainly determined by the availability for the suitable website of arrangement equipment.User's node will be positioned at usually or the building near the associated user near.

As understanding from Fig. 1 and as seen,, just having determined the sight line between the node A-H in case established physics place and the position of node A-H.In other words, can determine that those nodes are " as seen " (under above-mentioned meaning, promptly two " as seen " or " sight line " each other nodes can be with the frequency used in the graticule mesh physics 1 or a plurality of frequency radio communications each other) for those other nodes.Determine that as seen those nodes can carry out in fact each other in a number of ways, for example pass through to observe and test, or use suitable investigation method or both combinations in relevant node website actual physical.Find in the reality that some node is sightless each other.For example among Fig. 1, though node A to each node C, D, F, G are visible, node A is for node B, E or H are sightless because high constructure 6 has hindered between node A and the B and node A and E and node A and H between transmission.In addition, those nodes are that visible this problem is time dependent for those other nodes, as the foundation or the dismounting of building, the growth of trees or felling or the like.

II. the formation of graticule mesh

II.1. foreword

Set up a node set, wherein each node is visible at least one other node in principle, must be from all possible sight line between the node, select those to be suitable as in the graticule mesh network 1 node of actual wireless transmission link between the node most.As mentioned above, this process is called as " formation of graticule mesh " or similar appellation here.Can see, a maximum sight line or potential chain way being arranged between node for the node of any reasonable number, and those potential possible combinations of transmission link subclass of huge amount.

Like this, a node set (this may all be kind of child node or all be user's node or mixing) and at least one MIP have been set up, and the set of available sight line (being potential link) between all nodes and MIP or each MIP, must select those sight lines then which should actually be used as wireless transmission link.During this process, when definite which available sight line should be as link, the some factors that have the operator to consider.These factors will comprise the available data capacity that graticule mesh is total; Network is to the elasticity of signal node point failure; The user is to the wireless transmission of other node; The service efficiency of wireless bandwidth; Graticule mesh Network Management facility; The scalability of network (promptly in the possibility of not carrying out increasing under the basic reconstruct situation); And the influence of adding or removing indivedual nodes.When forming the graticule mesh network of interconnection node, can consider all of these factors taken together.Yet most important factor is relevant with the data traffic transfer capability of graticule mesh network usually.

Below be used to form the detailed description of an object lesson of a kind of method of graticule mesh network 1, reduced intentionally must be at the number of whole graticule mesh network allocation with the link timeslice of the traffic load of transmission promise as far as possible, this reaches by attempt to reduce product " bandwidth hop " or product " bandwidth-distance " in whole graticule mesh 1 as far as possible, is the effective way that forms the graticule mesh that satisfies all traffic demand because believe this.In brief, with the shortest available passageway the user of peak volume being linked to the graticule mesh network exactly realizes.

Because a variety of causes comprises being desirable to provide a kind of equipment so that can measure the signal or the interference of reality, preferably transmits the traffic load of all promises, keep at least one free antenna at each node simultaneously.Interference can comprise " directly " interference, this directly is received at the 3rd node to the transmission of another node by a node and causes, and " indirectly " disturb, and for example this is caused by the reflection of the signal that is transmitted or scattering or from the interference in the source outside the graticule mesh.In addition, there has been free antenna to check to be intended for use each sight line of following and then the preferred adaptation step that will discuss, can be used as a Radio Link.There has been free antenna also to make it possible to or simplified the correct work of after adaptive sequence has realized, checking link at least.And then free antenna makes the adaptive of graticule mesh to carry out under the situation of communication stream not being disturbed.

Should be understood that, method as described herein is generally carried out by the appropriate software that operates on the suitable computer equipment, and variable or variable mark or the sign expression node known to general in the technology that generally uses a computer, sight line and link, and the attribute that node is given.So in general, for example saying " node " and say that it is " marked " here, can think that this meaning is meant maybe can be understood that, computer program variable (being included in one " object " under the meaning such as object based programming), expression node are endowed attribute or " by indicating " in addition.Computer based database and/or suitable data structure generally are used for storing and organizing data.

In the following exemplary method that will describe in detail, this method is preferably sought and is had only a node to the available passageway of MIP before each stage, and the appointment of using early than their bandwidth can not be connected to graticule mesh to these nodes graticule mesh network of packing into so that can not ignore any node.

Fig. 2 simply illustrates the local flow chart of method one example of a kind of mode according to the present invention.Can understand that from following explanation this method has some branches and loop, in Fig. 2, not illustrate for clear.And many steps repeat to apply possibly.For example, one of " anti-isolated " program that below will go through is called, may cause that this program calls the second time on demand, be integrated in the graticule mesh because call for the first time, itself may cause that other node (individual other or in groups) becomes independently itself to the independent point location and with them.

In the following preferred embodiment that will go through, at first carry out some initialization step.Then, constitute of the set of each node of link, the structure of " topological structure originally " is provided to provide here to the nonredundancy path of MIP.(the nonredundancy way set is wherein to have only the set of a path from each node to a MIP, does not promptly have the path of " redundancy ".) as its part, carry out so-called " anti-independent " program at certain phase and also repeat.Originally each path from a stage to a MIP is called as originally here in the topological structure.For the elasticity of network range is provided, these paths also are counted as the extension from the node to MIP, and then through to the connected core network of graticule mesh.

Then, add redundant via as far as possible, make node as much as possible have independently path fully to core network, so that elasticity (in originally originally under the meaning of any component failures) is provided, and provide diversity (for example make in a large number data from a node can be divided into by different paths send in a small amount).

As mentioned, " topological structure originally " is the nonredundancy set from each node to the MIP path.In many preferred exemplary, originally topological structure has the traffic that the reasonable time sheet transmits all promises, and originally in the topological structure between node and the MIP any path all be no more than the maximum relaying hop count that allows of this node, and in addition, topological structure leaves at least one free antenna at each node originally.In a preferred embodiment, adding to originally afterwards, the redundant via of topological structure can be grouped into one of two or more set.First diversity set is to various routes/standby additional way set that provides; But variable topological structure adds first diversity and is integrated into each node and leaves at least one free antenna.The set of second diversity is to various routes/standby another way set that provides, and to using last antenna at least one node of each path.Can add the set of further diversity, specifically to some node or serve other purpose various paths are provided.

II.2. initialization

Referring now to Fig. 2,, in step F 1, each node is marked with the traffic of its promise and converges and source speed." promise " communication rate is that the operator agrees minimum data communication rate that this node is provided.Should be appreciated that the service regulation speed for some type generally is that (greatly) is higher than committed rate.In step F 1, communication sink and source speed that any kind of child node promised to undertake are set to zero.

In step F 2, each node indicates the current available sight line number from this node.Each node also indicates the number of free antenna.For node or the situation that will be mounted or be removed (this means graticule mesh formation must install and/before removing and afterwards all may), this node is labeled as has only one to can be used for the antenna of topological structure originally.When needed, but other node of mark should be " leaf " in the topological structure originally to indicate them, be configured to such node in other words, it is at originally originally end, and is not configured to be used in the topological structure originally the transition node of other node traffic.From operator's viewpoint, may need this configuration for new node or for insecure node.

In step F 3, MIP or each MIP indicate the traffic when the promise of pre-treatment by this MIP.Has null value for initial this of all MIP.

In step F 4,, calculate minimum " hop " number that uses any available sight line between this node and MIP (if having only a MIP) or the nearest MIP (if having) more than a MIP for each node.This can realize with some approach.In an example, all nodes at first are marked with unlimited hop; Have then to MIP can with all nodes of sight line be labeled as and need a hop; Then all current be in unlimited and have to be designated as to all nodes of 1-hop node sight line need two hops; Repeat this process till not having node to have unlimited hop.Should be understood that this sequence is not finished, promptly have node still to have unlimited hop, they all can not be connected by other iteration of this process, and that is exactly that node can not be connected to MIP.In this point, the operator for example can determine to provide further seed decision, so that allow this node to be connected to MIP.

For each node, this node and maximum acceptable relaying hop count between the link node that a path leads to is originally arranged in the topological structure is marked on this node place now.The hop maximum is set can accepts an example of the reason of number and be, some data transport service is a delay-harshness.For example this comprises the service to voice transfer or real-time video.This delay-harsh traffic may mean, if above hop count between certain, because the cause that the finite time that is experienced in any link by data reality passes through postpones, the path between MIP and the specific node will be not suitable for transmitting this traffic.For the maximum relaying hop count of difference delay-harshness service, may be different for nodes different in the graticule mesh in addition, the service for different node provides specific equipment in view of the above, eliminates such as the echo under the voice service situation.Like this, in this stage of this method, whether may wish to check has any node to connect this node and MIP more than predetermined relaying hop count, and if any such node arranged, then those nodes of mark are not for being connected to graticule mesh network (or at least for the required certain service of the user who is positioned at this node can not).Other service, such as file transfer or video-on-demand service, delay-harshness not necessarily is not so may need this service is provided with any restriction of relaying hop count.Certainly have the allowed relaying hop count of restriction path and/or other constraint of applicability.

II.3. anti--isolated program

Any knot stage in this method has one or more nodes, also is not linked to link node, and has only an available sight line, and if those nodes to be linked to a link node, then must distribute a link to those independent sight lines clearly; Like this, by such node being distributed before an available sight line carries out as link node is linked to graticule mesh network remainder, preferably have only an available sight line node all to carry out a check to any, and if any this node is arranged, then they are linked by those independent sight lines.This check is commonly referred to as instead-isolates program here.

This anti--example of isolated program be in step F 5, search any have only one can be with the node of sight line to other node.For any this node, be designated as a link from the sight line of this node, and at the other end of link again to this node assigned source and the speed of converging.The communication rate of promising to undertake at link other end node place is marked with opposite value " 1 " then.This mode with example in Fig. 3 simply illustrates, and wherein available sight line is illustrated by the broken lines, and the link table of appointment is shown solid line.Before the anti--isolated program running of step F 5, determine that node A has four available sight lines, the source speed of promise is 1.4Mb/s, and the remittance speed of promising to undertake is 1.1Mb/s, and needs minimum three hops to nearest MIP; Node B has an available sight line (to node A), the source speed 1.3Mb/s of promise and the remittance speed 1.2Mb/s of promise, and need minimum four hops to nearest MIP.At this point, the previous required timeslice of the traffic as source of promising to undertake at B and remittance speed mark of transmission is distributed to link A-B.After having moved anti--isolated program, the sight line between node A and the B is designated as a link; Thereby node A has only three available sight lines, and node B does not have available sight line.The source speed of promising to undertake for node A after moving anti--isolated program is 2.7Mb/s, and operation anti--the remittance speed of promising to undertake for node A after the isolated program is 2.3Mb/s (being respectively for A and the previous speed sum of B), and respectively is set to-1 for source and the remittance speed that node B promises to undertake.

Significantly, be not changed for the minimum relaying hop count that does not have node A, B to nearest MIP.If can accept the relaying hop count less than can accepting the relaying hop count and add one to connecting the code maximum from A from B to connecting the code maximum, then A should be labeled as again and have maximum and can accept relaying hop count h _BSubtract one.

Simply mention as above, should be noted that if by instead-isolated program specifies any link, then this may or individually or by group, cause that the available sight line of one or more other nodes reduces one.Thereby, after specifying any link, preferably search for any other and have the link of single available sight line, and the anti--isolated program that reruns, till not having this node.

Shall also be noted that anti--isolated program can be connected to a MIP to a node.In addition, in the following step that will discuss, be connected to MIP if the node A for example among Fig. 3 is marked as, node B is mark so also, and setting adjacent with node A from it and-1 can identify node B.For example graticule mesh big anti--when isolated part was connected to MIP, this may repeat to take place.In addition, if anti--isolated program causes that the available sight line of another node is reduced to zero, then can not eliminate effective graticule mesh.For network operater the various selections that overcome this situation are arranged.For example, though this is not best, network operater can attempt reduce distributing at some the antenna of last (or reservation).

II.4. generate topological structure originally

In case finished anti--isolated program satisfactorily, selection does not have the node of connection to be used for the candidate who connects to MIP as the next one.Be preferably in 6 pairs of step F have the remittance speed of maximum promise source speed or promise or they and and the node that also is not connected to MIP is searched for.Below follow-up step F 7 to F11 be applied to this node.This program (is selected node then, preferably have the remittance speed of maximum promise source speed or promise or they and and also be not connected to the node of MIP, and this node applied following follow-up step) other node that does not connect is as yet repeated, till all nodes can reach MIP.Another determines to select it is applied the mode of the node order of step afterwards, can be based on other standard of being selected according to local user's density, the demand of the traffic etc. by network operater.For example, can node be sorted by following mode, promptly select those not to be connected to the MIP node as yet or another has been connected to the node of MIP, and then by having the physics shortest path, or need the most minimum hop number to be connected to MIP or be connected to the order of the other node of MIP, apply following steps to these nodes.

Like this, in step F 7, in the preferred embodiment, for searching at the selected node of F6 so that find out all paths by the link of available sight line and/or previous appointment, those links from this node to be less than h hop any MIP that leads, here h is the limitations set for this node, for example because traffic delay.In this stage, existing if node comprises to the direction path subsequently of MIP originally to the node of MIP, and after this this node cross-section available so far in the still untapped sight line of script topological structure, then preferably ignore any such path.This has guaranteed that the path that generates the redundant topology structure is rejected, and should be noted that the redundant topology structure, is a plurality of paths are wherein arranged, the topological structure of being made up of the link that can use to any one MIP from any one node.

In case these paths find, be sorted at step F 8 paths.The preface that path is set up in step F 8 can be based on some criterions.One is selected preferably is that path at first is sorted according to the hop number, is preferred for minimum number; As they lead according to this first criterions of which MIP, preferably for the MIP that has minimum current promise communication rate; As second criterion, by the physical distance sum of each the link/sight line that constitutes this path, preferably for the shortest physical distance; And for third level criterion, by in the path as the relaying hop count of having promised to undertake link, preferably promise to undertake number of links for maximum.Like this, in this embodiment, path is sorted, make the link node optimum that minimum relaying hop count leaves, link node with minimum current promise stream rate is preferred as first criterion, with the shortest path physical distance is the criterion of next, and has promised to undertake before for re-using maximum possible that number of links was the 3rd criterion.In another was selected, path at first was sorted according to the physical distance sum of each the link/sight line that constitutes path, preferably for the shortest physical distance; As they lead according to this first criterions of that MIP, preferably for the MIP that has minimum current promise communication rate; As second criterion, press the hop number, preferably for minimal amount; And for third level criterion, by in the path as the hop number of having promised to undertake link, preferably promise to undertake number of links for maximum.

In step F 9, think that each path is in the ordering of determining among the F8, and attempt all available sight lines on each path are transferred to link.Like this, in step F 9, path is tested.Whether first test is definite, if all available sight lines are converted into link on this path, have any node to be in and have in the path that is less than a free antenna; If any such node is arranged, this path is rejected.Such fact is considered in second test, promptly the sight line on the path is converted to link and will be connected to single MIP to one or more nodes.Like this, second test verification is to determine the connection of these nodes to MIP, whether will cause that the total promise bandwidth at this MIP place surpasses the maximum promise traffic rate that allows for this MIP.If path is rejected once more so.At this point, network operater can be provided with the maximum committed rate of the traffic that every MIP is allowed to; The committed rate that this maximum allows can be the part of this MIP capacity, to keep the capacity part that MIP is used for stand-by channel.The 3rd test verification be from the hop of other node, these nodes be as to those other nodes each maximum hop restriction add the result of this path and become connection.The 4th test verification, in order to send the promise traffic from any new connected node, any time sheet that needs along any some place of this path or additional timeslice can be assigned with at each end node place of described link.Can apply the one or more of these tests.Preferably apply all these four tests.

In step F 10, at the not unaccepted as yet path of testing procedure F9, all nodes are marked as and are connected to a MIP on this path.In addition, each sight line is labeled as available: those sight lines are from any node or all untapped sight lines of MIP that have a free antenna now on the path; Two all are connected to any sight line of moving between the node of MIP now; Any sight line between two such nodes, one of these two nodes are any does not freely have the required minimum timeslice number of the link of generation; And operate in MIP and be connected to any sight line between the node of certain other MIP.This mark of sight line in the step F 10, be for eliminate further consider will be no longer available as the result who adds this path sight line, and this allows this method to identify this path to add the problem that will maybe may cause.

After carrying out the mark of step F 10, be recalculated to the maximum relaying hop count of MIP and available sight line number for the node that all are not connected to MIP as yet in step F 11.Count showing the node sum of violating certain criterion.These criterions can comprise also there is not the node of available sight line now, and the minimum relaying hop count from this node to MIP, surpass the predetermined node that can accept maximum relaying hop count of this node traffic.If the number of violating is zero, then keep link and mark on the original path; The promise communication rate of the node of all new connections is added to, and the node of this new connection has been labeled as on the committed rate of the MIP that is connected to; The promise communication rate that makes the node of each new connection is zero; And best anti--isolated program of repeating step F5 in case of necessity then.On the other hand, if severals non-zeros of violating then together are made in step F 10 record of this path of mark just with violating number, and the mark of making in step F 10 then and path itself reach in any time sheet distribution that step F 9 is made and completely cancel.After this, consideration is from the Next path of step F 8.

If find not have zero violation from the path of F7, then this method is preferably returned and is produced the minimum path of violating number; This path is considered the node that all show a violation, then preferably select to have maximum promise source speed or promise to undertake converge speed or they and node, replace the node before selected, and anyly apply step F 7 to F11 to this node in step F 6.May need a program to prevent Infinite Cyclic from the result to this step.In order to stop this circulation, during this step, it is made each node of attempting it is added to graticule mesh and be marked as " locking ".When visit has been labeled as a node of locking again, this node is left in the basket, and attempt to be connected to a node, this node preferably be again have maximum promise source speed or promise to undertake to converge speed or they and node, but this does not reach MIP and can be by locking as yet, up to added a path or all nodes by locking till.

In case added a path, any node that is labeled as locking is cancelled mark, and this method turns back to step F 6 then, and repeat to be connected to MIP by the link that is assigned to available sight line up to all nodes, perhaps determined do not violating under above-mentioned one or more criterion (leaving a free antenna at each node such as hope), certain node can not be connected to till the MIP.

Above step has been set up and has been linked the set of each node to the nonredundancy path of MIP, and alleged here " topological structure originally " is provided.As mentioned, in a preferred embodiment, topological structure is a kind of nonredundancy topological structure originally, wherein has only a path from each node to MIP, and wherein has a free antenna at least on each node, and can transmit the traffic of all promises.In another embodiment, topological structure can not be confined at each node and leave a free antenna originally.

11.5.MIP, node and link " obstacle "

Above-mentioned step attempts each node is connected to MIP.For certain topological structure, above method is a subclass that will preferentially be connected to node available MIP, consequently excessively uses those MIP, and other MIP remains on the not enough state that uses in the while graticule mesh.This may hinder topological structure formation originally, maybe may produce the unacceptable traffic balance of whole graticule mesh.Handling this inefficacy or uneven the best way is to introduce additional parameter to the formation method, is called " MIP obstacle " here, and repeats to have the formation method of described additional parameter then.In preferred an arrangement, from formation method first by the appearance MIP that has the excessive traffic or a plurality of MIP that see, designated one additional hop-count obstacle, this obstacle are added all are calculated on the hop-count at the path that those MIP stop.For example, if step F 7 to F11 fails to add a path, this may be, if it were not for it surpasses the maximum such fact of load that allows on the MIP in step F 9, then path can be accepted originally.This MIP is the candidate for obstacle.Should be noted that this obstacle only just is being applied in when being used for the other path ordering of selection schemer, and when the traffic relaying hop count of estimated delay harshness, do not use this hop obstacle.In a preferable methods, this becoming more meticulous is used for each MIP is regulated the MIP obstacle, and consequently graticule mesh has more uniform distribution to the MIP traffic.Be to be understood that if desired, this MIP obstacle can also be used for introducing to the formation method obstruction of other type, for example causes that the traffic preferably is routed to specific MIP.

The formation method itself that repeats to have the obstacle of interpolation may cause forming topological structure originally, maybe can not produce acceptable balanced communication amount and distribute, and under this situation, specifies the candidate of same or other MIP as further obstacle.In this case, formation method can one or obstacle repeat repeatedly at one or more MIP.If or all MIP have obtained identical non-zero obstacle grade, perhaps after certain fixing maximum repeat number, preferably stop this repetition.

Be to be understood that, can introduce the obstacle of other type, so that form the obstruction of other type of introducing to graticule mesh to the formation method.For example, step F 2 allows nodes to hinder to introduce can antenna number to reduce in the selected reduction, and this will limit the number of links that can form.In step F 2, this is used as and forces specific node to be configured to the option of " leaf " in the graticule mesh, be configured in other words at a terminal originally node, and it is not configured to be used for the interior excessive node of script topological structure of other node traffic.This configuration may need for new node or for also reliable node from operator's viewpoint.

Another form of obstacle is the link obstacle.Under some situation, some links are not wished its comprising in graticule mesh very much for other link.At undesirable link is under complete unacceptable situation, is not considered corresponding sight line in forming process simply, and this may stop finishing of formation.Yet, under other situation, wish that forming process finishes, the undesirable link of the least possible use simultaneously.A real example like this occurs in such situation, and promptly a large amount of nodes is arranged in and is close to straight line, thereby many sight lines are deferred to the straight line that this is close to.The city that is based upon the two sides, river that are close to straight line may cause this example.Under this situation, by using the Radio Link of not following this straight line, and the least possiblely defer to the link of straight line as far as possible, can improve the interference level in the graticule mesh thereby improve its spectrum efficiency with those.This example of another reality appears at, and the message capacity of Radio Link is the situation of the nonlinear function of linkage length, for example because the modulation type rank that can be used on the link change (for example every symbol figure place) more.Thereby can adopt reflection to can be used for the obstacle of modulating on each link.

Be preferably in step F 8 by regulating, form to graticule mesh and add the link obstacle by the value of the link of obstacle.If at first press the ordering of relaying hop count in step F 8, then can be specified a value H by the link of obstacle to each, rather than 1 hop.For other ordering, but weighting other factors in addition; For example, physical link distance can multiply by by the H under the situation of the link of obstacle.The H value can be conditioned so that stipulate by the preferred grade of the link of obstacle.

Note,, have only, just apply the link obstacle when when step F 8 sorts to path in other mode as for the MIP obstacle; When postponing the harsh traffic and estimate maximum relaying hop count, do not use the link obstacle.

II.6. add redundant via

In a preferred embodiment, the result of above method step is a database or data structure, represents all nodes, the link of the connection between them, and still available sight line between them.So far the graticule mesh topology of networks of Sheng Chenging is nonredundancy (is each node have only one single be routed to a MIP).In order to provide elasticity, and, preferably node as much as possible is added redundant via in order to provide high bandwidth to the user who selects to the graticule mesh network.This can realize by some modes.

When more than one MIP is arranged; in a preferred embodiment; this method at first attempts to provide the maximum nodal point number that has to the independent communication amount path of different MIP, the user who makes at those node places to network in any single inefficacy fully be protected (distinguishing mutually with the inefficacy of user's node itself certainly).When more than one TNCP was arranged, in another preferred embodiment, this method at first attempted to provide the maximum nodal point number with the independent communication amount path that leads to different TNCP.TNCP by shared device when single accessing points is linked to core network, in another preferred embodiment, this method at first attempts to provide the maximum nodal point number that has to the independent communication amount path of core network.In the phase I, at first select redundant via, so that be retained in the antenna at each node place; These additional paths are called " set of first diversity " here.In second stage, use that keep at one or more nodes place or idle antenna to add further redundancy then.The node place that is preferably in non-MIP in this stage preferably uses idle antenna.In this stage, can not cause interference problem as long as can do like this, preferably also specify a link to available sight line.Generate additional via in this second stage and be called " set of second diversity " here.

Whether like this, in the phase I that is used to add redundant via, for each node in the graticule mesh, add a sign independent_paths, path returns different MIP to indicate this node to have fully independently.All signs initially are set to FALSE.Can allow those nodes of hop-count for having maximum, as discussed above in this stage, preferably include only those paths that are no more than predetermined maximum relaying hop count.Will be appreciated that, can be used to generate the sight line of first diversity set, identified by being used to form in database that the said method step of topological structure originally produces or the data structure: available sight line be those operate in node between sight line, these nodes are to all having two untapped antennas at least, and have the adequate time sheet at least at two ends.(all only have a sight line of not using to finish on the node of antenna be marked as unavailable in step F 10).

Get each available sight line then, to if make this sight line become link its independent_paths sign count from the node number that FALSE becomes TRUE.A method for this reason is, to each current node that is masked as FALSE, the script from this node of determining at the above method step to MIP originally.To each intermediate node on this path, consider to have this intermediate node but the abandoned graticule mesh of all its attachment links.Attempt to find the path of a MIP under each situation, this path is still available and do not violate maximum hop constraint for this node.If for the removal of each intermediate node then such path is arranged, then sign will change TRUE under each situation.(should be noted that this program may find two or more independently paths, they are not the paths of determining in the above method step).Select such sight line then, its interpolation will produce the variation of maximum number sign and can be added and not free sheet distribution inefficacy, and it is specified a link; Then those are changed suitable sign setting according to the node that the said method step has now obtained independent path; And, be labeled as any sight line between the node that no longer includes two free antennas unavailable.(for a criterion, to all node summations, generation has every node can be selected to the sight line of the new path of the average minimum hop sum of MIP).

Any this program that other available sight line is repeated to add link is not till having available sight line can cause that sign changes.Should be noted that when repeating this program, preferably from beginning to recomputate the sign variation number of every available sight line at first, because comprising of last redundant link will influence the result who obtains from other potential link now at every turn.

The above phase I is for adding redundant via, in case can not have sign to change again, then or all nodes the path independently to MIP is arranged, perhaps only may add further redundancy by so far also preferably being retained in the antenna at each node place.For such work, the set that redefines available sight line be operate in any such node between the sight line set, its each have at least one idle antenna and have the time enough sheet at two ends at least.Finish the setting proceeding to indicate from the stage that before was used to add redundant via, be recycled and reused for the link that adds the redundant via phase I with the new permission set of available sight line and add the loop, up in case the sign variation does not take place once more.

This stage preferably carries out with the stage of two segmentations.The first segmentation part does not allow to use its arbitrary end to be in the sight line at the MIP place that has only an idle antenna; The second segmentation part allows their use.

When the hope redundancy comprises other TNCP or core network accessing points, can use above program, but when take place to replace MIP respectively when sign changes in decision, consider requirement for the path that leads to different TNCP or core access point.

As to the further refinement of above-mentioned interpolation redundant via process, can add only provides local multifarious redundant via.Local diversity is used to refer to the node that has one or more stand-by channels here, and these stand-by channels are provided to the connection of core network under the situation of only removing a subclass of intermediate node.Should be understood that the inefficacy of other intermediate node may cause the inefficacy of this node script with all stand-by channels.

Above all with two kinds of situations of local redundancy under, these can be realized by one or more standby nodes.In an other implementation, the complete various path that only needs a stand-by channel will be searched at first.If with each intermediate node is opposite successively, all intermediate nodes once are removed, by being tested, the variation of above sign can find this path so.

The method of the various path of employed selection or local various path under the situation of link or node fails preferably should be taken into account the whole variation by the traffic distribution as a result of any single inefficacy.For example, the inefficacy of given link expects to cause the rerouting to suitable stand-by channel of all traffics of using this link; And the inefficacy of given node can cause, except having the traffic of its source or remittance at described node place, and the rerouting of all traffics by this node.In preferred implementation, calculating for the desired volume of various stand-by channels will be considered described rerouting, this allows stand-by channel to obtain the advantage of grid capacity, and this capacity is to be discharged by described rerouting after following any given link or node fails.Consequently, have for the ratio of node or services selection purely based on the stand-by channel of the required greater number of topology.

" service " may be defined as the least unit that transmits the traffic with it to the user.For example, in atm network, service can be corresponding to an ATM PVC (Permanent Virtual Circuit).Have two leased lines to connect the one or more users that are attached to a node, and under the situation of the access to the Internet by core net, these constitute three services.In any stage of selecting various path process, be defined as here along those nodes or other device (core network visit) of script for " remaining relevant " of serving, will cause the inefficacy of service for their inefficacy of this service.

A service is being provided under the situation of one or more stand-by channels, to these paths one intrinsic priority should be arranged preferably, make and to carry out a kind of logical process in user site and core network place, by the path of the preferred complete highest priority of this process, select optimal path to be used for the situation of any inefficacy of network.This selection preferably can be carried out in user site and part, core network place, and and relate to or need not to know the state of network, and only based on which path being complete understanding to.The result of the set of this local decision-making preferably can provide the optimum performance of whole graticule mesh as a whole.

In this preferable methods, provide the following series of steps of execution can realize satisfying these purposes attempts.

As first step, each direction sign of each link is with " node fails table ", this comprise may node fails to each item, wherein said item provides the total amount of the idle capacity that can be used to be assigned to this link direction stand-by channel.Idle capacity under each situation is the free time amount in non-inefficacy situation sheet of following current time distributes, and does not re-use it as the traffic originally if add described node fails.And all available sight lines are marked with in each direction and comprise all node fails tables of zero.

As second step, a set relevant for each service initial residual is labeled, and is relevant originally all nodes and other device, should be noted that this is to seek the path of other route around it.

As third step, select certain ordering of all services.In one embodiment, this ordering is the descending (source of promise adds the remittance traffic) of every service bandwidth.In another embodiment of road, this ordering is (may be reflected in service is paid in the different traffics) by the different coml importance regulations of service.In another embodiment, the ordering of service is remaining relevant descending.Will be appreciated that the target that depends on network operater can adopt other ordering rule, and above-mentioned ordering can be to be used in combination the given different priority of each factor.

As the 4th step, for each service of being got in this order, identification institute might arrive the path of MIP, comprises available but those paths of the sight line as link also of no use of use.If these these at first be sorted by the selected minimum remaining dependency number that just exists of path, then as pressing total these paths of " cost " minor sort of hop uplink cost sum in the path; Each link cost preferably a function of form (every hop constant k 1 adds and transmits required per extra time of sheet constant k 2, the 0＜=k1 of the traffic＜k2).Whether in this order, it is available to determine it to test each path.Then this stand-by channel only is only available in following situation, if promptly it can be designated, because by adding each remaining relevant will being removed of stand-by channel, but not can the node fails table (such as in the above first step definition) in the idle capacity item, any link both direction either direction is reduced to below 0 in path.Yet having one or more timeslices can be in distributing on one or more links, if they are added the increase link capacity, at this moment make does not have idle capacity to be reduced to below 0 at the either direction item in the node fails table.Under this situation, this path is available.

What be chosen in that the 4th step finds first can use path, and adds any required timeslice, makes in the first step in the node fails table of each direction definition of each link of obtaining timeslice all, increases by this timeslice capacity.Relevant by adding the removed relevant remnants of this path from the node tabulation, from its remaining list related, be removed, and record stand-by channel and its priority.In these these methods, if a stand-by channel produces early than another stand-by channel, then the priority of this stand-by channel is higher than described another stand-by channel.Be adjusted along all other list items of described stand-by channel both direction in the node fails table, remove by stand-by channel to reflect remaining being correlated with.

To each more than the service execution during the 4th step, can not be reduced to zero to the remnants of each service are relevant.In one embodiment, turn over each service, remaining relevant or be reduced to zero up to it, perhaps can not be further reduced.In another embodiment, consider each service once, then according to the criterion that is used for their orderings at first again to the service ordering, do not consider again once or the like there being zero remaining each relevant service, up to no longer including remaining relevant can being removed.In the 3rd preferred embodiment, after having write down each stand-by channel, recomputate rearrangement fully, select another stand-by channel or the like, up to no longer including remaining relevant can being removed.

Should be noted that for each node its initial residual is relevant should to be considered to comprise itself.Have the remnants of node B when relevant at node A, this remaining relevant can not removal by any link that is connected to B of use, unless A=B, under this situation, it can comprise the link of any B of being connected to, unless this link is in the script of the script from B to the core network.The purpose of these two rules is set that stand-by channel will be provided, and these paths can be tackled any one device and both inefficacies of any one link.

As mentioned above, the interpolation of the timeslice that is allowed in adding the process of path is allowed to comprise the situation that sight line transfers link to, supports the theme of the availability of antenna that this link is required and timeslice.

In one embodiment, the selection of use based on the process link of independent_paths FLAG followed in the appointment of stand-by channel.Ordering described above is followed in this ordering.In another embodiment, removed from use based on the selection of independent_pathsFLAG process link or one or all stages, be the appointment of stand-by channel then.In this case, the selection of link partly or integrally is the product that adds the stand-by channel process.

II.7., the peaked traffic load is provided

The II.7.1 foreword

So far the enough capacity of whole graticule mesh that provide that described all formation steps relate to are so that support the communication rate that each user promises to undertake of being to and from relevant with each service.For some traffic type, this is enough.For example, the link between two telephone exchanges may the free communication rate that all really needs this promise.Yet the feature of other traffic type may be:

The communication rate of promising to undertake, the speed of promptly giving the user on demand;

The peak communication rate promptly offers the speed of user's maximum; And

The minimal communications rate, i.e. the minimum-rate of user's employing.

Two speed have defined the service that offers the user.No matter how flat other user's communications water gaging is, the communication rate of promise should provide in all time.The peak communication rate will provide in some time, the level of other telex network rate but these times will place one's entire reliance upon, and disabling devices or any influence of link in the graticule mesh.

Minimum communication rate is to the relevant natural property that uses of its service.For example, the Internet access services to the user sometimes all be available, but the user some the time may not use it fully.Under this situation, the minimal communications rate is zero.As another example, when not having in the visual field at video camera when permanent movable, the output of surveillance camera may be low (minimal communications rate), and when activity with regard to higher (communication rate of promise).Link between two telephone exchanges may have equal promise, peak and minimum-rate.In general, can the user to promise to undertake by being to and from, any traffic service is described in the combination of peak and minimum-rate.

For satisfy can some the time requirement of peak communication rate is provided, as long as when guaranteeing that their minimum-rate is only adopted in other service at all, the peak speed to each service can be provided: this requirement can be described as " requirement of peak service provision ".Because a plurality of services generally will use each link in the graticule mesh, (i.e. script topological structure in edge provide path) that certain peak message capacity level generally can get originally exactly along the script of each service.In some cases, this capacity will be enough to satisfy peak service provision requirement.Under other situation, some link in the script topological structure is increased additional timeslice will allow the peak service provision to require to be met.

Yet, under other situations, owing to two reason diverse ways may be better.At first, the peak communication rate may be far longer than the communication rate of promise.For example, the peak communication rate may be to promise to undertake 8 times of communication rate.This means that many links will need the distribution of timeslice in the script topological structure, append to the timeslice that communication rate is promised to undertake in the transmission that has distributed; This has just obviously reduced graticule mesh and has promised to undertake that communication rate transmits capacity, because when forming the script topological structure, must make certain permission to these additional timeslices.

Secondly, the described process that is used to add redundant via of last joint when a plurality of timeslices can be used to distribute to redundant via, generally produces result preferably; If timeslice must be retained in the script topological structure, providing of redundant via will be affected so.Because peak message capacity and providing of redundant via all are free-revving engines, at this moment preferably use a kind of method, the cost that is provided as with another of providing not of one of them is provided, but to replenishing that another provides.

The preferred proposition is used to provide peak capacity preferred a kind of method.This preferable methods depends on uses a plurality of paths that pass through graticule mesh between these two points, and " inverse multiplexing " is used for the ability of the traffic of a service between two some A and B.Inverse multiplexing is a kind of like this process, wherein must be divided into separated portions at A, add a label to its each part from A to the single data flow that B sends, indicate a unique part number, this part number (generally) is each increase by that forms.Each tagged part is transmitted along one of a plurality of paths then.At B, the part number is used for writing down the data that arrive by a plurality of paths; These parts according to number order are combined together, and the label label is removed, and regenerates original stream like this.

For each service, some A is preferably in user's node place.For each service.Point B is preferably in certain point on the script topology path that is used for this service.For each service, some B is preferably in some place at as far as possible close graticule mesh edge; For example it can be at the joint equipment place of all TNCP of link to core network.

If graticule mesh provides a kind of inverse multiplexing ability, the chances are to be used to satisfy a kind of method for optimizing of peak communication rate demand: determine to have satisfied great peak requirements by topological path originally; Seek the additional path that passes through graticule mesh that will replenish originally then, satisfied the peak rate requirement altogether up to these paths; A configurable then inverse multiplexing of on the script topological structure, operating, and all paths that must add.

More specifically, can portray with six parameters: to user's minimum-rate, to user's committed rate by each service that graticule mesh provides, peak speed to the user, from user's minimum-rate, from user's committed rate, from user's peak speed.These will be labeled as MT, CT, PT, MF, CF, PF here respectively.

In fact, may wish the scope of these restrictions on the parameters, such as all are constrained to the multiple of 64.000 bps them to value.Also may wish peak capacity is constrained in another scope of value that may be relevant with first scope.To suppose this constraint in the following description, and understand if desired these simultaneously and one can be removed the general granularity that allows to use any distribution.

Each direction of each link at first is marked by its available burst capacity C _B1This is the total capacity of this link in this direction, and this uses this link as its minimum load (MT or MF) sum in the script service originally of this direction less than being used for each.

Now, for each service of its peak speed, scan it originally so that each direction is found out the C along any link of this path above its committed rate _B1Minimum.Each direction is write down the minimum-rate sum that this minimum adds this service, as by the script topological structure for the peak message capacity that this service provides, be labeled as PT ₀And PF ₀Also write down value S for this service _f, S _t, they are as these digital PT ₀And PF ₀When being rounded down to the capability value of nearest permission, with respect to required PT, the amount of PF shortage.

II.7.2. by the existing new peak path of link assignment

Following steps are preferably to each service execution, wherein S _f, S _tBe non-zero, so that determine a set of path, this set provides required PT, PF when together being reversed when multiplexed to this service.(not considering CT and CF here) because they are by originally providing.The order of considering service in these steps is unessential.

Each direction of each link to this service, is duplicated all C of the peak capacity that reflection can use at each link direction this service _B1To variable C _BsAfter being rounded down to the capability value of nearest permission, along this originally originally in all links with PT to this service log ₀And PF ₀Value reduces C _Bs

At S _f, S _tWhen this service is kept non-zero, repeat following circulation:

Determine to pass through all possible path of link between graticule mesh mid point A and the B for this service;

If S _f＜S _t, by the direction of leading to user C on any link in this path _BsThe descending of minimum value with the ordering of these paths.Otherwise, from C on any link in this path of direction of user _BsThe descending of minimum value with the ordering of these paths;

If the C that all paths produce _BsMinimum value allow capability value less than minimum, then break away from this circulation: peak capacity can not be by the link capacity supply in the current graticule mesh;

Otherwise, be the path that unsatisfied peak capacity largest portion can be provided at the path of ordering beginning.This path is added in the tabulation to this service additional via.If this is n the additional via that identifies like this, then begin with peak capacity PT at n=1 _n, PF _nWrite down this path, wherein PT _n, PF _nThe peak capacity that can use from this path (even these peak capacities surpass unappropriated peak capacity);

Regulate S _t, S _f, when being rounded down to the capability value of nearest permission, with these values PT for this service log _n, PF _nReduce them.Reducing C along each direction of this path with identical regulated quantity _BsIf S _t, S _fOne of become negative value, then establishing them is 0.

At the end of this circulation, the peak capacity of service, or as far as possible near its big or small capacity, the capacity by the current link of graticule mesh provides.If any unsatisfied capacity is arranged, then preferably use following step that it is provided.

II.7.3. have the capacity of link recently now

If being arranged, at least one serves its S _t, S _fOne of non-zero, then preferably integral body repeats following process so that add an additional timeslice to graticule mesh in each repeats, up to no longer leaving sheet any time, its use will be satisfied some outstanding peak capacity at least of at least one service.

Each Radio Link is set up a sign, to indicate whether that two nodes in the link termination all have at least one idle timeslice and can use.All links as the candidate are pointed out in this interpolation for useful timeslice.If sign is not set, then do not have remaining useful timeslice, and this this process stops.

Each direction on each Radio Link is set up a counting N _Es, being initially 0, this will be used to refer in following steps, and its peak capacity is with by adding the number of the path that timeslice is increased in this direction.

For its S _t, S _fEach service of non-zero:

Each is served each direction, duplicate all C of the peak capacity that reflection can use at each link direction this service _B1To variable C _BsThe edge is to all links of all paths of this service log, with the PT to these paths records ₀/ PF ₀Value reduces C _Bs

If S _tNon-zero then to towards the path of user side to each record, scans this path so that find out and has minimum C _BsThe link of value.This link and this direction are made N _EsAdd one.

If S _fNon-zero then to from the path of user side to each record, scans this path so that find out and has minimum C _BsThe link of value.This link and this direction are made N _EsAdd one.

Note, consider the path that all replace here, because the peak capacity of their any one increased service.To cause N as a link for two path constriction point of same service _EsOn this path, increase by twice.This has a mind to: new fully timeslice can be added capacity by two paths.

If all links by sign indication up duration sheet all have N at both direction _Es=0, then this process finishes.

Otherwise, have the up duration sheet to have the highest N for coming from those sign indications _EsLink and direction, add timeslice and suitably upgrade its C to this link _Bs

Each path for the service of using this link and direction:

Renewal is for the PT of this path record _n/ PF _n, with the actual peak capacity that reflects that this path can be kept now.If any S for this service _t, S _fOne of be non-zero, then also upgrade these so as the reflection for the available peak capacity of this service;

Use this link and direction if serve more than one path, the dual counting of capacity that this mark step is preferably not additional for this.Thereby, under this situation:

Preferably press their P _nDescending consider this path, wherein P as the candidate who is used for additional capacity _nBe at PT _nWith PF _nThe greater before one of any being updated;

To first path any bandwidth of link assignment that can adopt in this order from it along whole path;

Only consider the new link capacity that first candidate stays less than adopting for second candidate, or the like.

For each service, will have by having peak capacity PT at the end of above all steps ₀, PF ₀Script originally, add zero or have a peak capacity PT _n, PF _nThe way set formed of more additional via.The peak capacity that all paths allow to serve jointly in this way set is supplied, if or for this service S _t, S _fOne of in above these steps, be not reduced to zero, then partly be supplied.

Distribute to the number of vias n of additional via in the way set, more than be selected as reflecting their descendings the peak capacity contribution.At this moment any timeslice that is added to the graticule mesh link may cause that this ordering changes.Thereby number of vias is preferably resequenced, and when only considering the capacity of number of vias 0...n-1, by for counting n to the path distribution circuit more than the n=1, this path is pressed S _t, S _fIn anyly provide maximum reduction for bigger.

Chong Xinpaixu PT then _n, PF _nPreferably all by the following nearest capability value of house for allowing, and upwards summed from n=0, equal or exceed PT and PF up to them for this service.These constitute the way set that will occur inverse multiplexing on final its then.The path that may not need one or more higher number, and they are not included in this set in this case.

In one embodiment, the step that is used for above-mentioned peak capacity distribution is carried out following those steps that are used for adding redundant link and stand-by channel.In another embodiment, be used for the step that above-mentioned peak capacity distributes, carry out and be used for adding redundant link, and before those steps, be used for adding following those steps of stand-by channel.

In another embodiment, carry out and to be used for step that peak capacity distributes and to have got rid of those and be used for selecting those steps of additional peak path, and before adding redundant link, carry out remaining step.This mode provides not rely on a set their operation being made the peaked traffic path of inverse multiplexing by adding timeslice to the script topological structure.As above pointed, the capacity of this method for providing stand-by channel may reduce graticule mesh, but it needing to have avoided graticule mesh to support inverse multiplexing.

II.8. the combination of cable link

A network may not only comprise cable but also comprise Radio Link.Under this situation, the specific example of method discussed herein is applicable to such method naturally.The situation of this network example comprises that wherein a pair of graticule mesh node is linked at together network by cable, for example is provided at the position of the useful increase of this position sight line number at two this nodes.Another situation appears at several users and is linked to the graticule mesh node by middle switching equipment by the cable link.In a kind of further example, in the example of Fig. 1, the feeder link 53 between the horizontal node 52 of MIP standard node 51 and MIP is cable links, and it is connected to trunk 3 from TNCP 4.At last, has the cable link from trunk 3 to one central communication amount switching centers.

Method described here can advantageously be applicable to the whole network that not only comprises cable but also comprise Radio Link, such as above example.Concrete benefit comprises uses method described here, and the resilient traffic path of all approach of central switching center is provided, thereby the elasticity that lost efficacy at all nodes and cable and Radio Link is provided in whole graticule mesh.

For this method is used for the cable link, can realize following additional program.At link is the situation of cable link, during the possible use of link, need not consider remaining free antenna in considering a path.Supporting this link but will check the time enough sheet to be equipped with at each node branch, is will be at the total capacity that transmits required traffic test cable link for it.When calculating " node is realized tabulation ", total capacity is used similarly.After the script topological structure has produced and before the interpolation redundant via, the cable link that all are not included in the script topological structure should be incorporated in the set of first diversity.

When using the technology realization feeder link identical with the graticule mesh Radio Link, they preferably can have a plurality of antennas as each but have only the link between a pair of node of a sight line to treat, and this sight line is each other.

Method described here can be used in the situation that its link all is the network of cable link, for example script and the redundant via set in order to calculate whole this network.

The interpolation of II.9.MIP

If must make one of node become a MIP at the graticule mesh duration of work, this may be because of the demand of the additional message capacity of another connection that need arrive core network, so preferably by the following node that owns (suitable) nodes selection will becoming MIP from network.Consider each node successively, and each node is found the minimum hop-count of all other nodes.A method of making was before described like this.Under the situation of the traffic demand of known each node and preferably a weighted sum wherein to the minimum hop-count of each this other node, multiply by the traffic demand at this node place.Now each node is calculated minimum hop-count sum; The node that becomes MIP preferably provide minimum and that node.

II.10. the network of network that is used for non-visit

Under situation more generally, it is not to be used for transmitting to core network from the user network of the traffic that method described here can be used for forming its main purpose.The example of this use is the formation of the general elasticity topological structure of a plurality of nodes of link, transmit the traffic so that be to and from certain combination of core network or these networks, the characteristic of these traffics is not necessarily known when network forms, and they may flow in whole network.Under the situation of knowing the traffic that is transmitted between two nodes, so required source and remittance capacity are labeled at this node.If do not know the level of the traffic that is transmitted in the network, then preferably can specify a same level to each node.

In order not have to form this network under the situation of core network, specifying one or more nodes is the grappling node, is that link node is carried out this method as them then.If a this grappling node is arranged then this method will produce a network that connects fully.If use a plurality of this grappling nodes,, will produce a network that fully interconnects so if then grappling node itself is interconnected.This can pass through any way, accomplishes before or after using this method.This can a set of sight line realizes between the grappling node by method described here is used for.

If a grappling node is arranged, preferably by following all nodes selections from network.Consider each node successively, and each node is found the minimum hop-count of all other nodes.A kind of method of such work has been described in the front.Any to minimum hop-count summation to other all this nodes.Under the situation of the traffic demand of known each node and preferably a weighted sum wherein to the minimum hop-count of each this other node, multiply by the traffic demand at this node place.Now each node is calculated minimum hop-count sum; The grappling node preferably provide minimum and that node.

II.11. conclusion

The above result of the exemplary formation method of Xiang Xishuominging, be indication or represent a kind of database or data structure of topological structure how this topological structure should be linked to the node that other should distribute to link if illustrating node for all nodes that can be connected to graticule mesh.In fact network operater can use this database or data structure then, and by generally described among above and/or our WO-A-98/27694, depend on the topological structure that this database or data structure are indicated or represent, by using the actual actual node of transmission link link, be put to physics realization.

III. " painted "

III.1. foreword

Aforesaid preferred formation method can be used in the graticule mesh of using various different radio transmission technologys.As mentioned above, execution comprises a class graticule mesh, and wherein the transmission on all Radio Links is carried out with the repetition time frame of discrete timeslice, for example the graticule mesh of operating with time division duplex (TDD) pattern.Various modes with tdd mode operation graticule mesh are arranged.In a kind of preferred mode of operation, each node can send to other node in each discrete timeslice, receive from other node, or inertia.Each discrete timeslice is used for purpose discussed below with a designated timeslice number.If numTimeSlots discrete time sheet arranged, then they are numbered from 1 to numTimeSlots.

This is preferably formed process and produces the graticule mesh that is applicable to this TDD operation, because this can guarantee each link assignment time enough sheet is transmitted the traffic that this link distributed, guaranteed simultaneously to distribute to timeslice number in the no more than tdd frame of timeslice sum of all links at any one node.

Operate in graticule mesh under the situation of tdd mode, after forming process and before the graticule mesh network design, preferably carry out an additional process, wherein each required on each Radio Link in graticule mesh timeslice is distributed a timeslice number.As above that simply discussed and from following obviously as can be known, this process can with famous mathematical problem analogy in the graph theory field, this problem is called coloring problem, so and here be called a graticule mesh " painted " or similar appellation: timeslices different in the time frame are associated in conceptive with different colors.Yet for a graticule mesh, the other target that some this process should realize does not occur in the coloring problem of their standards in graph theory.These targets relate to the practical ways of radio communication graticule mesh operation.

In this analogy, the coloring problem of standard only relates to link fixed time sheet, and the timeslice that makes each node to number is effective to Radio Link at the most.In other words, suppose any node all wish to avoid from other node receive or to its transmission occur in identical timeslice number (be any specific node at any time or just to other node send or just from its reception), each timeslice that is used to be to and from this node transmission in this embodiment must have different timeslice numbering or " color ".(this supposes that all transmissions and reception occur in identical carrier frequency).This process that is used for a graticule mesh preferably also should be considered following one or more additional factor.

As long as timeslice is used for transmission on any one link by a node, then may receive some interference to all other nodes that same timeslice is used to receive from this transmission node.If it is enough far away that the transmission node is positioned at another node, according to the time span of the distance between the node with described timeslice, this other node also may be received some interference at the later time sheet.The use of short transverse communication has reduced this effects of jamming in the graticule mesh, but coloring process preferably produces a timeslice distributes set, make the required signal strength signal intensity that receives at each time of reception sheet with the operation that allows each link, with a suitable surplus greater than total interference intensity of receiving in this timeslice.

In order to produce the set of operation with compatible graticule mesh link, coloring process preferably produces one should be with the power level set of its operation in each timeslice of each link.

Relevant with the Radio Link operating frequency, the influence of the weather condition that the decay on those links may changed.Under some communication pattern, such as the heavy rain cutting edge of a knife or a sword that moves, various signals or noise channel may be subjected to the influence of weather condition at one time in the graticule mesh in different approaches.Preferably produce link configuration set by the set of power level that coloring process produced, these configurations can consider that this weather condition operates consistently for high time scale.

Generally can specify a plurality of operation channel to the graticule mesh network; Node preferably can use any one such channel during each timeslice.Transmitter on link and the receiver on another link, when they are operated on the different channel, the interference level between them will be lowered; Coloring process is preferably adopted this fact in the multichannel graticule mesh, realize the painted of satisfaction so that can not realize in being operated in the graticule mesh of less channel under this painted situation.

When graticule mesh was equipped with a plurality of discrete antenna, because cost, these antenna may use single radio transmitters and single wireless receiver to be operated.In this case, in fact each required transmission from the purpose antenna may be accompanied by (lower power usually) transmission on all other antennas, each signal that receives on desirable antenna simultaneously may be accompanied by the additional interference effect from other antenna.The level that sends on other antenna and receive can be compared to most by a little less than the desirable antenna many.Coloring process preferably adapts to this additional interference, and is static position in regulation at all antennas not only preferably, and except any all antennas of required antenna or for moving or during in random direction, can both doing like this.This continues correctly to work during having guaranteed that graticule mesh contingent antenna during such as adaptive sequence moves.

III.2. exemplary colorize method

Consider that these additional factors are as follows to a painted method for optimizing of graticule mesh.This method based on

(1916) and the theorem of Vizing (1964), and based on the PD algorithm of these theorems.Gravity will be summarized the employed PD algorithm of this paper, will describe the preferred or optional additional step of considering that certain graticule mesh specific factor is added then.Purpose for these algorithms:

Each graticule mesh node is counted as the summit of a figure;

For seeing a limit as to each required timeslice of node N2 transmission from node N1.The direction that sends on the limit is important for the purpose of interference calculation;

The number on the limit of meeting at place, a summit is to be used for as the node place on this summit or the timeslice sum of transmission or reception;

Limit by specify a timeslice number to it by " painted ".

Under the situation of graticule mesh, preferred coloring process also comprises to limit specified channel and suitable power level.

If, then find the painted chance maximum of a kind of success (though this can not guarantee) at first to having the edge coloring of minimum available selection number.Thereby, the step that every execution is following:

C1) scan all summits to find out the summit that has maximum limit number;

C2) painted arbitrarily to these limits.Painted its each the available number of colours in terminal vertex place that makes of each of a limit has reduced one;

C3) for each limit, a variable dblMaxChoice is initially set to the number of colours that twice can be used, and is illustrated in the available number of colours sum in its each terminal vertex place;

C4), make dblMaxChoice reduce 1 for each shared example for each and the limit of the painted shared terminal vertex in limit just;

C5) select to have one of limit of minimum dblMaxChoice value, and this limit is placed on 1 place, position in the tabulation on the limit that will be colored;

C6) subtract 1 for dblMaxChoice with each other limit on this each shared on one side summit;

C7) repeat above two steps, the placement of next extreme higher position has one of limit of minimum dblMaxChoice in tabulation at every turn.Proceed to be sorted fully up to tabulation.

C8) specify next limit by with first look freely at two terminal vertex places;

C9), then remove the appointment (this is called as " recalling ") of previous color and also consider in this next freely color in two endvertex places, limit if do not have color freely at two ends;

C10) repeat two steps in front, up to or the process color that dated back to first limit that is colored and do not had to attempt, perhaps all limits are colored.

This program is competent explores that each is possible painted before abandoning, but generally will recall repeatedly rather than best, so paintedly spend the too much time possibly.This is because this program usually finds that at step C8 not having common color by place, two summits is freely.

In order to reduce the amount of recalling under this situation, can use following method, this method corresponding to by

The method of using his theorem to deliver.This method handled each end place on limit timeslice free but in the situation of the different timeslice in each summit.This method attempts to reassign existing timeslice distribution, becomes available up to common timeslice.Thereby, substitute when recalling during less than common color freely at the two ends on limit, can attempt at step C8

Method.If this failure, then algorithm can be recalled.

In rudimentary algorithm step described above, the disposable ordering to the limit that C7 carries out at step C1 is arranged.Another preferred implementation is rearrangement when a limit is colored.Not to resemble to safeguard a dblMaxChoice variable noted earlier, but determine availablely in each painted step, and make edge coloring then with minimum available color to how many color reality of each limit.This additional processing can be saved bigger treating capacity, this be by

Method reduces the amount of recalling or reassigning and avoids.Because need the interference effect of consideration during each color is reassigned,

The method of reassigning under the situation of graticule mesh not as effectively (it designs certainly) in the map colouring problem of standard for this reason.

III.3. adapt to the interference of graticule mesh inside

In order to obtain to adapt to and the interference constraints that occurs painted preferably uses two matrixes from the interference that takes place between the graticule mesh node.First is interference matrix inter[] [], wherein inter[i] annoyance level introduced to limit [j] with the painted situation of same channel bottom [i] on two limits of [j] indication.Notice that this matrix (generally) is not symmetrical: inter[i] [j] (generally) be not equal to inter[j] [i].In order to set up inter[] [], must at first carry out the method for each limit being selected signal level.

Preferably be selected as for the receiving end signal power of each limit, in the receiver minimum levels required signal decoding on the limit.This generally by what determine with reference to the power level of noise of receiving equipment, generally is called " noise floor ".Required signal power level will be the multiple of noise floor.This multiple is commonly referred to as " demodulation surplus ".It may be different on different limits, for example are applied to this limit as the wireless-modulated function.

This mode general action that received power level is set is to reduce to be sent out altogether in the graticule mesh energy as far as possible, and allows the length work of link with their maximum possible.Yet the dynamic range of transmitter may be restricted, and makes the minimum possible signal power of receiver on some short link, and is remaining greater than surpassing the required power of noise floor with demodulation.

All Radio Links are operation so preferably, makes the power level that each edge joint is received remain unchanged.When weather and the variation of other condition, this need regulate the power reduction that transmit on each limit, with the level of compensation power loss along link change.This preferably realizes by the feedback technique on each link, thus the receiving terminal of link indicate to transmitting terminal, transmitting terminal should increase or reduce how many its transmission power levels, so that the power level of handle reception returns to its required level.

For each limit, preferably select maximum transmitted power, make link can operate under certain maximum level of adverse weather and other condition.If the feedback indication from receiver need be than this maximum more power, then transmitted power is maintained at this maximum.For example, at 0.01% of may the be known certain average overtime of rainfall level of certain location; Needs are allowed the maximum transmit power of this link operation in this rainfall level, so that allow this link for all the other 99.99% time performance functions.Preferably increasing maximum transmit power has any power setting or measures franchise or error in receiver and transmitter two parts allowing in the wireless system, has guaranteed so in fact can reach for the percentile operation of this time.

A set of given received power level and modulation surplus, can constitute a matrix A llowed[j], with the admissible maximum interference level of the receiving terminal that is illustrated in a limit, this is by modulating remaining adding for the above-mentioned type franchise or the required any tolerance of error, the interference level under received signal power.

If determined maximum transmit power, then can set up Inter[i now to each limit] [j].Because in this preferred embodiment of graticule mesh, limit i and j are right corresponding to the oriented antenna of arranging along each limit, the interference from limit i to limit j generally will reduce away from the degree of noise channel by antenna alignment.Disturb also relevant with weather and other condition.

In a preferred embodiment, according to will producing the weather condition of maximum interference, but, calculate interference level based on the signal level that the weather condition that produces minimum received signal on the i of limit is calculated for limit j.This considers and has the weather sharp side, for example at the path of link through when raining heavyly, can proper operation, make the power of its transmission increase, but noise channel is without rain, thereby disturbs and can not reduced by rain.

In another preferred implementation, interference level is calculated bigger:

When signal and noise channel take place during all through an extreme weather condition; And

When all passing through another extreme weather condition, signal and noise channel take place.

This second way is based on such prerequisite, and promptly extremely different condition is rare between signal and the noise channel, and can be included in link and can not correctly bring into play in the time percentage of function.This mode may be partial to previous one because it take signal into account and disturb between the surplus that obviously reduces, thereby increased the traffic density that can use the transmission channel fixed allocation to support.

Under each antenna and situation that wireless receiver of opening in a minute and transmitter are associated, preferably only disturb with reference to calculating corresponding to the aerial position of dependence edge.As mentioned above, when a plurality of antennas and public wireless receiver and transmitter unit combination, in fact this may cause interference by all such associated antennas, and this is preferably in antenna less than being reduced under the situation of distributing to link in each node by the isolated surplus that realizes.In order to determine to consider the antenna interference effect that in the static state operation graticule mesh, makes up, determine the appearance that worst-case is disturbed by considering following all combinations:

One of any for disturbing at source node combined antenna; And

One of any for disturbing at receiver node combined antenna.

Preferably also make this situation adaptation antenna in this group not be assigned to any one limit and directed any direction.As mentioned above, this can prevent the interference effect that particularly causes during antenna moves, such as contingent during adaptive sequence.By considering for whole four kinds of combinations of disturbing in two kinds of situations of source node and receiver node place antenna, this situation is adapted to: two situations are that antenna is assigned to this limit, in its appointed direction, add another antenna in the group, directly point to another node but the isolated surplus of obedience.

Determine:

The interference level of being correlated with to each other limit from each limit; And

The interference that allows altogether to each limit;

This information can be used to revise the behavior of previous described coloring process.

When a kind of color is specified on a limit, under the situation that has a plurality of channels to use, each given combination comprises channel number so.Channel number generally will influence the interference with other limit.Algorithm preferably at first attempts to be distributed in the lowest channel number in all colours, and only considers other channel under following situation.

When a kind of color is specified on a limit [i], this color becomes will cause that to all the total interference in this color surpasses Allowed[j] limit [j] unavailable.Notice that to adapt to a kind of color different with two endvertexs on the limit for these, because if they are not subjected to the interference from [i], then this color still remains and can use other limit of [j] arbitrary end termination on the limit.

Thereby preferably algorithm has applied such condition, promptly between new painted limit and existing painted limit, except having the identical available timeslice at arbitrary terminal vertex place on one side, too much interference can not be arranged.If this has got rid of the timeslice on this limit that is useful on, only consider lowest channel, then can consider to use other channel, preferably the channel that can use of lowest number.

Notice that under the receiver situation in place close to each other of source of disturbing and interference, the transmission in a concrete timeslice generally will only cause interference in the timeslice in identical numbering.Yet under the bigger situation of separating, interference may additionally or alternately take place in the later time sheet.This preferably will consider to determine suffered interference.Thus, should recall, because the timeslice pattern repeats, timeslice number 1 is the timeslice of following timeslice number numTimeSlots.

Can make some to above program and change, these will will be discussed now.

III.4. restrained is painted

Current operating first graticule mesh and proposing to change to second graticule mesh, during for example as the adaptive step of graticule mesh, generally will have of limit to be integrated into two graticule mesh and all occur.Preferably can calculate one paintedly to second graticule mesh, make to be retained from first graticule mesh common color as much as possible.Here this is called as " restrained is painted ".

With second link definition is to be used for from the set of node N1 to the limit of node N2 transmission.Be used for a restrained painted preferable methods coloring process is divided into three parts.Part 1 is handled each half such link, and it needs similar number or more limit designated with comparing in first graticule mesh in second graticule mesh: for the painted of this half link from first graticule mesh is to be copied to second graticule mesh simply; Any additional limit required for these half links will be colored in part 3.Part 2 handle all other not only appear at first but also appear at half link in second graticule mesh.Because these are not handled in part 1, thus they in second graticule mesh than less edge coloring being arranged in first graticule mesh.For these half links, the complete colouring algorithm that operation is above, but the candidate who just is allowed to for each limit to be colored as those that once used in first graticule mesh painted.Part 3 is for the additional limit of half link processing that needs the additional side to be colored then.In part 3, the whole not operation of coloring process with being modified.Note, only recall and to take place in part 3, but may change in part 1 and part 2 appointed painted.

For restrained painted calculating the restriction of one time can be set alternatively preferably, for example time restriction can be to carry out the little multiple of painted used time of unconfinement on second graticule mesh.This can prevent to calculate under following situation and continuously carry out, promptly when significantly recalling generation, and because the change done during recalling, painted so ineffective for the second graticule mesh result is compared to the painted situation that more is similar to first graticule mesh of unconfinement.

III.5. chain

Support under the chain situation of timeslice that at the graticule mesh wireless device can strengthen coloring process needs to use the graticule mesh that reduces channel number to produce, and now this is discussed.

The general only time sheet duration is used for the transmission of the traffic less than 100% p%.All the other are for extra transmission keeps, and for example are used for the maintenance of Radio Link, and also are used for allowing " guard band ".Adopt a reason of guard band in the occasion of preferred graticule mesh, it is the flight time of considering the wireless signal that a timeslice, sends from node N1 to node N2, guarantee that this signal is received fully node N2 is needing beginning and another node is communicated by letter during the later time sheet before.

If C the in succession timeslice of numbering be this means that they use and have identical additional painted parameter, such as power level and channel number by chain on half identical link.Thereby send node can be continuously by C timeslice transmission, so just used preceding C-1 timeslice of 100% in chain to add the last timeslice of p%.This can reduce the required timeslice of the given traffic of transmission.This transfers to have reduced again the limit number required on some summit; In fact these normally most of restrained summits this means and can use less channel to carry out painted task potentially.

In one implementation, required total capacity should make this capacity still can be provided not using under the chain situation on all half links, and need not to be exceeded at the available limit number in place, arbitrary summit.In this case, the painted of chain success can help to increase spectral performance, but this is not for reaching a prerequisite of specified volume.

In order to utilize chain benefit, colouring algorithm is preferably known the total capacity that each half link is required, uses the capacity that obtains from timeslice 100%, and the value that also has p.Should be noted that the value of p generally depends on the physical length of half link.

Given above information just can be calculated the chain of all plaid matching network optimizationizations.On any half link, if total its at the desired volume that the use that replaces non-chain timeslice on half link will allow at least one timeslice to provide less than being used on half link, then the chain of C timeslice is exactly useful.For there being at least one useful half chain link, and for can being dropped by this chain use up to D timeslice, then best single chain be the shortest useful chain, length is D B timeslice that timeslice does not abandon of permission.If best chain can not be split as two or more uses altogether B timeslice and allowing abandon less chain of D timeslice, then best single chain be chain to this half link optimum.Otherwise for this half link optimum chain be this two or more less chain.There is this less chain one during, the optimum chain set that preferably has the maximum length of any less chain minimum with upper set.

It is optimum chain to suppose that in certain graticule mesh of a subclass to(for) half link exists, and colouring algorithm can be modified and with they combinations.All these chain coloring process that are preferably in begin, rather than having place, the summit beginning of maximum limit number, are colored fully.Optimum chainly preferably be colored by the descending of C.For chain painted, the piece in succession of C the timeslice that the colouring algorithm search can be used with the single value of power setting/channel number.Under each situation, if any such piece is all unavailable, then must be to total non-chain edge coloring.Attempt to chain painted after, at this moment the coloring process to all the other single limits carries out as previously mentioned.

Restrained painted and chain when all using, at this moment in restrained

colorize method part

1 and 2 discussed above, all from first graticule mesh do not have to change optimum chain, preferably conduct as previously discussed the part of restrained coloring process be replicated.Then by at first attempting to make remaining chain and all remaining single edge colorings then, part 3 beginnings of restrained colorize method discussed above.

III.6. with other wireless system coexistence

May have " foreign peoples " wireless system (not being the wireless system of this graticule mesh part) at least, comprise and be operated in identical or approaching with the one or more channels that use by this a graticule mesh transmitter and/or receiver, make one or more limits of graticule mesh, if be colored inadequately, be subjected to from or cause interference to this foreign peoples's wireless system.Given some information about this foreign peoples's wireless system characteristic is preferably added additional step to coloring process, makes that this interference of generation is impossible painted.

Provide the example of the interference of being to and from a graticule mesh now.

III.6.1. to the interference of a graticule mesh

Have a graticule mesh and be operated in same geographic area wireless system, employed channel is approaching in this graticule mesh use and this graticule mesh.For example this may be a cellular radio system.The general position that can obtain about base station in this cellular system, the use of frequency, the information of transmitted power and antenna shapes.This base station will be launched may cause the high power signals that one or more limits of graticule mesh are disturbed.

More in general, may or with the same geographic area of graticule mesh, near or away from this graticule mesh, there is a kind of foreign peoples to disturb transmitter, with one or more frequencies of using in the graticule mesh near or identical frequency send, make one or more limits in the graticule mesh may receive interference potentially from this foreign peoples's transmitter.May cause an example satellite radio transmitter of the teletransmitter of interference.The existence of this transmitter, and position as above and other characteristic may be notified to the operator of graticule mesh system, and be formed in the information that can use during the coloring process like this.

If can not obtain information, in any case or for safety, the graticule mesh wireless device at node place can be with specifying some time to distribute so that detect main interference level from foreign peoples's transmitter about foreign peoples's transmitter.Information from the measurement device level can be used during coloring process.For example, as described in other place here, can be interferometry retention time sheet.At current context, the timeslice of some this reservation can be distributed like this, makes that any graticule mesh device does not transmit during these timeslices.In these timeslices, arrange the graticule mesh measurement device because all interference that foreign peoples's device produces are carried out this measurement to one or more channels and one or more aerial position.

In some cases, may not know foreign peoples's transmitter position accurately, perhaps this position may change in time, and probable behavior produces a kind of paintedly like this, makes it possible to be tolerated in some geographic area from Anywhere up to the interference of certain interference power.For example, nearby the zone has its topological structure of a kind of wireless network to change in time, and its maximum transmit power is known.

Under all these situations, can calculate total interference from foreign peoples's transmitter for the limit of graticule mesh and each combination that can be used for the graticule mesh mid band.When interference was measured, its value can directly be included in total interference calculation.Under the situation of estimate disturbing from specific transmitter position or zone, can consider to receive aerial position, antenna shapes and the resistance of channel band of the graticule mesh device of this interference.

As the part (referring to above 11.3 joints) of above-mentioned preferred coloring process, suppose each limit in the graticule mesh has been selected to send signal power level.Be used in the preferred embodiment, determined the transmission signal level to each edge, also can determine the interference threshold level on each limit, this limit can not proper operation more than the threshold level at this.If limit/combinations of channels shows that interference from alien system is on this level.Then this limit/combinations of channels can be marked as and can not use.Otherwise the foreign peoples disturbs during coloring process may disturb combination with graticule mesh.

In general, foreign peoples's transmitter will can not use with graticule mesh in employed identical timeslice pattern.Under this situation, the interference that calculates preferably is counted as being applied to all timeslices of using as on the specific channel of certain edges thereof, rather than is applied to indivedual limit/timeslices/combination of frequency especially.

III.6.2. come the interference of self-conjugate graticule mesh

From the example of the interference of a graticule mesh, comprise the situation that is operated in the wireless system of the same geographic area of a graticule mesh, the channel that this graticule mesh is used is near employed channel in this graticule mesh.For example this may be a cellular radio system.Under this situation, generally will obtain position, the use of frequency, the information of interference susceptibility and antenna shapes about base station in this cellular system.One or more limits of graticule mesh may cause the interference to this base station potentially.

More in general, has a kind of foreign peoples's wireless receiver, it may with graticule mesh in same geographic area, near or away from this graticule mesh, with one or more frequencies of using in the graticule mesh near or identical frequency receive, make one or more limits in the graticule mesh may cause interference potentially to this foreign peoples's receiver.The existence of this transmitter, and position as above and other characteristic may be notified to the operator of graticule mesh system, and these become the information that can use during coloring process.An example of this receiver is the radio telescope that detects the frequency signal identical or approaching with employed frequency in the graticule mesh.

In some cases, can not know foreign peoples's receiver position accurately, or it may change in time, may wish to produce a kind of painted like this, in the geographic area of regulation, can not produce greater than certain interference level.For example, have the wireless network of a known features in the nigh zone, do not know the position of its each wireless system.

As mentioned above, as a part (referring to above joint 11.3), the transmission signal power level has been selected on each limit in the graticule mesh as the above preferred coloring process.Given sort signal level can be to the transmission on each channel that is used by graticule mesh, calculates the interference of the worst-case in position from each limit to each foreign peoples's receiver or zone.The direction with foreign peoples's receiver graticule mesh transmitter is relatively preferably considered in the interference calculation of this worst-case, and graticule mesh transmitter antenna profile.In the time can obtaining suitable information, preferably also consider the sensing and the antenna shapes thereof of foreign peoples's receiver.As the result of this process, whether each combination of limit and channel is labeled with indication available at this channel of this limit: have only the interference level of working as all foreign peoples's receivers to be lower than acceptable level, the specific combination of limit and channel just can be used.

In general, foreign peoples's receiver will not use with graticule mesh in employed identical timeslice pattern.Under this situation,, rather than more specifically be applied to the combination of each timeslice/frequency if the interference of calculating preferably is counted as being applied to all timeslices of using at the specific channel of certain edges thereof.

III.6.3. the explanation that the foreign peoples disturbs during color being selected

As the result who carries out above-mentioned steps, can carry out mark to indicate to each limit/combinations of channels:

If limit/combinations of channels is unacceptable, then about more and the consideration of the interference between the alien system;

If not so, then be because the interference level that foreign peoples's transmitter causes in limit/combinations of channels.

Preferred coloring process described above, when a color is specified in the use on opposite side, can be to consider considering these factors from the identical mode of the interference on other limit of graticule mesh.Thus, referring again to above joint II.3.

Suppose that unacceptable limit/combinations of channels number is the very little ratio that all makes up, and then adapts to the painted of this coexistence requirement so that can realize, and need not the change to the required channel number of operation graticule mesh.

With the analysis showed that of the common typical cellular system that disposes of typical graticule mesh, can be to being arranged in the base station of identical working region, the potential ratio of the graticule mesh transmitter of unacceptable interference level that provides is not more than 2.5%, and just to specific channel in those available channels of graticule mesh transmitter.This numeral does not also have consideration to be linked to the sensing on the graticule mesh limit of these graticule mesh transmitters.Suppose that preferred graticule mesh system adapts to the antenna of short transverse, then the graticule mesh transmitter is to the potential interference of base station, and with just for a particular subset in the sensing on possible limit, graticule mesh transmitter place: this has further reduced unacceptable limit/combinations of channels number.The ratio of the potential reception of possibility from the limit of base station interference that be applicable to similarly is discussed.

In fact, can be around honeycomb fashion base station regulation one " place of safety ", make that only the graticule mesh transmitter in the place of safety may (but not necessarily) cause the interference to base station, and any graticule mesh transmitter outside the place of safety will can not cause interference to base station (can accept under the level because the decay of the signal that is sent by the graticule mesh transmitter causes any interference to drop to).In a typical example, the place of safety that centers on base station can have radius and be approximately 60 to 200m.In considering the preferred coloring process that foreign peoples's receiver is disturbed, only need to consider that the transmission from the graticule mesh transmitter that is positioned at the place of safety gets final product.This can help to quicken accelerator, but is not internal to more conventional method discussed above.

Preferably use a following mutation,, avoid or reduce demand as far as possible near channel so that under the situation of the remarkable ratio of coexistence effect of constraint value limit/combinations of channels to coloring process.Channel is sorted by the descending to the number on its each unavailable limit of channel.When frequency will be assigned to any one limit, be considered as candidate's channel according to this order channel, be an acceptable channel (in the graticule mesh and for alien system both) up to finding based on interference level.The effect of the order of this consideration is to have used the channel with maximum foreign peoples's interference constraints at most, when the limit that has serious foreign peoples's interference constraints is adapted to, has provided optimal selection like this.

Should be noted that by graticule mesh network appropriate colouring, and need not any special coordination between graticule mesh operator and the foreign peoples's wireless system, just can avoid being to and from the interference of foreign peoples's wireless system.Generally the spectrum efficiency to the graticule mesh network does not also have appreciable effect.

III.7. other mutation

When a kind of color is found on a new limit, on one side and have when this is had the selection of a plurality of timeslices, the strategy of selecting between them comprises:

A) timeslice of the minimum use of preference (number on the limit by appointment so far), or

B) timeslices used at most of preference (number on the limit by appointment so far), or

C) select the minimal amount on the limit that will be colored is reduced the timeslice of option.

Notice that the selection of timeslice will not change other limit number that is subjected to interference effect, except under the situation of the limit that surpasses accumulation.Here only the scope of topology is carried out the selection of timeslice.For example, (c) target is to introduce as far as possible little new topological constraints.

Option (c) is sought the maximization of timeslice number, selects thus and can carry out potentially by coloring process.Option (a) purpose be as far as possible equably service time sheet so as to reduce since disturb be combined in the possibility that reaches the dead end position in all they.Option (b) uses as few as possible and operates based on staying some timeslice, and these can be with the interference constraints that solves the most restricted property then.But select the time spent when not free sheet, the selection operation of lowest number available channel uses because this stays the highest numbering channel as few as possible being similar on option (b) basis.

In some graticule mesh, have each other very close to the node of fixing a point.Example is at TNCP 4, and wherein a plurality of nodes possibility co are to reduce the access cost to backhaul network.Under this situation, relevant with the demodulation surplus with the eccentric rejection of antenna, following situation is unlikely:

Be used for to be used for the reception at another node place in the timeslice of the transmission of one of these nodes; And:

Identical timeslice and combinations of channels can be used at two this node places receiving.

Because these may be to the very strict restriction of coloring process, by above general fashion, preferably at first relate to them, so to avoid recalling of essence.Thereby in a kind of preferred implementation, as long as a limit of being to and from the link of such node is colored, just attempt to use identical timeslice number to each other near the edge coloring on node of location.

For convenience, all above technology are commonly referred to as " painted " at this specification remainder, although will understand, this term just uses as analogy, and this technology is represented not only as common define or be suitable in graph theory painted.

IV. the key element of networked devices standard

Be necessary in the described here one or more adaptation methods of the following character of networked devices or have superiority.

IV.1. Radio Link restains

Radio Link between two node N1 and the N2 uses one or more timeslices to be used for transmitting from N1 to N2, the timeslice that may use from N1 to N2 will be changed, or any their radio operation parameter will be changed, and the not operation of broken link is supposed using from N1 to N2 with all having a timeslice afterwards at least before changing.This operation is called as " link is restained " or similar appellation here.Generally, for not restaining under the broken link operation, N1 and N2 need the shared time cognition that will take place of restaining.

In a kind of realization of restaining, they should carry out the time that this is restained equipment one exterior part to two node indications.Below will be to this with more detailed description.In another was realized, two nodes were realized a kind of agreement of delivering a letter, and restained the time of generation by means of their agreements of this agreement.Between N1 and the N2 this agreement of delivering a letter may be deferred to and the following stated identical or similar design between the exterior part of equipment and node.

In any case, the effect of the preferred embodiment of restaining of link is unbroken link operation.(should be noted that and restain the network delay that may cause by the traffic experience of using this link change.For example, this may be due to the change to time slice sequence on the path, such as at link 11,12, the

distribution

1,3,5 of timeslice on 13, this comprises that contiguous path changes to timeslice and distributes 1,7,5, thereby the delay of using this path traffic is increased a frame period).

IV.2. route switches

Can make and be used between two nodes the communication path of the service of transmitting and be changed and do not destroy this service.

In preferred a realization, carry out change or conversion by means of two route switching entity, these two entities not only are positioned on the old path but also are positioned on the new path.Under the situation that service is carried out between two nodes in graticule mesh, preferably locating for these two entities is node place as service endpoints.Referring to Fig. 4, under the situation that service is carried out between node and an external network or the trunk 3 in graticule mesh (being the situation of service station), preferred location is at an entity as the node place of service endpoints, and another entity at 10 places, main dispatching centre that between TNCP (many) 4 and trunk 3, insert, this is that the traffic converges to that point on the TNCP (many).

Because between any a pair of path that their allow route to switch to occur in to be produced by the process that is preferably formed, so be optimum to these location of route switching entity.If for example the route switching entity just is positioned at any a pair of node place that is positioned on the current communication path that is just using, then route switch may to described node between the different path of this path carry out.For example, if the route switching entity is moved to TNCP 4 from the main dispatching centre, then this will forming process can with path be restricted to those paths by identical TNCP, thereby reduced based on the adaptive result who is preferably formed process.In addition, this will need to change forming process, be routed to another TNCP by trunk 3 with the path that allows to be routed by TNCP.

In preferred realization that route switches, the route switching entity allows a way set, and promptly primary path adds one or more stand-by channels, by the way set replacement of a new equidirectional.In one embodiment, all paths are disabled or enable the further designated primary path of the path that is activated, first stand-by channel, second stand-by channel etc. in any fixed time.For execution path switches, at first the new way set merging of configuration is designated as forbidding between two two route switching entity, route takes place then switch, and path is reassigned in this process, at this moment removes old way set at last.

Path is not to be switched at forbidding with between enabling: it can be in addition different enables way sort at two, is switched between second stand-by channel such as advocating peace.In addition, in a multistep was adaptive suddenly, route switched and can take place repeatedly.A path can be changed from enabling forbidding a stage, and got back in after a while stage and to enable.The all paths that are used for identical service be preferably in adaptive before, during and after during plan is adaptive, compare, and determine to be activated twice during with identical or different given step or path more frequently.Those during adaptive or any stage that finishes need, but the path that is not activated in initial graticule mesh was added to network before the route handover operation; Having only those to stay when adaptive end to disabled path is removed from network after the route handover operation.

According to the character of the service that is switched, can adopt various programs to carry out actual route handover operation, satisfy the preferred requirement of not break in service simultaneously.Any program is the acceptable character that will depend on service.

IV.3. " synchronized " or " simultaneously " graticule mesh changes

Can be at one time or the same basically time for two or more network equipments, their mode of operation is made change.In preferred a realization, these changes are included in the operation of restaining of any number in a plurality of nodes place, reach the route handover operation at any number at a plurality of route switching entity place.

Owing to can restain simultaneously all links at single node place, this is preferably realized preferably allowing link to be combined and can not be to go out terrain separately to restain, and for example the timeslice of using on single link is exchanged.By in graticule mesh part or whole this is exchanged, can carry out redistributing of timeslice at single step, this is original or can not carry out separately or need long sequence step.

Switch owing to generally can carry out a plurality of routes simultaneously, this preferably realizes allowing path to change with being combined, and this change can not take place separately when not break in service.For example each utilizes the distribution by other network capacity of abandoning.By in graticule mesh part or wholely apply this operation, can carry out redistributing of capacity in single step, this is original or can not maybe need long sequence of steps separately.

Because can restain and carry out one or more routes simultaneously switches one or more links, this preferably realizes allowing to be reallocated by restaining link capacity (can changing the timeslice number of distributing to each direction on the link owing to restain, suppose before restaining and afterwards at least one timeslice be assigned with), meanwhile the traffic is switched to as on the path that wins the result who transmits this traffic capacities by route.This allows in the one group change of a step realization to graticule mesh again, and these change maybe needing can not realize long sequence of steps originally individually.

IV.4. share time reference

If all node in the graticule mesh, and the external device (ED) of institute's these changes of utility command (appellation " graticule mesh change controller " or " MCC " here), at least in predetermined accuracy, share the cognition of time, then be convenient to carry out the execution that a plurality of networked devices device synchronizations change.For example, timeslice is restained the timeslice border realization that is preferably in joint provisions; Switch for route, accuracy preferably for the communication path of whole graticule mesh in minimum delay time.

In preferred a realization, each node is equipped with the time receiving system that can obtain timing signal from the time issuing service.An example of this service is global positioning system or GPS, and this system allows gps receiver not only can determine their position, and can determine the time.

In another was preferably realized, node was as master timer and send the message in propagation time to each node of its link.These nodes are propagated this time to each node of their links again.Each node is also pointed out in same or the message of separating, the link number that temporal information has been propagated since being sent by master timer.This allows each node to abandon from master timer but is not the message that arrives by the shortest available hop.Each node is propagated this time by all other links that leave this link then, and it has to the path of the short chain way of master timer by these links.(method along diffusing information from the single source shortest path is similar to the method that is used for setting up the distance vector routing table in rip routing protocol, this agreement with for example use the IP relevant) with IPX communication protocol data communication network.This has the minimum message of use and sends number and pass through to the effect of the minimal chain way of each node to all node issuing time information, it has duplicated message and has circulated in the loop, and be added to or when graticule mesh is removed when link, allow to be used for the new path that the time spreads news and selected automatically.This is not receive the link " overtime time-out " of propagation by it by allowing node to make through certain period, and selects between this other link again when overtime reaching still to receive by it that the link that spreads news realizes.

In the 3rd preferred the realization, each subclass of node is equipped with the time receiving system that can obtain timing signal from the time issuing service in the graticule mesh, and then these nodes each as master timer.Under this situation, the utilization of above distance vector method has guaranteed, is not the temporal information of each node propagation from receiving apart from the master timer of its minimal chain way of master timer.In this layout, just a subclass of node must be equipped with specific time receiving system, and the inefficacy of single master timer can not stop all other node time of reception message in the graticule mesh.(node can be reassigned itself no longer is master timer, and like this as the time become subordinate.When just its time receiving system lost efficacy, this allowed this node to continue operation).

IV.5. prestrain and triggering function

As mentioned above, be configured to adaptive can preferably the carrying out as one or more change steps that final graticule mesh disposes from initial graticule mesh, each step can comprise one or more operation and/or one or more route handover operations restained.A plurality of networked devices devices preferably can be carried out a plurality of this operations simultaneously.

As mentioned above, carrying out the used time of these steps generally will influence the network whole reliability.The marginal capacity of network during the specific step be lower than adaptive before and under afterwards the situation, specifically be exactly this situation.Thereby the time quantum that the node of trying one's best is carried out each step is useful.

Failure probability during each step generally also will influence the network whole reliability.Except above-mentioned failure type, preferably also to consider the inefficacy in adaptive control procedure itself.For example, preferably consider the effect that control messages is lost or destroyed between control system and the network equipment itself.Control messages preferably sends by graticule mesh link itself.Any message for sending by any communication channel all has certain probability destroyed or that lose.In general, certain type verification and being attached on the control messages that sends by communication channel can detect in the message zero or more wrong and be corrected by means of it, and can detect zero or how further mistake, but is not corrected.Do not proofread and correct if mistake is detected, then control messages generally is abandoned, and carries out as being lost identical program with this message by the channel communicating devices.

So it is useful generally using the step of peanut to carry out adaptive, reducing the used time of each step as far as possible, and the probability that each step is successfully ordered reaches maximum.Even during less sequence the marginal capacity of network reduce many, if for example the time of every step little, step probability of successful height, then forms by a spot of step of a sequence one adaptive may be usually than another have a greater number step adaptive better.

The order that changes step is preferably carried out by prestrain and triggering sequence, below will describe a such example in detail.Prestrain and triggering sequence are designed to reduce the used time of each step as far as possible, the probability maximum that each step is successfully ordered, and provide a kind of reliable method so that make a plurality of change synchronizations in a plurality of nodes place.

In a word, in a preferred embodiment, comprise that the change step of a complete adaptive sequence is split up into one or more groups by MCC, make requirement all changes in a group take place simultaneously, and each organizes designated one " triggering number ".MCC is organizing all relevant information about each, comprises and each changes relevant touching, and a device number sends to each node that will participate in any synchronous change during adaptive.In case all information has sent to relevant node, at this moment MCC sends to trigger to carry out by all nodes that relate in this triggering and asks, and causes each change step: triggering the request of execution is to instruct the institute relevant with triggering of execution at the appointed time to change.After for the triggering official hour, whether each node that the MCC poll is related successfully takes place to determine to change.If like this, then it can be new next triggering of stipulated time order.In case MCC prepares that this is triggered number and sends the request of execution that triggers, and then selects the triggered time by MCC.This allows MCC can determine that by it the success of each previous step is like that apace by changing sequence.

For the execution that the graticule mesh of supporting to be triggered changes, node preferably can be stored about following route handover operation and following information of restaining operation.

Under the situation that route switches, this process is preferably carried out with four divided portion.At first, support this route to switch to change required information, be installed to the junction associated that has the path that is designated as forbidding about any new path.Information about required route handover operation is sent to route switching item then, is marked with relevant triggering number (many).Trigger the request of execution then and be sent to route switching item by MCC.At last, in final graticule mesh unwanted and thereby be designated as the path of forbidding at this point, remove from relevant node.Should be noted that the interpolation of path and remove and do not need synchronization; Just route handover operation itself need and trigger sequence and carry out by prestrain.If an adaptive change sequence is included in the route handover operation at more than one triggering number place, then be preferably in about required route handover operation information and be pre-loaded to before route switches, loading will redesignated as all new paths of enabling at any triggering number.

In general, restain but also comprise that route switches adaptive will not only comprising, so so four steps become:

1. all new required paths are installed;

2. all routes of prestrain switch and painted information;

3. command triggers;

4. in final graticule mesh, cancel all unwanted paths.

These stages are any change that relates to the graticule mesh mode of operation phase III.In this stage, must be in MCC and the amount of information that exchanges between the stage near minimizing, because this is made up of these requests of triggering.(time that is used for each triggering may be in second stage prestrain, to reduce the content of these requests of triggering.Yet it is involved as stage of separating, and carries out according to carrying out with variable speed from the feedback of node state so that allow to trigger, thereby wholely carries out with maximum rate).

After breaking away from the phase III, during the graticule mesh stable operation message takes place; If guaranteed the reliable transmission of all related datas, then the speed of exchange and exchange agreement is unessential for adaptive success.During the phase III, trigger the mode of carrying out the request mechanism operation and be directly connected to adaptive success.

Trigger the execution request mechanism and preferably use short request message operation.Since the ruined probability of symbol that these message have each information that is sent out of qualification by the communication channel of its transmission, thereby message is short more, and then ruined probability is low more.When the transmission medium support had fixing minimum length (such as the Radio Link that has based on the unit framing), message was preferably minimum length.The aforesaid verification of form best incorporated of message and.

Trigger the execution requestor and preferably include following type of message:

trigger_activate(trigger?number，activate?time)

trigger?activate_acknowledge(trigger?number，accepted？)

trigger_abandon(trigger?number，activate?time)

trigger_abandon_acknowledge(trigger?number)

And preferably also have

trigger_rollback(trigger?number，activate?time)

trigger_rollback_acknowledge(trigger?number，accepted？)

roundtrip_measure(sending?time)

roundtrip_measure_acknowledge(sending?time，respondingtime)

Those message with the title that finishes with affirmation send to MCC from node, and other message sends to node from MCC.

The node of end X is always answered with message X_acknowledge.In addition:

For trigger_active, node is write down number and time and is provided with and triggers to hanging up.It answers accepted=YES when each prevents that it from carrying out the problem that triggers; Otherwise it answers accepted=NO.

For trigger_abandon, to hang up if trigger, it is labeled as it no longer and hangs up.

When reaching the time of hanging up triggering, node is carried out all and is triggered relevant action.

Have multiple in the possible method of operation of MCC.Following method is preferably used in common use.It need know the time of current distance MCC node round trip farthest.MCC preferably knows the tabulation of the node that each triggering must be applied to, and only sends message to these nodes.

Network topology structure known to providing just can be by quickening to determine round trip cycle.In addition, can use roundtrip_measure and roundtrip_measure_acknowledge message to measure, thereby MCC sends one or more roundtrip_measur message to one or more nodes, and each node is at every turn with the roundtrip_measure_acknowledge message response.MCC can be relatively in message (and in affirmation, returning) transmitting time of mark and the time of confirmation of receipt, determining round trip cycle.If MCC does not also know this time, the response time in the affirmation can also be used for time among the MCC common time known to being set in the node.

Suppose that MCC knows round trip cycle and current time known to all nodes, preferably carries out a following sequence.After having selected to be at least the current time after the activationary time of five times round trip cycle:

Before activationary time during 5 round trip cycles:

MCC sends trigger_activate to all nodes;

Before just activating from this moment up to 4 round trip cycles:

MCC writes down all affirmations that it is received;

4 round trip cycles before activationary time:

If any trigger_activate_acknowledge that receives has accepted=NO

Any fault has appearred in the notified network of OR MCC

THEN MCC sends trigger_abanon to all nodes;

ELSE MCC sends trigger_activate to all from its node of also not receiving trigger_activate_acknowledge

Before activationary time from this moment up to 3 round trip cycles:

MCC continues to write down all affirmations that it is received;

3 round trip cycle places before activationary time:

IF trigger_abanon is sent out

THEN MCC sends trigger_abanon to all devices of also not receiving abanon_acknowledge from it

Any trigger_activate_acknowledge that receives of ELSEIF has accepted=NO

OR trigger_activate_acknowledge at least also is not received from the node of p%

Any fault has appearred in the notified network of OR MCC

THEN MCC sends trigger_abanon to all nodes;

Before activationary time from this moment up to 2 round trip cycles:

MCC continues to write down all affirmations that it is received;

2 round trip cycle places before activationary time:

IF trigger_abanon is sent out

Any trigger_activate_acknowledge that receives of ELSEIF has accepted=NO

OR trigger_activate_acknowledge also is not received from all nodes

Any fault has appearred in the notified network of OR MCC

THEN MCC sends trigger_abanon to all nodes;

ELSE MCC sends trigger_activate to all nodes of also not receiving trigger_activate_acknowledge from it

Before activationary time from this moment up to 1 round trip cycle:

MCC continues to write down all affirmations that it is received;

1 round trip cycle place before activationary time:

IF trigger_abanon is sent out

At the activationary time place:

IF trigger_abanon also is not sent out, and the change that is triggered should take place at all nodes.

Above program purpose is in order to realize such result, promptly or all nodes carry out the change that is triggered, perhaps they are not carried out.Abandoned if trigger, for example because node is answered the inefficacy of the request of activation, then whole process can be tried again again.

In order to make this process more or less can realize above result, the length in stage and number can change between the change to the graticule mesh configuration in the above sequence.At this point, more unessential change can be triggered rapidly, and more important change triggering is slower.

At following each several part, use the interferometry that is triggered with discussing.Starting this measurement failure can not cause destroying; If their failures can be attempted another startup,, be that the part success may cause network not operate if restain operation as long as they are than shading operations is so unimportant again.

The synchronization character of triggered protocol is useful for the assembly that graticule mesh changes, and this comprises and must simultaneously restain and/or the type handover operation.It is also applicable to any widely step more for a change, and comprising will be with the step of quite a lot of time.For example, a step in adaptive when reaching new position, may need to reorientate the antenna of mechanical handling after Radio Link starts.This action can be assigned to one and trigger number, and with other data prestrain more for a change.When relevant triggering was activated, antenna began to move, and will start at the end of its stroke Radio Link.

Triggered protocol preferably is used for initialization, during the adaptive sequence except the interpolation of path and removing, the institute of generation changes.This has guaranteed during the whole change step, needs minimum information to change and the time of implementation.MCC can poll determining when each step is finished, redirect such as antenna this they can change under the situation of operation of time quantum, which is useful especially ability.

Running through graticule mesh change to use the change that is triggered this is convenient to recover the contingent problem during changing sequence.If step in the process forward can not be carried out for a certain reason, then can return backward and change to the starting position, and need not to transmit about any new information of the change sequence that is modified.

This is the purpose of the trigger_rollback message mentioned in above preferred embodiment, if i.e. generation problem during sequence, the sequence that then allows graticule mesh to change step is reversed.Trigger_rollback and affirmation thereof can be used for replacing above sequence trigger_activate at the MCC place in above sequence.At these node places, if receive trigger_rollback message, the triggering number action of regulation oppositely become hang-up; If then do not abandoned deletion, will be taken place oppositely at official hour.

The rollback function provide permission for a certain reason in the adaptation step sequence, can not start such as link failure, or detect potential interference problem midway, and the escape program can not finish the time in sequence.Be similar to the forward direction trigger mechanism, rollback does not need to send any data to node except rollback request itself, thereby the program fast that is used to handle problems is provided.Since used in the sequence all graticule mesh change steps pre-configured node thereby they can rollback and activate any change step of being ordered.

Some network characteristic such as marginal capacity in changing, graticule mesh has an important benefit from what mistake was recovered fast and with the minimal data exchange, because may temporarily disappear during graticule mesh changes.This comprises the situation of the mistake of link failure form, and they influence the transmission of control messages especially.Like this, control messages transmits repeatedly to the node that does not have rapid acknowledge message, is that graticule mesh changes a pith that triggers sequence.

IV.6., internuncial providing is provided

In order to operate graticule mesh, between each graticule mesh node and one or more management system, connectivity is arranged usually.In general, needing this connectivity, is for can be from one or more control centres monitoring network state.Generally, this connectivity also is used for disposing and reconfiguring node.In adaptive occasion, this switching performance is enough to send adaptive instruction from graticule mesh change controller to node, and monitors the success of each adaptive change step.

Wish that very this connectivity realizes wirelessly.Preferably realize by constituting the identical link of graticule mesh.It is flexible to wish that very the management connectivity resembles the communicating to connect property of graticule mesh at least.If although all fixed access relevant with special services, destroyed owing to the result of one or more faults, it may be acceptable that communicating to connect property is interrupted, but wish that very managing connectivity can use any possible path from control centre to any node: for example, suppose to have the management connectivity, this can be used for recovering non-management or telex network connectivity.

When carrying out a series of adaptation step, the management connectivity of maximum possible is important.This allows, and the fault of mode is detected during adaptive, and causes at junction associated generation corrective action.Yet, be the period of a difficulty duration of adaptive, wherein because occurent change to network topology structure will guarantee continuous management connectivity.

Preferably by to each node in the network, or the arrangement of those nodes that are connected with a plurality of other nodes at least, make them play effect as supervisory communications amount router.Be similar at the router of this occasion and typically be used for the composition data communication network, such as the type of device that constitutes the internet.In the function of each connection point manager (CP manager) router, have to the link of the router feature of each other node correspondence, it has wireless or other link every now and then to these nodes.

Each router is preferably operated by means of " shortest path is preferential " or " Link State " Routing Protocol.This agreement has good description in the literature.A kind of example of noting of graticule mesh management router function and the preferred basis of realizing are the OSPF standards that is produced as RFC2328 by the internet engineering task group.

In link-state protocol, each router by means of network itself to each other router broadcast about it to the information that other router connects, these had not only been pointed out that router existed but also had pointed out which link that is attached to it can operate to be called " link state advertisement ".In this way, each router obtains a database of the new situation of whole topology of networks and the change of any Link State.When finding a link failure or being resumed operation, each router is notified by broadcast mechanism.The existing database possessed based on the new information of each bar of obtaining and it of each router recomputates its routing table then.Routing table is tabulation of the best route from this router R to all other points of network, and form is " link L is the next hop to the best route of a P ", and wherein this router R appends to link L.Because all routers are possessed identical network topology database and use identical rule to calculate their local routing table, these routing tables have effect of Combination, and feasible message from R to P will be got shortest path and be passed network arrival target.

Link-state protocol and other route need comparison, need each router to keep a big database.Yet the benefit that need compare with other route is that in a single day each routing table receives that the information that changes about topological structure can recomputate its routing table immediately.This has produced the quick convergence of network when topological structure changes that is routed.

In some cases, the number of links on the path between R and the P may not be that optimal path is well-determined.For example, link can have very different message capacities, makes a path that passes through three high power capacity links preferably arrive by two paths than low capacity links.By specifying one " cost " can make this Routing Protocol with respect to this point to each link, make a path uplink cost and low more, it is desirable, rather than only considers the link number in the path.Can one-tenth this notice of each link to or be configured in the router that is directly connected to described link; Can in link state advertisement broadcasting, be notified to other router to cost.By this method, each routing table in the network has realized considering a consistency set with the routing table of each link relevant cost.

The speed that changes in the validity of link-state protocol and the network is relevant: although convergence fast, but the cycle of material alterations may cause temporary transient suboptimization operation, for example wherein the routing table at every bit place is inconsistent, and pair of straight connects routing table in succession may each be thought, is to arrive other link as next hop by a link to the best route of P.

May be removed immediately or be started carrying out when adaptive many links, as guaranteeing that some specific modification can be attached in the routing function in continuous with the consistent internuncial a kind of method of adaptive occasion.

First is preferably revised, and when generating link, it is added in the routing database with very high appointment cost.(the very high meaning is meant enough height, if so that only the path by low-cost link be available then it is used never).This can be undertaken by only reconfiguring router at each end of link, or another way is cost to be changed be notified to all-router simultaneously.

Second preferred modification is to reassign the cost of link.Before the one or more links of deletion, the link that be cancelled is reassigned a very high cost.And, with expensive generation and now stable link can be changed and be low cost.And, only need by the reconfiguring of each end router of link, or other mode is the change of cost to be notified to all-router simultaneously can carry out reassigning of these costs.

The 3rd preferred the modification is to be set to " split table pattern " by each router.Under this pattern, for the situation of the certain change of network topology structure, router recomputates its routing table, but keeps this result and the routing table that is used to transmit data to separate.The routing table that continues on for transmitting data is the routing table that was before the split table pattern enters.When this operator scheme of cancellation, the routing table that recomputates at last begins to be used to transmit data.Above-mentioned to the certain change of network topology structure preferably designated be higher than inefficacy or the recovery or the generation of link of the cost of certain threshold value, add reassigning of link cost.Change if any other network takes place, the routing table that then recomputates is dropped into the operation of transmitting data immediately.

The combination of these mechanism can be used for guaranteeing adaptive during best possible management connectivity.Preferred operations without any change beyond expectation during adaptive is as follows.

When a step related to the removal link, at this moment before removing, router all entered the split table pattern.Removed link all designated one is expensive, recomputating routing table after the required time, withdraws from the split table pattern.Because graticule mesh must keep abundant connection after link is deleted, thereby new routing table will not use any deleted link of wanting, because will always there be the path of lower cost to use.When link is removed, at this moment since they any one in any routing table, do not use, so, will can not cause any change of lymph liquid, make that network will keep stablizing subsequently from the recomputating of the link state advertisement of the removal of notifying them.

When a step relates to when generating link, these links can be used as and have expensive new link and be generated.Notify the link state advertisement of their generation will can not cause any change of routing table, make that network will keep stable when generating by advertisement.In case link all operates, router all enters the split table pattern.The all designated low cost of new link recomputating routing table after the required time, withdraws from the split table pattern then.

By means of above program, the management connectivity all keeps stable during whole fault-free is adaptive.In addition, all possible node under the inefficacy situation is kept connectivity.Should be noted that and have expensive path just with respect to the less preference of path cheaply.Become at expensive path under the situation of unique possible selection, at this moment routing table will be recomputated, and this path will be used for realizing the management connectivity.Above regulation split table pattern stops new routing table and only is used for the certain situation of topological structure change, this means the inefficacy of low-cost link during this pattern, will can not hinder connectivity to be held by expensive route.

Significantly, to the change of operator scheme or link cost, the deletion of link and the generation of link can both be carried out by trigger mechanism.Like this, as all change during adaptive preferred, change then step carry out before they can be by prestrain, and transmit with minimum data during adaptive then and be performed.

Should be noted that the RFC2328 regulation, change at topological structure and notify under the situation of a router that this router stops forwarding data, till it has recomputated its routing table, in order to avoid the route unstability.In another preferred realization to graticule mesh, if topological structure changes the change relate to just the mode of operation of expensive link, then this rule is inapplicable.

Under adaptive situation, this has guaranteed that communication stream can be by the change that do not cause the topological structure that routing table changes is interrupted.

This can also be used for guaranteeing installation, the maintenance of new node or remove and can not destroy other local irrelevant communication stream in the graticule mesh.In such operating period, can optimum ground become operation and then non-operating state repeatedly to the link of this node.This link is can designated one expensive during this process.At this moment the phase is not preferably adopted the split table pattern.Thereby routing table will be recomputated and be adopted, and make that each router will be to affected node by Link State indication interpolation/deletion one route.Yet, during recomputating, will not have the time-out of communication stream, thereby all other routes are unaffected.

IV.7. other relevant nature of the graticule mesh network equipment

In general, in the time of will setting up the document link between current two nodes that do not have a link operation, then this link establishment process would rather be with the suitable time, and its success may not guarantee.If start the used time of new link, surpass path and can be interrupted and not believe and the ruined time of service that to make then do not allow to make the traffic to turn to this link to begin any change of graticule mesh of the startup of link simultaneously.In other words, link startup and traffic route switch to this link and can not take place as step simultaneously in this case., because also may wishing the operation of the new link that starts, adaptive destruction can before the traffic is maintained into this link, be checked for fear of service.Preferable methods described here allows to adapt to these two kinds of situations.

V. adaptive

In general, adaptation method described here, can by to the past or the suitable modification of process that is used for forming the graticule mesh network now realize.Remember that in general, always need certain forming process to form graticule mesh, and this forming process is possible or may not resemble the forming process of describing in this specification, general adaptation method described herein may or may not use formation method described here.

Yet although above generality, adaptation method described here preferably uses formation method generally above and that describe in detail here.This is by because be preferably formed the graticule mesh that method produces by this, as described here basically, has SOME PROPERTIES, these character have increased specific adaptation method success rate, make some otherwise original infeasible adaptation method becomes possibility, and reduced the complexity of others.

Specifically, all graticule mesh that produced by the method that is preferably formed can not the script topological structure.As discussed above, this is a kind of nonredundant topological structure, and its capacity satisfies all traffics of all services of being supported by this graticule mesh promises to undertake, and does not wherein need the use of at least one antenna at each node.(, should remember, feeder link is preferably treated as a pair of node for this reason, and each has a plurality of antennas, but has only a sight line, and II.7 discusses as joint).For each service, the script that is used for this service is originally along topological structure operation originally.

And then, as mentioned, in being preferably formed method, can retrain graticule mesh and comprise " leaf " of the node of regulation as graticule mesh, promptly force this node to have only unique connection to the script topological structure.This allows the graticule mesh remainder can both bring into play function when being with or without these nodes, makes the leaf position for example be applicable to and is mounted, and is removed or insecure node.This then allow the operator scheme of a kind of can be described as " adaptive install then ", wherein graticule mesh is planned to all new nodes wherein all are leaves, and can relate to the adaptive of current graticule mesh.This can be decomposed into and at first be one and relate to the adaptive of existing node, is the one or more installations that do not need any change of current graticule mesh then.Because a variety of causes, this separation is important.At first, may wish to carry out such as the time at night between the operating period adaptive, may wish simultaneously minimumly and when client's access site is arranged,, install such as straight time when personal expenditures at low network.The adaptive operation that allows each type that separates with installation is arranged in its optimal time.The change that also allows graticule mesh influence is once any, by personnel's step and obey on-the-spot unpredictable factor, is restricted to or adaptive (preferably automatically performed and monitor) or action is installed.This separation is preferably in order to reduce undesirable interaction as far as possible, and in order to monitor, understand and guarantee the operation of network correct.

Should be noted that when each all is defined as leaf at a plurality of nodes that the script that deducibility goes out for a this node can not launch by another this node originally.Need add node or from its change of removing node, this provides important operational benefit to graticule mesh for graticule mesh is made, suitably these installations can be carried out with any order.After calculating the graticule mesh change, this allows such as geographic factor and other factors such as best routes between the operation field, such as the period that can obtain site access, is used as the basis that task is installed in layout.For example this allows to adapt to the variation of website availability term of execution of operation.

Each node is become in another optimal way of leaf, and forming process can be modified, so that replace this agreement by another agreement of the definition of trooping with node.It can be the node set that is positioned at a common site that node is trooped.For example, have two wireless nodes at a website, client visits node and is connected to their switching device shifter node, all connects by cable.Under this situation, their installation may wish it is an independent operation, with previous based on the compatible thing of the restriction of leaf.In one approach, install to form can be with any operation in sequence in order to guarantee trooping new node, and all nodes are marked by the identifier of trooping, and each node in trooping to be installed also is labeled.Then, being preferably formed in the method for discussing in joint 11.4 comprises following additional step between the step F 7 and F8.More than and " generate originally topological structure " shown in figure 2: abandon all such paths, promptly when considering in the direction that the node of being considered begins, the one or more borders between trooping by two nodes also run into a node of also not installing then.

Under some situation, it may be unessential that installation exercise can be undertaken by any order, but still need " adaptively install then " character.Under this situation, the adaptive probability of little number of steps appears having in the releiving to increase of erection sequence independence, and this may be desirable.In order to produce the graticule mesh that meets this pattern, change the step between above-mentioned steps F7 and the F8, so that abandon all such paths, promptly when the direction that begins at the node place that is considered is considered, they run into a current node that is mounted, pass two nodes between trooping with last or a plurality of borders, and run into a node to be installed then.

With above similar consideration and procedural application in the situation of removing.

V.1. the use that non-cutting time, sheet distributed

When the graticule mesh wireless system was made of discrete timeslice, above-mentioned preferred coloring process can be used for producing the rock-steady structure of the Radio Link of compatible operation.Some functions are arranged, if be attached in the graticule mesh node, to improve the probability of adaptive successful execution, but they require node to transmit on the timeslice that is different from those painted occupied timeslices of using in current graticule mesh, and do not influence the stability of the link of operating in the current painted configuration.

Whether for example, the purpose of transmission can be the distribution of the color calculated of test, in fact can operate consistently, and this should carry out by this way, makes test will not influence the stability of current graticule mesh.

These functions can be carried out by " sheet non-cutting time " being distributed some time.These are the time distribution outside regular timeslice is distributed.Provide non-cutting time sheet a kind of method be " predation ": every now and then, the period of special time sheet is distributed in predation, and changes into and be used to provide alternative timeslice.Another timeslice will be added distribution when assisting.For example, if the timing architecture of wireless system is divided into the standard frame of triggering, each standard frame comprises the appearance of each regular timeslice, after n this standard frame, adds an ancillary frame before next standard frame.Under above two kinds of situations, non-cutting time, sheet can be taken place than the frequency of regular timeslice with much less by layout, made that the reduction of their plaid matching Netcom letter capacity is a little surplus.These two kinds of mechanism can both be used for producing sheet non-cutting time.Under two kinds of situations, preferably non-cutting time, sheet was always as continuous group of generation of timeslice.If non-cutting time, sheet was used to form signal measurement, then measured signal is preferably in the middle transmission of sheet group non-cutting time, and making has " guard " sheet non-cutting time before it and afterwards.Guard's timeslice is preferably arranged, and is because such fact: as mentioned above, a transmission node can produce interference at another node place outside the timeslice that is used to transmit, and is enough far away if these nodes are positioned at each other.Thereby,

If signal will be embedded into and measure in the sheet in non-cutting time, then previous regular timeslice and the guard's timeslice between the Measuring Time sheet have guaranteed can not add mistake to measuring process from the signal of normal lattice net operation;

If signal will be embedded into and measure in the sheet in non-cutting time, then the guard's timeslice between launch time sheet and the next regular timeslice has guaranteed that the signal that is launched can not disturb the normal lattice net operation.

Non-cutting time, sheet had some application aspect the increase adaptation procedure success rate.It at first is the special Radio Link that they can be used for setting up a pair of timeslice in the use group.If employed two timeslices are surrounded by guard's timeslice, then can set up this link, and not have the interference problem between special Radio Link and the operation graticule mesh.

This special Radio Link can be before adaptive, is used for checking each sight line of intending being used for adaptation step feasible for being used as Radio Link.Be preferably in and calculate before the adaptive sequence generation, all be verified as the sight line that the candidate comprised.This can be performed as background task on the long duration, and sight line is tested periodically repeatedly, with verification since the growth that changes any new effect extremely etc.This is crossed range request and obtains the antenna of " leaving unused " and it is pointed to along the sight line that is verified at each end of link.Should be noted that the advantage that this has utilized the preferred implementation of formation method discussed above, wherein form the traffic on the antenna arrangement transmission script topological structure of unwanted each node.

This special Radio Link can also be used for checking it to operate consistently with existing graticule mesh during new node is installed.As the part that new graticule mesh is preferably calculated, arrive the link of new node, as the part of coloring process, with designated regular timeslice.At first, only use sheet non-cutting time that utilizes guard's timeslice to isolate, start a Radio Link to an existing node from new node.Now can determine whether the transfer of the regular timeslice of its appointment of chain road direction that this is new can disturb their current operations to nodes all in the graticule mesh.In order to realize this point, suppose direction of new link is specified regular timeslice T1, but currently operate on the sheet A1 in non-cutting time.Measure the current interference power that on A1, receives at the node N1 that receives on the T1.If N1 is to be its required demodulation surplus at least at this power that receives on the T1 greater than the power on the A1, then new link will can not cause interference problem.Otherwise T1 one is not suitable for the timeslice of new link.This link to new node also may disturb the timeslice after the T1.This can also test in the guard's timeslice after A1.For example, may on timeslice T1+1, measure the current interference power of on A1+1, receiving by affected node N2.If N2 is to be its required demodulation surplus at least at this power of receiving on the T1+1 greater than the power of receiving on A1+1, then this new link will can not cause interference problem.Otherwise T1 one is not suitable for the timeslice of new link.

Can also during adaptation step itself, use sheet non-cutting time.For example, when the change to new link and painted arrangement will take place, non-cutting time, sheet can be used for checking this new to be arranged on the whole graticule mesh compatiblely, still operated previous link and painted arrangement simultaneously.Can test the arrangement that makes new advances successively to each regular timeslice.Supposing has t1 transmitter on the timeslice T1 in new arrangement, and a this transmitter X will send to receiver R on link L.In order to check link L with proper operation, at this moment at first all t1 transmitter sent on the sheet A1 in non-cutting time.R measures the power of receiving in A1.All t1 transmitter sends except X then, and R measures the power among the A1 once more.If second power reading is at least its required demodulation surplus less than first, then link L will proper operation in new arrangement.

In order to form above arrangement, all will use transmitter and the receiver of T1, and an antenna is placed in the position that must will be used for T1 in new painted arrangement.In some adaptive sequence, all antennas can be arranged like this, make their satisfy needs to all regular timeslices simultaneously.Under other situation, this is impossible.Yet, suppose that each node of current graticule mesh has the antenna of " leaving unused " at least, promptly not as originally a topological structure part is needed in preferred embodiment as discussed above, should idle antenna can be moved to the position that is used for timeslice T2 etc.Should be understood that, allow all regular timeslices are measured and be need not the adaptive sequence of portable antenna during measuring, is useful with regard to execution speed.

Preferably following to timeslice T1 all measurements carry out in independent syncul sequence kind.Measurement can be carried out in timeslice A1 (t1+1) c occurs in succession, and wherein c is the timeslice number that receiver must be measured the power of receiving betwixt, so that make the result that acceptable accuracy be arranged.Before measuring sequence, to each notice c of t1 transmitter and the value of t1, and to unique number in its specified scope 2 to t1+1.To provide identical information from the receiver that one of t1 transmitter receives to each.Will be to all these receivers and transmitter notice measurement sequence in the specific appearance of its A1 that begins; This can carry out by means of the method such as above-mentioned triggered protocol.After this when first c A1 occurs, power levels that all transmitters send and all receiver measurements are received.Next transmitter (because each given unique number of transmitter) then, transmitter occurs stopping to send to c of all A1.After c of A1 occurred, the transmitter that has stopped recovering to send, and utilizes transmitter to stop, and conduct is only like this up to all t1 transmitter.This sending mode is shown among Fig. 5 briefly.When a transmitter stopped to send, corresponding receiver carried out power measurement.At the end of sequence, each receiver has two power measurements: one is to add all interference for its transmitter, and another is for interference.If second power reading is its required demodulation surplus at least less than first, then this link will proper operation in new arrangement.This method is called the interferometry of total here.

Other method is the component interferometry, causes that wherein t1 transmitter sends one by one, but does not have the transmission of all initial transmitters.Arranging then will be as shown in simple among Fig. 6.In this other method, each receiver is measured from each power of receiving of t1 transmitter.To the receiver notice, where " it " transmitter will send in sending sequence before measuring sequence.Thereby each receiver can be relatively from signal and all other interference of " it " transmitter.In order to determine whether proper operation of link, this component interference detecting method need relatively they with required signal before sue for peace to disturbing.By contrast, amounting to interference detecting method is directly to measure the interference that amounts to.Under link can not the situation of proper operation, the component interference detecting method made receiver can discern the source which transmitter is a problem.

Aforesaid these two kinds of methods all allow only to carry out disturbed test between all users of timeslice T1.Cause the situation of interference at the node place that the transmitter that sends on the T1-1 receives on T1, also can be adjusted in some cases.In order in above-mentioned graticule mesh, to make this become possibility, the position that should make antenna point to them simultaneously to be used for T1-1 and T1.Under this situation, revise the program that is used to amount to interferometry, make except sending in A1 and measuring, all transmitters that will send in T1-1 whole sequence in entering guard's timeslice A1-1 of A1 immediately sends.If the interference from T1-2 is relevant, can suppose that the position for the T1-2 antenna also is possible simultaneously similarly by means of the test of the transmission among the A1-2.

For the component interference detecting method, the measurement of effect is slightly different between the timeslice.Position for T1 and all antennas of T1+1 must at first be set.T1 sends and measures sequence and keep as mentioned above.In addition, among all receiver guard's timeslice A1+1 after closelying follow A1, carry out t1 interferometry that separates for T1+1.If relevant, this technology also can be extended T1+2.

The measurement of following link and timeslice compatibility is another adaptive selection part.This has added the extra time to adaptive execution.Yet this has reduced because the unpredictable chance of disturbing institute to link inefficacy during adaptive between the link.

Except their uses during adaptive, component interference detecting method and amount to one of interference detecting method or both can carried out in the sheet in non-cutting time during the normal lattice net operation.Use like this, they can provide the early warning of the disturbance state of variation, and point out the reason of this state.

V.2. adaptation method

The adaptive method of the graticule mesh that can use is different on change degree that they relate to and type.Can classify to the graticule mesh adaptation method according to degree or type that they change.Be to be understood that this classification only is used for this specification helping to understand notion, rather than will limit of the application of this method actual graticule mesh.In preferred the realization, this classification is based on moving criterion such as required antenna, and script is the change of route originally, and/or timeslice is redistributed.

V.2.1. by the method for supplying classification

In these methods, existing script topological structure is not done any change, thereby existing script communication path is not done any change.In the new graticule mesh in not being included in current graticule mesh, except at least one end of each link the Radio Link at new node place, do not use Radio Link.Thereby except the link that is formed into new node, there is not antenna to be moved.These methods for example can be used in one or more new nodes and will be installed in the existing graticule mesh.In addition, in these methods, except to new link of each new node condition, the script topological structure of new graticule mesh configuration is confined to the script topological structure that is equal to initial graticule mesh configuration.

In the preferred embodiment of these methods of execution, except the formation method is allowed to link from its selection, be restricted to that all that link adds outside the combination of all links between new node and the existing node in the current graticule mesh, new script topological structure provides that regular formation method obtains.In addition, all new nodes are confined to the leaf in the new script topological structure.The result of these constraints has produced to satisfy above requirement script topological structure of (if existence).

Under the situation that the effective script topological structure that satisfies these constraints exists, each new node can be installed, and not influence the script path of existing service.

Variety of option can be used to calculate remaining graticule mesh topological structure in the preferred embodiment, and another Supply Method is provided like this.The firstth, strict supply.Under this situation, whole current graticule mesh need not it is changed, and must form the part of new graticule mesh.Like this, have only in the time can need not to change in the current graticule mesh configuration of the timeslice on any Radio Link to new link assignment reasonable time sheet, new script topological structure is only effectively.In order to guarantee that this condition sets up, can in the script forming process, add a constraint, be added originally to the script of any existing script link interpolation timeslice preventing.During the elasticity path adds, all existing resilient links do not do to change combined after, this formations algorithm use only is applicable to the normal procedure of these selections, attempts to add any resilient link, wherein at least one end of each link is in a new node.During stand-by channel adds, after all existing paths are combined without change, this formation algorithm uses the normal procedure that only is applicable to these selections, attempts any stand-by channel is added in new service, and wherein at least one end of each link is in a new node.During restaining, all existing painted must being held; New link timeslice must be painted compatible with these.

In carrying out strict supply, do not need that graticule mesh is done influence and be used for the existing graticule mesh link of existing service or any change of path.The change unique to graticule mesh is, adds new node, link and service as the part of installation procedure.

Second method of supply is the supply that adds.Under this situation, allow to add one or more timeslices, suppose and to do like this, and do not change the timeslice configuration of having used on any Radio Link in the current graticule mesh to existing graticule mesh link.This calculates for the strictness supply as above, during the formation of script topological structure, allows timeslice to add topological structure link originally to, supposes that affected each node has unappropriated up duration sheet.

Third party's method is the supply that deducts, and wherein adds the link that leads to new node and path is selected link and path originally from existing, but resilient link can be removed on demand, so that give way for originally in the topological structure new link.

The 4th is the supply that substitutes: this is the former combination of two, wherein also allows restaining of timeslice.

These supply types provide the probability of success that increases gradually by the above order that provides.For depending on above employed which option by supplying adaptive execution in step.Except the supply situation of strictness, need be to the change of graticule mesh to allow the installation of one or more new nodes.These changes are subclass for those required changes of the following redistribution that will illustrate.Important difference is being arranged: in all types of supply,, thereby do not need route to switch between supply and all types redistributed not to change originally.

In general, supply need be minimum to the change that graticule mesh is done, thereby the easiest realization, and generally should at first attempt.Yet supply possibly can't be found acceptable solution.For example this may be because, (be not to be understood that to the sight line that existing node has at least two free antennas from new node, this is for producing the necessary condition of topological structure effectively originally, this topological structure has the preferred agreement of possessing an idle antenna at each node), or because having the result of the possible link of new node only is the maximum hop-count of violation, or the result is the traffic that surpasses on one of link.Under this situation, the adaptive class that needs are more complicated.

V.2.2. Chong Xinfenbu method

In these methods, except at least one end of each link the Radio Link at new node place, in not being included in the new graticule mesh of current graticule mesh, do not use Radio Link.Yet, do not apply any other restriction, thereby new topological structure can use any existing link in the graticule mesh.Link from current graticule mesh may not necessarily appear in the new graticule mesh.

These methods for example can be used when one or more new nodes are installed to an existing graticule mesh.(, existing similar method to be used for removing a node) from current graticule mesh as following simple discussion.These methods also are applicable to as regulating the method for topological structure originally, make the node of regulation become leaf, or wherein all parameters of graticule mesh need be conditioned.

Use the forming process that does not have fully to revise to produce a redistribution,, add that at least one end of each link is outside those links of new node except the link limitations that provides as the candidate during the whole process is those links that are included in current graticule mesh.

If redistribute feasible under any specific situation, from this output that provides is a new graticule mesh, wherein without any need for new Radio Link (except at least one end of each link the Radio Link of new node), though the use of some Radio Link may suspend.Consequently, the change from old graticule mesh to new graticule mesh can change the step execution as single triggering.In the preferred realization of graticule mesh, new graticule mesh should be colored before adaptive can the realization.

Single triggering changes step has combination arbitrarily not only to comprise that route switched but also comprises and restain operation.In prestrain and trigger, sequence is deferred to above-mentioned four general steps; Have only a step that is triggered to need executive program to distribute, and do not have the operation of middle graticule mesh.

In preferred a realization, carry out interferometry and the cost adjusting is discussed, under this situation, detailed operation can followingly be carried out.In the following discussion, with reference to the target graticule mesh that is called the initial graticule mesh of MESH (A) and is called MESH (B).For the purpose of this sequence, MESH (B) is the graticule mesh that produces by forming process, but has omitted any new node to be installed and link.In case this graticule mesh operation, these new projects of principle of following " adaptive installation then " can be mounted:

Step 1: the required information that changes during the following triggering step of prestrain;

Step 2: all communication paths that interpolation will be used in MESH (B) and not use in MESH (A);

Step 3: enable split table pattern for all management router functions;

Step 4: it is expensive changing all links be included in MESH (A) but be not included in MESH (B) in the management routing database;

Step 5: after routing table restrained required time again, forbidding was for the split table pattern of all management router functions;

Step 6: the interference behavior of successively MESH (B) being measured each timeslice.Because all antennas that use in MESH (B) are correctly in place in this stage, measurement can consider that the interference between the timeslice carries out;

To the be interfered signal that make to receive surpasses by required demodulation surplus and disturbs if step 6 is pointed out any link, then this adaptation procedure must be abandoned, analysis result also calculates different adaptive (for example, when execution is painted, considering about information new between the link).If must being reversed to step 2, adaptive being abandoned, then above step 5 carry out.

If interferometry is satisfied, then process enters step 7:

Step 7: all operations link that the MESH (B) that is used for them disposes is restained.This may comprise destruction some MESH (A) link.The route of all services is switched to their MESH (B) via configuration;

Under any link can not the situation of normal running, must abandon this adaptive and reverse problem once more, making step 7 oppositely not any is that above step 5 to 2 is reverse.Otherwise wait for that a period confirms as stable and enter step 8 then up to MESH (B).

Step 8: remove the communication path that all use and do not use in MESH (A) in MESH (B).

More than this class of describing in detail by example is adaptive has avoided the moving of antenna (with required mobile different of the link that is formed into new node during installation), and the operation of graticule mesh in the middle of not needing, thereby in general the easiest following realization after the supply.

As adaptive another method, can use a kind of adaptive class, wherein the script topological structure of new graticule mesh " PRI (B) " is overlapping by the topological structure of old graticule mesh MESH (A), but wherein any sight line can be regarded redundant link as.This method needs antenna to move, but does not set up new topological structure, and its possible result is that graticule mesh has redundancy preferably under certain situation.Be except in a single day topological structure has been calculated originally, to consider all links in subsequent step then, and be not only link as for what redistribution will be calculated from current graticule mesh.The execution of this type adaptation is adaptive about by coexistence primary colors discussed below.

If more than pass through the described any types of adaptations of example all not by acceptable solution, then can consider other the more complicated adaptive class that comprises that antenna moves.

V.2.3. the coexistence or the method for overlapping primary colors

In these methods, produce a kind of new graticule mesh, wherein new Radio Link is added between the existing node.Like this, in these methods, in existing graticule mesh, need moving of some antenna.These methods preferably retrain the formation method and produce a new graticule mesh, and making only needs a group or two groups of antennas to move, and change step and only relate to graticule mesh in the middle of one of the operation.

These methods attempt to find a new graticule mesh, make can both distribute in the identical time for all required wireless antennas of old script topological structure and new script topological structure.In other words, be used for topological structure originally antenna can be no more than under the given antenna number in any node place in place.Thereby, for the new graticule mesh required aerial position of topological structure originally, can realize not damaging under the current topological structure ability, so that transmit the traffic of all promises by graticule mesh.

Following reference is called MESH (A) and has the initial graticule mesh of topological structure PRI (A) originally, and is called the target graticule mesh that MESH (B) has script topological structure PRI (B), by a detailed example this is discussed.

Being activated to new Radio Link of the identical time that they shift with communication path is under the acceptable situation, can this execution restain, and wherein all old script links replace with all new script links.Because it is applicable to the link that does not before have operation, this is actually the above-mentioned expansion version of restaining.

Under the situation that the new Radio Link of needs started before communication path is transferred to them, this has increased additional requirement, promptly the time enough sheet must be arranged at each node place, should support to transmit the current script topological structure of the traffic load of its all promises, add again to be enabled among the PRI (B) but the required minimum timeslice number of each link that does not occur at PRI (A).At this moment this allows to use the middle graticule mesh MESH (I) of this combination that comprises link.MESH (I) allowed before the actual change of making the use of PRI (B), started all new links among the PRI (B) and checked their operation.By middle graticule mesh MESH (I) adaptive need the use standard, do not expand restain function.

During remaining is described in this joint, suppose before communication path is transferred to them, to start link, thereby just need to use this MESH (I).Modification to other situation is described then.

Below this class adaptive in the discussion of the method for optimizing that calculates of step, with reference to the formation step in the unconfinement graticule mesh forming process of above detailed description.

First operation is to calculate PRI (B).This can be by as carrying out for unconfinement graticule mesh forming process, and different is that following modification is arranged.As in unconfinement graticule mesh forming process, (but with previous two types of adaptations in different) provides between the graticule mesh node all sight lines as the candidate who is used for PRI (B) to forming process.

In this method for optimizing,, be included in two additional steps of forming process before beginning to the modification of the forming process that is used to calculate PRI (B).In a first step, all sight lines are marked with and indicate them whether to be used to the sign of PRI (A).In second step, calculating can be by the new number of links that is used for PRI (B) of each node support.If the antenna number that the node place on the link of the part that forms PRI (A) does not have to use is a _Free, the timeslice number that this node place does not have to use on the link of the part that forms PRI (A) is t _Free, the required minimum timeslice number of Radio Link is 2, and p _FreeBe t _FreeIndividual timeslice is to sum, so p _Free=t _Free/ 2 for t _FreeBe even number, (t _Free-1)/2 for t _FreeBeing odd number, can be a by the new number of links that is used for PRI (B) of this node support at this moment _FreeWith p _FreeThe smaller.For example, if there is a node of 16 timeslices and 4 antennas to use 13 timeslices and 2 antennas in PRI (A), then it can support to be used for the new link of PRI (B).For the example that in PRI (A), uses the 4-antenna node of 12 timeslices and 3 antennas, be correct equally.

The modification of forming process in the preferred embodiment is also comprised an additional test, and this is to add in the part of the unconfinement graticule mesh formation method step F 9 of the process that is used for calculating PRI (B).When assessing a path for the use in PRI (B), each node place in this path, obsolete sight line number is counted to using (is new the use for this path) but in PRI (A).If by above calculating, this number surpasses new PRI (B) number of links that this node can be supported, then this path is rejected.If it equals this number, step F 10 in unconfinement graticule mesh formation method then, all are not labeled as the not use sight line of using from this node in PRI (A), be marked as unavailable.

In step F 11, if the number of violating is zero, make that path is selected as the part of PRI (B), then new PRI (B) number of links that each this node of node place can be supported in path reduces the sight line number that is used (is new use for this path) but does not use in PRI (A).

In case PRI (B) is calculated, two options can be used to calculate remaining new graticule mesh MESH (B), form adaptive other method by the coexistence primary colors like this.

These two method differences are can be performed according to adaptive, and it still is two such steps that a graticule mesh whether only using antenna (a plurality of) to be moved changes step.Only use a step reduced adaptive during failure branch risk.On the other hand, use two steps to increase the ability that forming process produces marginal capacity, because MESH (B) less suffering restraints in its topological structure.

Can see, if before restaining, carry out interferometry, then single mobile situation allow to all timeslices measure universal class and antenna together is moved in their new script topological structures, but to from the traffic of old script topological structure without any destruction.These measurements can comprise the measurement of effect between all timeslices.

Under two mobile situations, above situation is false.Be used to carry out the preferred point of this measurement in the process in following statement.

Adaptive for two mobile steps in case PRI (B) is calculated, can be used the remainder of further not revising and have the new graticule mesh MESH (B) of the forming process calculating freely selected from all sight lines.

For using the adaptive of a mobile step, when having selected resilient link, then to do further to revise to forming process.In the beginning of resilient link selection course, before entering first resilient link, insert three extra steps.At first, corresponding among the PRI (A) but be not that all sight lines of link are marked with a sign (such as this link of representing some candidate's resilient link among the MESH (B)) among the PRI (B).Then, for each node, " removable antenna " number, the meaning is not have to use in the coexistence graticule mesh of PRI (A) and PRI (B) thereby still move the number that is moved freely in the step at individual antenna, is labeled.At last, these null all node places of number from all sight lines of each this node, except being masked as corresponding to the link in PRI (B) in PRI (A) but not, are marked as unavailable.

An extra step is inserted after adding each resilient link.When being masked as not that the link in PRI (A) has been added, this removable antenna number in both link ends place is by decrement.At each end of this link, if free antenna number becomes zero, then all are from the sight line of this node, except being masked as in PRI (A), are labeled as unavailable.

In this method for optimizing, in fact the adaptive of this plan be configured into row by the adaptive change step of a sequence to graticule mesh.These steps at first will be described by the example that moves situation for individual antenna:

Step 3: enable split table pattern for all management router functions;

Move and notice,

step

3 and 4 can be carried out as single triggering action; Under this situation, step 5 also may be triggered.Triggering is optionally, because also there is not elasticity to be removed from network.Yet because the cost of labor of being added, routing table is in a kind of arrangement of suboptimum.Thereby trigger action preferably is because this has shortened the time that routing table becomes suboptimum.From step 6, preferably use and trigger, because elasticity begins to exhaust now, thereby hope has the maximal rate by these steps.

Step 6: abandon all links that the antenna of its at least one appointment will be moved, and move these antenna to their positions in MESH (B);

Best execution in step 7 and 8, so that before carrying out any restaining, each MESH (I) and MESH (B) are carried out disturbed test:

Step 7: successively each timeslice of MESH (I) is measured the interference behavior.Because the antenna that uses among all MESH (I) is correctly in place in this stage, carries out so measurement can be considered the interference between timeslice;

Step 8: successively each timeslice of MESH (B) is measured the interference behavior.Because the antenna that uses among all MESH (B) is correctly in place in this stage, carries out so measurement can be considered the interference between timeslice;

If step 7 or 8 has been pointed out any link and will be interfered, so that the signal of receiving can not surpass interference signal with required demodulation surplus, so as described for redistribution, this adaptive must being abandoned and problem analysis, oppositely above step 6 to 2.Otherwise enter step 9:

Step 9: all operations link that the MESH (I) that is used for them disposes is restained.Use their all new MESH (I) Radio Links of the painted startup of MESH (I).Note, only need use in this step and set up the required minimum possibility timeslice number of each link.Step 9 is all carried out as triggering action.

Under any link can not start or can not the situation of proper operation, must abandon this adaptive and problem analysis, so reverse step 9 is above step 6 to 2 then.Otherwise wait for that a period is up to be sure oing that MESH (I) is stable and entering step 10 then.

It may be noted that the middle graticule mesh MESH (I) of present operation, is to support to transmit all required timeslices of PRI (A) traffic, adds the graticule mesh that appears at PRI (B) but do not appear at least two timeslices of every link among the PRI (A); As may this also comprising some stand-by channel that appears among the MESH (A).

Step 10: the operation link to being useful on MESH (B) configuration is restained.This can comprise destruction some MESH (I) link.The route of all services is switched to their MESH (B) via configuration.Use their all new MESH (B) Radio Links of the painted startup of MESH (B).Overall Steps 10 triggers action as one and carries out.

Under any link can not start or can not the situation of proper operation, must abandon this adaptive and problem analysis, so reverse step 10, step 9 is above step 6 to 2 then.Otherwise wait for that a period is up to be sure oing that MESH (B) is stable and entering step 11 then.The wait that this wait cans be compared to most after the step 9 is the longest, because at this moment after the section, will lose rapidly the oppositely possibility of whole sequence.

Step 11: to all management router function on split table patterns;

Step 12: in the management routing database, all are included among the MESH (B) but the link that is not included among the MESH (A) changes to low cost;

Step 13: after routing table restrains required time again, to all management router function forbidding split table patterns;

As above, step 11 and 12 and 13 each can constitute a single triggering step.

Step 14: remove all and in MESH (B), use but the communication path that in MESH (A), do not use.

Above program is can not transfer under the situation of Radio Link when they start for the traffic, is used for single mobile adaptive.

The situation that can be activated simultaneously and load with the traffic for link: (i) at calculation stages P _FreeSo that the new antenna number a that can be used for PRI (B) _FreeDo not re-use; And (ii) MESH (I) no longer needs thereby execution in step 7 and 9 not.

For having adaptive that double antenna moves: (i) use an extra step those antennas that are not used in MESH (I) to be moved to the position of their MESH (B) after step 9 success; And (ii) for the interferometry of MESH (B), above step 8 is performed, rather than after above new step.

About a mutation of overlapping former color method is to calculate a required graticule mesh without any adaptation constraint, and tests this then and whether form a MESH (B) who satisfies above-mentioned list or the moving adaptive condition of two-track.This calculating can followingly be carried out.By send out constraint form calculate required graticule mesh after, use overlapping former color method, but only allow script link in the unconfinement graticule mesh and PRI (B) link as the candidate who is used for PRI (B).If this method is failure not, this graticule mesh preferably produces by above method.

V.2.4. repeat the method for overlapping primary colors

Described here adaptive in the another class of most probable success adaptive, be as the adaptive set realization of a repetition of the coexistence primary colors by above detailed description.At first, form new target topological structure of calculating by unconfinement.If this is the target graticule mesh of its script topological structure and the coexistence of current script topological structure, then adaptive can as above the execution in a sequence.Otherwise, must find a series of this sequences (its each itself be by the coexistence primary colors adaptive), realize required purpose.

Generally speaking, these class methods are at first used unconfinement to form and are calculated a target graticule mesh MESH (T), make MESH (T) satisfy certain new object set.From satisfying the current graticule mesh MESH (C) of current goal collection, calculate its each the satisfied a series of script topological structure of object set P then for MESH (T) ₁... P _n, make P ₁Be PRI (C), P _nBe PRI (T), and for x＜n, P _xAnd P _X+1It is a pair of coexistence primary colors.Last this character means, uses the repetition of n-1 the former color method of previous described coexistence, from MESH (C) to the progressive adaptive of MESH (T) thereby be accessible.Repeat required graticule mesh character afterwards according to each, any one mutation of this method can be used in each n-1 repetition.

Like this, carry out those technology that this discussed more than adaptive will only needs.Required unique new technology is used to calculate P ₁... P _nMethod.Preferable methods has made up the calculating and the link obstruction method (joint 11.5) above-mentioned and that forming process interrelates of overlapping primary colors.Begin with y=1, repeatedly attempt to form new graticule mesh P _Y+1, make P _yAnd P _Y+1Be the coexistence primary colors.Follow the above computational process that provides, have such additional modifications, promptly apply an obstacle, and do not apply obstacle to those links that appear at PRI (C) to all links that do not appear at PRI (C) for coexistence primary colors PRI (B).

The result who applies this obstacle is the topological structure P that produces sequence trend PRI (C) _Y+1The option that can be applied to this calculating comprises the level of the obstacle H that is applied and offers each P _Y+1The whole set of sight line of calculating.The sight line set can be at P _yIn those sight lines add those sight lines among the PRI (C); In addition, this set can be all sight lines.The selection of an optimization is for each P _Y+1Carry out following sequence.At first use a H value, only consider P greater than the hop-count that allows between two graticule mesh nodes _yAdd the sight line among the PRI (C).If this does not produce and P _yDifferent results then reduces this process of H and retry repeatedly.If still do not produce and be different from P _yThe result, then repeat the H sequence of above descending, at this moment consider all sight lines.At this moment, have only as the result and be different from P _yAnd comprise from PRI (C) and compare P _yDuring more link, the result is only acceptable.

Should see, because for x＜n P _xWith P _X+1Be the requirement of a pair of coexistence primary colors, above process can also be carried out like this, makes P ₁Be PRI (T) and P _nBe PRI (C).Press P except graticule mesh change at this moment under this situation _nTo P ₁Operation rather than P ₁To P _nOutside, the method for execution is same.

V.3. other adaptive option

Though abovely adaptive be described in several places and related to for adding required adaptive of node, aforesaid adaptive may also the needs in other occasion is such as when from current graticule mesh removal node; For the change (for example bandwidth demand) that adapts to the specific user of node place service level; And if for example current graticule mesh becomes suboptimum or falls under certain quality threshold, in order to optimize graticule mesh.

In order to remove a node, the program of " adaptive installation then " can be replaced by the program of " adaptive dismounting then "; Suppose that these nodes have been confined to the leaf node during adaptation procedure, the graticule mesh that is conditioned is applicable to junction associated (a plurality ofs') removal.

Under some situation, may wish that the number that graticule mesh is simultaneously changed is to be restricted to one or certain other little number.Under this situation, two preferred approach are arranged.In the approach, change above-mentioned method, make them produce and be restricted to this maximum step that changes number.In addition, these methods are constant, but each big step that they produce is transformed to a set of less step, and result that it is last and big step are similar.

Though here with reference to the described embodiments of the invention of accompanying drawing, be included in the computer processes of carrying out on the computer equipment in principle, and computer equipment itself, but the present invention also can expand to computer program, particularly at the computer program that is suitable on the carrier that the present invention is put into effect.This program can be with source code, object identification code, code intermediate source and object identification code form, such as with special compiling form, or is applicable to the form of realization according to process of the present invention with any other.Carrier is any entity or the device that can carry this program.For example, carrier can comprise storage medium, such as ROM.Fall into CD ROM or semiconductor ROM, or magnetic recording media, for example floppy disk or hard disk.

Specifically embodiments of the invention are illustrated with reference to illustrated embodiment in the accompanying drawing.Yet, should see, can make mutation and remodeling to described example within the scope of the invention.

Claims

1. form a kind of method of knot-net by a plurality of potential transmission link between a plurality of nodes and each node, each node in the network that forms can be communicated by letter with described at least one other node by the transmission link between described other node of each node and at least one, wherein at least one in the node has the peak volume rate requirement of the traffic of another point in the subtend network, and described node has the script communication path of the described point in the network, and this method may further comprise the steps:

Determine the traffic capacities of described script communication path;

Other path that is different from described script communication path of the described point of identification from described node to network makes the traffic capacities sum of the traffic capacities of described script communication path and described other path be equal to or greater than the described peak volume rate requirement to described node; And

Except described script communication path, make described other path can be used for transmitting the traffic from the described point of described node to network;

Thereby in the network that forms, if the traffic rate of the traffic of the described point from described node to network surpasses the traffic capacities of described script communication path, then traffic capacities can be divided into discrete partial, and these discrete partial are respectively by communication path and described other path described some conveying in network originally.

2. form a kind of method of knot-net by a plurality of potential transmission link between a plurality of nodes and each node, each node in the network that forms can be communicated by letter with described at least one other node by the transmission link between described other node of each node and at least one, wherein at least one in the node has the peak volume rate requirement to the traffic of another point in the network, and the script communication path that each described node has each a described point in the network adds zero or more a plurality of other paths, and this method may further comprise the steps:

Determine the traffic capacities of each described path; And

The peak volume rate requirement at described node place is distributed to each link in the network by the descending of the priority orders of each link setting.