• Journal of the Korea Fashion and Costume Design Association
• /
• v.15 no.1
• /
• pp.75-89
• /
• 2013

The purpose of this study is to verify the mediating effect of store benevolence for impact on store loyalty of store environment and store personality. For this study, data were collected through questionnaires. The survey ran from March to May, 2011, the total of 330 respondents was used in analysis. The subjects consisted of adults living in the Daegu and Gyeongsangbuk-do region, and convenience sampling. For statistical analysis, SPSS 19.0 were used to verify the study model. The major results of the study show that store benevolence may play a linkage role of store environment, store personality on store loyalty. The store benevolence variable has the effect of partial mediation. The analysis of relationship between the variables of store environment (convenience, information service accessibility, accessibility, variation) and the store type show significant differences store environment (convenience, information service and the store type). The analysis of relationship between the variables of store personality(warm, fun, sophisticated, forward-looking) and the store type show significant differences store personality (warm, fun, sophisticated, forward-looking) and store type. The analysis of relationship between the variables of store environment(convenience, information service accessibility, accessibility, variation), and the demographic variables show significant differences in store environment (information service accessibility) regarding only age. The analysis of relationship between the variables of store personality(warm, fun, sophisticated, forward-looking) and the demographic variable show significant differences in store personality(warm) regarding only age (accessibility, accessibility, variation).

• IEMEK Journal of Embedded Systems and Applications
• /
• v.8 no.6
• /
• pp.329-337
• /
• 2013

In multihop routed ad hoc networks, the conventional store-and-forward delivery has been used. However, we may ask a question: "Is the store-and-forward delivery still the best?" This paper presents a pipeline-through MAC (PT-MAC) protocol for ad hoc networks, in which nodes have two 3-channel interfaces in order to use limited radio resources efficiently and improve network performance. The proposed protocol reduces end-to-end delay significantly in multihop routed transmission by exploiting a novel pipeline-through technique rather than using the conventional store-and-forward. This results in improved network performance without increasing control overhead. Our extensive performance study shows that the proposed PT-MAC shows 20-40 percent shorter end-to-end delay and 25-55 percent better goodput compared to the IEEE 802.11 DCF with two 3-channel interfaces.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.31-35
• /
• 2015

The IoE service process for maximizing efficiency of information storage and utilization classifies in step five which are interconnected, data collection, storage, organize, analyze, and share. Two key processing elements are store and forward. Keeping the useful knowledge in safe location is "store processing", and utilization of stored useful knowledge is defined as "forward processing" during the IoE service process. Where, past experience data can tell us how to prepare the future utilization. That is, past experience is organized store processing, and preparation for the future is shared forward processing through analysis. To maximize the utilization and storage of information effectively, the various methodologies for IoE service process propose and research in this paper.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.619-621
• /
• 2001

현재 대부분의 액티브 네트워크에서 액티브 노드로 전송된 패킷은 프로그램 코드와 데이터를 동시에 가지고 있으며, 기존 네트웍 방식에서의 저장(store)-전송(forward) 형태와는 달리 저장(store)-연산(compute)-전송(forward) 방식으로 패킷 처리를 한다 이 과정에서 패킷에 악성 코드가 추가되거나 실제 데이터가 변경되는 경우에는 데이터의 무결성을 보장할 수 없다. 따라서 이 논문에서는 액티브 노드에 들어오는 패킷과 그 노드에서 처리가 이루어진 후 나가는 패킷을 비교하여 악의적이거나 악의 적이지는 않지만 실수로 인한 패킷의 오류를 방어함으로서 액티브 노드의 QoS를 향상시켜주는 방식을 제안한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.907-909
• /
• 2016

In this peper, we proposed efficient network structure using UAV squad in DTN. In Delay Tolerant Network(DTN), the routing protocols adopting store-carry-forward method are used for solving network problem occurred by the unstable network environments. This routing method is useful for work in disaster and battle field so many researches are in progress. This paper is part of that, we use UAV squad in DTN which is dynamic environments for efficient network structure. Propsed measure use environment information in disparate sensor node and organize UAV squad for stable network.

• Journal of information and communication convergence engineering
• /
• v.9 no.6
• /
• pp.625-628
• /
• 2011

