메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 586-593

Energy-efficient sensor network design subject to complete coverage and discrimination constraints

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; INTEGER PROGRAMMING; SENSORS; WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 33845486311     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SAHCN.2005.1557110     Document Type: Conference Paper
Times cited : (11)

References (15)
  • 4
    • 0036933529 scopus 로고    scopus 로고
    • Grid coverage for surveillance and target location in distributed sensor networks
    • Dec.
    • K. Chakrabarty, S. S. Iyengar, H. Qi, and E. Cho, "Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks," IEEE Trans. on Computers, vol. 51, no. 12, pp. 1148-1153, Dec. 2002.
    • (2002) IEEE Trans. on Computers , vol.51 , Issue.12 , pp. 1148-1153
    • Chakrabarty, K.1    Iyengar, S.S.2    Qi, H.3    Cho, E.4
  • 5
    • 5044238414 scopus 로고    scopus 로고
    • A simulated annealing algorithm to support the sensor placement for target location
    • May 2-5
    • P. L. Chiu and F. Y. S. Lin, "A Simulated Annealing Algorithm to Support the Sensor Placement for Target Location," in Proc. IEEE CCECE, May 2-5, 2004, pp. 867-870.
    • (2004) Proc. IEEE CCECE , pp. 867-870
    • Chiu, P.L.1    Lin, F.Y.S.2
  • 6
    • 84907694332 scopus 로고    scopus 로고
    • Sensor placement for effective coverage and surveillance in distributed sensor networks
    • March
    • S. S. Dhillon and K. Chakrabarty, "Sensor Placement for Effective Coverage and Surveillance in Distributed Sensor Networks," in Proc. IEEE WCNC, vol. 3, March 2003, pp. 1609-1614.
    • (2003) Proc. IEEE WCNC , vol.3 , pp. 1609-1614
    • Dhillon, S.S.1    Chakrabarty, K.2
  • 8
    • 0019477279 scopus 로고
    • The Lagrangean relaxation method for solving integer programming problem
    • Jan.
    • M. L. Fisher, "The Lagrangean Relaxation Method for Solving Integer Programming Problem," Management Science, vol. 27, no. 1, pp. 1-18, Jan. 1981.
    • (1981) Management Science , vol.27 , Issue.1 , pp. 1-18
    • Fisher, M.L.1
  • 9
    • 0022031091 scopus 로고
    • An applications oriented guide to Lagrangian relaxation
    • March-April
    • M. L. Fisher, "An Applications Oriented Guide to Lagrangian Relaxation," Interfaces, 15:2, pp. 10-21, March-April 1985.
    • (1985) Interfaces , vol.15 , Issue.2 , pp. 10-21
    • Fisher, M.L.1
  • 10
    • 3042785829 scopus 로고    scopus 로고
    • Network coverage using low duty-cycled sensors: Random & coordinated sleep algorithms
    • Berkeley, California, USA, April 26-27
    • C. Hsin and M. Liu, "Network Coverage using Low Duty-Cycled Sensors: Random & Coordinated Sleep Algorithms," in Proc. 3rd International Symposium on Information Processing in Sensor Networks, Berkeley, California, USA, April 26-27, 2004, pp. 433-442.
    • (2004) Proc. 3rd International Symposium on Information Processing in Sensor Networks , pp. 433-442
    • Hsin, C.1    Liu, M.2
  • 11
    • 12544259930 scopus 로고    scopus 로고
    • A near-optimal sensor placement algorithm to achieve complete coverage/discrimination in sensor networks
    • January
    • F. Y. S. Lin and P. L. Chiu, "A Near-optimal Sensor Placement Algorithm to Achieve Complete Coverage/Discrimination in Sensor Networks," IEEE Communications Letters, vol. 9, no. 1, pp. 43-45, January 2005.
    • (2005) IEEE Communications Letters , vol.9 , Issue.1 , pp. 43-45
    • Lin, F.Y.S.1    Chiu, P.L.2


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