메뉴 건너뛰기




Volumn , Issue , 2009, Pages

Understanding and solving flip-ambiguity in network localization via semidefinite programming

Author keywords

[No Author keywords available]

Indexed keywords

FEASIBLE ALTERNATIVES; IN-NETWORK; LOCALIZABILITY; LOCALIZATION ALGORITHM; LOCALIZATION PROBLEMS; MONTE CARLO SIMULATION; NETWORK LOCALIZATION; RANDOM NETWORK; RANGE-BASED; ROBUST NETWORK; SEMI-DEFINITE PROGRAMMING;

EID: 77951608304     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2009.5425849     Document Type: Conference Paper
Times cited : (24)

References (11)
  • 5
    • 33746874045 scopus 로고    scopus 로고
    • Semidefinite Programming Based Algorithms for Sensor Network Localization with noisy Distance Measurements
    • May
    • P. Biswas, T.-C. Liang, K.-C. Toh, and T.-C. Wang, "Semidefinite Programming Based Algorithms for Sensor Network Localization with noisy Distance Measurements," ACM Transactions on Sensor Networks (TOSN), vol. 2, no. 2, pp. 188-220, May 2006.
    • (2006) ACM Transactions on Sensor Networks (TOSN) , vol.2 , Issue.2 , pp. 188-220
    • Biswas, P.1    Liang, T.-C.2    Toh, K.-C.3    Wang, T.-C.4
  • 11
    • 77951547799 scopus 로고    scopus 로고
    • Weighing Strategy for Network Localization under Scarce Ranging Information
    • submitted
    • G. Destino, G. Abreu, "Weighing Strategy for Network Localization under Scarce Ranging Information," IEEE Transactions on Wireless Communications, p. (submitted), 2009.
    • (2009) IEEE Transactions on Wireless Communications
    • Destino, G.1    Abreu, G.2


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