scispace - formally typeset
Proceedings ArticleDOI

Energy Aware Disjoint Dominating Sets Algorithm for Heterogeneous Wireless Sensor Networks

Reads0
Chats0
TLDR
In this paper , a Bees algorithm-based method is presented to identify energy-aware dominating sets (DSs) that extend the lifetime of a given network with heterogeneous energy.
Abstract
There are endless applications of Wireless Sensor Networks (WSNs) in many aspects that include safety, environmental monitoring, health care, etc. Despite this, energy is one of the main issues in WSN. Among the various methods that aim to overcome this issue is to select groups of nodes that are disjoint and are called dominating sets (DS). Each group carry out the tasks on behalf of their nearby nodes. This helps to prolong network lifespan by distributing data collection responsibilities across these groups, such that one group is responsible for handling these tasks then, after a certain period of time, another group replaces it, and so on. The goal of this paper is to identify energy-aware disjoint DSs that extend the lifetime for a given network with heterogeneous energy. A Bees algorithm-based method is presented to accomplish this goal. Simulations have demonstrated the effectiveness of the proposed algorithm.

read more

Content maybe subject to copyright    Report

References
More filters
Journal ArticleDOI

An efficient heuristic procedure for partitioning graphs

TL;DR: A heuristic method for partitioning arbitrary graphs which is both effective in finding optimal partitions, and fast enough to be practical in solving large problems is presented.
Proceedings ArticleDOI

On calculating connected dominating set for efficient routing in ad hoc wireless networks

TL;DR: In this paper, the authors proposed a simple and efficient distributed algorithm for calculating connected dominating set in ad-hoc wireless networks, where connections of nodes are determined by their geographical distances.
Journal ArticleDOI

Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks

TL;DR: This paper proposes to significantly reduce or eliminate the communication overhead of a broadcasting task by applying the concept of localized dominating sets, which do not require any communication overhead in addition to maintaining positions of neighboring nodes.
Book ChapterDOI

Approximation Algorithms for Connected Dominating Sets

TL;DR: This work focuses on the question of finding a connected dominating set of minimum size, where the graph induced by vertices in the dominating set is required to be connected.
Proceedings ArticleDOI

Routing in ad hoc networks using a spine

TL;DR: This work describes a self-organizing, dynamic spine structure within each lower level cluster to propagate topology changes, compute updated routes in the background, and provide backup routes in case of transient failures of the primary routes.