• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.698-701
• /
• 2012

IT기술의 급격한 발전을 토대로 유비쿼터스 사회로 변화함에 따라, USN(Ubiquitous Sensor Network) 기술이 매우 활성화되어있으며 연구 분야로 주목을 받고 있다. 그러나 USN 환경 구축시 효울적인지 실험을 하기위해서는 상당한 시간 및 비용이 따르게 된다. 본 논문에서는 USN 환경을 GML로 구성하고, 장애물에 대해 Map Object 여부 설정을 통해 타겟 지역 설정뿐만 아니라, MSN(Mobile Sensor Node)과 FSN(Fixed Sensor Node)에 대하여 동적 및 다양한 정적 배치가 가능한 멀티형 시뮬레이터인 IS_WSN을 제안한다.

• The Journal of the Acoustical Society of Korea
• /
• v.41 no.4
• /
• pp.419-425
• /
• 2022

This paper aims to evaluate the acoustic detection performance for the deployment of the source and receiver positions of a bi-static sonar. In contrast with a mono-static sonar, a bi-static sonar has a large amount of computation and complexity for deployment. Therefore, in this study, we propose an assessment method that reduces the amount of computation while considering the variability of the ocean environment as a method to apply to the placement of the source and receiver of a bi-static sonar. First, we assume the representative ocean environment in the shallow and deep water. The signal excess is calculated with the source to receiver ranges and sensor depths. And the result is compared with the proposed assessment method of acoustic detection performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4B
• /
• pp.338-348
• /
• 2009

The Wireless Sensor Network (WSN) has recently attracted considerable attention due to the low price and ease to deploy it. In particular, in a hostile or harsh regions where sensors cannot be deployed manually, WSNs can be established just by dropping sensors from the air. In this case, however, most likely sensors are not placed at optimal positions, although the location of sensors does have a drastic impact on the WSN performance. Moreover, randomized deployment algorithm can leave holes in terms of coverage in the sensing area. This paper proposes a sensor relocation scheme where mobile sensors move to patch up the holes by appropriate coverage. Simulation results show that the proposed algorithm outperforms prior existing schemes in terms of coverage and lifespan of WSNs.

• 한국정보컨버전스학회:학술대회논문집
• /
• 2008.06a
• /
• pp.199-204
• /
• 2008

Sensor nodes have various energy and computational constraints because of their inexpensive nature and ad-hoc method of deployment. Considerable research has been focused at overcoming these deficiencies through faster media accessing, more energy efficient routing, localization algorithms and system design. Our research attempts to provide a method of improvement MAC performance in these issues. We show that traditional carrier-sense multiple access(CSMA) protocols like IEEE 802.11 do not handle the first constraint adequately, and do not take advantage of the second property, leading to degraded latency and throughput as the network scales in size, We present more efficient method of a medium access for real-time wireless sensor networks. Proposed MAC protocol is a randomized CSMA protocol, but unlike previous legacy protocols, does not use a time-varying contention window from which a node randomly picks a transmission slot. To reduce the latency for the delivery of event reports, it carefully decides a fixed-size contention window, non-uniform probability distribution of transmitting in each slot within the window. We show that it can offer up to several times latency reduction compared to legacy of IEEE 802.11 as the size of the sensor network scales up to 256 nodes using widely used simulator ns-2. We, finally show that proposed MAC scheme comes close to meeting bounds on the best latency achievable by a decentralized CSMA-based MAC protocol for real-time wireless sensor networks which is sensitive to latency.

• Smart Structures and Systems
• /
• v.17 no.4
• /
• pp.631-646
• /
• 2016

Although the deployment of wireless sensors for structural sensing and monitoring is becoming popular, supplying power to these sensors remains as a daunting task. To address this issue, there have been large volume of ongoing energy harvesting studies that aimed to find a way to scavenge energy from surrounding ambient energy sources such as vibration, light and heat. In this study, a magnetic resonance based wireless power transfer (MR-WPT) system is proposed so that sensors inside a concrete structure can be wirelessly powered by an external power source. MR-WPT system offers need-based active power transfer using an external power source, and allows wireless power transfer through 300-mm thick reinforced concrete with 21.34% and 17.29% transfer efficiency at distances of 450 mm and 500 mm, respectively. Because enough power to operate a typical wireless sensor can be instantaneously transferred using the proposed MR-WPT system, no additional energy storage devices such as rechargeable batteries or supercapacitors are required inside the wireless sensor, extending the expected life-span of the sensor.

