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: "dynamic resource allocation and activity management for energy efficiency and fairness in heterogeneous networks"
  Abstract: Higher energy consumption of Heterogeneous Networks (HetNet), compared to Macro Only Networks (MONET), raises a great concern about the energy efficiency of HetNets. In this work we study a dynamic activation strategy, which changes the state of small cells between Active and Idle according to the dynamically changing user traffic, in order to increase the energy efficiency of HetNets. Moreover, we incorporate dynamic inter-tier bandwidth allocation to our model. The proposed Dynamic Bandwidth Allocation and Dynamic Activation (DBADA) strategy is applied in cell-edge deployment of small cells, where HotSpot regions are located far from the master base station. Our objective is to maximize the sum utility of the network with minimum energy consumption. To ensure proportional fairness among users, we used logarithmic utility function. To evaluate the performance of the proposed strategy, the median, 10-percentile and the sum of users' data rates and the network energy consumption are evaluated by simulation. Our simulation results shows that the DBADA strategy improves the energy consumed per unit of users' data rate by up to $25\%$. It also achieves lower energy consumption by at least $25\%$, compared to always active scenario for small cells.

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)