• Journal of the Korean Society of Clothing and Textiles
• /
• v.47 no.4
• /
• pp.760-777
• /
• 2023

Fashion brands seek guidelines for effective green advertising messages, considering benefit appeals, brand types, and construal level. However, few studies have explored their simultaneous interplay. Thus, the present study conducted an experiment with a 2X2X2 between-subjects design to investigate how brand type and construal level moderate the mediating role of ad-brand congruency between benefit appeals and purchase intention. A total of 245 Millennials and Generation Z participants completed an online survey, and the data were analyzed using SPSS. A significant three-way interaction was revealed. Low-construal-level messages with concrete content showed disparities between aspirational and accessible brands concerning other-benefit appeals: Accessible brands utilizing other-benefit appeals demonstrated higher ad-brand congruency, while aspirational brands had lower ad-brand congruency. Furthermore, within aspirational brands, self-benefit appeals resulted in higher ad-brand congruency than other-benefit appeals. Finally, a moderated mediating effect was discovered, indicating that brand types and construal level moderated the mediating effect of ad-brand congruency between benefit appeals and purchase intention. The mediating effect was prominent in the context of self-benefit appeals, aspirational brands, and low-construal-level messages. This study highlights the intricate dynamics of the three factors in green advertising, providing valuable insights for crafting more targeted green advertisements.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.62-69
• /
• 2004

The cluster structure reduces the number of retransmission messages, when a broadcast to all hosts in ad hoc network is needed. A cluster maintenance scheme is employed to preserve this advantage from time to time. However, most of the cluster maintenance schemes require additional control messages for cluster reformation as well as control messages for acquiring neighbor information. This mitigates the advantages of employing cluster structure in ad hoc network. In this paper, a cluster maintenance scheme which forces only clusterheads to broadcast control messages during hello time is proposed. When the cluster reformation is needed, the proposed scheme employs a strategy to reduce the control messages to a minimum. In these processes, the proposed scheme doesn't violate the definition of 2-cluster and produces the clusters in fully distributed method. The simulation results prove that our scheme is better than LCC(1).

• The Journal of the Convergence on Culture Technology
• /
• v.4 no.4
• /
• pp.89-94
• /
• 2018

The study analyzed the characteristics of anti-smoking advertisements in Korea and examined if these characteristics were appropriate in terms of their effects. 68 TV anti-smoking ads were content-analyzed, focusing on ad appeal, message frame, message orientation, communication goal, and ad type. According to research, TV anti-smoking ads in Korea used messages that had the following characteristics: First, physical type messages that emphasize the effects of smoking on health, second negative frame messages that show negative consequences of smoking, third self-oriented messages that emphasize the consequences of smoking on oneself, fourth messages that intend to change attitude toward the smoking, and fifth storytelling techniques. Based on the results of previous ansi-smoking ad effect research, practical implications were discussed to enhance the effectiveness of the nation's anti-smoking advertisements.

• Asia pacific journal of information systems
• /
• v.30 no.4
• /
• pp.695-718
• /
• 2020

Based on the Construal Level Theory, we aim to study a most favorable fit among the advertising model, media type, and message construals, which are important factors in an advertisement. A two (social distance of the ad model in an ad: distal (low similarity) vs proximal (high similarity) by two (social distance of a media type: distal (portal) vs. proximal (SNS)) by two (message construal: abstract vs concrete) laboratory experiment was conducted to examine attitude changes on ad messages. The results show that abstract messages were more effective in attitude toward advertisement and purchase intention under the distal social distance (i.e. advertising model in low-similarity and portal media type) while concrete messages were so under the proximal social distance and SNS media type.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.223-226
• /
• 2003

In this paper, we propose new agent discovery and route discovery schemes to support Mobile IP (MIP) in Ad Hoc networks with wireless backbone. The wireless backbone consisting of stationary wireless routers and Internet gateways (IGs) is a kind of wireless access network of IP-based core network. The proposed scheme utilizes favorable features of wireless backbone such as stable links and no energy constraints. In the agent discovery scheme, backbone-limited periodic Agent Advertisement (AA) and proxy-AA messages are used, which reduce network-wide broadcasting overhead caused by AA and Agent Solicitation messages and decentralize MIP processing overhead in IGs. In order to reduce delay time and control message overhead during route discovery far the destination outside Ad Hoc network, we propose a cache-based scheme which can be easily added to the conventional on-demand routing protocols. The proposed schemes can reduce control overhead during agent discovery and route discovery, and efficiently support MIP in Ad Hoc network with wireless backbone.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.336-346
• /
• 2001

A wireless ad-hoc network is a temporal network formed by a collection of wireless mobile nodes without the aid of any existing network infrastnlcture or centralized administration. Currently, numerous routing protocols have been developed for changing messages between nodes in a wireless ad-hoc network. Applications of wireless ad-hoc network technology are various and proper routing protocol must be used according to application domain or network size. In a wireless ad-hoc network. some hosts want services from fixed networks. For supporting such services, it is necessary to interconnect wireless ad-hoc networks and fixed networks. The DSMIHDynamic Source Multipath Routing) protocol, proposed in this paper, focuses on supporting seamless communication services between the nodes within a wireless ad-hoc network and providing fixed networks to the mobile hosts in wireless an-hoc networks. In DSMR protocol, each node need not broadcast routing messages periodically. and mobile hosts that to send data packets initiate route request and route establishment procedure. By maintaining multiple paths in each node. faster route re-establishment is also possible in our scheme.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.05a
• /
• pp.82-83
• /
• 2022

Ad-hoc On-demand Distance Vector (AODV), is one of well-designed routing protocols in mobile ad hoc networks. It supports the functionality of node mobility modules through multiple control messages to create and maintain paths for data transfer. Even though a number of studies have been conducted to achieve rapid discovery of paths across the network, but few have focused on impact of control messages. This paper proposes a method to adjust the transmission time of messages used in path recovery according to their individual characteristics. Simulation results show the improved performance of the proposed algorithm rather than traditional AODV routing protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.7
• /
• pp.605-611
• /
• 2013

If an accident vehicle propagates emergency messages to other vehicles close to it, the other drivers may realize and avoid the accident spot. In this letter, we propose a broadcast scheme to propagate emergency messages fast in urban VANETs (Vehicular Ad-Hoc Networks) with the help of GPS (Global Position System). In our scheme, a transmitting vehicle chooses the farthest node as the next relay vehicle to propagate emergency messages. And, we suggest an algorithm for intersection recognition and SCF (Store-Carry-Forward) task by taking advantage of periodic hello packets to reduce the propagation time and enhance the delivery ratio.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8A
• /
• pp.639-648
• /
• 2005

A wireless ad-hoc network is a temporal network formed by a collection of wireless mobile nodes without the aid of any existing network infrastructure or centralized ad-ministration. Numerous routing protocols have been developed for changing messages among the nodes in a wireless ad-hoc network. Some multi-path routing protocols have also been proposed to support load balancing and QoS for wireless ad-hoc networks. In this paper, we propose not only an efficient routing algorithm for wireless ad-hoc net-worts but also a protocol that can improve data transmission rate and reduce end-to-end delay. In our protocol, each mobile node need not broadcast routing messages periodically and the mobile node that wants to send data packets initiates route request and route establishment procedure. By simulation, we showed that faster route recovery is possible by maintaining multiple routing paths in each node, and the route maintenance overhead can be reduced by limiting the number of multiple routing paths.