2008 Second International Conference on Future Generation Communication and Networking 2008
DOI: 10.1109/fgcn.2008.31
|View full text |Cite
|
Sign up to set email alerts
|

Routing in Degree-Constrained FSO Mesh Networks

Abstract: This paper addresses the routing problem in packet switching free-space optical (FSO)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2009
2009
2018
2018

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…Hu et al have discussed the least cost path (LCP) routing algorithm, which is based on reducing the end‐to‐end delay. For routing the traffic from source to destination, they proposed minimum hop count with load‐balancing (MHLB) routing algorithm, which is based on the number of hops.…”
Section: Related Workmentioning
confidence: 99%
“…Hu et al have discussed the least cost path (LCP) routing algorithm, which is based on reducing the end‐to‐end delay. For routing the traffic from source to destination, they proposed minimum hop count with load‐balancing (MHLB) routing algorithm, which is based on the number of hops.…”
Section: Related Workmentioning
confidence: 99%
“…Autonomous reconfiguration, protection strategies, and fault avoidance of FSO networks are studied in [51,52,53,54]. The routing problem in degree constrained FSO WMNs is addressed in [55]. Topology control of FSO networks is studied in [56].…”
Section: Literature Reviewmentioning
confidence: 99%