• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권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)
• /
• 제10권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)
• /
• 제8권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)
• /
• 제10권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)
• /
• 제11권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)
• /
• 제8권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)
• /
• 제15권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.

• 대한공업교육학회지
• /
• 제32권1호
• /
• pp.134-152
• /
• 2007

본 연구는 인터넷을 이용한 수업에서 학생들이 수업과 관련되지 않은 웹 사이트에 접속하는 것을 교사용 컴퓨터에서 발견하여 차단함으로써 수업의 효율성을 높이고, 교사가 의도하는 방향으로 수업을 진행할 수 있는 프로그램의 개발에 목적이 있다. 본 연구의 결과를 이용하면 수업과 관련되지 않은 웹 사이트에 접속하는 것을 방지하기 위하여 랜(LAN) 전원을 차단하고 수업하는 기존의 방법 대신 교수 매체로서 인터넷을 효과적이고 안전하게 사용할 수 있다. 관련 연구는 한 개의 호스트(host)만 감시하고 접속을 차단하는 반면에 본 연구에서 개발한 프로그램은 접속해 있는 모든 호스트들을 감시하고 차단할 수 있다. 본 연구에서 제안한 프로그램은 소규모 네트워크 환경에 설치된 리눅스(linux) 운영체제에서 개발되었다. 개발된 프로그램은 5가지 기능을 포함하고 있다. 도메인 네임(domain name)에서 IP(internet protocol) 주소로 변환하여 파일로 저장하는 변환 기능, 인터넷을 사용할 준비가 되어 있는 학생 컴퓨터를 탐색하여 파일로 저장하는 탐색기능, 패킷(packet)을 캡쳐(capture)하여 패킷의 정보를 표현해주는 패킷 캡쳐 기능, 캡쳐된 패킷 정보와 차단 목록 데이터를 비교하는 비교기능, 그리고 차단 목록과 캡쳐된 패킷 정보가 일치할 경우 네트워크 접속을 차단하는 기능으로 구성되어 있다. 개발된 프로그램을 사용하면 네트워크를 통과하는 모든 패킷(packet)을 실시간에 정확하게 캡쳐 할 수 있고, 불량 사이트에 학생이 접근하는 경우 교사의 컴퓨터 화면에 관련 내용이 표시된다. 따라서 교사는 관련 내용을 실시간으로 확인하고, 불량 사이트에 대한 접속을 차단할 수 있다. 본 연구에서 개발된 프로그램은 초 중등학교와 같은 소규모 네트워크에 적용가능하며, 교사와 학생, 학교차원의 수업 관리와 컴퓨터 실습실 관리의 효율성을 향상시킬 것이다.

• ETRI Journal
• /
• 제32권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.

• 한국컴퓨터산업학회논문지
• /
• 제2권11호
• /
• pp.1453-1464
• /
• 2001

인터넷 사용자의 폭발적인 증가로 인해 웹 서비스는 심각한 성능상의 지연을 보이고 있다. 인기 있는 웹사이트의 입장에서는 많은 요청으로 인하여 원활한 서비스를 제공하기 어렵고, 사용자 또한 만족스러운 수준의 응답시간을 제공받지 못한다. 이에 대한 해결책으로 제시된 웹캐슁은 서버에 대한 요청을 흡수하여 전체적인 교통량을 줄이며 사용자에게는 보다 빠른 응답을 제공한다. 본 논문에서는 미국의 웹 캐쉬 프로젝트인 NLANR(National Laboratory for Applied Network Research)의 최상위 캐쉬들로부터 생성된 트레이스와 서울대에 위치한 교육망 캐쉬의 트레이스를 이용하여 웹 캐쉬 트래픽의 특성들에 관해 분석하고, 이들로부터 얻은 각종 특성 자료를 바탕으로, 미래에 필요하리라고 여겨지는 웹 오브젝트를 미리 가져오는 prefetch 방법을 제시하였으며 그로 인한 효과에 관해 분석하였다. 그 결과, l∼3% 정도 일일 평균 적중률의 향상과 최대 5% 정도의 평균 응답시간의 개선을 기대할 수 있음을 발견하였다.