一种时间离散的随机多址通信系统的算法

在总线网络中，每个站点都能独立地决定帧的发送，若两个或多个站同时发送帧，就会产生冲突，导致所发送的帧都出错。因此，一个用户发送信息成功与否，在很大程度上取决于监测总线是否空闲的算法，以及当两个不同节点同时发送的分组发生冲突后所使用的中断传输的方法。介绍一种基于时间离散的随机多址通信系统的算法，能够准确地计算出用户发送信息的成功率、信道的空闲率和信息发生冲突的碰撞率。

An Algorithm for Time-discrete Random Multi-address Communication System

In bus network,every site can decide individually to send out its data frame.If there are two or more sites among the network sending out the data frame at the same time,data conflict will occur,thus the data frame will have errors.So,whether an user can send his data out successfully or not,mostly depends on whether is free or not,and the method used to stop the transmission when there are conflicts between two different nods which send out the data frame at the same time.This article introduced a time-discrete based algorithm for random multi-address communication system,which can calculate accurately the successful rate when the user sends out his data,the spare rate of the data channel,and the collision rate of the data conflicts.