human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "mobility aware resource allocation in vlc networks using t step look ahead policy"
  Abstract: Visible light communication (VLC) uses huge license-free spectral bandwidth of visible light for high-speed wireless communication. Since each VLC access point covers a small area, handovers of mobile users are inevitable. In order to deal with these handovers, developing fast and effective resource allocation algorithms is a challenge. This paper introduces the problem of mobility-aware optimization of resources in VLC networks using the  T-step look-ahead   policy and employing the notion of  handover efficiency . It is shown that the handover efficiency can correlate the overall performance of the network with future actions based on the mobility of users. Due to the stationary nature of indoor optical wireless channels, future channel state information (CSI) can be predicted by anticipating the future locations of users. A resource allocation algorithm is thus proposed, which uses CSI to dynamically allocate network resources to users. To solve this mathematically intractable problem, a novel relaxation method is proposed, which proves to be a useful tool to develop efficient algorithms for network optimization problems with a proportional fairness utility function. The resulting algorithm is extremely faster than the previous method and awareness of mobility enhances the overall performance of the network in terms of rate and fairness utility function.

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.NI(Networking and Internet Architecture)