JPH0611140B2 - Multi-access method - Google Patents
Multi-access methodInfo
- Publication number
- JPH0611140B2 JPH0611140B2 JP61166666A JP16666686A JPH0611140B2 JP H0611140 B2 JPH0611140 B2 JP H0611140B2 JP 61166666 A JP61166666 A JP 61166666A JP 16666686 A JP16666686 A JP 16666686A JP H0611140 B2 JPH0611140 B2 JP H0611140B2
- Authority
- JP
- Japan
- Prior art keywords
- station
- channel
- slave
- data transmission
- reference value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Landscapes
- Small-Scale Networks (AREA)
- Radio Relay Systems (AREA)
Description
【発明の詳細な説明】 〔産業上の利用分野〕 本発明は、ＬＡＮ（ローカルエリアネットワーク）や衛
星通信において、チャンネル割り当て作業を効率良く行
なうマルチアクセス方法に関する。The present invention relates to a multi-access method for efficiently performing channel assignment work in LAN (local area network) or satellite communication.
ＬＡＮや衛星通信において不特定多数の子局が不定時に
チャンネル割り当て要求を出す時、その割り当て作業を
効率良く行なうための取り決めとしてマルチアクセスプ
ロトコルがある。There is a multi-access protocol as an arrangement for efficiently performing the assignment work when an unspecified number of slave stations issue a channel assignment request at an undefined time in LAN or satellite communication.
ところが、従来のプロトコルでは、一度に多数の子局が
データパケットを送信すると、パケットの衝突が発生し
てパケットの再送信等が頻発し、伝送効率が極端に低下
するという問題があった。また、伝送を全く行なうこと
ができなくなる状態に陥る場合もあった。However, the conventional protocol has a problem in that when a large number of slave stations transmit data packets at the same time, packet collisions occur, packet retransmissions frequently occur, and transmission efficiency is extremely reduced. Further, there are cases where transmission cannot be performed at all.
本発明の目的は、多数の子局から同時にチャンネル割り
当て要求があった場合でも、上記したような衝突を避け
て、しかも効率良い割り当てを行なうことができるよう
にすることである。It is an object of the present invention to avoid the above-mentioned collision and to perform efficient allocation even when a plurality of slave stations request channel allocation at the same time.
このために本発明は、１個の制御局と、該制御局によっ
て複数のデータ伝送用チャンネルの内から１個のデータ
伝送用チャンネルの割り当てを制御用チャンネルを介し
て受けて、データ伝送を行なう複数の子局とを具備し、 上記子局の内のデータ伝送用チャンネルの割り当てを要
求する１又は２以上の子局で相互に異なる乱数を発生さ
せてこれを上記制御用チャンネルを介して上記制御局に
取り込み、上記制御局において確率基準値を発生してこ
れと上記乱数を比較し、 上記データ伝送用チャンネルの割り当てを要求した子局
が上記確率基準値と乱数とが特定の関係を持つ１個に絞
り込まれるまで上記確率基準値を順次変化して上記子局
での上記乱数発生および上記比較を繰り返し、 上記比較により絞り込まれた１個の子局に対して特定の
データ伝送用チャンネルを上記制御用チャンネルを介し
て割り当てるように構成した。To this end, the present invention performs data transmission by receiving one control station and one data transmission channel assigned from the plurality of data transmission channels by the control station via the control channel. A plurality of slave stations, wherein one or more slave stations requesting allocation of a data transmission channel among the slave stations generate random numbers different from each other, and generate random numbers through the control channel; Taken into the control station, the control station generates a probability reference value and compares it with the random number, and the slave station requesting the allocation of the data transmission channel has a specific relationship between the probability reference value and the random number. The probability reference value is sequentially changed until it is narrowed down to one, and the random number generation and the comparison are repeated in the slave station, and a specific one slave station is narrowed down by the comparison. The chromatography data transmission channel and configured to assign through the control channel.
以下、本発明の実施例について説明する。第１図はその
実施例の説明図である。本実施例では、まず制御局１を
１局設けて、データ伝送のスケジューリング、チャンネ
ル割り当て作業等を担わせる。２１〜２ｎはｎ個の子局
であり、制御局１からの指令によりデータの送信を行な
う。Examples of the present invention will be described below. FIG. 1 is an explanatory view of the embodiment. In the present embodiment, first, one control station 1 is provided to perform data transmission scheduling, channel assignment work, and the like. 2 1 to 2 n are n slave stations, which transmit data in response to a command from the control station 1.
いま、ＬＡＮや衛星通信を仮定する。また、その伝送路
が周波数分割、時分割、その他の方法によってｍ個の独
立したチャンネルに分割されているものとする。そし
て、その内の１チャンネルを制御用として使用し、残り
のチャンネルをデータ伝送用とする。Now, assume LAN and satellite communication. Further, it is assumed that the transmission path is divided into m independent channels by frequency division, time division, or another method. Then, one of the channels is used for control, and the remaining channels are used for data transmission.
さて、子局２１〜２ｎのいずれかが、そこからデータを
伝送する場合には、制御用チャンネルにデータを伝送す
るためのデータ伝送用チャンネル割り当ての要求信号
を、制御局１に対して出す。When any of the slave stations 2 1 to 2 n transmits data from the slave station 2 1 to 2 n , a request signal for data transmission channel allocation for transmitting data to the control channel is sent to the control station 1. put out.
そして、制御局１がこの要求を受けると、チャンネル割
り当てを行ない、その旨を制御用チャンネルを通じて該
当する子局にチャンネル割り当て情報を流し、これによ
り当該子局が割り当てられた特定のデータ伝送用チャン
ネルにデータパケットを送信するようにする。Then, when the control station 1 receives this request, it performs channel allocation, and to that effect, channel allocation information is sent to the corresponding slave station through the control channel, whereby the specific data transmission channel to which the slave station is allocated is transmitted. To send data packets to.
ところで、子局２１〜２ｎの内の非常に多くの局が制御
用チャンネルにチャンネル割り当て要求信号を出力する
と、制御チャンネル上でその信号がぶつかり合って、制
御局１では子局からのこの要求信号を受信できなくな
る。By the way, when a very large number of the slave stations 2 1 to 2 n output a channel allocation request signal to the control channel, the signals collide with each other on the control channel, and the control station 1 receives the signal from the slave station. The request signal cannot be received.
そこで、このような場合本実施例では、制御局１が、ま
ずある確率基準値信号Ｐａ（０＜Ｐａ＜１）を出し、子
局２１〜２ｎには各々独立に異なった乱数を乱数発生器
（図示せず）から発生するようにした。なお、この場合
当然ながら、子局２１〜２ｎのすべてが乱数を発生する
とは限らず、チャンネル割り当てを望んでいる子局のみ
が乱数を発生することになる。Therefore, in such a case, in the present embodiment, the control station 1 first outputs a certain probability reference value signal Pa (0 <Pa <1), and the slave stations 2 1 to 2 n each independently generate a different random number. It was generated from a generator (not shown). In this case, naturally, not all of the slave stations 2 1 to 2 n generate random numbers, and only the slave stations desiring channel allocation generate random numbers.
そして、各子局の発生した乱数の内、上記した確率基準
値Ｐａ以下の乱数を発生した子局を選別し、その子局に
チャンネル割り当て要求信号を出させるようにする。こ
の結果、その要求信号を出した子局が１局のみの場合に
は、その子局とチャンネル割り当てのスケジューリング
を行なう。Then, among the random numbers generated by each slave station, a slave station that generates a random number equal to or less than the above-mentioned probability reference value Pa is selected, and the slave station is made to issue a channel allocation request signal. As a result, when there is only one slave station which has issued the request signal, channel allocation is scheduled with the slave station.
しかし、上記したＰａ以下の乱数を発生した子局が２以
上の局の場合には、要求信号が衝突するので、制御局１
において次にＰｂ（０＜Ｐｂ＜Ｐａ）なる確率基準値を
出し、データチャンネル割り当てを望む全子局に対して
再度乱数を発生させる。However, when there are two or more slave stations that have generated the above random number Pa or less, the request signals collide, so the control station 1
Then, a probability reference value of Pb (0 <Pb <Pa) is output, and random numbers are generated again for all slave stations desiring data channel allocation.
この結果、確率基準値Ｐｂ以下の乱数を発生した子局が
１局のみの場合にはその局にチャンネル割り当て要求信
号を出させて、その局とチャンネル割り当てのスケジュ
ーリングを行なう。As a result, when there is only one slave station that has generated a random number equal to or smaller than the probability reference value Pb, the station is caused to issue a channel allocation request signal and the channel allocation is scheduled with that station.
Ｐｂ以下の乱数を発生した子局が２局以上の場合には、
更に低い確率基準値Ｐｃ（０＜Ｐｃ＜Ｐｂ）を出して、
データチャンネル割り当てを望む全子局に対して再度乱
数を発生させる。If there are two or more slave stations that generated random numbers less than Pb,
By issuing a lower probability reference value Pc (0 <Pc <Pb),
A random number is generated again for all slave stations that desire data channel allocation.
以上ように乱数を選択する基準となる確率基準値を徐々
に低下（例えば0.5→0.25→0.125…）させてゆくことよ
り、確率的にいずれか１局の子局が選択されるようにな
る。As described above, by gradually decreasing the probability reference value serving as a reference for selecting a random number (for example, 0.5 → 0.25 → 0.125 ...), any one of the slave stations is stochastically selected.
ただ、このようにした結果、ある段階で全く割り当て要
求が無くなった場合には、今度は逆に徐々に上記数値を
大きくして行くと、いずれかの子局を選択することがで
きる。However, as a result of doing so, if there is no allocation request at a certain stage, then any of the slave stations can be selected by conversely gradually increasing the above value.
以上の方法によって、チャンネル割り当てを効率良く行
なうことができる。The above method enables efficient channel allocation.
なお、乱数の発生はどの子局も絶対に同じ系列の乱数を
同時に発生させないようにする必要があるが、これは次
のようにして実現可能である。It is necessary to generate random numbers so that none of the slave stations simultaneously generate random numbers of the same sequence, but this can be realized as follows.
例えば、いま制御局１で設定する確率基準値の信号が３
２ビットだとすると、子局２１〜２ｎにも３２ビットの
異なった局番を予め割り振っておく。そして、制御局１
内の乱数発生器において３２ビットの乱数初期値設定値
を発生させる。そして、この初期値設定値と子局２１〜
２ｎの局番との排他的論理和をとれば、全子局が相互に
異なった乱数発生初期値に設定されるようになり、時間
経過と共にすべて異なる乱数系列を出すようになる。For example, if the signal of the probability reference value currently set in the control station 1 is 3
If it is 2 bits, different station numbers of 32 bits are assigned in advance to the slave stations 2 1 to 2 n . And the control station 1
The 32-bit random number generator generates a 32-bit random number initial value setting value. Then, the initial set value and the slave station 2 1 to
By taking the exclusive OR with the station number of 2 n , all the slave stations will be set to mutually different random number generation initial values, and will all generate different random number sequences over time.
なお、送信を終えた子局について、しばらくの間その優
先順位を下げる場合は、その子局の発生した乱数をその
子局がｈ倍（ｈ＞１）して、制御用チャンネルにアクセ
スするように設定しておけば、この場合は乱数がｈ倍と
なるので、優先順位は１／ｈに低下する。When lowering the priority of a slave station that has completed transmission for a while, set the slave station to access the control channel by multiplying the random number generated by that slave station by h (h> 1). In this case, since the random number is multiplied by h in this case, the priority is lowered to 1 / h.
以上から本発明によれば、チャンネル割り当て作業を効
率的に行なうことができるようになる。As described above, according to the present invention, the channel assignment work can be efficiently performed.
第１図は本発明の一実施例の説明図である。 FIG. 1 is an explanatory diagram of an embodiment of the present invention.
Claims (1)
データ伝送用チャンネルの内から１個のデータ伝送用チ
ャンネルの割り当てを制御用チャンネルを介して受け
て、データ伝送を行なう複数の子局とを具備し、 上記子局の内のデータ伝送用チャンネルの割り当てを要
求する１又は２以上の子局で相互に異なる乱数を発生さ
せてこれを上記制御用チャンネルを介して上記制御局に
取り込み、上記制御局において確率基準値を発生してこ
れと上記乱数を比較し、 上記データ伝送用チャンネルの割り当てを要求した子局
が上記確率基準値と乱数とが特定の関係を持つ１個に絞
り込まれるまで上記確率基準値を順次変化して上記子局
での上記乱数発生および上記比較を繰り返し、 上記比較により絞り込まれた１個の子局に対して特定の
データ伝送用のチャンネルを上記制御用チャンネルを介
して割り当てることを特徴とするマルチアクセス方法。Claim: What is claimed is: 1. A control station, and a plurality of data transmission channels, each of which receives one data transmission channel from a plurality of data transmission channels by the control station via the control channel. A slave station, wherein one or more slave stations requesting allocation of a data transmission channel among the slave stations generate mutually different random numbers, and the random numbers are generated through the control channel to the control station. In the control station, a probability reference value is generated, and the probability reference value is compared with the random number, and the slave station requesting the allocation of the data transmission channel has a specific relationship between the probability reference value and the random number. The probability reference value is sequentially changed until it is narrowed down, and the random number generation and the comparison are repeated in the slave station. Multi-access method for a channel use and allocates through the control channel.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP61166666A JPH0611140B2 (en) | 1986-07-17 | 1986-07-17 | Multi-access method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP61166666A JPH0611140B2 (en) | 1986-07-17 | 1986-07-17 | Multi-access method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| JPS6324735A JPS6324735A (en) | 1988-02-02 |
| JPH0611140B2 true JPH0611140B2 (en) | 1994-02-09 |
Family
ID=15835477
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP61166666A Expired - Fee Related JPH0611140B2 (en) | 1986-07-17 | 1986-07-17 | Multi-access method |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JPH0611140B2 (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH0611139B2 (en) * | 1986-07-17 | 1994-02-09 | 株式会社富士通ゼネラル | Multi-access method |
| JPH0620202B2 (en) * | 1986-07-17 | 1994-03-16 | 株式会社富士通ゼネラル | Multi-access method |
| JPS6429136A (en) * | 1987-07-24 | 1989-01-31 | Fujitsu General Ltd | Multi-access method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS58104546A (en) * | 1981-12-16 | 1983-06-22 | Yokogawa Hokushin Electric Corp | Data communication controlling system |
| JPS61228733A (en) * | 1985-04-02 | 1986-10-11 | Nec Corp | Request channel selection system in radio communication system |
| JPS61280130A (en) * | 1985-06-05 | 1986-12-10 | Nec Corp | Transmission right control method |
| JPS6324736A (en) * | 1986-07-17 | 1988-02-02 | Fujitsu General Ltd | Multi-accessing method |
| JPS6324737A (en) * | 1986-07-17 | 1988-02-02 | Fujitsu General Ltd | Method for detecting illegal access in multi-access |
-
1986
- 1986-07-17 JP JP61166666A patent/JPH0611140B2/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS58104546A (en) * | 1981-12-16 | 1983-06-22 | Yokogawa Hokushin Electric Corp | Data communication controlling system |
| JPS61228733A (en) * | 1985-04-02 | 1986-10-11 | Nec Corp | Request channel selection system in radio communication system |
| JPS61280130A (en) * | 1985-06-05 | 1986-12-10 | Nec Corp | Transmission right control method |
| JPS6324736A (en) * | 1986-07-17 | 1988-02-02 | Fujitsu General Ltd | Multi-accessing method |
| JPS6324737A (en) * | 1986-07-17 | 1988-02-02 | Fujitsu General Ltd | Method for detecting illegal access in multi-access |
Also Published As
| Publication number | Publication date |
|---|---|
| JPS6324735A (en) | 1988-02-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Tzamaloukas et al. | Channel-hopping multiple access with packet trains for ad hoc networks | |
| US7190686B1 (en) | Self configuring high throughput medium access control for wireless networks | |
| Bisdikian et al. | MLAP: A MAC level access protocol for the HFC 802.14 network | |
| JPH06506579A (en) | Multi-purpose use of resources in communication systems | |
| CN1136252A (en) | Satellite Communications system carrying out reservation of necessary time slots by prediction of reply data in remote stations | |
| US6810022B1 (en) | Full duplex communication slot assignment | |
| US20050152291A1 (en) | Half-duplex wireless network scheduling | |
| JPH0611140B2 (en) | Multi-access method | |
| JP5161079B2 (en) | Media access control method and slave station | |
| JPH0611139B2 (en) | Multi-access method | |
| JP2981112B2 (en) | Spread spectrum communication data transmission system | |
| US7315534B2 (en) | Channel time allocation method and apparatus | |
| JPH0620202B2 (en) | Multi-access method | |
| JPS63314938A (en) | Multiaccess method | |
| EP0976225B1 (en) | Method for continuously adjustable multi-contention resolution | |
| JP2816852B2 (en) | Multiple packet communication method | |
| JPH06326721A (en) | Slot access method | |
| JP2754987B2 (en) | Data transmission method | |
| Jeon et al. | Contention-based reservation protocol for WDM local lightwave networks with nonuniform traffic pattern | |
| JPH06112875A (en) | Satellite line multiple access system | |
| JP3227625B2 (en) | Transmission method | |
| JPH0210926A (en) | Radio communication system | |
| JPH0771080B2 (en) | Random access method | |
| JPS58218249A (en) | Reservation system | |
| JP2725713B2 (en) | Signal transmission method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| LAPS | Cancellation because of no payment of annual fees |