메뉴 건너뛰기




Volumn 66, Issue 4, 2006, Pages 507-514

A fast localized algorithm for scheduling sensors

Author keywords

Lifetime maximization; Localized algorithm; Sensor network

Indexed keywords

LIFETIME MAXIMIZATION; LOCALIZED ALGORITHM; SENSOR NETWORK;

EID: 33644901297     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2005.11.003     Document Type: Article
Times cited : (3)

References (13)
  • 1
    • 0003496273 scopus 로고
    • Parallel search for maximal independence given minimal dependence
    • Society for Industrial and Applied Mathematics
    • P. Beame, and M. Luby Parallel search for maximal independence given minimal dependence Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms 1990 Society for Industrial and Applied Mathematics 212 218
    • (1990) Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 212-218
    • Beame, P.1    Luby, M.2
  • 3
    • 24044520078 scopus 로고    scopus 로고
    • Improving wireless sensor network lifetime through power aware organization
    • M. Cardei, and D.-Z. Du Improving wireless sensor network lifetime through power aware organization ACM Wireless Networks 11 3 2005 333 340
    • (2005) ACM Wireless Networks , vol.11 , Issue.3 , pp. 333-340
    • Cardei, M.1    Du, D.-Z.2
  • 5
    • 0036935239 scopus 로고    scopus 로고
    • An efficient distributed algorithm for constructing small dominating sets
    • L. Jia, R. Rajaraman, and T. Suel An efficient distributed algorithm for constructing small dominating sets Distributed Comput. 15 2002 193 205
    • (2002) Distributed Comput. , vol.15 , pp. 193-205
    • Jia, L.1    Rajaraman, R.2    Suel, T.3
  • 7
    • 0026971186 scopus 로고
    • On the parallel complexity of computing a maximal independent set in a hypergraph
    • ACM Press New York
    • P. Kelsen On the parallel complexity of computing a maximal independent set in a hypergraph Proceedings of the 24th Annual ACM Symposium on Theory of Computing 1992 ACM Press New York 339 350
    • (1992) Proceedings of the 24th Annual ACM Symposium on Theory of Computing , pp. 339-350
    • Kelsen, P.1
  • 10
    • 0022807929 scopus 로고
    • A simple parallel algorithm for the maximal independent set problem
    • M. Luby A simple parallel algorithm for the maximal independent set problem SIAM J. Comput. 15 4 1986 1036 1055
    • (1986) SIAM J. Comput. , vol.15 , Issue.4 , pp. 1036-1055
    • Luby, M.1
  • 11
    • 0032107972 scopus 로고    scopus 로고
    • Primal-dual RNC approximation algorithms for set cover and covering integer programs
    • S. Rajagopalan, and V. Vazirani Primal-dual RNC approximation algorithms for set cover and covering integer programs SIAM J. Comput. 28 2 1999 525 540
    • (1999) SIAM J. Comput. , vol.28 , Issue.2 , pp. 525-540
    • Rajagopalan, S.1    Vazirani, V.2
  • 12
    • 0024755294 scopus 로고
    • Linear algorithm for domatic number problem on interval graphs
    • A. Srinavasa Rao, and C. Pandu Rangan Linear algorithm for domatic number problem on interval graphs Inform. Process. Lett. 33 1 1989 29 33
    • (1989) Inform. Process. Lett. , vol.33 , Issue.1 , pp. 29-33
    • Srinavasa Rao, A.1    Pandu Rangan, C.2
  • 13
    • 0027116145 scopus 로고
    • An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model
    • M.-S. Yu, and C.-H. Yang An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model Inform. Process. Lett. 44 1 1992 15 22
    • (1992) Inform. Process. Lett. , vol.44 , Issue.1 , pp. 15-22
    • Yu, M.-S.1    Yang, C.-H.2


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