• Journal of Internet Computing and Services
• /
• v.7 no.6
• /
• pp.63-77
• /
• 2006

Nowadays as many Grid communities appear, the requirement of singlepoint-to-multipoint data transfer in Grid environment is growing. In a typical LAN or a special purpose network environment, a multicasting technology was used in such a data dissemination transfer case. However, compared with unicasting fouler performance transfer performance the multicating transfer is worse, and the obligation of a special hardware setting makes it difficult to implement in common Grid environment. Therefore, in this paper we propose on effective data dissemination mechanism for Grid environment named DDMG(Data Dissemination Mechanism for Grid), DDMG uses P2P(Peer-to-Peer) mechanism and Globus XIO library to improve the performance in a data dissemination process and to support heterogeneous protocols in Grid environment. We also evaluate the performance of DDMG mechanism in LAN and WAN environment by comparing with unicast transfer.

• Journal of Information Technology Applications and Management
• /
• v.25 no.1
• /
• pp.87-104
• /
• 2018

The internet is spreading widely and malicious comments which is a negative aspect is increasing. Previous studies have considered anonymity as a cyber characteristic of malicious comments. However, there are a theoretical confusion due to inconsistent results. In addition, the dissemination, one of cyber characteristics, have been mentioned the theoretical relationship on malicious comments, but measurement and empirical study about dissemination were still limited. Therefore, this study developed a measurement of dissemination and investigated the relationship between cyber characteristics (anonymity, dissemination) and malicious comments on Facebook. As a result of research, this study identified that anonymity is not significant on malicious comments and discovered that the dissemination of cyber space has a direct influence on malicious comments. This study suggests that information systems can contribute to malicious comments researches by proposing cyber characteristics.

• Journal of KIISE:Information Networking
• /
• v.33 no.2
• /
• pp.165-174
• /
• 2006

Data dissemination using either flooding or legacy ad-hoc routing protocol is not realistic approach in the wireless sensor networks, which are composed of sensor nodes with very weak computing power, small memory and limited battery. In this paper, we propose the ELF(Energy-efficient Localized Flooding) protocol. The ELF is energy-efficient data dissemination protocol for wireless sensor networks. In the ELF protocol, there are two data delivery phases between fixed source and mobile sink node. The first phase, before the tracking zone, sensing data are forwarded by unicasting. After that, within the tracking zone, sensing data are delivered by localized flooding. Namely, the ELF Properly combines advantages from both unicasting and flooding. According to evaluation results by simulation, the proposed ELF protocol maintains very high data delivery ratio with using a little energy. Also, the property of average delay is better than others. From our research results, the ELF is very effective data dissemination protocol for wireless sensor networks.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.293-295
• /
• 2009

In an Intelligent Transport System(ITS), data dissemination based on inter-vehicle communication is effective for acquiring real-time traffic-jam information. In this paper, we propose a novel method for traffic jam information dissemination in vehicular ad-hoc networks. In our proposed method, vehicles already trapped in a Traffic-Jam elect leaders according to their locations from upstream and downstream respectively. Then each leader generates traffic data which contains their position, velocity and leader counter respectively, and disseminate the information. {{br}}The implementation of our proposed method is evaluated by means of simulation, and we also present simulation result

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.276-280
• /
• 2008

Many dissemination protocols on the mobility support in wireless sensor networks have been designed based on the assumption that the movement trace of sinks, such as soldiers and fire fighters, is random. However, the mobility of the sinks in many applications, for example, the movement trace of a soldier on operation in a battle field, can be determined in advance. In this paper, we propose a Predictable Mobility-based Data Dissemination protocol that enables data to directly route from source nodes to moving sinks by taking into consideration predictable movement behavior of the sinks. We also show the superiority of the predictable mobility-based data dissemination protocol through the performance comparison with the random mobility-based data dissemination protocols.

• The Journal of the Korea Contents Association
• /
• v.10 no.9
• /
• pp.26-35
• /
• 2010

