• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.4
• /
• pp.9-20
• /
• 2011

Future warfare paradigm is changing to network-centric warfare and effects-based operations. In order to find first and strike the enemy in the battlefield, friendly unit requires real-time target acquisition, intelligence collection, accurate situation assessment, and timely decision. The rapid development in advanced sensor technology and wireless networks requires a significant change in operational concepts of the battlefield surveillance. In particular, the introduction of a battlefield surveillance sensor network system is a big challenge to the ground forces which have lack of automated information collection assets. Therefore this paper proposes an ontology-based context-aware framework for the battlefield surveillance sensor network system which is needed for early finding the enemy and visualizing the battlefield in the ground force operations. Compared with the performance of existing systems, the one of the proposed framework has shown highly positive results by applying the context systems evaluation method. The framework has also proven to be satisfactory by the structured evaluation method using device collaboration. Since the proposed ontology-based context-aware framework has a lot of advantages in terms of scalability and reusability, the ground force's reconnaissance and surveillance system can be widely applied to expand in the future. And, ontology-based model has some weak points such as ontology data size, processing time, and limitation of network bandwidth. However, these problems can be resolved by customizing properly to fit the mission and characteristics of the unit. Moreover, development of the next-generation communication infrastructure can expedite the intelligent surveillance and reconnaissance service and may be expected to contribute greatly to expanding the information capacity.

• Atmosphere
• /
• v.20 no.2
• /
• pp.153-160
• /
• 2010

In this paper, an attempt has been made to build and test self-configuring weather sensor networks and internet based observation system to gather atmospheric data. The aim is to provide integrated or real-time weather information in standard form using network data access protocol. This system was successfully developed to record weather information both digital as well as visual using sensor network and web-enabled surveillance cameras. These data were transformed by network based data access protocol to access and utilize for public domain. The competed system has been successfully utilized to monitor different types of weather. The results show that this is one of the most useful weather monitoring system.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.4
• /
• pp.169-176
• /
• 2019

Wireless sensor networks are used to monitor and control areas in a variety of military and civilian areas such as battlefield surveillance, intrusion detection, disaster recovery, biological detection, and environmental monitoring. Since the sensor nodes are randomly placed in the area of interest, separation of the sensor network area may occur due to environmental obstacles or a sensor may not exist in some areas. Also, in the situation where the sensor node is placed in a non-relocatable place, some node may exhaust energy or physical hole of the sensor node may cause coverage hole. Coverage holes can affect the performance of the entire sensor network, such as reducing data reliability, changing network topologies, disconnecting data links, and degrading transmission load. It is possible to solve the problem that occurs in the coverage hole by finding a coverage hole in the sensor network and further arranging a new sensor node in the detected coverage hole. The existing coverage hole detection technique is based on the location of the sensor node, but it is inefficient to mount the GPS on the sensor node having limited resources, and performing other location information processing causes a lot of message transmission overhead. In this paper, we propose an Adjacent Matrix-based Hole Coverage Discovery(AMHCD) scheme based on connectivity of neighboring nodes. The method searches for whether the connectivity of the neighboring nodes constitutes a closed shape based on the adjacent matrix, and determines whether the node is an internal node or a boundary node. Therefore, the message overhead for the location information strokes does not occur and can be applied irrespective of the position information error.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.4
• /
• pp.676-682
• /
• 2018

In wireless sensor networks, we propose an optimization algorithm in order to minimize the consumed energy of nodes for maritime search and rescue. In the marine environment, search and rescue operations are mainly performed on the surveillance side and passively on the rescued side. A self-configurable wireless sensor network can build a system that can send rescue signals in the operations. A simulated annealing algorithm is proposed to minimize the consumed energy of nodes in the networks with many nodes. As the density of nodes becomes higher, the algorithmic computation will increase highly. To search the good result in a proper execution time, the proposed algorithm proposes a new neighborhood generating operation and improves the efficiency of the algorithm. The proposed algorithm was evaluated in terms of the consumed energy of the nodes and algorithm execution time, and the proposed algorithm performed better than other optimization algorithms in the performance results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.615-622
• /
• 2009

Advances in wireless communication and hardware technology have made it possible to manufacture high-performance tiny sensor nodes. More recently, the availability of inexpensive CMOS cameras that are able to capture multimedia data from the environment has fostered the development of Wireless Multimedia Sensor Networks (WMSNs). WMSN with the CMOS imaging sensor which is cheaper and consumes lower power than the CCD will not only enhance existing sensor network but also enable several new application such as multimedia surveillance sensor network, multimedia environment monitoring. This paper presents the design of a multimedia sensor network with the image sensor mote developed by us using the CMOS. Given new multimeida sensor network, the new image collecting protocol was tested and analyzed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1170-1181
• /
• 2012

