• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.829-834
• /
• 2004

Nodes communicate through wireless channels under peer-to-peer level in ad-hoc mobile networks. The nodes are free to move around in a geographical area and are loose]y bounded by the transmission range of the wireless channels. Also, a node is completely free to move around, there is no fixed final topology. Hence, to manage the inter-node communication and data exchange among them a leader node is required. In this paper we introduce an efficient leader election algorithm for mobile ad hoc networks where inter-node communication is allowed only among the neighboring nodes. Furthermore we present the result of performance evaluation through simulation. The algorithm is efficient and practical since it uses least amount of wireless resources and does not affect the movement of the nodes.

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

In the self-healing group key distribution scheme, users are capable of recovering lost group keys on their own without requesting additional transmission from the group manager, where there is no reliable network infrastructure. In this paper, we propose a new self-healing group key distribution scheme with revocation capability, which is optimal in terms of user memory storage and more efficient in terms of communication complexity than the previous results. We obtain a slightly improved result from (13) and (14) by using the new broadcasting method. In addition, we prove that our scheme has the properties of t-wise forward secrecy and t-wise backward secrecy, and extend this self-healing approach to the session key recovery scheme from a single broadcast message.

• 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.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.313-324
• /
• 2005

The success of the IEEE 802.11 standard has prompted research into efficiency of the different medium access methods and their support for different traffic types. A modified version of the point coordination function (PCF) called modified PCF has been introduced as a way to improve the efficiency over the standard method. It has been shown through a simulation study and a mathematical analysis that channel utilization can be much improved compared to the standard, in case there is no so-called hidden station problem. However, under the hidden station problem, the efficiency of the modified PCF would obviously decrease. In this paper, some enhancements of the modified PCF are introduced. Firstly, we propose a retransmission process to allow frames involved in collisions to be retransmitted. Then, we propose a collision resolution mechanism to reduce the frame collision probability due to the hidden station problem. In addition, we propose a priority scheme to support prioritization for different traffic types such as interactive voice and video, and real-time data traffic in the modified PCF. To prevent the starvation of one low priority traffic, minimum transmission period is also guaranteed to each traffic type via an admission control algorithm. We study the performance of the modified PCF under the hidden station problem and the performance of the modified PCF with priority scheme through simulations. To illustrate the efficiency of the priority scheme, we therefore compare its simulation results with those of some standardized protocols: The distributed coordination function (DCF), the enhanced distributed channel access (EDCA), the PCF, and our previously proposed protocol: The modified PCF without priority scheme. The simulation results show that the increment of delay in the network due to the hidden station problem can be reduced using the proposed collision resolution mechanism. In addition, in a given scenario the modified PCF with priority scheme can provide better quality of service (QoS) support to different traffic types and also support a higher number of data stations than the previous proposals.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6B
• /
• pp.517-526
• /
• 2006

In order to achieve high capacity and reliable link quality in wireless communication, the significant efforts should be concentrated on mitigating interference between cells. To solve the interference problem, the newly introduced concept of a Distributed Wireless Communication System (DWCS) can provide the capability of joint control of the signals at multiple cells. This paper proposes a new concept of virtual cell: the Dual Virtual Cell (DVC), and also proposes DVC employment strategy based on DWCS network. The proposed system manages two kinds of virtual cell. One is the Active Virtual Cell which exists for user's actual data traffic and the other is the Candidate Virtual Cell which contains a set of candidate antennas to protect user's link quality from performance degradation or interruption. The proposed system constructs DVC by using antenna selection method. Also, for multi-user high-rate data transmission, the proposed system introduces multiple antenna technology to get a spatial and temporal diversity gam and exploits space-Time Trellis Codes known as STTC to increase a spectral efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1483-1490
• /
• 2009

