• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.65-67
• /
• 2004

Change of state of Channel between two wireless terminals which is caused by noise and multiple environmental conditions for happens frequently from the Wireles Network. So, When it is like that planning a wireless network protocol or performance analysis, it follows to change of state of time-varying channel and packet the analysis against a transmission efficiency is necessary. In this paper, analyzes transmission time of a packet and a packet in a time-varying and packet based Wireless Network. To reflecte the feature of the time-varying channel, we use a Signal Flow Graph model. From the model the mean of transmission time and the mean of queue length of the packet are analyzed in terms of the packet distribution function, the packet transmission service time, and the PER of the time-varying channel.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.57-60
• /
• 2001

This paper has studied the WAP packet transmission time, using WTP SAR algorithm. One method that is improved transfer ability, SAR fragmented WTP total message down from upper layer and then packet is transmitted to RLP frame time slot. In this paper, we analysis the transmission time of WAP packet with variable HLP layer size on the CDMA wireless channel for next generation systems as well as PCS, DCS. From the results, we can obtain the WAP packet transmission time and optimal WTP packet size.

• Journal of information and communication convergence engineering
• /
• v.4 no.2
• /
• pp.71-74
• /
• 2006

A basic access method about IEEE 802.11 MAC layer protocol using IEEE 802.11 wireless LANs is the DCF thatis based on the CSMA/CA. But, cause of IEEE 802.11 MAC layer uses original backoff algorithm (exponential backoff method), when collision occurred, the size of contention windows increases the double size Also, a time of packet transmission delay increases and efficienty is decreased by original backoff scheme. In this paper, we have analyzed TCP packet transmission time of IEEE 802.11 MAC DCF protocol for wireless LANs a proposed enhanced backoff algorithm. It is considered the transmission time of transmission control protocol (TCP) packet on the orthogonal frequency division multiplexing (OFDM) in additive white gaussian noise (A WGN) and Rician fading channel. From the results, a proposed enhanced backoff algorithm produces a better performance improvement than an original backoff in wireless LAN environment. Also, in OFDM/quadrature phase shift keying channel (QPSK), we can achieve that the transmission time in wireless channel decreases as the TCP packet size increases and based on the data collected, we can infer the correlation between packet size and the transmission time, allowing for an inference of the optimal packet size in the TCP layer.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.530-533
• /
• 2006

Recently, a basic access method about IEEE 802.11 MAC layer protocol using IEEE 802.11 wireless LANs is the DCF thatis based on the CSMA/CA. But, cause of IEEE 802.11 MAC layer uses original backoff algorithm (exponential backoff method), when collision occurred, the size of contention windows increases the double size. Also, a time of packet transmission delay increases and efficiency is decreased by original backoff scheme. In this paper, we have analyzed TCP packet transmission time of IEEE 802.11 MAC DCF protocol for wireless LANs a proposed enhanced backoff algorithm. It is considered the transmission time of transmission control protocol (TCP) packet on the orthogonal frequency division multiplexing (OFDM) in additive white gaussian noise (AWGN) and Rician fading channel. From the results, a proposed enhanced backoff algorithm produces a better performance improvement than an original backoff in wireless LAN environment. Also, in OFDM/quadrature phase shift keying channel (QPSK), we can achieve that the transmission time in wireless channel decreases as the TCP packet size increases and based on the data collected, we can infer the correlation between packet size and the transmission time, allowing for an inference of the optimal packet size in the TCP layer.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.46 no.2
• /
• pp.57-71
• /
• 2023

In this study, we analyze a finite-buffer M/G/1 queueing model with randomized pushout space priority and nonpreemptive time priority. Space and time priority queueing models have been extensively studied to analyze the performance of communication systems serving different types of traffic simultaneously: one type is sensitive to packet delay, and the other is sensitive to packet loss. However, these models have limitations. Some models assume that packet transmission times follow exponential distributions, which is not always realistic. Other models use general distributions for packet transmission times, but their space priority rules are too rigid, making it difficult to fine-tune service performance for different types of traffic. Our proposed model addresses these limitations and is more suitable for analyzing communication systems that handle different types of traffic with general packet length distributions. For the proposed queueing model, we first derive the distribution of the number of packets in the system when the transmission of each packet is completed, and we then obtain packet loss probabilities and the expected number of packets for each type of traffic. We also present a numerical example to explore the effect of a system parameter, the pushout probability, on system performance for different packet transmission time distributions.

• Journal of Communications and Networks
• /
• v.5 no.1
• /
• pp.25-32
• /
• 2003

