• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.57-71
• /
• 2009

Networking together hundreds or thousands of cheap sensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. As sensor nodes are typically battery operated, it is important to efficiently use the limited energy of the nodes to extend the lifetime of the wireless sensor network (WSN). One of the fundamental issues in WSNs is the coverage problem. In this paper, the border coverage problem in WSNs is rigorously analyzed. Most existing results related to the coverage problem in wireless sensor networks focused on planar networks; however, three dimensional (3D) modeling of the sensor network would reflect more accurately real-life situations. Unlike previous works in this area, we provide distributed algorithms that allow the selection and activation of an optimal border cover for both 2D and 3D regions of interest. We also provide self-healing algorithms as an optimization to our border coverage algorithms which allow the sensor network to adaptively reconfigure and repair itself in order to improve its own performance. Border coverage is crucial for optimizing sensor placement for intrusion detection and a number of other practical applications.

• Journal of the Korean Society of Industry Convergence
• /
• v.10 no.2
• /
• pp.105-113
• /
• 2007

Accurate and low-cost sensor localization is a critical requirement for the deployment of wireless sensor networks in a wide variety of application. Sensor position is used for its data to be meaningful and for energy efficient data routing algorithm especially geographic routing. The previous works for sensor localization utilize global positioning system(GPS) or estimate unknown-location nodes position with help of some small reference nodes which know their position previously. However, the traditional localization techniques are not well suited in the senor network for the cost of sensors is too high. In this paper, we propose the sensor localization method with a mobile robot, which knows its position, moves through the sensing field along pre-scheduled path and gives position information to the unknown-location nodes through wireless channel to estimate their position. We suggest using the sensor position estimation method and an efficient mobility path model. To validate our method, we carried out a computer simulation, and observed that our technique achieved sensor localization more accurately and efficiently than the conventional one.

• Journal of information and communication convergence engineering
• /
• v.9 no.6
• /
• pp.775-779
• /
• 2011

As the technology of multimedia sensor networks is desired in large numbers of applications nowadays, real-time service becomes one of the most important research challenges. Even though lots of related works have been conducted to meet this requirement in several ways, the specific traffic model for real-time has not been taken yet. Thus, it causes lack of adaptability of those approaches in real deployment. To solve this problem, in this paper, we model the application via (m,k)-firm streams which have weakly hard real-time property. And then, a novel forwarding scheme based on modified DBP (Distance-Based Priority) is proposed by considering local-DBP and stream DBP together. Local-DBP can contribute to identify the detailed causes of unsatisfied quality, that is, network congestion or wireless link failure. Simulation results reveal that (m,k)-firm is a good traffic model for multimedia sensor networks and the proposed scheme can contribute to guarantee real-time requirement well.

• International journal of advanced smart convergence
• /
• v.3 no.2
• /
• pp.14-17
• /
• 2014

Precision agriculture relies on information technology, whose precondition is providing real-time and accurate information. It depends on various kinds of advanced sensors, such as environmental temperature and humidity, wind speed, light intensity, and other types of sensors. Currently, it is a hot topic how to collect accurate information, the main raw data for agricultural experts, monitored by these sensors timely. Most existing work in WSNs addresses their fundamental challenges, including power supply, limited memory, processing power and communication bandwidth and focuses entirely on their operating system and networking protocol design and implementation. However, it is not easy to find the self-localization capability of wireless sensor networks. Because of constraints on the cost and size of sensors, energy consumption, implementation environment and the deployment of sensors, most sensors do not know their locations. This paper provides maximum likelihood estimators for sensor location estimation when observations are time-of arrival (TOA) range measurement.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.749-752
• /
• 2005

In this paper, we introduce an Intersection Collision Avoidance (ICA) system as a convergence example of Telematics and USN technology and show several requirements for the ICA system. Also, we propose a system design that satisfies the requirements of reliable vehicular data acquisition, real-time data transmission, and effective intersection collision prediction. The ICA system consists of vehicles, sensor nodes and a base station that can provide drivers with a reliable ICA service. Then, we propose several technological solutions needed when implementing the ICA system. Those are about sensor nodes deployment, vehicular information transmission, vehicular location data acquisition, and intersection collision prediction methods. We expect this system will be a good case study applied to real Telematics application based on USN technology.

• Journal of Information Processing Systems
• /
• v.9 no.3
• /
• pp.477-488
• /
• 2013

Wireless Sensor Networks (WSNs) are comprised of sensor nodes that forward data in the shape of packets inside a network. Proficient packet forwarding is a prerequisite in sensor networks since many tasks in the network, together with redundancy evaluation and localization, depend upon the methods of packet forwarding. With the motivation to develop a fault tolerant packet forwarding scheme a Self-Localized Packet Forwarding Algorithm (SLPFA) to control redundancy in WSNs is proposed in this paper. The proposed algorithm infuses the aspects of the gossip protocol for forwarding packets and the end to end performance of the proposed algorithm is evaluated for different values of node densities in the same deployment area by means of simulations.

• Journal of Communications and Networks
• /
• v.16 no.6
• /
• pp.667-676
• /
• 2014

Connectivity is a crucial quality of service measure in wireless sensor networks. However, the network is always at risk of being split into several disconnected components owing to the sensor failures caused by various factors. To handle the connectivity problem, this paper introduces an in-advance mechanism to prevent network partitioning in the initial deployment phase. The approach is implemented in a distributed manner, and every node only needs to know local information of its 1-hop neighbors, which makes the approach scalable to large networks. The goal of the proposed mechanism is twofold. First, critical nodes are locally detected by the critical node detection (CND) algorithm based on the concept of maximal simplicial complex, and backups are arranged to tolerate their failures. Second, under a greedy rule, topological holes within the maximal simplicial complex as another potential risk to the network connectivity are patched step by step. Finally, we demonstrate the effectiveness of the proposed algorithm through simulation experiments.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.56-58
• /
• 2006

Sensing and coverage are the two relevant tasks for a sensor network. Quality of sensor network totally depends upon the sensing ability of sensors. In a certain monitored region success of detecting or sensing an object with the help of sensor network tells that how efficiently the network coverage perform. Here in this paper we have proposed a clustering algorithm for the deployment of sensors and thus calculated the object detection probability. Actually by this work we can easily identify the present network coverage status and accordingly can take action for its improvement.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.787-806
• /
• 2016

Traditional radio-based gesture recognition approaches usually require the target to carry a device (e.g., an EMG sensor or an accelerometer sensor). However, such requirement cannot be satisfied in many applications. For example, in smart home, users want to control the light on/off by some specific hand gesture, without finding and pressing the button especially in dark area. They will not carry any device in this scenario. To overcome this drawback, in this paper, we propose three algorithms able to recognize the target gesture (mainly the human hand gesture) without carrying any device, based on just Radio Signal Strength Indicator (RSSI). Our platform utilizes only 6 telosB sensor nodes with a very easy deployment. Experiment results show that the successful recognition radio can reach around 80% in our system.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.412-414
• /
• 2005

Because a sensor node must operate on a tiny battery, the goal to eliminate energy inefficiencies leads the current researchers excavating for new techniques to advocate. As sensor networks edge closer towards wide spread deployment, security issues become a central concern. So far much research has focused on making sensor networks feasible and useful, and has not concentrated much on security issues especially computationally inexpensive techniques. In this paper we introduce a simple scheme relying on one-way hash-functions that greatly enhances location privacy by changing traceable identifiers on every read getting by with only a single, unreliable message exchange. Thereby the scheme is safe from many threats like eavesdropping, message interception, spoofing, and replay attacks.