Dynamic sensor network(DSN) technology which is based on swarming flight type air node offers analyzed and acquired information on target data gathered by air nodes in rotation flight or 3 dimension array flight. Efficient operation of dynamic sensor network based on air node is possible when problems of processing time, data transmission reliability, power consumption and intermittent connectivity are solved. Delay tolerant network (DTN) can be a desirable alternative to solve those problems. DTN using store-and-forward message switching technology is a solution to intermittent network connectivity, long and variable delay time, asymmetric data rates, and high error rates. However, all processes are performed at the bundle layer, so high power consumption, long processing time, and repeated reliability technique occur. DSN based on swarming flight type air node need to adopt store-and-forward message switching technique of DTN, the cancelation scheme of repeated reliability technique, fast processing time with simplified layer composition.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.316-330
• /
• 2008

This paper proposes a novel method for transporting various types of user traffic effectively over the next generation network called integrated services digital network 3 (ISDN3) (or quantum network) using quantum packets. Basically, a quantum packet comprises one or more 53-byte quanta as generated by a "quantumization" process. While connection-oriented traffic is supported by fixed-size quantum packets each with one quantum to emulate circuit switching, connectionless traffic (e.g., IP packets and active packets) is carried by variable-size quantum packets with multiple quanta to support store-and-forward switching/routing. Our aim is to provide frame-like or datagram-like services while enabling cell-based multiplexing. The quantum packet method also establishes a flexible and extensible framework that caters for future packetization needs while maintaining backward compatibility with ATM. In this paper, we discuss the design of the quantum packet method, including its format, the "quantumization" process, and support for different types of user traffic. We also present an analytical model to evaluate the consumption of network resources (or network costs) when quantum packets are employed to transfer loss-sensitive data using three different approaches: cut-through, store-and-forward and ideal. Close form mathematical expressions are obtained for some situations. In particular, in terms of network cost, we discover two interesting equivalence phenomena for the cut-through and store-and-forward approaches under certain conditions and assumptions. Furthermore, analytical and simulation results are presented to study the system behavior. Our analysis provides valuable insights into the. design of the ISDN3/quantum network.

• Journal of KIISE:Information Networking
• /
• v.36 no.2
• /
• pp.130-136
• /
• 2009

Delay and Disruption Tolerant Network (DTN) employs message delivery based on a store-and-forward method to conquer no guarantee of continuous end-to-end connectivity. Different from general networks, it is hard for the existing TCP/IP-based routing protocols to correctly work, due to the characteristics such as large latency and unstable link connectivity. Thus, many recent studies focus on routing protocols for DTN. In this paper, we propose a novel routing protocol for DTN with efficient message delivery utilizing mobility information such as direction or destination of mobile nodes. And this protocol is enhanced in terms of delivery ratio, decreases latency and overhead compared to the previously proposed solutions. Simulation results prove its superiority.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.11
• /
• pp.105-111
• /
• 2009

The study aims to propose the intelligent clustering technique that calculates the distance by improving the problems of multi-hop clustering technique for inter-vehicular secure communications. After calculating the distance between vehicles with no connection for rapid transit and clustering it, the connection between nodes is created through a set distance vale. Header is selected by the distance value between nodes that become the identical members, and the information within a group is transmitted to the member nodes. After selecting the header, when the header is separated due to its mobility, the urgent situation may occur. At this time, the information transfer is prepared to select the new cluster header and transmit it through using the intelligent cluster provided from node by the execution of programs included in packet. The study proposes the cluster technique of the intelligent distance estimation for the mobile Ad-hoc network that calculates the cluster with the Store-Compute-Forward method that adds computing ability to the existing Store-and-Forward routing scheme. The cluster technique of intelligent distance estimation for the mobile Ad-hoc network suggested in the study is the active and intelligent multi-hop cluster routing protocol to make secure communications.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.7
• /
• pp.153-158
• /
• 2016

Delay Tolerant Network (DTN) is a network that employed method of store-carry-forward in intermittently connected networks. In DTNs, routing and buffer management scheme are important to improve successful message delivery. This paper proposes an improve spray and wait routing protocol based on delivery probability to a destination. Also, a buffer management scheme is proposed to drop the queued messages according to the number of copies (L value). Simulation results show that the proposed method provides a better delivery ratio and lower communication overhead when compared to existing schemes such as Epidemic, PRoPHET and spray and wait.