• International conference on construction engineering and project management
• /
• 2013.01a
• /
• pp.592-595
• /
• 2013

Advent of Wireless Sensor Networks (WSN) has provided potentials to a variety of construction applications. It is well appreciated that WSNs have advantages over traditional wired system, such as ease of installation and maintenance with increased cost savings and efficiencies. However, the obstruction of wireless signal from physical objects in the heterogeneous construction environment often brings challenges to WSN measurement system. This paper analyzed the obstruction characteristic of construction environment where construction materials, equipment, and built structures obstruct the wireless signal yielding negative effect of measurement system. By adopting evaluation criteria, such as packet reception rate, field experiments have been implemented to quantitatively identify the interference of wireless signal from penetration, reflection, and network traffic under the construction environment. The results show that reliable performance of wireless sensor in construction environment depends on the optimal separation distance between a receiver and a transmitter, obstruction types, obstruction thickness, and transmission interval. In addition, the methodology and experimental results of this paper could be used in the practical design of network topology when hundreds of sensor nodes form a mesh network in the large scale construction applications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2769-2792
• /
• 2013

In this paper, we propose an authenticated key agreement scheme, TinyIBAK, based on the identity-based cryptography and bilinear paring, for large scale sensor networks. We prove the security of our proposal in the random oracle model. According to the formal security validation using AVISPA, the proposed scheme is strongly secure against the passive and active attacks, such as replay, man-in-the middle and node compromise attacks, etc. We implemented our proposal for TinyOS-2.1, analyzed the memory occupation, and evaluated the time and energy performance on the MICAz motes using the Avrora toolkits. Moreover, we deployed our proposal within the TOSSIM simulation framework, and investigated the effect of node density on the performance of our scheme. Experimental results indicate that our proposal consumes an acceptable amount of resources, and is feasible for infrequent key distribution and rekeying in large scale sensor networks. Compared with other ID-based key agreement approaches, TinyIBAK is much more efficient or comparable in performance but provides rekeying. Compared with the traditional key pre-distribution schemes, TinyIBAK achieves significant improvements in terms of security strength, key connectivity, scalability, communication and storage overhead, and enables efficient secure rekeying.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.136-151
• /
• 2016

Flexible large-scale WLANs are now widely deployed in crowded and highly mobile places such as campus, airport, shopping mall and company etc. But network management is hard for large-scale WLANs due to highly uneven interference and throughput among links. So the traffic is difficult to predict accurately. In the paper, through analysis of traffic in two real large-scale WLANs, Granger Causality is found in both scenarios. In combination with information entropy, it shows that the traffic prediction of target AP considering Granger Causality can be more predictable than that utilizing target AP alone, or that of considering irrelevant APs. So We develops new method -Granger Causality and Vector Auto-Regression (GCVAR), which takes APs series sharing Granger Causality based on Vector Auto-regression (VAR) into account, to predict the traffic flow in two real scenarios, thus redundant and noise introduced by multivariate time series could be removed. Experiments show that GCVAR is much more effective compared to that of traditional univariate time series (e.g. ARIMA, WARIMA). In particular, GCVAR consumes two orders of magnitude less than that caused by ARIMA/WARIMA.

• Journal of Communications and Networks
• /
• v.10 no.2
• /
• pp.204-212
• /
• 2008

We study the routing problem in all-wireless networks based on cooperative transmissions. We model the minimum-energy cooperative path (MECP) problem and prove that this problem is NP-complete. We hence design an approximation algorithm called cooperative shortest path (CSP) algorithm that uses Dijkstra's algorithm as the basic building block and utilizes cooperative transmissions in the relaxation procedure. Compared with traditional non-cooperative shortest path algorithms, the CSP algorithm can achieve a higher energy saving and better balanced energy consumption among network nodes, especially when the network is in large scale. The nice features lead to a unique, scalable routing scheme that changes the high network density from the curse of congestion to the blessing of cooperative transmissions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.68-77
• /
• 2010

Wireless sensor networks are installed in various environments and collect sensing data through wireless links. The quality of a wireless link may be unstable due to environment causes and hardware performance in wireless sensor networks. Since the change of the link quality may cause data loss, sensor nodes need to adaptively estimate the change of the link quality. Also, the routing protocol should deal with this situation. In this paper, the adaptive link quality estimation and routing scheme in the large-scale wireless sensor networks are proposed. When the quality of a link is unstable, sensor nodes agilely estimate the quality of links, and the new route is selected. When quality of a link is stable, the link quality is occasionally estimated so that the energy consumption is reduced. Moreover, sensor nodes exchange less beacons in order to reduce an overhead in dense networks. In the case of sparse network, the sensor nodes exchange more beacons for finding a better route. We prove that the proposed scheme can improve the energy efficiency and reliability.

