메뉴 건너뛰기




Volumn 4, Issue , 2006, Pages

Transmission scheduling for sensor network lifetime maximization: A shortest path bandit formulation

Author keywords

[No Author keywords available]

Indexed keywords

CARRIER COMMUNICATION; CHANNEL ESTIMATION; FADING CHANNELS; OPTIMIZATION; SENSORS; STOCHASTIC PROGRAMMING;

EID: 33947670351     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (8)

References (7)
  • 1
    • 0033285518 scopus 로고    scopus 로고
    • On sensor scheduling via information theoretic criteria
    • San Diego, CA, pp, June
    • A. Logothetis and A. Isaksson, "On sensor scheduling via information theoretic criteria," in Proc. of the American Control Conferences, (San Diego, CA), pp. 2402-2406, June 1999.
    • (1999) Proc. of the American Control Conferences , pp. 2402-2406
    • Logothetis, A.1    Isaksson, A.2
  • 3
    • 0036611772 scopus 로고    scopus 로고
    • Algorithms for optimal scheduling and management of Hidden Markov model sensors
    • June
    • V. Krishnamurthy, "Algorithms for optimal scheduling and management of Hidden Markov model sensors," IEEE Trans. Signal Processing, vol. 50, pp. 1382-1397, June 2002.
    • (2002) IEEE Trans. Signal Processing , vol.50 , pp. 1382-1397
    • Krishnamurthy, V.1
  • 7
    • 14644442290 scopus 로고    scopus 로고
    • A note on bandits with a twist
    • July
    • A. -K. Katta and J. Sethuraman, "A note on bandits with a twist," SIAM J. Discrete Math., vol. 18, pp. 110-113, July 2004.
    • (2004) SIAM J. Discrete Math , vol.18 , pp. 110-113
    • Katta, A.-K.1    Sethuraman, J.2


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