Orthogonal frequency division multiplexing (OFDM) has been investigated as an enabling technology for future wireless communications such as ad hoc, mesh and sensor networks. However, prior works on bit-loading lack consideration of the constraints on energy and computing facility in sensor networks. In this paper, we suggest an adaptive bit allocation algorithm for a frequency selective fading channel environment which exploits channel state information obtained through a feedback channel. The proposed algorithm significantly reduces computational complexity and satisfies the power budget. Also, its throughput is comparable to the optimum solution. Simulation results support the claim stated.

• Journal of Families and Better Life
• /
• v.31 no.5
• /
• pp.47-63
• /
• 2013

This study deals with a counseling case in which a mother requested counseling due to the problems of her daughter, who suffers from multiple tic disorder. The participants of this study included five family members (grandmother, father, mother and two female children) and a total of 23 sessions were held from September 2006 to December 2007. Additional counseling ($24^{th}$ counseling session) was conducted on April 1st, 2009. The data was based on recorded transcripts and notes from 24 family therapy sessions. The study used a constant comparative analysis, which uses matrix and network display as an analysis method suggested by Miles&Huberman(1994). The characteristics of the family of origin and the indifference of the husband had caused the wife stress. The couple had frequent conflicts due to dysfunctional communication methods, a clash of values, sexual dissatisfaction, and a lack of communication. This marital conflict became the primary factor of the daughter's multiple tic disorder. Intervention of the family therapist resulted in the setting of treatment goals based on MRI's communication theory and Bowen's family systems theory in order to solve the problem of the daughter's multiple tic disorder. Also, the therapist's intervention techniques included exploring experiences with the family of origin, shedding light on the multigenerational transmission process, exploring dysfunctional attempts at solutions, the therapist's self-disclosure, providing similar cases, dealing with resistance, and suggesting a new communication method. To solve the problem, the therapist helped the family separate the daughter spatially from her parents. Therefore, the therapist's intervention helped reduce the daughter's tics and improve relationships among the family.

• Convergence Security Journal
• /
• v.12 no.6
• /
• pp.69-75
• /
• 2012

MANET(Mobile Ad-hoc Network) is target of many attacks because of dynamic topology and hop-by-hop data transmission method. In MANET, location setting of intrusion detection system is difficult and attack detection using information collected locally is more difficult. The amount of traffic grow, intrusion detection performance will be decreased. In this paper, MANET is composed of zone form and we used random projection technique which reduces dimension without loss of information in order to perform stable intrusion detection in even massive traffic. Global detection node is used to detect attacks which are difficult to detect using only local information. In the global detection node, attack detection is performed using received information from IDS agent and pattern of nodes. k-NN and ZBIDS were experimented to evaluate performance of the proposed technique in this paper. The superiority of performance was confirmed through the experience.

• Korean Journal of Construction Engineering and Management
• /
• v.12 no.6
• /
• pp.22-30
• /
• 2011

In the construction operation, foundation work should be done in advance for the building structure to be installed. This foundation work include a number of activities such as excavation, ground water prevention, piling, wale installation, etc. Caution should be taken in the operation because the dynamics of earth movement can cause a significant failure in the temporary structure. The temporary structure, therefore, should be constantly monitored to understand its behavior. This paper introduces the USN-based monitoring system to automatically identify the behavior of the temporary structure in addition to visual inspection. The autonomous capability of the monitoring system can increase the safety in the construction operation by providing the detailed structural changes of temporary structures.

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

A number of routing algorithms have been studied for wireless mobile ad-hoc network. Among them, the AODV routing algorithm with on-demand method periodically transmits hello message and monitors link state during data transmission in order to maintain routing paths. When a path is disconnected, a node that senses it transmits a RERR packet to the transmitting node or transmits a RREQ locally so that the path could be repaired. With that, the control packet such as a RREQ is broadcast, which causes the consumption of bandwidth and incurs data latency. This paper proposes a LRRLBP algorithm that locally repairs a path by predicting link state before disconnecting the path based on the AODV routing protocol for solving such problems. Intensive simulations with the results using NS-2 simulator are shown for verifying the proposed protocol.