GB2265281A - Wide area nodeless distributed synchronisation - Google Patents

Abstract

A radio communication system comprises a plurality of radio transceivers which are mutually synchronised to define a synchronised group or partition by means of data transmitted on a synchronisation channel, which synchronisation channel is additional to a channel used exclusively for the transmission of traffic data. The synchronisation channels are monitored on a time division multiplex basis using synchronisation monitoring time slots and 2/3 the traffic channel data is redundantly coded. The synchronisation channel monitoring operations by the radio transceivers of the group or partition are arranged to operate in interdependence such that a predetermined proportion of the radio transceivers are at all times monitoring the sync channel. Any station which detects that its synchronisation monitoring time slot is unused by another station, retains that slot. Should it be used by another station or stations, a random reselection of slots takes place. <IMAGE>

Description

WIDE AREA NODELESS DISTRIBUTED SYNCHRONISATION (Shared Watch for sync. transmissions) This invention relates to radio communications.

A vital requirement for modern radio communication using frequency hopping is synchronisation. Recent work has shown that significant benefits may be obtained if entire networks or even networks of networks can be synchronised together. In particular, such synchronisation reduces system self interference and also provides inter network communications both for system management and long range user traffic.

One object of this invention is to solve the problem of synchronising a large deployment of radios without the use of any masters or additional equipments, when the radios may not all be within direct radio range and propagation delays may be significant compared with the required accuracy.

Another object of the invention is to provide an algorithm for sharing the job of watching for synchronisation transmission amongst a group or partition of synchronised radio transceivers.

According to the present invention, a radio communication system comprises a plurality of radio transceivers which are mutually synchronised to define a synchronised group or partition by means of data transmitted on a synchronisation channel, which synchronisation channel is additional to a channel used exclusively for the transmission of traffic data, the synchronisation and transmission channels being utilised on a time division multiplex basis such that the traffic channel and the synchronisation channel are never utilised contemporaneously by any one radio transceiver, the traffic channel data being redundantly coded such that its absence for limited periods during which synchronisation transmissions are monitored is tolerated without a breakdown of traffic communication in the traffic channel, the channel monitoring operations by the radio transceivers of the group or partition being arranged to operate in interdependence such that a predetermined proportion of the radio transceivers are at all times monitoring the sync channel, whereby synchronisation with other groups or partitions is facilitated such that synchronisation tends to be achieved between a plurality of such groups or partitions in mutual communication.

The said interdependence may be achieved by means of an algorithm which serves to control operation as follows: a) each radio transceiver is arranged to monitor the synchronisation channel for a slot period which equates to a predetermined fraction I/Q of available operating time, where Q is an integer, the choice of slot period being made initially at random by each radio transceiver within a group or partition, b) all radio transceivers are arranged to broadcast periodically data appertaining to their current slot period chosen for synchronisation monitoring purposes and, c) all radio transceivers are arranged to update their slot period having regard to received data which appertains to the slot period selected by neighbouring transceivers.

Q may be 3 and the number of radio transceivers in a group or partition may be 3, wherein the radio transceivers are arranged to update their choice of synchronisation watching slot period according to the following algorithm: a) if the slot period used by a radio transceiver differs from the slots used by the said neighbouring radio transceivers then the radio transceivers in question retains its current slot period, b) if the slot period used by a radio transceiver is the same as the slot period used by one of the neighbouring transceivers but not the other, then the radio transceiver in question makes a random choice between retention of its current slot period and changing to the slot period which is so far unused and, c) if the the radio transceiver in question is currently using the same slot period as both of its neighbours then that transceiver will randomly select a new slot period from the three available.

The number of radio transceivers in a group or partition may be greater than three and the neighbouring transceivers considered for the algorithm may be limited to two by means of selecting the two neighbouring radio transceivers which are received with the strongest signal.

The neighbouring radio transceivers which are the subject of the algorithm may be restricted to two by firstly selecting the three signals received with the greatest signal strength and then secondly randomly selecting one of the three which is then rejected.

The said interdependence may be achieved by means of an algorithm which serves to control operations as follows: a) each radio transceiver is arranged to monitor the synchronisation channel for S predetermined slot periods out of every Q where Q is an integer being the number of slot periods and where Q is greater than the number of radios R in the group or partition and where S is determined as being the smallest integer which is greater than or equal to Q/R, the choice of S slot periods being made initially at random by each radio transceiver within a group or partition, b) all radio transceivers are arranged to broadcast periodically data appertaining to their current slot period chosen for synchronisation monitoring purposes and, c) all radio transceivers are arranged to update their slot period having regard to received data which appertains to the slot period selected by neighbouring radio transceivers.

Q, R, and S may be chosen to be, Q = 3, R = 2 and S = 2, the choice of synchronisation watch slot periods being made according to the following algorithm, a) if the slot period not being used by a radio transceiver is the same as the slot period not being used by its neighbour, then the slot period to be rejected is selected randomly, b) if the slot periods not being used by a radio transceiver is different from that not being used by its neighbour then the slot period in use is retained.

The system may comprise radio transceivers each of which is arranged to switch its operational mode in dependence upon the number of radio transceivers with which it is in synchronised communication.

Increasingly, radio communications systems are making use of networking concepts to provide new facilities such as; integrated secure digital voice and data; addressed guaranteed message delivery over paths significantly greater than the basic radio paths; self managing communications resources with prioritisation and crisis management, and inter-net working, usually via gateways.

Provisions of these facilities can be particularly problematical when ECCM capabilities need to be overlaid.

