scispace - formally typeset
Proceedings ArticleDOI

An power efficient algorithm for distributed ad-hoc cluster based Wireless Sensor Networks

Reads0
Chats0
TLDR
An algorithm is proposed, which does not have a fixed infrastructure ie.
Abstract
Wireless Sensor Networks (WSNs) are gaining much importance due to their varied characteristics and the ease with which they can be implemented in various environments to suit different purposes. The sensor nodes which are the main components of WSNs are typically battery equipped and difficult to recharge. Hence, the primary concern while designing such networks is to reduce the overall power consumption in order to prolong the network lifetime An efficient energy conservation technique and algorithm in order to generate a network with desired properties while reducing sensor's energy consumption are discussed and shown through simulation in this paper. Here we have proposed an algorithm, which does not have a fixed infrastructure ie., it is Ad-Hoc in nature, for reducing the overall energy usage by means of periodic coordination amongst Gateway Nodes and Base station.

read more

Citations
More filters
Proceedings ArticleDOI

Performance evaluation of Distance based Angular Clustering Algorithm (DACA) using data aggregation for heterogeneous WSN

TL;DR: distance based Angular Clustering Algorithm (DACA) with data aggregation techniques is used and to make sure the improvement, computation of various parameters are processed i.e. delay, throughput, network load, number of packets lost, PDR, jitter and packet efficiency.
Journal ArticleDOI

Dynamic Clustering Algorithm for Tracking Targets with High and Variable Celerity ATHVC

TL;DR: This work proposes to build optimal dynamic clusters on the target trajectory to increase energy efficiency and integrates for the first time, to the knowledge, strategies to avoid overlapping clusters and a model to wake up the sensors, adapting to the context of targets with large and variable speed.
Proceedings ArticleDOI

Distance based Angular Clustering Algorithm (DACA) for heterogeneous wireless sensor networks

TL;DR: A Distance based Angular Clustering Algorithm (DACA) on heterogeneous network which will overcome the path formation and non-coverage area problem by combining the data-aggregation algorithm to prolong the lifetime of wireless network.
Proceedings ArticleDOI

Dynamic Clustering Algorithm for Tracking Target with High and Variable Celerity

TL;DR: This work proposes to build optimal dynamic clusters on the target trajectory to increase energy efficiency and integrates for the first time, to the knowledge, strategies to avoid overlapping clusters and a model to wake up the sensors, adapting to the context of targets with large and variable speed.
References
More filters
Journal Article

Geography-informed Energy Conservation for Ad Hoc Routing

TL;DR: In this article, the authors proposed a geographical adaptive fidelity (GAF) algorithm that reduces energy consumption in ad hoc wireless networks by identifying nodes that are equivalent from a routing perspective and turning off unnecessary nodes, keeping a constant level of routing fidelity.
Proceedings ArticleDOI

Geography-informed energy conservation for Ad Hoc routing

TL;DR: A geographical adaptive fidelity algorithm that reduces energy consumption in ad hoc wireless networks by identifying nodes that are equivalent from a routing perspective and then turning off unnecessary nodes, keeping a constant level of routing fidelity.
Journal Article

Comparative Study of Wireless Sensor Networks Energy-Efficient Topologies and Power Save Protocols

TL;DR: This paper addresses issues associated with control of data transmission in wireless sensor networks (WSN) – a popular type of ad hoc networks with stationary nodes with a new clustering based approach that utilizes the periodical coordination to reduce the overall energy usage.
Journal ArticleDOI

A Location-free Algorithm of Energy-Efficient Connected Coverage for High Density Wireless Sensor Networks

TL;DR: Following the principle, a distributed, localized and location-free node scheduling algorithm, Stand Guard Algorithm (StanGA), is proposed for treating coverage and connectivity in a unified scheme and can guarantee network connectivity and any degree of sensing coverage.
Book ChapterDOI

A Cluster-Based Data Routing for Wireless Sensor Networks

TL;DR: Cluster-based BeamStar (CBS) follows cluster-based structure to decrease the volume of inter-node communication and the scanning manner in BeamStar is reformed, showing that CBS is scalable, low-cost, and energy efficient.
Related Papers (5)