• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.3
• /
• pp.318-325
• /
• 2008

In this paper, a dynamic backoff adjustment method of IEEE 802.15.4 is proposed for time-critical sporadic data in a noisy factory environment. For this, a superframe of IEEE 802.15.4 is applied to a real-time mixed data (periodic data, sporadic data, and non real-time message) transmission in factory communication systems. To guarantee a channel access of real-time sporadic(non-periodic) data, a transmission method using the dynamic backoff is applied to wireless control networks. For the real-time property, different initial BE, CW parameters are used for the dynamic backoff adjustment method. The simulat-ion results show an enhancement of the real-time performance of sporadic emergency data. The proposed method provides the channel access of real-time sporadic data efficiently, and guarantee real-time transmission simultaneously within a limite-d timeframe.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1229-1238
• /
• 1999

To maximize the statistical multiplexing gain in wireless ATM MAC, a centralized scheduling function must be provided for the dynamic slot assignment in the wireless ATM access point. Exploiting the dynamic parameters received in the wireless ATM access point, the centralized scheduler will execute a dynamic slot assignment to determine bandwidth required for individual wireless terminal. In this paper, we propose a new scheduling algorithm, which can effectively reduce a burden of the explicit signaling requirement of transmitting the dynamic parameters in a timely manner. We have demonstrated that the proposed approach outperforms the existing schemes in terms of the timeliness of transmitting the dynamic parameters, which is a critical factor to the performance of delay-sensitive service classes, and works as an effective means of dynamic slot assignment without heavily relying on the dynamic parameters in the wireless ATM networks.

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.77-86
• /
• 2002

Ford and Fulkerson have shown that a stationary maximal dynamic flow can be obtained by solving a transhipment problem associated with the static network and thereby finding the maximal temporally repeated dynamic flow. This flow is known to be an optical dynamic flow. This paper presents an algorithm for second best temporal1y repeated flows. A numerical example is presented.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.105-107
• /
• 2015

In this paper, we proposed LTD(Load Tolerance Density-distribution) algorithm using dynamic density for analyzing distribute routing path. MANET(Mobile Ad-hoc Networks) consists of the node that has a mobility. By the Mobility, the topology is exchanged frequently. To reduce the exchange of topology, the hierarchy network is studied. However, if the load is concentrated at the cluster head node, the communication is disconnected. the proposed algorithm measure the dynamic density of the node using poisson distribution. And this algorithm provides distribute routing path using dynamic density. The simulation results, the proposed algorithm shows improved packet delivery ratio than the compared algorithm.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.24 no.1
• /
• pp.115-122
• /
• 2021

In this paper, we propose a dynamic slot allocation scheme to improve the slot utilization rate in tactical multi-hop networks in which the channel condition varies due to node movements. The proposed scheme takes advantage of the fact that nodes that are more than three hops apart can use the same slot simultaneously. The frame is divided into two parts: the control period and the data period. To know the available slot information within two-hop distance, the node exchanges a slot allocation information with one-hop neighbors during the control period. The node can get the information on idle slots that are not used within two-hop distance but assigned already to other nodes that are more than three-hop away. The identified idle slot can be used by the node, which increases the slot utilization rate. The performance analysis results of the proposed scheme show that it increases the slot utilization rate sufficiently despite the overhead of the control period in the multi-hop networks of the future soldier system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2499-2504
• /
• 2013

Applications of dynamic position control are especially focused on cancellation of unknown disturbance against nonlinear dynamic plants. Control performance is technically dependent upon observation methodology of such disturbance signals. This paper presents a novel control strategy by using linear actuators based on CAN communication networks. Disturbance is measured from placing a ball on a flat plant and image processing technique is applied to observe dynamic position of a ball system. We devise a neural network based PI control system to realize robust control of the dynamic system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.4940-4957
• /
• 2019

Compared with the localization methods in the static sensor networks, node localization in dynamic sensor networks is more complicated due to the mobility of the nodes. Dynamic Sampling Localization Algorithm Based on Virtual Anchor (DSLA) is proposed in this paper to localize the unknown nodes in dynamic sensor networks. Firstly, DSLA algorithm predicts the speed and movement direction of nodes to determine a sector sampling area. Secondly, a method of calculating the sampling quantity with the size of the sampling area dynamically changing is proposed in this paper. Lastly, the virtual anchor node, i.e., the unknown node that got the preliminary possible area (PLA), assists the other unknown nodes to reduce their PLAs. The last PLA is regarded as a filtering condition to filter out the conflicting sample points quickly. In this way, the filtered sample is close to its real coordinates. The simulation results show that the DSLA algorithm can greatly improve the positioning performance when ensuring the execution time is shorter and the localization coverage rate is higher. The localization error of the DSLA algorithm can be dropped to about 20%.

• The Korean Journal of Applied Statistics
• /
• v.34 no.1
• /
• pp.25-38
• /
• 2021

Recently the need for network surveillance to detect abnormal behavior within dynamic social networks has increased. We consider a dynamic version of the degree corrected stochastic block model (DCSBM) to simulate dynamic social networks and to monitor for a significant structural change in these networks. To apply a control charting procedure to network surveillance, in-control model parameters must be estimated from the Phase I data, that is from historical data. In network surveillance, however, there are many situations where sufficient relevant historical data are unavailable. In this paper we propose a self-starting Shewhart control charting procedure for detecting change in the dynamic networks. This procedure can be a very useful option when we have only a few initial samples for parameter estimation. Simulation results show that the proposed procedure has good in-control performance even when the number of initial samples is very small.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.1 no.1
• /
• pp.8-13
• /
• 2006

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To achieve load balancing in networks, many protocols have been proposed. However, existing load balancing schemes do not consider the remaining available buffer size of the interface queue, which still results in buffer overflows by congestion in a certain node which has the least available buffer size in the route. To solve this problem, we propose a load balancing protocol called Dynamic Congestion Aware Routing Protocol (DCAR) which monitors the remaining buffer length of all nodes in routes and excludes a certain congested node during the route discovery procedure. We also propose two buffer threshold values to select an optimal route selection metric between the traffic load and the minimum hop count. Through simulation study, we compare DCAR with other on demand routing protocols and show that the proposed protocol is more efficient when a network is heavily loaded.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1393-1405
• /
• 2017

It is well known that duty-cycling control by dynamically adjusting the polling interval according to the traffic loads can effectively achieve power saving in wireless sensor networks. Thus, there has been a significant research effort in developing polling interval adaptation schemes. Especially, Dynamic Low Power Listening (DLPL) scheme is one of the most widely adopted open-looping polling interval adaptation techniques in wireless sensor networks. In DLPL scheme, if consecutive idle (busy) samplings reach a given fixed threshold, the polling interval is increased (decreased). However, due to the trial-and-error based approach, it may significantly deteriorate the system performance depending on given threshold parameters. In this paper, we propose a novel DLPL scheme, called SDL (Sequential hypothesis testing based Dynamic LPL), which employs sequential hypothesis testing to decide whether to change the polling interval conforming to various traffic conditions. Simulation results show that SDL achieves substantial power saving over state-of-the-art DLPL schemes.