• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4331-4346
• /
• 2015

The femtocell network, which is designed for low power transmission and consists of consumer installed small base stations, coexists with macrocells to exploit spatial reuse gain. For its realization, cross-tier interference mitigation is an important issue. To solve this problem, we propose a joint access and power control scheme that requires limited information exchange between the femto and macro networks. Our objective is to maximize the network throughput while satisfying each user's quality of service (QoS) requirement. To accomplish this, we first introduce two distributed interference detection schemes, i.e., the femto base station and macro user equipment based schemes. Then, the proposed scheme dynamically adjusts the transmission power and makes a decision on the access mode of each femto base station. Through extensive simulations, we show that the proposed scheme outperforms earlier works in terms of the throughput and outage probability.

• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• pp.594-596
• /
• 1998

In this paper, a path control switch has been developed for self-healing operation in SDH-based transmission system. The proposed switch is suitable for self-healing operations in both an Unidirectional Path Switched Ring and a 2-fiber Bidirectional Line Switched Ring. The path control switch is implemented with $0.8{\mu}m$ CMOS LSI chip. The self-healing operation of the switch is effectively done by the configuration information stored in the registers of the switch. The switch has an AU-3(51.84Mb/s) TSI(Time Slot Interchange) and has 1.25Gb/s throughput. But the higher throughput can be realized by combining two identical switches or more with the parallel architecture.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.25 no.1
• /
• pp.65-71
• /
• 2022

In this paper, we propose an opportunistic data relay scheme in narrowband multihop combat radio networks. Narrowband networks have physical restrictions on high-speed transmission. Furthermore, the topology changes dynamically due to the jamming of the enemy, signal interference between friendly forces, and movement of network entities. Therefore, the traditional relay scheme that collects topology information and calculates a relay path before transmission is unsuitable for such networks. Our proposed scheme does not collect topology information and transmits data opportunistically. The scheme can cause unnecessary data relaying that is not related to data delivery to the destination node. However, for small networks, the effect of increasing network throughput by not gathering topology information is much greater than the effect of reducing throughput by unnecessary data relays. We demonstrate the performance superiority of the proposed scheme through simulation in the worst case of network topology.

• Journal of Information Processing Systems
• /
• v.20 no.2
• /
• pp.226-238
• /
• 2024

Recently, multi-access edge computing (MEC) has emerged as a promising technology to alleviate the computing burden of vehicular terminals and efficiently facilitate vehicular applications. The vehicle can improve the quality of experience of applications by offloading their tasks to MEC servers. However, channel conditions are time-varying due to channel interference among vehicles, and path loss is time-varying due to the mobility of vehicles. The task arrival of vehicles is also stochastic. Therefore, it is difficult to determine an optimal offloading with resource allocation decision in the dynamic MEC system because offloading is affected by wireless data transmission. In this paper, we study computation offloading with resource allocation in the dynamic MEC system. The objective is to minimize power consumption and maximize throughput while meeting the delay constraints of tasks. Therefore, it allocates resources for local execution and transmission power for offloading. We define the problem as a Markov decision process, and propose an offloading method using deep reinforcement learning named deep deterministic policy gradient. Simulation shows that, compared with existing methods, the proposed method outperforms in terms of throughput and satisfaction of delay constraints.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.12
• /
• pp.984-986
• /
• 2013

DCF(Distributed Coordination Function) defined in IEEE 802.11 provides two different modes, namely, a 2-way handshake and a 4-way handshake according to the transmission procedure. If secondary transmission would not cause a collision with primary transmission, there is no need to postpone transmission unnecessarily. We study a feasible condition which can transmit data concurrently and propose a concurrent transmission scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9C
• /
• pp.826-833
• /
• 2007

