• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2201-2206
• /
• 2008

This paper presents a method of constructing the Linear Digital Switching Function(LDSF) over finite fields. The proposed method is as following. First of all, we extract the input/output relationship of linear characteristics for the given digital switching functions, Next, we convert the input/output relationship to Directed Cyclic Graph(DCG) using basic gates adder and coefficient multiplier that are defined by mathematical properties in finite fields. Also, we propose the new factorization method for matrix characteristics equation that represent the relationship of the input/output characteristics. The proposed method have properties of generalization and regularity. Also, the proposed method is possible to any prime number multiplication expression.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.217-220
• /
• 2014

Wireless sensor network（WSN） consists by a large number of low-cost micro-sensor nodes, collaborate to achieve the perception of information collection, processing and transmission tasks in deployment area. It can be widely used in national defense, intelligent transportation, medical care, environmental monitoring, precision agriculture, and industrial automation and many other areas. One of the key technologies of sensor networks is the data maintenance management technology. In this paper we analyze the data management technology of wireless sensor network and pointed their problems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.499-505
• /
• 2016

In this Paper, we propose a body-area localization technique based on WUSB (Wireless USB) over WBAN (Wireless Body Area Networks) protocol required for wearable computer systems. The proposed localization algorithm is executed on the basis of WUSB over WBAN protocol at each sensor node comprising peripherals of a wearable computer system. To increase the accuracy of input information through various body motions in wearable computer systems, a new localization technique with high precision must be developed. To achieve the goal, This paper proposes a combined TDoA/FDoA/AoA (Time Of Arrival/Time Difference Of Arrival/Angle Of Arrival) localization technique with more than four WUSB over WBAN devices to estimate body-area location accurately. The combined TDoA/FDoA/AoA technique reduces 10mm in location estimation errors comparing with a combined TDoA/FDoA technique. This performance enhancement in location error reduction can be ignored at other systems but is meaningful results in body-area localization-based communications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12A
• /
• pp.1113-1121
• /
• 2010

The Vehicle Safety Communications (VSC) is one of VANET applications for preventing vehicle accidents, and it utilizes vehicle-to-vehicle communication to exchange emergency messages. To propagate such messages in VSC, several schemes based on selective flooding have been proposed. Their common idea is that an emergency message is relayed by one of vehicles receiving the message. However, the schemes do not consider the transmission errors and duplications of an emergency event. In the schemes, if there are transmission errors and a vehicle detects a hazard, there may be vehicles which fail to receive an emergency message. If k vehicles detect a hazard, k emergency messages are created and propagated. The duplications of an event increase reliability of the message delivery but decrease efficiency. In this paper, we propose an emergency message delivery scheme which is efficient and robust to transmission errors. Our proposed scheme utilizes clustering for massage aggregation and retransmissions in a cluster. It also uses an acknowledgment mechanism for reliable inter-cluster communication. Our simulation results show that the proposed scheme outperforms Least Common Neighbor Flooding which is one of the selective flooding schemes.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.426-436
• /
• 2000

Given a linear arrangement of n base stations which generate multiple types of traffic among themselves, we consider the problem of finding a set of disjoint clusters to cover n base statons so that a cluster is assigned a location server. Our goal is to minimize the total communication cost for the entire network where the cost of intra-cluster communication is usually lower than that of intercluster communication for each type of traffic. The optimization problem is transformed into an equivavalent problem using the concept of relative cost, which generates the difference of communication costs between intracluster and intercluster communications. Using the relative cost matrix, an efficient algorithm of O($mm^2$), where m is the number of clusters in a partition, is designed by dynamic programming. The algorithm also finds all thevalid partitions in the same polynomial time, given the size constraint on a cluster, and the total allowable communication cost for the entire network.

• The Journal of the Convergence on Culture Technology
• /
• v.9 no.3
• /
• pp.677-682
• /
• 2023

A large number of motors and sensors are used to drive a humanoid robot. In order to solve the wiring problem that occurs when connecting multiple actuators, a controller based on a communication network has been used, and CAN, which is advantageous in terms of cost and a highly reliable communication protocol, was mainly used. In terms of the structure of the controller, a torque control type structure that is easy to implement an advanced algorithm into the upper controller is preferred. In this case, the low communication bandwidth of CAN becomes a problem, and in order to obtain sufficient communication bandwidth, a communication network is configured by separating into a plurality of CAN networks. In this study, a stability analysis on transmission time delay is performed for a multi-motor control system in which high-speed FlexRay and low-speed CAN communication networks are hierarchically connected in order to obtain a high communication bandwidth, and sensor information and driving signals are delivered within the allowed transmission time. The proposed hierarchical network-based control system is expected to improve control performance because it can implement multiple motor control systems with a single network.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.6
• /
• pp.88-96
• /
• 2011

