• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1624-1641
• /
• 2015

Instantaneous relay (relay-without-delay) using interference alignment is a promising approach to neutralizing interference and improving system capacity. In Wang Chenwei's work, a 2-user scenario required both source and relay to access the global channel state information (CSI). This paper shows a new method of interference alignment improves the degrees of freedom (DoF) prominently for the 3-user MIMO interference channel with instantaneous relay. This new method is focused on the relay node that completes the alignment interference neutralization so the global CSI is obtained only once and the pressure on the base station can be mitigated. In addition, the 3-user MIMO interference channels with instantaneous relay can achieve 2M DoF when source and destination have M antennas, respectively. This method shows 33% improvement over the conventional method using interference alignment which obtains 3M/2 DoF.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.608-627
• /
• 2016

Wireless mesh networks (WMNs) based on IEEE 802.11s have emerged as one of the prominent technologies in multi-hop communications. However, the deployment of WMNs suffers from serious interference problem which severely limits the system capacity. Using multiple radios for each mesh router over multiple channels, the interference can be reduced and improve system capacity. Nevertheless, interference cannot be completely eliminated due to the limited number of available channels. An effective approach to mitigate interference is to apply dynamic channel switching (DCS) in WMNs. Conventional DCS schemes trigger channel switching if interference is detected or exceeds a predefined threshold which might cause unnecessary channel switching and long protocol overheads. In this paper, a P-learning based dynamic switching algorithm known as learning automaton (LA)-based DCS algorithm is proposed. Initially, an optimal channel for communicating node pairs is determined through the learning process. Then, a novel switching metric is introduced in our LA-based DCS algorithm to avoid unnecessary initialization of channel switching. Hence, the proposed LA-based DCS algorithm enables each pair of communicating mesh nodes to communicate over the least loaded channels and consequently improve network performance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.154-155
• /
• 2013

This paper presents a user authentication scheme for healthcare application using wireless sensor networks, where wireless sensors are used for patients monitoring. These medical sensors' sense the patient body data and transmit it to the professionals. Since, the data of an individual are highly vulnerable; it must ensures that patients medical vital signs are secure, and are not exposed to an unauthorized person. In this regards, we propose a user authentication scheme for healthcare application using medical sensor networks. The proposed scheme includes: a novel two-factor user authentication, where the healthcare professionals are authenticated before access the patient's body data; a secure session key is establish between the patient sensor node and the professional at the end of user authentication. Furthermore, the analysis shows that the proposed scheme is safeguard to various practical attacks and achieves efficiency at low computation cost.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.3
• /
• pp.82-89
• /
• 2006

Optical transmission system related to network infra of ubiquitous is a essential bridge technique between metro network and access point. So, it is need to develop this technique. In this paper, we develop 1Gbps SNMP optical transmitter/receiver system based on 1 core ring-type WDM PON. The developed system can reduce number of optic fiber and doesn't need extra transmitter/receiver. Also, this system can extend nodes owing to many node per wavelength, acts rapidly against security cutting, and acts independent of protocols.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.3
• /
• pp.485-498
• /
• 1996

For a tree T rooted at a concentrator location in a telecommunication system, we assume that the capacity H for the concentrator is given and a profit $c_v$, and a demand $d_v$, on each node $\upsilon$ of T are also given. Then, the capacitated subtree of a tree problem (CSTP) is to find a subtree of T rooted at the concentrator location so as to maximize the total profit, the sum of profits over the subtree, under the constraint satisfying that the sum of demands over the subtree does not exceed H. In this paper, we develop a pseudopolynomial-time algorithm for CSTP, the depth-first dynamic programming algorithm. We show that a CSTP can be solved by our algorithm in $\theta$ (nH) time, where n is the number of nodes in T. Our algorithm has its own advantage and outstanding computational performance incomparable with other approaches such as CPLEX, a general integer programming solver, when it is incorporated to solve a Local Access Telecommunication Network design problem. We report the computational results for the depth-first dynamic programming algorithm and also compare them with those for CPLEX. The comparison shows that our algorithm is competitive with CPLEX for most cases.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.580-581
• /
• 2018

