Displaying similar documents to “An Energy Efficient and Load Balancing Routing Algorithm for Wireless Sensor Networks”

Localization in wireless sensor networks: Classification and evaluation of techniques

Ewa Niewiadomska-Szynkiewicz (2012)

International Journal of Applied Mathematics and Computer Science

Similarity:

Recent advances in technology have enabled the development of low cost, low power and multi functional wireless sensing devices. These devices are networked through setting up a Wireless Sensor Network (WSN). Sensors that form a WSN are expected to be remotely deployed in large numbers and to self-organize to perform distributed sensing and acting tasks. WSNs are growing rapidly in both size and complexity, and it is becoming increasingly difficult to develop and investigate such large...

Energy characteristic of a processor allocator and a network-on-chip

Dawid Zydek, Henry Selvaraj, Grzegorz Borowik, Tadeusz Łuba (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

Energy consumption in a Chip MultiProcessor (CMP) is one of the most important costs. It is related to design aspects such as thermal and power constrains. Besides efficient on-chip processing elements, a well-designed Processor Allocator (PA) and a Network-on-Chip (NoC) are also important factors in the energy budget of novel CMPs. In this paper, the authors propose an energy model for NoCs with 2D-mesh and 2D-torus topologies. All important NoC architectures are described and discussed....

Optimization schemes for wireless sensor network localization

Ewa Niewiadomska-Szynkiewicz, Michał Marks (2009)

International Journal of Applied Mathematics and Computer Science

Similarity:

Many applications of wireless sensor networks (WSN) require information about the geographical location of each sensor node. Self-organization and localization capabilities are one of the most important requirements in sensor networks. This paper provides an overview of centralized distance-based algorithms for estimating the positions of nodes in a sensor network. We discuss and compare three approaches: semidefinite programming, simulated annealing and two-phase stochastic optimization-a...

Solving maximum independent set by asynchronous distributed hopfield-type neural networks

Giuliano Grossi, Massimo Marchi, Roberto Posenato (2006)

RAIRO - Theoretical Informatics and Applications

Similarity:

We propose a heuristic for solving the maximum independent set problem for a set of processors in a network with arbitrary topology. We assume an asynchronous model of computation and we use modified Hopfield neural networks to find high quality solutions. We analyze the algorithm in terms of the number of rounds necessary to find admissible solutions both in the worst case (theoretical analysis) and in the average case (experimental Analysis). We show that our heuristic is better...

An Adaptation of the Hoshen-Kopelman Cluster Counting Algorithm for Honeycomb Networks

Popova, Hristina (2014)

Serdica Journal of Computing

Similarity:

We develop a simplified implementation of the Hoshen-Kopelman cluster counting algorithm adapted for honeycomb networks. In our implementation of the algorithm we assume that all nodes in the network are occupied and links between nodes can be intact or broken. The algorithm counts how many clusters there are in the network and determines which nodes belong to each cluster. The network information is stored into two sets of data. The first one is related to the connectivity of the...