• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3409-3422
• /
• 2014

The frequency spectrum available for the wireless communication is extremely crowded. In order to improve the spectral efficiency, the two-way relay networks have aroused great attention. A simple $N^{th}$ best-relay selection criterion for the opportunistic two-way relay networks is proposed, which can be implemented easily by extending the distributed timer technique in practice, since the proposed criterion is mainly based on the channel gains. The outage performance of the proposed relay selection scheme is analyzed under the outdated channel state information (CSI), and a tight closed-form lower bound and asymptotic value of the outage probability over Rayleigh fading channels are obtained. Simulation results demonstrate that the tight closed-form lower bound of the outage probability very closely matches with simulated ones in the whole SNR region, and the asymptotic results provide good tight approximations to the simulation ones, especially in the high SNR region.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3353-3370
• /
• 2016

The way of combination of Product Perfect Codes (PPCs) is based on the theory of short codes constructing long codes. PPCs have larger embedding rate than Hamming codes by expending embedding columns in a coding block, and they have been proven to enhance the performance of the F₅ steganographic method. In this paper, the proposed modified product codes called MPCs are introduced as an efficient way to embed more data than PPCs by increasing 2^r₂-1-r₂ embedding columns. Unlike PPC, the generation of the check matrix H in MPC is random, and it is different from PPC. In addition a simple solving way of the linear algebraic equations is applied to figure out the problem of expending embedding columns or compensating cases. Furthermore, the MPCs over ℤ₄ have been proposed to further enhance not only the performance but also the computation speed which reaches O(n₁+σ). Finally, the proposed ℤ₄-MPC intends to maximize the embedding rate with maintaining less distortion , and the performance surpasses the existing improved product perfect codes. The performance of large embedding rate should have the significance in the high-capacity of covert communication.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1654-1675
• /
• 2014

In practical wireless systems, the erroneous channel state information (CSI) sometimes deteriorates the performance drastically. This paper focuses on robust design of coordinated set planning of coordinated multi-point (CoMP) transmission, with respect to the feedback delay and link error. The non-ideal channel models involving various uncertainty conditions are given. After defining a penalty factor, the robust net ergodic capacity optimization problem is derived, whose variables to be optimized are the number of coordinated base stations (BSs) and the divided area's radius. By the maximum minimum criterion, upper and lower bounds of the robust capacity are investigated. A practical scheme is proposed to determine the optimal number of cooperative BSs. The simulation results indicate that the robust design based on maxmin principle is better than other precoding schemes. The gap between two bounds gets smaller as transmission power increases. Besides, as the large scale fading is higher or the channel is less reliable, the number of the cooperated BSs shall be greater.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5485-5506
• /
• 2016

In this article, a video based fire detection framework for CCTV surveillancesystems is presented. Two novel features and a novel image type with their corresponding algorithmsareproposed for this purpose. One is for the slow-smoke detection and another one is for fast-smoke/flame detection. The basic idea is slow-smoke has a highly varying chrominance/luminance texture in long periods and fast-smoke/flame has a highly varying texture waiting at the same location for long consecutive periods. Experiments with a large number of smoke/flame and non-smoke/flame video sequences outputs promising results in terms of algorithmic accuracy and speed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2416-2432
• /
• 2017

In this paper, we investigate the security performance for cooperative networks over Nakagami-m fading channels. Based on whether the channel state information (CSI) of wiretap link is available or not, optimal relay selection (ORS) and suboptimal relay selection (SRS) schemes are considered. Also, multiple relays combining (MRC) scheme is considered for comparison purpose. The exact and asymptotic closed-form expressions for secrecy outage probability (SOP) are derived and simulations are presented to validate the accuracy of our proposed analytical results. The numerical results illustrate that the ORS is the best scheme and SRS scheme is better than MRC scheme in some special scenarios such as when the destination is far away from the relays. Furthermore, through asymptotic analysis, we obtain the closed-form expressions for the secrecy diversity order and secrecy array gain for the three different selection schemes. The secrecy diversity order is closely related to the number of relays and fading parameter between relay and destination.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.269-281
• /
• 2014

