• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.3
• /
• pp.510-518
• /
• 2014

In this study, in order to improve and optimize the performance of the turning mechanism for a fish robot in the fluid, we propose the tail joint trajectories using neural networks to mimic the CST(C-shape Sharp Turn) patterns of a real fish which is optimized in the natural environment. In order to mimic the CST patterns of a fish, we convert the sequential recording CST patterns into the coordinate data, and change the numerical coordinate data into a functions. We change the motion functions to the relative joint angles which is adapted to suit robot's shape and data. However, these relative joint trajectories obtained by the sequential recording of the carp have low-precision. It is difficult to apply to the control of a fish robot. Therefore, the relative joint trajectories are interpolated using neural networks with superior generalization ability and applied to the fish robot. we have found that the proposed method using neural networks is superior to ones using high-order polynomial equation through the computer simulations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.11
• /
• pp.2640-2644
• /
• 2014

With the development of technology, wireless sensor networks (WSN) are wireless networks of consisting a large number of small and low-cost sensors. Wireless sensor networks facilitate collaboration to achieve the perception of information collection, processing and transmission tasks in deployment area. They have various purposes such as military, disaster relief, medical rescue, environmental monitoring, precision farming and manufacturing industry etc. Therefore, technologies for data maintaining technologies in sensor network environment is one of essential parts of sensor networks. In this paper, we present the essential particulars about data management technology at wireless sensor network environments and propound the issues. Further, we could organize and develop a systematic approach in solving the issues.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.4
• /
• pp.676-682
• /
• 2018

In wireless sensor networks, we propose an optimization algorithm in order to minimize the consumed energy of nodes for maritime search and rescue. In the marine environment, search and rescue operations are mainly performed on the surveillance side and passively on the rescued side. A self-configurable wireless sensor network can build a system that can send rescue signals in the operations. A simulated annealing algorithm is proposed to minimize the consumed energy of nodes in the networks with many nodes. As the density of nodes becomes higher, the algorithmic computation will increase highly. To search the good result in a proper execution time, the proposed algorithm proposes a new neighborhood generating operation and improves the efficiency of the algorithm. The proposed algorithm was evaluated in terms of the consumed energy of the nodes and algorithm execution time, and the proposed algorithm performed better than other optimization algorithms in the performance results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.2
• /
• pp.322-332
• /
• 2017

Wireless Body Area Networks is an environment that provides an appropriate service remotely by collecting user's biometric information. With the growing importance of sensor, WBAN also attracts extensive attention. Since WBAN is representatively used in the medical field, it can be directly related to the patient's life. Hence security is very important in WBAN. Mutual authentication between the client and the application provider is essential. And efficiency is also important because a used device is limited to computation cost. In this reason, ID-based anonymous authentication scheme in WBAN has been intensively studied. We show that the recent research result of Wu et al. which is about the ID-based anonymous authentication scheme is vulnerable to impersonation attack. And we propose a new ID-based anonymous authentication scheme that is secure against the attacks discovered in the existing schemes. Compared to the existing schemes, the computation cost of our scheme is improved by 30.6% and 7.3%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.2
• /
• pp.452-458
• /
• 2014

In Wireless Sensor Networks the Medium access control (MAC) protocol has many challenges to solve such as reducing energy consumption, supporting QoS(quality of service) fairness, and reducing delivery delay. This paper proposed a low-delay supporting MAC protocol in multi-hop Wireless Sensor Networks. The proposed protocol uses the RB(rapid beacon) frame for reducing delivery delay. The RB frame is a modified IEEE 802.15.4 beacon frame. For sender adaptive-wakeup, the RB frame includes a seed number for determining of a receiver wakeup time. And for next hop receiver adaptive-wakeup, the RB frame includes the length of remaining data packet information. Results showed that our LD-MAC protocol outperformed other protocol in terms of data packet delivery delay.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.1
• /
• pp.83-90
• /
• 2015

