Kybernetika. Ioannis E. Pountourakis Performance of multichannel multiaccess protocols with receiver collisions

Similar documents
ECE 333: Introduction to Communication Networks Fall Lecture 15: Medium Access Control III

Local Area Networks NETW 901

Outline. EEC-484/584 Computer Networks. Homework #1. Homework #1. Lecture 8. Wenbing Zhao Homework #1 Review

TSIN01 Information Networks Lecture 9

An Optical CDMA Random Access Protocol for Multi-rate Optical Networks Adopting Multi-coding Techniques

Random Access Congestion Control in DVB-RCS2 Interactive Satellite Terminals

DOPPLER SHIFT. Thus, the frequency of the received signal is

THROUGHPUT-DELAY PERFORMANCE ANALYSIS OF SSMA PACKET RADIO NETWORK

A Random Network Coding-based ARQ Scheme and Performance Analysis for Wireless Broadcast

Performance of ALOHA and CSMA in Spatially Distributed Wireless Networks

6.1 Multiple Access Communications

Pseudo-Bayesian stability of CSMA and CSMA/CD local area networks

Performance Analysis of 100 Mbps PACE Technology Ethernet Networks

Average Delay in Asynchronous Visual Light ALOHA Network

Modeling the impact of buffering on

Carrier Sensing based Multiple Access Protocols for Cognitive Radio Networks

Stabilization of Contention-Based CDMA Ranging Channel in Wireless Metropolitan Area Networks

Jamming Games for Power Controlled Medium Access with Dynamic Traffic

Block diagram of a radio-over-fiber network. Central Unit RAU. Server. Downlink. Uplink E/O O/E E/O O/E

Multiple Access Methods

Error Performance of Channel Coding in Random-Access Communication

Medium Access Control. Wireless Networks: Guevara Noubir. Slides adapted from Mobile Communications by J. Schiller

Lecture 8: Media Access Control. CSE 123: Computer Networks Stefan Savage

Cooperation in Random Access Wireless Networks

Mobile Communications

Politecnico di Milano Advanced Network Technologies Laboratory. Radio Frequency Identification

Cross-Layer Designs of Multichannel Reservation MAC Under Rayleigh Fading

Analysis of Frequency-Hopping Slotted ALOHA Systems with Channel Load Sensing in Finite Population Model

Cross-Layer Design and Analysis of Wireless Networks Using the Effective Bandwidth Function

Analyzing Split Channel Medium Access Control Schemes

Cellular systems 02/10/06

Throughput-optimal number of relays in delaybounded multi-hop ALOHA networks

Lecture on Sensor Networks

Delay Performance Modeling and Analysis in Clustered Cognitive Radio Networks

Calculation of the Spatial Reservation Area for the RTS/CTS Multiple Access Scheme

Analysis of Collided Signal Waveform on the Long Transmission Line of UART-CSMA/CD Control Network

Capacity Analysis and Call Admission Control in Distributed Cognitive Radio Networks

Lecture 8: Media Access Control

COSC 3213: Computer Networks I Instructor: Dr. Amir Asif Department of Computer Science York University Section B

A Backlog-Based CSMA Mechanism to Achieve Fairness and Throughput-Optimality in Multihop Wireless Networks

Analysis of Random Access Protocol and Channel Allocation Schemes for Service Differentiation in Cellular Networks

Exact statistics of ARQ packet delivery delay over Markov channels with finite round-trip delay

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 2, FEBRUARY Srihari Adireddy, Student Member, IEEE, and Lang Tong, Fellow, IEEE

Optimum Power Scheduling for CDMA Access Channels*

Politecnico di Milano Advanced Network Technologies Laboratory. Radio Frequency Identification

Medium Access Control via Nearest-Neighbor Interactions for Regular Wireless Networks

Chapter 2 On the Spectrum Handoff for Cognitive Radio Ad Hoc Networks Without Common Control Channel

A virtually nonblocking self-routing permutation network which routes packets in O(log 2 N) time

Medium Access Methods. Lecture 9

Stochastic Modelling for Wireless Communication Networks-Multiple Access Methods.

Multiple Access System

