• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.156-162
• /
• 2020

Wireless Sensor Network (WSN) field is mainly studied to monitor and characterize large-scale physical environments to track various environmental or physical conditions, such as temperature, pressure, wind speed and humidity. WSN can be used in various applications such as wild surveillance, military target tracking and monitoring, dangerous environmental exploration and natural disaster relief. We design probabilistic mobile models that apply to mobile ad hoc network mobile environments. A probabilistic shift model proposed by dividing the number of moving nodes and the distance of travel into two categories to express node movement characteristics. The proposed model of movement through simulation was compared with the existing random movement model, ensuring that the width and variation rate of the first node node node node (FND) was stable regardless of the node movement rate. In addition, when the proposed mobile model is applied to the routing protocol, the superiority of network life can be verified from measured FND values. We overcame the limitations of the existing random movement model, showing excellent characteristics in terms of energy efficiency and stable in terms of changes in node movement.

• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.1
• /
• pp.24-28
• /
• 2017

In the Internet of Things (IoT), resource-limited smart devices communicate with each other while performing sensing and computation tasks. Thus, these devices can be exposed to various attacks being launched and spread through network. For instance, attacker can reuse the codes of IoT devices for malicious activity executions. In the sense that attacker can craft malicious codes by skillfully reusing codes stored in IoT devices, code-reuse attacks are generally considered to be dangerous. Although a variety of schemes have been proposed to defend against code-reuse attacks, code randomization is regarded as a representative defense technique against code-reuse attacks. Indeed, many research have been done on code randomization technique, however, there are little work on analysis of the interactions between code randomization defenses and code-reuse attacks although it is imperative problem to be explored. To provide the better understanding of these interactions in IoT, we analyze how code randomization defends against code-reuse attacks in IoT and perform simulation on it. Both analysis and simulation results show that the more frequently code randomizations occur, the less frequently code-reuse attacks succeed.

• Journal of Convergence for Information Technology
• /
• v.9 no.12
• /
• pp.216-226
• /
• 2019

The purpose of this study was to provide basic data for developing strategic programs based on broadcasting of civil defense exercise in nation focused on fire-fighting officers. 33 Q-population (concourse) was selected based on the media related literature review described above, and interviews targeting the general public. As the next step representative statements were chosen randomly and reduced in number to a final 25 statement samples for the purposes of this study. The methodology of a Q-study does not infer the characteristics of the population sample from the sample, selecting of the P-sample is likewise not governed probabilistic sampling methods. Finally, in this research, 41 people were selected as the P-sample.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.2
• /
• pp.263-269
• /
• 2017

'Goal Model' is core knowledge of 'Autonomic Control System' suggested to minimize human interference in system management. 'Autonomic Control System' performs 'Monitoring-Analysis-Plan-Execution', that is the four step of 'Autonomic Control', based on 'Goal Model'. Therefore, it is necessary to quantify achievement ratio of 'Goal Model' of target system. Thus, this paper present 'Probabilistic Evaluation of Goal Model' for methodology how to quantify achievement ratio of 'Goal Model'. It comprises 3-steps including 'Goal modeling and weighting', 'Goal model monitoring', 'Goal model evaluation and analysis'. Through these research, we provide core knowledge for 'Autonomic Control system' and it is possible to increase the reliability of system by evaluating 'Goal model' with applying weight. As case study, we apply 'Goal model' to a 'Smart IoT Kit' and we demonstrate the validity of the suggested research.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.2
• /
• pp.63-70
• /
• 2016

To increase throughput efficiency and improve performance, FTN(Faster Than Nyquist) method and LDPC(Low Density Parity Code) codes are employed in DVB-S3 system. In this paper, we proposed efficient turbo equalization model to minimize inter symbol interference induced by FTN transmission. This paper introduces two conventional scheme employing SIC(Successive Interference Cancellation) and BCJR equalizer. Then, we proposed new scheme to resolve problems in this two conventional scheme. To make performance improved in turbo equalization model, the outputs of LDPC and BCJR equalizer are iteratively exchange probabilistic information. In fed LDPC outputs as extrinsic informa tion of BCJR equalizer. we split LDPC output to separate bit probabilities. We compare performance of proposed scheme to that of conventional methods through using simulation in AWGN(Additive White Gaussian Noise) channel. We confirmed that performance was improved compared to conventional methods as increasing throughput parameters of FTN.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.102-108
• /
• 2020