Compared to hiding information into digital image, hiding information into digital text file requires less storage space and smaller bandwidth for data transmission, and it has obvious universality and extensiveness. However, text files have low redundancy, so it is more difficult to hide information in text files. To overcome this difficulty, Wang et al. proposed a reversible information hiding scheme using left-right and up-down representations of Chinese characters, but, when the scheme is implemented, it does not provide good visual steganographic effectiveness, and the embedding and extracting processes are too complicated to be done with reasonable effort and cost. We observed that a lot of traditional and simplified Chinese characters look somewhat the same (also called lookalike), so we utilize this feature to propose a novel information hiding scheme for hiding secret data in lookalike Chinese characters. Comparing to Wang et al.'s scheme, the proposed scheme simplifies the embedding and extracting procedures significantly and improves the effectiveness of visual steganographic images. The experimental results demonstrated the advantages of our proposed scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.1
• /
• pp.114-130
• /
• 2021

With the drastic growth of Information and Communication Technology (ICT) industry, global energy consumption is exponentially increased by mobile communications. The huge energy consumption and increased environmental awareness have triggered great interests on the research of dynamic distribution of cell user and traffic, and then designing the energy efficient cellular network. In this paper, we explore the temporal and spatial characteristics of human mobility and traffic distribution using real data set. The analysis results of cell traffic illustrate the tidal effect in temporal and spatial dimensions and obvious periodic characteristics which can be used to design Base Station (BS) dynamic with sleeping or shut-down strategy. At the same time, we designed a new Cell Zooming and BS cooperation mode. Through simulation experiments, we found that running in this mode can save about 35% of energy consumption and guarantee the required quality of service.

• 대한공업교육학회지
• /
• v.32 no.1
• /
• pp.134-152
• /
• 2007

This study deals with the development of computer program which can restrict students to access to the unallowable web sites during the Internet based class. Our suggested program can find the student's access list to the unallowable sites, display it on the teacher's computer screen. Through the limitation of the student's access, teacher can enhance the efficiency of class and fulfill his educational purpose for the class. The use of our results leads to the effective and safe utilization of the Internet as the teaching tools in the class. Meanwhile, the typical method is to turn off the LAN (Local Area Network) power in order to limit the student's access to the unallowable web sites. Our program has been developed on the Linux operating systems in the small network environment. The program includes following five functions: the translation function to change the domain name into the IP(Internet Protocol) address, the search function to find the active students' computers, the packet snoop to capture the ongoing packets and investigate their contents, the comparison function to compare the captured packet contents with the predefined access restriction IP address list, and the restriction function to limit the network access when the destination IP address is equal to the IP address in the access restriction list. Our program can capture all passing packets through the computer laboratory in real time and exactly. In addition, it provides teacher's computer screen with the all relation information of students' access to the unallowable sites. Thus, teacher can limit the student's unallowable access immediately. The proposed program can be applied to the small network of the elementary, junior and senior high school. Our research results make a contribution toward the effective class management and the efficient computer laboratory management. The related researches provides teacher with the packet observation and the access limitation for only one host, but our suggested program provides teacher with those for all active hosts.

• ETRI Journal
• /
• v.32 no.5
• /
• pp.665-675
• /
• 2010

Recent research on mobile Internet protocol television and digital right management (DRM) interconnections has focused on multimedia technologies designed to enhance content scalability and adaptive content distribution. However, due to the architectural and scalable limitations, recent systems are not flexible and securable with respect to their adaptive content distribution and protective policy management. Therefore, we propose a content protective multi-agent platform that provides secure multimedia services, correlation management, pattern-based management, and multi-source multi-use (MsMu)-based services. Our architecture, supported by DRM, lets us create a rich set of MsMu-based content protection and seamless multimedia services through the extension of one source multi-use (OsMu)-based content services. We have verified our platform, which provides scalable and securable services with a 17% lower service response time by using a testbed.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.11
• /
• pp.1453-1464
• /
• 2001

Explosive growth of Internet populations results performance degradations of web service. Popular web sites cannot provide proper level of services to many requests, and such poor services cannot give user a satisfaction. Web caching, the remedy of this problem, reduces the amount of network traffic and gives fast response to user. In this paper, we analyze the characteristics of web cache traffics using traces of NLANR(National Laboratory for Applied Network Research) root caches and Education network cache in Seoul National University. Based on this analysis, we suggest a method of prefetching and we discuss the gains of our prefetching. As a result, we find proposed prefetching enhances hit rate up to 3%, response time up to 5%.