• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10a
• /
• pp.191-192
• /
• 2007

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10a
• /
• pp.120-121
• /
• 2007

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10a
• /
• pp.179-180
• /
• 2007

• International Journal of Quality Innovation
• /
• v.6 no.2
• /
• pp.46-58
• /
• 2005

The internet is enabling a new economy based on the networking of human knowledge. While the benefits of connecting people to people, people to information and people to data within an organization are becoming more recognized and appreciated, much less is known about managing knowledge creation and dissemination across corporate boundaries. This paper addresses the challenges associated with selecting the best collaborative strategy and managing relationships which span organizational cultures and boundaries.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.210-212
• /
• 2003

Active sensors are rapidly conquering a share on the remote sensing market and offer among others new possibilities toward automatically acquiring 3D building data. Better dissemination of information about new technological developments can possibly be achieved by short distance-learning courses. The paper describes the didactic and technical aspects of a course we have designed and conducted on airborne laser scanning and interferometric SAR. The building extraction application is a good example to illustrated the added value of short electronic-learning courses above simply publishing (digital) papers.

• Journal of Information Technology Services
• /
• v.6 no.1
• /
• pp.141-149
• /
• 2007

Sensor node's mobility brings new challenges to data dissemination in large sensor networks. Frequent location updates of sensor nodes can lead to both excessive drain of sensor's limited battery supply and increased collisions in wireless transmissions. Conventional studies for routing protocols in wireless sensor networks are not enough to cover energy consumption and migration of sensor nodes. This study proposes a dynamic routing protocol based on the SPIN considering energy consumption and the migration, and also shows the effectiveness of the proposed routing protocol.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.305-308
• /
• 2005

The COMS, Korea's first geostationary multipurpose satellite program will accommodate 3 kind of payloads; Ka-Band communication transponder, GOCI (Geostationary Ocean Color Imager), and MI (Meteorological Imager). MI raw data will be transferred to ground station via L-band link. The ground station will perform image data processing for raw data, generate them into the LRIT/HRIT format, the user dissemination data recommended by the CGMS. The LRIT/HRIT are disseminated via satellite to user stations. This paper shows the COMS LRIT data generation procedure based on COMS LRIT specification and its verification results using the LRIT user station.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.86-101
• /
• 2006

The bandwidth of channel and the power of the mobile devices are limited on a wireless environment. In this case, data broadcast has become an excellent technique for efficient data dissemination. A significant amount of researches have been done on generating an efficient broadcast program of a set of data items with different access frequencies over multiple wireless broadcast channels as well as single wireless broadcast channel. In this paper, an efficient data allocation method over multiple wireless broadcasting channels is explored. In the traditional approaches, a set of data items are partitioned into a number of channel based on their access probabilities. However, these approaches ignore a variation of access probabilities of data items allocated in each channel. In practice, it is difficult to have many broadcast channels and thus each channel need to broadcast many data items. Therefore, if a set of data items broadcast in each channel have different repetition frequencies based on their access frequencies, it will give much better performance than the traditional approaches. In this paper, we propose an adaptive data allocation technique based on data access probabilities over multiple broadcast channels. Our proposed technique allows the adaptation of repetition frequency of each data item within each channel by taking its access probabilities into at count.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.35-40
• /
• 2011

In this paper, we compare and analyze data aggregation methods based on event area in wireless sensor networks. Data aggregation methods consist of two methods: the direct transmission method and the aggregation node method. The direct aggregation method has some problems that are data redundancy and increasing network traffic as all nodes transmit own data to neighbor nodes regardless of same data. On the other hand the aggregation node method which aggregate neighbor's data can prevent the data redundancy and reduce the data. This method is based on location of nodes. This means that the aggregation node can be selected the nearest node from a sink or the centered node of event area. So, we describe the benefits of data aggregation methods that make up for the weak points of direct data dissemination of sensor nodes. We measure energy consumption of the existing ways on data aggregation selection by increasing event area. To achieve this, we calculated the distance between an event node and the aggregation node and the distance between the aggregation node and a sink node. And we defined the equations for distance. Using these equations with energy model for sensor networks, we could find the energy consumption of each method.

• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.243-253
• /
• 2005

Dissemination of XML data on the internet could breach the privacy of data providers unless access to the disseminated XML data is carefully controlled. Recently, the methods using encryption have been proposed for such access control. However, in these methods, the performance of processing queries has not been addressed. A query processor cannot identify the contents of encrypted XML data unless the data are decrypted. This limitation incurs overhead of decrypting the parts of the XML data that would not contribute to the query result. In this paper, we propose the notion of query-aware decryption for efficient processing of queries against encrypted XML data. Query-aware decryption allows us to decrypt only those parts that would contribute to the query result. For this purpose, we disseminate an encrypted XML index along with the encrypted XML data. This index, when decrypted, informs us where the query results are located in the encrypted XML data, thus preventing unnecessary decryption for other parts of the data. Since the size of this index is much smaller than that of the encrypted XML data, the cost of decrypting this index is negligible compared with that for unnecessary decryption of the data itself. The experimental results show that our method improves the performance of query processing by up to 6 times compared with those of existing methods. Finally, we formally prove that dissemination of the encrypted XML index does not compromise security.