• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.12
• /
• pp.1113-1118
• /
• 2012

Smart grid and intelligent transportation system draw significant interest since they are considered as one of the green technologies. These systems require a large number of sensors, actuators, and controllers. Also, machine-to-machine (M2M) communications is important because of the automatic control. The LTE-Advanced networks is preparing a set of functions that facilitate the M2M communications, and particularly the development of an efficient call admission control mechanism is critical. A method that groups MTC devices according to QoS constraints and determines the admission depending on the QoS satisfaction is limitedly applied only if the data transmission period and the maximum delay are identical. This paper proposed a call admission control that is free from such limitation and also optimizes the admission process under the certain condition of the transmission period and maximum delay. The theorems regarding the proposed method are presented with the proofs. The simulations confirms its validity and shows it is better in call admission probability than existing works.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12B
• /
• pp.838-846
• /
• 2005

In this paper, we consider the following two issues for implementing the synchronous Ethernet systems. First, a synchronous Ethernet system employs a fixed size superframe which is divided into a synchronous period and an asynchronous one. We note that the starting point of a superframe is not deterministic when an ordinary data frame's transmission is overlapped the superframe boundary. This overlap may be a fatal drawback for strict jitter bounded applications. Circumventing the problem, we propose a frame fragmentation scheme to provide a zero jitter, and compare its delay performance with the hold scheme which also provides the zero jitter. We next concern that IEEE 802.3x pause frames cannot be promptly transmitted in a synchronous period, and thus asynchronous traffics may be dramatically get dropped at the input buffer of a switch. To handle the problem, we propose an efficient flow control by allowing the transmission of the pause frame in a synchronous period, and investigate the blocking probability of the asynchronous traffics by the simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5A
• /
• pp.460-466
• /
• 2007

There are two coordination functions in IEEE 802.11 standard. One is PCF, polling based function, and the other is DCF, contention based function. DCF is simpler than PCF but the performance is similar with the latter. That's the reason why DCF is more popular than PCF. However, DCF has a risk of collision with other nodes in the network because the function is a distributed contention based one. CSMA/CA of DCF has collision avoidance algorithm in it, but the performance of avoidance algorithm has limitations. In this paper we proposed a new scheme called TAR(Tone-based Access scheme with Repetitive conention). In TAR, there is narrow contention-only channel other than original data transmitting channel, so that both a data transmission and the contention can be performed simultaneously. The TAR uses the same contention concept with the CSMA/CA, but it has the originality for the narrow contention channel and the repetitive contention scheme which greatly reduce the collision probability. We proved the performance of TAR by some simulations, and it showed good results.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.205-215
• /
• 2002

In this paper the Dynamic Minislot Reservation Protocol(DMRP) in which the control channel is divided into contention-less and contention minislots in order to reduce re-transmission probability in multicasting is proposed. In the network, earth node has two pairs of transceivers. A transceiver consisting of a fixed transmitter and a fixed receiver is used to control packet registration and the other transceiver is used to transmit data. Two types f transceivers for data transmission are considered : one is FT-TR(Fixed Transmitter-Tunable Receiver) and the other is TT-TR(Tunable Transmitter-Tunable Receiver). In the analysis, FT-TR and TT-TR single-hop passive star networks are compared. As results, we conclude that the DMRP protocol with dynamically divided control channel has improved the system performance such as throughput and system delay regardless of traffic type or network structure.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.794-797
• /
• 2015

As the interest in VANET is increased, a study on the beacon message transmission between vehicles is actively being made. IEEE 802.11p/1609.4 standard is based on a multichannel system consisting of multiple service channels (SCH) and a control channel (CCH). Multiple SCHs are defined for nonsafety data transfer, while the CCH is used to broadcast safety messages called beacons and control messages (i.e., service advertisement messages). However, most messages broadcast in the only one CCH belong to safety application that must be contested in dense vehicular network. This paper suggests safety message transfer algorithm in dense vehicular congestion. The proposed algorithm is that the priority of safety messages is decided by decision tree and messages are stored in proper queues according to their priorities. Then, safety messages with higher priorities are sent in turn by CCH in the assigned time. The proposed algorithm decreases the beacon transmission delay and increase on the probability of a successful beacon reception in an IEEE 802.11p/1609.4-based network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.4002-4014
• /
• 2015