An attractive option for providing ECCM capabilities is the use of slow frequency hopping. It can be shown that frequency hopping with random non-orthogonal sequences can provide excellent spectral efficiency whilst removing the need for complex frequency management procedures. Provision of wide area synchronisation, to better than the guard time between hops reduces system self interference whilst facilitating inter-net communications without the need for dedicated gateways. Essentially, communications between groups is possible providing they know each other's frequency hopping sequences and hold common time. Thus problems of frequency management, connectivities and ECCM would all be solved.

Provision of wide area synchronisation is traditionally provided by means of some broadcast time standard. However, this has the disadvantage that the time source represents a single point vulnerability. An alternative is to distribute some timing masters throughout the deployment. This still suffers from the problem of increased vulnerability and suffers the additional disadvantage that, unless a large number are deployed, communications will be required over paths significantly longer than those operated by standard radios. Clearly the most attractive solution is for radios to establish sync. in fully distributed and nodeless fashion. There are no points of particular vulnerability and no special additional equipment is required.

This invention is concerned especially to provide algorithms and protocols for Wide Area Nodeless Distributed Sync., and the following assumptions are made: In defining assumptions on clock accuracy a compromise is made between practicality and cost. A figure of +1 ppm represents a reasonable compromise, since it is close to the state of the art for non-ovened TCXOs and involves a cost which is not excessive when viewed in relation to a complete radio equipment.

Another factor in relation to clocks, is the accuracy with which they are set initially. This is defined as + N secs, henceforth and is generally reckoned to be of the order of a few seconds. Bearing this in mind it is also desirable that the range should not represent a "brick wall" beyond which synchronisation becomes impossible. The parameters assumed for frequency hopping are, that hopping is at H hops/sec.

Some embodiments of the invention will now be described by way of example with reference to the accompanying drawings in which; Figure 1 is a diagram showing transmission/reception hop timing, Figure 2 is a diagram illustrating the synchronisation frame, Figure 3 is a diagram showing the synchronisation frame with randomised transmission timing, Figure 4 is a graph showing how timing error varies in accordance with the number of frames required to achieve synchronisation, Figure 5 is a diagram showing acknowledgement timing and frequency, Figure 6 is a diagram showing synchronisation between two radios, Figure 7 is a diagram showing tuning between graphic and synchronisation channels, Figure 8 is a diagram showing multiple slot watching, Figure 9 is a diagram showing slot watching in a deployment of three radios, Figure 10 is a table showing the watch state of radios shown in Figure 9, Figure 11 is a diagram showing a deployment of three radios in a second slot watching state, Figure 12 is a table appertaining to the watch state of radios shown in Figure 11, Figure 13 is a diagram showing the deployment of three radios in a final slot watching state, Figure 14 is a table showing the watch state of the radios shown in Figure 13, Figure 15 is a diagram showing a slot watch algorithm, Figure 16 is a graph showing watch algorithm performance, Figure 17 is a diagram illustrating two radio slot sharing, Figure 18 is a diagram showing four radios in a slot watching deadlock situation, Figure 19 is a diagram showing two partitions or groups of radios in synchronisation conflict, Figure 20 is a diagram showing a count updating process, Figure 21 is a diagram of a deployment of radios illustrating a first stage radio counting process, Figure 22 is a diagram which is similar to Figure 21 but which illustrates a second stage radio counting process, Figure 23 is a diagram similar to Figure 21 and 22 which illustrates a third stage radio counting process, Figure 24 is a diagram which illustrates progression of the counting process shown in Figure 23 and illustrating a fourth stage radio counting process, Figure 25 is a diagram of a fine timing scenario with no clock errors, Figure 26 is a diagram which illustrates common timing definition, Figure 27 is a graph showing the performance of radios operating exponential updating, Figure 28 is a graph showing an alternative exponential updating performance, Figure 29 is a diagram illustrating a fine timing scenario with clock speed errors, Figure 30 is a graph showing exponential updating in the presence of clock speed errors, Figure 31 is a graph showing exponential updating with different clock speed errors, Figure 32 is a graph showing exponential updating with predetermined compensation and; Figure 33 is a graph showing exponential updating with specified errors and compensation.

The exact slotting of hops is as shown in Figure.l. It is assumed that the time taken for a receiver synthesiser to re-tune is insignificant compared with the guard period (this possibly implies the use of a pair of synthesisers). On this basis the receiver can readily hear any transmission which is up to +1/2 G seconds in error, were G is the guard time.

Obviously the requirement is that the radios should synchronise as rapidly as possible, and in normal operation a presynchronised system will provide immediate service. After significant periods of radio silence however, (e.g. several hours) the radios may drift out of sync. On this basis the network should reestablish sync. in a few seconds. In the case of synchronisation "from cold", however, a reasonable period can be allowed. For example, 15 minutes would probably not be unacceptable.

The fundamental purpose of synchronisation in a frequency hopping scenario is to facilitate user traffic communications.

However, communications over the same medium must be employed to achieve synchronisation in the first place. Thus it is necessary to establish a mechanism for communications specifically dedicated to achieving synchronisation which does not itself rely on very good time accuracy but which nevertheless achieves the ECCM capability of frequency hopping.

One such approach is to establish a synchronisation channel which changes less frequently than the normal frequency hopping traffic channel, such that a radio transmitting on this channel can guarantee that the others in the deployment will be tuned to it at transmission time.

When a radio is unsynchronised it will listen permanently on the synchronisation channel, and time will be divided into frames during which the frequency remains unaltered, as shown in Figure 2.

