Sciweavers

5901 search results - page 682 / 1181
» Algorithms for Wireless Sensor Networks
Sort
View
IPSN
2005
Springer
15 years 12 months ago
A robust architecture for distributed inference in sensor networks
— Many inference problems that arise in sensor networks require the computation of a global conclusion that is consistent with local information known to each node. A large class...
Mark A. Paskin, Carlos Guestrin, Jim McFadden
IPSN
2007
Springer
16 years 16 days ago
Robust system multiangulation using subspace methods
Sensor location information is a prerequisite to the utility of most sensor networks. In this paper we present a robust and low-complexity algorithm to self-localize and orient se...
Joshua N. Ash, Lee C. Potter
TWC
2008
155views more  TWC 2008»
15 years 6 months ago
Distributed sensor network localization using SOCP relaxation
The goal of the sensor network localization problem is to determine positions of all sensor nodes in a network given certain pairwise noisy distance measurements and some anchor no...
Seshan Srirangarajan, Ahmed H. Tewfik, Zhi-Quan Lu...
WONS
2005
IEEE
15 years 12 months ago
A Partition Prediction Algorithm for Service Replication in Mobile Ad Hoc Networks
Due to the mobility of nodes in Ad hoc networks, network topology is dynamic and unpredictable, which leads to frequent network partitioning. This partitioning disconnects many no...
Abdelouahid Derhab, Nadjib Badache, Abdelmadjid Bo...
166
Voted
PERCOM
2006
ACM
16 years 6 months ago
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks
Abstract-- We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to c...
Christopher L. Barrett, V. S. Anil Kumar, Madhav V...