In this paper, we propose the peer indexing scheme using data dissemination considering content and mobility. The proposed scheme consists of an index table, a buddy table, a routing table to support the cost of data dissemination, the search accuracy and cost. In this proposed scheme, a neighbor peer is recognized through a signal function and the cost of data dissemination is reduced by timestamp message. The transmitted messages are stored in the index structure considering timestamp and weight of interests which improves search accuracy and reduces the cost of search.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.3
• /
• pp.528-534
• /
• 2007

As XML is becoming a standard for representation and exchange of abundant information on the Web, solutions for a secure and selective dissemination of XML data, known as SDI, are strongly demanded. Such trends are more outstanding especially in distributed heterogeneous environment such as Peer-to-Peer. Although many approaches have been proposed to provide secure and efficient SDI mechanisms, almost previous approaches have focused only on filtering with user profile and they adopt center-oriented administration approaches. It is therefore difficult to adapt them directly to the distributed Peer-to-Peer environments characterized by dynamic participation. In this paper, we develop a novel dissemination method, which makesuse of authorization policy and secret sharing scheme. It provides more secure, scalable means for XML dissemination on Peer-to-Peer networks.

• Journal of Communications and Networks
• /
• v.13 no.6
• /
• pp.567-582
• /
• 2011

The growing popularity of the Internet has caused the size and complexity of communications and computing systems to greatly increase in recent years. To alleviate this increased management complexity, novel autonomic management architectures have emerged, in which many automated components manage the network's resources in a distributed fashion. However, in order to achieve effective collaboration between these management components, they need to be able to efficiently exchange information in a timely fashion. In this article, we propose a context dissemination framework that addresses this problem. To achieve scalability, the management components are structured in a hierarchy. The framework facilitates the aggregation and translation of information as it is propagated through the hierarchy. Additionally, by way of semantics, context is filtered based on meaning and is disseminated intelligently according to dynamically changing context requirements. This significantly reduces the exchange of superfluous context and thus further increases scalability. The large size of modern federated cloud computing infrastructures, makes the presented context dissemination framework ideally suited to improve their management efficiency and scalability. The specific context requirements for the management of a cloud data center are identified, and our context dissemination approach is applied to it. Additionally, an extensive evaluation of the framework in a large-scale cloud data center scenario was performed in order to characterize the benefits of our approach, in terms of scalability and reasoning time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1431-1439
• /
• 2016

In this paper, we propose a new location service and location-based routing for data dissemination from a source to a mobile group sink in less energy consumption of the sensor node. Unlike the existing protocols, the proposed protocol uses a leader sink instead of a group area as the location information to represent a mobile sink group. The proposed protocol also uses grid leaders on virtual grid structure to support sink mobility in location service. By using a leader sink as a representative and grid leaders for mobility supporting, the proposed protocol can exploit an efficient hierarchical location service and data dissemination method without using flooding. Accordingly, the proposed protocol carries out upper layer location services and data dissemination between a leader sink and a source and lower layer location services and data dissemination between the leader sink and member sinks. Simulation results demonstrate that the proposed protocol achieves energy-efficiency.

• Journal of Internet Computing and Services
• /
• v.11 no.4
• /
• pp.33-39
• /
• 2010

In this paper, a data dissemination protocol that transmits data collected for Wireless Sensor Networks (WSNs) is newly proposed, and the proposed proactive protocol takes into account energy consumption minimized and delay time disseminated. The well-known SPMS (Shortest Path Mined SPIN) forms the shortest path-based routing table obtained by Bellman Ford Algorithm (BFA) and disseminates data using a multi-hop path in order to minimize energy consumption. The mentioned properties of SPMS cause memory burden to create and maintain the routing tables. In addition, whenever BFA is executed, it is necessary to suffer from the energy consumption and traffic occurred. In order to overcome this problem, a proactive dissemination protocol using Residual Energy and Signal Strength, called RESS, is proposed in this paper. Simulation results show that RESS outperforms SPMS up to 84% in terms of the number of traffic messages and the transmitted delay time of RESS is similar to that of SPMS using the shortest path.