This shows that a timing error of + N secs for each radio results in a synchronisation frame period of 4N seconds. This arises because the transmitter could be up to 2N second ahead or behind the receiver. The use of such a frame on first appearance is satisfactory.

However, consider the case where several radios have already synchronised but are continuing to send synchronisation messages for the benefit of other unsynchronised radios. The synchronised radios will all transmit simultaneously, causing significant co-channel interference, often preventing reception.

This may be resolved by introducing a random element into the timing of the synchronisation transmissions. A useful compromise between randomness and extension of the frame period is +N secs = 1/2 MN where M is a constant and M = 2 in this case. The effect of this on the frame period is illustrated in Figure 3.

In fact, another advantage of the scheme just before described, is that it provides a gradual degradation in sync. performance for any radios whose clocks had, for any reason fallen outside the +N second window. Because the time of sync. transmission has a uniform distribution across +N seconds of the frame, a radio which is up to about 3N seconds in error will eventually succeed in receiving/transmitting the sync. message in the correct frame. Thus, for timing errors greater than +N seconds the worst case (worst case here means that the rest of the radios are synchronised N second in error in the other direction) the average time to achieve sync. will tend to increase according to the curve shown in Figure 4.

Considering now the next questions relating to the basic synchronisation transmissions which are; firstly who should make them? and, Secondly what should they do? Synchronisation transmissions could be viewed as performing any of the following roles; a) An opportunity provided by the initiator for others to synchronise.

b) A request by the initiator for synchronisation.

c) A combination of the above.

In role a) it could be argued that the initiator would need to view itself as being, in some sense, already synchronised. On this basis only those radios which have become synchronised to at least one other radio should make synchronisation transmissions. In this condition the system would never start up since all radios would remain silent, waiting for synchronisation transmissions which would never be made.

In role b) the same problem exists in a different form. Replies to a request for synchronisation can only logically be provided by radios which are in some sense already synchronised.

In a distributed sync. scenario the synchronisation might serve to connect two partitions, e.g. one partition containing 4 radios, the other containing 7. In this case "who is synchronising whom?" is a moot point. In fact the only logical role for synchronisation messages is that of role c), i.e. "it depends". On this basis, synchronisation messages are made by every radio in every frame.

The second question "What should it do?" is, in some sense, linked to the first, i.e. "It depends!". For example, a very simple approach would be to make the synchronisation transmissions constitute a basic "JOIN ME" command. This is clearly unacceptable because all informed groups would be regularly fragmented by individual radios coming into range on the periphery. Moreover, the system would be extremely vulnerable to spoofing of the recordand-reply kind and encryption would have no effect.

Clearly then, some form of 'handshake' is required to permit exchange of information and to validate the source and timing of the synchronisation transmission. Thus the first response to a synchronisation transmission should be an acknowledgement transmission.

The first problem one meets with acknowledgement transmissions is, "How can it be sent to the originator of the synchronisation transmission, given that the two radios are frequency hopping and unsynchronised?". We do not wish to use the synchronisation channel for acknowledgement since this holds some potential for exploitation by spoofers after the initial synchronisation transmission.

Fortunately, it is possible to predict the correct time and frequency for transmission of the acknowledgement using information contained within the original synchronisation transmission, coupled with knowledge of the time at which this was received. Several procedures could be envisaged for this but the one proposed is as follows: 1) As described above, time is divided into '6N' second frames. Moreover, every frame is sub-divided by the frequency hopping into a fixed number of slots (6NH for H hops/sec).

Synchronisation messages contain, in digital form, the slot number in which they were transmitted.

2) When a radio receives a synchronisation message it notes its own slot number (i.e. determined by its own clock) - including any fractional component - when the message was received. By comparing the local slot number with that contained in the message, the radio can determine the time difference between the two radios.

3) In addition to the slot number the synchronisation message also contains a slot delay entry. This corresponds to the number of slots after sending the synchronisation message that the initiator expects to receive an acknowledgement.

4) The acknowledging radio can readily calculate from the above information, the time (with respect to its own clock) at which it should schedule the transmission to be received at the sync. source at the correct time.

The above takes no account of choice of frequency for the reply.

It would be possible for the synchronisation message to contain, along with the slot delay entry, an entry specifying the frequency on which the acknowledgement is expected. However, this would be inefficient in the use of communications bandwidth, and is unnecessary. The proposed approach is for there to be a system wide synchronisation frequency hopping sequence independent of the normal traffic hopping sequence. Using the slot number plus the delay slot, the recipient of the sync. message can determine the absolute slot number on which the acknowledgement is expected and hence the particular frequency required, derived from the synchronisation frequency hopping sequence. This procedure is illustrated in Figure 5.

Referring now to Figure 5, the sync. source has randomly selected slot number 3456 in the current frame for transmission of its synchronisation message. Note that the sync. message has a length of one half slot and is transmitted twice. This ensures that whatever the timing of the recipient (assuming it is not always tuned to the sync. channel) the message can be received. In this case the recipient receives the message during its own slot number 4429 and in fact notes that the exact reception time was 4429.5 (i.e. halfway through the slot). In determining the received slot number, the recipient references reception time back to the start of the message.

The two repeats of the sync. message are labelled first and second so the recipient is able to determine the start time for the first of the transmissions even if it only received the second.

The sync. source randomly determined that it would listen for an acknowledgement 73 slots after transmission of the sync. message and placed this number into the sync. message. The recipient of the message adds this number to the local reception slot number to determine when to send the acknowledgement. The sync.

