Optimal information extraction in energy-limited wireless sensor networks

The current practice in wireless sensor networks (WSNs) is to develop functional system designs and protocols for information extraction using intuition and heuristics, and validate them through simulations and implementations. We address the need for a complementary formal methodology by developing nonlinear optimization models of static WSN that yield fundamental performance bounds and optimal designs. We present models both for maximizing the total information gathered subject to energy constraints (on sensing, transmission, and reception), and for minimizing the energy usage subject to information constraints. Other constraints in these models correspond to fairness and channel capacity (assuming noise but no interference). We also discuss extensions of these models that can handle data aggregation, interference, and even node mobility. We present results and illustrations from computational experiments using these models that show how the optimal solution varies as a function of the energy/information constraints, network size, fairness constraints, and reception power. We also compare the performance of some simple heuristics with respect to the optimal solutions.

[1]  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).

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

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

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

[5]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[6]  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.

[7]  Andrea J. Goldsmith,et al.  Capacity regions for wireless ad hoc networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

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

[9]  Robert Szewczyk,et al.  System architecture directions for networked sensors , 2000, ASPLOS IX.

[10]  Anantha Chandrakasan,et al.  Low-power wireless sensor networks , 2001, VLSI Design 2001. Fourteenth International Conference on VLSI Design.

[11]  Sergio D. Servetto.  On the Feasibility of Large-Scale Wireless Sensor Networks , 2002 .

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

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

[14]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[15]  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..

[16]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[17]  Jorge J. Moré,et al.  The NEOS Server , 1998 .

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

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

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

[21]  Deborah Estrin,et al.  Embedded Every-where: A Research Agenda for Networked Systems of Embedded Computers , 2001 .

[22]  Wendi B. Heinzelman,et al.  Adaptive protocols for information dissemination in wireless sensor networks , 1999, MobiCom.

[23]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

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

[25]  J. Rabaey,et al.  PicoRadio: Ad-hoc wireless networking of ubiquitous low-energy sensor/monitor nodes , 2000, Proceedings IEEE Computer Society Workshop on VLSI 2000. System Design for a System-on-Chip Era.

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

[27]  Deborah Estrin,et al.  Rumor Routing Algorithm For Sensor Networks , 2002 .

[28]  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).

[29]  Yong Yao,et al.  The cougar approach to in-network query processing in sensor networks , 2002, SGMD.

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

[31]  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.

[32]  Deborah Estrin,et al.  Dimensions: why do we need a new data handling architecture for sensor networks? , 2003, CCRV.

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

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