메뉴 건너뛰기




Volumn , Issue , 2007, Pages 2150-2155

Hypothesis testing and iterative WLS minimization for WSN localization under LOS/NLOS conditions

Author keywords

[No Author keywords available]

Indexed keywords

RANGE FINDING; SENSOR NETWORKS; SENSORS; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 50249127142     PISSN: 10586393     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSSC.2007.4487620     Document Type: Conference Paper
Times cited : (9)

References (20)
  • 2
    • 0036902913 scopus 로고    scopus 로고
    • Ranging in a dense multipath environment using an UWB radio link
    • December
    • L. Joon-Yong and R. Scholtz, "Ranging in a dense multipath environment using an UWB radio link." IEEE J. Select. Areas Commun., vol. 20, pp. 1667-1683, December 2002.
    • (2002) IEEE J. Select. Areas Commun , vol.20 , pp. 1667-1683
    • Joon-Yong, L.1    Scholtz, R.2
  • 8
    • 4143074639 scopus 로고    scopus 로고
    • Non-parametric non-line-of-sight identification
    • Proc. IEEE 58th Veh, VTC
    • S. Gezici, H. Kobayashi, and H. Poor, "Non-parametric non-line-of-sight identification," in in Proc. IEEE 58th Veh. Tech. Conf. (VTC), 2003.
    • (2003) Tech. Conf
    • Gezici, S.1    Kobayashi, H.2    Poor, H.3
  • 15
    • 34247394256 scopus 로고    scopus 로고
    • S. Venkatesh and R. M. Buehrer, A linear programming approach to NLOS error mitigation in sensor networks, Proceedings of the Fifth International Conference on Information Processing in Sensor Networks (IPSN), pp. pp. 301-308, pril 2006.
    • S. Venkatesh and R. M. Buehrer, "A linear programming approach to NLOS error mitigation in sensor networks," Proceedings of the Fifth International Conference on Information Processing in Sensor Networks (IPSN), pp. pp. 301-308, pril 2006.
  • 18
    • 0002740666 scopus 로고    scopus 로고
    • Solving euclidean distance matrix completion problems via semidefinite programming
    • A. Y. Alfakih, H. Wolkowicz, and A. Khandani, "Solving euclidean distance matrix completion problems via semidefinite programming," Journal on Comp. Opt. and Apps., vol. 12, no. 1, pp. 13-30, 1999.
    • (1999) Journal on Comp. Opt. and Apps , vol.12 , Issue.1 , pp. 13-30
    • Alfakih, A.Y.1    Wolkowicz, H.2    Khandani, A.3
  • 19
    • 0026821495 scopus 로고
    • Conditions for unique graph realization
    • Feb
    • B. Hendrickson, "Conditions for unique graph realization," SIAM Journal on Comp., vol. 21, no. 1, pp. 65-84, Feb 1992.
    • (1992) SIAM Journal on Comp , vol.21 , Issue.1 , pp. 65-84
    • Hendrickson, B.1


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