Networked sensors-those that coordinate amongst them-selves to achieve a larger sensing task-will revolutionize information gathering and processing both in urban environments and in inhospitable terrain. The sheer numbers of these sensors and the expected dynamics in these environments present

As we progress towards a world where robots play an integral role in society, a critical problem that remains to be solved is the Pickup Team challenge; that is, dynamically formed heterogeneous robot teams executing coordinated tasks where little information is known a-priori about the tasks

Abstract—Wireless ad hoc networks, due to their inherent unreliability, pose significant challenges to the task of achieving tight coordination amongst nodes. The failure of some nodes and momentary breakdown of communications, either of accidental or malicious nature, should not result

Sensor networks can be considered distributed computing platforms with many severe constraints including limited CPU speed, memory size, power, and bandwidth. Individual nodes in sensor networks are typically unreliable and the network topology dynamically changes, possibly frequently. Sensor

Network sensors, those that coordinate amongst themselves to achieve a larger sensing task, will revolutionize information gathering and processing both in urban environments and in inhospitable terrain. The sheer numbers of these sensors and the expected dynamics in these environments present

Today’s large-scale services generally exploit looselycoupled architectures that restrict functionality requiring tight cooperation (e.g., leader election, synchronization, and reconfiguration) to a small subset of nodes. In contrast, this work presents a way to scalably deploy tightlycoupled

Abstract — As we progress towards a world where robots play an integral role in society, a critical problem that remains to be solved is the Pickup Team Challenge; that is, dynamically formed heterogeneous robot teams executing coordinated tasks where little information is known a priori about

Wireless sensor networks are tightly associated with the un-derlying environment in which the sensors are deployed. The global topology of the network is of great importance to both sensor network applications and the implementation of net-working functionalities. In this paper we study the problem

Today’s large-scale services generally exploit looselycoupled architectures that restrict functionality requiring tight cooperation (e.g., leader election, synchronization, and reconfiguration) to a small subset of nodes. In contrast, this work presents a way to scalably deploy tightlycoupled

Synchronicity is a useful abstraction in many sensor network applications. Communication scheduling, coordinated duty cycling, and time synchronization can make use of a synchronicity primitive that achieves a tight alignment of individual nodes ’ firing phases. In this paper we present