In this paper, we present an adaptive transmission system model to establish the baseline for wireless adaptive transmission using CR (Cognitive Radio) systems, and propose an adaptive transmission scheme based on IT (Interference Temperature) cognition for CR systems in the presented system environment. The proposed CR adaptive transmission scheme is the method that provides the CR user with the maximum transmit power in the range of not causing any interference to the incumbent user and guaranteeing the optimal throughput by applying CR-AMC (CR-Adaptive Modulation and Coding) in the given channel state. Simulation results show that in case of using the proposed CR adaptive transmission scheme, there is little degradation of BER performance, while causing no interference to the incumbent user. At the same time, the proposed scheme guarantees the optimal throughput to the CR user in the given channel state.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.1
• /
• pp.14-20
• /
• 2012

CoMP(Coordinated Multi-Point transmission and reception) refers to a cooperative transmission strategy to control the interference from adjacent base stations in cellular mobile communication systems, which efficiently enhances the data throughput of the systems. As the number of the base stations participating in cooperative transmission increases, however, a larger amount of information exchange to carry the CSI(Channel State Information) of the mobile terminals is required. In this paper, we propose a partial CoMP transmission method for systems under the constraint of finite feedback information data. This method selects candidates of base stations which can provide high efficiency gain when they participate in the CoMP set. To achieve this, the cooperative base station combination is constructed by considering the preferred base stations of users. The cooperative base station combinations are dynamically applied since the preferred base station combinations of users may be different. We perform computer simulations to compare performance of the non-CoMP, full-CoMP and partial CoMP in terms of the average throughput using finite feedback and demonstrate the performance improvement of the proposed method.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.10 no.6
• /
• pp.879-888
• /
• 1999

A Study on the ARQ scheme of data error control is important for more reliable information transmission. Since performance difference is large by the long transmission delay time in satellite communication, the performances of SR ARQ and conventional type-I hybrid ARQ with fixed code rate are investigated by using the parameters of packet length, channel capacity, BER, and transmission delay time especially. BCH code is used in type-I hybrid ARQ for FEC method. This paper presents the throughput analyses according to such various parameters as BCH code rate, window size, data rate and round-trip delay time. Especially we derive a performance equation of type-I hybrid ARQ with the factor of the transmission delay time using the equation of SAW ARQ. Also, the performance of type-I hybrid ARQ specially considering transmission delay time is analyzed through numerical analysis and computer simulation so we can get a important characteristics variation.

• Journal of information and communication convergence engineering
• /
• v.15 no.2
• /
• pp.79-84
• /
• 2017

In a cognitive radio network (CRN), cognitive radio users (CUs) should be powered by a small battery for their operations. The operations of the CU often include spectrum sensing and data transmission. The spectrum sensing process may help the CU avoid a collision with the primary user (PU) and may save the energy that is wasted in transmitting data when the PU is present. However, in a time-slotted manner, the sensing process consumes energy and reduces the time for transmitting data, which degrades the achieved throughput of the CRN. Subsequently, the sensing process does not always offer an advantage in regards to throughput to the CRN. In this paper, we propose a scheme to find an optimal policy (i.e., perform spectrum sensing before transmitting data or transmit data without the sensing process) for maximizing the achieved throughput of the CRN. In the proposed scheme, the data collection period is considered as the main factor effecting on the optimal policy. Simulation results show the advantages of the optimal policy.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.4
• /
• pp.299-304
• /
• 2017

A wireless passive sensor network is a network consisting of sink nodes, sensor nodes, and radio frequency (RF) sources, where an RF source transfers energy to sensor nodes by radiating RF waves, and a sensor node transmits data by consuming the received energy. Against theoretical expectations, a wireless passive sensor network suffers from many practical difficulties: scarcity of energy, non-simultaneity of energy reception and data transmission, and inefficiency in allocating time resources. Perceiving such difficulties, we propose a simple contending-type medium access control (MAC) scheme for many sensor nodes to deliver packets to a sink node. Then, we derive an approximate expression for the network-wide throughput attained by the proposed MAC scheme. Also, we present an approximate expression for the optimal partition, which maximizes the saturated network-wide throughput. Numerical examples confirm that each of the approximate expressions yields a highly precise value for network-wide throughput and finds an exactly optimal partition.