• ETRI Journal
• /
• v.42 no.6
• /
• pp.846-858
• /
• 2020

The non-orthogonal multiple access (NOMA) technique offers throughput improvement to meet the demands of the future generation of wireless communication networks. The objective of this work is to further improve the throughput by including an underlay cognitive radio network with an existing multi-carrier NOMA network, using cooperative communication. The throughput is maximized by optimal resource allocation, namely, power allocation, subcarrier assignment, relay selection, user pairing, and subcarrier pairing. Optimal power allocation to the primary and secondary users is accomplished in a way that target rate constraints of the primary users are not affected. The throughput maximization is a combinatorial optimization problem, and the computational complexity increases as the number of users and/or subcarriers in the network increases. To this end, to reduce the computational complexity, a dynamic network resource allocation algorithm is proposed for combinatorial optimization. The simulation results show that the proposed network improves the throughput.

• Journal of Digital Convergence
• /
• v.14 no.1
• /
• pp.171-179
• /
• 2016

The energy consumption problem in wireless sensor networks is investigated. The problem is to expend as little energy as possible receiving and transmitting data, because of constrained battery. In this paper, in order to extend the lifetime of the network, we proposed a location-based clustering algorithm for wireless sensor network with skewed-topology. The proposed algorithm is to deploy multiple child nodes at the sink to avoid bottleneck near the sink and to save energy. Proposed algorithm can reduce control traffic overhead by creating a dynamic cluster. We have evaluated the performance of our clustering algorithm through an analysis and a simulation. We compare our algorithm's performance to the best known centralized algorithm, and demonstrate that it achieves a good performance in terms of the life time.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.278-280
• /
• 2012

We are propose the position of the node context-awareness information and the validity of the head node in the path according to the clustering how to elect one of the energy efficiency ECOPS (Energy Conserving Optimal path Schedule) algorithm. Existing LEACH algorithm to elect the head node when the node's energy probability distribution function based on the management of the head node is optional cycle. However, in this case, the distance of the relay node status information including context-awareness parameters does not reflect. These factors are not suitable for the relay node or nodes are included in the probability distribution, if the head node selects occurs. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study defines location with the status context information and the residual energy factor in choosing topology of the structure adjacent nodes. ECOPS algorithm that contextual information is contributed for head node selection in topology protocols. The proposed ECOPS algorithm has the head node replacement situations from the candidate head node in the optimal path and efficient energy conservation that is the path of the member nodes. The new head node election show as the entire node lifetime and network management technique improving the network lifetime and efficient management the simulation results.

• Journal of Korea Multimedia Society
• /
• v.12 no.9
• /
• pp.1273-1287
• /
• 2009

PEGASIS, a chain-based protocol, forms chains from sensor nodes so that each node transmits and receives from a neighbor. In this way, only one node (known as a HEAD) is selected from that chain to transmit to the sink. Although PEGASIS is able to balance the workload among all of the nodes by selecting the HEAD node in turn, a considerable amount of energy may be wasted when nodes which are far away from sink node act as the HEAD. In this study, DERP (Distance-based Energy-efficient Routing Protocol) is proposed to address this problem. DERP is a chain-based protocol that improves the greedy-algorithm in PEGASIS by taking into account the distance from the HEAD to the sink node. The main idea of DERP is to adopt a pre-HEAD (P-HD) to distribute the energy load evenly among sensor nodes. In addition, to scale DERP to a large network, it can be extended to a multi-hop clustering protocol by selecting a "relay node" according to the distance between the P-HD and SINK. Analysis and simulation studies of DERP show that it consumes up to 80% less energy, and has less of a transmission delay compared to PEGASIS.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.4
• /
• pp.25-34
• /
• 2019

Recently, when a fault occurs at a long-distance point in a LVDC (low voltage direct current) distribution feeder in a light rail system, the magnitude of the current can decrease to less than that of the load current of a light rail system. Therefore, proper protection coordination method to distinguish a fault current from a load current is required. To overcome these problems, this paper proposes an optimal algorithm of protection devices for a LVDC distribution feeder in a light rail system. In other words, based on the characteristics of the fault current for ground resistance and fault location, this paper proposes an optimal operation algorithm of a selective relay to properly identify the fault current compared to the load current in a light rail system. In addition, this paper modelled the distribution system including AC/DC converter using a PSCAD/EMTDC S/W and from the simulation results for a real light rail system, the proposed algorithm was found to be a useful and practical tool to correctly identify the fault current and load current.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1770-1785
• /
• 2013

In this paper, a multi-hop transmission protocol based on parallel communication of secondary users (SUs) is proposed. The primary multi-hop network coexists with a set of SUs by cooperative spectrum sharing. The main optimization target of our protocol is the overall performance of the secondary system with the guarantee of the primary outage performance. The energy consumption of the primary system is reduced by the cooperation of SUs. The aim of the primary source is to communicate with the primary destination via a number of primary relays. SUs may serve as extra decode-and-forward relays for the primary network. When an SU acts as a relay for a primary user (PU), some other SUs that satisfy the condition for parallel communication are selected to simultaneously access the primary spectrum for secondary transmissions. For the proposed protocol, two opportunistic routing strategies are proposed, and a search algorithm to select the SUs for parallel communication is described. The throughput of the SUs and the PU is illustrated. Numerical results demonstrate that the average throughput of the SUs is greatly improved, and the end-to-end throughput of the PU is slightly increased in the proposed protocol when there are more than seven SUs.