Sensor networks are being used for implementation of a large number of applications involving distributed and collaborative computation. Extensive research has focused upon design of time optimal parallel and distributed algorithms for two dimensional mesh connected computers (MCC). In this paper, we discuss a simple scheme for emulating the above algorithms for mesh-like sensor arrays. We show that a large set of parallel algorithms (see Property 1), that take time T(n) on MCC of size n, can be implemented on a wireless sensor mesh of size n in time O(r2 + T(n/r2 ).r2 ). Here r represents the transmission range of the sensor nodes. We discuss implementation of algorithms for ranking and sorting using our techniques and analyze them for time and energy efficiency.
Mitali Singh, Viktor K. Prasanna, José D. P