• International Journal of Control, Automation, and Systems
• /
• v.3 no.2
• /
• pp.173-182
• /
• 2005

In this paper, a target tracking algorithm for tracking maneuvering vehicles is presented. The overall algorithm belongs to the category of an interacting multiple-model (IMM) algorithm used to detect multiple targets using fused information from multiple sensors. First, two kinematic models are derived: a constant velocity model for linear motions, and a constant-speed turn model for curvilinear motions. Fpr the constant-speed turn model, a nonlinear information filter is used in place of the extended Kalman filter. Being equivalent to the Kalman filter (KF) algebraically, the information filter is extended to N-sensor distributed dynamic systems. The model-matched filter used in multi-sensor environments takes the form of a federated nonlinear information filter. In multi-sensor environments, the information-based filter is easier to decentralize, initialize, and fuse than a KF-based filter. In this paper, the structural features and information sharing principle of the federated information filter are discussed. The performance of the suggested algorithm using a Monte Carlo simulation under the two patterns is evaluated.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.99-101
• /
• 2006

Auto-Cross Correlated time series (ACTS) model was constructed by using the backpropagation neural network. The performance of ACTS model was evaluated with sensor information collected from a large volume, industrial plasma-enhanced chemical vapor deposition system. A total of 18 sensor information were collected. The effect of inclusion of past and future information were examined. For all but three sensor information with a large data variance demonstrated a prediction error less than 3%. By integrating ACTS model into equipment software, process quality can be more stringently monitored while improving device throughput.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.102-104
• /
• 2006

Auto-Correlated time series (ATS) model was constructed by using the backpropagation neural network. The performance of ATS model was evaluated with sensor information collected from a large volume, industrial plasma-enhanced chemical vapor deposition system. A total of 18 sensor information were collected. The effect of inclusion of past and future information were examined. For all but three sensor information with a large data variance demonstrated a prediction error less than 4%. By integrating ATS model into equipment software, process quality can be more stringently monitored while improving device throughput.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.17-28
• /
• 2011

Despite the fact that the deployment of sensor networks and target tracking could both be managed by taking full advantage of Voronoi diagrams, very little few have been made in this regard. In this paper, we designed an optimized barrier coverage and an energy-efficient clustering algorithm for forming Vonoroi-based Wireless Sensor Networks(WSN) in which we proposed a mobile target tracking scheme (CTT&MAV) that takes full advantage of Voronoi-diagram boundary to improve detectability. Simulations verified that CTT&MAV outperforms random walk, random waypoint, random direction and Gauss-Markov in terms of both the average hop distance that the mobile target moved before being detected and lower sensor death rate. Moreover, we demonstrate that our results are robust as realistic sensing models and also validate our observations through extensive simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.1014-1034
• /
• 2015

Location information of sensor nodes plays a critical role in many wireless sensor network (WSN) applications and protocols. Although many localization algorithms have been proposed in recent years, they usually target at dense networks and perform poorly in sparse networks. In this paper, we propose two component-based localization algorithms that can localize many more nodes in sparse networks than the state-of-the-art solution. We first develop the Basic Common nodes-based Localization Algorithm, namely BCLA, which uses both common nodes and measured distances between adjacent components to merge components. BCLA outperforms CALL, the state-of-the-art component-based localization algorithm that uses only distance measurements to merge components. In order to further improve the performance of BCLA, we further exploit the angular information among nodes to merge components, and propose the Component-based Localization with Angle and Distance information algorithm, namely CLAD. We prove the merging conditions for BCLA and CLAD, and evaluate their performance through extensive simulations. Simulations results show that, CLAD can locate more than 90 percent of nodes in a sparse network with average node degree 7.5, while CALL can locate only 78 percent of nodes in the same scenario.

• Journal of Communications and Networks
• /
• v.18 no.2
• /
• pp.227-237
• /
• 2016

