• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.4
• /
• pp.73-78
• /
• 2018

In this paper, we consider a system where multiple sources are encrypted in separated nodes and sent through their respective public communication channels into a joint sink node. We are interested at the problem on protecting the security of an already existing system such above, which is found out to have correlated encryption keys. In particular, we focus on finding a solution without introducing additional secret keys and with minimal modification to minimize the cost and the risk of bringing down an already running system. We propose a solution under a security model where an eavesdropper obtains all ciphertexts, i.e., encrypted sources, by accessing available public communication channels. Our main technique is to use encoders of universal function to encode the ciphertexts before sending them to public communication channels.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.7
• /
• pp.1367-1372
• /
• 2007

This paper suggests One-time Password key exchange authentication technique for a strong authentication based on MANET and through identify wireless environment security vulnerabilities, analyzes current authentication techniques. The suggested authentication technique consists of 3 steps: Routing, Registration, and Running. The Routing step sets a safe route using AODV protocol. The Registration and Running step apply the One-time password S/key and the DH-EKE based on the password, for source node authentication. In setting the Session key for safe packet transmission and data encryption, the suggested authentication technique encrypts message as H(pwd) verifiers, performs key exchange and utilizes One time password for the password possession verification and the efficiency enhancement. EKE sets end to end session key using the DH-EKE in which it expounds the identifier to hash function with the modula exponent. A safe session key exchange is possible through encryption of the H(pwd) verifier. The suggested authentication technique requires exponentiation and is applicable in the wireless network environment because it transmits data at a time for key sharing, which proves it is a strong and reliable authentication technique based on the complete MANET.

• Journal of KIISE:Information Networking
• /
• v.33 no.1
• /
• pp.76-90
• /
• 2006