Antonis Panagakis, Athanasios Vaios, Ioannis Stavrakakis.

Medium Access Control

3644 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 6, JUNE 2011

INTRODUCTION TO WIRELESS SENSOR NETWORKS. CHAPTER 3: RADIO COMMUNICATIONS Anna Förster

Mobile Computing. Chapter 3: Medium Access Control

Randomized Channel Access Reduces Network Local Delay

Link Models for Circuit Switching

Using Signaling Rate and Transfer Rate

Lab/Project Error Control Coding using LDPC Codes and HARQ

ANTI-JAMMING PERFORMANCE OF COGNITIVE RADIO NETWORKS. Xiaohua Li and Wednel Cadeau

Simulcast Packet Transmission in Ad Hoc Networks

Maximum Throughput for a Cognitive Radio Multi-Antenna User with Multiple Primary Users

Optimal Power Allocation over Fading Channels with Stringent Delay Constraints

The problem of upstream traffic synchronization in Passive Optical Networks

Department of Computer Science and Engineering. CSE 3213: Computer Networks I (Fall 2009) Instructor: N. Vlajic Date: Dec 11, 2009.

Opportunistic Communications under Energy & Delay Constraints

The Long Range Wide Area Network - LoraWAN

CONSIDER THE following power capture model. If

Spread ALOHA Based Random Access Scheme for Macro Cell CDMA Systems

Coordination-free Repeater Groups in Wireless Sensor Networks Andreas Willig

IN wireless communication networks, Medium Access Control

ICT 5305 Mobile Communications. Lecture - 4 April Dr. Hossen Asiful Mustafa

Wireless Communications Lecture 4: Multiple Access Technologies

Chapter 2 Overview. Duplexing, Multiple Access - 1 -

Packet-switching in a slotted satellite channel*

A new protocol for the integration of Voice and Data over PRMA

I. Introduction. and. North-Holland Computer Networks and ISDN Systems 12 (1986) 1-10

A Cross-Layer Cooperative Schema for Collision Resolution in Data Networks

Channel Sensing Order in Multi-user Cognitive Radio Networks

CENTRALIZED BUFFERING AND LOOKAHEAD WAVELENGTH CONVERSION IN MULTISTAGE INTERCONNECTION NETWORKS

FPGA-BASED DESIGN AND IMPLEMENTATION OF THREE-PRIORITY PERSISTENT CSMA PROTOCOL

Wireless Intro : Computer Networking. Wireless Challenges. Overview

MULTIUSER ACCESS CAPACITY OF PACKET SWITCHED CDMA SYSTEMS

Energy-Efficient Duty Cycle Assignment for Receiver-Based Convergecast in Wireless Sensor Networks

Chapter 3 : Media Access. Mobile Communications. Collision avoidance, MACA

Multiwavelength Optical Network Architectures

Transmission Scheduling in Capture-Based Wireless Networks

IEEE P Broadband Wireless Access Working Group

Estimating the Transmission Probability in Wireless Networks with Configuration Models

Receiver Architectures for UWB-Based Transmit-Only Sensor Networks

Preamble MAC Protocols with Non-persistent Receivers in Wireless Sensor Networks

Improving Reader Performance of an UHF RFID System Using Frequency Hopping Techniques

An HARQ scheme with antenna switching for V-BLAST system

1. Introduction 1.2 Medium Access Control. Prof. JP Hubaux

An Alamouti-based Hybrid-ARQ Scheme for MIMO Systems

A Soft-Limiting Receiver Structure for Time-Hopping UWB in Multiple Access Interference

Load Balancing for Centralized Wireless Networks

Lower Layers PART1: IEEE and the ZOLERTIA Z1 Radio

APPLICATION NOTE 3166 Source Resistance: The Efficiency Killer in DC-DC Converter Circuits

Transcription:

Kybernetika Ioannis E. Pountourakis Performance of multichannel multiaccess protocols with receiver collisions Kybernetika, Vol. 33 (1997), No. 5, 547--555 Persistent URL: http://dml.cz/dmlcz/125392 Terms of use: Institute of Information Theory and Automation AS CR, 1997 Institute of Mathematics of the Academy of Sciences of the Czech Republic provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use. This paper has been digitized, optimized for electronic delivery and stamped with digital signature within the project DML-CZ: The Czech Digital Mathematics Library http://project.dml.cz

