Sciweavers

HICSS
2003
IEEE
99views Biometrics» more  HICSS 2003»
13 years 10 months ago
Towards Feasible Topology Formation Algorithms for Bluetooth-based WPANs
In this paper, we tackle the problem of topology formation in Bluetooth Wireless Personal Area Networks (BTWPANs). We first overview and extend a previously proposed centralized ...
Carla-Fabiana Chiasserini, Marco Ajmone Marsan, El...
IPSN
2004
Springer
13 years 10 months ago
Locally constructed algorithms for distributed computations in ad-hoc networks
In this paper we develop algorithms for distributed computation of a broad range of estimation and detection tasks over networks with arbitrary but fixed connectivity. The distri...
Dzulkifli S. Scherber, Haralabos C. Papadopoulos
IPSN
2004
Springer
13 years 10 months ago
Distributed optimization in sensor networks
Wireless sensor networks are capable of collecting an enormous amount of data over space and time. Often, the ultimate objective is to derive an estimate of a parameter or functio...
Michael Rabbat, Robert D. Nowak
ICT
2004
Springer
165views Communications» more  ICT 2004»
13 years 10 months ago
Algorithms for Distributed Fault Management in Telecommunications Networks
Distributed architectures for network management have been the subject of a large research effort, but distributed algorithms that implement the corresponding functions have been ...
Eric Fabre, Albert Benveniste, Stefan Haar, Claude...
IPSN
2005
Springer
13 years 10 months ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
FMCO
2005
Springer
173views Formal Methods» more  FMCO 2005»
13 years 10 months ago
Cluster-Based LTL Model Checking of Large Systems
Abstract. In recent years a bundle of parallel and distributed algorithms for verification of finite state systems has appeared. We survey distributed-memory enumerative LTL mode...
Jiri Barnat, Lubos Brim, Ivana Cerná
PODC
2005
ACM
13 years 10 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
PODC
2005
ACM
13 years 10 months ago
Quorum placement in networks to minimize access delays
A quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of n...
Anupam Gupta, Bruce M. Maggs, Florian Oprea, Micha...
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
13 years 10 months ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman
SSS
2007
Springer
117views Control Systems» more  SSS 2007»
13 years 11 months ago
Distributed Synthesis of Fault-Tolerant Programs in the High Atomicity Model
In this paper, we concentrate on distributed algorithms for automated synthesis of fault-tolerant programs in the high atomicity model, where all processes can read and write all p...
Borzoo Bonakdarpour, Sandeep S. Kulkarni, Fuad Abu...