4G mobile communication system requires the throughput of 10-100Mbps. Adaptive modulated OFDM system is promising technique for increasing the throughput. In the pilot symbol assisted high-speed packet transmission system, the data symbol duration is generally considered to be small compared to the coherence time. However, OFDM symbol duration is longer than the symbol duration of a single carrier system, so that the packet duration of the pilot symbol assisted high speed packet transmission system is long. In this case, the change of channel conditions is too fast to be accurately estimated by channel estimator at the receiver in high Doppler frequency, so that many errors occur during demodulation, especially with the data symbols at the end of each packet. In this paper, we consider the BER at various instantaneous $E_b/N_o$ that includes the demodulation errors in high Doppler frequency. When the coherence time is ten times longer than the duration of a single packet, the channel can be closely approximated as an AWGN channel. Otherwise, the approximation breaks down and the above-mentioned errors that occur during demodulation must be taken into consideration. In this paper, we propose the pilot symbol assisted high speed packet transmission system based on adaptive OFDM using a novel lookup table to consider the demodulated errors and evaluate the throughput performance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.2 s.332
• /
• pp.23-38
• /
• 2005

The state of channel between two or more wireless terminals is changed frequently due to noise or multiple environmental conditions in wireless network. In this paper, we analyze packet transmission time and queue length in a time-varying channel of packet based Wireless Networks. To reflect the feature of the time-varying channel, we model the channel as two-state Markov model and three-state Markov model Which are transformed to SFG(Signal Flow Graph) model, and then the distribution of the packet transmission can be modeled as Gaussian distribution. If the packet is arrived with Poisson distribution, then the packet transmission system is modeled as M/G/1. The average transmission time and the average queue length are analyzed in the time-varying channel, and are verified with some simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.684-693
• /
• 2003

This paper analyzes transmissiondelays of a message and a packet in a time-varying and packet-based radio link. The paper assumes that thearrivals of messages have a Bernoulli process and the lengths of the messages a exponential distribution. To reflect the feature of the time-varying radio link, we use a two-state Markov model. From the model the mean transmission delay of and the mean queue length of the packet are analyzed in terms of the packet distribution function, the packet transmission service time, and the PER of the radio link. And the mean message transmission delay time and the mean queue length are derived using the performance indices of the packet. Numerical results show that the message arrival rate and the message length have some bounds to keep the transmission of the message steady and to improve the performance indices of the message. It can be known that the PER of the state influences on the performance indices more than the sojourn time of the state.

• Journal of Industrial Technology
• /
• v.27 no.B
• /
• pp.235-243
• /
• 2007

Sensor network is used to obtain sensing data in various area. The interval to sense the events depends on the type of target application and the amounts of data generated by sensor nodes are not constant. Many applications exploit long sensing interval to enhance the life time of network but there are specific applications that requires very short interval to obtain fine-grained, high-precision sensing data. If the number of nodes in the network is increased and the interval to sense data is shortened, the amounts of generated data are greatly increased and this leads to increased amount of packets to transfer to the network. To transfer large amount of packets fast, it is necessary that the delay between successive packet transmissions should be minimized as possible. In Sensor network, since the Operating Systems are worked on the event driven, the Timer Event is used to transfer packets successively. However, since the transferring time of packet completely is varies very much, it is very hard to set appropriate interval. The longer the interval, the higher the delay and the shorter the delay, the larger the fail of transfer request. In this paper, we propose ESTEO which reduces the delay between successive packet transmissions by using SendDone Event which informs that a packet transmission has been completed.In ESTEO, the delay between successive packet transmissions is shortened very much since the transmission of next packet starts at the time when the transmission of previous packet has completed, irrespective of the transmission timee. Therefore ESTEO could provide high packet transmission rate given large amount of packets.

• Journal of Internet Computing and Services
• /
• v.18 no.6
• /
• pp.65-73
• /
• 2017

Congestion occurring at wireless sensor networks(WSNs) causes packet delay and packet drop, which directly affects overall QoS(Quality of Service) parameters of network. Network congestion is critical when important data is to be transmitted through network. Thus, it is significantly important to effectively control the congestion. In this paper, new mechanism to guarantee reliable transmission for the important data is proposed by considering the importance of packet, configuring packet priority and utilizing the settings in routing process. Using this mechanism, network condition can be maintained without congestion in a way of making packet routed through various routes. Additionally, congestion control using packet service time, packet inter-arrival time and buffer utilization enables to reduce packet delay and prevent packet drop. Performance for the proposed mechanism was evaluated by simulation. The simulation results indicate that the proposed mechanism results to reduction of packet delay and produces positive influence in terms of packet loss rate and network lifetime. It implies that the proposed mechanism contributes to maintaining the network condition to be efficient.