A hierarchical model for distributed collaborative computation in wireless sensor networks

20Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In-network collaborative computation is essential for implementation of a large number of sensor applications. We approach the problem of computation in sensor networks from a parallel and distributed system's perspective. We define COSMOS, the Cluster-based, heterOgeneouS MOdel for Sensor networks. The model abstracts the key features of the class of cluster-based sensor applications. It assumes a hierarchical network architecture comprising of a large number of low cost sensors with limited computation capability, and fewer number of powerful clusterheads, uniformly distributed in a two dimensional terrain. The sensors are organized into single hop clusters, each managed by a distinct clusterhead. The clusterheads are organized in a mesh-like topology. All sensors in a cluster are time synchronized, whereas the clusterheads communicate asynchronously. The sensors are assumed to have multiple power states and a wakeup mechanism to facilitate power management. To illustrate algorithm design using our model, we discuss implementation of algorithms for sorting and summing in sensor networks. © 2004 World Scientific Publishing Company.

Cite

CITATION STYLE

APA

Singh, M., & Prasanna, V. K. (2004). A hierarchical model for distributed collaborative computation in wireless sensor networks. International Journal of Foundations of Computer Science, 15(3), 485–506. https://doi.org/10.1142/S012905410400256X

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free