• Journal of Internet Computing and Services
• /
• v.13 no.1
• /
• pp.7-14
• /
• 2012

In this paper, performance of IEEE 802.11 carrier-sense multiple access with collision-avoidance (CSMA/CA) protocols in saturated traffic conditions is presented taking into account the impact of imperfect channel sensing. The imperfect channel sensing includes both missed-detection and false alarm and their impact on the performance of IEEE 802.11 is analyzed and expressed as a closed form. To include the imperfect channel sensing at the physical layer, we modified the state transition probabilities of well-known two state Markov process model. Simulation results closely match the theoretical expressions confirming the effectiveness of the proposed model. Based on both theoretical and simulated results, the probability of detection is concluded as a dominant factor for the performance of IEEE 802.11.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.17 no.5
• /
• pp.620-628
• /
• 2014

This paper describes the analysis results of channel characteristics in the operating area of satellite OTM (On-The-Move) terminal. The communication channel between the Koreasat-5 and OTM terminal on a test car was measured and recorded in downtown of Daejeon, using the received beacon signal of around 20 GHz. And the measurement data were statistically analyzed and then compared with highway and national road environments. The statistical evaluation of satellite channel was conducted by using probability density function and Markov model and then presented average connection duration(ACD), average fade duration(AFD), and level crossing rate(LCR) of downtown environment.

• Journal of Korea Multimedia Society
• /
• v.5 no.6
• /
• pp.704-711
• /
• 2002

Multimedia communication systems are characterized by supporting three different typer of services such as circuit switched services, and packet switched real Lime and non real time services. The wireless channels in a cell ate allocated by calls of these different service classes and the different service requirements have to be met. SRN is an extension of stochastic Petri nets and provides compact Modeling facilities for system analysis. To get the performance index, appropriate reward rates are assigned to its SRN. In this paper, we present a SRN model for performance analysis of channel allocation of multimedia mobile communication systems. The key contribution of this paper constitutes the Petri nets modeling techniques instead of complicate numerical analysis of Markov chains and easy way of performance analysis for channel allocations under SRN rewards concepts.

• Journal of applied mathematics & informatics
• /
• v.1 no.1
• /
• pp.1-12
• /
• 1994

We consider a single channel CSMA/CD system with D homogeneous stations and impeded buffer of infinite size. We find a sufficient condition for the model to be stable under the threshold control policy and derive the limiting distri-bution of the number of messages in the system at the moment of service completion. We also derive the limiting distributing of the number of messages in the system size at arbitrary time by using Markov regenerative processes. Some numerical examples and special cases are also treated.

• ETRI Journal
• /
• v.29 no.6
• /
• pp.829-831
• /
• 2007

This letter proposes an analytical model to characterize medium utilization in IEEE 802.11e operating in HCCA-EDCA mixed mode (HEMM). In contrast to existing works which model the backoff process in individual stations, we consider the channel occupancy pattern. Additionally, our work considers the operation of HEMM, which is not widely documented. We show that the proposed model accurately characterizes medium utilization with no more than 5% error.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.57-59
• /
• 2006

In this paper, we investigate the wireless TCP protocol for throughput improvement in wireless Broadband. If the burst error duration of a wireless link is significantly long, retransmissions of lost packets by Snoop TCP are fulfilled mainly not by the receipt of duplicate acknowledgement (DUPACKs) but by local timer expiration. With the proposed scheme, Snoop TCP recovers packet losses fast by shortening the interval of local retransmissions based on the channel status. From the simulation results, we can show that the proposed scheme can improve TCP throughput considerably.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.1
• /
• pp.25-39
• /
• 1986

In this paper, we analyze the performance, particularly the flow control mechanism, of the CCITT X.25 protocol in a packet-switched network. In this analysis, we consider the link and packet layers separately, and investigate the performance in three measures; normalized channel throughput, mean transmission time, and transmission efficiency. Each of these measures is formulated in terms of given protocol parameters such as windos size, $T_1$ and $T_2$ values, message length, and so forth. We model the service procedure of the inpur traffic based on the flow control mechanism of the X.25 protocol, and investigate the mechanism of the sliding window flow control with the piggybacked acknowlodgment scheme using a discrete-time Markov chain model. With this model, we study the effect of variation of the protoccol parameters on the performance of the X.25 protocol. From the numerical results of this analysis one can select the optimal valuse of the protocol parameters for different channel environments. it has been found that to maintain the trasnmission capacity satisfactorily, the window size must be greater than or equal to 7 in a high-speed channel. The time-out value, $T_1$, must carefully be selected in a noisy channel. In a normal condition, it should be in the order of ls. The value of $T_2$ has some effect on the transmission efficiency, but is not critical.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1855-1869
• /
• 1993

For the traditional ALOHA system without capture, the Markov chain obtained using the number of backlogged users at each slot if shown to be non-ergodic. So the infinite population ALOHA with fixed retransmission probabilities is unstable for any choice of the arrival rates and retransmission probabilities. The capture ALOHA system of also shown to be unstable for any arrival rate unless it has perfect. In this paper, we study a stabilization policy for capture ALOHA system that controls the retransmission probabilities and prove the stability of its multidimensional Markovian model by empolying a continuous Lyapunov function, and thus identify the stability region. We also study a delay performance through computer simulation th show the stability for any input rate below the maximum achievable channel throughput.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.6
• /
• pp.11-22
• /
• 1996

We address an issue of channel sharing among users by using a random assignment-transmitter-based (RA-T) spread-spectrum transmission scheme which permits the contention mode only in the transmission of a header while avoiding collision during the data packet transmission. Once the header being successfully received, the data packet is ready for reception by switching to one of programmable matched-filters. But the receoption may be blocked due to limited number of matched-filters so that this effect is taken into account in our analysis. For realistic analysis, we integrate detection performance at the physical level with channel activity at the link level through a markov chain model. We also consider an acknowledgement scheme to notify whether the header is correctly detcted and the data packet can be processed continuously, which aims at reducing the interference caused unwanted data transmission. It is shown that receiver complexity can be greatly reduced by choosing a proper number of RA codes at the cost of only a little throughput degradation.

• ETRI Journal
• /
• v.34 no.2
• /
• pp.276-279
• /
• 2012

In this letter, a modified 802.11-based opportunistic spectrum access is proposed for single-channel cognitive radio networks where primary users operate on a slot-by-slot basis. In our opportunistic spectrum access, control frames are used to reduce the slot-boundary impact and achieve channel reservation to improve throughput of secondary users. An absorbing Markov chain model is used to analyze the throughput of secondary users. Simulation results show that the analysis accurately predicts the saturation throughput.