Underwater acoustic communication is applicable in various areas, such as ocean data collection, undersea exploration and development, tactical surveillance, etc. Thus, robot control system construction used for underwater-robot like AUV or ROV is essential in these areas. In this paper, we propose the Message Merging MAC($M^2$-MAC) protocol, which is suitable for real time robot control system, considering energy efficiency in important parts of underwater acoustic sensor network constitution. In this proposed MAC protocol, gateway node receives the data from robot nodes according to the time slots that were allotted previously. And messages delivered from base-station are generated to one MAC frame by buffering process. Finally, generated MAC frames are broadcasted to all robot nodes in the cluster. Our suggested MAC protocol can also be hybrid MAC protocol, which is successful blend of contention based and contention-free based protocol through relevant procedure with Maintenance&Sleep (M&S) period, when new nodes join and leave as an orphan. We propose mathematical analysis model concerned about End-to-End delay and energy consumption, which is important factor in constructing real-time robot control system. We also verify the excellence of performance according to comparison of existing MAC protocols with our scheme.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.131-140
• /
• 2012

The shortest path search algorithm of navigation is generally based on Dijkstra algorithm and considers only the distance using the weight. Dijkstra algorithm based on the distance mainly ought to perform the 'number of nodes 1' and requires a lot of memory, for it is to start from the starting node and to decide the shortest path for all the nodes. Also, it searches only the same identical path in case of any bottleneck due to an accident nearby, since it is based only on the distance, and hence does not have a system that searches the detour road. In order to solve this problem, this paper considers only the travelling time per road (travelling speed * distance), without applying speed criteria (smoothness, slow speed, stagnation and accident control) or road class (express road, national road and provincial road). This provides an advantage of searching the detour, considering the reality that there are differences in time take for the car to travel on different roads with same distance, due to any accident, stagnation, or repair construction. The suggested algorithm proves that it can help us to reach the destination within the shortest time, making a detour from any congested road (outbreak) on providing an information on traveling time continuously(real-time) even though there is an accident in a particular road.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6A
• /
• pp.506-514
• /
• 2009

To minimize energy consumption, most of MAC Protocols in WSNs exploit low duty cycling. Among those, RMAC [4] allows a node to transmit a data packet for multiple hops in a single duty cycle, which is made possible by exploiting a control frame named Pioneer (PION) in setting up the path. In this paper, we present a MAC Protocol called Hop Extended MAC (HE-MAC) that transmits the data packet for more multiple hops in a single duty cycle. It employs an EXP (Explorer) frame to set up the multiple hop transmission, which contains the information of the maximum hop that a packet can be transmitted. With the use of the information in EXP and an internal state of Ready to Receive (RTR), HEMAC extends the relay of the packet beyond the termination of the data period by two more hops compared to RMAC. Along with our proposed adaptive sleeping method, it also reduces power consumption and handles heavy traffic efficiently without experiencing packet inversion observed in RMAC. We analytically obtain the packet delivery latency in HE-MAC and evaluate the performance through ns-2 simulations. Compared to RMAC, HE-MAC achieves 14% less power consumption and 20% less packet delay on average for a random topology of 300 nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4C
• /
• pp.559-569
• /
• 2004

It has become more difficult to correspond an cyber attack quickly as a pattern of attack becomes various and complex. And, current security mechanisms just have passive defense functionalities. In this paper, we propose new network security architecture to respond various cyber attacks rapidly and to chase and isolate the attackers through cooperation between security zones. The proposed architecture make possible to deal effectively with cyber attacks such as IP spoofing or DDoS(Distributed Denial of Service) using active packet technology including a mobile sensor on active network. Active Security Management System based on proposed security architecture consists of active security node and active security server in a security zone, and is designed to have more active correspondent than that of existing mechanisms. We implemented these mechanisms in Linux routers and experimented on a testbed to verify realization possibility of Active Security Management System. The experimentation results are analyzed.