KYBERNETIKA VOLUME 33 (1997), NUMBER 5, PAGES 547-555 PERFORMANCE OF MULTICHANNEL MULTIACCESS PROTOCOLS WITH RECEIVER COLLISIONS 1 loannis E. POUNTOURAKIS The problem of receiver collisions in multichannel multiaccess communication systems is studied in this paper. We develop a Poisson approximation method for the evaluation of the throughput performance measures under receiver collisions consideration assuming receiver buffer with capacity of one packet. Also we calculate the average rejection probability at destination of a packet in order to estimate the effect of receiver collisions on the throughput performance and the total loss probability as a measure of the multichannel system behaviour. The evaluations are carried out for Multichannel Slotted Aloha-type protocols with Poisson arrivals and finite population. Also numerical results are showing the throughput reduction as it compared with the protocol case without receiver collisions. 1. INTRODUCTION The design and analysis of multichannel networks are becoming increasingly important because they provide facilities for high speed data rates. In high speed networks as wide-band coe rial cables and optical communications, the capacity utilization problem can be faced by multichannel communication techniques. The multichannel solution can be obtained by dividing the bandwidth of a high speed channel or by interconnection of physically separated lower speed channels. Multichannel systems have the added advantages of reliability, adaptability, fault tolerance and performance improvements. There are two causes of packet loss in multichannel systems. First packets are destroyed if two or more stations transmit their packets in the same channel of the multichannel system and they are overlapped in time (channel collisions). Second additional packets are destroyed when a successfully transmitted packet cannot be received by the intended destination because its receiver buffer is 'full'(receiver collisions). In much of the studies related to multichannel multiaccess protocols, the analysis has been done assuming infinite receiver buffer size. However the receiver buffer size used in practice have finite size and implies negative impact on the cost of the required network interfaces for the stations of the system. Thus the choice of the receiver buffer size of a multichannel protocol is widely depended 1 A preliminary version of this paper was presented at the 3rd IEEE Mediterranean Symposium on New Directions in Control and Automation, which was held in Limassol, Cyprus on July 11-13, 1995.

548 LE. POUNTOURAKIS on the strictly estimation of the receiver collisions phenomenon and its influence to performance measures. The effect of receiver collisions are rarely studied in the literature. The works reported in [3, 4, 6] are some of these very few studies. In [4] a M-CSMA-IC scheme assumes a simplified model in which the total offered traffic is Poisson and uses the Stirlings numbers of second kind to evaluate the effect of receiver collisions in the system performance for cases of receiver buffer size of one packet. In [3] the M-CSMA/CD protocol is examined for finite number of stations and receiver collisions assumption. In this study simulation techniques are used to estimate the effect of receiver collisions with various receiver buffer sizes. In [6] the M-CSMA/CD protocol with receiver collisions is examined for finite number of stations using discrete time Markov chains in which the probability of correctly received packets at destination is approximately evaluated for cases of receiver buffer size of one packet. In [2, 5] the concept of receiver collisions is different and it is not related with receiver buffer size. In these cases a receiver collision occurs when a collision-free packet transmission cannot be picked up by the intended destination since the destination's receiver may be tuned to some other channel for receiving data packet from some other source. However in these studies the effect of receiver collisions is ignored. In this paper, we examine a multichannel model using a) Poisson approximation methods for the total offered traffic to the system b) the number of correctly received packets at destination are also approximated as a Poisson random variable. The material of this paper is organized as follows: In Section 2 the basic assumptions about the examined multichannel multiaccess protocols are given. In Section 3 the analysis of the conventional Multichannel Aloha-type protocol without the effect of receiver collisions is presented assuming Poisson arrivals. Then the throughput performance with effect of receiver collisions is derived based on Poisson approximations statistics. In Section 4 numerical results are presented for various number of channels and stations. Comments on numerical results and explanation of the behaviour are discussed. Also some conclusions are made. 2. MODEL AND ASSUMPTIONS A multichannel multiaccess communication system consisting oft; parallel broadcast channels all of the same capacity is considered. A finite number, M, of stations each one connected by means of separate interfaces to every channel of the system is assumed. The time is slotted on all channels, and these slots are synchronized across all channels. Each station has access to all channels, i.e. it can transmit and/or receive constant length packets that fit to slot size. The round trip propagation delay is small enough (i.e. less than packet transmission time the slot duration) The set of rules that the proposed protocol implies for the stations in the multichannel system are as follows: 1. Every station is equipped with a receiver buffer and a transmitter buffer each one with capacity of one packet. If the transmitter buffer is empty, the station is said to be free, otherwise it is backlogged. If a station is backlogged and generates

