• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.8
• /
• pp.23-32
• /
• 2007

We propose a group-based security scheme for hierarchical wireless sensor networks. We model the network for secure routing with 3-tier sensor network comprised of three types of nodes: Base Station, Group Dominator and ordinary Sensor Nodes. Group-based deployment is performed using Gaussian (normal) distribution and show that more than 85% network connectivity can be achieved with the proposed model. The small groups with pre-shared secrets form the secure groups where group dominators form the backbone of the entire network. The scheme is devised for dealing with sensory data aggregated by groups of collocated sensors; i.e., local sensed data are collected by the dominating nodes and sent an aggregated packet to the base station via other group dominators. The scheme is shown to be light-weight, and it offers a stronger defense against node capture attacks. Analysis and simulation results are presented to defend our proposal. Analysis shows that robustness can significantly be improved by increasing the deployment density using both the dominating and/or ordinary sensor nodes.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.187-198
• /
• 2005

In this paper, we propose the enhanced header compression scheme for the efficient data traffic transmission in Ipv6 networks. The bandwidth of wireless links and IP networks will probably be limited due to properties of the physical medium and regulatory limits on the use of frequencies for radio communications. That is major cause of user throughput reduction. Therefore, We discuss the IPHC(RFC2507) and ROHC(RFC3095) scheme. IPHC is simple header compression scheme and ROHC is enhanced header compression that have fast optimal recovery scheme. We have studied the enhanced header compression scheme in ROHC. We will show that indication of compression context values preventing from packet losses can provide the fast recovery of compression state. Computer simulations show that the proposed scheme has better performance than the previous one.

• Convergence Security Journal
• /
• v.7 no.1
• /
• pp.77-82
• /
• 2007

Supporting Quality of Service (QoS) for multimedia services in heterogeneous mobile networks is a part of key issue for Beyond Three Generation (B3G) development. In particular, if QoS degradation are occurred because cell overload and error late patterns of wireless links during the transmission of multimedia data, the efficient QoS management is necessary to maintain the same QoS of transmitted multimedia data because the QoS may be defected by some delay and information loss. This paper deals with QoS Degradation reason Intra-System Handover (D-ISHO) for handling QoS of multimedia services over heterogeneous mobile networks. For this aim, the function modules for supporting QoS of D-ISHO are proposed. The sequence diagram showing interaction between the modules is described and then a scenario for D-ISHO is considered. Simulation is focused on the average delay and packet loss rate. The proposed heterogeneous mobile system using the QoS-Guaranteed Resource Management (QGRM) provides a better performance than each different access system.

• Journal of Korea Game Society
• /
• v.9 no.5
• /
• pp.53-61
• /
• 2009

Game industry, especially MMORPG (Massively Multiplayer Online Role Playing Game) has rapidly been expanding in these days. In this background, lots of online game security incidents have been increasing and getting more diversity. One of the most critical security incidents is 'Bots', mimics human player's playing behaviors. Bots performs the task without any manual works, it is considered unfair with other players. So most game companies try to block Bots by analyzing the packets between clients and servers. However this method can be easily attacked, because the packets are changeable when it is send to server. In this paper, we propose a Bots detection method by observing the playing patterns of game characters with data on server. In this method, Bots developers cannot handle the data, because it is working on server. Therefore Bots cannot avoid it and we can find Bots users more completely.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.9
• /
• pp.1654-1662
• /
• 2006

An ad hoc network is multi-hop network composed of radio links. and the transmission quality of a radio link is more unstable than that of a wired circuit. Packet loss thus occurs frequently in an ad hoc network, and the consequent connection failure results in a severe deterioration of TCP performance. TCP performance also deteriorates because of the collision of data packets and ACK packets in the radio channel. In this paper we study to improve the performance of the Mobile Ad-hoc network by using Delayed ACK algorithm with our proposed ODA(Ordering-Delayed ACK) method. The proposed ODA algorithm increases the number of the data packets orderly at the receiver side which is going to be applied for the Mobile Ad-hoc network. We accomplished a computer simulation using NS-2. From the simulation results, we find the proposed ODA algorithm obviously enlarge the channel capacity and improve the network performance at the situation of multi-hop of ad-hoc network than the existing Delayed ACK algorithm.

• The KIPS Transactions:PartC
• /
• v.12C no.7 s.103
• /
• pp.1039-1046
• /
• 2005

