• Journal of the Korea Society for Simulation
• /
• v.15 no.3
• /
• pp.69-77
• /
• 2006

Geocasting is a form of communication that transmits messages to all nodes within a given geographical region(i.e., the geocasting region). Most of conventional onery aware protocols were based on shortest-hop routing that is, they minimized the cost in terms of the distance and total transmission energy not considering both the residual energy at each node and the link error ratio when selecting the routes for communication. In this paper we propose a MLRG(Maximum Lifetime Reliable Geocast) protocol for energy-efficient and reliable geocasting in Ad-hoc networks. The proposed MLRG, a position-based and routing-based geocasting algorithm, maximizes the network lifetime using newly defined cost function and selecting the energy balanced routes on the basis of each node's residual energy, and provides a reliable communication considering the link error ratio.

• Electronics and Telecommunications Trends
• /
• v.37 no.5
• /
• pp.44-53
• /
• 2022

The Internet of Things (IoT) is growing exponentially, with the number of IoT devices multiplying annually. Accordingly, the paradigm is changing from cloud computing to edge computing and even tiny edge computing because of the low latency and cost reduction. Machine learning is also shifting its role from the cloud to edge or tiny edge according to the paradigm shift. However, the fragmented and resource-constrained features of IoT devices have limited the development of artificial intelligence applications. Edge MLaaS (Machine Learning as-a-Service) has been studied to easily and quickly adopt machine learning to products and overcome the device limitations. This paper briefly summarizes what Edge MLaaS is and what element of research it requires.

• Journal of Aerospace System Engineering
• /
• v.14 no.5
• /
• pp.9-17
• /
• 2020

Mobile robots, including UAVs perform missions with limited fuel. Therefore, the energy-aware path planning is required to maximize efficiency when the robot is operated for a long time. In this study, we estimated the power consumption for each maneuver of a quadcopter UAV in the 3D environment and applied to the cost functions of D^⁎ Lite. The simulations were performed in a 3D environment that is similar to the industrial sites. The efficiency of path generation was high when the energy-aware path planning with simplified heuristic was applied. In addition, the energy-aware path was generated 19.3 times faster than the shortest path with a difference within 3.2%.

• Spatial Information Research
• /
• v.19 no.1
• /
• pp.127-133
• /
• 2011

Recently, with the advances in sensor techniques and net work computing, Ubiquitous Sensor Network (USN) has been received a lot of attentions from various communities. The sensor nodes distributed in the sensor network tend to continuously generate a large amount of data, which is called stream data. Sensor stream data arrives in an online manner so that it is characterized as high-speed, real-time and unbounded and it requires fast data processing to get the up-to-date results. The data stream has many application domains such as traffic analysis, physical distribution, U-healthcare and so on. Therefore, there is an overwhelming need of a USN middleware for processing such online stream data to provide corresponding services to diverse applications. In this paper, we propose a novel USN middleware which can provide users both context-aware service and meaningful sequential patterns. Our proposed USN middleware is mainly focused on location based applications which use stream location data. We also show the implementation of our proposed USN middleware. By using the proposed USN middleware, we can save the developing cost of providing context aware services and stream sequential patterns mainly in location based applications.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.9
• /
• pp.1799-1805
• /
• 2007

Wireless Ad-hoc networks may contain nodes of various types of which many can have limited power capabilities. A failure of a node due to energy exhaustion may impact the performance of the whole network hence, energy must be conserved. In this paper, we propose a Delay and Energy-Aware Routing (DEAR) algorithm a multiple metric path cost routing algorithm which considers not only the energy consumed by the node during transmission and reception but as well as the residual energy of the node and the delay incurred during route discovery. Based on our results, DEAR algorithm performs well and maximizes network lifetime by routing flows to nodes with sufficient energy such that the energy consumption is balanced among nodes in proportion to their energy reserves.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.11
• /
• pp.599-609
• /
• 2007

Due to the restrictions of Flash memory such as overwrite limitation and write/erase operational unit differences, block cleaning is required in Flash memory based file systems and known as a key factor on the performance of file systems. In this paper, we identify three parameters, namely utilization, invalidity and uniformity, and analyze how the parameters affect the cost of block cleaning. The analysis show that as uniformity degrades, the cost of block cleaning increases drastically. To overcome this problem, we design a new modification-aware(MODA) page allocation scheme that strives to keep uniformity high by separating frequently-updating data from infrequently-updating data. Real implementation experiments conducted on an embedded system show that the MODA scheme can actually enhance uniformity of Flash memory, which consequently leads to reduce the cost of block cleaning with an average of 123%, compared to the traditional sequential allocation scheme that is used in YAFFS.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.263-277
• /
• 2005

In this paper, we introduce algorithms for constructing broadcasting and multicasting trees. These algorithms are general because they may be used for tree cost functions that are of arbitrary form. Thus, essentially the same algorithmic procedures are used for different tree cost functions. We evaluate the effectiveness of the general algorithms by applying them to different cost functions that are often used to model wired and wireless net­works. Besides providing a unifying framework for dealing with many present and future tree-construction applications, these algorithms typically outperform some existing algorithms that are specifically designed for energy-aware wireless networks. These general algorithms perform well at the expense of higher computational complexity. They are centralized algorithms, requiring the full network information for tree construction. Thus, we also present variations of these general algorithms to yield other algorithms that have lower complexity and distributed implementation.

• International Journal of Contents
• /
• v.7 no.2
• /
• pp.1-5
• /
• 2011

Allocation of computing resources is a crucial issue when dealing with a huge number of tasks to be completed according to a given deadline and cost constraints. The task scheduling to several resources (e.g. grid, cloud or a supercomputer) with different characteristics is not trivial, especially if a trade-off in terms of time and cost is considered. We propose an allocation approach able to fulfill the given requirements about time and cost through the use of optimizing techniques and an adaptive behavior. Simulated productions of tasks have been run in order to evaluate the characteristics of the proposed approach.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.1248-1251
• /
• 2011

Web Service technologies make the automation of business activities that are distributed across multiple enterprises possible. Existing extended transaction protocols typically resort to compensation actions to regain atomicity and consistency. A reservation-based transaction protocol is proposed to reduce high compensation risk. However, for a serial long running transaction processing, the resource that is reserved in the early stage may be released due to resource holding time expires. Therefore, our analysis theoretically illustrates a scheduling scheme that tries to prevent the loss of resource holding as well as gain an optimized execution plan with minimum compensation cost. In order to estimate cost of different schedules, we set up a costing model and cost metric to quantize compensation risk.

• Journal of information and communication convergence engineering
• /
• v.5 no.2
• /
• pp.104-108
• /
• 2007

Ad hoc networks are a type of mobile network that function without any fixed infrastructure. One of the weaknesses of ad hoc network is that a route used between a source and a destination is to break during communication. To solve this problem, one approach consists of selecting routes whose nodes have the most stable link cost. This paper proposes a method for improving the low power distributed MAC. This method is based on the context awareness of the each nodes energy in clustering. We propose to select a new scheme to optimize energy conserving between the clustering nodes in MANET. And this architecture scheme would use context-aware considering the energy related information such as energy, RF strength, relative distances between each node in mobile ad hoc networks. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission. Also, by using the context aware computing, according to the condition and the rules defined, the sensor nodes could adjust their behaviors correspondingly to improve the network routing.