메뉴 건너뛰기




Volumn 3420, Issue I, 2005, Pages 475-482

An optimal node scheduling for flat wireless sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR PROGRAMMING; PACKET NETWORKS; PROBLEM SOLVING; SCHEDULING; SENSORS;

EID: 24644470591     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31956-6_56     Document Type: Conference Paper
Times cited : (28)

References (11)
  • 7
    • 24644512775 scopus 로고    scopus 로고
    • ILOG: (Cplex) http://www.ilog.com/products/cplex/.
  • 8
    • 23944444958 scopus 로고    scopus 로고
    • Low power 0/1 coverage and scheduling techniques in sensor networks
    • University of California, Los Angeles
    • Megerian, S., Potkonjak, M.: Low power 0/1 coverage and scheduling techniques in sensor networks. Technical Reports 030001, University of California, Los Angeles (2003)
    • (2003) Technical Reports 030001
    • Megerian, S.1    Potkonjak, M.2
  • 9
    • 0036933529 scopus 로고    scopus 로고
    • Grid coverage for surveillance and target location in distributed sensor networks
    • Chakrabarty, K., Iyengar, S.S., Qi, H., Cho, E.: Grid coverage for surveillance and target location in distributed sensor networks. In: IEEE Transactions on Computers. (2002) 51 (12): 1448-1453
    • (2002) IEEE Transactions on Computers , vol.51 , Issue.12 , pp. 1448-1453
    • Chakrabarty, K.1    Iyengar, S.S.2    Qi, H.3    Cho, E.4
  • 11
    • 0022031091 scopus 로고
    • An applications oriented guide to lagrangian relaxation
    • Fisher, M.L.: An applications oriented guide to lagrangian relaxation. Interfaces 15 (1985) 10-21
    • (1985) Interfaces , vol.15 , pp. 10-21
    • Fisher, M.L.1


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