• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.108-110
• /
• 2015

In this paper, we proposed the relay node selection scheme using property of node such as velocity, direction in Delay Tolerant Networks. the existing selection scheme is caused the problem increasing the transmission delay and packet loss, if select the relay node for different mobile with destination. To overcome this problem, we proposed the relay node selection scheme using the property of mobile node. the proposed scheme represents and shares the property of mobile node. The proposed algorithm assumed the sketchy position of node from mobile node delivering property of destination. In addition, the propose algorithm recognizes and analyzes the context of mobile node to provide the relay node transferring the data efficiently. The simulation result provides the better result in terms of transmission delay and packet delivery ratio by selecting transmission by relay node according property of node.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.3984-3996
• /
• 2014

Mobile social network can be seen as a specific application of the DTN (Delay Tolerant Network), in which the information propagation can be impacted by many social behaviors of the nodes. For a specific node, its social behaviors are various. For example, the node may not be interested in the information before receiving it and may also discard the information after getting it. On the other hand, people are more willing to forward the message to his friends. These interactive behaviors between nodes can be seen as social behaviors. It is easy to see that the impact of the social behaviors is related to the social ties, which can be manifested by the structure of the social network. State of the art works often simply assumes that the social networks can be divided into some communities. At present, some works find that the structure of some social networks is scale-free. To overcome this problem, this paper proposes a theoretical model to evaluate the impact of above social behaviors in the DTN-like scale-free network. Simulation shows the accuracy of the model. Numerical results show that both social behaviors and scale-free character have significant impact on information propagation. Moreover, the impact of social behaviors is related to the scale-free character of the networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.10
• /
• pp.645-653
• /
• 2014

Recently, the ocean field researches such as offshore plant, ocean survey and underwater monitoring systems are garnering the attention from both academy and industry. However, the communication in underwater environment is very difficult because of the unique irregular features in water. This is the reason that the application of terrestrial protocols to the water environment is not proper. This paper proposes a routing algorithm that can enhance communication reliability by utilizing channel properties in underwater environment. We address two problems that lead to the poor communication performance, signal attenuation and multi-path problem in water. Overcoming these problems, the proposed algorithm ensures high packet delivery ratio and low transmission delay. Also, this paper evaluates the performance through simulation.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.6
• /
• pp.81-92
• /
• 2014

In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.1
• /
• pp.15-22
• /
• 2014

Delay-Tolerant Network employs message forwarding based on a Store, Carry and Forward method to conquer no guarantee of continue connectivity. For this reason, a lot of DTN routing scheme have been proposed recently. message forwarding is an important research issue in delay-tolerant network and In this paper, we propose a efficiency DTN routing scheme using node's social relation and expanded Ego-network betweenness centrality. Our simulation results show that it is more efficient to message delivery cost than Epidemic routing, Friendship routing while it has a little performance degradation of message delivery ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2180-2200
• /
• 2015

This paper considers mobility control to improve packet delivery in delay-tolerant networks (DTNs) under group mobility. Based on the group structure in group mobility, we propose two mobility control techniques; group formation enforcement and group purposeful movement. Both techniques can be used to increase the contact opportunities between groups by extending the group's reachability. In addition, they can be easily integrated into some existing DTN routing schemes under group mobility to effectively expedite the packet delivery. This paper is divided into 2 parts. First, we study how our proposed mobility control schemes reduce the packet delivery delay in DTNs by integrating them into one simple routing scheme called group-epidemic routing (G-ER). For each scheme, we analytically derive the cumulative density function of the packet delivery delay to show how it can effectively reduce the packet delivery delay. Then, based on our second proposed technique, the group purposeful movement, we design a new DTN routing scheme, called purposeful movement assisted routing (PMAR), to further reduce the packet delay. Extensive simulations in NS2 have been conducted to show the significant improvement of PMAR over G-ER under different practical network conditions.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.1020-1030
• /
• 2016

This paper propose an improving relay node selection method for node-to-node connectivity. This concern with the mobility and analysis of deployed for masking operation using highest connectivity node. The major of Delay Tolerant Network (DTN) routing protocols make use of simple forwarding approach to transmit the message depend on the node's mobility. In this cases, the selection of the irrelevant mobile node induced the delay and packet delivery loss caused by limiting buffer size and computational power of node. Also the proposed algorithm provides the node connectivity considering the mobility and direction select the highest connectivity node from neighbor node using masking operation. From the simulation results, the proposed algorithm compared the packet delivery ratio with PROPHET and Epidemic. The proposed Enhanced Prediction-based Context-awareness Matrix(EPCM) algorithm shows an advantage packet delivery ratio even with selecting relay node according to mobility and direction.

• Journal of Korean Society on Water Environment
• /
• v.32 no.3
• /
• pp.261-270
• /
• 2016

We analyzed cyanobacterial community including akinete, resting cell, and benthic cyanobacteria in sediment of Bukhan, Namhan-River, Paldang-Lake, and Kyeongan-Stream and compared the physicochemical factors for water and pore water. We also performed cyanobacteria growth potential test through incubating sediment. As a result of physicochemical analysis, the concentrations of nutrients were similar for each depth of Bukhan-River. For Namhan-River and Lake Paldang sites, the concentrations of TP and DTN in bottom and deep water had higher levels. DTN in water body composed of NO3-N(73%) while DTN in pore water composed of NH3-N(77.8%). Benthic cyanobacteria in the sediment such as Oscillatoria tenuis, O. limosa, Phormidium tenue, Pseudanabaena limnetica, and Lyngbya sp. were dominant (between 0.0∼243.3×10³ cells/g, w/w). Cell densities of cyanobacteria in sediment depth of 0∼2 cm in most sites were higher compared to those in other depths. The cell density of cyanobacteria in sediment correlated with pH, conductivity, BOD5, TP, DTP, and chl. a. Increased phytoplankton and organic matters were found to be able to inhibit the growth of benthic cyanobacteria. Results of cyanobacteria growth potential test after incubating sediment revealed that harmful cyanobacteria (Anabaena, Aphanizomenon, Microcystis, and Oscillatoria) appeared at 7 days post culturing. Base on these results, the methods used in this study are considered to be able to determine the appearance of harmful cyanobacteria.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1046-1049
• /
• 2010

Custody transfer method is often managed by the general architecture of Delay Tolerant Network (DTN) to provide reliability in the communications through storage and forward paradigm, but can be inefficient when the acknowledgment messages are lost, or the network becomes congested. In this paper we describe a new architecture that is particularly efficient for the custody transfer method. Because, it provides an additional control of acknowledgment messages, consolidate knowledge and services, using the advantage of the cross-over architectures and distribution control through local and global services.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.1009-1016
• /
• 2015

In this paper, we propose EPCM(Efficient Prediction-based Context-awareness Matrix) algorithm analyzing connectivity by predicting cluster's context data such as velocity and direction. In the existing DTN, unrestricted relay node selection causes an increase of delay and packet loss. The overhead is occurred by limited storage and capability. Therefore, we propose the EPCM algorithm analyzing predicted context data using context matrix and adaptive revision weight, and selecting relay node by considering connectivity between cluster and base station. The proposed algorithm saves context data to the context matrix and analyzes context according to variation and predicts context data after revision from adaptive revision weight. From the simulation results, the EPCM algorithm provides the high packet delivery ratio by selecting relay node according to predicted context data matrix.