• Journal of Digital Contents Society
• /
• v.15 no.6
• /
• pp.663-673
• /
• 2014

The WBAN technology means a short distance wireless network which provides each device interactive communication by connecting devices inside and outside of body. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. Wireless body area network is usually configured in energy efficient using sensor and zigbee device due to the power limitation and the characteristics of human body. Wireless sensor network consist of sensor field and sink node. Sensor field are composed a lot of sensor node and sink node collect sensing data. Wireless sensor network has capacity of the self constitution by protocol where placed in large area without fixed position. In this paper, we proposed the efficient addressing scheme for improving the performance of routing algorithm by using ZigBee in WBAN environment. A distributed address allocation scheme used an existing algorithm that has wasted in address space. Therefore proposing x, y and z coordinate axes from divided address space of 16 bit to solve this problems. Each node was reduced not only bitwise but also multi hop using the coordinate axes while routing than Cskip algorithm. I compared the performance between the standard and the proposed mechanism through the numerical analysis. Simulation verified performance about decrease averaging multi hop count that compare proposing algorithm and another. The numerical analysis results show that proposed algorithm reduced the multi hop better than ZigBee distributed address assignment

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.10 s.352
• /
• pp.35-45
• /
• 2006

Coordinator is defining so that function as most trust center that is point in security in ZigBee Alliance. Because must do height connection with coordinator in device signing to PAN newly, coordinator has shortcoming that subordinate is revealed to danger directly to Centered and cattish device. When do height connection some device, do not become problem, but if network is huge, coordinator's subordinate shall increase as traffic quantity which happen in coordinator increases. Also, in ZigBee security to link network kina of transmission and mutually certification in ZigBee Alliance standard include, but I do not provide method to deliver master key in each node safely. Because process that transmit master key passes through channel that do not secure, master key has shortcoming that is revealed directly. In this paper, I suggested Parent-Child key establishment algorithm to solve these problem. Proposed algorithm consists of two structures. Master key establishment algorithm and device that sign to PAN newly that can use one-way Hash chain and transmit master key safety are consisted of Parent-Child network key establishment algorithm that do child node and parent node key establishment as can do key establishment efficiently. Method that device proposes in case method that propose in case have master key establishment time was shown better performance $200{\sim}1300ms$ than existing method, and device does not have master key than existing method height connect time about $400{\sim}500ms$ better performance see.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.14 no.3
• /
• pp.11-21
• /
• 2011

This study intends to construct scenic byway database and to examine and suggest social experiment of scenic byway. As basis work for the experiment of the scenic byway, we build database by using ITS standard node link management system. The DB includes scenic byway routes of Korea and Japan. The analyses show that the scenic byway in both nations consists of roads, reservation, road sign, vehicle number plate, and it was found that infrastructure and system are inadequate for scenic byway. These experiment can be effectively used for scenic byway in Korea and Japan as the basis data. The results of this experiment will be useful for plan and develop a scenic byway.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.344-357
• /
• 2015

With the increase in a number of access technologies and data rates, a continuous connection among different networks is demand of the future wireless networks. In the last decade, user connectivity among different access networks remained a challenging job. Therefore, in this article, we proposed a user-centric and user-perspective based network selection mechanism for fast handover management in heterogeneous wireless networks. The proposed scheme selects the most appropriate network among available networks on the basis of resources i.e. cost, data rate, and link quality. Initially, we load the Media Independent Information Service (MIIS) with the information of cost and data rate provided by different network operators. Similarly, Mobile Node (MN) is also loaded with the user preferred cost and data rate for different applications. The MN obtains the information of cost and data rate from MIIS server upon a predefined threshold, and make a decision for handover according to its current cost and data rate. Furthermore, we employ an optimal threshold mechanism for initiation of the handover execution phase to minimize false handover indications. The proposed scheme is based on a survey for network selection and its implementation in C programming language to validate its performance and accuracy. The simulation result shows that the proposed scheme performs superior then the schemes present in the current literature.

• Journal of Digital Convergence
• /
• v.14 no.2
• /
• pp.209-216
• /
• 2016

In these days, considering the trend to make various information blended based on spatial information like road, buildings and geography, it is to be very important to visualize maps for showing the information efficiently. However, geometry which is composed with line, polygon commonly used on web service has limitation to express information by limit of usage as well as spending certain time to show the information via map. That's why this study develops the efficient way to visualize huge and complex spatial information. This way is to bring partial space with spatial query, and then query and expand information excluded the former area after detecting movement event based on client. When the way is implemented, it will be expected to make efficient visualization in entire system by not bringing unnecessary information but shortening spending time to show area because it just shows areas which clients want to see.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12B
• /
• pp.1647-1658
• /
• 2011