Performance of Multichannel Multiaccess Protocols with Receiver Collisions 549 a new packet, the packet is lost and never returns. 2. We assume that each packet has a source and a destination address information. A station ready to (re)transmit selects randomly one among the v (2<v <M) channels at the beginning of the slot in order to attempt its (re)transmission. Each channel is chosen with equal and constant probability P,- = 1/v. If more than one station select the same channel during a time slot to (re)transmit a collision will occur. 3. The successfully (re)transmitted packets are uniformly distributed among the M stations. Thus if two or more stations (re)transmit successfully through different channels during a time slot and their packets destined to same station, the station accepts only one packet in the receiver buffer and rejects all others. This phenomenon is called receiver collision. 4. If a backlogged station retransmits successfully during a time slot and the retransmission is not aborted due to a receiver collision, it becomes free at the next time slot. A free station becomes backlogged in case of a unsuccessful transmission or receiver collisions. 5. The channels are error free and there are no capture phenomena. Thus, packets may be corrupted only because of their concurrent transmission or receiver collisions. We approximate the total number of new transmissions and retransmissions with a Poisson process with mean rate G. 3. ANALYSIS The throughput reduction induced by receiver collisions is related with the possibility of receiver buffers overflow and this is associated with buffer capacity and the system throughput without the effect of receiver collisions. The possibility of receiver buffer overflow gives rise to rejection probability at destination in steady state which substantiates the throughput loss in quantitative fashion. A more precise way to estimate the impact of packet destruction due to channel collisions and receiver collisions on the throughput performance is the total loss probability. The analysis is composed from two parts, a) Throughput evaluation of conventional multichannel system protocol and b) Throughput analysis of finite receiver buffer size protocol. 3.1. Multichannel slotted ALOHA without receiver collisions The traffic offered to ith channel is given: Gi = GPi = G/v. (1) For finite population of stations we adopt the Bertsekas' [1] assumptions for Poisson approximations of the overall traffic G. Thus the throughput per channel in steady state is evaluated as: r Si= Gl e- G ' = -e- G /r (2) v Thus the total throughput is: v s = Y, s i = Ge ~ G/v - ( 3 ) 1=1

550 LE. POUNTOURAKIS 3.2. Multichannel slotted ALOHA with receiver collisions Let SRC be the multichannel system throughput, conditioning on the receiver collision effect. We still assume that the total offered traffic is Poisson. We define, SRC, as the average number of the correctly received at destination in steady state during a time slot. S v be a random variable representing the number of successful (re)transmissions during a time slot from multichannel system. H V (S) is a random variable representing the number of different stations selected as destination, given that the mean throughput rate is S packets/slot. U n be an indicator function denoting whether a station n (n = 1,2,...,M) is selected as destination of packet, i.e. { +1 if station n is selected during z'th slot 0 else. Let po = Pr[Un = 0] in steady state. Consider that S v = k packets are successfully (re)transmitted from multichannel system during the ith slot. The random distribution of these packets in M stations gives M k arrangements each with probability M~ k. In this case PQ denotes that no one from k packets are destined to station n. Thus the k packets should be destined to the remaining M 1 stations in (M \) k different ways. The Lb conditioning on the S v = k can be expressed as follows Po(k) = ^(M-l) k = [l-l/m} k. (4) Using the approximation (1 - x) y «e~ xy for small x in (4), we take In steady state E[S V = k] = S and consequently P Q (k)*e- k ' M. (5) Po = E[Po(k)]*e- s l M. (6) Let Pt be the probability that at least one packet has been destined to station n during a time slot in steady state. Then Pj = Pr{Un = 1} = 1 - P Q = 1 - e~ s ' M. (7) The probability H V (S) = k, of finding k different stations that have been selected as destination during a time slot, obeys to binomial probability low. Thus Pr[H v (S) = k}=(^my k P M - k. (8) M S RC = E{Pr[H v (S) = k)} = ft Pr[H v (S) = k] = M(1 - e~ s ' M ). (9) JЬ=I

