R. Rom, and M. Sidi, "Multiple Access Protocols," Springer-Verlag, New York, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....have been studied intensively since the 1970s and there exist di#erent ways to classify them including if they are distributed or centralized [6] Our classification is presented in Fig.1. 2 as conflict free MAC protocols (Centralized, Scheduled) or contention MAC protocols (Random, Distributed) [7]. The main di#erent between these two categories is that in contention MAC protocols a transmitted packet from a node is not guaranteed to be successfully received. In contention MAC protocols nodes compete for access to the channel. When only one node makes a transmission attempt the packet is ....

....nodes transmit simultaneously a collision results and a contention resolution algorithm is used to try and resolve the conflict. This resolution process does consume resources but for bursty tra#c the small loss of resources is usually worthwhile when compared to conflict free MAC protocols [[7], page 4] Within contention MAC protocols we can find the first MAC protocol proposed for packet radio networks called ALOHA [6, 8] ALOHA is the simplest contention MAC protocol where a node transmits randomly without verifying if the channel is either idle or busy. Due to this completely ....

[Article contains additional citation context not shown here]

R. Rom and M. Sidi. "Multiple Access Protocols". Springer-Verlag, 1989.

....max is negated since (x max ) 1 implies that d dt (x y) 0 there. It remains to consider a possible internal equilibrium (x e ; y e ) for which (5) and (6) hold. As seen in the previous 1 We observe that this type of stability characterization somewhat resembles that of an Aloha system [7]: there too, three equilibria exist, two of which are stable, and only one of which is desirable. E. Altman et al. Bandwidth Allocation 15 subsection, this immediately implies that (x e ) 1, yielding a unique value for x e , while y e is determined as the unique solution of mi (x e ; y) ....

R. Rom and M. Sidi, Multiple Access Protocols, Springer-Verlag, 1990.

....Channels 7 function of the offered traffic load. The average packet delay is then obtained by adding the average MAC delay and the average queuing delay [17] 4.2. THROUGHPUT The throughput is generally defined as the average amount of data that is transmitted over the channel during a unit time [18]. For a single BSS the throughput is then the fraction of a packet transmitted during a time packet length (T packet ) Consider an observation time T o = MT packet and let SM be the total number of successfully transmitted packets from all mobile stations of the BSS to the AP during this ....

R. Rom and M. Sidi, Multiple Access Protocols, Springer-Verlag, 1990.

....situations when several receivers require the same information, compared with unicast (point to point) links. For an efficient channel utilization, a number of multiple access protocols have been designed. The ALOHA, CSMA and TDMA protocols for nonfading channels are investigated in for instance [3]. In [4] Sakakibara has investigated multi base station slotted ALOHA for WLANs. In his work, base station diversity is considered for Rayleigh fading channels. In [5] the near far effects are studied for ALOHA packet radio networks. A multicast data transmission protocol for an indoor packet ....

Rom, R., Sidi, M., "Multiple Access Protocols", Springer-Verlag, 1990.

....2. Errorless channel: If a given slot contains a single packet transmission, then the packet will be received correctly (by the common receiver) ############### 1 For an introduction to the area of multiple access communications see the books by Bertsekas and Gallager [Berts92, chapter 4] and [Rom90]. Actually, chapter 4 of [Berts92] and chapter 5 of [Rom90] also present good expositions of Conflict Resolution Algorithms. 2 If no special control is exercised to stabilize the protocols, the term capacity must be taken in the broader sense of maximum throughput maintained during ....

.... transmission, then the packet will be received correctly (by the common receiver) ############### 1 For an introduction to the area of multiple access communications see the books by Bertsekas and Gallager [Berts92, chapter 4] and [Rom90] Actually, chapter 4 of [Berts92] and chapter 5 of [Rom90] also present good expositions of Conflict Resolution Algorithms. 2 If no special control is exercised to stabilize the protocols, the term capacity must be taken in the broader sense of maximum throughput maintained during considerable periods of time, since the true capacity is zero ....

[Article contains additional citation context not shown here]

R. Rom and M. Sidi, Multiple Access Protocols, Springer-Verlag, New York, NY (1990).

....to Kin K. Leung at his address, or by email kkleung research.att.com, phone (732)345 3153 and fax (732)345 3038. 2 1. INTRODUCTION Much research efforts have been spent on the subject of multiple access control (MAC) protocols in communications networks since late 1960 s; see text [RS90], BG93] and [T96] and recent survey papers [P95] and [SK97b] Among many MAC protocols reported in public literature, the Carrier Sense Multiple Access with Collision Detection (CSMA CD) protocol is widely used in wired local area networks because of its simplicity and high throughput ....

R. Rom and M. Sidi, Multiple Access Protocols, Springer-Verlag, 1990.

....L(m) appears on both sides of the Eq. 3.3) by solving for L(m) we obtain the recursive equation L(m) 1 P m Gamma1 i=0 [Q i (m) Qm Gammai (m) L(i) 1 Gamma Q 0 (m) Qm (m) m 2 (3.4) It is possible to obtain a close form expression for this recursion. The derivation is very lengthy[47], and the resulting expression is: L(m) 1 m X i=2 m i 2(i Gamma 1) Gamma1) i 1 Gamma p i Gamma (1 Gamma p) i m 2 (3.5) By differentiating Eq. 3.5) with respect to p and setting its derivative to zero, i.e. L(m) p = m X i=2 m i i 2(i Gamma ....

R. Rom, and M. Sidi, "Multiple Access Protocols," Springer-Verlag, New York, 1990.

No context found.

R. Rom, and M. Sidi, "Multiple Access Protocols," Springer-Verlag, New York, 1990.

No context found.

R. Rom and M. Sidi, Multiple Access Protocols, Springer-Verlag, New York, NY (1990).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC