• 한국컴퓨터정보학회논문지
• /
• 제21권2호
• /
• pp.51-60
• /
• 2016

This paper proposes a hierarchical routing algorithm for enhancing survivability of sensor nodes on WSAN. Proposed algorithm has two important parts. The first is a clustering algorithm that uses distance between sensor and actor, and remaining energy of sensor nodes for selecting cluster head. It will induce uniform energy consumption, and this has a beneficial effect on network lifetime. The second is an enhanced routing algorithm that uses the shortest path tree. The energy efficient routing is very important in WSAN which has energy limitation. As a result, proposed algorithm extends network and nodes lifetime through consuming energy efficiently. Simulation results show that the proposed clustering algorithm outperforms conventional routing algorithms such as VDSPT in terms of node and network life time, delay, fairness, and data transmission ratio to BS.

• 한국시뮬레이션학회논문지
• /
• 제14권3호
• /
• pp.33-42
• /
• 2005

One of the imminent problems to be solved within wireless sensor network is to balance out energy dissipation among deployed sensor nodes. In this paper, we present a transmission relay method of communications between BS (Base Station) and CHs (Cluster Heads) for balancing the energy consumption and extending the average lifetime of sensor nodes by the fuzzy logic application. The proposed method is designed based on LEACH protocol. The area deployed by sensor nodes is divided into two groups based on distance from BS to the nodes. RCH (Relay Cluster Head) relays transmissions from CH to BS if the CH is in the area far away from BS in order to reduce the energy consumption. RCH decides whether to relay the transmissions based on the threshold distance value that is obtained as a output of fuzzy logic system, Our simulation result shows that the application of fuzzy logic provides the better balancing of energy depletion and prolonged lifetime of the nodes.

• International Journal of Internet, Broadcasting and Communication
• /
• 제13권3호
• /
• pp.25-33
• /
• 2021

Energy-harvesting wireless sensor networks(EH-WSNs) can collect energy from the environment and overcome the technical limitations of existing power. Since the transmission distance in a wireless sensor network is limited, the data are delivered to the destination node through multi-hop routing. In EH-WSNs, the routing protocol should consider the power situations of nodes, which is determined by the remaining power and energy-harvesting rate. In addition, in applications such as environmental monitoring, when there are urgent data, the routing protocol should be able to transmit it stably and quickly. This paper proposes an adaptive routing protocol that satisfies different requirements of normal and urgent data. To extend network lifetime, the proposed routing protocol reduces power imbalance for normal data and also minimizes transmission latency by controlling the transmission power for urgent data. Simulation results show that the proposed adaptive routing can improve network lifetime by mitigating the power imbalance and greatly reduce the transmission delay of urgent data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권6호
• /
• pp.1357-1378
• /
• 2013

Energy constraint of wireless sensor networks makes energy saving and prolonging the network lifetime become the most important goals of routing protocols. In this paper, we propose an Energy Efficient Chain-based Routing Protocol (EECRP) for wireless sensor networks to minimize energy consumption and transmission delay. EECRP organizes sensor nodes into a set of horizontal chains and a vertical chain. Chain heads are elected based on the residual energy of nodes and distance from the header of upper level. In each horizontal chain, sensor nodes transmit their data to their own chain head based on chain routing mechanism. EECRP also adopts a chain-based data transmission mechanism for sending data packets from the chain heads to the base station. The simulation results show that EECRP outperforms LEACH, PEGASIS and ECCP in terms of network lifetime, energy consumption, number of data messages received at the base station, transmission delay and especially energy${\times}$delay metric.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5437-5454
• /
• 2016

A Wireless Sensor Network (WSN) is composed of several sensor nodes which are severely restricted to energy and memory. Energy is the lifeblood of sensors and thus energy conservation is a critical necessity of WSN. This paper proposes a clustering algorithm namely Energy Efficient Trustworthy Clustering algorithm (EETCA), which focuses on three phases such as chief node election, chief node recycling process and bi-level trust computation. The chief node election is achieved by Dempster-Shafer theory based on trust. In the second phase, the selected chief node is recycled with respect to the current available energy. The final phase is concerned with the computation of bi-level trust, which is triggered for every time interval. This is to check the trustworthiness of the participating nodes. The nodes below the fixed trust threshold are blocked, so as to ensure trustworthiness. The system consumes lesser energy, as all the nodes behave normally and unwanted energy consumption is completely weeded out. The experimental results of EETCA are satisfactory in terms of reduced energy consumption and prolonged lifetime of the network.

• Journal of information and communication convergence engineering
• /
• 제22권1호
• /
• pp.1-6
• /
• 2024

