Computation Hierarchy for In-network Processing [Conference Paper]

NESL Technical Report #: 2003-9-1



In this paper, we explore the network level architecture of distributed sensor systems that perform in-network processing. We propose a system with heterogeneous nodes that organizes into a hierarchal structure dictated by the computational capabilities. The presence of high-performance nodes amongst a sea of resource constrained nodes exposes new tradeoffs in the efficient implementation of network-wide applications. The introduction of hierarchy enables partitioning of the application into sub-tasks that can be mapped onto the heterogeneous nodes in the network in multiple ways. We analyze the tradeoffs between the execution time of the application, accuracy of the output produced and the overall energy consumption of the network for the different mapping of the sub-tasks onto the heterogeneous nodes in the network. We evaluate the performance and energy consumption of a typical sensor network application of target tracking via beamforming and line of bearing calculations on the different nodes. Our experiments show that more than 95% of time on average, the hierarchical network outperforms a homogeneous network for approximately the same energy budget.

Local downloads:

Publication Forum: Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications (WSNA 2003)

Page (Start): 68

Page (End): 77

Page (Count): 12

Date: 2003-09-19

Place: San Diego, CA

Publisher: ACM Press

Public Document?: Yes

NESL Document?: Yes

Document category: Conference Paper