• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.857-860
• /
• 2008

In this paper, we proposed cooperative based localization algorithm for wireless sensor networks, which can estimate to unknown node position using received signal strength table set. The unknown nodes are monitor to RSS from neighbor nodes and exclude existence possibility area of sensor node in sensor field. Finally, we can calculate the centroid position for each unknown node with cooperative localization algorithm. Furthermore, these processes are applied iteratively about all nodes which is recorded to RSS table and can estimate for unknown nodes.

• Journal of Sensor Science and Technology
• /
• v.22 no.1
• /
• pp.18-27
• /
• 2013

Real-time monitoring is one of the prime necessities in a weapon flight test that is required for the efficient and timely collection of large amounts of high-rate sampled data acquired by an event-trigger. The wireless sensor network is a good candidate to resolve this requirement, especially considering the inhospitable environment of a weapon flight test. In this paper, we propose a priority based multi-channel MAC protocol with CSMA/CA over a single radio for a real-time monitoring of a weapon flight test. Multi-channel transmissions of nodes can improve the network performance in wireless sensor networks. Our proposed MAC protocol has two operation modes: Normal mode and Priority Mode. In the normal mode, the node exploits the normal CSMA/CA mechanism. In the priority mode, the node has one of three grades - Class A, B, and C. The node uses a different CSMA/CA mechanism according to its grade that is determined by a signal level. High grade nodes can exploit more channels and lower backoff exponents than low ones, which allow high grade nodes to obtain more transmission opportunities. In addition, it can guarantee successful transmission of important data generated by high grade nodes. Simulation results show that the proposed MAC exhibits excellent performance in an event-triggered real-time application.

• Journal of Communications and Networks
• /
• v.11 no.4
• /
• pp.327-336
• /
• 2009

Geographic routing has been considered as an attractive approach in wireless sensor networks, since it routes data packets by using location information rather than global topology information. In geographic routing schemes, packets are usually sent along the boundary of a hole by face routing to detour the hole. As result, all data flows which need to detour the hole are concentrated on the boundary of the hole. This hole detour scheme results in much more energy consumption for nodes at the hole boundary, and the energy exhaustion of hole boundary nodes enlarges the holes. This is referred to as a hole diffusion problem. The perimeter mode may also lead to data collisions on the hole boundary nodes if multiple data flows need to bypass a hole simultaneously. In this paper, we propose a hole modeling and detour scheme for geographic routing in wire-less sensor networks. Our hole modeling and detour scheme can efficiently prevent hole diffusion, avoid the local minimum problem faced by geographic routing protocols, and reduce data collisions on the hole boundary nodes. Simulation results show that the proposed scheme is superior to the other protocols in terms of control overhead, average delivery delay and energy consumption.

• Annual Conference of KIPS
• /
• 2013.05a
• /
• pp.495-497
• /
• 2013

Wireless sensor networks (WSNs) have emerged as an attractive and key research area over the last decade. Time synchronization is a vital part of infrastructure for any distributed system. In embedded sensor networks, time synchronization is an essential service for correlating data among nodes and communication scheduling. This is realized by exchanging messages that are time stamped using the local clocks on the nodes. Various time synchronization protocols have been proposed aiming to attain high synchronization accuracy, high efficiency and low communication overhead. However, it requires that the time between resynchronization intervals to be as large as possible to obtain a system which is energy efficient having low communication overhead. This paper presents a simple but effective skew compensation algorithm that measures the skew rate of the sensor nodes with respect to the reference node and calibrates itself to compensate for the difference in the frequencies of the nodes. The proposed method can be incorporated with any existing time synchronization protocol for WSNs.

• Journal of Information Processing Systems
• /
• v.17 no.1
• /
• pp.63-74
• /
• 2021