transmission also contained the slot number in which it was sent (i.e.

3456). By adding the slot delay to this, the sync. recipient can determine in which slot number the sync. source expects to receive the acknowledgement.

Both sync. source and recipient run the same frequency sync.

hopping algorithm in addition to the user traffic frequency hopping sequence. This generates frequencies for all slots but only a small number of them are actually used. The sync. source spends most of its time listening on the synchronisation channel (for sync. messages from other radios) but, in slot 3529 (=3456 + 73) it looks up the appropriate frequency for this slot from the frequency sync. hopping sequence and tunes to this. Similarly, the recipient of the sync.

message, using knowledge of the slot number for reception at the sync. source can select the appropriate frequency for transmission.

Note that it will usually be necessary for the acknowledgement to be sent out of time with respect to the normal slotting of frequencies.

The flexibility to do this means that it is not necessary for the acknowledgement transmission to be sent twice since it can be accurately time aligned with the receiver.

Note that recipients of synchronisation messages will respond with acknowledgement only if they are not already synchronised with the originator. This is tested by comparing the slot number contained within the message against the local slot number when the message was received. If the difference is less than the guard time specified for transmissions then the two are reckoned to be synchronised. Moreover, recipients of sync. messages will respond only to the first correctly received from a differently timed radio in that frame. Furthermore, any radio hearing a sync. message before it has transmitted its own for that frame will suppress its transmission.

In spite of the above constraints on acknowledgements, it is quite likely that several radios will all hear the same sync. transmission and legitimately acknowledge it. In this case, of course, their transmissions will interfere at the sync. source and none may be received. In order to avoid, or at least mitigate this effect, the sync. source in fact sends a number of options for slot delay for acknowledgement (4 were used in the model). The sync. source looks up the corresponding frequencies and listens on these at the appropriate times. In turn the acknowledging radios randomly select one of the slot delays for the acknowledgement. This does not always completely solve the problem in all cases and thus protocol extensions may be used as described later herein.

Having established a mechanism for returning acknowledgement messages to the sync. source, we must now consider what actions(s) these messages should perform. The same arguments apply as for sync. messages, to the effect that the acknowledgements cannot take the form of simple "JOIN ME" instruction, in this case because the sync. source could receive conflicting instructions from different acknowledgers. The opportunity to synchronise all of the acknowledgers to the sync.

source would also be lost. It follows that any sync. source receiving acknowledgments should temporarily take on the role of arbiter for synchronisation of itself and all of the others it has heard.

In order to - do this the sync. source must log reception of all acknowledgements and wait until all slots specified by slot delays in the sync. message have passed. At this time the sync. source may then process the acknowledgements in order to determine what synchronisation instructions to issue.

The necessary operations determine the required contents for the acknowledgment messages. Firstly, they must contain the slot number (including any fractional component), in which they were transmitted. This provides the time difference information necessary for the sync. source to compute appropriate time updating values to be sent in the synchronisation instruction message, hereafter referred to as update transmissions.

Secondly, a mechanism must be derived for correct reception of update messages. This is done in exactly the same way as for acknowledgement messages. In this case the acknowledging radio places a randomly determined slot delay into the acknowledgement message for reception of any update message sent. The slot delay must have a minimum value such that no update transmission will be expected before the sync. source has received all acknowledgements.

Using the above information, the sync. source can determine what updates are necessary.

As described above, the purpose of update transmissions is to issue instructions for radios to alter their timing. Efficiency is maximised if all radios alter their clock timing more or less simultaneously (i.e. within a slot period). Thus, in general, update transmissions will specify, not only an amount to alter the local clock but also a slot number in which to do it.

The sync. source should ideally issue instructions for updates which result in the minimum number of radios having to make changes. However, where there is no obvious choice in this regard it will calculate updates to alter the times of all equipments involved (including itself) to the average of their previous values. If we consider the case of just two radios, i.e. the sync. source and one acknowledger, then if one is 3 seconds fast and the other 1 second slow, they will synchronise to 1 second fast. The full synchronisation procedure for just two radios is illustrated in Figure 6.

It is important to note that, if radio 'B' had happened to transmit its sync. message before radio 'A' then the procedure would have been inverted. However, the result would have been the same since 'B' would have acted upon the same information.

We define a partition as any group of radios, less than the totality, which are in synchronisation. In general two or more radios in synchronisation are viewed as a partition - in fact a lone radio can be viewed more generally as a partition of one. The mechanism for synchronisation of partitions is essentially as described above but with a few extensions.

The most important point with regard to partition synchronisation is that whenever a radio engages in a synchronisation dialogue with another it does so as a representative of its partition. Thus a radio may not simply synchronise itself to another if it is already a member of a partition. Either its whole partition moves with it or it does not move at all.

The above raises a vital issue for system stability. It is, in principle, possible for a single radio to initiate a time change for a 100 others. It is vital that the algorithms in the system will not permit this to happen unless it is appropriate. For example, it might be appropriate if the representative of the 100 radios had heard a representative of a partition of 200 radios. In fact this example gives the clue to resolving such issues. If every acknowledgement transmission contains the number of radios in (or perceived to be in) the representative's partition, then the sync. source can make intelligent decisions as to which radios should update and which should not.Counting the number of radios in a partition of arbitrary size is not trivial and is dealt with in another patent application, however for the purposes of this discussion the availability of an effective means will be assumed.

The procedure for processing acknowledgements is somewhat more complex than originally presented. The procedure is as follows: 1) It is quite likely that acknowledgements may be received from more than one representative of the same partition. In this case only one of these is processed although information from both may be used (e.g. if they have different values for the number in the partition the higher will be taken).

