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: "relay selection scheduling and power control in wireless powered cooperative communication networks"
  Abstract: Relay nodes are used to improve the throughput, delay and reliability performance of energy harvesting networks by assisting both energy and information transfer between information nodes and access point. Previous studies on radio frequency energy harvesting networks are limited to single source single/multiple relay networks. In this paper, a novel joint relay selection, scheduling and power control problem for multiple source multiple relay network is formulated with the objective of minimizing the total duration of wireless power and information transfer. The formulated problem is non-convex mixed-integer non-linear programming problem, and proven to be NP-hard. We first formulate a sub-problem on scheduling and power control for a given relay selection. We propose an efficient optimal algorithm based on a bi-level optimization over power transfer time allocation. Then, for optimal relay selection, we present optimal exponential-time Branch-and-Bound (BB) based algorithm where the nodes are pruned with problem specific lower and upper bounds. We also provide two BB-based heuristic approaches limiting the number of branches generated from a BB-node, and a relay criterion based lower complexity heuristic algorithm. The performance of the proposed algorithms are demonstrated to outperform conventional harvest-then-cooperate approaches with up to $88\%$ lower schedule length for various network settings.

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)