메뉴 건너뛰기




Volumn , Issue , 2011, Pages

Scheduling sinks in wireless sensor networks: Theoretic analysis and an optimal algorithm

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDING TECHNIQUES; ENERGY-CONSTRAINED SENSORS; JOINT OPTIMIZATION; NETWORK LIFETIME; OPTIMAL ALGORITHM; POLYNOMIAL-TIME; POOR PERFORMANCE; PROBLEM COMPLEXITY; SINK MOBILITY; THEORETIC ANALYSIS; TIGHTLY-COUPLED; TIME VARYING;

EID: 80052162133     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icc.2011.5963193     Document Type: Conference Paper
Times cited : (3)

References (17)
  • 2
    • 34548321728 scopus 로고    scopus 로고
    • Sensormap for wide-area sensor webs
    • S. Nath, J. Liu, and F. Zhao, "Sensormap for wide-area sensor webs," IEEE Computer Magazine, vol. 40, pp. 90-93, 2007.
    • (2007) IEEE Computer Magazine , vol.40 , pp. 90-93
    • Nath, S.1    Liu, J.2    Zhao, F.3
  • 4
    • 33746764996 scopus 로고    scopus 로고
    • Wireless sensor networks for personal health monitoring: Issues and an implementation
    • M. Aleksandar, O. Chris, and J. Emil, "Wireless sensor networks for personal health monitoring: Issues and an implementation," Comput. Commun., vol. 29, pp. 2521-2533, 2006.
    • (2006) Comput. Commun. , vol.29 , pp. 2521-2533
    • Aleksandar, M.1    Chris, O.2    Emil, J.3
  • 9
    • 0842267734 scopus 로고    scopus 로고
    • Energy efficient schemes for wireless sensor networks with multiple mobile base stations
    • San Francisco, CA, USA, Dec.
    • S. R. Gandham, M. Dawande, R. Prakash, and S. Venkatesan, "Energy efficient schemes for wireless sensor networks with multiple mobile base stations," in Proceeding of IEEE GLOBECOM 2003, vol. 22, San Francisco, CA, USA, Dec. 2003, pp. 377-381.
    • (2003) Proceeding of IEEE GLOBECOM 2003 , vol.22 , pp. 377-381
    • Gandham, S.R.1    Dawande, M.2    Prakash, R.3    Venkatesan, S.4
  • 15
    • 0026135941 scopus 로고
    • An O(n3 • l) potential reduction algorithm for linear programming
    • Y. Ye, "An O(n3 • l) potential reduction algorithm for linear programming," Mathematical Programming, vol. 50, pp. 239-258, 1991.
    • (1991) Mathematical Programming , vol.50 , pp. 239-258
    • Ye, Y.1
  • 17
    • 80052144502 scopus 로고    scopus 로고
    • [Online]. Available
    • [Online]. Available: http://www.lindo.com


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