Joa-Hyoung Lee

Adaptive-compression based congestion control technique for wireless sensor networks.

Congestion in a wireless sensor network causes an increase in the amount of data loss and delays in data transmission. In this paper, we propose a new congestion control technique (ACT, Adaptive Compression-based congestion control Technique) based on an adaptive compression scheme for packet reduction in case of congestion. The compression techniques used in the ACT are Discrete Wavelet Transform (DWT), Adaptive Differential Pulse Code Modulation (ADPCM), and Run-Length Coding (RLC). The ACT first transforms the data from the time domain to the frequency domain, reduces the range of data by using ADPCM, and then reduces the number of packets with the help of RLC before transferring the data to the source node. It introduces the DWT for priority-based congestion control because the DWT classifies the data into four groups with different frequencies. The ACT assigns priorities to these data groups in an inverse proportion to the respective frequencies of the data groups and defines the quantization step size of ADPCM in an inverse proportion to the priorities. RLC generates a smaller number of packets for a data group with a low priority. In the relaying node, the ACT reduces the amount of packets by increasing the quantization step size of ADPCM in case of congestion. Moreover, in order to facilitate the back pressure, the queue is controlled adaptively according to the congestion state. We experimentally demonstrate that the ACT increases the network efficiency and guarantees fairness to sensor nodes, as compared with the existing methods. Moreover, it exhibits a very high ratio of the available data in the sink.

Speedy Routing Recovery Protocol for Large Failure Tolerance in Wireless Sensor Networks

Wireless sensor networks are expected to play an increasingly important role in data collection in hazardous areas. However, the physical fragility of a sensor node makes reliable routing in hazardous areas a challenging problem. Because several sensor nodes in a hazardous area could be damaged simultaneously, the network should be able to recover routing after node failures over large areas. Many routing protocols take single-node failure recovery into account, but it is difficult for these protocols to recover the routing after large-scale failures. In this paper, we propose a routing protocol, referred to as ARF (Adaptive routing protocol for fast Recovery from large-scale Failure), to recover a network quickly after failures over large areas. ARF detects failures by counting the packet losses from parent nodes, and upon failure detection, it decreases the routing interval to notify the neighbor nodes of the failure. Our experimental results indicate that ARF could provide recovery from large-area failures quickly with less packets and energy consumption than previous protocols.

Reliable Asynchronous Image Transfer Protocol in Wireless Multimedia Sensor Networks

In the paper, we propose a reliable asynchronous image transfer protocol, RAIT. RAIT applies a double sliding window method to node-to-node transfer, with one sliding window for the receiving queue, which is used to prevent packet loss caused by communication failure between nodes, and another sliding window for the sending queue, which prevents packet loss caused by network congestion. The routing node prevents packet loss between nodes by preemptive scheduling of multiple packets for a given image. RAIT implements a double sliding window method by means of a cross-layer design between the RAIT layer, routing layer, and queue layer. We demonstrate that RAIT guarantees a higher reliability of image transmission compared to the existing protocols.

Energy Effective Time Synchronization inWireless Sensor Network

Advance in processor, memory and wireless communication technique have led to an increase of economical and small wireless sensor nodes. To provide the right responses quickly for the diverse events, wireless sensor nodes have cooperation with together. For successful cooperation, the time synchronization among sensor nodes is an important requirement for application execution. In wireless sensor networks, message packets are used for the time synchronization. However, the transmission of message packets dissipates the battery energy of wireless sensor nodes. Since wireless sensor nodes works on the limited battery capacity, the excessive use of message packets has a negative impact upon their lifetime. In this paper, reference interpolation protocol is proposed for reducing the number of message packets for the time synchronization. The proposed method performs time interpolation between the time of reference packets and the global time of the base station. The proposed method completes the synchronization operation with only two message packets. Due to the simple synchronization procedure, our method greatly reduces the number of synchronization messages. From the decrease in the transmission of message packets, the convergence time among wireless sensor nodes is shortened and the lifetime of wireless sensor nodes is also prolonged as much as the amount of saved battery energy.

Load distribution strategies in cluster-based transcoding servers for mobile clients

The recent advance in wireless network technologies has enabled the streaming media service on the mobile devices such as PDAs and cellular phones. Since the wireless network has low bandwidth channels and mobile devices are actually composed of limited hardware specifications, the transcoding technology is needed to adapt streaming media to the given mobile devices. When large scale mobile clients demand the streaming service, load distribution strategies among transcoding servers highly impact on the total number of QoS streams. In this paper, the resource weighted load distribution strategy is proposed for the fair load balancing and the more scalable performance in cluster-based transcoding servers. Our proposed strategy is based on the weight of resources consumed for transcoding to classified client grades and the maximum number of QoS streams actually measured in transcoding servers. The proposed policy is implemented on cluster-based transcoding system. In experiments, we evaluate its fair load distribution and scalable performance according to the increase of transcoding servers.

Resource consumption-aware QoS in cluster-based VOD servers