2) The number of radios in each of the partitions represented by the sync. source and the acknowledgement sources are compared. If any exceeds all the others (taken separately) then the timing of this one will become the timing for the new, large, partition about to be formed. In this way it will be unnecessary for updates to take place within the largest partition. If however, there is no winner, then all partitions will update to a new time determined by the average, weighted according to number in partition, of all partitions represented.

3) The sync. source determines a time, a little into the future, at which the updates should take place and communicates this to all partitions along with the necessary time change in update transmissions. The reason for the delay in performing the updates is to permit the representative of each partition to inform the other members of their partitions of the necessary changes.

As mentioned earlier, it is the responsibility of the radio receiving the sync. update transmission to ensure that other members of its partition follow suit. It does this making transmissions on the normal communications channel, i.e. the normal frequency hopping sequence. The question of how the members of a partition can simultaneously listen on the communications frequency channel and on the framed synchronisation channel is presently glossed over but is dealt with in another patent application. The important point to observe here is that communications between the members of a synchronised partition is straightforward.

Essentially, the requirement is for the update to be broadcast across the partition. The problem of broadcast across a non fully connected network (i.e. one requiring retransmissions) is notoriously difficult. Fortunately this only applies in cases where the requirement is for guaranteed delivery to all destinations. In this case it is sufficient to reach a high percentage of destinations. Those missed can be "mopped up" in subsequent synchronisation frames.

The procedure for intra partition update transmissions is relatively straightforward. The initial recipient of the update from the sync. source will repeat it (with a few minor alterations) several times at pseudo random intervals. Any radio within the partition hearing the update will also repeat it the same number of times.

Thus the information will propagate across the partition. The number of repeats used is a compromise between the time taken out of normal traffic communications and reliability of update communications.

The foregoing description has described in some detail, the operation of the synchronisation procedure. Nevertheless, there are several important operations which have been glossed over, and these will now be considered in more detail.

As just before described, groups of radios become synchronised by making synchronisation transmissions. These are made on the synchronisation channel which remains fixed for a one minute frame.

Radios which have not synchronised to any other, listen permanently on the synchronisation channel. However, once they have become synchronised they must use a traffic (frequency hopping) channel to facilitate normal communications with the other members of the synchronised partition.

In principle this would be entirely satisfactory provided no other radios could be required to join the partition. However, in practice, new radios may join the partition at any time (late entrants). Moreover, other partitions formed in geographically remote locations may move into vicinity and require synchronisation.

In practice there is virtually no condition under which the members of a partition can be certain that no further synchronisation will be required.

Thus it is necessary, at all times for a watch to be maintained on the synchronisation channel - even during normal traffic communications. Conceptually the simplest way to achieve this would be with a second receiver. Whilst this might not be too unattractive (it would not need to be agile, requiring only one retune every minute), it was considered worthwhile exploring less hardware intensive alternatives.

If the transmission format of the normal traffic communications were redundant it would be possible to use some of the reception time during which a radio transceiver is tuned to the synchronisation channel without loss of communications. For example, a coding scheme whereby loss of up to 33% (i.e. 1/Q where Q is 3) of transmissions would be acceptable could be envisaged. Thus a receiver could tune to the traffic channel for two slots out of every three and to the synchronisation channel for the other. This is illustrated in Figure 7.

In the normal case the frequency hopping algorithm determines the tuned frequency FN for all slots. When synchronisation channel watching is applied, the frequency hopping algorithm determines tuned frequency for two out of every three slots, the third being tuned to the synchronisation channel.

The above is useful but offers only a one in three chance of hearing a synchronisation channel. However, where a deployment of several radios exists it is, in principle, possible to establish a permanent watch on the synchronisation channel by assigning some to watching in slot 0, some in slot 1 and some in slot 2, as shown in Figure 8.

This shows the three possible assignments for watching. Note that in each, two thirds of communications slots are watched and that together the radios maintain a permanent watch on the synchronisation channel.

For a deployment of radios, therefore, what is needed is an algorithm which tends to ensure that the watch on the three slots is distributed as evenly as possible over the deployment.

The watching of the synchronisation channel is established using a nodeless algorithm. It is explained most simply with respect to the case of three radios attempting to set up a full watch together.

Consider the the deployment of Figure 9. Each radio sends a transmission indicating its current slot watch state - in this case 0 for all radios. Thus all radios will hold a table as shown in Figure 10.

Since, in this case (the worst case) all radios are watching on the same slot, the system state is SAME. In this case all radios make a random choice of the slot number to use in the next synchronisation frame. For example, as shown in Figure 11 and in this case, each of the radios will hold a table as shown in Figure 12.

The state is now, 2 SAME. When the system is in this state, the radio whose slot number is different from the others retains that slot number. The others choose randomly from the other options (in this case 0 & ). One result might be as shown in Figure 13.

Now each radio holds the table as shown in Figure 14 and the state is ALL DIFFERENT so no further action is taken by any of the radios.

Of course, bearing in mind the randomness of the operations involved the route to the final sate could have taken several directions. Nevertheless only the three states described are possible and convergence to the final state is good. In fact there is conceptually another state. This is the initial state and is the point at which no decisions about slot numbers have been made at all. The obvious thing to do at this time is to make a random selection of slot number. Thus the initial state is equivalent to the ALL SAME in the way it is handled. However, the existence of this initial state improves performance since there is already a reasonable probability of jumping to the final state from initialisation. The overall operation and performance of the algorithm is shown in the state diagram of Figure 15.

