• Journal of Contemporary Eastern Asia
• /
• v.17 no.2
• /
• pp.147-175
• /
• 2018

Under authoritarian regimes, citizen-led NGOs such as environmental NGOs (ENGOs) often operate under close scrutiny of the government. While this presents a challenge to a single ENGO, we propose here - in line with existing research on network effects - that there are opportunities for multiple ENGOs to coordinate and thus work in ways that supersede government controls, affect public opinion, and contribute to policy revision and/or creation. In this paper, we specifically examine the possibility that the gamut of citizen-based ENGOs in China are coordinating. Based on network analysis of ENGOs web pages as well as interviews with more than a dozen ENGO leaders between 2014 and 2016, we find that ENGOs have few direct and public connections to each other, but social media sites and personal connections offline provide a crucial function in creating bridges. A closer examination of these bridges reveals, however, that they can be substantive to the environmental discussion or functional to the dissemination of web page information but typically not both. In short, ENGOs in China are not directly connected but rather are connected in a way that responds to the available social media and the government's censorship practices.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.18 no.2
• /
• pp.1-8
• /
• 2022

The message propagation between vehicles must be efficiently performed to quickly transmit information between vehicles in vehicle ad hoc networks (VANETs). Broadcasting can be the most effective solution for propagating these messages. However, broadcasting can cause broadcast storm problems, which can reduce the performance of the overall network. Therefore, rapid information delivery in VANET requires a method that can propagate messages quickly without causing the broadcast storm problems. This paper proposes a lightweight and opportunistic broadcast (LOB) protocol that leverages the features of opportunistic routing to propagate messages quickly while minimizing the load on the network in VANETs where the network topology changes frequently. LOB does not require any routing information like greedy forwarding scheme, and neighboring nodes at the farthest distance within the range of transmission nodes are likely to be selected as forwarding nodes, and multiple forwarding candidate nodes like opportunistic routing scheme can increase packet transmission rates. Simulation results using ns-2 showed that LOB outperformed existing broadcast protocols in terms of packet rate and packet delay.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.8
• /
• pp.149-156
• /
• 2010

As following the development of the USN technology, sensor node used in sensor network has capability of quick data process and storage to support efficient network configuration is enabled. In addition, tree-based structure was transformed to cluster in the construction of sensor network. However, query processing based on existing tree structure could be inefficient under the cluster-based network. In this paper, we suggest energy efficient query processing mechanism using filtering through data attribute classification in cluster-based sensor network. The suggestion mechanism use advantage of cluster-based network so reduce energy of query processing and designed more intelligent query dissemination. And, we prove excellence of energy efficient side with MATLab.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.6 no.2
• /
• pp.71-84
• /
• 2004

There is a growing demand for agrometeorological information that end-users can use and not just interesting information. lo achieve this, each region/community needs to develop and provide localized climate and weather information for growers. Additionally, provide tools to help local users interpret climate forecasts issued by the National Weather Service in the country. Real time information should be provided for farmers, including some basic data. An ideal agrometeorological information system includes several components: an efficient data measuring and collection system; a modern telecommunication system; a standard data management processing and analysis system; and an advanced technological information dissemination system. While it is conventional wisdom that, Internet is and will play a major role in the delivery and dissemination of agrometeorological information, there are large gaps between the "information rich" and the "information poor" countries. Rural communities represent the "last mile of connectivity". For some time to come, TV broadcast, radio, phone, newspaper and fax will be used in many countries for communication. The differences in achieving this among countries arise from the human and financial resources available to implement this information and the methods of information dissemination. These differences must be considered in designing any information dissemination system. Experience shows that easy across to information more tailored to user needs would substantially increase use of climate information. Opportunities remain unexplored for applications of geographical information systems and remote sensing in agro meteorology.e sensing in agro meteorology.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1977-1982
• /
• 2012

Social network service user or smart phone user is very convenient, because there are supported to various social network services such as Facebook, Twitter, Flickr, Naver blog, Daum blog, and so on. This Is very good because they store multimedia datas that user wants to cyber space if they want it conveniently. But, if social network user increases, space of cloud storage increases sharply, and when social network service used user dies then they have big problems such as they did not know in existing. Typically, problems of notice, dissemination, storage, and inheritance for digital asset can happen representatively. Now, If successor send relation information of he and his dead user that is family to social network service provider then service provider checks it. And successor may can use, save and only backup are possible after confirm of family relation truth. Therefore, We wish to propose ADAM that successor may can inherit digital assets easily, conveniently, and safely in this paper. If someone use ADAM, successor submits information about dead and own family relation in the third certification party. And ADAM can be inherited freely and conveniently about digital assets as general assets passing through right inheritance process.

• Journal of Industrial Technology
• /
• v.27 no.B
• /
• pp.235-243
• /
• 2007