According to the double-phase cluster-head election method (DCE), the final cluster heads (CHs) sometimes are located at the edge of cluster. They have a long distance from the base station (BS). Sensor data is directly transmitted to BS by CHs. This makes some nodes consume much energy for transmitting data and die earlier. To address this problem, energy efficient multi-hop cluster-head election strategy (EEMCE) is proposed in this paper. To avoid taking these nodes far from BS as CH, this strategy first introduces the distance from the sensor nodes to the BS into the tentative CH election. Subsequently, in the same cluster, the energy of tentative CH is compared with those of other nodes, and then the node that has more energy than the tentative CH and being nearest the tentative CH are taken as the final CH. Lastly, if the CH is located at the periphery of the network, the multi-hop method will be employed to reduce the energy that is consumed by CHs. The simulation results suggest that the proposed method exhibits higher energy efficiency, longer stability period and better scalability than other protocols.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.29-42
• /
• 2011

Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way, since their energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor networks. In this paper, we introduce a clustering protocol with mode selection (CPMS) for wireless sensor networks. Our scheme improves the performance of BCDCP (Base Station Controlled Dynamic Clustering Protocol) and BIDRP (Base Station Initiated Dynamic Routing Protocol) routing protocol. In CPMS, the base station constructs clusters and makes the head node with the highest residual energy send data to the base station. Furthermore, we can save the energy of head nodes by using the modes selection method. The simulation results show that CPMS achieves longer lifetime and more data message transmissions than current important clustering protocols in wireless sensor networks.

• Journal of Advanced Navigation Technology
• /
• v.11 no.4
• /
• pp.408-414
• /
• 2007

Research advances in the areas of micro-sensor device and wireless network technology, has made it possible to develop energy efficient and low cost wireless sensor nodes. In this paper, the forward error control (FEC) scheme for lower power consumption and excellent BER(Bit Error Rate) performance during transmission propose in multi-hop wireless sensor network based on FSK modem. The FEC technique uses extra processing power related to encoding and decoding, it is need complex functions to be built into the sensor node. The probability of receiving a correct bit and codeword for relaying a frame over h nodes to the sink node is calculated as a function of channel parameter, number of hops, number of bits transmitted and the distance between the different nodes.

• ETRI Journal
• /
• v.30 no.1
• /
• pp.13-20
• /
• 2008

We evaluate the sink capacity of wireless code division multiple access (CDMA) sensor networks with layered architecture. We introduce a model of interference at a sink considering two kinds of interference: multiple access interference (MAI) and node interference (NI). We also investigate the activity of sensor nodes around the sink in relation to gathering data under a layered architecture. Based on the interference model and the activity of sensor nodes around the sink, we derive the failure probability of the transmission from a source node located one hop away from the sink using Gaussian approximation. Under the requirement of 1% failure probability of transmission, we determine the sink capacity, which is defined as the maximum number of concurrent sensor nodes located one hop away from the sink. We demonstrate that as the node activity of the MAI decreases, the variation of the sink capacity due to the node activity of the NI becomes more significant. The analysis results are verified through computer simulations.

• Journal of information and communication convergence engineering
• /
• v.5 no.4
• /
• pp.382-388
• /
• 2007

Indoor location system using wireless sensor network technology was applied for the status evaluation and activity monitoring of elderly person or chronic invalid at home. Location awareness application is transparent to the daily activities, while providing the embedded computing infrastructure with an awareness of what is happening in this space. To locate an object, the active ceiling-mounted reference beacons were placed throughout the building. Reference beacons periodically publish location information on RF and ultrasonic signals to allow application running on mobile or static nodes to study and determine their physical location. Once object-carried passive listener receives the information, it subsequently determines it's location from reference beacons. By using only the sensor nodes without any external network infrastructure the cost of the system was reduced while the accuracy in our experiments. was fairly good and fine grained between 7 and 15 cm for location awareness in indoor environments. Passive architecture used here provides the security of the user privacy while at the server the privacy was secured by providing the authentication using Geopriv approach. This information from sensor nodes is further forwarded to base station where further computation is performed to determine the current position of object and several applications are enabled for context awareness.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1426-1434
• /
• 2009

RFID/USN is considered as a key convergence technology in future ubiquitous network. In RFID/USN, the power saving issue receives a great attention due to limited battery lifetime of sensor node. In this paper, we propose a new power saving algorithm, which takes advantage of long-term sleep period. To provide a full network connectivity and balance the battery consumption among sensor nodes, the proposed algorithm intelligently selects the long-term sleep sensor nodes. With mathematical analysis and simulations, we prove that the proposed algorithm can significantly reduce the power consumption of sensor nodes as compared to existing algorithms.