• 한국멀티미디어학회논문지
• /
• 제20권11호
• /
• pp.1776-1784
• /
• 2017

There are two types of WSN(wireless sensor networks) in terms of sensor node's capability, that is, homogeneous or heterogeneous WSN. Even though the latter has better performance than the former, it requires some overhead for deploying nodes or clustering the network. In this paper, we propose a new scheme, called VHS(Virtual Heterogenous Sensor-Network), which uses a homogeneous WSN regarding energy in a heterogeneous way. The proposed scheme's performance has been evaluated and compared with other homogeneous schemes by simulation. The results are shown to be better than the other existing homogeneous schemes used in a sample sensor network application.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.13-14
• /
• 2007

We propose HERAH(Hierarchical Energy-Aware Routing Algorithm for Heterogeneous Wireless Sensor Networks) that is the hierarchical routing algorithm in WSNs and is established on heterogeneous environment. HERAH performs CH selection by considering residual energy level and uses multi-hop communication within cluster. So, HERAH makes improvements in the energy savings and the network lifetime compared with LEACH.

• 한국신뢰성학회지:신뢰성응용연구
• /
• 제5권4호
• /
• pp.465-486
• /
• 2005

A unreliable network system results in unsatisfied performance. A performance criterion of a network is throughput and availability. One of the most compelling technological advances of this decade has been the advent of deploying wireless networks of heterogeneous smart sensor nodes for complex information gathering tasks, The advancement and popularization of wireless communication technologies make more efficiency to network devices with wireless technology than with wired technology. Recently, the research of wireless sensor network has been drawing much attentions. In this paper, We evaluate throughput and availability of wireless sensor network, which have hierarchical structure based on clustering and estimate the maximum hroughput, average throughput and availability of the network considering several link failure patterns likely to happen at a cluster consisted of sensor nodes. Also increasing a number of sensor nodes in a cluster, We analysis the average throughput and availability of the network.

• International Journal of Internet, Broadcasting and Communication
• /
• 제12권3호
• /
• pp.32-38
• /
• 2020

The deployment of geographically distributed wireless sensors has greatly elevated the capability of monitoring structural health in social-overhead capital (SOC) public infrastructures. This paper deals with the utilization of a distributed mobility management (DMM) approach for the deployment of wireless sensing devices in a structural health monitoring system (SHM). Then, a wireless sensing mechanism utilizing low-energy adaptive clustering hierarchy (LEACH)-based clustering algorithm for smart sensors has been analyzed to support the seamless data transmission of structural health information which is essentially important to guarantee public safety. The clustering of smart sensors will be able to provide real-time monitoring of structural health and a filtering algorithm to boost the transmission of critical information over heterogeneous wireless and mobile networks.

• Journal of Computing Science and Engineering
• /
• 제9권4호
• /
• pp.163-176
• /
• 2015

Self-organization of distributed wireless sensor nodes is a critical issue in wireless sensor networks (WSNs), since each sensor node has limited energy, bandwidth, and scalability. These issues prevent sensor nodes from actively collaborating with the other types of sensor nodes deployed in a typical heterogeneous and somewhat hostile environment. The automated self-organization of a WSN becomes more challenging as the number of sensor nodes increases in the network. In this paper, we propose a dynamic self-organized architecture that combines tree topology with a drawn-grid algorithm to automate the self-organization process for WSNs. In order to make our proposed architecture scalable, we assume that all participating active sensor nodes are unaware of their primary locations. In particular, this paper presents two algorithms called active-tree and drawn-grid. The proposed active-tree algorithm uses a tree topology to assign node IDs and define different roles to each participating sensor node. On the other hand, the drawn-grid algorithm divides the sensor nodes into cells with respect to the radio coverage area and the specific roles assigned by the active-tree algorithm. Thus, both proposed algorithms collaborate with each other to automate the self-organizing process for WSNs. The numerical and simulation results demonstrate that the proposed dynamic architecture performs much better than a static architecture in terms of the self-organization of wireless sensor nodes and energy consumption.

