메뉴 건너뛰기




Volumn 24, Issue 12 SUPPL., 2006, Pages 13-22

Bootstrapping free-space optical networks

Author keywords

Free space optical networks; Minimum degree; Spanning tree

Indexed keywords

1550 NM; COMMUNICATION NODES; DATA RATES; DISTRIBUTED APPROXIMATION ALGORITHM; FREE-SPACE OPTICAL; MINIMUM-DEGREE; NARROW BEAMS; NODE DEGREE; NP COMPLETE; OPTIMAL SOLUTIONS; RANDOMIZED MODELS; SPANNING TREE; SPEED-UPS; WIRELESS OPTICAL COMMUNICATION;

EID: 44949204419     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2006.258219     Document Type: Article
Times cited : (33)

References (12)
  • 2
    • 0037357118 scopus 로고    scopus 로고
    • Flexible optical wireless links and networks
    • Mar
    • C. C. Davis, I. I. Smolyaninov, and S. D. Milner, "Flexible optical wireless links and networks" IEEE Commun. Mag., vol. 41, no. 3, pp. 51-57, Mar. 2003.
    • (2003) IEEE Commun. Mag , vol.41 , Issue.3 , pp. 51-57
    • Davis, C.C.1    Smolyaninov, I.I.2    Milner, S.D.3
  • 5
    • 80055005275 scopus 로고    scopus 로고
    • Center for Networking of Infrastructure Sensors. [Online] Available:
    • Center for Networking of Infrastructure Sensors. [Online] Available: http://www.cnis.umd.edu/hardwarepics.htm
  • 8
    • 27744564765 scopus 로고    scopus 로고
    • Autonomous reconfiguration of backbones in free space optical networks
    • MILCOM 2004 - 2004 IEEE Military Communications Conference
    • A. Desai, J. Llorca, and S. Milner, "Autonomous reconfiguration of backbones in free space optical networks" in Proc. IEEE-MILCOM, Oct./Nov. 2004, vol. 3, pp. 1226-1232. (Pubitemid 41610106)
    • (2004) Proceedings - IEEE Military Communications Conference MILCOM , vol.3 , pp. 1226-1232
    • Desai, A.1    Llorca, J.2    Milner, S.3
  • 9
    • 24344500887 scopus 로고    scopus 로고
    • Autonomous reconfiguration in free-space optical sensor networks
    • DOI 10.1109/JSAC.2005.852183
    • A. Desai and S. Milner, "Autonomous reconfiguration in free space optical sensor networks" IEEE J. Select. Areas Commun., vol. 23, no. 8, pp. 1556-1563, Aug. 2005. (Pubitemid 41251490)
    • (2005) IEEE Journal on Selected Areas in Communications , vol.23 , Issue.8 , pp. 1556-1563
    • Desai, A.1    Milner, S.2
  • 10
    • 85026575220 scopus 로고
    • Approximating the minimum degree spanning tree to within one from the optimal degree
    • M. Furer and B. Raghavachari, "Approximating the minimum degree spanning tree to within one from the optimal degree" in Proc. 3rd ACM-SIAM Symposium on Discrete Algorithms, 1992, pp. 317-324.
    • (1992) Proc. 3rd ACM-SIAM Symposium on Discrete Algorithms , pp. 317-324
    • Furer, M.1    Raghavachari, B.2
  • 11
    • 0000245114 scopus 로고
    • Approximating the minimum-degree Steiner tree to within one from optimal
    • Nov
    • M. Fürer and B. Raghavachari, "Approximating the minimum-degree Steiner tree to within one from optimal" J. Algorithms, vol. 17, no. 3, pp. 409-423, Nov. 1994.
    • (1994) J. Algorithms , vol.17 , Issue.3 , pp. 409-423
    • Fürer, M.1    Raghavachari, B.2
  • 12
    • 33746270789 scopus 로고    scopus 로고
    • Master's thesis, Electrical and Computer Engineering Department, University of Maryland, May
    • F. Liu, "Bootstrapping Free-Space Optical Networks." Master's thesis, Electrical and Computer Engineering Department, University of Maryland, May 2004.
    • (2004) Bootstrapping Free-Space Optical Networks
    • Liu, F.1


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