• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.1
• /
• pp.170-191
• /
• 2024

The transmission of confidential data using cover media is called steganography. The three requirements of any effective steganography system are high embedding capacity, security, and imperceptibility. The text file's structure, which makes syntax and grammar more visually obvious than in other media, contributes to its poor imperceptibility. Text steganography is regarded as the most challenging carrier to hide secret data because of its insufficient redundant data compared to other digital objects. Unicode characters, especially non-printing or invisible, are employed for hiding data by mapping a specific amount of secret data bits in each character and inserting the character into cover text spaces. These characters are known with limited spaces to embed secret data. Current studies that used Unicode characters in text steganography focused on increasing the data hiding capacity with insufficient redundant data in a text file. A sequential embedding pattern is often selected and included in all available positions in the cover text. This embedding pattern negatively affects the text steganography system's imperceptibility and security. Thus, this study attempts to solve these limitations using the Part-of-speech (POS) tagging technique combined with the randomization concept in data hiding. Combining these two techniques allows inserting the Unicode characters in randomized patterns with specific positions in the cover text to increase data hiding capacity with minimum effects on imperceptibility and security. Format-preserving encryption (FPE) is also used to encrypt a secret message without changing its size before the embedding processes. By comparing the proposed technique to already existing ones, the results demonstrate that it fulfils the cover file's capacity, imperceptibility, and security requirements.

• Archives of design research
• /
• v.19 no.2 s.64
• /
• pp.229-240
• /
• 2006

It is very important issue in information design to improve information efficiency by adapting interesting factors in changing circumstance of information communication. The concept of infotainment is utilized in designing information contents in a way of combining entertainment factors with information itself based on various media and representation technologies. The information arousing user's attention, which includes interesting factors, is persuasive message comppared to the informative message conveying only information itself. The reason why infotainment is persuasive is because it makes the user absorb deeply in the information during the process of understanding by sensorial stimuli, cognitive interest, and situational interest. The sensorial stimuli originates from the expression elements of information design. The cognitive interest from the user's intellectual activities has a try to overcome mental block when user confronts with the redundant expression in the manner of unexpectedness and inharmony. The situational interest originates from user's optimum experience by the flow of satisfaction. Therefore, the attribute of infotainment is defined with the stimuli, the redundancy, and user's satisfaction. Its design elements consist of physical factors, organizational factors, and psychological factors. The physical factors through sensorial stimuli are utilized by visual manipulation such as visual analogy or visual pun, multimedia, and moving expression. The organizational factors through redundant expression bring user's imagination by adapting storytelling, event, and interaction in the process of understanding information. The psychological factors through expression of entertainment interests such as humor, play, and game give users psychological satisfaction with the flow. In conclusion the concept of infotainment can be adapted when the design factors should be integrated with its attributes, or the conveying information should go well with its purpose and characteristics.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.2
• /
• pp.99-107
• /
• 2010

SNMP(Simple Network Management Protocol) is most commonly used as a standard protocol for effective network management by supporting the increasing size of the network and the variety of network elements such as router, switch, server and so on. However, SNMP has performance drawbacks of network overhead, processing latency, and the inefficiency in data retrieval. In this paper, we propose two schemes to improve the performance of SNMP; 1) the first scheme to reduce the amount of redundant OID information within a SNMP-GetBulk response message, 2) the second scheme of newly proposed SNMP-GetUpdate message combined with the cache in MNS. Through the analysis with real experiments, we show that our first scheme reduces the network overhead and the second scheme improves the processing latency and the retrieval of SNMP MB tables. And, therefore the scalability of network management can be improved.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.6
• /
• pp.103-110
• /
• 2012

In Vehicle Safety Communication (VSC), noted as a representative application of VANET technologies, emergency warning messages (EWM) are broadcast over vehicles in response to an emergency situation. However, as the number of vehicles increases, the so-called Broadcast Storm Problem often occurs due to a huge number of redundant EWM transmitted. Though many approaches in the literature have been proposed to solve the problem, most of them require the preliminary phase for setting up or refreshing neighbor relationship through exchanging beacon messages with nearby vehicles, thereby further increasing the traffic load. In this paper, we propose Longest Leaping Relay (LLR) scheme which can efficiently solve the Broadcast Storm Problem without any preliminary phase for setting up neighbor relationship. Through computer simulations, we compared the performance of the proposed scheme with competitive schemes and verified the proposed scheme outperforms the existing schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.872-885
• /
• 2015

The rapid increase of smart mobile devices and mobile applications has led to explosive growth of data traffic in cellular network. Offloading data traffic becomes one of the most urgent technical problems. Recent work has proposed to exploit opportunistic communications to offload cellular traffic for mobile data dissemination services, especially for accepting large delayed data. The basic idea is to deliver the data to only part of subscribers (called target-nodes) via the cellular network, and allow target-nodes to disseminate the data through opportunistic communications. Human mobility shows temporal and spatial characteristics and predictability, which can be used as effective guidance efficient opportunistic communication. Therefore, based on the regularity of human mobility we propose NodeRank algorithm which uses the encounter characteristics between nodes to choose target nodes. Different from the existing work which only using encounter frequency, NodeRank algorithm combined the contact time and inter-contact time meanwhile to ensure integrity and availability of message delivery. The simulation results based on real-world mobility traces show the performance advantages of NodeRank in offloading efficiency and network redundant copies.

• Journal of information and communication convergence engineering
• /
• v.9 no.2
• /
• pp.244-250
• /
• 2011

Gossip is a well-known protocol which was proposed to implement broadcast service with a high reliability in an arbitrarily connected network of sensor nodes. The probabilistic techniques employed in gossip have been used to address many challenges which are caused by flooding in wireless sensor networks (WSNs). However, very little work has yet been done on real-time wireless sensor networks which require not only highly reliable packets reception but also strict time constraint of each packet. Moreover, the unique energy constraining feature of sensor makes existing solutions unsuitable. Combined with unreliable links, redundant messages overhead in real-time wireless sensor networks is a new challenging issue. In this paper, we introduce a Reliable Gossip Zone, a novel fine-tailored mechanism for real-time wireless sensor networks with unreliable wireless links and low packet redundancy. The key idea is the proposed forwarding probability algorithm, which makes forwarding decisions after the realtime flooding zone is set. Evaluation shows that as an oracle broadcast service design, our mechanism achieves significantly less message overhead than traditional flooding and gossip protocols.

• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.67-73
• /
• 2010

Current on-demand ad-hoc routing protocols are not appropriate for wireless mesh networks (WMNs), because flooding-based route discovery is both redundant and expensive in terms of control message overhead. In this paper, we propose an efficient on-demand routing approach with directional flooding (DF), which is suitable for the WMNs with limited mobility. In the route discovery process to reach a gateway, our DF scheme can reduce the number of route request (RREQ) packets broadcast by using a restricted directional flooding technique. Simulation results show that ad hoc on-demand distance vector (AODV) with DF (AODV-DF) can significantly reduce routing overhead by RREQ packets and enhance overall performance compared with the original AODV.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.87-90
• /
• 2012

원자력발전소에 사용되는 모든 시스템은 IEEE에서 최고 수준의 안전도인 CLASS 1E로 분류된다. 그중에서 안전계통은 원자력발전소 안전에 관련한 모든 분야를 관리하는 계통이다. 산업이 발전함에 따라 안전계통 또한 그 규모와 복잡성이 높아지고 있고, 이에 적용되는 요구사항 또한 엄격해지고 있다. 따라서 발전소에 적용되는 안전 동작에 대한 기준을 결정하기 위해서 철저한 오류 예측분석이 수행 되어야 한다. 그 중에서도 NUREG-0492로 규정되어 있는 결함수목분석(Fault Tree Analysis)은 연역적 오류 예측 분석방법으로 원자력 발전소, 우주 산업 등에 관련된 분야는 본 방법을 통하여 오류 예측 분석이 이루어 져야한다. 본 논문에서 원전안전계통을 관리하는 구현 모델인 원전안전등급제어기기(Safety Programmable Logic Controller)에 대하여 결함수목분석을 통한 오류 예측 분석을 하였다. 또한, 위의 구조에 대하여 MSC(Message Sequence Chart)를 통한 모델링을 수행하여, 결함수목분석을 적용하는 과정에서 신뢰도 향상을 더하였다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.4
• /
• pp.31-37
• /
• 2008

Conventional cooperative communications can attain gain of spatial diversity and path loss reduction because destination node independently received same signal from source node and relay node located between source node and destination node. However, these techniques bring about decreased spectral efficiency with relay node and increased complexity of receiver by using maximal ratio combining (MRC). This paper has proposed cooperative ARQ protocol that can improve the above problems and can get the better performance. This method can increase the spectral efficiency than conventional cooperative communication because if the received signal from source node is satisfied by the destination preferentially, the destination transmits ACK message to both relay node and source node and then recovers the received signal. In addition, if ARQ message indicates NACK relay node operates selective retransmission and we can increase reliability of system compared with that of general ARQ protocol in which source node retransmits data. In the proposed protocol, the selective retransmission and ARQ message are to be determined by comparing log-likelihood ratio (LLR) computation of received signal from source node with predetermined threshold values. Therefore, this protocol don't waste redundant bandwidth with CRC code and can reduce complexity of receiver without MRC. We verified spectral efficiency and BER performance for the proposed protocol through Monte-Carlo simulation over Rayleigh fading plus AWGN.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.11
• /
• pp.589-598
• /
• 2007

In the group communication which has multiple data streams and various access privileges, it is necessary to provide group access control. The group members having the same access privilege are classified into one class, and the classes form a hierarchy based on the access relations. Then each class is assigned to a secret key. In the previous schemes, a single logical key graph is constructed from the hierarchy and each member always holds all secret keys of the classes he can access in the proactive manner. Thus, higher-privileged members hold more keys then lower-privileged members. However, if the hierarchy is large, each member manages too many keys and the size of multicast message in rekeying increases in proportion to the size of the hierarchy. Moreover, most of the members access a small portion of multiple data streams simultaneously. Therefore, it is redundant to receive rekeying message and update the keys in which he is not currently interested. In this paper, we present a new key management scheme that takes a reactive approach in which each member obtains the key of a data stream only when he wants to access the stream. Each member holds and updates only the key of the class he belongs. If he wants to get the key of other class, he derives it from his key and the public parameter. Proposed scheme considerable reduces the costs for rekeying, especially in the group where access relations are very complex and the hierarchy is large. Moreover, the scheme has another advantage that it easily reflects the change of access relations.