• The KIPS Transactions:PartC
• /
• v.14C no.3 s.113
• /
• pp.229-238
• /
• 2007

Sensor networks consist of many tiny sensor nodes that collaborate among themselves to collect, process, analyze, and disseminate data. In sensor networks, sensor nodes are typically powered by batteries, and have limited computing resources. Moreover, the redeployment of nodes by energy exhaustion or their movement makes network topology change dynamically. These features incur problems that do not appear in traditional, wired networks. Security in sensor networks is challenging problem due to the nature of wireless communication and the lack of resources. Several efforts are underway to provide security services in sensor networks, but most of them are preventive approaches based on cryptography. However, sensor nodes are extremely vulnerable to capture or key compromise. To ensure the security of the network, it is critical to develop suity mechanisms that can survive malicious attacks from "insiders" who have access to the keying materials or the full control of some nodes. In order to protect against insider attacks, it is necessary to understand how an insider can attack a sensor network. Several attacks have been discussed in the literature. However, insider attacks in general have not been thoroughly studied and verified. In this paper, we study the insider attacks against routing protocols in sensor networks using the Ad-hoc On-Demand Distance Vector (AODV) protocol. We identify the goals of attack, and then study how to achieve these goals by modifying of the routing messages. Finally, with the simulation we study how an attacker affects the sensor networks. After we understand the features of inside attacker, we propose a detect mechanism using hop count information.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.1
• /
• pp.15-26
• /
• 2013

IP-based Wireless Sensor Networks (IP-WSNs) are gaining importance for their broad range of applications in health-care, home automation, environmental monitoring, industrial control, vehicle telematics and agricultural monitoring. In all these applications, mobility in the sensor network with special attention to energy efficiency is a major issue to be addressed. Because of the energy inefficiency of networks-based mobility management protocols can be supported in IP-WSN. In this paper we propose a network based mobility supported IP-WSN protocol called Multicasting-based inter-Domain Mobility Management Scheme in Sensor-based Fast Proxy Mobile IPv6 Networks (mSFP). Based on [8,20], We present its network architecture and evaluate its performance by considering the signaling and mobility cost. Our analysis shows that the proposed scheme reduces the signaling cost, total cost, and mobility cost. With respect to the number of IP-WSN nodes, the proposed scheme reduces the signaling cost by 7% and the total cost by 3%. With respect to the number of hops, the proposed scheme reduces the signaling cost by 6.9%, the total cost by 2.5%, and the mobility cost by 1.5%. With respect to the number of IP-WSN nodes, the proposed scheme reduces the mobility cost by 1.6%.

• Geophysics and Geophysical Exploration
• /
• v.3 no.2
• /
• pp.53-60
• /
• 2000

The server/client systems using the web protocol and distribution computing environment by network was applied to the MT data processing based on the Java technology. Using this network based system, users can get consistent and stable results because the system has standard analysing methods and has been tested from many users through the internet. Users can check the MT data processing at any time and get results during exploration to reduce the exploration time and money. The pure/enterprised Java technology provides facilities to develop the network based MT data processing system. Web based socket communication and RMI technology are tested respectively to produce the effective and practical client application. Intrinsically, the interpretation of MT data performing the inversion and data process requires heavy computational ability. Therefore we adopt the MPI parallel processing technique to fit the desire of in situ users and expect the effectiveness for the control and upgrade of programing codes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5B
• /
• pp.385-394
• /
• 2012

The tactical mobile communication network, which comprises a part of the next-generation Tactical Information and Communication Network (TICN), provides means of communication and control for Tactical Multi-Functional Terminals (TMFT) belonging to a Mobile Subscriber Access Point (MSAP). The next-generation of MSAP is capable of constructing a backbone network via LCTR and HCTR directional antennas. At the same time, WMN modules are used to create and manage a wireless mesh backbone. When directional antennas are used in mobile environments, seamless services cannot be efficiently supported as the movement of the node prevents the angle of the antenna to constantly match. Therefore, data communication through the wireless mesh networks is required to provide direct communication between mobile MSAPs. Accordingly, mutual authentication and data encryption mechanisms are required to provide reliable data transmission in this environment. To provide efficient mutual authentication between MSAP devices, the process of verifying a certificate of the other MSAP device through its own authentication server is required. This paper proposes mutual authentication mechanisms where the MSAP requiring authentication and the MSAP that permits it initiates low-cost and efficient authentication in a distributed way. More specifically, we propose a method of applying EAP-ELS (Extensible Authentication Protocol-Transport Layer Security) in the next-generation TICN.

• Journal of KIISE:Information Networking
• /
• v.33 no.4
• /
• pp.333-342
• /
• 2006

The cdma2000 lxEV - DO mobile communication system provides broadcast and multicast services (BCMCS) to meet an increasing demand from multimedia data services. The servicing of video streams over a BCMCS network must, however, face a challenge from the unreliable and error-prone nature of the radio channel. The BCMCS network uses Reed-Solomon coding integrated with the MAC protocol for error recovery. We analyze this coding technique and show that it is not effective in the case of slowly moving mobiles. To improve the playback quality of an MPEG-4 FGS video stream, we propose the Hybrid error recovery scheme, which combines Reed-Solomon with ARQ, using slots which are saved by reducing the Reed-Solomon coding overhead. The target packets to be retransmitted are prioritized by a utility function to reduce the packet error rate in the application layer within a fixed retransmission budget. This is achieved by considering of the map of the error control block at each mobile node. The proposed Hybrid error recovery scheme also uses the characteristics of MPEG-4 FGS (fine granularity scalability) to improve the video quality even when conditions are adverse: slow-moving nodes and a high error rate in the physical channel.

