Set K-cover algorithms for energy efficient monitoring in wireless sensor networks

Third International Symposium on Information Processing in Sensor Networks, IPSN 2004

Volumn , Issue , 2004, Pages 424-432

  Abrams, Zoë ^a   Goel, Ashish ^a   Plotkin, Serge ^a  

^a Stanford University   (United States)

Author keywords

Analysis of Algorithms; Energy Conservation; Wireless Sensor Networks

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; ENERGY EFFICIENCY; MATHEMATICAL MODELS; MONITORING; PROBLEM SOLVING; WIRELESS TELECOMMUNICATION SYSTEMS;

ANALYSIS OF ALGORITHMS; BATTERY POWER; WIRELESS SENSOR NETWORKS (WSN);

SENSORS;

EID: 3042743591     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/984622.984684     Document Type: Conference Paper

References (19)

1. Computer Science Telecommunications Board. Embedded, Everywhere: A research agenda for networked Systems of Embedded Computers. National Academy Press, 2001.
2. L. Benini, G. Castelli, A.Macii, E.Macii, et al. A discrete-time battery model for high-level power estimation. Design, Automation and Test in Europe Conference, pp.35-39, 2000.
3. B. Berger, J. Kleinberg, and T. Leighton. Reconstructing a three-dimensional model with arbitrary errors. In Proceedings of the 28th ACM Symposium on Theory of Computing, 1996.
4. F. Bian, A. Goel, C. Raghavendra, and X. Li. Energy-efficient broadcast in wireless ad hoc networks: lower bounds and algorithms. In Journal of Interconnection Networks, 3(3-4), pp 149-166, September 2002.
5. A. Cerpa et al.. Habitat monitoring: Application driver for wireless communications technology. In 2001 ACM SIGCOMM Workshop on Data Communications in Latin America and the Caribbean, Costa Rica, April 2001.
6. V. Guruswami. Inapproximability Results for Set Splitting and Satisfiability Problems with no Mixed Clauses. In Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), September 2000.
7. J. Hastad. Some Optimal Inapproximability Results. In Proceedings of the 29th ACM Symposium on the Theory of Computing, 2002.
8. A. Howard, M. Mataric, and G. Sukhatme. Relocation on a mesh: A formalism for generalized localization. IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Wailea, Hawaii, Oct. 2001.
9. M. Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem. In SIAM Journal on Computing, 4:1036-1053, 1986.
10. S. Madden, M. Franklin, J. Hellerstein, and W. Hong. The Design of an Acquisitional Query Processor For Sensor Networks. In SIGMOD 2003, June 2003.
11. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
12. C. Savarese, J. Rabaey, and J. Beutel. Locationing in Distributed Ad-Hoc Wireless Sensor Networks. In Proceedings of ICASSP Salt Lake City, pp.2037-2040, UT May 2001.
13. S. Slijepcevic and M. Potkonjak. Power Efficient Organization of Wireless Sensor Networks. IEEE International Conference on Communications (ICC), Helsinki, Finland, June 2001.
14. D. Tian, and N.D. Georganas. A Node Scheduloing Scheme for Energy Condervation in Large Wireless Sensor Networks. In, Wireless Communications and Mobile Computing Journal, May 2003.
15. V. Vazirani. Approximation Algorithms. Springer, 2001.
16. J. Warrior. Smart Sensor Networks of the Future. In Sensors Magazine, March 1997.
17. D. Wolpert, and W. Macready. No Free Lunch Theorems for Optimization. In IEEE Transactions on Evolutionary Computation, 1996.
18. T. yan, T. He, and J.A. Stankovic. Differentiated Surveillance for Sensor Networks. In ACM SenSys, Los Angeles, CA, November 2003.
19. F. Ye, G. Zhong, S. Lu, and L. Zhang. Energy Efficient Robust Sensing Coverage in Large Sensor Networks. UCLA Technical Report, 2002.