TCP SACK is the unique mechanism to reflect the situation of sink's sequence space, some TCP variants and proposals can perform in conjunction with SACK mechanism for achieving optimal performance. By definition of RFC 2018, however, each contiguous block of data queued at the data receiver is defined in the SACK option by two 32-bit unsigned integers in network byte order. Since TCP Options field has a 40-byte maximum length, when error bursts now, we note that the available option space may not be sufficient to report all blocks present in the receiver's queue and lead to unnecessarily force the TCP sender to retransmit Packets that have actually been received by TCP sink. For overcoming this restriction, in this thesis, a new solution named 'one-byte offset based SACK mechanism' is designed to further improve the performance or TCP SACK and prevent those unwanted retransmissions. The results or both theory analysis and simulation also show that his proposed scheme operates simply and more effectively than the other existing schemes by means of the least bytes and most robust mechanism to the high packet error rates often seen in networks environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9B
• /
• pp.591-595
• /
• 2005

In this paper, we propose the fairness improvement leaky bucket (PILB) algorithm as a traffic policing mechanism. In the proposed algorithm, there is a cell buffer for every ATM connection in order to store date cells. Network decides whether an ATM connection obeys the contracted traffic parameter, and stores data cells in the cell buffer if the connection obeys but is considered as violated the contract due to temporary lack of network resource. By using the proposed algorithm, we can obtain the statistical multiplexing gain that is the superiority of packet switching network. Moreover, when a connection tries to transmit more data cells by violating the contracted traffic parameters, the connection is prevented from using excess network resource, which incurs all connections sharing network resource fairly. The performance of the proposed FILB algorithm is investigated by using the simulation. The result shows that the proposed algorithm provides superior performance and all connections within a group share network resource fairly. The proposed algorithm can be applied not only the ATM network but also IP network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3B
• /
• pp.255-263
• /
• 2009

In this paper, we propose an adaptive beacon scheduling algorithm to control a reception period of actual data according to variation of amount of traffic in IEEE 802.15.4 LR-WPAN(Low Rate-Wireless Personal Area Network) with the cluster-tree topology. If a beacon interval is shortened, the amount of the traffic a node receives can be increased while consumption of the energy can be also increased. In this sense, we can achieve optimal on orgy consumption by controlling the beacon interval when the amount of data to be received is being decreased. The result of simulation using NS-2 shows that the proposed algorithm improves performances in terms of packet loss rate and end-to-end delay compared with algorithm using a fixed beacon interval. For a design of cluster-tree based LR-WPAN managing delay-sensitive services, the proposed algorithm and the associated results can be applied usefully.

• Convergence Security Journal
• /
• v.14 no.7
• /
• pp.29-36
• /
• 2014

In this study, we design and develop a VLC test-bed system which has been recently issued and focused as good convergence technology in the world. We classify the developed system into transmission part including analog LED driver module, digital signal modulation module, and receiver part with light sensing module and signal demodulation module. Then we introduce important characteristics and components. We analyze some factors for each module. To validate the communication of the designed VLC system, we develop a VLC sender-receiver simulator which can control the dimming factor and flicker-free effect. From the developed system, we observed about 12Mbps of data transmission rate with 0.5m~1m of distance, without packet loss. We verified the real-time communication with multimedia streaming which can be considered as very high date rate. The developed system and technology will be useful for some converged data services like indoor positing, home appliances, and indoor parking system.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.8 s.350
• /
• pp.84-90
• /
• 2006

With the widespread of the wireless Internet and wireless LAN, different wireless technologies such as 3G cellular networks and WLAN will cooperate to support more users and applications with higher data rate over wider areas. When a mobile node moves around in the hybrid networks, it needs to perform seamless vertical handoffs between different wireless networks to provide high performance data transmission. When an application with TCP connection in a mobile node performs a vertical handoff, TCP performance is degraded due to packet losses even though it maintains the previous TCP state information during handoff, because 3G and WLAN have different available bandwidth. In this paper, we propose a new congestion control algorithm for vertical handoff to improve the TCP performance by measuring the rough end-to-end available bandwidth and calculating the slow-start threshold. By ns-2 simulation, we show that the proposed algorithm enhances the TCP performance during vertical handoffs compared to the previous algorithms.