Graph theory and its applications
Graph theory and its applications
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
A survey on clustering algorithms for wireless sensor networks
Computer Communications
Degree-bounded minimum spanning trees
Discrete Applied Mathematics
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
The nominal capacity of wireless mesh networks
IEEE Wireless Communications
Optical wireless: the story so far
IEEE Communications Magazine
Autonomous Reconfiguration in Free-Space Optical Sensor Networks
IEEE Journal on Selected Areas in Communications
Gateway Placement Optimization in Wireless Mesh Networks With QoS Constraints
IEEE Journal on Selected Areas in Communications
Bootstrapping Free-Space Optical Networks
IEEE Journal on Selected Areas in Communications - Part Supplement
| Hi-index | 0.00 |
Although having high potential for broadband wireless access, wireless mesh networks are known to suffer from throughput and fairness problems, and are thus hard to scale to large size. To this end, hierarchical architectures provide a solution to this scalability problem. In this paper, we address the problem of design and optimization of a tiered wireless access network. At the lower tier, mesh routers are clustered based on traffic demands and delay requirements. The cluster heads are equipped with wireless optical transceivers and form the upper tier free space optical (FSO) network. We first present a plane sweeping and clustering algorithm aiming to minimize the number of clusters. PSC sweeps the network area and captures cluster members under delay and traffic load constraints. We then present an algebraic connectivity-based formulation for FSO network topology optimization and develop a greedy edge-appending algorithm that iteratively inserts edges to maximize algebraic connectivity. The proposed algorithms are analyzed and evaluated via simulations, and are shown to be highly effective as compared to the performance bounds derived in this paper.