• The Journal of Information Technology
• /
• v.5 no.1
• /
• pp.69-77
• /
• 2002

The Bluetooth is expected to be one of the most popular wireless telecommunication technology in the near future, and the protocol stack is essential to providing the various services with the Bluetooth-embedding systems or devices. The Bluetooth specification is an open, global specification defining the complete system, however, the protocol stack is usually implemented partly in hardware and partly as software running on its system, with different implementations partitioning the functionality between hardware and software in different ways. I investigate how to design and implement the Bluetooth protocol stack according to its specification. I focus on the HCI and the lower layer of the software protocol stack as a basic step for the development of our own protocol stack. As a result, paper provides how to partitioning the role of HCI layer, and how to implement the relationship between HCI packets, it's functionality and the flow control. Experiments show the discovering other Bluetooth devices and their connection. Furthermore experiments demonstrate the proper operation of data communication between the Bluetooth modules.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.905-916
• /
• 2004

Self-organizing hierarchical ad hoc network (SOHAN) is a new ad-hoc network architecture designed to improve the scalability properties of conventional 'flat' ad hoc networks. This network architecture consists of three tiers of ad-hoc nodes, i.e.. access points, forwarding nodes and mobile nodes. This paper presents a topology discovery and routing protocol for the self-organization of SOHAN. We propose a cross-layer path metric based on link quality and MAC delay which plays a key role in producing an optimal cluster-based hierarchical topology with high throughput capacity. The topology discovery protocol provides the basis for routing which takes place in layer 2.5 using MAC addresses. The routing protocol is based on AODV with appropriate modifications to take advantage of the hierarchical topology and interact with the discovery protocol. Simulation results are presented which show the improved performance as well as scalability properties of SOHAN in terms of through-put capacity, end-to-end delay, packet delivery ratio and control overhead.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2158-2170
• /
• 1999

It has been required more reliable communication on processes and improvement of system performance as distributed systems using multicast protocol became widespread. In distributed environment maintaining data consistency through asynchronous execution of processes and coordinating the activities of them would occurs. This paper proposes a total ordering algorithm, TORMP, in order to resolve these problems. TORMP takes advantage of multicast protocol and uses an effective token passing method. It reduces a process delaying time before transmitting its message by multicasting a token simultaneously to every process that initiates the request of the message. Moreover, the processes receiving the token start multicasting the message at the same time, which causes to cut down the overall transmission dely. In case that one process sends a message, TORMP hardly uses the procedure of controlling for ordering. It gives fairly the right of sending messages to all processes in a group with utilizing vector clock. In TORMP, unlike other algorithms, the number of packets generated during ordering process does not depend on the number of processes.

• Journal of KIISE:Information Networking
• /
• v.31 no.2
• /
• pp.233-241
• /
• 2004

In this paper, we propose a packet-lossless fast rerouting scheme at a link/node fault in MPLS (Multiprotocol Label Switching) network with minimized accumulated buffer delay problem at ingress node. The proposed scheme uses a predefined, alternative LSP (Label Switched Path) In order to restore user traffic. We propose two restoration approaches. In the first approach, an alternative LSP is initially allocated with more bandwidth than the protected working LSP during the failure recovery phase. After the failure recovery, the excessively allocated bandwidth of the alternative LSP is readjusted to the bandwidth of the working LSP. In the second approach, we reduce the length of protected working LSP by using segment-based restoration. The proposed approaches have merits of (ⅰ) no buffer delay problem after failure recovery at ingress node, and (ⅱ) the smaller required buffer size at the ingress node than the previous approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1011-1019
• /
• 2012

This paper presents a novel hybrid authentication scheme in the next-generation Tactical Mobile Communication Systems(TMCS) with wireless MSAP mesh networks. The existing centralized and distributed authentication methods for security between MSAPs may have their pros and cons. The centralized authentication method induces overhead from frequent MSAP association which leads to long authentication delay. On the other hand, the distributed authentication method requires initial sharing of the authentication information. Therefore, a more efficient authentication scheme is needed to protect the network from malicious MSAPs and also maximize efficiency of the network security. The proposed scheme provides a hybrid method of efficiently managing the authentication keys in the wireless MSAP mesh network to reduce the induced authentication message exchange overhead. Also, as the authentication method between MSAP and TMFT is different, a method of utilizing the ACR for handling the EAP packets is proposed. In overall, the proposed scheme provides efficient mutual authentication between MSAPs especially for tactical environments and is analyzed through performance evaluation to prove its superiority.