This can be used to analyse the probability of being in any given state following a number of iterations. The result of this exercise is shown in Figure 16, wherein the curve shows that the convergence of the system to the desired state is quite rapid in spite of the non deterministic nature of the process.

As already mentioned, the case of three radios is rather simpler than the more general case. The algorithms have extensions to cater for these other cases as follows: Firstly consider the case of only two radios. It is still necessary for them to communicate but they should also maintain a complete watch of the sync. channel since they need to join a large partition as quickly as possible. The solution is to aim for slot sharing as shown in Figure 17.

In this case both radios watch two slots i.e. each radio watches for a period S/Q where S = 2 and Q = 3 of the time available for signal reception, where S is the smallest integer which is greater than or equal to Q divided by the number of radios R in a group or partition, the aim being to avoid them both watching the same pair. It is not difficult to see how an adaptation of the algorithm described above will achieve this.

When there are more than three radios in the network there are potentially several approaches to establishing a complete watch.

Following experimentation with complex algorithms involving up to 6 or 7 radios it was found that the most effective solution was based on the simple approach of applying the basic algorithm to each radio and its two nearest neighbours (i.e. those received with the greatest signal strength). This method is generally satisfactory but can be subject to deadlocks, see Figure 18.

Consider the states perceived by each of the radios: Radio A sees B & C assumes state is 1 DIFFERENT Radio B sees A & D assumes state is 1 DIFFERENT Radio C sees A & D assumes state is 1 DIFFERENT Radio D sees B & C assumes state is 1 DIFFERENT In every case, each radio assumes it is the one to remain on the same slot. Thus slot 1 is never visited.

This condition is resolved by a slight modification to the watching algorithm wherein each radio considers its 3 nearest neighbours and uses information from a random subset of 2 radios.

In the aforegoing discussion it has been assumed that the situation is described by a number, n, of radios suddenly being deployed/activated in sync. and needing to establish optimum slot watching. This simplification was useful to explain the basic tenets of the algorithm. However, the reality is that the number of radios in a partition gradually grows from unity and that the slot sharing algorithm must operate near optimally during this growth.

Inevitably this growth involves a large number of special cases which ideally are handled by specific tests and corresponding actions. Within the model, a rule base has been constructed consisting of about 30 rules for these specific cases. In many situations it is possible to avoid or minimise the need for randomness in the choices made because every radio is able to exploit the uniqueness of its situation.

Conflicts can arise in the operation of the sync. algorithm where different representatives of two partitions attempt to initiate synchronisation simultaneously. Consider Figure 19.

Two partitions are shown, 1 & 2. Radios A and B perform a handshake for establishing synchronisation at a similar time to radios C and D. Unless they both make the same decision as to which partition should move and by how much then a conflict will arise.

The most effective way to avoid a conflict in the timing updates between radios is for all members of each partition to be aware of the number of radios in its partition. Once established this permits a majority decision to made upon which partition should update, i.e.

the partition with the larger number of radios will not update. This is better than making a random choice because it resolves conflicts and because it ensures that the minimum number of radios make updates.

For networks of arbitrary size, the determination of the number of radios in a partition is a non trivial problem. It is important to retain a nodeless approach to the process to avoid the generation, even temporarily, of key nodes within the network. Moreover, very large networks may require considerable control traffic associated with the counting process.

The approach adopted for counting radios in the partition is fully nodeless and results in a time to count for the partition which increases with the number of radios in the network but which does not require increasing control traffic levels.

The principle is as follows: Radios make transmissions within the partition for the purpose of conveying radio count information. Using the information contained in these transmissions radios maintain a list of other radios which they know to be members of the partition. The radios use this list to construct further such transmissions, broadcasting the list (or, more generally, parts of it) to other radios. The process is illustrated in Figure 20. The initial generation of radio lists is seeded by each transmission including the name of its source. Initially, each radio's list will contain only the names of its immediate neighbours.

However, in due course, as a radio's neighbours start to send transmissions including the names of their neighbours, it will obtain entries for increasingly remote equipments.

As described so far, the algorithm is unable to remove entries for radios which have, for any reason, left the partition. In principle, transmission containing such entries could "bounce around the network for ever". To cater for this case each entry in the list has an associated "lifetime" number. This is set to an initial, system determined, value when the name is first received as the identity of the source of a transmission. The lifetime number is transmitted with the equipment name in all count update transmissions. At the start of every synchronisation frame, the lifetime number of all entries in each equipment's radio list are decremented and any entries in which the number has reached zero removed. Thus, for an initial lifetime value of 3, an equipment's entry will remain in the system for a maximum of three frames after it has gone.

The choice of value for the initial lifetime is a compromise.

Small values will ensure rapid updating following the loss of an equipment. However, for widely spaced networks requiring many rebroadcast steps, if the lifetime entry is too small then some entries may be removed before they have reached the extremities of the network. The effect of this is that radios in the centre of the deployment retain a more accurate count of the number of radios than those at the edge. A refinement to the algorithm in which the initial lifetime parameter is made adaptive on the state of the network is under consideration. This would make the counting of radios in small networks more responsive to lost radios than in large networks.

An additional refinement to the algorithm is necessary. In the above form, the length of the individual transmissions would need to grow without limit with the size of the network. For example, in a deployment of 100 radios, every transmission would contain the name of all one hundred. This is undesirable since the control traffic would begin to encroach on the space available for user traffic.

Moreover, it is unnecessary since radios generally have several neighbours and can maintain their radio count on the basis of information received in transmission from all of them.

