• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1868-1875
• /
• 1999

The design of LAI(Local Area Identifier), the first paging area for searching the mobile terminal has a close relation with the performance of paging channel in CDMA cellular network. This paper discussed the performance of the forward channel of IS-95 CDMA standard, known as the paging through the related messages such as call control message, channel assignment message, etc. Modeling and simulation work were conducted to quantify the performance of paging channel in terms of traffic handling capacity and blocking levels. The results shown are based on a specific system call model based on the operating system of cell cite. This serves as illustrative guidelines for the proper engineering of common control channel, which has a major impact on the overall performance of cellular network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1377-1386
• /
• 2000

As all delays resulting from the signaling network directly affect the response time of network management activity, all control informations have to be transported most efficiently. It is very important to know the performance of the signaling system not only because of smooth network operation but also because of efficient engineering of signaling networks. In this paper, we analyzed mean queueing delay of signaling link for ISUP signaling messages in common channel signaling system by using M[X]/G/1 and M[X]/D/1 batch arrival queueing system. This is because we modeled arrival process of the signaling messages as batch arrival process considering that many kinds of signaling messages are generated at short intervals when a call requests a connection. Analysis was carried out considering different call processing scenario based on ITU-T specification. We also described the numerical results from the different types of queueing models.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.3
• /
• pp.405-409
• /
• 2009

A polarization-independent multiwavelength-switchable fiber filter is proposed based on a polarization beam splitter and fiber coupler, which can function as a polarization-independent transmission or reflection-type interleaving filter. The proposed filter consists of a polarization beam splitter and a Sagnac birefringence loop composed of a 50:50 coupler, high birefringent fibers, and two quarter-wave plates. In the proposed filter, a transmission-type interleaver with a channel isolation > 18 dB or a reflection-type one with a channel isolation of ${\sim}3$ dB, whose channel spacing and switching displacement were 0.8 and 0.4 nm in common, respectively, could be obtained. A channel interleaving operation could be performed by the proper control of waveplates within the Sagnac birefringence loop.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.50-67
• /
• 2015

The Cognitive Radio (CR) paradigm in tactical ad hoc networks is an important element of future military communications for network-centric warfare. This paper presents a novel Cognitive Link State Routing protocol for CR-based tactical ad hoc networks. The proposed scheme provides prompt and reliable routes for Primary User (PU) activity through procedures that incorporate two main functions: PU-aware power adaptation and channel switching. For the PU-aware power adaptation, closer multipoint relay nodes are selected to prevent network partition and ensure successful PU communication. The PU-aware channel switching is proactively conducted using control messages to switch to a new available channel based on a common channel list. Our simulation study based on the ns-3 simulator demonstrates that the proposed routing scheme delivers significantly improved performance in terms of average end-to-end delay, jitter, and packet delivery ratio.

• Smart Media Journal
• /
• v.1 no.1
• /
• pp.17-26
• /
• 2012

In cognitive radio networks (CRNs), unlicensed users sense the licensed spectrum bands and opportunistically access them without interfering operations of licensed users. Especially, in ad hoc networks, the MAC layer plays an important role in coordinating unlicensed users access to the spectrum and, thus, a number of MAC protocols have been studied recently. In this paper, we comparatively examine MAC protocols in cognitive radio ad hoc networks (CRAHNs). First, we categorize the protocols on the basis of common control channel (CCC) requirements and further review major implementations for each category. Then, we make a qualitative comparison of the protocols in terms of inherent characteristics and performance.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.6
• /
• pp.527-533
• /
• 2013

BCI (Brain-Computer Interface) is a system that transforms a subject's brain signal related to their intention into a control signal by classifying EEG (electroencephalograph) signals obtained during the imagination of movement of a subject's limbs. The BCI system allows us to control machines such as robot arms or wheelchairs only by imaging limbs. With the exact same experiment environment, activated brain regions of each subjects are totally different. In that case, a simple approach is to use as many channels as possible when measuring brain signals. However the problem is that using many channels also causes other problems. When applying a CSP (Common Spatial Pattern), which is an EEG extraction method, many channels cause an overfitting problem, and in addition there is difficulty using this technique for medical analysis. To overcome these problems, we suggest an optimal channel selection method using a BPSO (Binary Particle Swarm Optimization), BPSO with channel impact factor, and GA. This paper examined optimal selected channels among all channels using three optimization methods and compared the classification accuracy and the number of selected channels between BPSO, BPSO with channel impact factor, and GA by SVM (Support Vector Machine). The result showed that BPSO with channel impact factor selected 2 fewer channels and even improved accuracy by 10.17~11.34% compared with BPSO and GA.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.39-45
• /
• 2011

In this paper, we propose an efficient multichannel MAC protocol with idle nodes assistance to avoid the multi-channel hidden terminal problem in cognitive radio ad hoc network and further to improve the performance of the network. The proposed MAC protocol can be applied to the cognitive radio adhoc network where every node is equipped with the single transceiver and one common control channel exists for control message negotiation. In the proposed protocol, the idle nodes available in the neighbour of communication nodes are utilized because the idle nodes have the information about the channels being utilized in their transmission range. Whenever the nodes are negotiating for the channel, idle nodes can help the transmitting and receiving nodes to select the free data channel for data transfer. With the proposed scheme, we can minimize the hidden terminal problem and decrease the collision between the secondary users when selecting the channel for data transfer. As a result, the performance of the network is increased.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.243-246
• /
• 2019

In cognitive radio networks, secondary transmitters should cease its transmission immediately under the detection of primary transmission in the spectrum they are using. Then they need to exploit another idle spectrums and resynchronize to the newly found idle spectrums. Most of related work presume the existence of separate control channel used by secondary users commonly for exchanging the information of idle spectrums. However, this presumption is not feasible in real world cognitive radio scenario. Therefore we address a proactive spectrum synchronization scheme with no need of separate control channel. Our scheme lets secondary users exchange the spectrum information periodically during normal communication process and determine the next spectrum band in advance of detecting primary transmission. We evaluate our scheme in a real world cognitive radio environments set up with USRPs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2124-2141
• /
• 2018

Recent studies have revealed the efficacy of incorporating delayed channel state information at transmit side (CSIT) in transmission scheme design. This paper focuses on transmit precoder design to maximize the ergodic sum-rate in a two-user Multiple-Input Single-Output (MISO) system with delayed and statistical CSIT. A new transmit strategy which precodes signals in all transmit slots is proposed in this paper, denoted as all time-slots precoding Alternative MAT (AAMAT). There is a common procedure in conventional delayed-CSIT based schemes, which is retransmitting the overheard interferences. Since the retransmitting signal is intended to both users, all previous schemes tend to use only one antenna. We however figure out an improvement in spectral efficiency could be realized if all antennas can be utilized. In this paper, we detail the design of the procoder which enabling all antennas and also we compute a lower bound of the ergodic sum-rate in an ideal condition. In addition, simulation results demonstrate the superiority of our proposed scheme.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.294-296
• /
• 2012

In cognitive radio ad hoc networks, secondary users need to exchange control information before data transmission. This task is not trivial in cognitive radio networks due to the dynamic nature of environment. This problem is sometime called rendezvous problem of cognitive radio network. The rendezvous problem is normally tackled by using two famous approaches: the use of common control channel (CCC) and using channel hopping (a.k.a sequence-based protocols). However, these two famous solutions form a vicious cycle while solving the rendezvous problem. The main purpose of this paper is to point out how and why this vicious cycle is formed.