• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.860-863
• /
• 2010

Wireless sensor networks consist of small, autonomous devices with wireless networking capabilities. In order to further increase the applicability in real world applications, minimizing energy consumption is one of the most critical issues. Therefore, accurate energy model is required for the evaluation of wireless sensor networks. In this paper, we analyze the energy consumption for wireless sensor networks. To estimate the lifetime of sensor node, we have measured the energy characteristics of sensor node based on Telosb platforms running TinyOS. Based on the proposed model, the estimated lifetime of a battery powered sensor node can use about 6.925 months for 10 times motion detection per hour.

• 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.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.6
• /
• pp.127-134
• /
• 2016

WBSN (Wireless Body Sensor Network), also called WBAN (Wireless Body Area Networks) generally, is a kind of WSN (Wireless Sensor Network) applications, which is composed of the various sensor nodes residing in human body embodied or in wearable way. The measured data at each sensor node in WBSN requires being synchronized at sink node for exact analysis for status of human body, which is like WSN. Although many time synchronization protocols for WSN has been already developed, they are not appropriate to WBSN. In this paper, a new time synchronization protocol for WBSN considering the characteristics of WBSN is proposed. The proposed scheme is not only simple, but also consumes less power, leading to increasing network life time. We will show that the proposed scheme is appropriate to WBSN by evaluating its performance by simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5286-5306
• /
• 2016

Emerging applications in automation, medical imaging, traffic monitoring and surveillance need real-time data transmission over Wireless Sensor Networks (WSNs). Guaranteeing Quality of Service (QoS) for real-time traffic over WSNs creates new challenges. Rapid penetration of smart devices, standardization of Machine Type Communications (MTC) in next generation 5G wireless networks have added new dimensions in these challenges. In order to satisfy such precise QoS constraints, in this paper, we propose a new cross-layer QoS-provisioning strategy in Wireless Multimedia Sensor Networks (WMSNs). The network layer performs statistical estimation of sensory QoS parameters. Identifying QoS-routing problem with multiple objectives as NP-complete, it discovers near-optimal QoS-routes by using evolutionary genetic algorithms. Subsequently, the Medium Access Control (MAC) layer classifies the packets, automatically adapts the contention window, based on QoS requirements and transmits the data by using routing information obtained by the network layer. Performance analysis is carried out to get an estimate of the overall system. Through the simulation results, it is manifested that the proposed strategy is able to achieve better throughput and significant lower delay, at the expense of negligible energy consumption, in comparison to existing WMSN QoS protocols.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.1
• /
• pp.87-94
• /
• 2019

A wireless sensor network is emerging technology and intelligent wireless communication paradigm that is dynamically aware of its surrounding environment. It is also able to respond to it in order to achieve reliable and efficient communication. The dynamical cognition capability and environmental adaptability rely on organizing dynamical networks effectively. However, optimally clustering the cognitive wireless sensor networks is an NP-complete problem. The objective of this paper is to develop an optimal sensor network design for maximizing the performance. This proposed Ranking Artificial Bee Colony (RABC) is developed based on Artificial Bee Colony (ABC) with ranking strategy. The ranking strategy can make the much better solutions by combining the best solutions so far and add these solutions in the solution population when applying ABC. RABC is designed to adapt to topological changes to any network graph in a time. We can minimize the total energy dissipation of sensors to prolong the lifetime of a network to balance the energy consumption of all nodes with robust optimal solution. Simulation results show that the performance of our proposed RABC is better than those of previous methods (LEACH, LEACH-C, and etc.) in wireless sensor networks. Our proposed method is the best for the 100 node-network example when the Sink node is centrally located.

• Journal of KIISE:Information Networking
• /
• v.36 no.2
• /
• pp.98-107
• /
• 2009

In this paper, we propose a novel centralized energy-efficient clustering algorithm, called "MCCA : Max k-Cut based Clustering Algorithm for Wireless Sensor Networks." The algorithm does not use location information and constructs clusters via a distributive Max k-Cut based cluster-head election method, where only relative and approximate distance information with neighbor nodes is used and nodes, not having enough energy, are excluded for cluster-heads for a specific period. We show that the energy efficiency performance of MCCA is better than that of LEACH, EECS and similar to BCDCP's by simulation studies.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.6
• /
• pp.1487-1495
• /
• 2013

Time synchronization is a prerequisite in wireless sensor network applications such as object tracking, consistent state update, duplication detection, and temporal order delivery. This paper analyze time synchronization accuracy of pair-wise time synchronization algorithm which is a typical time synchronization model of time synchronization method in wireless sensor networks. In addition, the analyzed results are verified by simulations. These results can be utilized for performance improvement or development of time synchronization in wireless sensor networks.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1999-2005
• /
• 2005

Collaboration in wireless sensor networks must be fault-tolerant due to the harsh environmental conditions in which such networks can be deployed. This paper focuses on finding signal processing algorithms for collaborative target detection based on the generalized approach to signal processing in the presence of noise that are efficient in terms of communication cost, precision, accuracy, and number of faulty sensors tolerable in the wireless sensor network. Two algorithms, namely, value fusion and decision fusion constructed according to the generalized approach to signal processing in the presence of noise, are identified first. When comparing their performance and communication overhead, decision fusion is found to become superior to value fusion as the ratio of faulty sensors to fault free sensors increases. The use of the generalized approach to signal processing in the presence of noise under designing value and decision fusion algorithms in wireless sensor networks allows us to obtain the same performance, but at low values of signal energy, as under the employment of universally adopted signal processing algorithms widely used in practice.

• Smart Structures and Systems
• /
• v.5 no.4
• /
• pp.415-426
• /
• 2009

This study focuses on the concept of multi-scale wireless sensor networks for damage detection in civil infrastructure systems by first over viewing the general network philosophy and attributes in the areas of data acquisition, data reduction, assessment and decision making. The data acquisition aspect includes a scalable wireless sensor network acquiring acceleration and strain data, triggered using a Restricted Input Network Activation scheme (RINAS) that extends network lifetime and reduces the size of the requisite undamaged reference pool. Major emphasis is given in this study to data reduction and assessment aspects that enable a decentralized approach operating within the hardware and power constraints of wireless sensor networks to avoid issues associated with packet loss, synchronization and latency. After over viewing various models for data reduction, the concept of a data-driven Bivariate Regressive Adaptive INdex (BRAIN) for damage detection is presented. Subsequent examples using experimental and simulated data verify two major hypotheses related to the BRAIN concept: (i) data-driven damage metrics are more robust and reliable than their counterparts and (ii) the use of heterogeneous sensing enhances overall detection capability of such data-driven damage metrics.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.4
• /
• pp.63-70
• /
• 2015

The numerous improved schemes of user authentication based on password have been proposed in order to prevent the data access from the unauthorized person. The importance of user authentication has been remarkably growing in the expanding application areas of wireless sensor networks. Recently, emerging wireless sensor networks possesses a hierarchy among the nodes which are divided into cluster heads and sensor nodes. Such hierarchical wireless sensor networks have more operational advantages by reducing the energy consumption and traffic load. In 2012, Das et al. proposed a user authentication scheme to be applicable for the hierarchical wireless sensor networks. Das et al. claimed that their scheme is effectively secure against the various security flaws. In this paper, author will prove that Das et al.'s scheme is still vulnerable to man-in-the-middle attack, password guessing/change attack and does not support mutual authentication between the user and the cluster heads.