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

It is well known that the current wireless sensor networks addressing methods do not work efficiently in networks more than a few hundred nodes. A standard protocol in ZigBee-Standard feature in ZigBee 2007 gives balanced tree based address assignment method with distributed manner. However, it was limited to cover less than hundreds of sensor nodes due to the wasteful use of available address space, because composed sensor networks usually make an unbalanced tree topology in the real deployment. In this paper, we proposed the hierarchical cluster tree based address assignment method to support large and scalable networks. This method provides unique address for each node with distributed manner and supports hierarchical cluster tree on-demand. Simulation results show that the proposed method reduces orphan nodes due to the address exhaustion and supports larger network with limited address space compared with the ZigBee distributed address assignment method defined in ZigBee-Standard feature in ZigBee 2007.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.8
• /
• pp.660-666
• /
• 2014

In this paper, we consider a classification criteria of sensor nodes based on equipment function, and propose a routing search algorithm between node when an IP-USN is applied inside a ship. whereas a tree-type routing algorithm is applied to the limited mobile enviroment, such as engine room or machine room, a mesh-type routing alogrithm is to free mobile enviroment, such as passager corridor liviing quarters or restanrats areas. For mesh-type routing, it is necessary to maintain a seamless route path between a sink node and sensor nodes for which we consider a novel message exchange periodically. We proposed a new message, RDES message, which is issued periodically to update the topology of sensor node and check a connectivity between nodes.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.3
• /
• pp.14-22
• /
• 2007

Wireless sensor networks are composed of numerous sensor nodes and exchange or recharging of the battery is impossible after deployment. Thus, sonsor nodes must be very energy-efficient. As neighboring sensor nodes generally have the data of similar information, duplicate transmission of similar information is usual. To prevent energy wastes by duplicate transmissions, it is advantageous to organize sensors into clusters. The performance of clustering scheme is influenced by the cluster-head election method and the size or the number of clusters. Thus, we should optimize these factors to maximize the energy efficiency of the clustering scheme. In this paper, we propose a new energy consumption model for LEACH which is a well-known clustering protocol and determine the optimal number of clusters based on our model. Our model has accuracy over 80% compared with the simulation and is considerably superior to the existing model of LEACH.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.187-192
• /
• 2007

Since wireless sensor networks (WSN) have relatively narrow bandwidth and have limited memory space. Mosaic by inlaying images transmitted by adjacent sensors can provide wider field of view and smaller storage memory. Most WSN are used for surveillance purpose, image acquisition period should be sufficiently short, so that mosaic algorithm has to be run in real time. Proposed algorithm is derived by using the fact that position of sensor nodes are fixed and known. Transformation matrix can be calculated by using distance between sensor nodes and distance between sensor nodes and predefined object. Simulation result shows that proposed algorithm provides very short processing time whereas it preserves image quality.

• The Journal of Society for e-Business Studies
• /
• v.13 no.2
• /
• pp.149-163
• /
• 2008

In a ubiquitous sensor network (USN) with several nodes, real-time data processing is one of important factors. In order to process data appropriately, all the nodes should transmit sensor data in time and the transmission between nodes and their server should be managed very systematically. For the purpose of systematic management of transmission in a USN, this paper proposes a system for analyzing transmission time of sensor data. To implement the proposed system, an analyzing process of data transmission time, an analyzing method of clock drift, a collecting method of data send/receive times, and calculating formulas of data transmission duration are proposed. According to the proposed process and methods, this paper presents a system for monitoring and analyzing data transmission duration, and it also shows the results of a sample case.

• Journal of the Korea Society for Simulation
• /
• v.16 no.3
• /
• pp.49-56
• /
• 2007

There are many application areas of wireless sensor networks, such as combat field surveillance, terrorist tracking and highway traffic monitoring. These applications collect sensed data from sensor nodes to monitor events in the territory of interest. One of the important issues in these applications is the existence of the radio-jamming zone between source nodes and the base station. Depending on the routing protocol the transmission of the sensed data may not be delivered to the base station. To solve this problem we propose a genetic algorithm based routing method for reliable transmission while considering the balanced energy depletion of the sensor nodes. The genetic algorithm finds an efficient routing path by considering the radio-jamming zone, energy consumption needed fur data transmission and average remaining energy level. The fitness function employed in genetic algorithm is implemented by applying the fuzzy logic. In simulation, our proposed method is compared with LEACH and Hierarchical PEGASIS. The simulation results show that the proposed method is efficient in both the energy consumption and success ratio of delivery.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.493-495
• /
• 2016

In this paper, we propose an alternative method of collecting image data and changing nodes in wireless sensor networks based sensing disaster systems configured with zigbee using quad copter. It is difficult to observe a wide area caused by existing fixed video cameras in the wireless sensor network system using a conventional image-based. Also the nodes don't have provide to alternate methodology in situations when missing due to a disaster or destruction. In this paper, to use wearing the IP camera and the communication node to the quad copter, it provides a method to take advantage of as improving an alternative node of the reliability of the sensor node. The results show to improve the reliability of the sensor nodes and real-time status information through a video quad Copt than conventional systems.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.237-244
• /
• 2009

The congestion in wireless sensor network increases the ratio of data loss and causes the delay of data. The existing congestion protocols for wireless sensor network reduces the amount of transmission by control the sampling frequency of the sensor nodes related to the congestion when the congestion has occurred and was detected. However, the control method of sampling frequency is not applicable on the situation which is sensitive to the temporal data loss. In the paper, we propose a new congestion control, ACT - Adaptive Congestion conTrol. The ACT monitors the network traffic with the queue usage and detects the congestion based on the multi level threshold of queue usage. Given network congestion, the ACT increases the efficiency of network by adaptive flow control method which adjusts the frequency of packet transmission and guarantees the fairness of packet transmission between nodes. Furthermore, ACT increases the quality of data by using the variable compression method. Through experiment, we show that ACT increases the network efficiency and guarantees the fairness to sensor nodes compared with existing method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.856-859
• /
• 2010

WSN is composed of a lot of small sensors with the limited hardware resources. In WSN, at the initial stage, sensor nodes are randomly deployed over the region of interest, and self-configure the clustered networks by grouping a bunch of sensor nodes and selecting a cluster header among them. Specially, in Mobile-WSN environment, in which the administrator's intervention is restricted, the self-configuration capability is essential to establish a power-conservative Mobile-WSN which provides broad sensing coverage and communication coverage. In this paper, we propose a self-configuration routing protocol for Mobile-WSN, which consists of step-wise novel protocols for initial deployment, effective joining and removal of sensor nodes, which result in reducing overall power consumption, and extending the lifetime of network.

• The KIPS Transactions:PartC
• /
• v.15C no.1
• /
• pp.19-30
• /
• 2008

Sensor nodes are used as a storage space in the data centric storage method for sensor networks. Sensor nodes save the data to the node which is computed by hash table and users also access to the node to get the data by using hash table. One of the problems which the data centric storage method has is that queries from many users who are interested in the popular data could be concentrated to one node. In this case, responses for queries could be delayed and the energy of heavy loaded node could be dissipated fast. This would lead to reduction of network life time. In this paper, ALT, Data Centric Storage based on Adaptive Local Trajectory, is proposed as scalable data centric storage method for sensor network. ALT constructs trajectory around the storage node. The scope of trajectory is increased or decreased based on the query frequency. ALT distributes the query processing loads to several nodes so that delay of response is reduced and energy dissipation is also distributed.