Results 151 to 160 of about 27,992 (204)

CSMA with reservations by interruptions (CSMA/RI): a novel approach to reduce collisions in CSMA/CD

IEEE Journal on Selected Areas in Communications, 2000
This paper proposes an enhancement for the carrier sense multiple access with collision detection (CSMA/CD) protocol, called CSMA with reservations by interruptions (CSMA/RI). This new protocol uses a novel approach to reserve capacity by interrupting an ongoing packet transmission.
Foh, CH, Zukerman, M
openaire   +2 more sources

v(t) CSMA

Proceedings of the 19th annual international conference on Mobile computing & networking - MobiCom '13, 2013
Efficient scheduling of wireless resources has always been one of the most challenging tasks for wireless networks. To achieve throughput-optimality, traditional back-pressure algorithms calculate a maximal weight matching at each time slot. However, these algorithms need centralized scheduling with high complexity, and thus are not suitable for ...
Ahmed Elbagoury, Moustafa Youssef, Dongyue Xue, Eylem Ekici   +3 more
openaire   +1 more source

Transient performance analysis of nonpersistent CSMA and CSMA-CD protocols

IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond, 2003
A framework for the analysis of the performance of nonpersistent CSMA (carrier sense multiple access) and CSMA-CD (CSMA with collision detection) protocols in a fixed-length time segment is proposed. Closed-form and numerical results that shed new light on the short-term behavior of these protocols and that can be applied to the analysis of integrated ...
L. Jereb, M.A. Marsan
openaire   +1 more source

Output processes of slotted persistent CSMA and CSMA/CD systems

Computer Networks and ISDN Systems, 1987
Abstract Stochastic analysis is given for the interval between two successive successful transmissions (called the packet interdeparture time) in a variety of slotted persistent CSMA and CSMA/CD systems; they include DFT (Delay-First-Transmission) and IFT (Immediate-First-Transmission) models, and we assume that unsuccessfully transmitted packets are
Hideaki Takagi, Masayuki Murata
openaire   +1 more source

Performance comparison of CSMA/RI and CSMA/CD with BEB

ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240), 2002
We analyze our previously proposed protocol, CSMA/RI, and its closest related protocol, CSMA/CD. Our models include the widely used retransmission algorithm-the truncated binary exponential backoff (BEB) algorithm. The analysis is performed under two realistic traffic scenarios-the saturation and the disaster scenarios.
null Chuan Heng Foh, M. Zukerman
openaire   +1 more source

CSMA/CN: Carrier Sense Multiple Access With Collision Notification

IEEE/ACM Transactions on Networking, 2010
A wireless transmitter learns of a packet loss, infers collision, only after completing the entire transmission. If the transmitter could detect the collision early (such as with CSMA/CD in wired networks), it could immediately abort its transmission, freeing the channel for useful communication.
Souvik Sen, Romit Roy Choudhury, Srihari Nelakuditi   +2 more
openaire   +1 more source

Transient performance analysis of 1-persistent CSMA and CSMA-CD protocols

Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration, 2002
An analysis of 1-persistent carrier-sense multiple-access (CSMA) protocols (possibly with collision detection (CD)) operating in fixed-length time intervals is presented, and closed-form results for the transient protocol throughput and average packet delay are derived.
L. Jereb, M.A. Marsan
openaire   +1 more source

Asymptotic performance evaluation of CSMA and CSMA/CD networks

[1992] Proceedings of the 31st IEEE Conference on Decision and Control, 2005
Analytical formulas for the performance evaluation of CSMA (carrier-sense multiple access) and CSMA/CD (collision detection) networks with a finite number of buffered users are presented. The asymptotic theory developed by J.-T. Lim and S.M. Meerkov (1987) is extended to local area networks in order to investigate the steady-state performance ...
openaire   +1 more source

Throughput Analysis for Persistent CSMA Systems

IEEE Transactions on Communications, 1985
The channel throughput for a finite number of packet broadcasting users is analyzed for random access protocols, including slotted persistent carrier sense multiple access (CSMA) with and without collision detection and unslotted persistent CSMA with and without collision detection. We consider both p- and 1-persistent CSMA. Our results can be extended
Takagi, Hideaki, Kleinrock, Leonard
openaire   +2 more sources

Optimal CSMA: A survey

2012 IEEE International Conference on Communication Systems (ICCS), 2012
Carrier Sense Multiple Access (CSMA) has been widely used as a medium access control (MAC) scheme in wireless networks mainly due to its simple and totally distributed operations. Recently, it has been reported in the community that even such simple CSMA-type algorithms can achieve optimality in terms of throughput and utility, by smartly controlling ...
Se-Young Yun, Yung Yi, Jinwoo Shin, Do Young Eun   +3 more
openaire   +1 more source