• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.31-34
• /
• 2005

In this paper, we proposed a MAC protocol which can be used in power line communications(PLC). In the power line communication network, the data signal cannot travel long distance because of a serious attenuation. Consequently, we need to have a number of repeaters (amplifiers) in order to recover the signal power, which causes flooding problem in the network The proposed MAC protocol uses polling concept and solves the flooding problem in the power line communication network. The proposed protocol can be applied to power line communication networks for automatic power distribution control system. A mathematical analysis has been carried out to estimate the performance of the proposed protocol.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.1013-1017
• /
• 2005

This paper proposes an effective algorithm, P-DCF(Polling DCF) to satisfy real-time requirements in the industrial environments, based on 802.11 DCF protocols. Theoretical analysis and actual experiments are carried out, which shows that the proposed P-DCF brings several benefits: 1) it reduces the time delay for frame transmission 2)it guarantees bounded upper limit of maximum transmission delay 3) it maintains fairness

• Asian Journal for Public Opinion Research
• /
• v.2 no.1
• /
• pp.52-70
• /
• 2014

Gathering polling items about China and Japan from 1937 to 2011, we examine how Americans think about these two powerful East Asian countries. Our study investigates American attitudes from two perspectives. First, we analyze the content of polling items asked in the US about China and Japan to track changes in salient issues over a period of over 60 years. Second, by tracking repeated items, we show how American attitudes toward China and Japan have changed over time, both in long-term general favorability, and shorter-term perception of geopolitical, ideological, and economic threat in response to historical events.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.107-107
• /
• 2000

This paper focuses on a method to connect mobile devices such as mobile robot, ACV and UTC with Profibus network. In this paper, the IEEE 802.11 wireless LAN is used for wireless extension of Frofibus, and four major issues are introduced to implement the wireless extended Profibus; First, the integration method between Profibus and IEEE 802.11 is introduced. Second, the implementation method of gateway is proposed. Three, the virtual polling mode algorithm is developed for satisfaction of real-time characteristics required in industrial network. Finally, we implement a experimental model, and carried out the performance analysis of wireless extended Profibus. This results show that wireless extended Profibus is suitable to industrial network such as automated container terminal.

• Smart Structures and Systems
• /
• v.21 no.2
• /
• pp.225-234
• /
• 2018

E-Health allows you to supersede the central patient wireless healthcare system. Wireless Body Sensor Network (WBSN) is the first phase of the e-Health system. In this paper, we aim to understand e-Health architecture and configuration, and attempt to minimize energy consumption and latency in transmission routing protocols during restrictive latency in data delivery of WBSN phase. The goal is to concentrate on polling protocol to improve and optimize the routing time interval and schedule communication to reduce energy utilization. In this research, two types of network models routing protocols are proposed - elemental and clustering. The elemental model improves efficiency by using a polling protocol, and the clustering model is the extension of the elemental model that Destruct Supervised Decision Tree (DSDT) algorithm has been proposed to solve the time interval conflict transmission. The simulation study verifies that the proposed models deliver better performance than the existing BSN protocol for WBSN.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.7
• /
• pp.10-18
• /
• 1992

In this paper, a simulation model for scope and filter parameters in CMIS/CMIP, OSI management protocol, has been discussed and the suitable scope type was represented by analyzing optimal polling time in network management system, queue size and response time. Scope and filter parameters in MGet, M-Set, M-Action, and =M-Delete services provide a scheme to select some managed objects, and the results are largely varied according to a scope type requested and the outcome of filtering. It has been simulated each scope type and all scope type mixed in a network by varying the offered load and a polling time. On the same time, the response time, queue size of the managing system and a delay time have been measured. As a results, the suitable scope type and polling time enhancing the network performance on the OSI network management is proposed.

• Communications for Statistical Applications and Methods
• /
• v.6 no.3
• /
• pp.881-892
• /
• 1999

In this paper we consider a polling system with two classes of stations; high priority and low priority. High priority stations are polled more frequently than low priority stations. We derive an exact and explicit formula for computing the mean waiting times for a message when the arrival processes are batch Poisson. In general the formula requires to solve two sets of simultaneous equations By specializing them to the case of two priority classes we greatly reduce the number equations and provide a simple formula for mean waiting times. We apply the results to a data communication processing system and show that the overall mean waiting time can be reduced by using priority polling.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.8
• /
• pp.23-28
• /
• 2015

TPSN(Timing-sync Protocol for Sensor Networks), the representative of time synchronization protocol for WSN(wireless sensor networks), was developed to provide higher synchronization accuracy and energy efficiency. So, TPSN's approach has been referenced by so many other WSN synchronization schemes till now. However, TPSN has a collision problem due to simultaneous transmission among competing nodes, which causes more network convergence delay for a network-wide synchronization. A Polling-based scheme for TPSN is proposed in this paper. The proposed scheme not only shortens network-wide synchronization time of TPSN, but also reduce collision traffic which lead to needless power consumption. The proposed scheme's performance has been evaluated and compared with an original scheme by simulation. The results are shown to be better than the original algorithm used in TPSN.

• Journal of KIISE:Databases
• /
• v.37 no.1
• /
• pp.22-32
• /
• 2010

Location-based services have been expanded rapidly in local and overseas markets due to technological advances and increasing applications of wireless internet. Various researches have been made to manage efficiently the location information of moving objects. A basic location-based alert service provides alerting messages automatically when either entering or leaving a specific location and it is expected to become one of the most important location-based services. Location-based alert services require a location polling method to acquire current locations for a large number of moving objects. However, a simple periodical location polling method causes severe system overload because a system should keep updating location information of the moving objects ceaselessly. Most location polling algorithms for location-based alerting services are not suitable for mobile users with dynamic and unsteady moving patterns. In this paper, we propose an improved location polling algorithm for location-based alerting services to reduce the amount of location information acquisition and therefore, to decrease the system load. Various experiments show that the proposed algorithm outperforms other algorithms.

• Communications for Statistical Applications and Methods
• /
• v.5 no.3
• /
• pp.809-817
• /
• 1998

In this paper we consider a polling system where the token is passed according to a general service order table. We derive an exact and explicit formula to compute the mean waiting time for a message when the arrivals of messages are modeled by batch Poisson processes.