Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Computation in networks of passively mobile finite-state sensors
Distributed Computing - Special issue: PODC 04
The Tenet architecture for tiered sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
Self-Similar Algorithms for Dynamic Distributed Systems
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Efficient routing in intermittently connected mobile networks: the single-copy case
IEEE/ACM Transactions on Networking (TON)
Toward a theory of in-network computation in wireless sensor networks
IEEE Communications Magazine
Computing and communicating functions over sensor networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Chandy et al. proposed the methodology of "self-similar algorithms" for distributed computation in dynamic environments. We further characterize the class of functions computable by such algorithms by showing that self-similarity induces an additive relationship among the level-sets of such functions. Angluin et al. introduced the population protocol model for computation in mobile sensor networks and characterized the class of predicates computable in a standard population. We define and characterize the class of self-similar predicates and show when they are computable by a population protocol.