• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.3
• /
• pp.731-740
• /
• 2015

In the recent days, interests in machine-to-machine communication schemes in small-scale networks has been increasing with growing demands. TDMA(Time Division Multiple Access) can be used as a multiple access method in small-scale networks. However, time synchronization for TDMA is complicated or needs additional equipments. Such a large cost is not suitable for small-scale networks. We propose, BC-DESYNC, a efficient time synchronization for small-scale networks by extending DESYNC(DESYNChronization). DESYNC takes a long time to complete synchronization and doesn't guarantee the synchronization delay. BC-DESYNC uses CU(Central Unit) that performs a centralized control to achieve the 2-hop communication and guarantees the synchronization completion time by using Mimic firing and C-DESYNC scheme.

• International Journal of Computer Science & Network Security
• /
• v.24 no.2
• /
• pp.15-24
• /
• 2024

One of the most significant issues in combinatorial optimization is the classical NP-complete conundrum known as the 0/1 Knapsack Problem. This study delves deeply into the investigation of practical solutions, emphasizing two classic algorithmic paradigms, brute force, and dynamic programming, along with the metaheuristic and nature-inspired family algorithm known as the Genetic Algorithm (GA). The research begins with a thorough analysis of the dynamic programming technique, utilizing its ability to handle overlapping subproblems and an ideal substructure. We evaluate the benefits of dynamic programming in the context of the 0/1 Knapsack Problem by carefully dissecting its nuances in contrast to GA. Simultaneously, the study examines the brute force algorithm, a simple yet comprehensive method compared to Branch & Bound. This strategy entails investigating every potential combination, offering a starting point for comparison with more advanced techniques. The paper explores the computational complexity of the brute force approach, highlighting its limitations and usefulness in resolving the 0/1 Knapsack Problem in contrast to the set above of algorithms.

• Journal of Contemporary Eastern Asia
• /
• v.18 no.1
• /
• pp.189-216
• /
• 2019

The frequent occurrence of overwhelming disasters necessitates risk communication systems capable of operating effectively in disaster contexts. Few studies have examined risk communication networks during disasters through social networking services (SNS). This study therefore investigates the patterns of risk communication by comparing Korean and international networks based on the social amplification of risk communication in the context of the Sewol ferry disaster (SFD). In addition, differences in language use and patterns between Korean and international contexts are identified through a semantic analysis using KrKwick, NodeXL, and UCINET. The SFD refers to the sinking of the ferry while carrying 476 people, mostly secondary school students. The results for interpersonal risk communication reveal that the structure of the Korean risk communication network differed from that of the international network. The Korean network was more fragmented, and its clustering was more sparsely knitted based on the impact and physical proximity of the disaster. Semantic networks imply that the physical distance from the disaster affected the content of risk communication, as well as the network pattern.

• International Journal of Contents
• /
• v.8 no.2
• /
• pp.13-18
• /
• 2012

In wireless sensor networks, an energy efficient data gathering scheme is one of core technologies to process a query. The cluster-based data gathering methods minimize the energy consumption of sensor nodes by maximizing the efficiency of data aggregation. However, since the existing clustering methods consider only uniform network environments, they are not suitable for the real world applications that sensor nodes can be distributed unevenly. To solve such a problem, we propose a balanced multi-hop clustering scheme in non-uniform wireless sensor networks. The proposed scheme constructs a cluster based on the logical distance to the cluster head using a min-distance hop count. To show the superiority of our proposed scheme, we compare it with the existing clustering schemes in sensor networks. Our experimental results show that our proposed scheme prolongs about 48% lifetime over the existing methods on average.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.151-157
• /
• 2004

In this paper, we investigated ultra high speed wireless communication cell backbone net of city using of wireless communication transceiver for millimeter wave band. A new type of 60GHz wave band wireless transceiver using NRD waveguide. This 60㎓ transceiver has excellent signal's absorption characteristics of oxygen molecule than the other millimeter wave bands. We constructed to wireless networks interval within 500m to 3km on wireless backbone node using 60GHz transceivers, and did it so that city type wireless communication cell backbone networks of 155.52MbpsATM(OC-3) may be possible. Therefore, if use transceiver, it is possible that city type ultra high speed wireless communication cell backbone networks construction of 100Mbps, 155.52Mbps, 622Mbps, 1Gbps, and 1.2Gbps degrees.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.3
• /
• pp.1301-1312
• /
• 2020

Using decode-and-forward relaying in the cognitive radio networks, the spectrum efficiency can improve furthermore. The optimization algorithm of the spectrum sensing estimation time is presented for the cognitive relay networks in this paper. The longer sensing time will bring two aspects of the consequences. On the one hand, the channel parameters are estimated more accurate so as to reduce the interferences to the authorized users and to improve the throughput of the cognitive users. On the other hand, it shortens the transmission time so as to decease the system throughput. In this time, it exists an optimal sensing time to maximize the throughput. The channel state information of the sub-bands is considered as the exponentially distributed, so a stochastic programming method is proposed to optimize the sensing time for the cognitive relay networks. The computer simulation results using the Matlab software show that the algorithm is effective, which has a certain engineering application value.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.6
• /
• pp.1638-1658
• /
• 2024