For Video-On-Demand (VOD) systems, it is important to provide Quality of Service (QoS) to more clients under limited resources. In this paper, the performance scalability in cluster-based VOD servers is studied with several grouping configurations of cluster nodes. To find performance bottlenecks, the monitoring functions are employed and the maximum QoS streams are measured under the various requests including VCR functions. To support more user friendly interface, an embedded set-top model is suggested for the QoS of TV clients. From our detailed experiment results, a new admission control method is proposed that is based on available system resources and the actual amount of resource consumed for QoS streams. The proposed method provides not only more scalable QoS in cluster-based VOD servers but also the enhancement of resource utilization by guaranteeing the maximum number of QoS streams.

Adaptive Power Control based Efficient Localization Technique in Mobile Wireless Sensor Networks

ABSTRACT Given the increased interest in ubiquitous computing, wireless sensor network has been researched widely. The localization service which provides the location information of mobile user, is one of important service provided by sensor network. Many methods to obtain the location information of mobile user have been proposed. However, these methods were developed for only one mobile user so that it is hard to extend for multiple mobile users. If multiple mobile users start the localization process concurrently, there could be interference of beacon or ultrasound that each mobile user transmits. In the paper, we propose APL(Adaptive Power Control based Resource Allocation Technique for Efficient Localization Technique), the localization technique for multiple mobile nodes based on adaptive power control in mobile wireless sensor networks. In APL, collision of localization between sensor nodes is prevented by forcing the mobile node to get the permission of localization from anchor nodes. For this, we use RTS(Ready To Send) packet type for localization initiation by mobile node and CTS(Clear To Send) packet type for localization grant by anchor node. NTS(Not To Send) packet type is used to reject localization by anchor node for interference avoidance and STS(Start To Send) for synchronization between 모anchor nodes. At last, the power level of sensor node is controled adaptively to minimize the affected area. The experimental result shows that the number of interference between nodes are increased in proportion to the number of mobile nodes and APL provides efficient localization.Keywords:Sensor Network, Localization, Multiple Mobile Node, Interference, Avoidance

Parallel failure recovery techniques in cluster-based media servers

For large-scale video-on-demand (VOD) service, cluster servers are highlighted due to their high performance and low cost. A cluster server consists of a front-end node and multiple backend nodes. Though the increase in backend nodes provides more quality of service (QoS) streams, the possibility of backend node failure is proportionally increased. The failure causes not only the cessation of streaming services but also the loss of current playing positions. In this paper, when a backend node fails, recovery mechanisms are studied to support the streaming service continuously. Without considering the characteristics of cluster-based servers and MPEG media, the basic redundant array of independent disks (RAID) techniques cause a network bottleneck in the internal network path and demonstrate inefficient CPU usage in backend nodes. To address these problems, a new failure recovery mechanism is proposed based on the pipeline computing concept. The proposed method not only distributes the internal network traffic generated from the recovery operations but also utilizes the CPU time available in the backend nodes. In the experiments, even if a backend node fails, the proposed method provides continuous streaming media services within a short MTTR value as well as more QoS streams than the existing method.

Data Dissemination Protocol based on Home Agent and Access Node for Mobile Sink in Sensor Network

ABSTRACT The mobile sink is most suitable to guarantee the real time processing to events in ubiquitous environment. However it brings many challenges to wireless sensor networks. In particular, the question of how to transfer the collected data to the mobile sink is an important topic in the aspect of effective management of wireless sensor nodes. In this paper, a new data dissemination model is proposed. Since this method uses the home agent and the access node concepts, it provides reliable and efficient data delivery to mobile sink with minimum overhead. In this proposed method, the information of the mobile sink which is constantly moving is informed only to the home agent node and the access node, instead of all sensor nodes. Thus, the collected data from sensor nodes are transferred to the fixed home agent and it sends these data to the mobile sink. Since the confliction phenomenon between data packets in wireless networks could be reduced, the success ratio of data arriving in the mobile sink is highly enhanced. In our experiments, the proposed method reduces the number of broadcast packets so that it saves the amount of energy consumed for transmitting and receiving the data packets. This effect contributes to prolong the lifetime of the wireless sensor networks operated by batteries.Keywords:Sensor network, Mobile sink, Home agent, Access node

Reference interpolation protocol for time synchronization in wireless sensor networks

Advance in processor, memory and wireless communication technique have led to an increase of economical and small wireless sensor nodes. To provide the right responses quickly for the diverse events, wireless sensor nodes have cooperation with together. For successful cooperation, the time synchronization among sensor nodes is an important requirement for application execution. In wireless sensor networks, message packets are used for the time synchronization. However, the transmission of message packets dissipates the battery energy of wireless sensor nodes. Since wireless sensor nodes works on the limited battery capacity, the excessive use of message packets has a negative impact upon their lifetime. In this paper, reference interpolation protocol is proposed for reducing the number of message packets for the time synchronization. The proposed method performs time interpolation between the time of reference packets and the global time of the base station. The proposed method completes the synchronization operation with only two message packets. Due to the simple synchronization procedure, our method greatly reduces the number of synchronization messages. From the decrease in the transmission of message packets, the convergence time among wireless sensor nodes is shortened and the lifetime of wireless sensor nodes is also prolonged as much as the amount of saved battery energy.