A. Mainwaring, D. Culler, J. Polastre, R. Szewczyk, and J. Anderson, Wireless sensor networks for habitat monitoring, Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications , WSNA '02, pp.88-97, 2002.
DOI : 10.1145/570738.570751

A. Chehri, P. Fortier, and P. Tardif, Security Monitoring Using Wireless Sensor Networks, Fifth Annual Conference on Communication Networks and Services Research (CNSR '07), pp.13-17, 2007.
DOI : 10.1109/CNSR.2007.58

K. Chintalapudi, T. Fu, J. Paek, N. Kothari, S. Rangwala et al., Monitoring civil structures with a wireless sensor network, IEEE Internet Computing, vol.10, issue.2, pp.26-34, 2006.
DOI : 10.1109/MIC.2006.38

J. Gehrke and S. Madden, Sensor and actuator networks - Query processing in sensor networks, IEEE Pervasive Computing, vol.3, issue.1, pp.46-55, 2004.
DOI : 10.1109/MPRV.2004.1269131

Y. Wu, S. Fahmy, and N. B. Shroff, On the construction of a maximum-lifetime data gathering tree in sensor networks: Np-completeness and approximation algorithm The 27th Conference On Computer Communication, INFOCOM 2008, pp.356-360, 2008.

A. Woo, T. Tong, and D. Culler, Taming the underlying challenges of reliable multihop routing in sensor networks, Proceedings of the first international conference on Embedded networked sensor systems , SenSys '03, pp.14-27, 2003.
DOI : 10.1145/958491.958494

T. Chen, H. Tsai, and C. Chu, Gathering-load-balanced tree protocol for wireless sensor networks, SUTC '06, pp.8-13, 2006.

K. Kalpakis, K. Dasgupta, and P. Namjoshi, MAXIMUM LIFETIME DATA GATHERING AND AGGREGATION IN WIRELESS SENSOR NETWORKS, Networks, pp.685-696, 2002.
DOI : 10.1142/9789812776730_0055

C. Buragohain, D. Agrawal, and S. Suri, Power aware routing for sensor databases, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., pp.1747-1757, 2005.
DOI : 10.1109/INFCOM.2005.1498455

W. Liang and Y. Liu, Online Data Gathering for Maximizing Network Lifetime in Sensor Networks, IEEE Transactions on Mobile Computing, vol.6, issue.1, pp.2-11, 2007.
DOI : 10.1109/TMC.2007.250667

Z. A. Eu, H. P. Tan, and W. K. Seah, Routing and Relay Node Placement in Wireless Sensor Networks Powered by Ambient Energy Harvesting, 2009 IEEE Wireless Communications and Networking Conference, 2009.
DOI : 10.1109/WCNC.2009.4917956

R. Hui and H. , A node-centric load balancing algorithm for, Proceedings of the IEEE Global Communications Conference, pp.548-552, 2003.

H. Wei and R. D. Gitlin, Two-hop-relay architecture for next generation wwan/wlan integration, IEEE Wireless Communications (Special Issue on 4G Mobile Communications - Towards Open Wireless Architecture), pp.24-30, 2004.

K. Sundaresan and S. Rangarajan, On exploiting diversity and spatial reuse in relay-enabled wireless networks, Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing , MobiHoc '08, pp.13-22, 2008.
DOI : 10.1145/1374618.1374622

M. Gairing, B. Monien, and A. Woclaw, A faster combinatorial approximation algorithm for scheduling unrelated parallel machines, Theoretical Computer Science, vol.380, issue.1-2, pp.87-99, 2007.
DOI : 10.1016/j.tcs.2007.02.056

J. K. Lenstra, D. B. Shmoys, and É. Tardos, Approximation algorithms for scheduling unrelated parallel machines, Mathematical Programming, vol.23, issue.1-3, pp.259-271, 1990.
DOI : 10.1007/BF01585745
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.708

N. Bansal and M. Sviridenko, The Santa Claus problem, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing , STOC '06, pp.31-40, 2006.
DOI : 10.1145/1132516.1132522

I. Bezáková and V. Dani, Allocating indivisible goods, ACM SIGecom Exchanges, vol.5, issue.3, pp.11-18, 2005.
DOI : 10.1145/1120680.1120683

J. Chen, R. D. Kleinberg, L. Lovasz, R. Rajaraman, R. Sundaram et al., (Almost) tight bounds and existence theorems for confluent flows, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, 2004.
DOI : 10.1145/1007352.1007432
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.6851

P. M. Camerini, G. Galbiati, and F. Maffioli, The complexity of weighted multi-constrained spanning tree, Proc. Colloq. On Theory of Alg, pp.53-101, 1984.

J. Pan, Y. T. Hou, L. Cai, Y. Shi, and S. X. Shen, Topology control for wireless sensor networks, Proceedings of the 9th annual international conference on Mobile computing and networking , MobiCom '03, pp.286-299, 2003.
DOI : 10.1145/938985.939015

X. Wang, Q. Zhang, W. Sun, W. Wang, and B. Shi, A coveragebased maximum lifetime data gathering algorithm in sensor networks, MDM '06, p.33, 2006.

V. King, S. Rao, and R. Tarjan, A Faster Deterministic Maximum Flow Algorithm, SODA '92, pp.157-164, 1992.
DOI : 10.1006/jagm.1994.1044

J. A. Storer, An Introduction to Data Structures and Algorithms, Birkhauser Boston, p.316, 2001.
DOI : 10.1007/978-1-4612-0075-8

V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis, Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems, Journal of Computer and System Sciences, vol.67, issue.3, pp.473-496, 2003.
DOI : 10.1016/S0022-0000(03)00066-7

S. Fortune, J. E. Hopcroft, and J. C. Wyllie, The directed subgraph homeomorphism problem, Theoretical Computer Science, vol.10, issue.2, pp.111-121, 1980.
DOI : 10.1016/0304-3975(80)90009-2

M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness, 1990.

S. Panichpapiboon, G. Ferrari, and O. K. Tonguz, Sensor networks with random versus uniform topology: MAC and interference considerations, 2004 IEEE 59th Vehicular Technology Conference. VTC 2004-Spring (IEEE Cat. No.04CH37514), pp.604-606, 2009.
DOI : 10.1109/VETECS.2004.1390646

H. Shpungin and M. Segal, Near optimal multicriteria spanner constructions in wireless ad-hoc networks, INFOCOM 2009, pp.163-171, 2009.