This paper suggests the methods to improve the wireless backhaul link of the Relay FDD mode that 3GPP LTE-Advanced supports. New RRC message and Relay startsup procedure are introduced to apply Carrier Aggregation in the Relay wireless backhaul. Also, we design new reference signal that makes Type 1 Relay operated in full-duplexing, expecting to maximize the radio resource utilization. And, we propose the efficient configuration for the periodic uplink control information under the backhaul subframe allocation method in LTE-Advanced Relay. Hereafter, the standard activities in the 3GPP RAN is supposed to focus on the improvement of the LTE-Advanced features. Therefore, the suggestions in this paper are expected to be actively discussed in the LTE-Advanced future releases.

• The Journal of Society for e-Business Studies
• /
• v.4 no.1
• /
• pp.87-101
• /
• 1999

To operate the automatic devices of manufacturing process more effectively and to solve the needs of the resource sharing, network technology is applied to the control devices located in common manufacturing zone and operated by connecting them. In this paper, functional standard of the network layers are set as physical and data link layer of IEEE 802.2, 802.4, and VMD application layer and ISO-CIM reference model. Then, they are divided as minimized architecture, designed as group objects which perform group management and service objects which organizes and operates the group. For the stability in this network, this paper measures the variation of data packet length and node number and analyzes the variated value of the waiting time for the network operation. For the method of the analysis, non-exhausted service method are selected, and the arrival rates of the each data packet to the nodes that are assumed to form a Poission distribution. Then, queue model is set as M/G/1, and the analysis equation for waiting time is found. For the evalution of the performance, the length of the data packet varies from 10 bytes to 100 bytes in the operation of the group management network, the variation of the wating time is less than 10 msec. Since the waiting time in this case is less than 10 msec, response time is fast enough. Furthermore, to evaluate the real time processing of the group management network, it shows if the number of nodes is less than 40, and the average arrival time is less than 40 packet/sec, it can perform stable operation even taking the overhead such as software delay time, indicated packet service, and transmissin safety margin.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.5
• /
• pp.34-48
• /
• 2019

The purpose of this study was two-fold; first, to develop safety performance functions (SPF) using transportation-related big data for all types of roads in Korea were developed, Second, to provide basic information to develop measures for relatively dangerous roads by evaluating the safety grade for various roads based on it. The coordinates of traffic accident data are used to match roads across the country based on the national standard node and link system. As independent variables, this study effort uses link length, the number of traffic volume data from ViewT established by the Korea Transport Research Institute, and the number of dangerous driving behaviors based on the digital tachograph system installed on commercial vehicles. Based on the methodology and result of analysis used in this study, it is expected that the transportation safety improvement projects can be properly selected, and the effects can be clearly monitored and quantified.

• Journal of KIISE
• /
• v.43 no.11
• /
• pp.1233-1244
• /
• 2016

In the IoT network environments for LLNs(Low power and Lossy networks), IPv6 Routing Protocol for Low Power and Lossy networks(RPL) has been proposed by IETF(Internet Engineering Task Force). The goal of RPL is to create a directed acyclic graph, without loops. As recommended by the IETF standard, RPL route recovery mechanisms in the event of a failure of a node should avoid loop, loop detection, DIO Poisoning. In this process, route recovery time and control message might be increased in the sub-tree because of the repeated route search. In this paper, we suggested RPL route recovery method to solve the routing overhead problem in the sub-tree during a loss of a link in the RPL routing protocol based on IoT wireless networks. The proposed method improved local repair process by utilizing a route that could not be selected as the preferred existing parents. This reduced the traffic control packet, especially in the disconnected node's sub tree. It also resulted in a quick recovery. Our simulation results showed that the proposed RPL local repair reduced the recovery time and the traffic of control packets of RPL. According to our experiment results, the proposed method improved the recovery performance of RPL.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12B
• /
• pp.1050-1057
• /
• 2008

Wireless Mesh Networks (WMNs) have recently become a hot issue to support high link capacity in wireless access networks. The IEEE 802. I 1 standard which is mainly used for the network interface technology in WMNs supports up to 3 or 12 multiple channels according to the IEEE 802.11 specification. However, two important problems must be addressed when we design a channel assigmnent algorithm: channel dependency problem and channel scanning delay. The former occurs when the dynamic channel switching of an interface leads to the channel switching of other interfaces to maintain node connectivity. The latter happens per channel switching of the interface, and affects the network performance. Therefore, in this paper, we propose the Distance-Based Channel Assigmnent (DB-CA) scheme for multi-channel WMNs to solve such problems. In DB-CA, nodes just perform channel switching without channel scanning to communicate with neighboring nodes that operate on different channels. Furthermore, DB-CA minimizes the interference of channels being used by nodes near the gateway in WMNs. Our simulation results show that DB-CA achieves improved performance in WMNs.