7 research outputs found
Efficiently Correcting Matrix Products
We study the problem of efficiently correcting an erroneous product of two
matrices over a ring. Among other things, we provide a randomized
algorithm for correcting a matrix product with at most erroneous entries
running in time and a deterministic -time
algorithm for this problem (where the notation suppresses
polylogarithmic terms in and ).Comment: Fixed invalid reference to figure in v
Node Ranking in Wireless Sensor Networks with Linear Topology
International audienceIn wireless sensor networks with linear topology, knowing the physical order in which nodes are deployed is useful not only for the target application, but also to some network services, like routing or data aggregation. Considering the limited resources of sensor nodes, the design of autonomous protocols to find this order is a challenging topic. In this paper, we propose a distributed and iterative centroid-based algorithm to address this problem. At each iteration, the algorithm selects two virtual anchors and finds the order of a subset of nodes, placed between these two anchors. The proposed algorithm requires local node connectivity knowledge and the identifier of the first sensor node of the network, which is the only manually configured parameter. This solution, scalable and lightweight from the deployment and maintenance point of view, is shown to be robust to connectivity degradation, correctly ordering more than 95% of the nodes, even under very low connectivity condition
Node Ranking in Wireless Sensor Networks with Linear Topology
International audienceIn wireless sensor networks with linear topology, knowing the physical order in which nodes are deployed is useful not only for the target application, but also to some network services, like routing or data aggregation. Considering the limited resources of sensor nodes, the design of autonomous protocols to find this order is a challenging topic. In this paper, we propose a distributed and iterative centroid-based algorithm to address this problem. At each iteration, the algorithm selects two virtual anchors and finds the order of a subset of nodes, placed between these two anchors. The proposed algorithm requires local node connectivity knowledge and the identifier of the first sensor node of the network, which is the only manually configured parameter. This solution, scalable and lightweight from the deployment and maintenance point of view, is shown to be robust to connectivity degradation, correctly ordering more than 95% of the nodes, even under very low connectivity condition
Message from the ISPA 2011 program chairs
Welcome message from the program chairs of the Ninth IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA 2011), Busan, Korea, 26-28 May 2011
Message from the ISPA 2011 program chairs
Welcome message from the program chairs of the Ninth IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA 2011), Busan, Korea, 26-28 May 2011