• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.10
• /
• pp.3793-3814
• /
• 2021

Most secure solutions like cryptography are software based and they are designed to mainly deal with the outside attacks for traditional networks, but such soft security is hard to be implemented in wireless sensor networks to counter the inside attacks from internal malicious nodes. To address this issue, reputation has been introduced to tackle the inside malicious nodes. Reputation is essentially a stimulating mechanism for nodes' cooperation and is employed to detect node misbehaviors and improve the trust-worthiness between individual nodes. Among the reputation models, binomial distribution based reputation has many advantages such as light weight and ease of implementation in resource-constraint sensor nodes, and accordingly researchers have proposed many insightful related methods. However, some of them either directly use the modelling results, apply the models through simple modifications, or only use the required components while ignoring the others as an integral part of the whole model, this topic still lacks a comprehensive and systematical review. Thus the motivation of this study is to provide a thorough survey concerning each detailed functional components of binomial distribution based reputation for wireless sensor networks. In addition, based on the survey results, we also argue some open research problems and suggest the directions that are worth future efforts. We believe that this study is helpful to better understanding the reputation modeling mechanism and its components for wireless sensor networks, and can further attract more related future studies.

• Journal of Communications and Networks
• /
• v.14 no.4
• /
• pp.374-384
• /
• 2012

Utilizing artificial noise (AN) is a good means to guarantee security against eavesdropping in a multi-inputmulti-output system, where the AN is designed to lie in the null space of the legitimate receiver's channel direction information (CDI). However, imperfect CDI will lead to noise leakage at the legitimate receiver and cause significant loss in the achievable secrecy rate. In this paper, we consider a delayed feedback system, and investigate the impact of delayed CDI on security by using a transmit beamforming and AN scheme. By exploiting the Gauss-Markov fading spectrum to model the feedback delay, we derive a closed-form expression of the upper bound on the secrecy rate loss, where $N_t$ = 2. For a moderate number of antennas where $N_t$ > 2, two special cases, based on the first-order statistics of the noise leakage and large number theory, are explored to approximate the respective upper bounds. In addition, to maintain a constant signal-to-interferenceplus-noise ratio degradation, we analyze the corresponding delay constraint. Furthermore, based on the obtained closed-form expression of the lower bound on the achievable secrecy rate, we investigate an optimal power allocation strategy between the information signal and the AN. The analytical and numerical results obtained based on first-order statistics can be regarded as a good approximation of the capacity that can be achieved at the legitimate receiver with a certain number of antennas, $N_t$. In addition, for a given delay, we show that optimal power allocation is not sensitive to the number of antennas in a high signal-to-noise ratio regime. The simulation results further indicate that the achievable secrecy rate with optimal power allocation can be improved significantly as compared to that with fixed power allocation. In addition, as the delay increases, the ratio of power allocated to the AN should be decreased to reduce the secrecy rate degradation.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.6
• /
• pp.1259-1270
• /
• 2019

The upper bound of differential characteristic probability is mainly used to determine the number of rounds when constructing a block cipher. As the number of rounds affects the performance of block cipher, it is critical to evaluate the tight upper bound in the constructing process. In order to calculate the upper bound of differential characteristic probability, the previous searching methods for minimum number of active S-boxes constructed constraint equations for non-linear operations and linear operations, independently. However, in the case of BOGI design strategy, where linear operation is dependent on non-linear operation, the previous methods may present the less tight upper bound. In this paper, we exploit the properties of BOGI strategy to propose a new method to evaluate a tighter upper bound of differential characteristic probability than previous ones. Additionally, we mathematically proved the validity of our method. Our proposed method was applied to GIFT-64 and GIFT-128, which are based on BOGI strategy, and the upper bounds of differential characteristic probability were derived until 9 round. Previously, the upper bounds of differential characteristic probability for 7-round GIFT-64 and 9-round GIFT-128 were 2^-18.395 and 2^-26.885, respectively, while we show that the upper bounds of differential characteristic probability are more tight as 2^-19.81 and 2^-28.3, respectively.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2023.05a
• /
• pp.30-30
• /
• 2023

This study aims to establish the multi-reservoir operation system model in the Upper Mun River Basin which includes 5 main dams namely, Mun Bon (MB), Lamchae (LC), Lam Takhong (LTK), Lam Phraphoeng (LPP), and Lower Lam Chiengkrai (LLCK) Dams. The knowledge and AI technology were applied aiming to develop innovative prototype for SMART dam-reservoir operation in future. Two different sorts of reservoir operation system model namely, Fuzzy Logic (FL) and Constraint Programming (CP) as well as the development of rainfall and reservoir inflow prediction models using Machine Learning (ML) technique were made to help specify the right amount of daily reservoir releases for the Royal Irrigation Department (RID). The model could also provide the essential information particularly for the Office of National Water Resource of Thailand (ONWR) to determine the short-term and long-term water resource management plan and strengthen water security against flood and drought in this region. The simulated results of base case scenario for reservoir operation in the Upper Mun from 2008 to 2021 indicated that in the same circumstances, FL and CP models could specify the new release schemes to increase the reservoir water storages at the beginning of dry season of approximately 125.25 and 142.20 MCM per year. This means that supplying the agricultural water to farmers in dry season could be well managed. In other words, water scarcity problem could substantially be moderated at some extent in case of incapability to control the expansion of cultivated area size properly. Moreover, using AI technology to determine the new reservoir release schemes plays important role in reducing the actual volume of water shortfall in the basin although the drought situation at LTK and LLCK Dams were still existed in some periods of time. Meanwhile, considering the predicted inflow and hydrologic factors downstream of 5 main dams by FL model and minimizing the flood volume by CP model could ensure that flood risk was considerably minimized as a result of new release schemes.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.1
• /
• pp.71-75
• /
• 2008

