Abstract:
In a multiple access system for performing packet communication involving sharing of a single communication medium by a plurality of users, the single communication medium is divided into a plurality of channels. Each user monitors the condition of each channel, and probability of packet transmission to each channel is controlled in accordance with a monitored result.

Description:
BACKGROUND OF THE INVENTION 
     1. Field of the Invention 
     The present invention relates to multiple access system and method of packet communication involving the sharing of a single communication medium such as a single satellite by a plurality of users. 
     2. Description of the Prior Art 
     TDMA (time division multiple access) and ALOHA are well-known as multiple access systems using a shared communication medium such as a satellite shown in FIG. 1. The TDMA scheme divides a channel into time slots at intervals comprising one-packet transmission time. When the number of users is N (positive integer), N slots are given as one frame. Each slot of the frame is permanently assigned to each user. The TDMA scheme is very effective when the number of users is small and a heavy traffic load occurs. However, when the number of users is large and only a light traffic load occurs, the utilization efficiency of the channel is degraded, and an average delay time is increased, resulting in inconvenience. Furthermore, the TDMA scheme is not suitable when changes in the traffic load are great. The ALOHA system includes a basic ALOHA scheme and a slotted ALOHA scheme. The slotted ALOHA scheme is an improvement upon the basic one and will be described hereinafter. In the slotted ALOHA scheme as shown in FIG. 2, a channel is divided into time slots in the same manner as in the TDMA scheme. If a user wants to transmit a packet, he immediately transmits a packet in synchronism with the given time slot. If packets from the plurality of users collide with each other, retransmissions are performed at random. The slotted ALOHA scheme is very effectively utilized when the number of users is great and a traffic load is light (i.e., a low load is imposed). However, a maximum throughput of this scheme is as low as 0.368 with respect to a channel capacity defined as 1. When a number of packets which exceeds the maximum throughput is transmitted, collisions frequently occur, resulting in a deadlocked condition. 
     When the number of users is great and the traffic load varies in a wide range, the conventional schemes (i.e., the TDMA and slotted ALOHA schemes) cannot be applied. In order to compensate for the drawbacks of the conventional schemes, an optimal adaptive scheme for multiple access broadcast communication is proposed to automatically select one of the ALOHA and TDMA modes as needed, as described by L. Kleinrock and Y. Yemini, &#34;An Optimal Adaptive Scheme for Multiple Access Broadcast Communication&#34;, ICC Conf. Proc., Chicago, IL., June 1977. The ALOHA mode is adopted in the case of a light traffic load, while the TDMA mode is adopted in the case of a heavy traffic load. In order to perform the above operation, however, a total number of users requesting packet transmission must be signalled to each user. Therefore, information indicating the total number of users requesting packet transmission must be transmitted to each user through a subchannel, resulting in inconvenience. According to a scheme described by Glenn Ricard and Ashok K. Agrawala, &#34;Dynamic Management of Packet Radio Slots&#34;, presented at the Third Berkely Workshop on Distributed Data Management and Computer Networks, August 1978, each user first uses the ALOHA mode while monitoring the channel. When the traffic load on the channel becomes heavy, the mode is switched to the TDMA mode. Furthermore, when an empty slot occurs in the TDMA mode, this time slot is set in the ALOHA mode again. A subchannel is not required in the above-mentioned scheme. However, where a few users frequently transmit packets to render the channel busy, even if the ALOHA mode is switched to the TDMA mode, the remaining users cannot transmit packets. In order to eliminate this inconvenience, predetermined time slots must be allotted to those users who most frequently transmit packets. In other words, in this scheme, an additional allocation operation is required. Therefore, this conventional scheme is difficult to update in accordance with a change in the number of users. In fact, practical implementations for this scheme have not yet been proposed. 
     SUMMARY OF THE INVENTION 
     It is a major object of the present invention to provide a multiple access system and method which allow effective utilization of a channel under distributed control even if a traffic load of each user varies in a wide range. 
     Another object of the present invention is to provide a multiple access system capable of performing an ALOHA mode during light traffic and assigning time slots to each user in accordance with TDMA mode during a heavy traffic. 
     Still another object of the present invention is to provide a multiple access system capable of preventing shutout of the user. 
     Still another object of the present invention is to provide a multiple access system capable of properly assigning time slots to each user even in the case of an irregular, high traffic load. 
     According to one aspect of the invention, there is provided a method for performing packet communication in a multiple access system comprising: 
     sharing a single communication medium by a plurality of user stations through a plurality of channels; 
     monitoring by each user station of the state of each channel; and 
     controlling the probability of packet transmission in accordance with the monitored result. 
     According to another aspect of the invention, there is provided a multiple access system for performing packet communication involving sharing of a single communication medium by a plurality of users through a plurality of channels such that each user monitors a state of each channel and the probability of packet transmission is controlled in accordance with the monitored result, comprising: 
     an interface section for linking data together as a packet; 
     a modem section for modulating/demodulating a packet, said modem section including 
     a carrier detector for detecting whether or not the channel is being used and for generating one of empty and busy signals; 
     a network control section for performing access control, said network control section including 
     a collision detector for detecting a transmitting packet and a delayed receiving packet so as to detect a collision of the transmitting packet with another transmitting packet, said collision detector generating a success signal when the transmitting packet and the delayed receiving packet coincide with each other and a collision signal when the transmitting packet and the delayed receiving packet do not coincide, 
     a retransmitter for retransmitting a packet identical with the transmitting packet when the transmitting packet collides with said delayed receiving packet, and 
     a control circuit for receiving a slot sync pulse, one of the busy and empty signals, one of the success and collision signals, and a packet arrival pulse, and for generating a control signal to control packet transmission; and 
     an RF section for converting an IF signal to a high frequency transmission signal and vice versa. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     FIG. 1 shows the principle of satellite communication; 
     FIG. 2 shows a slotted ALOHA scheme; 
     FIG. 3 shows a frame consisting of L time slots and useful in explaining the principle of this invention; 
     FIG. 4 shows a transmission model for j-th user in accordance with this invention; 
     FIG. 5 is a block diagram showing the basic arrangement of a multiple access system incorporating the present invention; 
     FIG. 6 is a block diagram of a modem section (54) of the system shown in FIG. 5; 
     FIG. 7 is a block diagram showing a first embodiment of a network control section (53) of the system shown in FIG. 5; 
     FIG. 8 is a block diagram of one embodiment of a control circuit shown in FIG. 7; 
     FIG. 9 is a block diagram of an arithmetic operation circuit 81 shown in FIG. 8; 
     FIG. 10 is a block diagram of another embodiment of the control circuit shown in FIG. 7; 
     FIG. 11 is a block diagram of an arithmetic operation circuit (1004) shown in FIG. 10; 
     FIG. 12 is a block diagram showing a second embodiment of the network control section of the system shown in FIG. 5; and 
     FIG. 13 is a block diagram of a control circuit in FIG. 12. 
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT 
     Preferred embodiments of the present invention will be described with reference to the accompanying drawing. The principle of a multiple access system according to the present invention will first be described. 
     As shown in FIG. 3, in slotted ALOHA, time is divided into slots of duration equal to a single packet transmission time. Consecutive L slots form a frame as in TDMA. A retransmission algorithm identical to that of slotted ALOHA is employed. On the above framework a new parameter set, Pij&#39;s, is introduced. 
     As is shown in FIG. 4, when j-th user has Pij&#39;s (i=1-L), a conditional probability is assigned to its i-th slot, with which it transmits a packet when it has any. The role of the parameter set is well illustrated by the following two extreme cases. 
     If all Pij&#39;s are fixed to unity, the notion of the frame disappears and slotted ALOHA is obtained. Throughout the specification this situation is called the ALOHA mode. 
     If the size of the frame is set equal to the number of the users N and Pij&#39;s are selected as ##EQU1## then, the system works as TDMA. We refer to this pattern of Pij&#39;s as the TDMA mode. 
     It can be easily imagined now that if it is possible to adjust the parameters depending on the channel traffic, efficient access schemes will emerge. In fact, as will be shown later many adaptive strategies proposed previously can be regarded as to have the parameter set implicitly and they are characterized by the way in which the virtual parameter are adjusted. 
     According to this invention, a scheme is proposed in which the parameters are adaptively adjusted so as to maximize the channel throughput. The slotted ALOHA throughput is given by the well-known formula ##EQU2## where Gj is tne probability that j-th user wants to transmit a packet in some slot (see N. Abramson, &#34;The throughput of packet broadcasting channels&#34;, IEEE Trans. Commun., vol. COM-25, pp. 117-128, January 1977). Applying (1) to each slot of all users, the system throughput taking Pij&#39;s into account is obtained as ##EQU3## 
     To maximize cost function a simple gradient search algorithm is employed. The conditional probability P ln  associated with the l-th slot of the n-th user, is updated at m-th time frame by ##EQU4## where α is a positive adaptation constant. By taking a partial derivative of (2) with respect to P ln , the gradient is given as ##EQU5## 
     Equation (4) implies that the gradient can be expressed in terms of the probability of two events. Let A ln  be the event &#34;the l-th slot is open for the n-th user&#34; and let B be the event &#34;only one user other than the n-th transmits a packet at the l-th slot&#34;. Then, the first term in the brace of (4) is Prob [A ln  ] and the second is Prob [B ln  ]. It is to be noted here that those two events are not common to all users but they are defined for each user. Also noteworthy is that the frame need not be synchronized among users, in other words, the l-th slot of the n-th user need not be the l-th slot of the m-th user. 
     Assuming that the collision between other users&#39; packets can be detected, each user can observe or monitor whether the events defined to its own occur or not. The probability of these events and consequently the gradient can be estimated from repeated observations or more practically by the stochastic gradient method. A natural definition of the stochastic gradient δ n  is as follows: ##EQU6## where C ln  denotes the event &#34;more than two users, except for the n-th, transmit at the l-th slot&#34;, i.e., A ln  U B ln . 
     However, an obvious drawback will arise if the above definition is applied to the adaptation. Since, if all Pij&#39;s and Gi&#39;s happen to be unity, the values of Pij&#39;s will never be changed any more and system deadlock results. This is because the original cost function is not well conditioned over the parameter space to justify the gradient algorithm and the above situation can be regarded as a trap. In the trap state the event C ln&#39;s  or the collisions are always observed. Therefore, an intuitive remedy to avoid getting into this is to evaluate the stochastic gradient negative so that Pij&#39;s are decreased when the event C ln  is encountered. The reason for decreasing the Pij&#39;s is not only because there is no way to increase, but because it is justified by the following consideration. The outcome of the event C ln  decreases both Prob [A ln  ] and Prob [B ln  ]. But as G i  &#39;s tend to increase due to the collisions, decrease in the former is greater than that in the latter. Thus, if the system model includes feedback effects, a natural directlon to move Pij&#39;s upon collisions is negative. 
     Then, an extremely simple algorithm ##EQU7## with δ ln  positive for A ln , negative for A ln  is reached. This means that as shown in the following Table, each user increases its parameters if no one else is there and decreases them if someone else is there in the slot. Since Pij&#39;s are the probabilities, additional operations limiting them between 0 and 1 are needed besides (6). 
     
                       TABLE______________________________________The adaptation algorithm     OTHERSSELF        IDLE         TRANS______________________________________IDLE        (EMPTY)      (NON-EMPTY)       INCREASE     DECREASETRANS       (SUCCESS)    (COLLISION)       INCREASE     DECREASE______________________________________ 
    
     For some simple traffic models, the behavior of the algorithm can be predicted without resorting to a computer simulation. When every user has low traffic rate, channel empty is more frequently encounterd than the other events. Thus, all the Pij&#39;s keep on increasing until they reach unity making the system converge to the ALOHA mode. 
     If the traffic of all users increases, collisions begin to dominate and all Pij&#39;s decrease toward zero, but due to statistical fluctuations a particular user&#39;s i-th slot probability, say Pin, remains greater than that of the other users. Since it is quite natural in this situation to assume that each user has a number of packets to transmit in the buffer, a user with larger conditional probability will have greater probability of success. Therefore, once the above situation is reached, the n-th user will increase its Pin forcing the others&#39;P ik  &#39;s (K≠η) to zero. In like manner, other slots will be occupied by other users. If the traffic rate is equally high among users, each user will have one slot to its own and the TDMA mode results. 
     As the adaptation algorithm given in the previous Table has a high degree of freedom, a situation that some users occupy the whole channel and some are shut out of the system may occur. This seems somewhat awkward from a practical point of view. Therefore, maximizing the throughput under the constraints ##EQU8## is preferred in practical applications. This is done by introducing Lagrange multipliers λn&#39;s. The adaptation algorithm (6) is modified as ##EQU9## where β is an adaptation constant, and η n  is the minimum number of slots which j-th user requires. 
     The constraints, however, should not always be rigid. Because, if the algorithm tries to keep satisfying the constraints even when there exists heavy traffic beyond the channel capacity, throughput decreases and the channel capacity cannot be attained. Avoiding this is done by limiting λn&#39;s not to exceed unity. 
     Referring now to FIG. 5, an overall construction of a multiple access system on a time multiplexed basis incorporating the present invention will be described. An input/output terminal 51 is connected to a data terminal device. An interface section 52 processes data transmitted from the data terminal device to the terminal 51 so as to link data together as a packet. The packet is then supplied to a network control section 53. The interface section 52 also decomposes the pocket from the network control section 53 and sends it to the data terminal device through the terminal 51. 
     The network control section 53 mainly performs access control. A modem section 54 performs modulation and demodulation. An RF section 55 increases a frequency of an IF signal to a transmission frequency. The signal having the transmission frequency propagates through a transmitting antenna. The RF section 55 also decreases the frequency of a signal received at a receiving antenna to produce an IF signal. The IF signal is then supplied to the modem 54. The basic configuration of the apparatus is the same as that of the slotted ALOHA scheme, but the internal arrangements of the network control section 53 and the modem 54 greatly differ from those of the slotted ALOHA scheme. 
     FIG. 6 is a block diagram of the modem section 54 shown in FIG. 5. An input terminal 61 and output terminals 62, 63 and 64 of the modem section 54 are connected to the network control section 53. Input and output terminals 66 and 65 of the modem section 54 are connected to the RF section 55. A modulator 67 receives and modulates the packet transmitted through the input terminal 61 and produces the modulated data from the output terminal 65. A demodulator 68 receives and demodulates the modulated signal from the input terminal 66 and produces a demodulated signal to the output terminal 64. 
     A carrier detector 69 detects whether or not the channel is busy. More particularly, the carrier detector 69 detects a level of the modulated signal to be supplied to the demodulator 68. If the signal level exceeds a predetermined threshold, the carrier detector 69 determines that the channel is busy and then generates a busy signal. Otherwise, the carrier detector 69 determines that the channel is empty and then generates an empty signal. The busy or empty signal is supplied to the network control section 53 through the output terminal 62. A slot sync signal detector 600 extracts a slot sync signal which continuously propagates along the channel and supplies a sync pulse to the network control section 53 through the terminal 63. 
     The modulator 67, the demodulator 68 and the slot sync signal detector 600 are arranged in an apparatus for performing the slotted ALOHA scheme. The modem section 54 also has the carrier detector 69, as described above. 
     FIG. 7 is a block diagram of a first embodiment of the network control section 53. 
     Input and output terminals 71 and 72 of the network control section 53 are connected to the interface section 52. An output terminal 73 and input terminals 74 to 76 of the network control section 53 are connected to the modem section 54. The packet supplied to the input terminal 71 is temporarily stored in a buffer 77. When a gate circuit 78 is turned on, the packet is supplied to the modem section 54 through the output terminal 73. The gate circuit 78 is turned ON/OFF in accordance with a gate control signal from a control circuit 79. 
     The packet is also supplied from the gate circuit 78 to a delay circuit 700. The delay circuit 700 delays the packet from the gate circuit 78 by a propagation delay time. The delay signal is then supplied to a collision detector 701. The collision detector 701 serves to detect whether or not the received packet collides with a packet from any other user station. It is here noted that each channel is assumed to be a broadcast channel, so that a packet transmitted from a given user station can be received by the same. The collision detector 701 compares the packet received at the terminal 76 with the packet from the delay circuit 700. If the collision detector 701 detects a coincidence between these packets, it generates a success signal. Otherwise, the collision detector 701 geneates a collision signal. A retransmitter 702 generates a collision signal. A retransmitter 702 temporarily receives the packet from the delay circuit 700. When the collision signal from the collision detector is supplied to the retransmitter 702, the retransmitter 702 delays the packet from the delay circuit 700 in accordance with a given distribution. The delayed packet is returned to the buffer 77. However, when the success signal is supplied to the retransmitter 702, the retransmitter 702 removes the packet. An address filter 703 only extracts a packet (among the packets supplied to the terminal 76) which is addressed thereto. The selected packet is then supplied from the address filter 703 to the interface section 52. The control circuit 79 receives the busy or empty signal from the terminal 74, the slot sync pulse from the terminal 75, an arrival pulse from the buffer 77, and the success or collision signal from the collision detector 701. The control circuit 79 then controls the gate circuit 78 in accordance with the above-mentioned input signals. Thus, it will be appreciated that terminals 61, 62, 63 and 64 of the modem section 54 are connected to termials 73, 74, 75 and 76 of the network control section 53, respectively. The control circuit 79 will be described in detail hereinafter. 
     FIG. 8 is a block diagram of one embodiment of the control circuit 79. The control circuit 79 receives the slot sync pulse, the busy or empty signal, the success or collision signal, and the packet arrival pulse at input terminals 704, 705, 706 and 707, respectively, and generates a control signal from its output terminal 708 so as to control the ON/OFF operation of the gate circuit 78. A counter 709 counts slot sync pulses in units of L (one frame). Present count data I (corresponding to a given slot number l) of the counter 709 is decreased by the number of slots corresponding to the transmission delay time in units of L so as to obtain data I&#39; (corresponding to a slot number l&#39;). The counter 709 supplies only the data I&#39; to an arithmetic and logic circuit 81 through a selector 800. This is because two slot numbers are required when a packet is transmitted during a given slot and is received during a different lot under the conditions of a lengthy transmission delay. 
     The selector 800 reads out a parameter P l  corresponding to the slot number l and a parameter P l  &#39; corresponding to the slot number l&#39;. The parameter P l  is supplied to a pattern generator 83, and the parameter P l  &#39; is supplied to the arithmetic and logic unit 81. The arithmetic operation unit 81 updates the parameter P which is then stored in a memory 82. The pattern generator 83 uses as the probability data the parameter from the selector 800 and supplies the control signal to the gate circuit 78 through a terminal 708. The gate circuit 78 is then turned on. Thus, it will be appreciated that terminals 74 and 75 in FIG. 7 correspond to terminals 705 and 704 in FIG. 8, respectively, and that terminals 706, 707 and 708 in FIG. 8 are connected to collision detector 701, buffer 77 and gate circuit 78 in FIG. 7, respectively. 
     FIG. 9 is a block diagram of the arithmetic operation unit 81. The arithmetic operation unit 81 receives the busy or empty signal, the success or collision signal, the packet arrival pulse, and the slot number (l&#39;) data at input terminals 84, 85, 86 and 87 thereof, respectively. The arithmetic operation unit 81 then generates/receives the parameter P l  &#39; through the terminal 88. Thus, it will be appreciated that terminals 84, 85 and 86 in FIG. 9 correspond to terminals 705, 706 and 707, respectively, and that terminals 87 and 88 in FIG. 9 are respectively connected to counter 709 and selector 800 in FIG. 8. A functon generator 89 generates function data δ in response to the signals supplied to the terminals 84 and 85 as follows: ##EQU10## The function data is then supplied to an arithmetic operation circuit 90. The arithmetic operation circuit 90 performs the following operation in acordance with the function data δ from the function generator 89 and the Lagrangean constant updated by an arithmetic operation circuit 91 through an arithmetic operation circuit 93: 
     
         (i) W.sub.1 ←P+α(δ+λ)              (11) 
    
     and subsequent ##EQU11## where α is a small positive number. The parameter P obtained from expression (28) is supplied as the updated parameter P l  &#39; from the terminal 88 to the memory 82 and is stored therein. At the same time, the following operation is performed: 
     
         Q←Q+P                                                 (13) 
    
     where Q is ΣP l  and the obtained Q is retained. 
     An averaging circuit 92 averages the number of input pulses from the terminal 86 so as to obtain an arrival frequency σ. The arrival frequency is multiplied by L which is the number of channels. Product or resultant data σL corresponds to the number of slots required by the user. As the slot number changes from L to 1 with the slot number data supplied from the counter 709 through terminal 87, the arithmetic operation circuit 91 receives the constant λ and the data Q from the arithmetic operation circuit 90 at the terminal 87 thereof and performs the following operation; ##EQU12## and subsequent ##EQU13## here β is a small positive number. The computed Q and are returned to the arithmetic operation circuit 90. 
     The arithmetic operation circuit 93 computes data obtained from the arithmetic operation circuit 91 as follows: 
     
         λ←min {λ,λ.sub.0 } for λ.sub.0 ≲1 (16) 
    
     The computed result is supplied to the arithmetic operation circuit 90. The data q obtained from the arithmetic operation circuit 91 is also supplied per se to the arithmetic operation circuit 90. 
     It should be understood that in the arithmetic operation circuit 81 as materialized in the form of the FIG. 9 arrangement, constraints of expressions (14) and (16) are held so that in addition to the basic operation of the multiple access system wherein an ALOHA mode is performed during a light traffic and time slots are assigned to each user in accordance with a TDMA mode during a heavy traffic, it is possible to properly assign time slots to each user even in the case of an irregular, high traffic; if the averaging circuit 92 is eliminated, σL=1 stands in expression (14) so that in addition to the basic operation, it is possible to prevent shutout phenomenon although the proper assignment of the time slots is not assured; and if the arithmetic operation circuits 91 and 93 and the averaging circuit 92 are eliminated, λ=0 stands in expression (11) so that only the basic operation is assured, being subject to the shutout phenomenon. 
     The arrival frequency σ of the transmitted packet is used in the above embodiment. However, an arrival frequency σ which includes the retransmitted packets may alternatively be used. Furthermore, if the minimum required number of slots is defined as L 0 , and σL&lt; L 0 , L 0  may be given instead of σL. In this case, even if the traffic load is very light, a given user station can request L 0  slots. Instead of σL, the number of packets stored in the buffer 77 may be used to determine the degree of communication necessity. Alternatively, the degree of communication necessity may be determined in accordance with a priority order of received packets. 
     FIG. 10 is a block diagram of another embodiment of the control circuit 79 shown in FIG. 7. In this embodiment, the slot sync pulse, the busy or empty signal, the success or collision signal and the packet arrival pulse are also received at input terminals 704, 705 and 706, respectively, as in FIG. 8. The control circuit then generates a gate control signal to control the ON/OFF operation of the gate circuit 78 through the output terminal 708. A counter 709 counts slot sync pulses in units of L (one frame). Present count data (corresponding to a given slot number l) of the counter 709 is decreased by the number of slots corresponding to the transmission delay time in units of L so as to obtain (modified count) data l&#39;. The counter 709 supplies only the data l&#39; to an arithmetic operation unit 1000 through a selector 800. This is because two slot numbers are required when a packet is transmitted during a given slot and is received during a different slot under the conditions of a great transmission delay. 
     The selector 800 selects parameter data Pl corresponding to the slot number l and probability data P l  &#39; (to be also referred to as a parameter) corresponding to the slot number l&#39; from a memory 82 which stores L parameters. The parameter P l  is supplied to a multiplier 1001, and the parameter P l  &#39; is supplied to an arithmetic operation unit 1000. The arithmetic operation unit 1000 updates the parameter P l  &#39;, and updated data is returned to the selector 800. The selector 800 serves to store the updated data in the memory 82. 
     It should be noted that the arithmetic operation circuit 1000 updates the parameter P l  in accordance with an algorithm (e.g., P ln   T+  1=P ln   T  +αδ ln  for δ ln  =1 or -1, where T is the unit time corresponding to L slots, and α is a small positive number called a correction coefficient). 
     A selector 1002 reads out the parameter p from a memory 1003 and supplies this data to the multiplier 1001 and to an arithmetic and logic unit 1004. The parameter updated by the arithmetic and logic unit 1004 is stored in the memory 1003. 
     The multiplier 1001 multiplies the parameter P l  &#39; from the selector 800 with the parameter p from the selector 1002. Product data is then supplied to a pattern generator 83. In the pattern generator 83, the product data supplied from the multiplier 1001 is detected as a probability and generates a gate control signal which is supplied to the gate circuit 78 through the output terminal 707 in accordance with the obtained probability. 
     FIG. 11 is a block diagram of the arithmetic operation unit 1004 shown in FIG. 10. The arithmetic operation unit 1004 receives the success or collision signal from its input terminal 1005 (corresponding to terminal 706 in FIG. 10) and generates or receives a parameter p from its terminal 1006. A function generator 1007 generates a function value ξ as follows: ##EQU14## The function value ξ is supplied to an arithmetic operation circuit 1008. The arithmetic operation circuit 1008 updates the parameter p supplied to the terminal 1006 in accordance with the function value ξ as follows: 
     
         (i) W←P+rξ 
    
     and subsequent ##EQU15## where r is a positive constant. The function value ξ can be precisely set using the output signal from the carrier detector 69 (FIG. 6). The updated parameter is returned to the selector 1002 through the terminal 1006. 
     FIG. 12 is a block diagram of a second embodiment of the network control section 53. This network is substantially the same as that shown in FIG. 7, except that a channel collision detector 1020 is added, and that an output signal from the detector 1020 is supplied to a control circuit 1021 in place of the control circuit 79. The channel collision detector 1020 serves to detect errors in all received packets. When the channel collision detector 1020 detects a packet error, it determines that this packet is in collision with another packet. As a result, the channel collision detector 1020 generates a collision signal. 
     FIG. 13 is a block diagram of the control circuit 1021 shown in FIG. 12. The control circuit 1021 is substantially the same as the first embodiment of the control circuit 79 (FIG. 10), except that the control circuit 1021 receives the collision signal from the channel collision detector 1020 through a terminal 1021. 
     In the above embodiments, a plurality of channels are formed along the time base. However, the present invention can also be applied to a plurality of channels formed with respect to the frequency bandwidth.