• Smart Structures and Systems
• /
• v.6 no.5_6
• /
• pp.505-524
• /
• 2010

Wireless structural monitoring systems consist of networks of wireless sensors installed to record the loading environment and corresponding response of large-scale civil structures. Wireless monitoring systems are desirable because they eliminate the need for costly and labor intensive installation of coaxial wiring in a structure. However, another advantageous characteristic of wireless sensors is their installation modularity. For example, wireless sensors can be easily and rapidly removed and reinstalled in new locations on a structure if the need arises. In this study, the reconfiguration of a rapid-to-deploy wireless structural monitoring system is proposed for monitoring short- and medium-span highway bridges. Narada wireless sensor nodes using power amplified radios are adopted to achieve long communication ranges. A network of twenty Narada wireless sensors is installed on the Yeondae Bridge (Korea) to measure the global response of the bridge to controlled truck loadings. To attain acceleration measurements in a large number of locations on the bridge, the wireless monitoring system is installed three times, with each installation concentrating sensors in one localized area of the bridge. Analysis of measurement data after installation of the three monitoring system configurations leads to reliable estimation of the bridge modal properties, including mode shapes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.9
• /
• pp.2020-2028
• /
• 2013

In this paper, we propose a novel analysis and design methodology based on complex network theory for wireless large-scale ad hoc networks. We also enhance the conventional analysis methods which does not sufficiently consider the effect of the wireless communication channels and extend the existing random graph theory by reflecting the wireless communication environments. As a main result, the effect of the network topology such as average degree of each communication node on the network capacity through extensive computer simulations.

• Convergence Security Journal
• /
• v.3 no.2
• /
• pp.85-97
• /
• 2003

At the end of last January, 2003, a domestic top-level domain name server (DNS) shut down the server and it caused the wired and wireless internet services to be completely paralyzed in the aftermath of a virus attack incurring a various range of losses nationwide. The main reason of this event is the lack of our awareness of cyber security. In particular, in the small-scale network, there are few security administrators and no operating devices to protect information as well. Under this circumstance, using ESM center to service real-time security supervision and correspondence for network, it can be one option. However, due to the economic efficiency, most of security systems have been being developed focusing on the large-scale network first. Therefore, ESM centers which inspect security state of network concentrate on IDC or large-scale network services. This dissertation studies economical ESM service by designing exclusive SnSA for small-scale network for widespread use. Firstly, network invasion feeler function N_SnSA and host invasion feeler function H_SnSA are embodied to collect more informations in the small-scale network. Secondarily, the existing vulnerability is studied to find the solutions linked with a low cost to a Public center such as Kyonggi Univ ESM center.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.576-579
• /
• 2011

Wireless sensor network are widely all over different fields. Because of its distinguished characteristics, we must take account of the factor of energy consumed when designing routing protocol. Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. In BCDCP, all sensors sends data from the CH (Cluster Head) and then to the BS (Base Station). BCDCP works well in a smallscale network however is not preferred in a large scale network since it uses much energy for long distance wireless communication. TBRP can be used for large scale network, but it weakness lies on the fact that the nodedry out of energy easily since it uses multi-hops transmission data to the Base Station. Here, we proposed a routing protocol. A Cluster Based Energy Efficient Tree Routing Protocol (CETRP) in Wireless Sensor Networks (WSNs) to prolong network life time through the balanced energy consumption. CETRP selects Cluster Head of cluster tree shape and uses maximum two hops data transmission to the Cluster Head in every level. We show CETRP outperforms BCDCP and TBRP with several experiments.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.913-916
• /
• 2010

Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. In BCDCP, all sensors send data from CH (Cluster Head) and then to BS (Base Station). BCDCP works well in small-scale network but in large scale network it is not appropriated since it uses much energy for long distance wireless communication. We propose a routing protocol - Triangular Clustering Routing Protocol (TCRP) - to prolong network life time through the balanced energy consumption. TCRP selects cluster head of triangular shape. The sensor field is divided into energy level and in every level we choose one node as a gate node. This gate node collects data and sends it to the leader node. Finally the leader node sends the aggregated data to the BS. We show TCRP outperforms BCDCP with several experiments.