西安电子科技大学计算机通信与网络CH12 多路访问.pdfVIP

Chapter 12 Multiple Access 多路访问 12.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Figure 12.1 Data link layer divided into two functionality-oriented sublayers 数据链路层分为两个功能子层: 数据链路控制子层和多路访问控制子层 12.2 Figure 12.2 Taxonomy of multiple-access protocols discussed in this chapter 多路访问控制协议的分类： 随机访问协议 受控访问控制协议 通道化协议 12.3 12-1 RANDOM ACCESS 随机访问协议 In random access or contention methods, no station is superior to another station and none is assigned the control over another. No station permits, or does not permit, another station to send. At each instance, a station that has data to send uses a procedure defined by the protocol to make a decision on whether or not to send. 在随机访问或竞争访问方式中，没有一个站点是优于其它站点的， 也不能控制其它站点。没有站点有权力允许或不允许其它站点发 送或不发送数据。有数据要发送的站通过自身的协议决定发送还 是不发送数据。 Topics discussed in this section: ALOHA ALOHA协议 Carrier Sense Multiple Access 载波侦听多路访问协议CSMA Carrier Sense Multiple Access with Collision Detection 带有冲突检测能力CSMA Carrier Sense Multiple Access with Collision Avoidance 带冲突避免CSMA 12.4 Figure 12.3 Frames in a pure ALOHA network 纯ALOHA 的帧 12.5 Figure 12.4 Procedure for pure ALOHA protocol 纯ALOHA协议的流程图 12.6 Example 12.1 The stations on a wireless ALOHA network are a maximum of 600 km apart. If we assume that signals propagate at 3 ×108 m/s, we find T = (600 ×105 ) / (3 ×108 ) = 2 ms. Now we can find the p value of T for different values of K . B 一个纯ALOHA协议的站点之间最大距离为600公里，信号的传 播速度为30万公里/秒，那么Tp = (600 ×105 ) / (3 ×108 ) = 2 ms 。对于不同的K值，得到不同的T 值。