On the design and optimization of a free space optical access network☆
Introduction
The recent explosive increases in pervasive mobile devices and wireless data applications have greatly stressed the capacity of existing wireless access networks. The significant increase in wireless data volume will also have far-reaching impact on the design of future wireless access networks. To this end, wireless mesh networks (WMN) have emerged as a promising technology for providing ubiquitous broadband wireless access to mobile users [2]. Recent years have witnessed significant growth in WMN research and deployment. However, WMNs are also known to suffer from poor scalability. In [3], Jun and Sichitiu showed that the per node throughput decreases as , where n is the number of nodes. In [4], the authors demonstrated that starvation occurs even in the simple scenario where one-hop flows contend with two-hop flows for gateway access. This is largely due to the inefficiency and bi-stability of existing MAC protocols, as well as high penalty for multi-hop flows to re-capture system resources.
Historically, hierarchical network architectures have provided an effective solution to the scalability problem, as demonstrated in the Internet and wireless sensor networks [5]. In the case of WMNs, the authors in [6] investigated a hybrid network architecture consisting of an underlying n-node wireless ad hoc network and a sparse overlay network of m base stations, which are connected with high-bandwidth wired links. The authors showed that the asymptotic throughput capacity of the hybrid network increases linearly with m if m grows faster than .
In this paper, we investigate the design and optimization of a tiered wireless access network, as illustrated in Fig. 1. The lower tier consists of a WMN with a large number of mesh routers providing wireless access to mobile users. To mitigate the scalability problem, we group mesh routers into clusters with bounded diameter. Traffic from/to the cluster members is aggregated and routed through the cluster head, which is equipped with free space optical (FSO) transceivers with multi-gigabit data rates and multi-kilometer ranges. With this architecture, resource contention mainly occurs within the cluster and end-to-end hop counts are greatly reduced due to the use of FSO links. Compared to the architecture in [6], FSO links are easier to deploy than wired links, and can be easily rearranged when traffic requirements change, or when links or nodes fail. The challenging task of QoS provisioning (e.g., delay and throughput) can be greatly simplified.
FSO communications provide cost-effective, license-free, and high-bandwidth links for the upper tier [7]. FSO links require line-of-sight (LOS) and are point-to-point connections. They are immune to electromagnetic interference and are secure due to point-to-point connection with narrow beam divergence. However, FSO links are subject to impairments in the open-air transmission medium, such as attenuation, atmospheric turbulence, obstacles, and beam misalignment. It is important to design topologies with rich connectivity to cope with transmission impairments.
We address the challenging problem of network planning for the tiered wireless access network. The objective is to jointly determine the optimal partition for the lower tier WMN as well as the optimal topology for the upper tier FSO network. However, such a topology design problem is highly complex due to its combinatorial nature. To make the problem tractable, we take a divide-and-conquer approach to break it down into two sub-problems. The first sub-problem is cluster formation in the underlying WMN. In the two-tier architecture, each cluster head serves as an FSO node in the upper tier and is equipped with FSO transceivers. The more the clusters, the more the FSO transceivers that are required in the upper tier. Further, it would be desirable to include more mesh nodes in a cluster (as long as the aggregate traffic condition is satisfied, see Section 3.1) to fully utilize the high data rates an FSO link can offer. Therefore, the objective is to minimize the number of clusters (i.e., cost), while satisfying the delay and traffic load requirements. The second sub-problem is topology design and optimization for the upper tier FSO network to achieve maximum connectivity for a given number of edges. The two sub-problems are coupled with the common objectives of minimizing the cost and maximizing the reliability of the tiered system, while satisfying the QoS requirements.
The formulated sub-problems belong to the class of NP-hard problems [8].1 To provide effective solutions, we take a graph theoretic approach to develop heuristic algorithms. First, we develop a plane sweeping and clustering (PSC) algorithm that sweeps the network area and captures cluster members one after another under delay and traffic load constraints. PSC chooses cluster members by manipulating the adjacency matrix and hop-count matrix of the underlying graph. We derive a lower bound on the number of clusters, which can be used as a benchmark for performance evaluation, and investigate effective schemes to reduce the computational complexity of PSC. Second, we present an algebraic connectivity-based formulation for FSO network topology optimization. We then develop a greedy edge-appending (GEA) algorithm, as well as its distributed version, that iteratively inserts edges to maximize algebraic connectivity. The proposed algorithms are analyzed with regard to complexity and performance bounds, and evaluated via simulations. They are shown highly effective for solving the network design and optimization problem as compared to the performance bounds developed in this paper.
The rest of this paper is organized as follows. We present the system model in Section 2. The design and optimization problems are formulated in Section 3. We present PSC and GEA, and analyze their performance in 4 Lower tier: cluster formation, 5 Upper tier: topology optimization, respectively. Simulation results are presented in Section 6, and related work is discussed in Section 7. Section 8 concludes the paper.
Section snippets
Tiered access network model
As shown in Fig. 1, the lower tier of the wireless access network is a WMN consisting of n mesh routers that provide access to mobile users [2]. The mesh routers use broadcast radio transceivers and each covers a small service area. Without loss of generality, we assume that the mesh routers form a connected network. A small fraction of the mesh routers are gateway nodes with connection to the Internet. Traffic to/from the Internet is routed via the gateways, while traffic between a pair of
Problem statement
In this section, we formulate the design and optimization problem for the tiered wireless access network. Such network planning problems are combinatorial in nature and often have large sizes. To make the problem tractable, we adopt a divide-and-conquer approach to consider the following two sub-problems: (i) the optimized clustering problem, on cluster formation in the underlying WMN; and (ii) the topology optimization problem, on designing the upper tier FSO network topology. These two
Lower tier: cluster formation
In this section, we first describe the PSC algorithm for cluster formation in the lower-tier WMN. We then develop a lower bound on the number of clusters, which can be used as a benchmark for the algorithm performance. Finally we discuss ways to reduce the computational complexity of the PSC algorithm.
Upper tier: topology optimization
The objective of topology optimization is to maximize algebraic connectivity for the upper tier FSO network, while satisfying the traffic load requirements. We first derive a theoretic upper bound for the increase in algebraic connectivity when an additional edge is added. We then present the centralized greedy edge-appending (GEA) algorithm and its distributed version.
Simulation results
In this section, we evaluate the performance of PSC and GEA. The algorithms are implemented in Matlab. We use fixed transmission range r for the lower tier radio network, and simulate log-normal fading for the upper tier FSO links. In each simulation, a large number of mesh routers are uniformly distributed in a square region and a small number of gateway nodes are randomly chosen from the set of mesh routers.
The traffic matrix is randomly generated as follows. Each mesh router generates two
Related work
This paper is closely related to the class of network planning work [28], [29], [30], [22]. Network planning problems usually belong to the class of combinatorial optimization problems, which are NP-hard, and metaheuristics, e.g., simulated annealing [29] or genetic algorithms [30], [22] are used to provide sub-optimal solutions. The main limitations of these approaches are the lack of performance guarantees and the relatively high complexity.
This work is also related to FSO research. See
Conclusion
We studied the problem of design and optimization of a tiered wireless access network. The lower tier mesh network is first partitioned into clusters, and then the topology of the upper tier FSO network is optimized. The objective is to maximize connectivity (and thus robustness) while meeting traffic demand and delay requirements. We presented a PSC algorithm for cluster formation and a GEA algorithm for topology optimization, and derived bounds on their performance. Simulation studies show
Acknowledgments
This work is supported in part by the National Science Foundation under Grant CNS-1145446, and through the Broadband Wireless Access & Application Center (BWAC) site at Auburn University.
References (43)
- et al.
Wireless mesh networksa survey
Computer Networks
(2005) - et al.
A survey on clustering algorithms for wireless sensor networks
Computer Communications
(2007) Maximum algebraic connectivity augmentation is NP-hard
Operations Research Letters
(2008)- et al.
Degree-bounded minimum spanning trees
Discrete Applied Mathematics
(2009) - et al.
MeshUpself-organizing mesh-based topologies for next generation radio access networks
Ad Hoc Networks
(2007) - et al.
Cost-efficient design for higher capacity hybrid wireless-optical broadband access network (WOBAN)
Computer Networks
(2011) - I.K. Son, S. Mao, Design and optimization of a tiered wireless access network, in: Proceedings of IEEE INFOCOM'10, San...
- et al.
The nominal capacity of wireless mesh networks
IEEE Wireless Communications Magazine
(2003) - J. Shi, O. Gurewitz, V. Mancuso, J. Camp, E.W. Knightly, Measurement and modeling of the origins of starvation in...
- B. Liu, Z. Liu, D. Towsley, On the capacity of hybrid wireless networks, in: Proceedings of IEEE INFOCOM'03, San...
Flexible optical wireless links and networks
IEEE Communications Magazine
Computers and IntractabilityA Guide to the Theory of NP-Completeness
Gateway placement optimization in wireless mesh networks with QoS constraints
IEEE Journal on Selected Areas in Communications
Optical wirelessthe story so far
IEEE Communications Magazine
Free-space optical communication through atmospheric turbulence channels
IEEE Transactions on Communications
Graph Theory and Its Applications
Spectral Graph Theory
Graph clustering and minimum cut trees
Internet Mathematics
The Laplacian spectrum of graphs
Algebraic connectivity of graphs
Czechoslovak Mathematical Journal
Cited by (11)
Free space optics/millimeter-wave based vertical and horizontal terrestrial backhaul network for 5G
2020, Optics CommunicationsA survey of free space optical networks
2017, Digital Communications and NetworksCitation Excerpt :Since there may be many connection options when multiple nodes are within range of each other, FSO nodes need to coordinate themselves with respect to to which node to point. That is, there is an inherent network design problem associated with the pointing mechanism [28,52]. Even for stationary nodes, e.g., where FSO transceivers are mounted on top of buildings or geostationary satellites, it is non-trivial that an initial connection be established between two transceivers due to the narrow beam property.
Optical power allocation for adaptive transmissions in wavelength-division multiplexing free space optical networks
2015, Digital Communications and NetworksCitation Excerpt :To harvest the high potential of RoFSO, fading-mitigation techniques should be employed to mitigate atmospheric turbulence-induced intensity fluctuations. To this end, topology control [3,2,4,5], load-balancing [6], and spatial diversity techniques [7] have been studied and proved to be effective in maintaining a good system performance. Adaptive transmissions have been recently introduced into FSO systems and is emerging as a potential solution to mitigate the effect of atmospheric turbulence [8].
Behaviour-based sleep mode for energy efficient integrated optical-wireless access network
2023, AIP Conference Proceedings