• Journal of the Korea Society of Computer and Information
• /
• v.9 no.3
• /
• pp.171-175
• /
• 2004

This paper proposes a seamless handoff scheme that enables a mobile node to continue a session when moving to an overlapping area. During handoff due to the weakness of signaling, mobile node makes new Care-of Addresses using signals received from access router when MN reaches the edge of its area in addition to its current CoA, and it sends temporary binding update messages to Mobility Anchor Point which manage the area covering MN. MAP receives that binding update messages from MN, and temporarily stores new binding informations from them to its binding cache besides existing binding information for MN. This scheme ensures a seamlessly handoff using multicasting until MN enter a new access router area and sends a confirmed binding update message to MAP.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.147-151
• /
• 2005

CAN(Controller Area Network) is a simple and efficient network system for real time control and measurement. As it is not only good at error detection but also strong in electromagnetic interference, CAN has been widely used all over the industries. Basically, CAN needs a master node in charge of sensor data collection, node scheduling for data transmission to a monitoring system and error detection. According to the number of mater nodes, the CAN system is classified into two type of master system. One is a single master system that has only one master node and the other is a multi-master system where any sensor node can become a master node depending on the system's conditions. While it has the advantage of its fault tolerance, the multi-master system will suffer form the overall performance degradation when a defect is found in the master node. It is because all sensor nodes pertaining to a defective master node lose their position. Moreover, it is difficult and expensive to implement. For a single master system, the whole system will be broken down when a problem happens to a single master. In this paper, a dynamic master system is presented that there are several sub-master nodes of which basic functions are those of other sensor nodes at ordinary times but dynamically changed to replace the failing master node. An effective scheduling algorithm is also proposed to choose an appropriate node among sub-master nodes, where each sub-master node has its precedence value. The performance of the dynamic master system is experimented and analyzed.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.8
• /
• pp.889-897
• /
• 2014

With the development of wireless communication and sensor technology, sensor network applications in various fields have been applied. To minimize the power consumption of sensors in sensor network is one of the important factors in oder to extend the system life. The power consumption of each sensor within sensor network can be different depending on the communication method between head(sink) node and its node. In this paper, we propose a new hierarchical communication method to minimize the power consumption of each sensor. The proposed method divides the area of sensor network into four areas using divide-and-conquer method and selects the nearest node to head node in each area as a child node of the node. Next the hierarchical tree in the same way is constructed recursively until each area is no longer divided. Each sensor can communicate to head node using this hierarchical tree. The proposed results were compared with the previous methods through simulation, and showed excellent results in the energy efficiency of sensor network.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.4
• /
• pp.169-176
• /
• 2019

Wireless sensor networks are used to monitor and control areas in a variety of military and civilian areas such as battlefield surveillance, intrusion detection, disaster recovery, biological detection, and environmental monitoring. Since the sensor nodes are randomly placed in the area of interest, separation of the sensor network area may occur due to environmental obstacles or a sensor may not exist in some areas. Also, in the situation where the sensor node is placed in a non-relocatable place, some node may exhaust energy or physical hole of the sensor node may cause coverage hole. Coverage holes can affect the performance of the entire sensor network, such as reducing data reliability, changing network topologies, disconnecting data links, and degrading transmission load. It is possible to solve the problem that occurs in the coverage hole by finding a coverage hole in the sensor network and further arranging a new sensor node in the detected coverage hole. The existing coverage hole detection technique is based on the location of the sensor node, but it is inefficient to mount the GPS on the sensor node having limited resources, and performing other location information processing causes a lot of message transmission overhead. In this paper, we propose an Adjacent Matrix-based Hole Coverage Discovery(AMHCD) scheme based on connectivity of neighboring nodes. The method searches for whether the connectivity of the neighboring nodes constitutes a closed shape based on the adjacent matrix, and determines whether the node is an internal node or a boundary node. Therefore, the message overhead for the location information strokes does not occur and can be applied irrespective of the position information error.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.249-257
• /
• 2003

