Results 31 to 40 of about 308,840 (315)
Distributed greedy pursuit algorithms [PDF]
Signal Processing, 2014 For compressed sensing over arbitrarily connected networks, we consider the problem of estimating underlying sparse signals in a distributed manner. We introduce a new signal model that helps to describe inter-signal correlation among connected nodes.
Dennis Sundman +2 more
openaire +2 more sources
Distributed Routing and Channel Selection for Multi-Channel Wireless Sensor Networks
Journal of Sensor and Actuator Networks, 2017 We propose a joint channel selection and quality aware routing scheme for multi-channel wireless sensor networks that apply asynchronous duty cycling to conserve energy, which is common in many environmental monitoring applications.
Amitangshu Pal, Asis Nasipuri
doaj +1 more source
Dynamic Ring Exploration with (H,S) View
Algorithms, 2020 The researches about a mobile entity (called agent) on dynamic networks have attracted a lot of attention in recent years. Exploration which requires an agent to visit all the nodes in the network is one of the most fundamental problems.
Tsuyoshi Gotoh +3 more
doaj +1 more source
Constant-Time Complete Visibility for Robots with Lights: The Asynchronous Case
Algorithms, 2021 We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move (LCM) cycles and use colored lights (the robots with lights model).
Gokarna Sharma +2 more
doaj +1 more source
Optimal Distributed Covering Algorithms [PDF]
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019 AbstractWe present a time-optimal deterministic distributed algorithm for approximating a minimum weight vertex cover in hypergraphs of rank f. This problem is equivalent to the Minimum Weight Set Cover problem in which the frequency of every element is bounded by f. The approximation factor of our algorithm is $$(f+\varepsilon )$$
Ran Ben-Basat +3 more
openaire +7 more sources
Simple Synchronous and Asynchronous Algorithms for Distributed Minimax Optimization
SICE Journal of Control, Measurement, and System Integration, 2017 Synchronous and asynchronous algorithms are presented for distributed minimax optimization. The objective here is to realize the minimization of the maximum of component functions over the standard multi-agent network, where each node of the network ...
Kenta Hanada +3 more
doaj +1 more source
Applied Sciences, 2019 This paper studies the problem of generating cooperative feasible paths for formation rendezvous of unmanned aerial vehicles (UAVs). Cooperative path-planning for multi-UAV formation rendezvous is mostly a complicated multi-objective optimization problem
Zhuang Shao +3 more
doaj +1 more source
Joint Power Control and Routing for Rechargeable Wireless Sensor Networks
IEEE Access, 2019 Wireless sensor networks (WSN) that are powered by energy harvested from the environment, also known as rechargeable WSNs, typically experience wide variations of energy availability across the network.
Amitangshu Pal, Asis Nasipuri
doaj +1 more source
Adaptive Geman-McClure Estimator for Robust Distributed Channel Estimation
IEEE Access, 2021 Communication systems are affected by channel distortions. Impulsive noise is one of the significant factors for channel impairments. The standard additive white Gaussian noise (AWGN) channel model and conventional estimation algorithms like least mean ...
Annet Mary Wilson +3 more
doaj +1 more source
Parameterized Distributed Algorithms
CoRR, 2018 In this work, we initiate a thorough study of parameterized graph optimization problems in the distributed setting. In a parameterized problem, an algorithm decides whether a solution of size bounded by a \emph{parameter} $k$ exists and if so, it finds one.
Ran Ben-Basat +2 more
openaire +4 more sources