• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.2C
• /
• pp.57-64
• /
• 2011

A two-way relay channel is a bidirectional cooperative communication channel between two nodes using a relay. In many cooperative communication schemes, a relay transmits its data to each node using separate channels. However, in the two-way relay channel, a relay can broadcast the network-coded signal to both nodes in a same time slot, which can increase the system throughput. In this paper, a new cooperative network error correcting scheme using distributed turbo code in a two-way relay channel is proposed. The proposed scheme not only increases the system throughput using network code but also improves the performance by utilizing the LLR information from relay node and other user node through distributed turbo code. Also, a power allocation scheme is investigated for various channel conditions to improve the system performance.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.5
• /
• pp.370-376
• /
• 2020

In this study, we consider a group-based random access method for group connection and delivery by grouping devices when H2H devices and large-scale M2M devices coexist in a cell in NB-IoT environment. H2H devices perform individual random access, but M2M devices are grouped according to a NPRACH transmission period, and a leader of each group performs random access. The preamble is allocated using the variable preamble allocation algorithm of the Disjoint Allocation(DA) method. The proposed preamble allocation algorithm is an algorithm that preferentially allocates preambles that maximizes throughput of H2H to H2H devices and allocates the rest to M2M devices. The access distribution of H2H and M2M devices was set as Poisson distribution and Beta distribution, respectively, and throughput, collision probability and resource utilization were analyzed. As the random access transmission slot is repeated, the proposed preamble allocation algorithm decreases the collision probability from 0.93 to 0.83 and 0.79 when the number M2M device groups are 150. In addition, it was found that the amount of increase decreased to 33.7[%], 44.9[%], and 48.6[%] of resource used.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.11
• /
• pp.32-36
• /
• 2008

In this paper, we investigate the capacity of CDMA/TDD in the inner zone of multimode scenario with dual-band operation where high frequency band is used for TDD in the inner zone and lower frequency band is utilized for FDD in the outer zone. The effects of various system parameters such as cell radius, date rate, and time slot allocation are analyzed.

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

In this paper, we investigated the throughput of a cognitive radio network where two primary frequency channels (PCs) are sensed and opportunistically accessed by N secondary users. The sharing sensing member (SSM) protocol is introduced to sense both PCs simultaneously. According to the SSM protocol, N SUs (Secondary User) are divided into two groups, which allows for the simultaneous sensing of two PCs. With a frame structure, after determining whether the PCs are idle or active during a sensing slot, the SUs may use the remaining time to transmit their own data. The throughput of the network is formulated as a convex optimization problem. We then evaluated an iterative algorithm to allocate the optimal sensing time, fusion rule and the number of members in each group. The computer simulation and numerical results show that the proposed optimal allocation improves the throughput of the SU under a misdetection constraint to protect the PCs. If not, its initial date of receipt shall be nullified.

• Journal of information and communication convergence engineering
• /
• v.7 no.2
• /
• pp.164-169
• /
• 2009

An RFID system consists of radio frequency tags attached to objects that need to be identified and one or more electromagnetic readers. Unlike the traditional bar code system, the great benefit of RFID technology is that it allows information to be read without requiring contact between the tag and the reader. For this contact-less feature, RFID technology in the near future will become an attractive alternative to bar code in many application fields. In almost all the 13.56MHz RFID systems, FSA (Framed Slot ALOHA) algorithm is used for identifying multiple tags in the reader's identification range. In FSA algorithm, the tag identification time and system efficiency depend mainly on the number of tags and frame size. In this paper, we propose a tag number estimation scheme and a dynamic frame size allocation scheme based on the estimated number of tags.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.263-264
• /
• 2008

고속 무선 PAN(Personal Area Networks)기술은 10m 이내의 짧은 거리에서 고속으로 대용량의 데이터를 전송하기 위한 기술로, 최근 무선 USB(Wireless Universal Serial Bus)나 HDTV(High Definition TV)와 같은 광대역 멀티미디어 응용 시장을 겨냥한 연구가 IEEE 802.15.3과 WiMedia를 중심으로 활발히 진행되고 있다. [1] 본 논문에서는 WiMedia Alliance에서 제안한 Distributed Medium Access Control (D-MAC)에서 다수 스트림의 QoS 요구를 만족시키는 신뢰성 있는 전송을 위해 데이터 시간 슬롯을 효율적으로 할당하는 알고리즘에 대해 연구하고자 한다.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.59-68
• /
• 1996

In this paper, we propose two types of WDMA protocol for multi-wavelength optical networks that have a dedicated control channel. Protocol type I is designed for the case that the number of nimislots is less than the number of nodes (La${\ge}$M). Proposed protocols employ the aging scheme to guarantee a fairness in the process of channel allocation. The perfomrance of proposed protocols are evaluated in terms of throughput and delay with variations in offered load. Simulation results show that the proposed protocols have superior performance to conventional protocols.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.771-774
• /
• 1999

This paper presents a new timing structure for real time communications and its performance analysis. The cycle time consists of several "one time slot" which may be an interval defined by a synchronous traffic part followed by an asynchronous traffic part. If a station receives a token within a synchronous interval, it transmits its synchronous message if any, otherwise it may transmit an asynchronous message. This scheme is different from usual allocation schemes which divide one cycle into alternating synchronous and asynchronous subslots. This protocol is designed to prevent low priority messages from delaying too much due to lots of high priority messages. We propose the algorithm and show its justification by simulation.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.423-425
• /
• 2007

In this paper, Medium Access Control(MAC) protocol designed for Wireless Body area Sensor Network(Bio-MAC) is proposed, Because in WBSN, the number of node is limited and each node has different characteristics. Also, reliability in transmitting vital data sensed at each node and periodic transmission should be considered so that general MAC protocol cannot satisfy such requirements of biomedical sensors in WBSN. Bio-MAC aims at optimal MAC protocol in WBSN. For this, Bio-MAC used Pattern -SuperFrame, which modified IEE E 802.15.4-based SuperFrame structurely. Bio-MAC based on TDMA uses Medium Access-priority and Pattern eXchange -Beacon method for dynamic slot allocation by considering critical sensing data or power consumption level of sensor no de etc. Also, because of the least delay time. Bio-MAC is suitable in the periodic transmission of vital signal data. The simulation results demonstrate that a efficient performance in WBSN can be achieved through the proposed Bio-MAC.

• Journal of the Korea Society for Simulation
• /
• v.14 no.2
• /
• pp.25-34
• /
• 2005

Determination of component mounting sequence on printed circuit board assembly process is a typical NP-hard problem. It is a kind of traveling salesman problems, but it has one more hard to meet constraint of matching component type per mounting position as well as searching the shortest path. An efficient method is developed by separation of crowed area and allowing up to two slots per component type. A simulation model is constructed using Visual C++ for evaluation of the suggested heuristic.