Dynamic Traffic Model With Optimal Gateways Placement in IP Cloud Heterogeneous CRAN

In this paper, topology design, optimal routing, and gateways placement selection algorithms are proposed in Heterogeneous Cloud Radio Access Network (C-RAN) with exploiting Free Space Optical (FSO) communication. The proposed network consists of two tiers; the lower tier concerns with clustering Remote Radio Heads (RRHs) based on traffic demands. The upper tier consists of transceivers along with the Cluster Heads (CHs) and gateways. Algorithms are proposed to achieve the lowest number of edges and the highest possible throughput based on the presented optimization problem. Moreover, route optimization and gateway selection problems have been considered in two different traffic scenarios; static (maximum occupancy) or dynamic (Partial occupancy). Furthermore, a disaster recovery algorithm is proposed in case of failure of one of the nodes or edges to maintain the continuous connectivity of the network at the expense of the traffic. Our simulation results show that the number of gateways in a dynamic traffic operation is reduced by 33% in node size of 25, 36, and 42. Also, this reduction is increased to 41% if the node size increased to 49.

[1]  Alireza Babaei,et al.  Algebraic connectivity of degree constrained spanning trees for FSO networks , 2013, 2013 IEEE International Conference on Communications (ICC).

[2]  Tao Ding,et al.  Topology control algorithm and dynamic management scheme for mobile FSO networks , 2015, IEEE/OSA Journal of Optical Communications and Networking.

[3]  Tawfik Ismail,et al.  Free Space Optic and mmWave Communications: Technologies, Challenges and Applications , 2016, IEICE Trans. Commun..

[4]  Daniel Medina,et al.  Optimum Internet Gateway Selection in Ad Hoc Networks , 2009, 2009 IEEE International Conference on Communications.

[5]  Murali S. Kodialam,et al.  Characterizing the capacity region in multi-radio multi-channel wireless mesh networks , 2005, MobiCom '05.

[6]  V. S. Anil Kumar,et al.  Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[7]  M. Madheswaran,et al.  A Spanning Tree for Enhanced Cluster Based Routing in Wireless Sensor Network , 2016 .

[8]  Maite Brandt-Pearce,et al.  Link allocation, routing, and scheduling for hybrid FSO/RF wireless mesh networks , 2014, IEEE/OSA Journal of Optical Communications and Networking.

[9]  Randeep Bhatia,et al.  Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks , 2005, IEEE Journal on Selected Areas in Communications.

[10]  Admela Jukan,et al.  The Evolution of Cellular Backhaul Technologies: Current Issues and Future Trends , 2011, IEEE Communications Surveys & Tutorials.

[11]  Ai-Chun Pang,et al.  3-Approximation algorithm for joint routing and link scheduling in wireless relay networks , 2009, IEEE Trans. Wirel. Commun..

[12]  Timothy M. Chan,et al.  Stochastic minimum spanning trees in euclidean spaces , 2011, SoCG '11.

[13]  Naixue Xiong,et al.  Design and Analysis of a MST-Based Topology Control Scheme with PSO for Wireless Sensor Networks , 2011, 2011 IEEE Asia-Pacific Services Computing Conference.

[14]  Qin Xin,et al.  Gateway Selection Scheme for Throughput Optimization in Multi-radio Multi-channel Wireless Mesh Networks , 2009, 2009 Fifth International Conference on Mobile Ad-hoc and Sensor Networks.

[15]  Fang Liu,et al.  Bootstrapping free-space optical networks , 2006, IEEE Journal on Selected Areas in Communications.

[16]  Shiwen Mao,et al.  Building robust spanning trees in free space optical networks , 2010, 2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE.

[17]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[18]  Xiang-Yang Li,et al.  Gateway Placement for Throughput Optimization in Wireless Mesh Networks , 2007, 2007 IEEE International Conference on Communications.