In order to reduce end-to-end delay in EH-WSN (energy harvestin wireless sensor netowk), medium access control protocols using multi-hop routing technique have been studied. In a real environment, there are many situations where it is difficult to harvest enough energy than the energy consumed. Therefore, it is required to design a MAC protocol that allows nodes to reliably relay data without exhausting power in multi-hop transmission. In this paper, we propose a power-efficient MAC protocol that can select the relay node according to the residual power and the energy collection rate to increase network lifetime.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.6
• /
• pp.1487-1492
• /
• 2012

Providing node mobility on IP-based wireless networks is required by the increasing Internet access of the mobile nodes and Mobile-IPv6 was suggested for IPv6. But Mobile-IPv6 degrades the overall performance of wireless networks by the packet loss while performing its handover function. Therefore, lots of efforts and researches to resolve this problem have been doing from now on. FMIPv6 is one of the improved methods that was designed to provide seemless handover. But it still has a problem that the handover is strictly depended on the triggered information of the unreliable link layer. In this paper, a scheme called mptFMIPv6 that minimizes delay of critical section of CoA registration process by reducing the link layer dependency was proposed.

• KSCI Review
• /
• v.1 no.2
• /
• pp.73-94
• /
• 1995

In this paper, design of efficient NDB(Network Data Base) for the activation plan of chain information network. The DB structure build up, logical structure, store structure, physical structure, the data express for one's record, and the express using linked in the releation of data. Also express as hierarchical model on the DSD(Data Structure Diagram) from the database with logical structure. Each node has express on record type, the linked in course of connective this type, the infuence have efficent of access or search of data, in the design for connection mutually a device of physical, design for database, and construction a form of store for logical. Also activation of chain information network of efficent, using POS(Point Of Sale) system in OSI(Open Systems Interconnection) environment for network standardization, and build up network a design for system.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.5 no.1
• /
• pp.29-38
• /
• 2010

It is highly requested that the more complicated embedded software is used for high performance and multiple functions of the systems. This is inevitably increasing the errors. Therefore the embedded software testing is getting important recently. There are not general testing methods which are able to be applied for any embedded systems, but via this research, we introduce a testing method which is based on TTCN-3, a testing standard, for embedded systems. A testing environment for network-based embedded software is implemented with considering the features of TTCN-3 testing which is based on message exchange. The testing environment has two additional parts with TTCN-3 test system, the network analyzer to access the network-based systems and the communication interface which is suggested for embedded systems in previous work, and we have implemented the whole testing environment with interacting these two parts. In addition to the normal testing domain, called single node testing as a unit testing of V-model, we suggest another concept to test multiple nodes in network. It could be achieved by adding keywords such as supervisor and object which are describing the feature of TTCN-3 testing component and generating the TTCN-3 Executable code which contains new keywords. The testing has done for embedded software which is based on CAN network and the demonstration of the testing environment has been shown in this paper.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.87-101
• /
• 2013

In industrial applications, sensor networks have to satisfy specified time requirements of exchanged messages. IEEE 802.15.4 defines the communication protocol of the physical and medium access control layers for wireless sensor networks, which support real-time transmission through guaranteed time slots (GTSs). In order to improve the performance of IEEE 802.15.4 in industrial applications, this paper proposes a new traffic scheduling algorithm for GTS. This algorithm concentrates on time-critical industrial periodic messages and determines the values of network and node parameters for GTS. It guarantees real-time requirements of periodic messages for industrial automation systems up to the order of tens to hundreds of milliseconds depending on the traffic condition of the network system. A series of simulation results are obtained to examine the validity of the scheduling algorithm proposed in this study. The simulation results show that this scheduling algorithm not only guarantees real-time requirements for periodic message but also improves the scalability, bandwidth utilization, and energy efficiency of the network with a slight modification of the existing IEEE 802.15.4 protocol.