• Journal of Communications and Networks
• /
• v.14 no.5
• /
• pp.524-532
• /
• 2012

In this paper, we present the performance evaluation of the reliable cooperative media access control (RCO-MAC) protocol, which has been proposed in [1] by us in order to enhance system throughput in bad wireless channel environments. The performance of this protocol is evaluated with computer simulation as well as mathematical analysis in this paper. The system throughput, two types of average delays, average channel access delay, and average system delay, which includes the queuing delay in the buffer, are used as performance metrics. In addition, two different traffic models are used for performance evaluation: The saturated traffic model for computing system throughput and average channel access delay, and the exponential data generation model for calculating average system delay. The numerical results show that the RCO-MAC protocol proposed by us provides over 20% more system throughput than the relay distributed coordination function (rDCF) scheme. The numerical results show that the RCO-MAC protocol provides a slightly higher average channel access delay over a greater number of source nodes than the rDCF. This is because a greater number of source nodes provide more opportunities for cooperative request to send (CRTS) frame collisions and because the value of the related retransmission timer is greater in the RCO-MAC protocol than in the rDCF protocol. The numerical results also confirm that the RCO-MAC protocol provides better average system delay over the whole gamut of the number of source nodes than the rDCF protocol.

• Journal of IKEEE
• /
• v.9 no.2 s.17
• /
• pp.123-135
• /
• 2005

3GPP RLC protocol specification adopted a window-controlled selective-repeat ARQ scheme for provisioning reliable data transmission. Inevitably, the re-ordering issue arises in the 3GPP's ARQ since it belongs to the selective-repeat ARQ clan. A long re-ordering time results in the degradation of throughput and delay performance, and may invoke the overflow of the re-ordering buffer. Also, the re-ordering time must be regulated to meet the requirements of some services which are both loss-sensitive and delay-sensitive. In the 3GPP's ARQ, we may deflate the occupancy of the re-ordering buffer by reducing the window size and/or length of the status report period. Such a decrease, however, deteriorates the throughput and delay performance and encroaches the resource of the reverse channel. Aiming at reducing the occupancy at the re-ordering buffer while suppressing the degradation of throughput and delay performance, we propose threshold-dependent occupancy control schemes, identified as post-threshold and pre-threshold schemes, as supplements to the 3GPP's ARQ. For judging the effectiveness of the proposed schemes, we investigate peak occupancy, maximum throughput and average delay in the practical environment involving fading channels. From the simulation results, we observe that the proposed schemes invoke the performance trade-off between occupancy and throughput in general. Also, we reveal that the post-threshold scheme is able to improve the throughput and delay performance of the ordinary 3GPP's ARQ without inflating the occupancy of the re-ordering buffer.

• Journal of Information Processing Systems
• /
• v.8 no.4
• /
• pp.739-748
• /
• 2012

We propose an analytic model to compute the station's saturated throughput and packet delay performance of the IEEE 802.11 DCF (Distributed Coordination Function) in which frame transmission error rates in the channel are different from each other. Our analytic model shows that a station experiencing worse frame error rates than the others suffers severe performance degradation below its deserved throughput and delay performance. 802.11 DCF adopts an exponential back-off scheme. When some stations suffer from high frame error rates, their back-off stages should be increased so that others get the benefit from the smaller collision probabilities. This impact is then recursively applied to degrade the performance of the victim stations. In particular, we show that the performance is considerably degraded even if the frame error rate of the victim station satisfies the receiver input level sensitivity that has been specified in the IEEE 802.11 standard. We also verify the analytic results by the OPNET simulations.

• Journal of Advanced Navigation Technology
• /
• v.9 no.2
• /
• pp.156-163
• /
• 2005

In this paper, we analyzed the performance of VDL mode 3 system model whose specification is defined by ICAO(International Civil Aviation Organization). For performance evaluation, we obtained BER(Bit Error Rate), transmission delay time, burst retransmission rate and throughput. From the analysis result, we could explicitly define relationships among BER, transmission delay time, throughput and burst restransmission rate. In addition, it became known that V/D retransmission rate and throughput are closely related in down link channel.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.10
• /
• pp.1462-1470
• /
• 1989

This paper aims at investigating the Demand Assigned Multiple Access(DAMA) system for the packet-switched Satellite Communication. An onboard processor of the multisport beam satellite incorporates the ground controller to macimize the packet transmissions for each slot. 'Request Following' trnasmission mode is introduced as a transmission strategy of ground station under the control of its zone controller. The combined scheme of reservation channel access and contention channel access was proposed by Lee & Mark[3] for improving the Delay-Throughput performance. Our scheme provides less communication delay of approximately max. 200msec for achieving the corresponding throughput than the Lee & Mark's work does. Delay versus Throughput curves as well as Delay versus Traffic parameter curves are obtained. Numerical results obtained through the analysis and by the computer simulation show that the proposed scheme provides the low average packer delay even under the condition that the number of transponders (M)is below the half of the number of zones(N).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1668-1688
• /
• 2012

