Article

Permanent URI for this collectionhttps://hdl.handle.net/10361/6641

Browse

Recent Submissions

Now showing 1 - 3 of 3
  • listelement.badge.dso-type Item ,
    Efficient consensus algorithm for the accurate faulty node tracking with faster convergence rate in a distributed sensor network
    (© 2016 Springer Netherlands, 2016) Hossain, Rajkin; Khan, Muhidulislam; Department of Computer Science and Engineering, BRAC University
    One of the challenging issues in a distributed computing system is to reach on a decision with the presence of so many faulty nodes. These faulty nodes may update the wrong information, provide misleading results and may be nodes with the depleted battery power. Consensus algorithms help to reach on a decision even with the faulty nodes. Every correct node decides some values by a consensus algorithm. If all correct nodes propose the same value, then all the nodes decide on that. Every correct node must agree on the same value. Faulty nodes do not reach on the decision that correct nodes agreed on. Binary consensus algorithm and average consensus algorithm are the most widely used consensus algorithm in a distributed system. We apply binary consensus and average consensus algorithm in a distributed sensor network with the presence of some faulty nodes. We evaluate these algorithms for better convergence rate and error rate. © 2016, The Author(s).
  • listelement.badge.dso-type Item ,
    Efficient consensus algorithm for the accurate faulty node tracking with faster convergence rate in a distributed sensor network
    (© 2016 Springer Netherlands, 2016) Hossain, Rajkin; Khan, Muhidul Islam; Department of Computer Science and Engineering, BRAC University
    One of the challenging issues in a distributed computing system is to reach on a decision with the presence of so many faulty nodes. These faulty nodes may update the wrong information, provide misleading results and may be nodes with the depleted battery power. Consensus algorithms help to reach on a decision even with the faulty nodes. Every correct node decides some values by a consensus algorithm. If all correct nodes propose the same value, then all the nodes decide on that. Every correct node must agree on the same value. Faulty nodes do not reach on the decision that correct nodes agreed on. Binary consensus algorithm and average consensus algorithm are the most widely used consensus algorithm in a distributed system. We apply binary consensus and average consensus algorithm in a distributed sensor network with the presence of some faulty nodes. We evaluate these algorithms for better convergence rate and error rate. © 2016, The Author(s).
  • listelement.badge.dso-type Item ,
    Open Access
    Resource-aware task scheduling by an adversarial bandit solver method in wireless sensor networks
    (Springer International Publishing, 2016) Khan, Muhidul Islam; Department of Computer Science and Engineering, BRAC University
    A wireless sensor network (WSN) is composed of a large number of tiny sensor nodes. Sensor nodes are very resource-constrained, since nodes are often battery-operated and energy is a scarce resource. In this paper, a resource-aware task scheduling (RATS) method is proposed with better performance/resource consumption trade-off in a WSN. Particularly, RATS exploits an adversarial bandit solver method called exponential weight for exploration and exploitation (Exp3) for target tracking application of WSN. The proposed RATS method is compared and evaluated with the existing scheduling methods exploiting online learning: distributed independent reinforcement learning (DIRL), reinforcement learning (RL), and cooperative reinforcement learning (CRL), in terms of the tracking quality/energy consumption trade-off in a target tracking application. The communication overhead and computational effort of these methods are also computed. Simulation results show that the proposed RATS outperforms the existing methods DIRL and RL in terms of achieved tracking performance. © 2016, Khan.