The approach adopted is to make each transmission contain a random subset of those held in the radio list whenever it contains more entries than can be sent in a single transmission. Figure 21 shows a deployment of radios and their associated tables. The circles indicate the regions of connectivity, i.e. the all informed group areas.

In the initial stage, no information is contained in the tables. Thus the only information transmitted is the identity of the source. The entry in the lower right had corner of each table is the current perceived number of radios in the network.

In fact, within any frame, a count transmission is sent on each of the three watch slots (not necessarily contiguously) to ensure that all immediate neighbours have a chance of hearing at least two of them. In order to maximise efficiency, it is arranged that the random subsets of the radio list contained on each of the transmissions are non overlapping.

Finally, to illustrate the process, consider Figures 21 to 24.

In Figure 22, we see the deployment after one transmission frame. There is now an entry for each of the immediate neighbours of each radio. Note that the lifetime entry associated with each radio in the table is set to 3.

In Figure 23, we have the position after a further frame. Note that the lifetime counter for the immediate neighbours is still 3. This is because it has been reset following reception from the neighbours.

However, at the start of the frame it had been decremented to 2 for all entries and this was the figure which applied when each radio sent its contents. Thus the entries in the table for "neighbour's neighbours" have the value 2 for their lifetime entry.

Note that the radios near the centre of the deployment already have the correct count for the radios in the network.

Figure 24 shows the network in the steady state condition.

Following the arguments for Figure 23, it is apparent why the lifetime counter for some entries has fallen to 1. Additional radios on the extremes of the network would not have accurate counts on this basis.

Note that the example does not illustrate the case where only a subset of entries can be transmitted. This makes the operation of the algorithm somewhat undeterministic and therefore difficult to illustrate. However, modelling has shown it to be effective.

One important object of the present invention is to achieve system wide sync. in a totally nodeless fashion (i.e. without any master(s) in the network(s)). Achieving this is a particularly interesting problem in the area of handling small timing errors and achieving a global mean.

The obvious approach is for every radio to update its timing to that of all others. However, if this is done then individual new radios just joining a large partition of radios have the power to pull other radios away from the median in a way which does not make for stable small errors.

A compromise approach is proposed in which, rather than removing the timing error between a received signal and the receiver clock, the error is reduced to a fraction 1/V of its previous value where V is a constant greater than one, chosen to provide a compromise between stability and speed of response. The value of V is typically between two and four, this approach is referred to as exponential updating.

As an example consider the simple scenario illustrated in Figure 25. The three radios have mutual propagation delays of 100 ss secs and timing errors of +1,+0.5 and -0.5 ms with respect to some arbitrary "perfect" time. The presence of the propagation delays throws into question the meaning of common time. This can be viewed in terms of the diagram shown in Figure 26.

The definition of common time is as follows:- A set of radios is in sync. if, should they elect to transmit at the same time according to their local clocks, the transmissions will be received simultaneously at some point in space perpendicularly above the centroid of the deployment and at some arbitrarily large distance.

Thus the concept of common timing is meaningful. The deployment of radios operating exponential updating is illustrated by the performance shown in Figure 27. The effect is that there is a hunting of radio timing about the area median value as each of the radios attempts to adjust its time towards the timing of the signal received, which is later than the time at which the signal was transmitted. Moreover, the continuing updating results in a general trend of increasing delays with time. Thus, on average, the clocks tend to run slow. Both of these effects can be ameliorated by reducing the updating coefficient. Figure 28 shows the effect of using a figure of 25% (Note that the horizontal axis is compressed and note that the errors between the radios is significantly reduced).

In the previous case it was assumed that the clocks in the radios started with errors but that they were running accurately. We now consider the case where there is an error in the clock speed. This illustrated in Figure 29 which shows the previous case but with specified clock speed errors.

Note that the clock speed errors are specified per transmission.

This simplifies the analysis and is reasonable on the basis that transmissions are made at regular intervals. Figure 30 shows the effect of clock errors on the timing errors for 25% update coefficient (i.e. each radio reduces its error from the received transmission by 25%).

The average difference between radio timings is now approximately 200 ji s, i.e. 4 times the clock speed error per transmission. This is intuitively understandable on the basis that the steady state is reached when the error increase between transmissions is equal and opposite to the update made on receipt of the transmission. If the error is 200 J1S, on average then it will be a little over this value just before receipt of a transmission and will be reduced by 25% on receipt of the transmission - i.e. by 50 ji s. The clock error during the next interval will make up this 50 ji s. Thus we see that the steady state error is multiplied by the reciprocal of the update coefficient - in this case 4.In order to reduce the errors it is desirable to increase the update coefficient as far as possible. The effect of increasing it to 50% is shown in Figure 31.

Here we see that the error between radios has reduced to 100 ji s but that the rate of drift has increased back to that of Figure 27.

Drift is not a problem per se within a synchronised network but rapidly becomes a difficulty as soon as a radio leaves the network temporarily. In this case the absentee will soon stop drifting with the network and will rapidly become unsynchronised. It is desirable, therefore to eliminate the systematic drift if at all possible.

This section presents a novel algorithm for eliminating drift due to propagation delays between radios. Every radio is able to keep a log of the updates which it has made in the previous frame. This information may be used to compensate the clock speed of the equipments for drifts due to propagation delays. If an equipment uses the information which it holds locally to perform the updating then the effect is self defeating - it will compensate for updates caused by propagation delays and caused by genuine clock speed error. The effect is that such compensation causes the compensated equipment to drift away from the others as though no fine synchronisation procedure were in operation.

