메뉴 건너뛰기




Volumn , Issue , 2010, Pages 241-244

Diagnosability evaluation for a system-level diagnosis algorithm for Wireless Sensor Networks

Author keywords

[No Author keywords available]

Indexed keywords

DIAGNOSABILITY; DIAGNOSIS ALGORITHMS; FALSE ALARMS; FALSE POSITIVE; FAULTY SENSOR; MUTUAL TESTS; NETWORK TOPOLOGY; SYSTEM LEVELS; SYSTEM-LEVEL DIAGNOSIS; TEST STRATEGIES; TESTING STRATEGIES; TOPOLOGICAL PROPERTIES;

EID: 77956526922     PISSN: 15301346     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCC.2010.5546808     Document Type: Conference Paper
Times cited : (9)

References (11)
  • 1
    • 34047126869 scopus 로고    scopus 로고
    • Wireless sensor networks: A survey on the state of the art and the 802.15.4 and ZigBee standards
    • P. Baronti, P. Pillai, V. W. C. Chook, S. Chessa, A. Gotta and Y. F. Hu, "Wireless Sensor Networks: A Survey on the State of the Art and the 802.15.4 and ZigBee Standards," Computer Communications, vol.7, pp. 1655- 1695,2007.
    • (2007) Computer Communications , vol.7 , pp. 1655-1695
    • Baronti, P.1    Pillai, P.2    Chook, V.W.C.3    Chessa, S.4    Gotta, A.5    Hu, Y.F.6
  • 3
    • 84947657515 scopus 로고
    • Characterization of connection assignment of diagnosable systems
    • Jan.
    • S. L. Hakimi and A.T. Amin, "Characterization of Connection Assignment of Diagnosable Systems," IEEE Transactions on Computers, vol.C-23, pp. 86-88, Jan. 1974.
    • (1974) IEEE Transactions on Computers , vol.C-23 , pp. 86-88
    • Hakimi, S.L.1    Amin, A.T.2
  • 5
    • 0033471867 scopus 로고    scopus 로고
    • On k-connectivity for a geometric random graph
    • Sep.
    • M. D. Penrose, "On k-Connectivity for a Geometric Random Graph," Random Structures and Algorithms, vol.15,2 pp. 145-164, Sep. 1999.
    • (1999) Random Structures and Algorithms , vol.15 , Issue.2 , pp. 145-164
    • Penrose, M.D.1
  • 6
    • 1042289031 scopus 로고    scopus 로고
    • The number of neighbors needed for connectivity of wireless networks
    • F. Xue and P. R. Kumar, "The Number of Neighbors Needed for Connectivity of Wireless Networks," Wireless Networks, vol.10, no.2, pp. 169- 218 1, 2004.
    • (2004) Wireless Networks , vol.10 , Issue.2 , pp. 169-218
    • Xue, F.1    Kumar, P.R.2
  • 7
    • 4444249060 scopus 로고    scopus 로고
    • Asymptotical critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks
    • P. J. Wan and C. W. Yi, "Asymptotical Critical Transmission Radius and Critical Neighbor Number for k-Connectivity in Wireless Ad Hoc Networks," Proc. ACM MobiHoc'04, pp. 1-8, 2004.
    • (2004) Proc. ACM MobiHoc'04 , pp. 1-8
    • Wan, P.J.1    Yi, C.W.2
  • 10
    • 46649100059 scopus 로고    scopus 로고
    • EnergyEfficient cluster-based scheme for failure management in sensor networks
    • G. Venkataraman, S. Emmanuel and S. Thambipillai, "EnergyEfficient Cluster-Based Scheme for Failure Management in Sensor Networks," lET Communications, vol.2, no.4, pp. 528-537, 2008.
    • (2008) IET Communications , vol.2 , Issue.4 , pp. 528-537
    • Venkataraman, G.1    Emmanuel, S.2    Thambipillai, S.3
  • 11
    • 66349118261 scopus 로고    scopus 로고
    • A distributed adaptive scheme for detecting faults in wireless sensor networks
    • Feb.
    • J. Choi, S. Yim, Y. J. Huh and Y. Choi, "A Distributed Adaptive Scheme for Detecting Faults in Wireless Sensor Networks," W SEAS Transactions on Communications, vol.8, no.2, pp. 269-278, Feb. 2009.
    • (2009) W SEAS Transactions on Communications , vol.8 , Issue.2 , pp. 269-278
    • Choi, J.1    Yim, S.2    Huh, Y.J.3    Choi, Y.4


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