• ETRI Journal
• /
• v.33 no.5
• /
• pp.791-801
• /
• 2011

Security in wireless sensor networks (WSNs) is an upcoming research field which is quite different from traditional network security mechanisms. Many applications are dependent on the secure operation of a WSN, and have serious effects if the network is disrupted. Therefore, it is necessary to protect communication between sensor nodes. Key management plays an essential role in achieving security in WSNs. To achieve security, various key predistribution schemes have been proposed in the literature. A secure key management technique in WSN is a real challenging task. In this paper, a novel approach to the above problem by making use of elliptic curve cryptography (ECC) is presented. In the proposed scheme, a seed key, which is a distinct point in an elliptic curve, is assigned to each sensor node prior to its deployment. The private key ring for each sensor node is generated using the point doubling mathematical operation over the seed key. When two nodes share a common private key, then a link is established between these two nodes. By suitably choosing the value of the prime field and key ring size, the probability of two nodes sharing the same private key could be increased. The performance is evaluated in terms of connectivity and resilience against node capture. The results show that the performance is better for the proposed scheme with ECC compared to the other basic schemes.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.3
• /
• pp.180-190
• /
• 2011

Efficient energy consumption is a critical factor for deployment and operation of wireless sensor networks (WSNs). To achieve energy efficiency there have been several hierarchical routing protocols that organize sensors into clusters where one sensor is a cluster-head to forward messages received from its cluster-member sensors to the base station of the WSN. In this paper, we propose a self-organized clustering method for cluster-head selection and cluster based routing for a WSN. To select cluster-heads and organize clustermembers for each cluster, every sensor uses only local information and simple decision mechanisms which are aimed at configuring a self-organized system. By these self-organized interactions among sensors and selforganized selection of cluster-heads, the suggested method can form clusters for a WSN and decide routing paths energy efficiently. We compare our clustering method with a clustering method that is a well known routing protocol for the WSNs. In our computational experiments, we show that the energy consumptions and the lifetimes of our method are better than those of the compared method. The experiments also shows that the suggested method demonstrate properly some self-organized properties such as robustness and adaptability against uncertainty for WSN's.

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

Recently, the efficient management system for large-scale sensor data has been required due to the increasing deployment of large-scale sensor networks. In previous studies, sensor data was managed by distributed database system which built in a single server or a grid server. Thus, it has disadvantages such as low scalability, and high cost of building or managing the system. In this paper, we propose a cloud-based sensor data management system with low cast, high scalability, and efficiency. The proposed system can be work with the application of a variety of platforms, because processed results are provided through REST-based web service.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.6
• /
• pp.710-715
• /
• 2006

With recent advances in device fabrication technology, economical deployment of large scale sensor networks, a design of pervasive monitoring and control system has been made possible. In this paper, we present a new algorithm for one of the most likely applications for sensor networks; tracking moving targets. The proposed algorithm uses a cooperations between the sensor nodes which detect moving objects. Therefore, the proposed scheme is robust against prediction failures which may result in temporary loss of the target. Using simulations we show that tile proposed moving object tracking algorithm is capable of accurately tracking targets with random movement patterns.

• The Journal of the Korea Contents Association
• /
• v.12 no.3
• /
• pp.55-66
• /
• 2012

In wireless sensor networks, a positioning scheme is one of core technologies for sensor applications such as disaster monitoring and environment monitoring. The One of the most positioning scheme, called DV-HOP does not consider non-uniform sensor networks that are actual distributed environments. Therefore, the accuracy of the existing positioning scheme is low in non-uniform network environments. Moreover, because it requires many anchor nodes for high accuracy in non-uniform network environments, it is expensive to construct the network. To overcome this problem, we propose a novel sensor positioning scheme using density probability models in non-uniform wireless sensor networks. The proposed scheme consists of the density probability model using the deployment characteristics of sensor nodes and the distance refinement algorithm for high accuracy. By doing so, the proposed scheme ensures the high accuracy of sensor positioning in non-uniform networks. To show the superiority of our proposed scheme, we compare it with the existing scheme. Our experimental results show that our proposed scheme improves about 44% accuracy of sensor positioning over the existing scheme on average even in non-uniform sensor networks.