• Journal of KIISE
• /
• v.44 no.2
• /
• pp.213-222
• /
• 2017

The Internet of Things (IoT) technology is rapidly developing in recent years, and is applicable to various fields. A smart factory is one wherein all the components are organically connected to each other via a WSN, using an intelligent operating system and the IoT. A smart factory technology is used for flexible process automation and custom manufacturing, and hence needs adaptive network management for frequent network fluctuations. Moreover, ensuring the timeliness of the data collected through sensor nodes is crucial. In order to ensure network timeliness, the power consumption for information exchange increases. In this paper, we propose an IEEE 802.15.4e DSME-based distributed scheduling algorithm for mobility support, and we evaluate various performance metrics. The proposed algorithm adaptively assigns communication slots by analyzing the network traffic of each node, and improves the network reliability and timeliness. The experimental results indicate that the throughput of the DSME MAC protocol is better than the IEEE 802.15.4e TSCH and the legacy slotted CSMA/CA in large networks with more than 30 nodes. Also, the proposed algorithm improves the throughput by 15%, higher than other MACs including the original DSME. Experimentally, we confirm that the algorithm reduces power consumption by improving the availability of communication slots. The proposed algorithm improves the power consumption by 40%, higher than other MACs.

• Journal of Internet Computing and Services
• /
• v.6 no.6
• /
• pp.127-137
• /
• 2005

This paper presents implementation of client-based VOD service using multicast delivery, Conventional system provide server-based system in multicast delivery but implemented system provides on-demand client-based multicast system. The Multicast Agent Scheduler aggregates clients' request and it generate multicast group addresses and port numbers according to requested video items and service request time. Then it transmits immediately multicast address to VOD server and client who request service. And then VOD server transmits requested streams with a multicast group address and the client joins the group automatically. The Multicast Agent Scheduler assigns the same multicast group address when other clients request an identical video within the same scheduling duration. The proposed system can reduce load of server and support many clients at the same time and applies it to WMT(window media technology) of Microsoft.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.127-133
• /
• 2011

This study proposed the PHB mapping model for combining services with DiffServ in the MPLS network capable of high-speed switching, and the effective differential bandwidth service model in the MPLS network on the basis of the proposed mapping model. The result of simulation on the service model using PRI showed that the transmission rate was achieved as much as the assigned bandwidth regardless of the increase of traffic as far as the EF PHB did not exceed the assigned bandwidth at the peak rate when the overall traffic increased.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.1036-1057
• /
• 2013

Wireless body area network (WBAN) is a promising candidate for future health monitoring system. Nevertheless, the path to mature solutions is still facing a lot of challenges that need to be overcome. Energy efficient scheduling is one of these challenges given the scarcity of available energy of biosensors and the lack of portability. Therefore, researchers from academia, industry and health sectors are working together to realize practical solutions for these challenges. The main difficulty in WBAN is the uncertainty in the state of the monitored system. Intelligent learning approaches such as a Markov Decision Process (MDP) were proposed to tackle this issue. A Markov Decision Process (MDP) is a form of Markov Chain in which the transition matrix depends on the action taken by the decision maker (agent) at each time step. The agent receives a reward, which depends on the action and the state. The goal is to find a function, called a policy, which specifies which action to take in each state, so as to maximize some utility functions (e.g., the mean or expected discounted sum) of the sequence of rewards. A partially Observable Markov Decision Processes (POMDP) is a generalization of Markov decision processes that allows for the incomplete information regarding the state of the system. In this case, the state is not visible to the agent. This has many applications in operations research and artificial intelligence. Due to incomplete knowledge of the system, this uncertainty makes formulating and solving POMDP models mathematically complex and computationally expensive. Limited progress has been made in terms of applying POMPD to real applications. In this paper, we surveyed the existing methods and algorithms for solving POMDP in the general domain and in particular in Wireless body area network (WBAN). In addition, the papers discussed recent real implementation of POMDP on practical problems of WBAN. We believe that this work will provide valuable insights for the newcomers who would like to pursue related research in the domain of WBAN.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.4
• /
• pp.344-365
• /
• 2009

The performance of a tracking system is greatly increased if multiple types of sensors are combined to achieve the objective of the tracking instead of relying on single type of sensor. To conduct the multi-modal tracking, we have previously developed a multi-modal sensor-based tracking model where acoustic sensors mainly track the objects and visual sensors compensate the tracking errors [1]. In this paper, we find a network synchronization problem appearing in the developed tracking system. The problem is caused by the different location and traffic characteristics of multi-modal sensors and non-synchronized arrival of the captured sensor data at a processing server. To effectively deliver the sensor data, we propose a time-based packet aggregation algorithm where the acoustic sensor data are aggregated based on the sampling time and sent to the server. The delivered acoustic sensor data is then compensated by visual images to correct the tracking errors and such a compensation process improves the tracking accuracy in ideal case. However, in real situations, the tracking improvement from visual compensation can be severely degraded due to the aforementioned network synchronization problem, the impact of which is analyzed by simulations in this paper. To resolve the network synchronization problem, we differentiate the service level of sensor traffic based on Weight Round Robin (WRR) scheduling at the routers. The weighting factor allocated to each queue is calculated by a proposed Delay-based Weight Allocation (DWA) algorithm. From the simulations, we show the traffic differentiation model can mitigate the non-synchronization of sensor data. Finally, we analyze expected traffic behaviors of the tracking system in terms of acoustic sampling interval and visual image size.

• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.11-18
• /
• 2000

In this paper we present a new extensible model based upon the concept of subtransactions in real-time transaction systems. The nested transaction model originally proposed by J. Moss is extended for real-time uniprocessor transaction systems by adding explicit timing constraints. Based upon the model, an integrated concurrency control and scheduling algorithm is developed, that not only guarantees timing constraints of a set of real-time transactions but also maintains consistency of the database. The algorithm is based on the priority ceiling protocol of Sha et al. We prove that the Real-Time Nested Priority Ceiling Protocol prevents unbounded blocking and deadlock, and maintains the serializability of a set of real-time transactions. We use the upper bound on the duration that a transaction can be blocked to show that it is possible to analyze the schedulability of a transaction set using rate-monotonic priority assignment. This work is viewed as a step toward multiprocessor and distributed real-time nested transaction systems. Also, it is possible to be extended to include the real-time multimedia transactions in the emerging web-based database application areas.

• Journal of Intelligence and Information Systems
• /
• v.7 no.1
• /
• pp.1-15
• /
• 2001

Recently, Internet based Electronic Commerce is recognized as one of the alternatives for strengthening sales power of small and medium companies. However, small and medium manufacturers can't adjust properly to the new environment because they are in short of money, personnel, and technology. To cope with this problem, this paper deals with the development of virtual manufacturing agent to support sales agent. The sales activity of most of parts manufacturing companies is based on orders of buyers. The process of promotion, receipt and selection of orders of the parts manufacturing is closely coupled with the load status of the production lines. On deciding whether to accept an order or not, as well as negotiating with buyers, sales person needs information such as load and schedule of production lines, manufacturability of the order. Therefore, the functions of virtual manufacturing agents manufacturability analysis, process planning, and scheduling are key features in developing an agent of sales activity for the parts manufacturing business. While most of research on virtual manufacturing system so far is focused on the simulation of each product, this paper deals with the development of agent assisting internet-based product sales by supporting production information promptly. The pilot system of virtual manufacturing agent is implemented using KQML-based agent template and Java-based expert system shell for a small molding company.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.729-736
• /
• 2003

With the rapid growth of the Internet, popular Web sites are visited so frequently that these cannot be constructed with a single server or mirror site of high performance. The rapid increase of Internet uses and uses raised the problems of overweighted transmission traffic and difficult load balancing. To solve these, various schemes of server clustering have been surveyed. Especially, in order to fully utilize the performance of computer systems in a cluster, a good scheduling method that distributes user requests evenly to servers in required. In this paper, we propose a new method for reducing the service latency. In our method, each Web server in the cluster has different content. This helps to reduce the complexity of load balancing algorithm and the service latency The Web server that received a request from the load balancer responds to the client directly without passing through the load balancer. Simulation studies show that our method performs better than other traditional methods. In terms of response time, our method shows shorter latency than RR (Round Robin) and LC (Least Connection) by about 16%, 14% respectively.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.45-55
• /
• 2010

While Long Term Evolution-Frequency Division Duplexing (LTE-FDD) is regarded as one of the strong candidates for "4G" wireless broadband access in FDD field, LTE-Time Division Duplexing (TDD) is emerging as one possible migration path for WiMAX-TDD in some cases as well as the migration path for Time Division-Synchronous Code Division Multiple Access (TD-SCDMA). In this paper, we analyze the feasibility of dual mode with LTE-TDD in two combinations: dual mode LTE-FDD/TDD and dual mode Worldwide Interoperability for Microwave Access (WiMAX)-TDD/LTE-TDD. Thanks to the commonality in numerology, terminology, and frame structure between LTE-FDD and LTE-TDD, dual mode LTE-FDD/TDD looks feasible in a cost-effective manner. Thanks to the commonality in scheduling algorithm, control mechanism, and supported spectrum bands, it is shown that dual mode WiMAX-TDD/LTE-TDD looks feasible as well. It should be also noted that the commonality in numerology and frame structure is critical for building a chip while the commonality in algorithms and control mechanisms is critical to make it work.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3B
• /
• pp.161-167
• /
• 2007

In this paper, we evaluate the capacity of voice over internet protocol (VoIP) services over high-speed downlink packet access (HSDPA), in which frame-bundling (FB) is incorporated to reduce the effect of relatively large headers in the IP/UDP/RTP layers. Also, a modified proportional pair (PF) packet scheduler design supporting for VoIP service is provided. The main focus of this work is the effect of FB on system outage based on delay budget in radio access networks. Simulation results show that VoIP system performance with FB scheme is highly sensitive to delay budget. We also conclude that HSDPA is attractive for transmission of VoIP if compared to the circuit switched (CS) voice that is used in WCDMA (Release'99).