Many sensor operating systems have memory limitation constraint; therefore, stack memory areas of threads resides in a single memory space. Because most target platforms do not have hardware MMY (Memory Management Unit), it is difficult to protect each stack area. The method to solve this problem is to exchange original stack handling instructions in binary code for wrapper routines to protect stack area. In this exchanging phase, instruction corruption problem occurs due to difference of each instruction length between stack handling instructions and branch instructions. In this paper, we propose the algorithm to call a target routine without instruction corruption problem. This algorithm can reach a target routine by repeating branch instructions to have a short range. Our solution makes it easy to apply security patch and maintain upgrade of software of sensor node.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1854-1868
• /
• 2018

A wireless body-sensor network (WBSN) refers to a network-configured environment in which sensors are placed on both the inside and outside of the human body. The sensors are much smaller and the energy is more constrained when compared to traditional wireless sensor network (WSN) environments. The critical nature of the energy-constraint issue in WBSN environments has led to numerous studies on the reduction of energy consumption of WBSN sensors. The transmission-power-control (TPC) technique adjusts the transmission-power level (TPL) of sensors in the WBSN and reduces the energy consumption that occurs during communications. To elaborate, when transmission sensors and reception sensors are placed in various parts of the human body, the transmission sensors regularly send sensor data to the reception sensors. As the reception sensors receive data from the transmission sensors, real-time measurements of the received signal-strength indication (RSSI), which is the value that indicates the channel status, are taken to determine the TPL that suits the current-channel status. This TPL information is then sent back to the transmission sensors. The transmission sensors adjust their current TPL based on the TPL that they receive from the reception sensors. The initial TPC algorithm made linear or binary adjustments using only the information of the current-channel status. However, because various data in the WBSN environment can be utilized to create a more efficient TPC algorithm, many different types of TPC algorithms that combine human movements or fuse TPC with other algorithms have emerged. This paper defines and discusses the design and development process of an efficient TPC algorithm for WBSNs. We will describe the WBSN characteristics, model, and closed-loop mechanism, followed by an examination of recent TPC studies.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.1
• /
• pp.29-37
• /
• 2006

Due to the spread of mobile communication with the development of computer network, nowadays various types of multimedia data play an important role in many areas such as entertainments, culture contents, e-commerce or medical science. But for the real application of these data, the security in the course of saving or transferring them through the public network should be assured. In this sense, many encryption algorithm have been developed and utilized. Nonetheless, most of them have focused on the text data. So they may not be suitable to the multimedia application because of their large size and real time constraint. In this paper, a chaotic map has been employed to create a symmetric stream type of encryption scheme which may be applied to the digital images with a large amounts of data. Then an efficient algebraic encryption algorithm based on the elementary operations of the Boolean matrix and image data characteristics.

• Journal of Digital Convergence
• /
• v.11 no.9
• /
• pp.159-166
• /
• 2013

In this paper, make a study decision problem called an optimal release policies after testing a software system in development phase and transfer it to the user. When correcting or modifying the software, finite failure non-homogeneous Poisson process model, presented and propose release policies of the life distribution, half-logistic property model which used to an area of reliability because of various shape and scale parameter. In this paper, discuss optimal software release policies which minimize a total average software cost of development and maintenance under the constraint of satisfying a software reliability requirement. In a numerical example, the parameters estimation using maximum likelihood estimation of failure time data, make out estimating software optimal release time. Software release time is used as prior information, potential security damages should be reduced.

• 한국사회정책
• /
• v.19 no.2
• /
• pp.69-97
• /
• 2012

This study has sought to analyze factors affecting work and work preference of older adults at national and individual level. A few theoretical hypotheses such as economic need versus job opportunity (or employability), attitude toward paid work, pull effect versus push effect were tested for citizens in eighteen OECD countries with International Social Survey dataset(2005) using multi-level analysis. Main findings are as follows. First, most older adults wanted to work regardless of the socio-economic status, which implies that non-work of older adults would be due to involuntary constraint rather than voluntary choice. Second, there existed class inequality in that the higher class tended to involve paid work more than the lower class did among 55-64 age group. Third, the push factor such as part-time employment ratio, rather than the generosity of social security, explained the work and retirement patterns better. In conclusion, at least from the comparative perspective, the main problem of older adults' work seems to be of labour demand rather than of labour supply, to be of labour market structure and work opportunity rather than of the pull factor.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.22 no.5
• /
• pp.394-402
• /
• 2021

Electronic voting systems have been widely used in many countries around the world since the mid-1990s. In recent years, studies have applied blockchain to existing electronic voting systems in order to provide reliability, fairness, and transparency for voters. This approach is highly useful as a technology that promotes decentralized citizen participation. However, the existing electronic voting systems using blockchain have not sufficiently considered anonymity. Lack of anonymity acts as an important constraint in cases of small- and medium-sized voting, which is often required in decentralized citizen participation. In this study, we propose a model that provides anonymity to a voting system using blockchain by applying the concept of the master node in Dash cryptocurrency. First, we define the differences in the requirements of the transfer and voting systems in blockchain. We propose a parallel and autonomous model and algorithm to provide anonymity in the blockchain-that is, a decentralized development environment. In addition, a discussion of security and the environment for the proposed model is described.