메뉴 건너뛰기




Volumn 191, Issue , 2006, Pages

Algorithm design for base station placement problems in sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; BASE STATIONS; COMPUTATIONAL COMPLEXITY; FINITE ELEMENT METHOD; OPTIMIZATION; PROBLEM SOLVING;

EID: 34547632699     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1185373.1185391     Document Type: Conference Paper
Times cited : (6)

References (14)
  • 1
    • 0036343684 scopus 로고    scopus 로고
    • Bounding the life-time of sensor networks via optimal, role assignments
    • New York, NY, June 23-27
    • M. Bhardwaj and A.P. Chandrakasan, "Bounding the life-time of sensor networks via optimal, role assignments," in Proc. IEEE Infocom, pp. 1587-1596, New York, NY, June 23-27, 2002.
    • (2002) Proc. IEEE Infocom , pp. 1587-1596
    • Bhardwaj, M.1    Chandrakasan, A.P.2
  • 2
    • 8344272008 scopus 로고    scopus 로고
    • Power-aware base station positioning for sensor networks
    • Hong Kong, China, March 7-11
    • A. Bogdanov, E. Maneva, and S. Riesenfeld, "Power-aware base station positioning for sensor networks," in Proc. IEEE Infocom, pp. 575-585, Hong Kong, China, March 7-11, 2004.
    • (2004) Proc. IEEE Infocom , pp. 575-585
    • Bogdanov, A.1    Maneva, E.2    Riesenfeld, S.3
  • 3
    • 0035789240 scopus 로고    scopus 로고
    • Maximum flow-life curve for a wireless ad hoc network
    • Long Beach, CA, Oct. 4-5
    • T.X. Brown, H.N. Gabow, and Q. Zhang, "Maximum flow-life curve for a wireless ad hoc network," in Proc. ACM MobiHoc, pp. 128-136, Long Beach, CA, Oct. 4-5, 2001.
    • (2001) Proc. ACM MobiHoc , pp. 128-136
    • Brown, T.X.1    Gabow, H.N.2    Zhang, Q.3
  • 5
    • 4444278670 scopus 로고    scopus 로고
    • Rate allocation in wireless sensor networks with network lifetime requirement
    • Tokyo, Japan, May 24-26
    • Y.T. Hou, Y. Shi, and H.D. Sherali, "Rate allocation in wireless sensor networks with network lifetime requirement," in Proc. ACM MobiHoc, pp. 67-77, Tokyo, Japan, May 24-26, 2004.
    • (2004) Proc. ACM MobiHoc , pp. 67-77
    • Hou, Y.T.1    Shi, Y.2    Sherali, H.D.3
  • 6
    • 1642576463 scopus 로고    scopus 로고
    • Maximum lifetime data gathering and aggregation in wireless sensor networks
    • Atlanta, GA, Aug. 26-29
    • K. Kalpakis, K. Dasgupta, and P. Namjoshi, "Maximum lifetime data gathering and aggregation in wireless sensor networks," in Proc. IEEE International Conference on Networking, pp. 685-696, Atlanta, GA, Aug. 26-29, 2002.
    • (2002) Proc. IEEE International Conference on Networking , pp. 685-696
    • Kalpakis, K.1    Dasgupta, K.2    Namjoshi, P.3
  • 8
    • 1542358975 scopus 로고    scopus 로고
    • Topology control for wireless sensor networks
    • San Diego, CA, Sep. 14-19
    • J. Pan, Y.T. Hou, L. Cai, Y. Shi, and S.X. Shen, "Topology control for wireless sensor networks," in Proc. ACM Mobicom, pp. 286-299, San Diego, CA, Sep. 14-19, 2003.
    • (2003) Proc. ACM Mobicom , pp. 286-299
    • Pan, J.1    Hou, Y.T.2    Cai, L.3    Shi, Y.4    Shen, S.X.5
  • 10
    • 8344254370 scopus 로고    scopus 로고
    • N. Sadagopan and B. Krishnamachari, Maximizing data extraction in energy-limited sensor networks, in Proc. IEEE Infocom, pp. 1717-1727, Tel-Aviv, Israel, March 26-30, 2000.
    • N. Sadagopan and B. Krishnamachari, "Maximizing data extraction in energy-limited sensor networks," in Proc. IEEE Infocom, pp. 1717-1727, Tel-Aviv, Israel, March 26-30, 2000.
  • 11
    • 34547643440 scopus 로고    scopus 로고
    • Y. Shi, Y.T. Hou, A. Efrat, Design of low-complexity approximation algorithms for base station placement problems in sensor networks, Technical Report, the Bradley Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg, VA, July 2005. Available at http://www.ece.vt.edu/thou/Research.html.
    • Y. Shi, Y.T. Hou, A. Efrat, "Design of low-complexity approximation algorithms for base station placement problems in sensor networks," Technical Report, the Bradley Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg, VA, July 2005. Available at http://www.ece.vt.edu/thou/Research.html.
  • 12
    • 4444236383 scopus 로고    scopus 로고
    • Capacity bounds for three classes of wireless networks: Asymmetric, cluster, and hybrid
    • Tokyo, Japan, May 24-26
    • S. Toumpis, "Capacity bounds for three classes of wireless networks: asymmetric, cluster, and hybrid," in Proc. ACM MobiHoc, pp. 133-144, Tokyo, Japan, May 24-26, 2004.
    • (2004) Proc. ACM MobiHoc , pp. 133-144
    • Toumpis, S.1
  • 13
    • 4444255460 scopus 로고    scopus 로고
    • On deriving the upper bound of α-lifetime for large sensor networks
    • Tokyo, Japan, May 24-26
    • H. Zhang and J. Hou, "On deriving the upper bound of α-lifetime for large sensor networks," in Proc. ACM MobiHoc, pp. 121-132, Tokyo, Japan, May 24-26, 2004.
    • (2004) Proc. ACM MobiHoc , pp. 121-132
    • Zhang, H.1    Hou, J.2
  • 14
    • 20344378690 scopus 로고    scopus 로고
    • The energy-limited capacity of wireless networks
    • Santa Clara, CA, Oct. 4-7
    • W. Zhao, M. Ammar, and E. Zegura, "The energy-limited capacity of wireless networks," in Proc. IEEE SECON, pp. 279-288, Santa Clara, CA, Oct. 4-7, 2004.
    • (2004) Proc. IEEE SECON , pp. 279-288
    • Zhao, W.1    Ammar, M.2    Zegura, E.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.