• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.4971-4987
• /
• 2019

Node localization is the basic task of underwater wireless sensor networks (UWSNs). Most of the existing underwater localization methods rely on ranging accuracy. Due to the special environment conditions in the ocean, beacon nodes are difficult to deploy accurately. The narrow bandwidth and high delay of the underwater acoustic communication channel lead to large errors. In order to reduce the ranging error and improve the positioning accuracy, we propose a localization algorithm based on ranging correction and inertial coordination. The algorithm can be divided into two parts, Range Correction based Localization algorithm (RCL) and Inertial Coordination based Localization algorithm (ICL). RCL uses the geometric relationship between the node positions to correct the ranging error and obtain the exact node position. However, when the unknown node deviates from the deployment area with the movement of the water flow, it cannot communicate with enough beacon nodes in a certain period of time. In this case, the node uses ICL algorithm to combine position data with motion information of neighbor nodes to update its position. The simulation results show that the proposed algorithm greatly improves the positioning accuracy of unknown nodes compared with the existing localization methods.

• Journal of Information Processing Systems
• /
• v.13 no.1
• /
• pp.128-140
• /
• 2017

The wireless sensor networks (WSNs) became a very essential tool in borders and military zones surveillance, for this reason specific applications have been developed. Surveillance is usually accomplished through the deployment of nodes in a random way providing heterogeneous topologies. However, the process of the identification of all nodes located on the network's outer edge is very long and energy-consuming. Before any other activities on such sensitive networks, we have to identify the border nodes by means of specific algorithms. In this paper, a solution is proposed to solve the problem of energy and time consumption in detecting border nodes by means of node selection. This mechanism is designed with several starter nodes in order to reduce time, number of exchanged packets and then, energy consumption. This method consists of three phases: the first one is to detect triggers which serve to start the mechanism of boundary nodes (BNs) detection, the second is to detect the whole border, and the third is to exclude each BN from the routing tables of all its neighbors so that it cannot be used for the routing.

• 한국ITS학회:학술대회논문집
• /
• v.2007 no.10
• /
• pp.225-229
• /
• 2007

Recently, wireless sensor networks are deployed in various applications range from simple environment monitoring systems to complex systems, which generate large amount of information, like motion monitoring, military, and telematics systems. Although wireless sensor network nodes are operated with low-power 8bit processor to execute simple tasks like environment monitoring, the nodes in these complex systems have to execute more difficult tasks. Generally, MAC protocols for wireless sensor networks attempt to reduce the energy consumption using duty cycling mechanism which means the nodes periodically sleep and wake. However, in the duty cycling mechanism. a node should wait until the target node wakes and the sleep latency increases as the number of hops increases. This sleep latency can be serious problem in complex and sensitive systems which require high speed data transfer like military, wing of airplane, and telematics. In this paper, we propose a solution for reducing transmission latency through distributed duty cycling (DDC) in wireless sensor networks. The proposed algorithm is evaluated with real-deployment experiments using CC2420DBK and the experiment results show that the DDC algorithm reduces the transmission latency significantly and reduces also the energy consumption.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.11
• /
• pp.2640-2644
• /
• 2014

With the development of technology, wireless sensor networks (WSN) are wireless networks of consisting a large number of small and low-cost sensors. Wireless sensor networks facilitate collaboration to achieve the perception of information collection, processing and transmission tasks in deployment area. They have various purposes such as military, disaster relief, medical rescue, environmental monitoring, precision farming and manufacturing industry etc. Therefore, technologies for data maintaining technologies in sensor network environment is one of essential parts of sensor networks. In this paper, we present the essential particulars about data management technology at wireless sensor network environments and propound the issues. Further, we could organize and develop a systematic approach in solving the issues.

• Journal of Korea Multimedia Society
• /
• v.12 no.10
• /
• pp.1478-1485
• /
• 2009

A sensor network which is composed of a large number of sensors that perform various sensing is applied in a variety of fields. The sensor networks can be widely used for various application area like as home automation, fire detection and security area. Development of new sensor to have appropriate functions and deployment of networks for suitable application are served actively. In this paper, we design and implement a system that monitors various factory facilities by deploying sensor network at a working place which threatens the worker's safety. A sensor node reports its sensing data like as temperature and humidity to monitor facilities to a sink node. And the server which is connect to the sink node gathers and provides information by user interface. In addition, digital data which are generated at a work place can be transferred via the sensor network to increase the efficiency of works. The proposed sensor network provides the convenience of working, since it is deployed at a garbage collection company to monitor a temperature and humidity of garbage and to transmit data about the weight of trucks which enters the company.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.1291-1293
• /
• 2007

Due to dense deployment and innumerable amount of traffic flow in wireless sensor networks (WSNs), congestion becomes more common phenomenon from simple periodic traffic to unpredictable bursts of messages triggered by external events. Even for simple network topology and periodic traffic, congestion is a likely event due to dynamically time varying wireless channel condition and contention caused due to interference by concurrent transmissions. In this paper, we have proposed three mechanisms: upstream source count and buffer based rate control and snoop based MAC level ACK scheme to avoid congestion. The simulation results show that our proposed mechanism achieves around 80% delivery ratio even under bursty traffic condition

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.662-664
• /
• 2011

무선 센서 네트워크에서 관심지역이 각 센서에 의하여 얼마나 잘 센싱되는지의 정도에 대한 커버리지(coverage)와 센서에 의하여 센싱된 데이터를 싱크노드까지 얼마나 잘 전달될 수 있는지의 정도에 관한 연결성(connectivity)은 중요한 연구 분야이다. 이와 관련하여 본 논문에서는 센서 네트워크에서 p-coverage와 q-connectivity ($q{\leq}6$)를 만족하는 최적의 센서 배치패턴 문제에 관한 연구 결과를 기술한다. 특히, 1-coverage의 경우 최적이라 알려진 삼각 격자 패턴에 대하여 p-coverage와 6-connectivity을 만족하도록 하는 배치 방법을 제시한다.

• 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.6 no.3
• /
• pp.413-434
• /
• 2010

Wireless sensor networks are usually characterized by dense deployment of energy constrained nodes. Due to the usage of a large number of sensor nodes in uncontrolled hostile or harsh environments, node failure is a common event in these systems. Another common reason for node failure is the exhaustion of their energy resources and node inactivation. Such failures can have adverse effects on the quality of the real-time services in Wireless Sensor Networks (WSNs). To avoid such degradations, it is necessary that the failures be recovered in a proper manner to sustain network operation. In this paper we present a dynamic Energy efficient Real-Time Job Allocation (ERTJA) algorithm for handling node failures in a cluster of sensor nodes with the consideration of communication energy and time overheads besides the nodes' characteristics. ERTJA relies on the computation power of cluster members for handling a node failure. It also tries to minimize the energy consumption of the cluster by minimum activation of the sleeping nodes. The resulting system can then guarantee the Quality of Service (QoS) of the cluster application. Further, when the number of sleeping nodes is limited, the proposed algorithm uses the idle times of the active nodes to engage a graceful QoS degradation in the cluster. Simulation results show significant performance improvements of ERTJA in terms of the energy conservation and the probability of meeting deadlines compared with the other studied algorithms.