• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.11
• /
• pp.4203-4223
• /
• 2021

Accelerated by the Internet of Things (IoT), the need for further technical innovations and developments within wireless communications beyond the fifth generation (B5G) networks is up-and-coming in the past few years. High altitude platform station (HAPS) communication is expected to achieve such high levels that, with high data transfer rates and low latency, millions of devices and applications can work seamlessly. The HAPS has emerged as an indispensable component of next-generations of wireless networks, which will therefore play an important role in promoting massive IoT interconnectivity with 6G. The performance of communication and key technology mainly depend on the characteristic of channel, thus we propose an efficient Markov chain based channel model, then analyze the HAPS communication system's uplink capability and swing effect through experiments. According to the simulation results, the efficacy of the proposed scheme is proven to meet the requirements of ubiquitous connectivity in future IoT enabled by 6G.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.1
• /
• pp.145-151
• /
• 2014

This paper proposes an image haze removal algorithm for a single image. The conventional Dark Channel Prior(DCP) algorithm estimates a transmission map using the dark information in an image, and the haze regions are then detected using a matting algorithm. However, since the DCP algorithm uses block-based processing, block artifacts are invariably formed in the transmission map. To solve this problem, the proposed algorithm generates a modified transmission map using a Hidden Markov Random Field(HMRF) and Expectation-Maximization(EM) algorithm. Experimental results confirm that the proposed algorithm is superior to conventional algorithms in image haze removal.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.9
• /
• pp.2036-2040
• /
• 2013

In this paper, we consider two dynamic spectrum access schemes in cognitive network with two independent and identically distributed channels. Under the first scheme, secondary users switch channel only after transmission failure. On the other hand, under the second one, they switch channel only after successful transmission. We develop a mathematical model to investigate the performance of the second one and analyze the model using 3-dimensional embedded Markov chain. Numerical results and simulations are presented to compare between the two schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4825-4847
• /
• 2016

In this paper, we focus on the per-flow throughput analysis of IEEE 802.11 multi-hop ad hoc networks. The importance of an accurate saturation throughput model lies in establishing the theoretical foundation for effective protocol performance improvements. We argue that the challenge in modeling the per-flow throughput in IEEE 802.11 multi-hop ad hoc networks lies in the analysis of the freezing process and probability of collisions. We first classify collisions occurring in the whole transmission process into instantaneous collisions and persistent collisions. Then we present a four-dimensional Markov chain model based on the notion of the fixed length channel slot to model the Binary Exponential Backoff (BEB) algorithm performed by a tagged node. We further adopt a continuous time Markov model to analyze the freezing process. Through an iterative way, we derive the per-flow throughput of the network. Finally, we validate the accuracy of our model by comparing the analytical results with that obtained by simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.9
• /
• pp.757-766
• /
• 2014

To compensate signal loss due to the channel blockage in satellite communication link, we propose a cooperative communication scheme for OTM(On-The-Move) terminal in next generation satellite communication systems. The proposed scheme configures cooperation subnet with adjacent OTM terminal with the help of ground communication equipment. Shared data is spread by orthogonal spreading code, then the spread sequences are transmitted simultaneously. The receiver combines the power of received signals by EGC(Equal gain combining). The OTM terminal blockage channel is modeled by 2-state Markov chain. We evaluate the bit error rate according to the blockage channel of the channel state for the performance analysis of the proposed scheme. As a result, the proposed scheme shows better BER performance than traditional scheme with the help of subset members. In particular, the proposed scheme shows superior performance as the channel block probability is higher. However, as the number of subset members is increasing, there is a constraint because of the higher multiple access interference.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.2A
• /
• pp.139-148
• /
• 2011

