• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.2893-2907
• /
• 2019

Wireless mobile communication systems in subway tunnels have been widely researched these years, due to increased demand for the communication applications. As a result, an accurate model is essential to effectively evaluate the communication system performance. Thus, a neoteric three-dimensional (3D) geometry-based stochastic model (GBSM) is proposed for the massive multiple-input multiple-output (MIMO) fading channels in tunnel environment. Furthermore, the statistical properties of the channel such as space-time correlation, amplitude and phase probability density are analyzed and compared with those of the traditional two-dimensional (2D) model by numerical simulations. Finally, the ergodic capacity is investigated based on the proposed model. Numerical results show that the proposed model can describe the channel in tunnels more practically.

• International Journal of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.43-51
• /
• 2023

Slotted ALOHA (S-ALOHA) is a classical medium access control protocol widely used in multiple access communication networks, supporting distributed random access without the need for a central controller. Although stability and delay have been extensively studied in existing works, most of these studies have assumed ideal channel conditions or independent fading, and the impact of time-correlated wireless channels has been less addressed. In this paper, we investigate the queueing delay performance in S-ALOHA networks under time-correlated channel conditions by utilizing a Gilbert-Elliott model. Through simulation studies, we demonstrate how temporal correlation in the wireless channel affects the queueing delay performance. We find that stronger temporal correlation leads to increased variability in queue length, a larger probability of having queue overflows, and higher congestion levels in the S-ALOHA network. Consequently, there is an increase in the average queueing delay, even under a light traffic load. With these findings, we provide valuable insights into the queueing delay performance of S-ALOHA networks, supplementing the existing understanding of delay in S-ALOHA networks.

• Journal of electromagnetic engineering and science
• /
• v.7 no.1
• /
• pp.35-41
• /
• 2007

An alternative solution to the problem of obtaining acceptable performances on a fading channel is the diversity technique, which is widely used to combat the fading effects of time-variant channels. The symbol error probability of M-ary DPSK (MDPSK), PSK (MPSK) and QAM (MQAM) systems using 2 branches from the branch with the largest signal-to-noise ratio(SNR) at the output of L-branch selection combining(SC), i.e., SC2 in frequency-nonselective slow Nakagami fading channels with an additive white Gaussian noise(AWGN) is derived theoretically. These performance evaluations allow designers to determine M-ary modulation methods against Nakagami fading channels.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.1
• /
• pp.101-105
• /
• 2008

This paper proposes an analytical model to calculate VoIP (Voice of IP) capacity over wireless LANs with frequent bit errors. Since the traditional analytical models for VoIP capacity have not included the effect of bit errors, simulations ould only evaluate VoIP capacity over erroneous channels. For analytically accurate estimation of VoIP capacity over noisy channels, we extend the conventional model to include the effect of propagation errors, end-to-end delay, voice quality, the waiting time in AP(Access Point). The experiments show that our model predicts the VoIP capacity of a given network within the range from 3% to 9% difference comparing with the simulation results.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.3
• /
• pp.103-109
• /
• 2010

Total performance is improved by minimizing the channel interference between links in wireless mesh networks (WMNs). The paper refines on the CB-CA [1] to be suitable for multi-radio multi-channel (MRMC) WMNs. The CB-CA is the cluster-based channel assignment algorithm for one radio three channel WMN based on IEEE 802.11b/g. The CB-CA does not perform the channel scanning and the channel switching between the cluster heads (CHs) and the edge gateway nodes (EGs). However, the use of co-channel for links between CHs and EGs brings the problem of channel interference among many nodes. We propose and evaluate an improved CB-CA algorithm to solve this problem in MRMC WMNs. The proposed algorithm discriminates between transmission channel and receive channel and assigns channels to each interface randomly and advertises this information to neighbor clusters in order to be assigned no-interference channel between clusters. Therefore, the proposed algorithm can minimize the interference between clusters and also improve QoS, since it can use multiple interfaces and multiple channels.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.3
• /
• pp.145-154
• /
• 2006