Performance of Multichannel Multiaccess Protocols with Receiver Collisions 551 3.2.1. Average rejection probability at destination The average rejection probability at destination of a packet is evaluated as the ratio of the average number of packet rejection at destination per slot in steady state due to receiver buffer overflow, to the average number of successfully (re)transmitted packets per slot, then S 1 <? P rej = * RC (10) An interesting area to evaluate P rej is the point of the maximum stable throughput over multichannel system. It is obvious that this point corresponds to the maximum P re j. If we set the first derivative of the equation (3) with respect to G equal to zero, we find the optimal G that maximize the throughput S of the system. Then we take Using the above values we can calculate 3.2.2. Total loss probability S max = v/e, (11) Copt = v. (12) P rej (max) = 1 - - M[l- e~ v/em ). (13) v The total loss probability is defined as the ratio of the average number of packet loss due to transmission collisions over multichannel system and receiver collisions at destination per slot in steady state, to the average number of (re)transmitted packets per slot, then p _ c Pioss = ^ - 7 ^. (14) 4. NUMERICAL RESULTS Figure 1 illustrates the throughput versus the offered traffic G for a v = 5, 10, 20 (channel) systems with M = 50 stations. It can be observed that throughput measures are on decrease as they compared with the protocol case without receiver collisions for all values of traffic rates. It is interesting to observe that for fixed number of stations, the differences S SRC are increasing functions of v. The reason is that for a fixed value of G, as v increases, the throughput S increases and consequently the possibility of a packet to be rejected at destination due to receiver collisions is large. For example let G = 4, we have for v = 5 (5 = 1.797, SRC = 1.765) and P rej = 1.776%), for v = 10 (5 = 2.681, S RC = 2.610 and P rej = 2.634%) and for v = 20 (5 = 3.275, S RC = 3.170 and P rej = 3.204%). Figure 2 presents the histogram of the maximum average percent rejection probabilities for v ='2, 5, 10, 20 (channel) systems with M = 50, 100 stations. It is evident that for fix v as M increases the P rej (max) decreases. Also for fix M as v increases P re j(max) increases too. In case of M = 50 we have for v=b, P rej (max) = 1.817% and for v = 20, P re j = 7%. We can say that three parameters characterize the performance behaviour of the multichannel system v, M, P rej (max). Figure 3 illustrates

