• 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.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.822-827
• /
• 2009

As research for URC robot to advance the robot system dissemination and pracical use becomes active, also interest for robot platform and standardization is increasing. However, URC robot middleware does not involve a convergence with IT. Although it seems to be a high connection between robots and IT, the existing middleware has not considered different environments, thus making convergence efforts difficult. The middleware should improve their functions in order to synchronize with IT and to interact through formatted messages. In this paper, we present the necessity of the formatted message in the development of URC platform. In addition, design of the message protocol for the convergence based on the analysis of RUPI, OPC and SECS-II.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.423-434
• /
• 2007

Vehicular ad-hoc network (VANET), a kind of mobile ad-hoc network (MANET), is a key technology for building intelligent transportation system (ITS). VANET is automatically and temporarily established through vehicle-to-vehicle communication without network infrastructure. It has the characteristics that frequent changes of network topology and node density are occurred and messages are disseminated through several relay nodes in the network. Due to frequent change of network topology and node density, however, VANET requires an effective relay node selection scheme to disseminate messages through the multi-hop broadcast. In this paper, we propose a contention window based multi-hop broadcast scheme for VANET. Each node has an optimized contention window and competes with each other for a relay node. The experimental results show that the proposed scheme has a better performance than the distance-based deterministic broadcast scheme in terms of message propagation delay and network traffic.

• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.188-200
• /
• 2006

Once a continuous query, which is commonly used in sensor networks, is issued, the query is executed many times with a certain interval and the results of those query executions are collected to the base station. Since this comes many communication messages continuously, it is important to reduce communication cost for collecting data to the base station. In sensor networks, in-network processing reduces the number of message transmissions by partially aggregating results of an aggregate query in intermediate nodes, or merging the results in one message, resulting in reduction of communication cost. In this paper, we propose a routing tree for sensor nodes that qualify the given query predicate, called the query specific routing tree(QSRT). The idea of the QSRT is to maximize in-network processing opportunity. A QSRT is created seperately for each query during dissemination of the query. It is constructed in such a way that during the collection of query results partial aggregation and packet merging of intermediate results can be fully utilized. Our experimental results show that our proposed method can reduce message transmissions more than 18% compared to the existing one.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.5 no.1
• /
• pp.39-45
• /
• 2010

As wireless sensor network are being deployed in a wide variety of application areas, the number of sensor nodes in a sensor filed becomes larger and larger. In the past, ISP (In-System Programming) method have been generally used for code update but the large number of sensor nodes requires a new code update method called network reprogramming. There are many challenging issues for network reprogramming since it can make an impact on the network lifetime. In this paper, a new sender selection scheme for network reprogramming protocol is proposed to decrease energy consumption for code update by minimizing overlapped area between sender nodes and reducing data contention. Simulation results show that the proposed scheme can reduce the amount of message traffic and the overall data transmission time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.706-714
• /
• 2010

In wireless sensor networks, real-time data delivery schemes typically achieve a desired delivery speed by performing one-hop lookahead. Recently, to reduce the deadline miss ratio against the desired delivery speed, a study has proposed a real-time routing protocol based on proactively performing two-hop lookahead. However, the study might cause heavy message exchange overhead and high computing complexity to carry out obtainment of two-hop neighborhood speed information in the entire sensor nodes whether data are delivered or not. Moreover, although multi-hop lookahead provides the least deadline miss ratio, due to the restriction from the overhead and the complexity, the recent study merely adopts the two-hop lookahead manner. In this paper, we propose a novel real-time routing protocol that adopts on-demand neighborhood multi-hop information obtainments only around data forwarding paths. Simulation results prove that the proposed routing protocol offers better performances with respect to deadline miss ratio, total communication costs, energy efficiency, and network lifetime.

• Journal of Korea Society of Industrial Information Systems
• /
• v.13 no.5
• /
• pp.168-177
• /
• 2008

The code propagation is one of the most important technic for software update in wireless sensor networks. This paper presents a new scheme for code propagation using network coding. The proposed code propagation method roughly shows 20$\sim$25% performance improvement according to network environments in terms of the number of data exchange compared with the previously proposed pipelining scheme. As a result, we can efficiently perform the software update from the viewpoint of speed, energy, and network congestion when the proposed code propagation system is applied. In addition, the proposed system solves the overhearing problems of network coding such as the loss of original messages and decoding error using the predefined message. Therefore, our system allows a software update system to exchange reliable data in wireless sensor networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6C
• /
• pp.483-491
• /
• 2012

In vehicle-to-vehicle (V2V) communications, each vehicle should periodically disseminate a beacon message including the kinematics information, such as position, speed, steering, etc., so that a neighbor vehicle can better perceive and predict the movement of the vehicle. However, a simple broadcasting of such messages may lead to a low reception probability as well as an excessive delay. In this paper, we attempt to analyze the impact of the following key parameters of the beacon dissemination on the performance of vehicular networks: beacon period, carrier-sensing range, and contention window (CW) size. We first derive a beacon period which is inversely proportional to the vehicle speed. Next, we mathematically formulate the maximum beacon load to demonstrate the necessity of the transmit power control. We finally present an approximate closed-form solution of the optimal CW size that leads to the maximum throughput of beacon messages in vehicular networks.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.13 no.5
• /
• pp.51-70
• /
• 2017

The reliability of broadcasting over vehicular ad hoc networks (VANETs) is one of the most critical factors for driving safety applications. There exists limitations to improve the reliability of broadcast transmissions in saturated VANETs where previous proposals in literature tackle the problem by heuristically adapting the size of the contention window (CW). This paper considers improving the reliability by proposing a new probability model based on the counting methods of permutations and combinations, which counts all the possible cases of broadcast failures in a single-hop broadcast transmission for a given CW. From the model, we calculate the best CW size given the number of contention nodes, which significantly improves the reliability and satisfying the timely dissemination of emergency broadcasting messages. Through extensive VANET simulations with varying densities, we show that our model maintains near 100 percent success rate for single-hop broadcast as well as multi-hop broadcast (e.g. 40 hops) and achieves minimal broadcast delay.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.24 no.4
• /
• pp.75-90
• /
• 2013

Given the context that users are actively using social media with multimedia embedded information, the purpose of this study is to demonstrate how images are used within Twitter messages, especially in influential and favorited messages. In order to achieve the purpose of this study, the top 200 influential and favorited messages with images were selected out of 1,589 tweets related to "Boston bombing" in April 2013. The characteristics of the message, image use, and user are analyzed and compared. Two phases of the analysis were conducted on three data sets containing the top 200 influential messages, top 200 favorited messages, and general messages. In the first phase, coding schemes have been developed for conducting three categorical analyses: (1) categorization of tweets, (2) categorization of image use, and (3) categorization of users. The three data sets were then coded using the coding schemes. In the second phase, comparison analyses were conducted among influential, favorited, and general tweets in terms of tweet type, image use, and user. While messages expressing opinion were found to be most favorited, the messages that shared information were recognized as most influential to users. On the other hand, as only four image uses - information dissemination, illustration, emotive/persuasive, and information processing - were found in this data set, the primary image use is likely to be data-driven rather than object-driven. From the perspective of users, the user types such as government, celebrity, and photo-sharing sites were found to be favorited and influential. An improved understanding of how users' image needs, in the context of social media, contribute to the body of knowledge of image needs. This study will also provide valuable insight into practical designs and implications of image retrieval systems or services.