Cooperative communications and network coding schemes have been proposed to increase system throughput for ad hoc networks. In this paper, we present throughput and delay analysis of the new network coding-enabled cooperative MAC protocol called NC-MAC, which has been proposed by us in order to significantly enhance system performance. This protocol introduces an approach that can accommodate both cooperative communication and network coding for wireless ad hoc networks by slightly increasing overhead and modifying standards. The protocol's performance is evaluated using mathematical analysis and computer simulation and two performance measures, system throughput and average channel access delay, are used for a performance comparison with previous schemes. It is assumed that all the frames exchanged over a wireless channel are susceptible to transmission errors, which is a new but more reasonable assumption differentiating this research from previous research. Numerical results show this protocol provides significantly enhanced system performance compared with conventional cooperative MAC protocols used in previous research. For instance, system performance is 47% higher using the NC-MAC protocol than when using the rDCF protocol.

• East Asian mathematical journal
• /
• v.27 no.1
• /
• pp.23-33
• /
• 2011

Due to underutilization of spectrum under current inefficient and static spectrum management policy, various kinds of opportunistic spectrum access (OSA) strategies have appeared. Myopic policy is a simple and robust OSA strategy with reduced complexity that maximizes immediate throughput. In this paper, we propose mathematical models to evaluate the throughput and the MAC delay of a myopic policy under saturation tra c conditions. Using the MAC delay distribution, we evaluate the packet delay of secondary users under nonsaturation conditions. Numerical results are given to show the performance of the myopic policy in cognitive radio networks.

• Journal of Internet Computing and Services
• /
• v.5 no.6
• /
• pp.11-20
• /
• 2004

Proportional Fair (PF) share policy has been adopted as a downlink scheduling scheme in CDMA2000 l×EV-DO standard. Although It offers optimal performance in aggregate throughput conditioned on equal time share among users, it cannot provide a bandwidth guarantee and a strict delay bound. which is essential requirements of real-time (RT) applications. In this study, we propose a new scheduling policy that provides quality-of-service (QoS) guarantees to a variety of traffic types demanding diverse service requirements. In our policy data traffic is categorized Into three classes, depending on sensitivity of Its performance to delay or throughput. And the primary components of our policy, namely, Proportional Fair (PF), Weighted Fair Queuing (WFQ), and delay-based prioritized scheme are intelligently combined to satisfy QoS requirements of each traffic type. In our policy all the traffic categories run on the PF policy as a basis. However the level of emphasis on each of those ingredient policies is changed in an adaptive manner by taking into account the channel conditions and QoS requirements. Such flexibility of our proposed policy leads to offering QoS guarantees effectively and. at the same time, maximizing the throughput. Simulations are used to verify the performance of the proposed scheduling policy. Experimental results show that our proposal can provide guaranteed throughput and maximum delay bound more efficiently compared to other policies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8B
• /
• pp.730-738
• /
• 2004

In this paper, System performance parameters such as throughput, blocking probability and delay have been analyzed and expressed as a function of demanding traffic and service termination, probability, and we centers our discussion at particular downlink port of satellite switch which is capable of switching the individual spot beam and processing the information signals in the packet satellite communications with demand assigned multiple access technique. Delay versus throughput as a function of traffic parameters with several service termination probability can be derived via mathematical formulation and the relative differences of transmission delay is also compared.

• Journal of Communications and Networks
• /
• v.15 no.4
• /
• pp.430-438
• /
• 2013

This paper addresses the issue of throughput-delay of one-to-many wireless multi-hop flows based on random linear network coding (RLNC). Existing research results have been focusing on the single-hop model which is not suitable for wireless multi-hop networks. In addition, the conditions of related system model are too idealistic. To address these limitations, we herein investigate the performance of a wireless multi-hop network, focusing on the one-to-many flows. Firstly, a system model with multi-hop delay was constructed; secondly, the transmission schemes of system model were gradually improved in terms of practical conditions such as limited queue length and asynchronous forwarding way; thirdly, the mean delay and the mean throughput were quantified in terms of coding window size K and number of destination nodes N for the wireless multi-hop transmission. Our findings show a clear relationship between the multi-hop transmission performance and the network coding parameters. This study results will contribute significantly to the evaluation and the optimization of network coding method.