ITU-R M.1842-1, as a well-known specification dedicated to maritime mobile applications, has standardized wireless transmission protocols according to the particular characteristics of a maritime communications scenario. A time division multiple access (TDMA) frame structure, along with modulation schemes to achieve a high data rate, has been described clearly in ITU-R M.1842-1. However, several specification items are still under "to be decided" status, which brings ambiguity to research works. In addition, the current version of ITU-R M.1842-1 is focused mainly on maritime transmissions in open-sea areas, where the cyclic prefix (CP) is set to zero and only 16-QAM is used in the multi-carrier (MC) system. System performance might be dramatically degraded in coastline areas due to the inter-symbol interference (ISI) caused by selective fading. This is because there is a higher probability that the signal will be reflected by obstacles in coastline areas. In this paper, we introduce the transmission resource block (TRB) dedicated to ITU-R M.1842-1 for a ship ad-hoc network (SANET), where the pilot pattern of TRB is based on the terrestrial trunked radio (TETRA). After that, we evaluated SANET performance under the maritime channel model in a coastline area. In order to avoid noise amplification and to overcome the ISI caused by selective fading, several strategies are suggested and compared in the channel estimation and equalization procedures, where the link-level simulation results finally validate our proposals.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4A
• /
• pp.369-379
• /
• 2011

During the routing process between nodes on the CR(Cognitive Radio) network conducting for efficient use of limited frequency resources, spectrum handover process due to the appearance of the PU occupies most of the routing latency, and also decreases the reliability of the path. In this paper, a cooperative routing protocol in a multi-channel environment is proposed. The source node broadcasts a message with available channel lists and probability of PU appearance during its route guidance. The intermediate nodes re-transmit the message, received from the source node, and update and maintain the information, status table of the path. The destination node determines the optimal path and sends a reply message to the selected path after it receives the messages from the intermediate nodes. The average probability of the PU appearance and the average time of the PU appearance are updated while transferring data. During data transmission the channel with the lowest probability of appearance of the PU is selected dynamically and if a PU appears on the current channel partial repairment is performed. It is examined that reliability of the selected path considerably is improved and the routing cost is reduced significantly compared to traditional routing methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.9
• /
• pp.1044-1053
• /
• 2016

In this paper, we consider the secondary users (SUs) who are capable of harvesting energy from ambient radio frequency (RF) signals and are allowed to sequentially sense up to 2 different channels to find out idle channels not occupied by the primary users (PUs). The EH SUs are permitted to transmit data packets only if both idle channels and sufficient energy are available. Compared with traditional SUs, the EH SUs consume energy with data transmission and also harvest energy without additional energy supply. Consequently, the battery state is expected to be fluctuated due to energy consumption and harvesting, and therefore we develop a Markov battery model to provide energy variations at the 2-channel sensing EH SUs. With the proposed battery model, we derive the steady-state probability that the EH SUs completely run out of energy, and the achievable throughput of EH SUs is derived accordingly. To evaluate the proposed Markov battery model, the Monte-Carlo simulation was performed to validate the accuracy of energy outage probability and achievable throughput at the 2-channel sensing EH SUs.

• Journal of Information Processing Systems
• /
• v.13 no.4
• /
• pp.677-688
• /
• 2017

In order to solve the undetected probability of multiple targets in ultra-wideband (UWB) through-the-wall radar imaging (TWRI), a time-delay and amplitude modified back projection (BP) algorithm is proposed. The refraction point is found by Fermat's principle in the presence of a wall, and the time-delay is correctly compensated. On this basis, transmission loss of the electromagnetic wave, the absorption loss of the refraction wave, and the diffusion loss of the spherical wave are analyzed in detail. Amplitude compensation is deduced and tested on a model with a single-layer wall. The simulating results by finite difference time domain (FDTD) show that it is effective in increasing the scattering intensity of the targets behind the wall. Compensation for the diffusion loss in the spherical wave also plays a main role. Additionally, the two-layer wall model is simulated. Then, the calculating time and the imaging quality are compared between a single-layer wall model and a two-layer wall model. The results illustrate the performance of the time-delay and amplitude-modified BP algorithm with multiple targets and multiple-layer walls of UWB TWRI.

• Journal of Communications and Networks
• /
• v.12 no.2
• /
• pp.174-180
• /
• 2010

Automatic Repeat reQuest (ARQ) is a very effective technique against transmission error at the medium access control (MAC) layer. An erroneous MAC protocol data unit can be typically retransmitted within a given limit. In order to improve the IP-level performance, which directly affects the user-perceived quality-of-service (QoS), we propose a new truncated ARQ strategy, called MAC service data unit-based ARQ (S-ARQ), where the finite number of opportunities for retransmissions are shared by multiple fragments out of an IP datagram. We describe how SARQ can be implemented in a practical system, and then propose another variant of S-ARQ employing a functionality called early detection of failure. Basically, we evaluate the performance of SARQ in two different manners. First, assuming i.i.d. error process, we analyze both the probability of the delivery failure and the average delay of IP datagram. Then, we assess the performance of S-ARQ via simulation over a 2-state Markov channel.