WiBro (Wireless Broadband Internet) system is going to be 9ot down to commercialization. The high portable internet system is able to be connected to the high-speed internet using 2.3 GHz frequency bandwidth, anytime and anywhere. An effective scheduling for UGS, rtPS, nrtPS and BE requiring different QoS, which are service types of the WiBro, is necessary to increase the efficiency of radio channels that are the limiting resource. This paper researches an uplink scheduling that plays a role in assignment for the radio channels from subscribers to base stations. The suggested scheduling provides priorities with each service type considering QoS of them but reserves some bandwidth for lower priory services. After deciding effective amount of bandwidth for reservation, we suggest analytical result on mean delayed time of packet transmission for each terminal, transmission rate for the data, and capacity for uplink. This research can be used as basic data for the standard in the high portable internet system and as data to predict the capacity of base stations.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.347-353
• /
• 2005

WiBro (Wireless Broadband Internet) system is going to be commercialized before long. The high portable internet system is abie to be connected to the high-speed internet using 2.3 CHz frequency bandwidth, anytime and anywhere. An effective scheduling for UCS, rtPS. nrtPS and BE requiring different QoS, which are service types of the WiBro, is necessary to increase the efficiency of radio channels that arc the limiting resource. This paper researches an uplink scheduling that plays a role in assignment for the radio channels from subscribers to base stations. The suggested scheduling provides priorities With each service type considering QoS of them but reserves some bandwidth for lower priory services. After deciding effective amount of bandwidth for reservation, we suggest analytical result on mean delayed time of packet transmission for each terminal, transmission rate for the data, and capacity for uplink. This research can be used as basic data for the standard in the high portable internet system and as data to predict the capacity of base stations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5A
• /
• pp.355-362
• /
• 2009

In real-time communication services, delay constraints are among the most important QoS (Quality of Service) factors. In particular, it is difficult to guarantee the delay requirement over wireless channels, since they exhibit dynamic time-varying behavior and even severe burst-errors during periods of deep fading. Channel throughput may be increased, but at the cost of the additional delays when ARQ (Automatic Repeat Request) schemes are used. For real-time communication services, it is very essential to predict data deliverability. This paper derives the delay distribution and the successful delivery probability within a given delay budget using a priori channel model and a posteriori information from the perspective of queueing theory. The Gilbert-Elliot burst-noise channel is employed as an a Priori channel model, where a two-state Markov-modulated Bernoulli process $(MMBP_2)$ is used. for a posteriori information, the channel parameters, the queue-length and the initial channel state are assumed to be given. The numerical derivation is verified and analyzed via Monte Carlo simulations. This numerical derivation is then applied to a rate control scheme for real-time video transmission, where an optimal encoding rate is determined based on the future channel capacity and the distortion of the reconstructed pictures.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.2
• /
• pp.629-648
• /
• 2012

Given a video stream delivering system deployed on a multicast tree, which is embedded in a multi-channel multi-radio wireless mesh network, our problem is concerned about how to allocate interference-free channels to tree links and maximize the number of serviced mesh clients at the same time. In this paper, we propose a channel allocation heuristic algorithm based on best-first search and backtracking techniques. The experimental results show that our BFB based CA algorithm outperforms previous methods such as DFS and BFS based CA methods. This superiority is due to the backtracking technique used in BFB approach. It allows previous channel-allocated links to have feasibility to select the other eligible channels when no conflict-free channel can be found for the current link during the CA process. In addition to that, we also propose a tree refinement method to enhance the quality of channel-allocated trees by adding uncovered destinations at the cost of deletion of some covered destinations. Our aim of this refinement is to increase the number of serviced mesh clients. According to our simulation results, it is proved to be an effective method for improving multicast trees produced by BFB, BFS and DFS CA algorithms.

• Journal of electromagnetic engineering and science
• /
• v.12 no.1
• /
• pp.13-19
• /
• 2012

In this paper, we investigate cooperative transmission in one-dimensional random wireless networks. In this scheme, a stationary source communicates with a stationary destination with the help of N relays, which are randomly placed in a one-dimensional network. We derive exact and approximate expressions of the average outage probability over Rayleigh fading channels. Various Monte-Carlo simulations are presented to verify the accuracy of our analyses.