Wireless Sensor Networks(WSNs) are used in diverse applications. In general, sensor nodes that are easily deployed on specific areas have many resource constrains such as battery power, memory sizes, MCUs, RFs and so on. Hence, first of all, the efficient energy consumption is strongly required in WSNs. In terms of event states, event-driven deliverly model (i.e. surveillance and reconnaissance applications) has several characteristics. On the basis of such a model, clustering algorithms can be mostly used to manage sensor nodes' energy efficiently owing to the advantages of data aggregations. Since a specific node collects packets from its child nodes in a network topology and aggregates them into one packet to relay them once, amount of transmitted packets to a sink node can be reduced. However, most clustering algorithms have been designed without considering can be reduced. However, most clustering algorithms have been designed without considering characteristics of event-driven deliverly model, which results in some problems. In this paper, we propose enhanced clustering algorithms regarding with both targets' movement and energy efficiency in order for applications of surveillance and reconnaissance. These algorithms form some clusters to contend locally between nodes, which have already detected certain targets, by using a method which called CHEW (Cluster Head Election Window). Therefore, our proposed algorithms enable to reduce not only the cost of cluster maintenance, but also energy consumption. In conclusion, we analyze traces of the clusters' movements according to targets' locations, evaluate the traces' results and we compare our algorithms with others through simulations. Finally, we verify our algorithms use power energy efficiently.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.77-80
• /
• 2005

Wireless sensor networks(WSN) technology has various applications such as surveillance and information gathering in the uncontrollable area of human. One of major issues in WSN is the research for reducing the energy consumption and reliability of data. A system with forward error correction(FEC) can provide an objective reliability while using less transmission power than a system without FEC. In this paper, we propose to use LDPC codes of various code rate(0.53, 0.81, 0.91) for FEC for WSN. Also, we considered node-to-node interference in addition to AWGN channel. The proposed system has not only high reliable data transmission at low SNR, but also reduced transmission power usage.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.1189-1190
• /
• 2008

Wireless sensor networks (WSN) have attracted much attention in recent years due to their potential use in many applications such as border protection and combat field surveillance. Given the criticality of such applications, maintaining a dependable operation of the network is a fundamental objective. However, the resource constrained nature of sensor nodes and the ad-hoc formation of the network, often coupled with an unattended deployment, pose non-conventional challenges and motivate the need for special techniques for dependable design and management of WSN. In this article, we highlight the potential of careful positioning of the base station (BS), which acts as a sink resources.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.10
• /
• pp.1840-1848
• /
• 2017

Linear wireless sensor networks typically construct a network topology with a high reliability through sequential 1:1 mapping among sensor nodes, so that they are used in various surveillance applications of major national infrastructures. Most existing techniques for identifying sensor nodes in those networks are using GPS, AOA, and RSSI mechanisms. However, GPS or AOA based node identification techniques affect the size or production cost of the nodes so that it is not easy to construct practical sensor networks. RSSI based techniques may have a high deviation regrading location identification according to propagation environments and equipment quality so that complexity of error correction algorithm may increase. We propose a timestamps based sequential localization algorithm that uses transmit and receive timestamps in a message between sensor nodes without using GPS, AOA, and RSSI techniques. The algorithms for distance measurement between each node are expected to measure distance within up to 1 meter in case of an crystal oscillator of 300MHz or more.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5476-5496
• /
• 2016

Energy efficiency of resource-constrained wireless sensor networks is critical in applications such as real-time monitoring/surveillance. To improve the energy efficiency and reduce the energy consumption, the time series data can be compressed before transmission. However, most of the compression algorithms for time series data were developed only for single variate scenarios, while in practice there are often multiple sensor nodes in one application and the collected data is actually multivariate time series. In this paper, we propose to compress the time series data by the Lasso (least absolute shrinkage and selection operator) approximation. We show that, our approach can be naturally extended for compressing the multivariate time series data. Our extension is novel since it constructs an optimal projection of the original multivariates where the best energy efficiency can be realized. The two algorithms are named by ULasso (Univariate Lasso) and MLasso (Multivariate Lasso), for which we also provide practical guidance for parameter selection. Finally, empirically evaluation is implemented with several publicly available real-world data sets from different application domains. We quantify the algorithm performance by measuring the approximation error, compression ratio, and computation complexity. The results show that ULasso and MLasso are superior to or at least equivalent to compression performance of LTC and PLAMlis. Particularly, MLasso can significantly reduce the smooth multivariate time series data, without breaking the major trends and important changes of the sensor network system.