As a crucial development direction for the sixth generation of mobile communication networks (6G), Low Earth Orbit (LEO) satellite networks exhibit characteristics such as low latency, seamless coverage, and high bandwidth. However, the frequent changes in the topology of LEO satellite networks complicate communication between satellites, and satellite power resources are limited. To fully utilize resources on satellites, it is essential to determine the association between satellites before power allocation. To effectively address the satellite association problem in LEO satellite networks, this paper proposes a satellite association-based resource allocation algorithm. The algorithm comprehensively considers the throughput of the satellite network and the fairness associated with satellite correlation. It formulates an objective function with logarithmic utility by taking the logarithm and summing the satellite channel capacities. This aims to maximize the sum of logarithmic utility while promoting the selection of fewer associated satellites for forwarding satellites, thereby enhancing the fairness of satellite association. The problems of satellite association and power allocation are solved under constraints on resources and transmission rates, maximizing the logarithmic utility function. The paper employs an improved Kuhn-Munkres (KM) algorithm to solve the satellite association problem and determine the correlation between satellites. Based on the satellite association results, the paper uses the Lagrangian dual method to solve the power allocation problem. Simulation results demonstrate that the proposed algorithm enhances the fairness of satellite association, optimizes resource utilization, and effectively improves the throughput of LEO satellite networks.

• Journal of Distribution Science
• /
• v.20 no.5
• /
• pp.65-74
• /
• 2022

Purpose: This paper evaluates which characteristics of marketing communication content distributed on social networks impact electronic word-of-mouth (e-WOM). Research design, data, and methodology: Quantitative research was carried out on 637 Vietnamese people aged from 18, who were exposed to marketing communication programs of fashion brands. Preliminary data were analyzed by the reliability of the scale, multivariate regression analysis, and analysis of variance. Results: The research findings have identified the four characteristics of social media content that positively impact e-WOM, including entertainment, interaction, trendiness, and customization. Participants aged 30 and under have a higher appreciation for media content and e-WOM than those from 31 and over. Conclusion: To promote e-WOM, marketing communication content distributed on social networks should focus on the following characteristics: (1) The entertainment of marketing communication content should involve positive emotions, fun, and enjoyment; (2) With interactive content, focus should be placed on discussion and exchange content, content that encourages sharing, and two-way interactive content; (3) For trending marketing communication content, marketers consider communicating brand-related latest information, up-to-date information, and hot discussion topics; and (4) When creating customized content, brands should be interesting, customized (information, product, price), and unique.

• Bioinformatics and Biosystems
• /
• v.2 no.1
• /
• pp.12-16
• /
• 2007

DNA repair means a collection of processes that a cell identifies and corrects damage to genome sequence. The DNA repair processes are important because a genome would not be able to maintain its essential cellular functions without the processes. In this research, we make some gene regulatory networks of DNA repair in S. cerevisiae to know how each gene interacts with others. Two approaches are adapted to make the networks; Bayesian Network and ARACNE. After construction of gene regulatory networks based on the two approaches, the two networks are compared to each other to predict which genes have important roles in the DNA repair processes by finding conserved interactions and looking for hubs. In addition, each interaction between genes in the networks is validated with interaction information in S. cerevisiae genome database to support the meaning of predicted interactions in the networks.

• Proceedings of the Korea Electromagnetic Engineering Society Conference
• /
• 2003.11a
• /
• pp.243-248
• /
• 2003

This paper is contents on that construct ultra high speed wireless communication cell backbone net of city using of wireless communication transceiver for millimeter wave band. A new type of 60GHz wave band wireless transceiver using NRD waveguide. This 60GHz transceiver has excellent signal's absorption characteristics of oxygen molecule than the other millimeter wave bands. We constructed service networks to cell interval within about 500m to 3Km laying stress on wireless backbone node using 60GHz transceivers, and did it so that city type wireless communication cell backbone networks of 155.52Mbps ATM(OC-3) may be possible. The possible use of wireless backbone networks technology in a rainy day and a clear day was evaluated at 1Km data link distance. We can measured bit error rate(BER). BER is $10^{-11}$ at 155.52Mbps ATM(OC-3) in a clear day and $10^{-6}$ in a heavy rain more than 35mm per time. Also, we constructed wireless cell backbone networks distance to use several 60GHz transceivers and investigated data transmission rate between main center and local center of long distance. In proposed wireless cell backbone networks, the data throughput was approximately 80Mbit/sec. Therefore, if use transceiver, it is possible that city type ultra high speed wireless communication cell backbone networks construction of 100Mbps, 155.52Mbps, 622Mbps, 1Gbps and 1.2Gbps degrees.