This paper proposes a Tabu search algorithm to maximize the connectivity between the router nodes and the client nodes in wireless mesh networks. As the number of the router nodes and the client nodes in the networks increases, the amount of calculation for finding the solution would be too much increased. To obtain the optimal solution within a reasonable computation time for a high-density network, we propose a Tabu search algorithm to obtain the optimal solution for maximizing the connectivity. In order to make a search more efficient, we propose some efficient neighborhood generating operations of the Tabu search algorithm. We evaluate those performances through some experiments in terms of the maximum number of the connectivity and the execution time of the proposed algorithm. The comparison results show that the proposed algorithm outperforms other existing algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.2
• /
• pp.331-338
• /
• 2011

Objectives of shipboard integration networks are to exchange and manage integrated information. Shipboard integration networks use UDP(User Datagram Protocol) multicast for the exchange of information. However, such information can be missed or damaged because UDP can't guarantee reliability. The standard of shipboard integration networks defines error log functions for the missed or damaged information. In this paper, we analyze internal and external log functions. The internal log function records errors internally, and the external log function sends error messages to a log server and records them in a database. We also develop a log processing module and log server for the external log function.

• Journal of Internet Computing and Services
• /
• v.15 no.2
• /
• pp.9-18
• /
• 2014

The sensors attached on/in a person are moved since human body frequency changes their activity, therefore in wireless body area networks, nodal mobility and non-line-of-sight condition will impact on performance of networks such as energy efficiency and reliable communication. We then proposed schemes which study on forwarding decisions against frequent change of topology and channel conditions to increase reliable connections and improve energy efficiency. In this work, we control the size of packets, forwarding rate based on ratio of input links and output links at each node. We also robust the network topology by extending the peer to peer IEEE 802.15.4-based. The adaptive topology from chain-based to grid-based can optimal our schemes. The simulation shows that these approaches are not only extending network lifetime to 48.2 percent but also increase around 6.08 percent the packet delivery ratio. The "hot spots" problem is also resolved with this approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4883-4901
• /
• 2016

Energy efficiency in Wireless Sensor Networks (WSNs) is very appealing research area due to serious constrains on resources like storage, processing, and communication power of the sensor nodes. Due to limited capabilities of sensing nodes, such networks are composed of a large number of nodes. The higher number of nodes increases the overall performance in data collection from environment and transmission of packets among nodes. In such networks the nodes sense data and ultimately forward the information to a Base Station (BS). The main issues in WSNs revolve around energy consumption and delay in relaying of data. A lot of research work has been published in this area of achieving energy efficiency in the network. Various techniques have been proposed to divide such networks; like grid division of network, group based division, clustering, making logical layers of network, variable size clusters or groups and so on. In this paper a new technique of group based WSNs is proposed by using some features from recent published protocols i.e. "Energy-Efficient Multi-level and Distance Aware Clustering (EEMDC)" and "Energy-Efficient Multi-level and Distance Aware Clustering (EEUC)". The proposed work is not only energy-efficient but also minimizes the delay in relaying of data from the sensor nodes to BS. Simulation results show, that it outperforms LEACH protocol by 38%, EEMDC by 10% and EEUC by 13%.

• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.437-455
• /
• 2009

In the near future, various multicast based services will be provided over clustered wireless networks. To provide multicast services in secure manner, multicast messages are encrypted by using group key which is shared by group members. Therefore, various group key management schemes have been introduced until now. Among them, tree based approach is one of the most representative paradigms in group key management. Traditional tree based approaches effectively reduce rekeying message transmissions of the key distribution center. However, they do not consider the network bandwidth used for transmitting the rekeying messages. In this paper, we firstly present formulas that describe bandwidth consumption of tree based group key management scheme. Based on our formulations, we propose a bandwidth efficient key tree management scheme for clustered wireless networks where membership changes occur frequently. Simulation results show that our scheme effectively reduces the bandwidth consumption used for rekeying compared to existing key tree schemes.