• Journal of KIISE:Information Networking
• /
• v.29 no.4
• /
• pp.375-385
• /
• 2002

The IETF has defined the Intserv model and the RSVP signaling protocol to improve QoS capability for a set of newly emerging services including voice and video streams that require high transmission bandwidth and low delay. However, since the current Intserv model requires each router to maintain the states of each service flow, the complexity and the overhead for processing packets in each rioter drastically increase as the size of the network increases, giving rise to the scalability problem. This motivates our work; namely, we investigate and devise new control schemes to enhance the scalability of the Intesev model. To do this, we basically resort to the SCORE network model, extend it to fairly well adapt to the three services presented in the Intserv model, and devise schemes of the QoS scheduling, the admission control, and the edge and core node architectures. We also carry out the computer simulation by using ns-2 simulator to examine the performance of the proposed scheme in respects of the bandwidth allocation capability, the packet delay, and the packet delay variation. The results show that the proposed scheme meets the QoS requirements of the respective three services of Intserv model, thus we conclude that the proposed scheme enhances the scalability, while keeping the efficiency of the current Intserv model.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.5
• /
• pp.514-520
• /
• 2018

Presence service provides various information about users such as locations, status of on/offline and network access methods, and number of presence resources required by each users increases largely in mobile environment. Therefore an effective method which can reduce load of presence servers is needed. In this paper, a large scale distributed presence service system which can distribute effectively total presence system load of presence servers using message control session has been presented. This large scale distributed presence service system provides various presence information for massive volumes of users. In this study, a new message control session architecture which can dynamically distribute loads of the presence servers to multiple servers has been presented, and a new presence information data architecture for controlling load of the presence servers has been designed. In this architecture, each presence server can exchange current load level in real time to get variance of the total system load change according to user numbers, and can distribute system load to maintain load level of each server evenly. The performance of the proposed large scale distributed presence service system has been analysed by experiments. The results has been showed that average presence resource subscription processing time reduced from 42.6% to 73.6%, and average presence notification processing time reduced from 37.6% to 64.8%.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.1
• /
• pp.35-40
• /
• 2019

It is important to constantly provide service in real-time multimedia applications using multicast. Transmission path reconstruction occurs in hybrid multicast using Internet Protocol (IP) multicast and ALM in order to adapt the network status to things like congestion. So, there is a problem in which real-time QoS is reduced, caused by an increase in end-to-end delay. In this paper, we want to solve this problem through multi-layer transmission path construction. In the proposed method, we deploy the control server and application layer overlay host (ALOH) in each multicast domain (MD) for hybrid multicast construction. After the control server receives the control information from an ALOH that joins the MD, it makes a group based on the hop count and sends it to the ALOH in each MD. The ALOH in the MD performs the role of sending the packet to another ALOH and constructs the multi-layered transmission path in order of priority by using control information that is received from the control server and based on the delay between neighboring ALOHs. When congestion occurs in, or is absent from, the ALOH in the upper MD, the ALOH selects the path with the highest priority in order to reduce end-to-end delay. Simulation results show that the proposed method could reduce the end-to-end delay to less than 289 ms, on average, under congestion status.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.233-243
• /
• 2003

With the original Transmission Control Protocol(TCP) design, which is particularly targeted at the wired networks, a packet loss is assumed to be caused by the network congestion. In the wireless environment where the chances to lose packets due to transmission bit errors are not negligible, though, this assumption may result in unnecessary TCP performance degradation. In this paper, we propose three schemes that improve the ability to conceal the packet losses in the wireless network while limiting the degree of violating TCP end-to-end semantics to a temporary incidents. If there happens a packet loss at the wireless link and there is a chance that the loss is noticed by the sending TCP, the proposed schemes send an indirect acknowledgement. Each of the proposed schemes uses different criteria to decide whether there is a chance that the packet loss occurred in the wireless part is noticed by the sender. In order to limit the buffer overhead in the base, the indirect acknowledgements are issued only when the length of buffer is less than a certain threshold. We use simulation to compare the overhead and the performance of the proposed schemes, and to show that the proposed schemes improve the TCP performance compared to Snoop with a limited amount of buffer at the base station.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.20-28
• /
• 2005

TCP(Transmission Control Protocol) is one of the most important Internet protocols, which is widely used in wireless networks as well as wired networks. However, when TCP is deployed for wireless networks, it takes severe performance degradation because TCP was designed for wired network. To overcome this drawback, a number of TCP variants have been proposed in the literature. However, most previous schemes did not consider TCP enhancement over heterogeneous networks. In heterogeneous networks, an mobile node (MN) may move from one access network to another(i.e., vertical handover). In the case of vertical handover, an MN experiences a TCP performance degradation caused by the packet loss and the sudden change of link characteristics between two different access networks. In this work, we investigate the TCP performance degradation occurred in vortical handover across heterogeneous networks. First, we have conducted the measurement study over GPRS-WLAN testbed. In the measurement study. we observed the TCP performance degradation in the case of handover from WLAN to GPRS. In order to study more different TCP behaviors during vertical handover, we performed comprehensive simulations using a network simulator 2(ns-2). Based on measurement and simulation results, we investigated how to improve TCP performance in vertical handover and we concluded that the existing mechanisms cannot be perfect solutions and new mechanisms are strongly required.