Date Added: Apr 2011
The authors study the problem of maximizing the aggregated information in sensor networks with deadline constraints. The model is that of a sensor network that is arranged in the form of a tree topology, where the root corresponds to the sink node, and the rest of the network detects an event and transmits data to the sink over one or more hops. They assume a time-slotted synchronized system and a node-exclusive (also called a primary) interference model. They formulate this problem as an integer optimization problem and show that for unit capacity links, the optimal solution involves solving a bipartite maximum weighted matching problem at each hop. They propose a polynomial time algorithm that uses only local information at each hop to obtain the optimal solution.