Data collection is a key function for wireless sensor networks. There has been numerous data collection scheduling algorithms, but they fail to consider the deep and complex relationship among network lifetime, sink aggregated information and sample cycle for wireless sensor networks. This paper gives the upper bound on the sample period under the given network topology. An optimal schedule algorithm focusing on aggregated information named OSFAI is proposed. In the schedule algorithm, the nodes in hotspots would hold on transmission and accumulate their data before sending them to sink at once. This could realize the dual goals of improving the network lifetime and increasing the amount of information aggregated to sink. We formulate the optimization problem as to achieve trade-off among sample cycle, sink aggregated information and network lifetime by controlling the sample cycle. The results of simulation on the random generated wireless sensor networks show that when choosing the optimized sample cycle, the sink aggregated information quantity can be increased by 30.5%, and the network lifetime can be increased by 27.78%.

• Journal of information and communication convergence engineering
• /
• v.9 no.1
• /
• pp.78-82
• /
• 2011

This paper proposes a new circuit for capacitive sensing based on Dickson's charge pump. The proposed touch sensing circuit includes three stages of NMOS diodes and capacitors for charge transfer. The proposed circuit which has a simplified capacitive touch sensor model has been analyzed and simulated by Spectre using Magna EDMOS technology. Looking from the simulation results, the proposed circuit can effectively be used as a capacitive touch sensing circuit. Moreover, a simple structure can provide maximum flexibility for making a digitally-controlled touch sensor driver with lowpower operations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.911-923
• /
• 2014

Ad hoc cognitive radio wireless sensor networks allow secondary wireless sensor nodes to recognize spectrum opportunities and transmit data. Most existing protocols proposed for ad hoc cognitive radio wireless sensor networks require a dedicated common control channel. Allocating one channel just for control packet exchange is a waste of resources for channel-constrained networks. There are very few protocols that do not rely on a common control channel and that exchange channel-negotiation control packets during a pre-allocated time on the data channels. This, however, can require a substantial amount of time to access the channel when an incumbent is present on the channel, where the nodes are intended to negotiate for the data channel. This study examined channel access delay on cognitive radio wireless sensor networks that have no dedicated common control channel.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.665-683
• /
• 2011

Wireless sensor networks (WSN) consist of a large amount of sensor nodes distributed in a certain region. Due to the limited battery power of a sensor node, lots of energy-efficient schemes have been studied. Clustering is primarily used for energy efficiency purpose. However, clustering in WSNs faces several unattained issues, such as ensuring connectivity and scheduling inter-cluster transmissions. In this paper, we propose a location-based spiral clustering (LBSC) algorithm for improving connectivity and avoiding inter-cluster collisions. It also provides reliable location aware routing paths from all cluster heads to a sink node during cluster formation. Proposed algorithm can simultaneously make clusters in four spiral directions from the center of sensor field by using the location information and residual energy level of neighbor sensor nodes. Three logical addresses are used for categorizing the clusters into four global groups and scheduling the intra- and inter-cluster transmission time for each cluster. We evaluated the performance with simulations and compared it with other algorithms.

• Journal of information and communication convergence engineering
• /
• v.5 no.4
• /
• pp.382-388
• /
• 2007

Indoor location system using wireless sensor network technology was applied for the status evaluation and activity monitoring of elderly person or chronic invalid at home. Location awareness application is transparent to the daily activities, while providing the embedded computing infrastructure with an awareness of what is happening in this space. To locate an object, the active ceiling-mounted reference beacons were placed throughout the building. Reference beacons periodically publish location information on RF and ultrasonic signals to allow application running on mobile or static nodes to study and determine their physical location. Once object-carried passive listener receives the information, it subsequently determines it's location from reference beacons. By using only the sensor nodes without any external network infrastructure the cost of the system was reduced while the accuracy in our experiments. was fairly good and fine grained between 7 and 15 cm for location awareness in indoor environments. Passive architecture used here provides the security of the user privacy while at the server the privacy was secured by providing the authentication using Geopriv approach. This information from sensor nodes is further forwarded to base station where further computation is performed to determine the current position of object and several applications are enabled for context awareness.