Minsun Lee

A Cluster-Based Energy-Efficient Routing Protocol without Location Information for Sensor Networks

With the recent advances in Micro Electro Mechanical System (MEMS) technology, low cost and low power consumption wireless micro sensor nodes have become available. However, energy-efficient routing is one of the most important key technologies in wireless sensor networks as sensor nodes are highly energy-constrained. Therefore, many researchers have proposed routing protocols for sensor networks, especially cluster-based routing protocols, which have many advantages such as reduced control messages, bandwidth re-usability, and improved power control. Some protocols use information on the locations of sensor nodes to construct clusters efficiently. However, it is rare that all sensor nodes know their positions. In this article, we propose another cluster-based routing protocol for sensor networks. This protocol does not use information concerning the locations of sensor nodes, but uses the remaining energy of sensor networks and the desirable number of cluster heads according to the circumstances of the sensor networks. From performance simulation, we found that the proposed protocol shows better performance than the low-energy adaptive clustering hierarchy (LEACH).

A base station centralized simple clustering protocol for sensor networks

Sensor nodes in wireless sensor network are severely energy-constrained. This has been a key factor to limit its performance. So far, many energy-efficient routing protocols have been proposed. Cluster-based routing protocols have been paid much attention because of their advantages. However, the cluster-based routing protocols require information on the locations of the sensor nodes in the network to construct clusters. Due to cost, it is not feasible to know the locations of all sensor nodes in the network. In this paper, we propose a base station centralized simple clustering protocol (BCSP) which requires no location information of the sensor nodes. Instead, BCSP utilizes information on the remaining energy of each sensor node and the number of cluster heads which is changed depending on the circumstance of the sensor network. From performance experiments, BCSP shows better performance than low-energy adaptive clustering hierarchy (LEACH)

Data mining middleware for wide-area high-performance networks

In this paper, we describe two distributed, data intensive applications that were demonstrated at iGrid 2005 (iGrid Demonstration US 109 and iGrid Demonstration US121). One involves transporting astronomical data from the Sloan Digital Sky Survey (SDSS) and the other involves computing histograms from multiple high-volume data streams. Both rely on newly developed data transport and data mining middleware. Specifically, we describe a new version of the UDT network protocol called Composible-UDT, a file transfer utility based upon UDT called UDT-Gateway, and an application for building histograms on high-volume data flows called BESH (for Best Effort Streaming Histogram). For both demonstrations, we include a summary of the experimental studies performed at iGrid 2005.

A simple dynamic clustering approach to achieve energy efficiency for wireless sensor networks

Purpose – Recent wireless communication and electronics technology has enabled the development of low‐cost, low‐power, and multi‐functional sensor nodes. However, the fact that sensor nodes are severely energy‐constrained has been an issue and many energy‐efficient routing protocols have been proposed to resolve it. Cluster‐based routing protocol is one of them. To achieve longer lifetime, some cluster‐based routing protocols use information on GPS‐based location of each sensor node. However, because of high cost, not all sensor nodes can be GPS‐enabled. The purpose of this paper is to propose a simple dynamic clustering approach to achieve energy efficiency for wireless sensor networks (WSN).Design/methodology/approach – Instead of using location information of each sensor node, this approach utilizes information of remaining energy of each sensor node and changes in the number of cluster head nodes dependent on the number of sensor nodes alive. Performance results are presented and compared with some re...

Uncompressed high definition visual sharing system towards interactive networked collaboration

Recent growth in available network bandwidth envisions widespread use of broadband applications such as uncompressed Internet HDTV, a cutting-edge application technology for networked collaboration. In this paper, we introduce a cost-effective uncompressed HD visual sharing system and discuss its software architecture in depth. We also illustrate our experiences with the visual sharing system for interactive collaboration. Finally, experimental results will show how well it compensates for packet jitter to gear up media synchronization.

Optimizing System Performance for Uncompressed HDTV over 10-Gigabit Ethernet

Guaranteeing network bandwidth and system performance becomes important technical matters to make seamless delivery of bulky data at high speed. Tuning system and network parameters including jumbo frame, kernel buffer size, and interrupt coalescence determines end-to-end transmission throughput. Additionally, fine-tuning of the parameters alleviates workload on high-end systems. Until now, many studies have concentrated on how to increase transmission throughput but rarely discussed how to mitigate system workload. In this paper, we have investigated various tuning parameters, which positively affect networking and processing performance of uncompressed HDTV system.

A Base Station Controlled Simple Sensor Network Protocol

In this paper, we propose a <i>base</i> <i>station</i> <i>controlled</i> <i>simple</i> <i>sensor</i> <i>network</i> <i>protocol</i> <i>(BCSP)</i>, which does not use the location information of each sensor node but the information of remaining energy to prolong lifetime of a sensor network.