Sensor network is used to obtain sensing data in various area. The interval to sense the events depends on the type of target application and the amounts of data generated by sensor nodes are not constant. Many applications exploit long sensing interval to enhance the life time of network but there are specific applications that requires very short interval to obtain fine-grained, high-precision sensing data. If the number of nodes in the network is increased and the interval to sense data is shortened, the amounts of generated data are greatly increased and this leads to increased amount of packets to transfer to the network. To transfer large amount of packets fast, it is necessary that the delay between successive packet transmissions should be minimized as possible. In Sensor network, since the Operating Systems are worked on the event driven, the Timer Event is used to transfer packets successively. However, since the transferring time of packet completely is varies very much, it is very hard to set appropriate interval. The longer the interval, the higher the delay and the shorter the delay, the larger the fail of transfer request. In this paper, we propose ESTEO which reduces the delay between successive packet transmissions by using SendDone Event which informs that a packet transmission has been completed.In ESTEO, the delay between successive packet transmissions is shortened very much since the transmission of next packet starts at the time when the transmission of previous packet has completed, irrespective of the transmission timee. Therefore ESTEO could provide high packet transmission rate given large amount of packets.

• Journal of Internet Computing and Services
• /
• v.17 no.6
• /
• pp.17-23
• /
• 2016

In the future network such as Internet of Things (IoT), the number of computing devices are expected to grow exponentially, and each of the things communicates with the others and acquires information by itself. Due to the growing interest in IoT applications, the broadcasting in Opportunistic ad-hoc networks such as Machine-to-Machine (M2M) is very important transmission strategy which allows fast data dissemination. In distributed networks for IoT, the energy efficiency of the nodes is a key factor in the network performance. In this paper, we propose a fuzzy logic based probabilistic multi-hop broadcast (FPMCAST) algorithm which statistically disseminates data accordingly to the remaining energy rate, the replication density rate of sending node, and the distance rate between sending and receiving nodes. In proposed FPMCAST, the inference engine is based the fuzzy rule base which is consists of 27 if-then rules. It maps input and output parameters to membership functions of input and output. The output of fuzzy system defines the fuzzy sets for rebroadcasting probability, and defuzzification is used to extract a numeric result from the fuzzy set. Here Center of Gravity (COG) method is used to defuzzify the fuzzy set. Then, the performance of FPMCAST is evaluated through a simulation study. From the simulation, we demonstrate that the proposed FPMCAST algorithm significantly outperforms flooding and gossiping algorithms. Specially, the FPMCAST algorithm has longer network lifetime because the residual energy of each node consumes evenly.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.327-341
• /
• 2006

As we are getting to deal with more applications that generate streaming data such as sensor network, monitoring, and SDI (selective dissemination of information), active research is being conducted to support efficient processing of queries over streaming data. The applications on the Web environment like SDI, among others, require query processing over streaming XML data, and its investigation is very important because XML has been established as the standard for data exchange on the Web. One of the major problems with the previous systems that support query processing over streaming XML data is that they cannot deal adaptively with dynamically changing stream because they rely on static query plans. On the other hand, the stream query processing systems based on relational data model have achieved adaptiveness in query processing due to query operator routing. In this paper, we propose a system of adaptive query processing over streaming XML data in which the model of adaptive query processing over streaming relational data is applied. We compare our system with YFiiter, one of the representative systems that provide XML stream query processing capability, to show efficiency of our system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.215-221
• /
• 2011

Communication infrastructure of wireless sensor networks significantly tends to depend on application requirements. Gossip communication is becoming one of the promising solutions for addressing its scalability problems in providing information propagation functionality based on the P (publish)/S (subscribe) paradigm. In particular, despite the importance of both guaranteeing message delivery order required and supporting overlapping groups in sensor networks, there exist little research works on development of gossip-style dissemination protocols to satisfy all these requirements. In this paper, we present the latest causal information transmission protocol between publishers and subscribers for overlapping groups. In this protocol, sensor leaders as publishers might guarantee consistently causally ordered message delivery among themselves by aggregating causality information. On the other hand, only the latest causal information piggybacked on each multicast message is transmitted from publishers to subscribers through gossip-style dissemination. Its scalability feature might be highly suitable for the area of the applications requiring only the minimum meaningful information.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.6
• /
• pp.1297-1307
• /
• 2013

Several multi-hop applications developed for vehicular ad hoc networks use broadcast as a means to either discover nearby neighbors or disseminate useful traffic information to othet vehicles located within a certain geographical area. However, the conventional broadcast mechanism may lead to the so-called broadcast storm problem, a scenario in which there is a high level of contention and collision at the link layer due to an excessive number of broadcast packets. To solve broadcast storm problem, we propose an RPB-MACn-based LV-CAST that is a vehicular broadcast algorithm for disseminating safety-related emergency message. The proposed LV-CAST identifies the last node within transmission range by computing the distance extending on 1 hop from the sending node of an emergency message to the next node of receiving node of the emergency message, and the last node only re-broadcasts the emergency message. The performance of LV-CAST is evaluated through simulation and compared with other message dissemination algorithms.