• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4A
• /
• pp.330-335
• /
• 2007

This paper proposes a multichannel random access channel allocation scheme for multihop cellular networks to guarantee the stable throughput of a random access. The fundamental contribution is a mathematical formula for an optimal partition ratio of shared random access channels between a base station and a relay station. In addition, the proposed scheme controls the retransmission probability of random access packets under heavy load condition. Simulation results show that the proposed scheme can guarantee the required random access channel utilization and packet transmission delay even if the a random access packet arrival rate is higher than 0.1.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6A
• /
• pp.652-658
• /
• 2008

In this paper, a new random access scheme is proposed to improve the probability of successful access. In the conventional scheme, a packet is transmitted by a user using one slot and considered successfully transmitted if a collision does not occur. In comparison, a packet of the proposed scheme is transmitted by a user using one or more slots and considered successfully transmitted if there is at least one slot without collision. We evaluate the optimal number of slots selected by users to maximize the probability of successful access when the probability distribution functions for the number of users are given such as Binomial and Poission distribution. From the numerical analysis, it is shown that the proposed scheme performs better than conventional scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.6
• /
• pp.1313-1320
• /
• 2015

In this paper, we propose a user detection technique based on parallel orthogonal matching pursuit (POMP) for uplink multi-user random access networks (RANs) with a number of users and receiver antennas. In general RANs, it is difficult to estimate the number of users simultaneously transmitting packets at the receiver because users with data send the data without grant of BS. In this paper, therefore, we modify the original POMP for the RAN and evaluate its performances through extensive computer simulations. Simulation results show that the proposed POMP can effectively detect activated users more than about 2%~8% compared with the conventional OMP in RANs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7A
• /
• pp.973-986
• /
• 1999

In this paper, we propose MAC protocol that consists of channel access mechanism and transmission mechanism to support effective wireless packet data service. In channel access mechanism, broadcast channel announces status information of random access channel, and mobile station tries random access based on status information. Also, mobile station has access probability to prevent collision increase due to transmission of short message. For effective transmission, mobile station changes transmission rate based on transmission queue status to adapt burst traffic characteristics. In restricted environments of transmission code and bandwidth, proposed protocol shows better performance than cdma2000 system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5B
• /
• pp.310-316
• /
• 2005

In this paper, we proposed and evaluated ARAH(Adaptive Random Access algorithm for HIPERLAN/2) to improve system performance. In this paper, HIPERLAN/2 uses OFDM(Orthogonal Frequency Division Multiplexing) modulation scheme to select appropriate PHY mode by Radio Channel Quality, Proposed the ARAH scheme uses these 7 PHY mode when mobile terminal determines the RCH(Random CHannel) number for random access. In this paper, these 7 PHY mode divided into two group, good and bad, and will be given high priority to mobile terminals which are in a good group. In the result of performance evaluation. ARAH algorithm, ARAH has a better performance of throughput and delay than existing algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6A
• /
• pp.659-665
• /
• 2008

If ranging processes are not frequent in an uplink OFDMA system, the timing synchronization between base and mobile stations may not be maintained. Especially in the case of infrequent random accesses in a large cell, timing offsets can be considerable and the destroyed orthogonality of OFDMA signals may result in the degraded performance. This paper proposes a novel random access scheme for uplink OFDMA systems, which support the orthogonality of OFDMA signals with timing offsets by allowing a random access OFDMA symbol shorter than a normal one. In order to make uplink OFDMA systems robust to timing offsets, the proposed scheme inserts a zero-padding region in an OFDMA symbol.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.9
• /
• pp.2014-2021
• /
• 2015

Opportunistic interference alignment (OIA) has been proposed for multi-cell random access networks (RAN), which minimizes the generating interference to neighboring RANs and yields better performance compared with the conventional techniques. The OIA for RANs considers both physical (PHY) and medium access control (MAC) layers. In this paper, we introduce a protocol of which each user maximizes the transmit signal regardless of the generating interference to neighboring RANs, contrary to the OIA technique. In addition, we compare the performance of the signal-maximization technique with the OIA technique.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.115-117
• /
• 2022

The electrical characteristics of the monolithic 3-dimensional static random access memory consisting of a feedback field-effect transistor (M3D-SRAM-FBFET) was investigated using technology computer-aided design (TCAD). The N-type FBFET and N-type MOSFET are designed with fully depleted silicon on insulator (FDSOI), and those are located at bottom and top tiers, respectively. For the M3D-SRAM-FBFET, as the supply voltage decreased from 1.9 V to 1.6 V, the reading on-current decreased approximately 10 times.

• 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 and Information Engineers
• /
• v.52 no.3
• /
• pp.48-55
• /
• 2015

This paper studies how to solve a problem caused by M2M terminals sending a few data based on $3^{rd}$ Generation Partnership Project(3GPP) Long Term Evolution-Advanced(LTE-A) system and then it is analyzed, proposed, and introduced into the techniques. Especially, it is introduced solution for the lack of Random Access Channel and an increasing number of latency caused by countless M2M devices. It is proposed the technology for M2M grouping as well as allowable access probability according to user type. As it decreases the number of terminal by grouping M2M devices to try random access at PRACH, it can be reduced collision between Cellular users and M2M devices. So, it is proved that the proposed mechanism can solve the increasing average latency of random access on system coexisting Cellular users and M2M devices through simulations.