552 LE. POUNTOURAKIS the average rejection probabilities versus Traffic G(packets/slot) for v = 5, 10, 20 (channel) systems with M = 50 stations. For low value of the traffic G, the average rejection probability increases linearly with G (low values of the throughput S). As the G increases approaching G op t and the throughput approaching S max, E re j begins to saturate increasing slowly towards E re j(max). For higher values of G (G > G op t) the S is reduced due to channel collisions so E re j decreases because the possibility of collision at destination is low. Figure 4 depicts the average total loss probabilities versus Traffic G (packets/slot) for v = 5, 10, 20 (channel) systems with M = 50, 100 stations. It is evident from the figure the dependence of El oss from v. For a given number M of stations as v increases Ei oss decreases for all values of G. In other words as v increases throughput performance increases too causing lower channel collisions per slot which consequently corresponds to smaller Eioss per slot. It is obvious from the figure for fix v and different values of M, the high part of the curves, as G increases Ei oss curves converge. The reason is that in high load Ei oss is influenced only from channel collisions because E re j approach zero as Figure 3 indicates. Figure 5 shows the average total loss probabilities versus Traffic G (packets/slot) for v = 30 ( channel) system with M = 50, 100 stations. It can be seen that Ei oss take lower values for all values of traffic rates as they compared with Ei oss without receiver collision consideration. The contribution of receiver collisions on the total loss probability is related with the number of stations of the system. Thus for fix value oft; as M increases Ei oss curves approach the curve of without receiver collision case. The reason as already explained is that as M increases E re j decreases affecting Ei oss towards lower values. Thus for v = 30 and G = 20, Ei oss = 48.65 % without the consideration of receiver collisions. Taking into account receiver collisions we have for M = 50, E!oss = 53.58% and for M = 100, Ei oss = 51.20%. M=50 v=20 20 G(packets/slot Fig. 1. The throughput versus the offered traffic G characteristics for a v = 5, 10, 20 (channel) systems with M 50 stations. Analytical results with and without receiver collisions schemes.

Performance of Multichannel Multiaccess Protocols with Receiver Collisions 553 V(channels) Fig. 2. The histogram of maximum average percent rejection probabilities for v = 2, 5, 10, 20 (channel) systems with M = 50, 100 stations. Fig. cл Ш M=50 _! ffl m < / ^v. б u Cť CL z û 1- /v=20 u ш -> 4 ш / t_ 1- V=10^\. z ш u or Ш o û. - - II ш 0 < ^V. 0. V=!>\^^ ^ ^ - ш > <n 1 1~~~ 1-10 20 G(packets/slot) 30 40 3. Average rejection probabilities versus Traffic G (packets/slot) for v (channel) systems with M = 50 stations. 5, 10, 20

554 LE. POUNTOURAKIS w 100 20 G(pockets/slot) Fig. 4. Average percent total loss probabilities versus Traffic G (packets/slot) for v = 5, 10, 20 (channel) systems with M = 50, 100 stations. tл 80 without receiver collisions with receiver collisions 20 G(pockets/slot) 40 Fig. 5. Average percent total loss probabilities versus Traffic G (packets/slot) for v = 30 (channel) system with M = 50, 100 stations.

Performance of Multichannel Multiaccess Protocols with Receiver Collisions 555 5. CONCLUSIONS An approximation method which simplifies the evaluation of the throughput performance of a multichannel multiaccess ALOHA-type protocol with receiver collisions is developed. The analysis is based upon Poison assumptions for the total offered traffic over the multichannel system in which each station is equipped with a receiver buffer with capacity of one packet. Also the probability of packet rejection at destination is approximately evaluated using Poisson approximations. An other quantity the total loss probability is studied which presents the total packet loss due to channel collisions and receiver collisions during a time slot. Numerical results prove that three parameters characterize the performance behaviour of the multichannel system v, M, P re j(max). It was showed that for large population systems the receiver collisions can be ignored with only a small loss of accuracy. In the opposite case in smaller systems the effect of receiver collisions is significant for the performance behaviour which can't be neglected. REFERENCES (Received February 14, 1996.) [1] D. Bertsekas and R. Gallager: Data Networks. Prentice Hall of India, New Delhi 1989. [2] I.M.I. Habbab, M. Kavehrad, and C.E. W. Sundberg: Protocols for Very high-speed optical Fiber local area networks using a passive star topology. J. Lightwave Technology LT-5 (1987), 1782-1794. [3] M.A. Marsan and F. Neri: A simulation study of delay in multichannel CSMA/CD protocols. IEEE Trans. Comm. 55(1991), 11, 15.0-1603. [4] M.A. Marsan and D. Roffinella: Multichannel local area network protocols. IEEE J. on Selected Areas in Communications SAC-1 (1983), 5, 885-897. [5] N. Mehravari: Performance and protocol improvements for very high-speed optical Fiber local?rea networks using a passive star topology. J. Lightwave Technology 8 (1990), 520-630. [6] D. S. Park and C.K. Un: Performance of multichannel CSMA/CD protocol with detection of destination conflicts. Electron. Lett. 25 (1989), 25, 1690-1692. Dr. Ioannis E. Pountourakis, National Technical University of Athens, Department of Electrical and Computer Engineering, Division of Computer Science, Heroon Polytechniou 9, 15773 Zographou, Athens. Greece.