• Journal of KIISE
• /
• v.43 no.8
• /
• pp.919-926
• /
• 2016

In a wireless network, TCP causes the performance degradation because of mistaking packet loss, which is caused by characteristics of wireless link and throughput oscillation due to change of devices connected on a limited bandwidth. Delay based TCP is not affected by packet loss because it controls window size by using the RTT. Therefore, it can solve the problem of unnecessary degradation of the rate caused by misunderstanding reason of packet loss. In this paper, we propose an algorithm for improving the remaining problems by using delay based TCP. The proposed scheme can change throughput adaptively by adding the RTT, which rapidly reflects the network conditions to BaseRTT. It changes the weight of RTT and the increases and decreases window size based on the remaining amount of the buffer. The simulation indicated that proposed scheme can alleviate the throughput oscillation problem, as compared to the legacy TCP Vegas.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.12
• /
• pp.2800-2807
• /
• 2012

An ad-hoc wireless network provides self-organizing data networking while they are routing of packets among themselves. Typically multi-hop and control packets overhead affects the change of route of transmission. There are numerous routing protocols have been developed for ad hoc wireless networks as the size of the network scale. Hence the scalable routing protocol would be needed for energy efficient various network routing environment conditions. The number of depth or layer of hierarchical clustering nodes are analyzed the different clustering structure with topology in this paper. To estimate the energy efficient number of cluster layer and energy dissipation are studied based on distributed homogeneous spatial Poisson process with context-awareness nodes condition. The simulation results show that CACHE-R could be conserved the energy of node under the setting the optimal layer given parameters.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4C
• /
• pp.295-307
• /
• 2002

The IEEE 1394 protocol is a de facto standard in multimedia digital home network. It supports several advanced features such as hot plugging, dynamic network reconfiguration, isochronous transmission and so on. Since the IEEE 1394 was adapted in the field of multimedia service with QoS guarantee, back bone network protocol with reel-time digital instrumentation and control sub networks, and physical layer protocol for real-time middleware such as real-time CORBA, the additional real-time features has been required in device driver implementation because of the necessity of the predictability enhancement. To guarantee the real-time features, the device driver of the IEEE 1394 should support the priority based packet processing and also need a isochronous buffer management mechanism to deal with the periodic isochronous communication. In this paper, we proposed a new software architecture of the IEEE 1394 device driver for supporting the real-time characteristics such as priority based packet processing, priority based scheduling and so on.

• Journal of Internet Computing and Services
• /
• v.2 no.4
• /
• pp.41-53
• /
• 2001

Multi-distributed web cluster model built for high availability E-Business model exposes internal system nodes on its structural characteristics and has a potential that normal job performance is impossible due to the intentional prevention and attack by an illegal third party. Therefore, the security system which protects the structured system nodes and can correspond to the outflow of information from illegal users and unfair service requirements effectively is needed. Therefore the suggested distributed invasion detection system is the technology which detects the illegal requirement or resource access of system node distributed on open network through organic control between SC-Agents based on the shared memory of SC-Server. Distributed invasion detection system performs the examination of job requirement packet using Detection Agent primarily for detecting illegal invasion, observes the job process through monitoring agent when job is progressed and then judges the invasion through close cooperative works with other system nodes when there is access or demand of resource not permitted.

• The Journal of the Korea Contents Association
• /
• v.3 no.4
• /
• pp.38-47
• /
• 2003

Distributed problem solving is the cooperative solution of problem by a decentralized and loosely couped collection of knowledge-sources (KS's), located in a number of distinct processor nodes. The contract net protocol has been developed to specify problem-solving communication and control for nodes in a distributed problem solver. Task distribution is affected by a negotiation process, a discussion carried on between nodes with tasks to be executed and nodes that may be able to execute tasks In this paper, we present the coordination method among distributed intrusion detection system and firewall by the contract net protocol. The method enhances the intrusion detection performance and provides the communication methods. To mode IDS and firewall, security models hue been hierarchically constructed based on the DEVS (Discrete Event system Specification) formalism. Each ID agent cooperates through the contract net protocol for detecting intrusions. The IDS which detects the intrusion informs to firewall, so the harmful network traffic is blocked. If an agent detects infusions, the agent transfers attacker's information to a firewall. Using this mechanism attacker's packets detected by In can be prevented from damaging the network.