One of the key features of a mobile crowd-sensing (MCS) system is task allocation, which aims to recruit workers efficiently to carry out the tasks. Due to various constraints of the tasks (such as specific sensor requirement and a probabilistic guarantee of task completion) and workers heterogeneity, the task allocation become challenging. This assignment problem becomes more intractable because of the deadline of the tasks and a lot of possible task completion order or moving path of workers since a worker may perform multiple tasks and need to physically visit the tasks venues to complete the tasks. Therefore, in this paper, a hybrid search algorithm for task allocation called HST is proposed to address the problem, which employ a traveling salesman problem heuristic to find the task completion order. HST is developed based on the tabu search algorithm and exploits the premature convergence avoiding concepts from the genetic algorithm and simulated annealing. The experimental results verify that our proposed scheme outperforms the existing methods while satisfying given constraints.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.706-709
• /
• 2008

With the increasing popularity of P2P file sharing and advancement of mobile technologies, mobile P2P has revealed its attraction. Anonymity has become an increasing requirement in mobile networks. To reduce receiving garbage files, file validation and filtering are other requirements in the mobile P2P environment. If there are effective file filtering and validation mechanism, nodes' battery duration will be saved. In this paper, we do an analysis of security and anonymity in P2P file sharing and exchange system in mobile ad hoc environment, and propose a new efficient anonymous protocol, which can provide anonymity by broadcasting with a probabilistic algorithm and hiding real hop count information, the file validation by the file's special hash value and file filtering mechanism through the collaboration of middle nodes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.4
• /
• pp.75-88
• /
• 2008

This paper presents a spatial-level nonparametric multi-focus image fusion technique based on kernel estimates of input image blocks' underlying class-conditional probability density functions. Image fusion is approached as a classification task whose posterior class probabilities, P($wi{\mid}Bikl$), are calculated with likelihood density functions that are estimated from the training patterns. For each of the C input images Ii, the proposed method defines i classes wi and forms the fused image Z(k,l) from a decision map represented by a set of $P{\times}Q$ blocks Bikl whose features maximize the discriminant function based on the Bayesian decision principle. Performance of the proposed technique is evaluated in terms of RMSE and Mutual Information (MI) as the output quality measures. The width of the kernel functions, ${\sigma}$, were made to vary, and different kernels and block sizes were applied in performance evaluation. The proposed scheme is tested with C=2 and C=3 input images and results exhibited good performance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.5
• /
• pp.207-214
• /
• 2020

Nowadays, the use of smart phones and various electronic devices is increasing, the Internet and SNS are activated, and we live in the flood of information. The amount of information has grown exponentially, making it difficult to look at a lot of information, and more and more people want to see only key keywords in a document, and the importance of research to extract topics that are the core of information is increasing. In addition, it is also an important issue to extract the topic and compare it with the past to infer the current trend. Topic modeling techniques can be used to extract topics from a large volume of documents, and these extracted topics can be used in various fields such as trend prediction and data analysis. In this paper, we inquire the topic of the three-year papers of 2016, 2017, and 2018 in the field of computing using the LDA algorithm, one of Probabilistic Topic Model Techniques, in order to analyze the rapidly changing trends and keep pace with the times. Then we analyze trends and flows of research.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.1-8
• /
• 2021

In Mobile Ad-Hoc Network (MANET) Application, routing protocol is essential to ensure successful data transmission to all nodes. Ad-hoc On-demand Distance Vector (AODV) Protocol is a reactive routing protocol that is mostly used in MANET applications. However, the protocol causes Route Request (RREQ) message flooding issue due to the broadcasting method at the route request stage to find a path to a particular destination, where the RREQ will be rebroadcast if no Request Response (RREP) message is received. A scalable neighbor-based routing (SNBR) protocol was then proposed to overcome the issue. In the SNBR protocol, the RREQ message is only rebroadcast if the number of neighbor nodes less than a certain fix number, known as drop factor. However, since a network always have a dynamic characteristic with a dynamic number of neighbor nodes, the fix drop factor in SNBR protocol could not provide an optimal flooding problem solution in a low dense network environment, where the RREQ message is continuously rebroadcast RREQ message until reach the fix drop factor. To overcome this problem, a new broadcasting method as Dynamic SNBR (DSNBR) is proposed, where the drop factor is determined based on current number of neighbor nodes. This method rebroadcast the extra RREQ messages based on the determined dynamic drop factor. The performance of the proposed DSNBR is evaluated using NS2 and compared with the performance of the existing protocol; AODV and SNBR. Simulation results show that the new routing protocol reduces the routing request overhead, energy consumption, MAC Collision and enhances end-to-end delay, network coverage ratio as a result of reducing the extra route request messages.