However, if the equipments convey, in their transmission, their log of updates in the previous frame then the equipments can compensate for the updates using a spatial average of the updates performed. If all radios do this then this average will relate only to the effect due to propagation delays. In addition exponential time averaging of the spatial average may be applied in order to smooth out randomness in transmission times etc.

Figure 32 shows the effect of applying the compensation algorithm to the three radio deployment of Figure 25 (i.e. with no clock speed errors).

It will be noted that the curves of timing slope upwards toward horizontal as the information is accumulated and the time averaging takes effect (a time averaging coefficient of 50% is applied). Figure 33 illustrates the effect of compensation on the three radios deployment with clock speed errors (as per Figure 31).

In this case the steady state error between radios is modest and the long term drift has been eliminated. It is noteworthy that the drift of the radios is zero because the average of the clock speed errors in the example is zero. In a general case the drift will be equal to the average clock speed error of the radios in the network.

This is advantageous because it means that the drift of the network will tend to be smaller than the drift of an individual radio. Thus the time for an absent radio to drift out of sync. will be dependent largely upon its clock speed error without the need to consider the drift of the network to the same extent.

Claims (10)

1. A radio communication system comprising a plurality of radio transceivers which are mutually synchronised to define a synchronised group or partition by means of data transmitted on a synchronisation channel, which synchronisation channel is additional to a channel used exclusively for the transmission of traffic data, the synchronisation and transmission channels being utilised on a time division multiplex basis such that the traffic channel and the synchronisation channel are never utilised contemporaneously by any one radio transceiver, the traffic channel data being redundantly coded such that its absence for limited periods during which synchronisation transmissions are monitored is tolerated without a breakdown of traffic communication in the traffic channel, the channel monitoring operations by the radio transceivers of the group or partition being arranged to operate in interdependence such that a predetermined proportion of the radio transceivers are at all times monitoring the sync channel, whereby synchronisation with other groups or partitions is facilitated such that synchronisation tends to be achieved between a plurality of such groups or partitions in mutual communication.

2. A system as claimed in Claim 1, wherein the said interdependence is achieved by means of an algorithm which serves to control operation as follows: a) each radio transceiver is arranged to monitor the synchronisation channel for a slot period which equates to a predetermined fraction 1/Q of available operating time, where Q is an integer, the choice of slot period being made initially at random by each radio transceiver within a group or partition, b) all radio transceivers are arranged to broadcast periodically data appertaining to their current slot period chosen for synchronisation monitoring purposes and, c) all radio transceivers are arranged to update their slot period having regard to received data which appertains to the slot period selected by neighbouring transceivers.

3. A system as claimed in Claim 2, wherein Q = 3 and the number of radio transceivers in a group or partition is 3, wherein the radio transceivers are arranged to update their choice of synchronisation watching slot period according to the following algorithm: a) if the slot period used by a radio transceiver differs from the slots used by the said neighbouring radio transceivers then the radio transceivers in question retains its current slot period, b) if the slot period used by a radio transceiver is the same as the slot period used by one of the neighbouring transceivers but not the other, then the radio transceiver in question makes a random choice between retention of its current slot period and changing to the slot period which is so far unused and, c) if the the radio transceiver in question is currently using the same slot period as both of its neighbours then that transceiver will randomly select a new slot period from the three available.

4. A system as claimed in Claim 3, except that the number of radio transceivers in a group or partition is greater than three and that the neighbouring transceivers considered for the algorithm are limited to two by means of selecting the two neighbouring radio transceivers which are received with the strongest signal.

5. A system as claimed in Claim 4, wherein the neighbouring radio transceivers which are the subject of the the algorithm are restricted to two by firstly selecting the three signals received with the greatest signal strength and then secondly randomly selecting one of the three which is then rejected.

6. A system as claimed in Claim 1, wherein the said interdependence is achieved by means of an algorithm which serves to control operations as follows: a) each radio transceiver is arranged to monitor the synchronisation channel for S predetermined slot periods out of every Q where Q is an integer being the number of slot periods and where Q is greater than the number of radios R in the group or partition and where S is determined as being the smallest integer which is greater than or equal to Q/R, the choice of S slot periods being made initially at random by each radio transceiver within a group or partition, b) all radio transceivers are arranged to broadcast periodically data appertaining to their current slot period chosen for synchronisation monitoring purposes and, c) all radio transceivers are arranged to update their slot period having regard to received data which appertains to the slot period selected by neighbouring radio transceivers.

7. A system as claimed in Claim 6, wherein Q = 3, R = 2 and S = 2, the choice of synchronisation watch slot periods being made according to the following algorithm, a) if the slot period not being used by a radio transceiver is the same as the slot period not being used by its neighbour, then the slot period to be rejected is selected randomly, b) if the slot periods not being used by a radio transceiver is different from that not being used by its neighbour then the slot period in use is retained.

8. A system as claimed in Claim 1, having radio transceivers each of which is arranged to switch its operational mode between a system as claimed in Claim 3, a system as claimed in Claim 4, and a system as claimed in Claim 7, in dependence upon the number of radio transceivers with which it is in synchronised communication.

9. A system as claimed in Claim I, having radio transceivers each of which is arranged to switch its operational mode between a system as claimed in Claim 3, a system as claimed in Claim 5 and a system as claimed in Claim 7, in dependence upon the number of radio transceivers with which it is in synchronised communication.

10. A system as claimed in Claim 1, and substantially as hereinbefore described with reference to the accompanying drawings.