This paper presents the minimum-cost network selection scheme which determines the transmission instance in the multi-band maritime communication system, so that the shipment-related real-time information can be transmitted within the maximum allowed period. The transmission instances and the corresponding network selection process are modeled by a Markov Decision Process (MDP), for the channel model in the 2-state Markov chain, which can be solved by stochastic dynamic programming. It derives the minimum-cost network selection rule, which can reduce the network cost significantly as compared with the straight-forward scheme with a periodic transmission.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.1E
• /
• pp.3-6
• /
• 1999

In digital mobile communication system, the transmission errors affect the quality of output speech seriously. There are many error concealment techniques using a posteriori probability which provides information about any transmitted parameter. They need knowledge about channel transition probability as well as the 1st order Markov transition probability of codec parameters for estimation of transmitted parameters. However, in applications of mobile communication systems, the channel transition probability varies depending on nonstationary channel characteristics. The mismatch of designed channel transition probability of the estimator to actual channel transition probability degrades the performance of the estimator. In this paper, we proposed a new parameter estimator which adapts to the channel characteristics using short time average of maximum a posteriori probabilities(MAPs). The proposed scheme, when applied to the LSP parameter estimation, performed better than the conventional estimator which do not adapt to the channel characteristics.

• Journal of Satellite, Information and Communications
• /
• v.10 no.4
• /
• pp.39-45
• /
• 2015

Satellite communication is high-speed large-capacity transmission in such a manner as to communicate with satellites in the chamber, and there is a wide area communication, but is not the security of the information. To compensate for this, AES encryption was applied to the CTR and CBC mode. Also, Blockage channel using a Markov chain to determine the impact caused by obstacles such as trees or buildings between the transmitter and the receiver was composed of Urban and Open Environment. The results of analyzing the performance of satellite communications over a high-speed link-based simulation, If applying encryption, performance of security is complementary but performance of the BER was aggravated and In the Open Environment fewer obstacles confirmed the BER performance is improved than the Urban Environment many obstacles.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.121-127
• /
• 2016

Satellite communication is a communication method using a satellite as a repeater communication on the air and have a communication range is wide and is possible to transmit high-speed data, so Satellite communication has been highlighted as the next generation communication. However, because the distance between the ground and the satellite is far away, there is a disadvantage that propagation delay time is very long and packet is damaged. Therefore, this study was applied to Link Relay H-ARQ system in order to complement the damage to the packet. Furthermore, we propose the Modified Link Relay H-ARQ scheme is a new scheme to supplementation the delay time. By applying the Markov channel for implementing a channel of satellite communications, the results of analyzing the performance, when applying the Link Relay HARQ scheme, BER and PER performance was improved, when applying the Modified Link Relay H-ARQ scheme, Throughput performance was confirmed improvement.

• Journal of Communications and Networks
• /
• v.11 no.2
• /
• pp.134-147
• /
• 2009

Tracking and exploiting instantaneous spectrum opportunities are fundamental challenges in opportunistic spectrum access (OSA) in presence of the bursty traffic of primary users and the limited spectrum sensing capability of secondary users. In order to take advantage of the history of spectrum sensing and access decisions, a sequential decision framework is widely used to design optimal policies. However, many existing schemes, based on a partially observed Markov decision process (POMDP) framework, reveal that optimal policies are non-stationary in nature which renders them difficult to calculate and implement. Therefore, this work pursues stationary OSA policies, which are thereby efficient yet low-complexity, while still incorporating many practical factors, such as spectrum sensing errors and a priori unknown statistical spectrum knowledge. First, with an approximation on channel evolution, OSA is formulated in a multi-armed bandit (MAB) framework. As a result, the optimal policy is specified by the wellknown Gittins index rule, where the channel with the largest Gittins index is always selected. Then, closed-form formulas are derived for the Gittins indices with tunable approximation, and the design of a reinforcement learning algorithm is presented for calculating the Gittins indices, depending on whether the Markovian channel parameters are available a priori or not. Finally, the superiority of the scheme is presented via extensive experiments compared to other existing schemes in terms of the quality of policies and optimality.