메뉴 건너뛰기




Volumn 35, Issue 14, 2012, Pages 1749-1758

Energy efficient k-barrier coverage in limited mobile wireless sensor networks

Author keywords

Energy efficient; k barrier coverage; Mobility; Sensing power level; Wireless sensor network

Indexed keywords

COVERAGE PROBLEM; ENERGY COST; ENERGY EFFICIENT; INTEGER LINEAR PROGRAMMING; K-BARRIER COVERAGE; LAGRANGIAN RELAXATION TECHNIQUES; LINEAR PROGRAMMING RELAXATION; MINIMUM COST FLOW PROBLEM; MINIMUM ENERGY COSTS; MOBILE WIRELESS SENSOR NETWORK; POWER LEVELS; SIDE CONSTRAINTS; TOTAL POWER;

EID: 84864769306     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2012.04.021     Document Type: Article
Times cited : (26)

References (20)
  • 5
    • 25844504705 scopus 로고    scopus 로고
    • Energy-efficient target coverage in wireless sensor networks
    • Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies
    • M. Cardei, M.T. Thai, Y. Li, W. Wu, Energy-efficient target coverage in wireless sensor networks, in: Proceedings of IEEE INFOCOM'05, 2005, pp. 1976-1984. (Pubitemid 41390709)
    • (2005) Proceedings - IEEE INFOCOM , vol.3 , pp. 1976-1984
    • Cardei, M.1    Thai, My.T.2    Li, Y.3    Wu, W.4
  • 12
    • 77958493817 scopus 로고    scopus 로고
    • Minimum energy cost k-barrier coverage in wireless Sensor networks
    • H. Yang, D. Li, Q. Zhu, W. Chen, and Y. Hong, Minimum energy cost k-barrier coverage in wireless Sensor networks, In WASA2010, pp. 80-89.
    • WASA2010 , pp. 80-89
    • Yang, H.1    Li, D.2    Zhu, Q.3    Chen, W.4    Hong, Y.5
  • 15
    • 34548327168 scopus 로고    scopus 로고
    • Deploying wireless sensor networks under limited mobility constraints
    • DOI 10.1109/TMC.2007.1032
    • S. Chellappan, W. Gu, X. Bai, D. Xuan, B. Ma, K. Zhang, Deploying wireless sensor networks under limited mobility constraints, in: Proceedings of the IEEE Transactions on Mobile Computing (TMC), vol. 6 (10), 2007, pp. 1142-1157. (Pubitemid 47340572)
    • (2007) IEEE Transactions on Mobile Computing , vol.6 , Issue.10 , pp. 1142-1157
    • Chellappan, S.1    Gu, W.2    Bai, X.3    Xuan, D.4    Ma, B.5    Zhang, K.6
  • 17
    • 0019477279 scopus 로고
    • Lagrangian relaxation method for solving integer programming problems
    • M. Fisher The Lagrangian relaxation method for solving integer programming problems Management Science 27 1 1981 1 18 (Pubitemid 11481441)
    • (1981) Management Science , vol.27 , Issue.1 , pp. 1-18
    • Fisher Marshall, L.1
  • 20
    • 0032162664 scopus 로고    scopus 로고
    • A hybrid algorithm for solving network flow problems with side constrains
    • S. Mathies, and P. Mevert A hybrid algorithm for solving network flow problems with side constrains Computers and Operations Research 25 9 1998 745 756
    • (1998) Computers and Operations Research , vol.25 , Issue.9 , pp. 745-756
    • Mathies, S.1    Mevert, P.2


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