Abstract In this paper, we propose a distributed algorithm for sensor network localization based on maximum likelihood formulation. It relies the Levenberg-Marquardt where computations are among different computational agents using message passing, or equivalently dynamic programming. The resulting provides good accuracy, and it converges to same solution as its centralized counterpart. Moreove...

 To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...

Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...