Energy efficiency in wireless sensor networks (WSNs) is a critical issue because batteries are used for operation and communication. In terms of scalability, energy efficiency, data integration, and resilience, WSN-cluster-based routing algorithms often outperform routing algorithms without clustering. Low-energy adaptive clustering hierarchy (LEACH) is a cluster-based routing protocol with a high transmission efficiency to the base station. In this paper, we propose an energy consumption model for LEACH and compare it with the existing LEACH, advanced LEACH (ALEACH), and power-efficient gathering in sensor information systems (PEGASIS) algorithms in terms of network lifetime. The energy consumption model comprises energy-sensitive cluster formation and a cluster head selection technique. The setup and steady-state phases of the proposed model are discussed based on the cluster head selection. The simulation results demonstrated that a low-energy-consumption network was introduced, modeled, and validated for LEACH.

• 정보처리학회논문지C
• /
• 제14C권2호
• /
• pp.185-190
• /
• 2007

무선 센서 네트워크의 각 센서 노드는 배터리 기반의 제한된 에너지로 동작하기 때문에 무선 센서 네트워크에서의 효율적인 에너지 사용에 많은 연구가 이루어지고 있다. 무선 센서 네트워크의 수명을 연장하기 위해서는 무선 센서 네트워크에 존재하는 각 센서 노드들의 전력소비를 줄이는 것도 필요하지만 센서 노드들의 균일한 에너지 소비를 유도하여 가능한 많은 노드들이 생존하는 것이 망의 수명에 더욱 중요한 요인이 된다. 본 논문에서는 클러스터링 기반 라우팅 프로토콜인 LEACH를 기반으로 각 노드의 잔이 에너지를 고려하여 전체 노드의 균형적인 에너지 소모를 유도하는 클러스터 헤드 선정 알고리즘을 제안한다. 제안한 프로토콜에 대해서 시뮬레이션을 기반으로 네트워크 수명에 대한 분석을 수행하였다. 제안한 프로토콜은 심각한 오버헤드나 성능저하 없이 효과적으로 네트워크 수명을 연장하였다.

• 한국군사과학기술학회지
• /
• 제13권5호
• /
• pp.875-885
• /
• 2010

Recently, the role of Ubiquitous Sensor Network(USN) has been considered to be essential for supporting the near future Network Centric Warfare(NCW) and Tactical Information Communication Network(TICN). In this paper, we explore a set of data storage methods(external storage, local storage and data storage) and query processing methods in WSN. In particular, we focus on analyzing a novel data structure for supporting the local storage method, named the partial ordered tree(POT). The main idea behind POT is that sensor readings are usually correlated with the physical spatial domain. With the help of POT, only a small portion of sensor nodes participate in query processing tasks, and thus network lifetime is greatly increased. Through a series of simulation experiments, we demonstrate that the POT based local storage method clearly outperforms the existing data storage methods in terms of the energy-efficiency, which directly affects the network lifetime, for processing exact match queries, range queries and top-k queries.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권9호
• /
• pp.3034-3055
• /
• 2014

Wireless Sensor Networks have extensively been utilized for ambient data collection from simple linear structures to dense tiered deployments. Issues related to optimal resource allocation still persist for simplistic deployments including linear and hierarchical networks. In this work, we investigate the case of dimensioning parameters for linear and tiered wireless sensor network deployments with notion of providing extended lifetime and reliable data delivery over extensive infrastructures. We provide a single consolidated reference for selection of intrinsic sensor network parameters like number of required nodes for deployment over specified area, network operational lifetime, data aggregation requirements, energy dissipation concerns and communication channel related signal reliability. The dimensioning parameters have been analyzed in a pipeline monitoring scenario using ZigBee communication platform and subsequently referred with analytical models to ensure the dimensioning process is reflected in real world deployment with minimum resource consumption and best network connectivity. Concerns over data aggregation and routing delay minimization have been discussed with possible solutions. Finally, we propose a node placement strategy based on a dynamic programming model for achieving reliable received signals and consistent application in structural health monitoring with multi hop and long distance connectivity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권9호
• /
• pp.3468-3495
• /
• 2015

In this paper, we present a multi-chain based hierarchical topology control algorithm (MCHTC) for wireless sensor networks. In this algorithm, the topology control process using static clustering is divided into sensing layer that is composed by sensor nodes and multi-hop data forwarding layer that is composed by leader nodes. The communication cost and residual energy of nodes are considered to organize nodes into a chain in each cluster, and leader nodes form a tree topology. Leader nodes are elected based on the residual energy and distance between themselves and the base station. Analysis and simulation results show that MCHTC outperforms LEACH, PEGASIS and IEEPB in terms of network lifetime, energy consumption and network energy balance.