Sensor network consists of a large number of sensor nodes that are densely deployed either inside the phenomenon or very close to it. The life time of each node in the sensor network significantly affects the life time of whole sensor network. A node which drained out its battery may incur the partition of whole network in some network topology The life time of each node depends on the battery capacity of each node. Therefore if all sensor nodes in the network live evenly long, the life time of the network will be longer. In this paper, we propose Cluster-Based Power-Efficient Routing (CBPER) Protocol which provides scalable and efficient data delivery to multiple mobile sinks. Previous r(luting protocols, such as Directed Diffusion and TTDD, need to flood many control packets to support multiple mobile sinks and many sources, causing nodes to consume their battery. In CBPER, we use the fact that sensor nodes are stationary and location-aware to construct and maintain the permanent grid structure, which makes nodes live longer by reducing the number of the flooding control packets. We have evaluated CBPER performance with TTDD. Our results show that CBPER is more power-efficient routing protocol than TTDD.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.402-408
• /
• 2008

This paper considers the problem of minimizing network-wide broadcast latency in multi-rate wireless mesh networks where a node can dynamically adjust its link layer transmission rates to its neighbors. We propose a broadcast algorithm that complements existing broadcast construct algorithm which chooses a multicast node randomly when each candidate node has same metric. We consider the currently accumulated broadcast latency from source node to the each candidate node so far to choose the next broadcast node. The proposed broadcast algorithm for minimizing latency in a multi-rate mesh networks which exploit wireless advantage and the multi-rate nature of the network. Simulation based on current 802.11 parameters shows that proposed MinLink_WCDS algorithm improves overall latency than the previous existing broadcast algorithm.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.10
• /
• pp.1087-1092
• /
• 2015

It was diversified demand for a wireless network to the rapid growth of the Internet, the time and space that are not in the new level of Internet technology, limits the Ad-hoc networks are needed. Ad-hoc networks do not communicate with the central station, each of the mobile nodes included in the network communicate with each other by the relay role. In recent years, the Ad-hoc wireless networks in a variety of routing protocols and network security, research is actively underway for the authentication method, but the security of wireless Internet and Ad-hoc networks, certification is incomplete situation. This paper considers the authentication and key agreement technique applicability of the USIM card using the DSR routing protocol of the Java Card and Ad-hoc networks, we propose a secure authentication mechanism between the mobile node.

• The Journal of the Korea Contents Association
• /
• v.7 no.8
• /
• pp.59-65
• /
• 2007

Overlay Multicast is an effective method for efficient utilization of system resources and network bandwidth without a need for hardware customization. Multicast tree reconstruction is required when a non-leaf node leaves or fails. However frequent multicast tree reconstruction introduces serious degradation in performance. In this paper, we propose a tree performance optimization algorithm to solve this defect by using information(RTCP-probing) that becomes a periodic feedback to a source node from each child node. The proposed model is a mechanism performed when a parent node seems to cause deterioration in the tree performance. We have improved the performance of the whole service tree using the mechanism and hence composing an optimization tree. The simulation results show that our proposal stands to be an effective method that can be applied to not only the proposed model but also to existing techniques.

• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.637-644
• /
• 2009

A study about performance analysis of synchronization clock using measured clock noises is required. Therefore this paper executed the study for performance analysis of synchronization clock and acquirement of maximum number of network node with various clock states using measured clock noises in NG-SDH networks. Also this paper generated a suitable clock model using measured clock noises, and carried out simulations with various clock states. Through the simulation results, maximum numbers were 80 or more network nodes in normal state, and were below 37 nodes in short-term phase transient(SPT) state, and were 50 or more in long-term phase transient(LPT) state. Accordingly this study showed that maximum numbers to meet ITU-T specification were below 37 network nodes in three clock states. Also this study showed that when SPT or LPT states occur from NE network before DOTS system, synchronization source must change with other stable synchronization source of normal state.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1A
• /
• pp.23-29
• /
• 2006

In wireless sensor networks(WSNs), it is crucial to maintain network connectivity as long as possible since nodes are battery-powered and unchange-able. We propose a new routing protocol called Energy Aware Source Routing(EASR) which can be efficient in respect of network lifetime and long-term connectivity. Our protocol is multipath source routing, only one path will be selected at the same time and each path has probability to be selected like as Energy Aware Routing(EAR) protocol. The route discovery procedure of EASR protocol is reformed from the route discovery procedure of Split Multipath Routing(SMR) protocol. However, there is the difference between SMR and EASR. In EASR, we define an overhearing ratio in order to reduce energy waste due to overhearing effect among each selected path. Thus, we can establish energy efficient multiple paths by making use of overhearing ratio. The simulation results are also demonstrated that our scheme increases in network lifetimes, and achieves reasonable packet latency time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1164-1172
• /
• 2007

To solve scalability problem in the ZigBee Network, this paper presents a new mesh routing protocol for ZigBee, called ZigBee Cluster Label (ZiCL). ZiCL divides the ZigBee network into one or more logical clusters and then assigns a unique Cluster Label to each cluster so that it discovers a route of a destination node based on Cluster Label. When a node collects new Cluster Label information of a destination node according to discovery based on Cluster Label, ZiCL encourages nodes with the same Cluster Label to share the information. Consequen tly, it contributes on reducing numerical potential route discoveries and improving network performances such as routing overhead, end-to-end delay, and packet delivery ratio. Simulation results using NS-2 show ZiCL performs well.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.6
• /
• pp.17-24
• /
• 2011

In this paper, we propose an Entropy-based Routing Protocol using Mobility (ERPM) for supporting ubiquitous convergence services efficiently in mobile ad-hoc wireless networks. The main features that the ERPM introduces to obtain the goals can be summarized as follows. First, ERPM can construct stable routing routes based on the entropy concepts using mobility of nodes. Second, ERPM can quantitatively evaluate the stability of route by entropy concepts using mobility of nodes. Third, ERPM can select the most stable route in the view points of mobility of routes between a source node and a destination node, where multiple paths are available. The performance evaluation of the proposed ERPM performed via simulation using OPNET and analysis shows that the ERPM can support the construction of stable routing routes and increase the transmission ratio of data efficiently.