• Journal of information and communication convergence engineering
• /
• v.6 no.3
• /
• pp.343-347
• /
• 2008

Wakeup schemes that turn off sensors' radio when communication is not necessary have great potential in energy saving. At the start of each beacon interval in the IEEE 802.11 power saving mode specified for DCF, each node periodically wakes up for duration called the ATIM Window. However, in the power saving mechanism specified in IEEE 802.11, all nodes use the same ATIM window size. Since the ATIM window size critically affects throughput and energy consumption, a fixed ATIM window does not perform well in all situations. This paper proposes an adaptive mechanism to dynamically choose an ATIM window size according to network condition. Simulation results show that the proposed scheme outperforms the IEEE 802.11 power saving mechanism in terms of the amount of power consumed and the packet delivery ratio.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2016.05a
• /
• pp.255-256
• /
• 2016

In order to overcome the limitation of conventional cleaning method by workers, variety attempts to develop a window cleaning apparatus has been tried. However, the existing cleaning devices were lack of consideration for avoiding projection parts of the window such as frames or profiles. In this study, operating mechanism of cleaning tool for avoiding the projections parts using a two-axis robot is proposed. Proposed mechanism is that a wiper are reposed in a relatively stationary in the vicinity of the projection and avoided the projection in this state. It is expected that the mechanism is the base of driving cleaning tool part in the new window cleaning apparatus.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4977-4996
• /
• 2016

The existence of excessively large and too filled network buffers, known as bufferbloat, has recently gained attention as a major performance problem for delay-sensitive applications. Researchers have made three types of suggestions to solve the bufferbloat problem. One is End to End (E2E) congestion control, second is deployment of Active Queue Management (AQM) techniques and third is the combination of above two. However, these solutions either seem impractical or could not obtain good bandwidth utilization. In this paper, we propose a Transmission Control Protocol（TCP）delayed window update mechanism which uses a congestion detection approach to predict the congestion level of networks. When detecting the network congestion is coming, a delayed window update control strategy is adopted to maintain good protocol performance. If the network is non-congested, the mechanism stops work and congestion window is updated based on the original protocol. The simulation experiments are conducted on both high bandwidth and long delay scenario and low bandwidth and short delay scenario. Experiment results show that TCP delayed window update mechanism can effectively improve the performance of the original protocol, decreasing packet losses and queuing delay while guaranteeing transmission efficiency of the whole network. In addition, it can perform good fairness and TCP friendliness.

• The Journal of Korea Robotics Society
• /
• v.5 no.1
• /
• pp.14-22
• /
• 2010

Recently researches on the window cleaning robot are being conducted actively. Moving mechanismsof these window cleaning robots are divided into two categories, which are towed type and walking type. Towed type is focused on fast cleaning on the flat surface of building and walking type has priority on cleaning task on relatively complex surface with overcoming obstacles. Currently commercialized towed type window cleaning robot has weakness that it is hard to adhere closely with the wall and easy to be affected by wind. In case of walking type it has the problem that the position errors are continuously accumulated during motion. In this paper, we propose new towed and walking type mechanism which can compensate previous weaknesses. After that we estimate the performance of each proposed mechanism by simulation.

• Journal of Korea Multimedia Society
• /
• v.13 no.12
• /
• pp.1798-1804
• /
• 2010

TCP with AIMD mechanism, one of the most popular protocols in internet, can solve congestion control in wired networks. This protocol, however, is not efficient in wireless networks. This paper proposes a new mechanism namely General AIMD with Congestion Window Upper Bound in which congestion window is limited by an upper bound. By applying optimization theory, we find an optimal policy for congestion window upper bound to maximize network throughput.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.3
• /
• pp.99-109
• /
• 2004

In this paper, we investigate the impact of window mechanisms on end to end delay in a series of nodes with constant service times. It is shown that arbitrary combinations of window mechanisms, each applying to an arbitrary subset of data, can be embedded on the nodes without affecting the departure instants from the system if the windows are at least as large as the number of nodes spanned. The window mechanisms are shown to have no impact on the average end to end delay of data. As the condition on the windows is a minimal necessary requirement for full parallelism, the results show that the transparent operation from viewpoint of data transmission can be achieved with minimal resources.

• Geophysics and Geophysical Exploration
• /
• v.15 no.2
• /
• pp.85-91
• /
• 2012

Multiple Lapse Time Window (MLTW) analysis for obtaining intrinsic attenuation value require numerous data without directional bias to compensate focal mechanism. The first window of MLTW, therefore, shows large deviation in fitting smoothed theoretical curve. The information on the focal mechanism may reduce burdens of number and distribution. This study combined algorithm of computing focal mechanism to DSMC method by Yoshimoto (2000). However, the MLTW method based on the numerous data was not applicable to this study, because of the limited data to the almost same fault plane solution. This study showed that the available data was too insufficient to construct smoothed theoretical curve, although the deviation of the first window was improved. Instead of conventional solution by more data, the study seems to be needed for new constraints to obtain smoothed curve.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.475-477
• /
• 2010

In the power saving mechanism specified in IEEE 802.11, all node use the sam ATIM window size. Since the ATIM window size critically affects throughput and energy consumption, a fixed ATIM window does not perform well in all situations. This paper proposes the efficient power management mechanism considering network characteristic in 802.11. To reflect the network characteristic, the paper uses th (m,k)-firm deadline technique. Simulation result shows that proposed mechanism outperforms the IEEE 802.11 power saving mechanism in terms of the amount of power consumed.

• Genomics & Informatics
• /
• v.17 no.1
• /
• pp.4.1-4.7
• /
• 2019

In this paper, we propose a window-based mechanism visualization approach as an alternative way to measure the seriousness of the difference among data-insights extracted from a composite biodata point. The approach is based on two components: undirected graph and Mosaab-metric space. The significant application of this approach is to visualize the segmented genome of a virus. We use Influenza and Ebola viruses as examples to demonstrate the robustness of this approach and to conduct comparisons. This approach can provide researchers with deep insights about information structures extracted from a segmented genome as a composite biodata point, and consequently, to capture the segmented genetic variations and diversity (variants) in composite data points.

• The KIPS Transactions:PartC
• /
• v.14C no.6
• /
• pp.475-480
• /
• 2007

Recently, wireless networking devices that depend on the limited Battery and power-saving of wireless hosts became important issue. Batteries can provide a finite amount of energy, therefore, to increase battery lifetime, it is important to design techniques to reduce energy consumption by wireless hosts. This paper improved power saying mechanism in Distributed Coordination Function(DCF) of IEEE 802.11. In the IEEE 802.11 power saving mechanism specified for DCF, time is divided into so-called beacon intervals. At the start of each beacon interval, each node in the power saving mode periodically wakes up during duration called the ATIM Window. The nodes are required to be synchronized to ensure that all nodes wake up at the same time. During the ATIM window, the nodes exchange control packets to determine whether they need to stay awake for the rest of the beacon interval. The size of the ATIM window has considerably affected power-saving. This paper can provide more power-saving than IEEE 802.11 power saving mode because ATIM window size is efficiently increased or decreased.