Date Added: Oct 2009
In a sensor network with information sources and a sink, the authors assume a single path between every location in the network and the destination. These abstract information paths represent the desired paths for transmission of information. If the number of sensor nodes is large enough to approximate information paths with a certain precision, they call the network implementable. In this paper, they investigate the relation between density of nodes and implementability of information paths. They show that a quadratic relation between the density of nodes and the magnitude of information flow does not guarantee implementability.