DACYCLEM: A decentralized algorithm for maximizing coverage and lifetime in a mobile wireless sensor network

in Ad Hoc Networks (2019), 87

The goal of Mobile Wireless Sensor Networks (M-WSN) is to sense a specific environment. A commonly considered objective is to organize the work of the sensors such that they monitor the environment as ... [more ▼]

The goal of Mobile Wireless Sensor Networks (M-WSN) is to sense a specific environment. A commonly considered objective is to organize the work of the sensors such that they monitor the environment as long as possible and cover a surface as large as possible. While most of the time this problem is formulated as a multi-objective optimization problem we present a new decentralized approach for building a connected dominating set (CDS) coupled with attractive and repulsive forces for the movement of sensors in order to maintain the network connectivity. The approach is implemented as a hybrid decentralized algorithm: DACYCLEM (Decentralized Algorithm under Connectivity constraint with mobilitY for Coverage and LifEtime Maximization). The lifetime and the coverage achieved by our approach are the results of the local interactions between the sensors and were not obtained by the application of a direct optimization method. We also introduce a new metric, the speed of coverage, to evaluate the balance between coverage and lifetime. Finally, our simulation results show that one single parameter of DACYCLEM is responsible for the balancing between coverage and lifetime. [less ▲]

Load Balancing at the Edge of Chaos: How Can Self-Organized Criticality Lead to Energy-Efficient Computing

in IEEE Transactions on Parallel and Distributed Systems (2017), 28

This paper investigates a self-organized critical approach for dynamically load-balancing computational workloads. The proposed model is based on the Bak-Tang-Wiesenfeld sandpile: a cellular automaton ... [more ▼]

This paper investigates a self-organized critical approach for dynamically load-balancing computational workloads. The proposed model is based on the Bak-Tang-Wiesenfeld sandpile: a cellular automaton that works in a critical regime at the edge of chaos. In analogy to grains of sand, tasks arrive, pile up and slip through the different processing elements or sites of the system. When a pile exceeds a certain threshold, it collapses and initiates an avalanche of migrating tasks, i.e. producing load-balancing. We show that the frequency of such avalanches is in power-law relation with their sizes, a scale-invariant fingerprint of self-organized criticality that emerges without any tuning of parameters. Such an emergent pattern has organic properties such as the self-organization of tasks into resources or the self-optimization of the computing performance. The conducted experimentation also reveals that the system is in balanced (i.e. not driving to overloaded or underutilized resources) as long as the arrival rate of tasks equals the processing power of the system. Taking advantage of this fact, we hypothesize that the processing elements can be turned on and off depending on the state of the workload as to maximize the utilization of resources. An interesting side-effect is that the overall energy consumption of the system is minimized without compromising the quality of service. [less ▲]

Token Traversal Strategies of a Distributed Spanning Forest Algorithm in Mobile Ad hoc - Delay Tolerant Networks

in IAIT (2009)

This paper presents three distributed and decentralized strategies used for token traversal in spanning forest over Mobile Ad Hoc Delay Tolerant Networks. Such networks are characterized by behaviors like ... [more ▼]

This paper presents three distributed and decentralized strategies used for token traversal in spanning forest over Mobile Ad Hoc Delay Tolerant Networks. Such networks are characterized by behaviors like disappearance of mobile devices, connection disruptions, network partitioning, etc. Techniques based on tree topologies are well known for increasing the efficiency of network protocols and/or applications, such as Dynamicity Aware - Graph Relabeling System (DA-GRS). One of the main features of these tree based topologies is the existence of a token traversing in every tree. The use of tokens enables the creation and maintenance of spanning trees in dynamic environments. Subsequently, managing tree-based backbones relies heavily on the token behavior. An efficient and optimal token traversal can highly impact the design of the tree and its usage. In this article, we present a comparison of three distributed and decentralized techniques available for token management, which are Randomness, TABU and Depth First Search. [less ▲]

Simulating Realistic Mobility Models for Large Heterogeneous MANETs

in 9th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM'06) (2006)