• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.51-63
• /
• 2013

Recently with base apply MANET with the application for the service discovery and delivery which are various techniques are being proposed the result of such MANET base research techniques from actual inside. This dissertation proposes T-Chord(Trustworthy-based Chord) Ring system for MANET to guarantees from such requirements. T-Chord Ring system in order to manage Efficiently the services which the mobile nodes provide is the service discovery system which uses P2P overlay network Technique in mobile environment. The system which is proposed MANET communications in order to accomplish a service discovery operation with physical network class and logical network class will be able to minimize problems from about MANET service discoveries, and uses the dispersive hash table technique for a service discovery and effectiveness of service discovery improves and will be able to guarantee the expandability of network size. The mobile nodes(mobile device) have a mobility from MANET and operate with service request node, service provide node and service transmit node. The mobile nodes will be able to elect cluster header using Trustworthy that was evaluated service request, provision and delivery in each other. The system which is proposed a service discovery and a delivery efficiently will compose the cluster head which will grow of P2P overlay networks and will be able to accomplish. The system which proposes from dissertation is composed of Trustworthy evaluations of MANET mobile nodes, service information collection which is dispersed and P2P overlay networks that composed of Chord algorithm modules which provide O(Log N) efficiencies. The system comparison evaluation analyzes an efficiency from the expandability side of effectiveness and the network of service discovery technique and the service discovery message over head, service discovery and delivery of former times and service discovery and delivery is excellent gives proof from MANET.

• Journal of Internet Computing and Services
• /
• v.19 no.1
• /
• pp.37-47
• /
• 2018

The number of capabilities of Internet of Things (IoT) devices will exponentially grow over the next years. These devices may generate a vast amount of time-constrained data. In the context of IoT, data management should act as a layer between the objects and devices generating the data and the applications accessing the data for analysis purposes and services. In addition, most of IoT services will be content-centric rather than host centric to increase the data availability and the efficiency of data delivery. IoT will enable all the communication devices to be interconnected and make the data generated by or associated with devices or objects globally accessible. Also, fog computing keeps data and computation close to end users at the edge of network, and thus provides a new breed of applications and services to end users with low latency, high bandwidth, and geographically distributed. In this paper, we propose Edge-Fog cloud-based Hierarchical Data Delivery ($EFcHD^2$) method that effectively and reliably delivers IoT data to associated with IoT applications with ensuring time sensitivity. The proposed $EFcHD^2$ method stands on basis of fully decentralized hybrid of Edge and Fog compute cloud model, Edge-Fog cloud, and uses information-centric networking and bloom filters. In addition, it stores the replica of IoT data or the pre-processed feature data by edge node in the appropriate locations of Edge-Fog cloud considering the characteristic of IoT data: locality, size, time sensitivity and popularity. Then, the performance of $EFcHD^2$ method is evaluated through an analytical model, and is compared to fog server-based and Content-Centric Networking (CCN)-based data delivery methods.

• Journal of KIISE
• /
• v.44 no.10
• /
• pp.1062-1070
• /
• 2017

Real-time transmission studies in wireless sensor networks propose a mechanism that exploits a node that has a higher delivery speed than the desired delivery speed in order to satisfy real-time requirement. The desired delivery speed cannot guarantee real-time transmission in a congested area in which none of the nodes satisfy the requirement in one hop because the desired delivery speed is fixed until the packet reaches the sink. The feature of this mechanism means that the packet delivery speed increases more than the desired delivery speed as the packet approaches closer to the sink node. That is, the packet can reach the sink node earlier than the desired time. This paper proposes an improved real-time transmission by controlling the delivery speed using the temporal gain which occurs on the packet delivery process. Using the received data from a previous node, a sending node calculates the speed to select the next delivery node. The node then sends a packet to a node that has a higher delivery speed than the recalculated speed. Simulation results show that the proposed mechanism in terms of the real-time transmission success ratio is superior to the existing mechanisms.

• The Korean Journal of Applied Statistics
• /
• v.28 no.5
• /
• pp.977-990
• /
• 2015

Food delivery services are well developed in the Republic of Korea, The increase of one person households and the success of app applications influence delivery services these days. We consider a prediction model for the food delivery service based on weather and dates to predict the number of food delivery services in 2014 using various data mining techniques. We use linear regression, random forest, gradient boosting, support vector machines, neural networks, and logistic regression to find the best prediction model. There are four categories of food delivery services and we consider two methods. For the first method, we estimate the total number of delivery services and the posterior probabilities of each delivery service. For the second method, we use different models for each category and combine them to estimate the total number of delivery services. The neural network and linear regression model perform best in the first method, this is followed by the neural network which is the best for the second method. The result shows that we can estimate the number of deliveries accurately based on dates and weather information.

• Information Systems Review
• /
• v.3 no.1
• /
• pp.47-60
• /
• 2001

• Journal of the Korean Society for information Management
• /
• v.21 no.2
• /
• pp.269-283
• /
• 2004

The importance of an efficient information delivery service cannot be overemphasized in the information society. In this context, this study, based upon the importance of information intermediary on the internet, tries to suggest the use of Avatars in information services. This study first examines the concepts, theories, and characteristics of information services and internet, along with the meaning and role played by Avatars. Also, by suggesting the use of Avatars in information services, this study alms at enhancing our understanding on the internet and providing efficient information services.

• Journal of Intelligence and Information Systems
• /
• v.28 no.4
• /
• pp.119-133
• /
• 2022

One of the most important current features of food related industry is the growth of food delivery service. Another notable food related culture is, with the advent of Youtube, the popularity of Mukbang, which refers to content that records eating. Based on these background, this study intended to focus on two things. First, we tried to see the impact of Youtube Mukbang and the sentiments of Mukbang comments on the number of related food deliveries. Next, we tried to set up the predictive modeling of chicken delivery order with machine learning method. We used Youtube Mukbang comments data as well as weather related data as main independent variables. The dependent variable used in this study is the number of delivery order of fried chicken. The period of data used in this study is from June 3, 2015 to September 30, 2019, and a total of 1,580 data were used. For the predictive modeling, we used machine learning methods such as linear regression, ridge, lasso, random forest, and gradient boost. We found that the sentiment of Youtube Mukbang and comments have impacts on the number of delivery orders. The prediction model with Mukban data we set up in this study had better performances than the existing models without Mukbang data. We also tried to suggest managerial implications to the food delivery service industry.

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

• 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 Korea Institute of Information Security & Cryptology
• /
• v.22 no.6
• /
• pp.1283-1292
• /
• 2012

As delivery services market has grown the damage cases are also continuously increased. When using delivery services, Customers would not be compensated in any way. Perhaps worse, losing a cargo would create a great deal of trouble. Because the lack of evidence, they takes a lot of time to clarify who is responsible. To prevent these things, we must create, collect, maintain and confirm. In this paper, we introduce new delivery system with a trusted third party for non-repudiation services. Moreover, in damage case, we show that the proposed system is efficient and provide non-repudiation. Using sending and receiving codes, the proposed system identifies a responsible subject with quickness and clearness.