Ring networks are very commonly exploited among local area and metropolitan area networks (LAN/MAN), whereas cells or small fixed-size packets are widely used in synchronized ring networks. In this paper, we present an analytical method for evaluating the delay-throughput performance of a MAC protocol with multiple self-tokens in a slotted ring network under uniform traffic. In our analysis, we introduce the stationary probability, which indicates the number of packets in a node. Also, it is assumed that each node has a sufficiently large amount of self-tokens, and a slotted ring has the symmetry. The analytical results with respect to delay-throughput performance have similar values to computer simulated ones. Furthermore, in order to achieve fair access under non-uniform traffic, we propose an adaptive MAC protocol, where the number of self-tokens in a node dynamically varies, based on the number of packets transmitted within a specified period. In the proposed protocol, when the number of packets transmitted by a node within a specified period is larger than a specified threshold, the node decreases the number of self-tokens in a per-node distributed method. That results in creating free slots in the ring, thus all nodes can obtain an equal opportunity to transmit into the ring. Performance results obtained by computer simulation show that our proposed protocol can maintain throughput fairness under non-uniform traffic.

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

Mobile Ad hoc Networks(MANET) is consist of node that has mobility, MANET build cluster formation for using energy efficient. In existing LEACH algorithm elect cluster head node in coverage area by distribution function. However, when the cluster head node, that elected by distribution function, is divided coverage area unevenly, the network can't consumption energy efficiency. To solve this problem, we proposed CSWC(Coverage Scheduling Weight-value Control) algorithm. When the coverage area is divided nonchalance, proposed algorithm increased number of hops, that determines coverage area, for balance coverage area. As the result proposed algorithm is set balance coverage area, the network consumption energy efficiency.

• Journal of Information Processing Systems
• /
• v.5 no.4
• /
• pp.229-236
• /
• 2009

Sensors are deployed to gather physical, environmental data in sensor networks. Depending on scenarios, it is often assumed that it is difficult for batteries to be recharged or exchanged in sensors. Thus, sensors should be able to process users' queries in an energy-efficient manner. This paper proposes a spatial query processing scheme- Minimum Bounding Area Based Scheme. This scheme has a purpose to decrease the number of outgoing messages during query processing. To do that, each sensor has to maintain some partial information locally about the locations of descendent nodes. In the initial setup phase, the routing path is established. Each child node delivers to its parent node the location information including itself and all of its descendent nodes. A parent node has to maintain several minimum bounding boxes per child node. This scheme can reduce unnecessary message propagations for query processing. Finally, the experimental results show the effectiveness of the proposed scheme.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.4
• /
• pp.603-609
• /
• 1987

In this paper, the single-row routing algorithm for munimizing the street congestion and reducing the between node congestion is deviced. To reduce the between node congestion, reference line crossing is defined and used. Reducing the number of total reference line crossing means reducing the total length which help reduce the power consumption of the integrated system and reducing the between node congestin which help reduce the wiring area. This algorithm has been implemented and tested with various example, then produced good results.

• The KIPS Transactions:PartA
• /
• v.16A no.1
• /
• pp.17-26
• /
• 2009

Large-scale wireless sensor network are expected to play an increasingly important role for the data collection in harmful area. However, the physical fragility of sensor node makes reliable routing in harmful area a challenging problem. Since several sensor nodes in harmful area could be damaged all at once, the network should have the availability to recover routing from node failures in large area. Many routing protocols take accounts of failure recovery of single node but it is very hard these protocols to recover routing from large scale failures. In this paper, we propose a routing protocol, which we refer to as LSFA, to recover network fast from failures in large area. LSFA detects the failure by counting the packet loss from parent node and in case of failure detection LSFAdecreases the routing interval to notify the failure to the neighbor nodes. Our experimental results indicate clearly that LSFA could recover large area failures fast with less packets than previous protocols.

• Steel and Composite Structures
• /
• v.26 no.4
• /
• pp.463-471
• /
• 2018

The bolted end-plate beam-column connections have been widely used in steel structure and composite structure because of its excellent seismic performance. In this paper, the end-plate bolted connection is applied in the concrete structure, A new-type of fabricated beam-column connections with end-plates is presented, and steel plate hoop is used to replace stirrups in the node core area. To study the seismic behavior of the joint, seven specimens are tested by pseudo-static test. The experimental results show that the new type of assembly node has good ductility and energy dissipation capacity. Besides, under the restraint effect of the high-strength stirrup, the width of the web crack is effectively controlled. In addition, based on the analysis of the factors affecting the shear capacity of the node core area, the formula of shear capacity of the core area of the node is proposed, and the theoretical values of the formula are consistent with the experimental value.