• 전기전자학회논문지
• /
• 제13권1호
• /
• pp.71-76
• /
• 2009

As one of the most important requirements for wireless sensor networks, prolonging network lifetime can be realized by minimizing energy consumption in cluster heads as well as sensor nodes. While most of the previous researches have focused on the energy of sensor nodes, we devote our attention to cluster heads because they are most dominant source of power consumption in the cluster-based sensor networks. Therefore, we seek to minimize energy consumption by minimizing the maximum(MINMAX) energy dissipation at each cluster heads. This work requires energy-efficient clustering of the sensor nodes while satisfying given energy constraints. In this paper, we present a constraint satisfaction modeling of cluster-based routing in a heterogeneous sensor networks because mixed integer programming cannot provide solutions to this MINMAX problem. Computational experiments show that substantial energy savings can be obtained with the MINMAX algorithm in comparison with a minimum total energy(MTE) strategy.

• 한국위성정보통신학회논문지
• /
• 제11권3호
• /
• pp.123-126
• /
• 2016

무선 센서 네트워크 하에서 불균일 네트워크의 에너지 효율은 주요 이슈 중의 하나로 고려된다. 불균일 네트워크에서, 개별 노드 초기 에너지의 무작위 분포는 네트워크 불안정을 초래할 수 있다. 따라서 네트워크 상 각 노드의 동작 시간 증가와 에너지 소비의 공평성 유지를 위해서는 적합한 방법이 마련되어야 한다. 본 논문에서는 서로 다른 시나리오의 불균일 네트워크 하의 분산 클러스터링 프로토콜(DCP)의 성능 평가를 보여준다. 본 시뮬레이션 결과는 불균일 네트워크에서의 LEACH 프로토콜 결과와 비교하였다. 추가적으로 불균일 네트워크에서의 시스템 성능을 균일 네트워크와 비교함으로써, 불균형 초기 에너지가 시스템의 개별 노드의 수명에 미치는 영향을 설명한다. 시뮬레이션 수행 결과 균일 및 불균일 네트워크에서 LEACH 프로토콜과의 성능 비교 결과는 DCP의 성능이 모든 경우에 성능 우위에 있음을 나타내었다.

• Smart Structures and Systems
• /
• 제5권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.

• 대한임베디드공학회논문지
• /
• 제2권4호
• /
• pp.242-250
• /
• 2007

Wireless sensor networks are subject to highly heterogeneous system requirements in terms of their functionality and performance due to their broad application areas. Though the heterogeneity hinders the opportunity of developing a single universal platform for sensor networks, efforts to provide uniform, inter-operable and scalable ones for sensor networks are still essential for the growth of the industry as well as their technological advance. As a part of our work to develop such a robust platform, this paper presents the software architecture for sensor nodes with focus on our sensor node operating system and its configuration methodology. Addressing principle issues in its design space which includes programming, execution, task scheduling and software layer models, our architecture is highly reconfigurable with respect to system resources and functional requirements and also highly efficient in supporting multi-threading under small system resources.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권4호
• /
• pp.1692-1711
• /
• 2016

Energy is a scarce resource in wireless sensor networks (WSNs). A variety of clustering protocols for WSNs, such as the zone-based stable election protocol-enhanced (ZSEP-E), have been developed for energy optimization. The ZSEP-E is a heterogeneous zone-based clustering protocol that focuses on unbalanced energy consumption with parallel formation of clusters in zones and election of cluster heads (CHs). Most ZSEP-E research has assumed probabilistic election of CHs in the zones by considering the maximum residual energy of nodes. However, studies of the diverse CH election parameters are lacking. We investigated the performance of the ZSEP-E in such scenarios using a fuzzy logic approach based on three descriptors, i.e., energy, density, and the distance from the node to the base station. We proposed an efficient ZSEP-E scheme to adapt and elect CHs in zones using fuzzy variables and evaluated its performance for different energy levels in the zones.