An Assigned-Slot Listen-Before-Transmission Protocol for a Multiaccess Data Channel

Hansen, L.; Schwartz, M.

doi:10.1109/tcom.1979.1094474

Cited by 31 publications

(8 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For high throughput, M/L = 1 is found to be optimum. In fact, with MIL = 1, the scheme becomes a conflict-free one which approaches MSAP and gives nearly identical results [49]. For very low throughput, MIL = M (i.e., L = 1) is found to be optimum; this corresponds to pure CSMA.…”

Section: ) a Round-robin (Rr) Reservation Scheme [47]mentioning

confidence: 89%

Multiaccess Protocols in Packet Communication Systems

Tobagi

1980

IEEE Trans. Commun.

314

View full text Add to dashboard Cite

Abstmcr-The need for multiaccess protocols arises whenever a resource is shared by many independent contending users. Two major factors contribute to such a situation: the need to share expensive resources in order to achieve their eflcient utilization, or the need to provide a high degree of connectivity for communication among independent subscribers (or both). In data transmission systems, the communication bandwidth is often the prime resource, and it is with respect to this resource that we view multiaccess protocols here. We give in this paper a unified presentation of the various multiaccess techniques which we group into five categories: 1) fixed assignment techniques, 2) random access techniques, 3) centrally controlled demand assignment techniques, 4) demand assignment techniques with distributed control, and 5) mixed strategies. We discuss their applicability to different environments, namely, satellite channels, local area communication networks and multihop store-and-forward broadcast networks, and their applicability to different types of data traffic, namely stream traffic and bursty traftic. We also present the performance of many of the multiaccess protocols in terms of bandwidth utilization and message delay.

show abstract

Section: ) a Round-robin (Rr) Reservation Scheme [47]mentioning

confidence: 89%

Multiaccess Protocols in Packet Communication Systems

Tobagi

1980

IEEE Trans. Commun.

314

View full text Add to dashboard Cite

show abstract

“…In this paper, an updated version of the Assigned-Slot access method (Hansen and Schwartz 1977;1979) has been analyzed using simulation. Although it used the same general idea of the original Assigned-Slot scheme, the updated version includes current local network technologies such as the collision detection capability and includes realistic assumptions such as the presence of queues within the network nodes.…”

Section: Discussionmentioning

confidence: 99%

“…The related protocol which is the basis for this paper was proposed by Hansen and Schwartz (1977;1979). This protocol is called the Assigned-Slot Listen-Before-Transmission Protocol.…”

mentioning

confidence: 99%

“…The other two methods (i.e., RR and RO), however, could have been chosen in place of AR When compared with CSMA, MSAP always performed better under heavy traffic conditions. However, at light traffic with a large number of nodes, CSMA outperformed MSAP THE BASIC SIMULATION MODEL Although there are some differences between the slotting scheme used in the Assigned-Slot scheme and the one used in the MSAP protocol (Kleinrock and Scholl 1977) Hansen and Schwartz (1979) indicated that the two schemes will yield nearly identical performance results. In fact, the two slotting schemes become identical whenever the packet length is equal to a multiple of the number of groups.…”

mentioning

confidence: 99%

See 1 more Smart Citation

A simulation analysis of an updated version of the assigned-slot listen-before-transmission protocol

Alshannari¹,

Rakes

Sen

1988

SIMULATION

View full text Add to dashboard Cite

Two situations can occur which would cause computers (or nodes) to transmit messages at the same time. In the first case, both nodes see an idle link and immediately start to send their messages. In the second case, they both see the end of a message transmitted by a third node and again begin sending simulta neously. Both of these situations result in a garbled message called a collision. Protocols, or handshaking rules between nodes, can either handle collisions after they occur and direct re-transmission, or they can schedule messages and avoid collisions. This paper updates a protocol called the assigned-slot listen- before-transmission scheme by incorporating collision detection capability and the use of message queues. A simulation model of a local area network is used to gauge the performance of this protocol and test its sensitivity to packet length, node groupings, and a range of traffic throughputs.

show abstract

“…Medium access control (MAC) layer protocols can be classified into two approaches: distributed control schemes [5]- [6] and centralized control schemes [7]- [9]. In general, centralized control with a polling mechanism can realize prioritized control more easily than distributed control schemes.…”

Section: Introductionmentioning

confidence: 99%

A Novel Prioritized Control Scheme Using Random Access Period Control for Wide Area Ubiquitous Wireless Networks

Shimizu

Nuno

Watanabe

2008

2008 Third International Conference on Systems and Networks Communications

View full text Add to dashboard Cite

In wide area ubiquitous wireless networks, most wireless terminals (WTs) will transmit small amounts of data at comparatively long intervals. Therefore, each AP must be capable of accommodating a great many WTs. Moreover, this network is required to accommodate a variety of services; some services need to be prioritized.In this paper, we propose a novel prioritized control scheme that applies random access to wide area ubiquitous wireless networks. Two kinds of priority classes are considered; high priority (HP) class and low priority (LP) class. The transmission performance of HP class must be guaranteed regardless of LP class traffic situation. To meet this requirement, the proposed scheme isolates the random access (RA) periods of the two classes and controls the RA period for HP class according to the HP class traffic situation, which is predicted from the HP event notification history (event here means that a WT has HP traffic to send). This paper also clarifies the problems of the conventional scheme and reveals the transmission performance of the conventional and proposed scheme by computer simulation.

show abstract

An Assigned-Slot Listen-Before-Transmission Protocol for a Multiaccess Data Channel

Cited by 31 publications

References 7 publications

Multiaccess Protocols in Packet Communication Systems

Multiaccess Protocols in Packet Communication Systems

A simulation analysis of an updated version of the assigned-slot listen-before-transmission protocol

A Novel Prioritized Control Scheme Using Random Access Period Control for Wide Area Ubiquitous Wireless Networks

Contact Info

Product

Resources

About