Power efficient monitoring management in sensor networks

2004 IEEE Wireless Communications and Networking Conference, WCNC 2004

Volumn 4, Issue , 2004, Pages 2329-2334

  Berman, P ^a   Calinescu, G ^b   Shah, C ^c   Zelikovsky, A ^c  

^a The Pennsylvania State University   (United States)

^b Illinois Institute of Technology   (United States)

^c GEORGIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MANAGEMENT; POWER CONSUMPTION; SENSOR NETWORKS; WIRELESS SENSORS;

ALGORITHMS; C (PROGRAMMING LANGUAGE); COMPUTER SIMULATION; DATA COMMUNICATION EQUIPMENT; DATABASE SYSTEMS; ENERGY UTILIZATION; MONITORING; OPTIMIZATION; THEOREM PROVING; WIRELESS TELECOMMUNICATION SYSTEMS;

SENSORS;

EID: 4544248862     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. R. Hahn and H. Reichl, "Batteries and power supplies for wearable and ubiquitous computing," in Proc. 3rd Int. Symp. Wearable Computers, 1999.
2. D. Tian and N. D. Georganas, "A coverage-preserving node scheduling scheme for large wireless sensor networks," in Proc. ACM WSNA02, 2002.
3. S. Slijepcevic and M. Potkonjak, "Power efficient organization of wireless sensor networks," in Proc. IEEE International Conference on Communications (ICC), 2001, pp. 472-476.
4. A. Sinha and A. Chandrakasan. "Dynamic power management in wireless networks," IEEE Design & Test of Computers, pp. 62-74, 2001.
5. D.-Z. D. M. Cardei, "Improving wireless sensor network life-time through power aware organization," Submitted to ACM Wireless Networks.
6. R. J. M. II, A. K. Das, M. El-Sharkawi, P. Arabshahi, and A. Gray, "Maximizing lifetime in energy constrained wireless sens array using team optimization of cooperating systems," in Proc. IEEE World Conference on Computational Inteligence 2002, 2002.
7. G. Zussman and A. Segall, "Energy efficient routing in ad hoc disaster recovery networks," in IEEE INFOCOM'03, 2003.
8. F. Leighton and S.Rao, "Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms," Journal of the ACM, vol. 6, pp. 787-832, 1999.
9. N. Garg and J. Könemann, "Faster and simpler algorithms for multicommodity flow and other fractional packing problems," in Proceedings of FOCS, 1997.
10. G. Robins and A. Zelikovsky, "Improved Steiner tree approximation in graphs," in Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms, 2000, pp. 770-779.