메뉴 건너뛰기




Volumn 26, Issue 1, 2011, Pages 117-129

Theoretical treatment of target coverage in wireless sensor networks

Author keywords

column generation; pattern based solution; target coverage; time dependent solution; wireless sensor networks

Indexed keywords

CONTINUOUS TIME SYSTEMS; HEURISTIC ALGORITHMS; ITERATIVE METHODS; LINEAR PROGRAMMING; TIME DOMAIN ANALYSIS;

EID: 79951504703     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11390-011-9419-4     Document Type: Article
Times cited : (27)

References (21)
  • 3
    • 32644446747 scopus 로고    scopus 로고
    • Energy-efficient coverage problems in wireless ad-hoc sensor networks
    • DOI 10.1016/j.comcom.2004.12.025, PII S014036640500037X
    • M Cardei J Du 2006 Energy-efficient coverage problems in wireless ad hoc sensor networks The Computer Communications Journal 29 4 413 420 10.1016/j.comcom.2004.12.025 (Pubitemid 43243224)
    • (2006) Computer Communications , vol.29 , Issue.4 , pp. 413-420
    • Cardei, M.1    Wu, J.2
  • 4
    • 24044520078 scopus 로고    scopus 로고
    • Improving wireless sensor network lifetime through power aware organization
    • DOI 10.1007/s11276-005-6615-6
    • M Cardei DZ Du 2005 Improving wireless sensor network lifetime through power aware organization ACM Wireless Networks 11 3 333 340 10.1007/s11276-005- 6615-6 (Pubitemid 41217860)
    • (2005) Wireless Networks , vol.11 , Issue.3 , pp. 333-340
    • Cardei, M.1    Du, D.-Z.2
  • 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
    • Cardei M, Thai M, Li Y, Wu W. Energy-efficient target coverage in wireless sensor networks. In Proc. IEEE INFOCOM 2005, Miami, USA, Mar. 13-15, 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
  • 7
    • 33746591732 scopus 로고    scopus 로고
    • Maximal lifetime scheduling for K to 1 sensor-target surveillance networks
    • DOI 10.1016/j.comnet.2005.11.001, PII S1389128605003853
    • H Liu P Wan X Jia 2006 Maximal lifetime scheduling for k to 1 sensor-target surveillance networks Computer Networks 50 15 2839 2854 1102.68358 10.1016/j.comnet.2005.11.001 (Pubitemid 44149233)
    • (2006) Computer Networks , vol.50 , Issue.15 , pp. 2839-2854
    • Liu, H.1    Wan, P.2    Jia, X.3
  • 8
    • 33947415624 scopus 로고    scopus 로고
    • Maximal lifetime scheduling for sensor surveillance systems with k sensors to 1 target
    • 10.1109/TPDS.2006.175
    • H Liu P Wan X Jia 2007 Maximal lifetime scheduling for sensor surveillance systems with k sensors to 1 target IEEE Transactions on Parallel and Distributed Systems 17 12 1526 1536 10.1109/TPDS.2006.175
    • (2007) IEEE Transactions on Parallel and Distributed Systems , vol.17 , Issue.12 , pp. 1526-1536
    • Liu, H.1    Wan, P.2    Jia, X.3
  • 9
    • 26444526691 scopus 로고    scopus 로고
    • Energy-efficient connected coverage of discrete targets in wireless sensor networks
    • Networking and Mobile Computing: Third International Conference, ICCNMC 2005. Proceedings
    • Lu M, Wu J, Cardei M, Li M. Energy-efficient connected coverage of discrete targets in wireless sensor networks. In Proc. IEEE International Conference on Computer Networks and Mobile Computing (ICCNMC2005), Zhangjiajie, China, Aug. 2-4, 2005, pp. 43-52. (Pubitemid 41435744)
    • (2005) Lecture Notes in Computer Science , vol.3619 , pp. 43-52
    • Lu, M.1    Wu, J.2    Cardei, M.3    Li, M.4
  • 12
    • 30244531730 scopus 로고
    • 3 l) potential reduction algorithm for linear programming
    • 0734.90057 10.1007/BF01594937 1103935
    • 3 l) potential reduction algorithm for linear programming Mathematical Programming 50 239 258 0734.90057 10.1007/BF01594937 1103935
    • (1991) Mathematical Programming , vol.50 , pp. 239-258
    • Ye, Y.1
  • 13
    • 0028433926 scopus 로고
    • Solving binary cutting stock problems by column generation and branch-and-bound
    • 0801.90080 10.1007/BF01300970 1273657
    • H Vance C Barnhart E Johnson A Glaw 1994 Solving binary cutting stock problems by column generation and branch-and-bound Computational Optimization and applications 3 2 111 130 0801.90080 10.1007/BF01300970 1273657
    • (1994) Computational Optimization and Applications , vol.3 , Issue.2 , pp. 111-130
    • Vance, H.1    Barnhart, C.2    Johnson, E.3    Glaw, A.4
  • 14
    • 0041438388 scopus 로고    scopus 로고
    • Resource optimization of spatial TDMA in ad hoc radio networks: A column generation approach
    • San Francisco, USA, Mar. 30-Apr. 3
    • Bjorklund P, Varbrand P, Yuan D. Resource optimization of spatial TDMA in ad hoc radio networks: A column generation approach. In Proc. IEEE INFOCOM 2003, San Francisco, USA, Mar. 30-Apr. 3, 2003, pp. 818-824.
    • (2003) Proc. IEEE INFOCOM 2003 , pp. 818-824
    • Bjorklund, P.1    Varbrand, P.2    Yuan, D.3
  • 16
    • 30344453380 scopus 로고    scopus 로고
    • Selected topics in column generation
    • DOI 10.1287/opre.1050.0234
    • ME Lubbecke J Desrosiers 2002 Selected topics in column generation Operations Research 53 6 1007 1023 10.1287/opre.1050.0234 2193875 (Pubitemid 43061815)
    • (2005) Operations Research , vol.53 , Issue.6 , pp. 1007-1023
    • Lubbecke, M.E.1    Desrosiers, J.2
  • 18
    • 34548321728 scopus 로고    scopus 로고
    • SensorMap for wide-area sensor webs
    • S Nath J Liu F Zhao 2007 SensorMap for wide-area sensor webs IEEE Computer Magazine 40 7 90 93
    • (2007) IEEE Computer Magazine , vol.40 , Issue.7 , pp. 90-93
    • Nath, S.1    Liu, J.2    Zhao, F.3
  • 19
    • 25644432121 scopus 로고    scopus 로고
    • Achieving minimum coverage breach under bandwidth constraints in wireless sensor networks
    • Miami, USA, Mar. 13-17
    • Maggie X C, Ruan L, Wu W L. Achieving minimum coverage breach under bandwidth constraints in wireless sensor networks. In Proc. IEEE INFOCOM 2005, Miami, USA, Mar. 13-17, 2003, pp. 2638-2645.
    • (2003) Proc. IEEE INFOCOM 2005 , pp. 2638-2645
    • Maggie, X.C.1    Ruan, L.2    Wu, W.L.3
  • 20
    • 34250346969 scopus 로고    scopus 로고
    • Coverage beach problems in bandwidth constrained sensor networks
    • Article
    • Maggie X C, Ruan L, Wu W L. Coverage beach problems in bandwidth constrained sensor networks. ACM Transactions on Sensor Networks, 2007, 3(2): Article No.12.
    • (2007) ACM Transactions on Sensor Networks , vol.3 , Issue.2
    • Maggie, X.C.1    Ruan, L.2    Wu, W.L.3
  • 21
    • 39349111125 scopus 로고    scopus 로고
    • Minimum coverage breach and maximum network lifetime in wireless sensor networks
    • DOI 10.1109/GLOCOM.2007.215, 4411125, IEEE GLOBECOM 2007 - 2007 IEEE Global Telecommunications Conference, Proceedings
    • Wang C, Thai M T, Li Y et al. Minimum coverage breach and maximum network lifetime in wireless sensor networks. In Proc. IEEE Global Telecommunications Conference (GLOBECOM), Washington DC, USA, Nov. 26-30, 2007, pp. 1118-1123. (Pubitemid 351259203)
    • (2007) GLOBECOM - IEEE Global Telecommunications Conference , pp. 1118-1123
    • Wang, C.1    Thai, M.T.2    Li, Y.3    Wang, F.4    Wu, W.5


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