Fundamental limits of networked sensing: the flow optimization framework

We describe a useful theoretical approach--the flow optimization framework --that can be used to identify the fundamental performance limits on information routing in energy-limited wireless sensor networks. We discuss the relevant recent literature, and present both linear constant-rate and non-linear adaptive rate models that optimize the tradeoff between the total information extracted (Bits) and the total energy used (Joules) for a given sensor network scenario. We also illustrate the utility of this approach through examples, and indicate possible extensions.

[1]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[2]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[3]  Leandros Tassiulas,et al.  Fast Approximate Algorithms for Maximum Lifetime Routing in Wireless Ad-hoc Networks , 2000, NETWORKING.

[4]  Ramesh Govindan,et al.  The Sensor Network as a Database , 2002 .

[5]  Anthony Ephremides,et al.  Information Theory and Communication Networks: An Unconsummated Union , 1998, IEEE Trans. Inf. Theory.

[6]  Deborah Estrin,et al.  The impact of data aggregation in wireless sensor networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[7]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[8]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[9]  Deborah Estrin,et al.  GHT: a geographic hash table for data-centric storage , 2002, WSNA '02.

[10]  Deborah Estrin,et al.  Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk , 2003, SODA '03.

[11]  Panganamala Ramana Kumar,et al.  A network information theory for wireless communication: scaling laws and optimal operation , 2004, IEEE Transactions on Information Theory.

[12]  Philippe Bonnet,et al.  Querying the physical world , 2000, IEEE Wirel. Commun..

[13]  Bhaskar Krishnamachari,et al.  Optimal information extraction in energy-limited wireless sensor networks , 2004, IEEE Journal on Selected Areas in Communications.

[14]  Stephen P. Boyd,et al.  Simultaneous routing and power allocation in CDMA wireless data networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[15]  Bhaskar Krishnamachari,et al.  Application-specific modelling of information routing in sensor networks , 2004 .

[16]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[17]  Yong Pei,et al.  On the capacity improvement of ad hoc wireless networks using directional antennas , 2003, MobiHoc '03.

[18]  Feng Zhao,et al.  Scalable Information-Driven Sensor Querying and Routing for Ad Hoc Heterogeneous Sensor Networks , 2002, Int. J. High Perform. Comput. Appl..

[19]  B. Krishnamachari,et al.  Analysis of energy-efficient, fair routing in wireless sensor networks through non-linear optimization , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[20]  Cauligi S. Raghavendra,et al.  PEGASIS: Power-efficient gathering in sensor information systems , 2002, Proceedings, IEEE Aerospace Conference.

[21]  N. Sadagopan,et al.  The ACQUIRE mechanism for efficient querying in sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[22]  Anantha Chandrakasan,et al.  Bounding the lifetime of sensor networks via optimal role assignments , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[23]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[24]  Haiyun Luo,et al.  A two-tier data dissemination model for large-scale wireless sensor networks , 2002, MobiCom '02.

[25]  Konstantinos Kalpakis,et al.  MAXIMUM LIFETIME DATA GATHERING AND AGGREGATION IN WIRELESS SENSOR NETWORKS , 2002 .

[26]  Anna Scaglione,et al.  On the Interdependence of Routing and Data Compression in Multi-Hop Sensor Networks , 2002, MobiCom '02.

[27]  Andrea J. Goldsmith,et al.  Capacity regions for wireless ad hoc networks , 2003, IEEE Trans. Wirel. Commun..

[28]  Stephen P. Boyd,et al.  Simultaneous routing and resource allocation via dual decomposition , 2004, IEEE Transactions on Communications.

[29]  Mingyan Liu,et al.  On the Many-to-One Transport Capacity of a Dense Wireless Sensor Network and the Compressibility of Its Data , 2003, IPSN.

[30]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[31]  Bhaskar Krishnamachari,et al.  Maximizing Data Extraction in Energy-Limited Sensor Networks , 2005, Int. J. Distributed Sens. Networks.