Sciweavers

1259 search results - page 85 / 252
» On Survivable Access Network Design: Complexity and Algorith...
Sort
View
182
Voted
ATAL
2005
Springer
15 years 10 months ago
Task inference and distributed task management in the Centibots robotic system
We describe a very large scale distributed robotic system, involving a team of over 100 robots, that has been successfully deployed in large, unknown indoor environments, over ext...
Charlie Ortiz, Régis Vincent, Benoit Moriss...
ADHOC
2006
116views more  ADHOC 2006»
15 years 4 months ago
Efficient clustering algorithms for self-organizing wireless sensor networks
Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...
Rajesh Krishnan, David Starobinski
183
Voted
TWC
2010
14 years 11 months ago
Toward network coding-based protocols for data broadcasting in wireless Ad Hoc networks
In this paper we consider practical dissemination algorithms exploiting network coding for data broadcasting in ad hoc wireless networks. For an efcient design, we analyze issues r...
Alfred Asterjadhi, Elena Fasolo, Michele Rossi, J&...
ICC
2008
IEEE
118views Communications» more  ICC 2008»
15 years 11 months ago
A Distributed Scheduling Algorithm for an Optical Switching Fabric
— Designing switching architectures for network routers and switches needs to consider limits imposed by the electronic technology, like small bandwidth×distance factors, power ...
Andrea Bianco, Elisabetta Carta, Davide Cuda, Jorg...
JSAC
2008
140views more  JSAC 2008»
15 years 4 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham