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: "maximum lifetime convergecast tree in wireless sensor networks"
  Abstract: We study the problem of building a maximum lifetime data collection tree for periodic convergecast applications in wireless sensor networks. We experimentally observe that if two nodes transmit the same number of data packets, the amount of energy consumption of the nodes is approximately same even if the payload lengths of the transmitted packets are different. The major energy consumption during a packet transmission arises from radio start-up and medium access control overhead. Our formulated lifetime maximization problem captures the energy expenditure due to message transmissions/receptions in terms of the number of data packets in contrast to prior works, which consider data units (amount of sensor data generated by a node). Variable transmission power levels of the radio and accounting for the sensor energy consumption are other factors that make our problem formulation different from those in prior work. We prove that this problem is NP-complete by reducing the set cover problem to it and propose an algorithm to solve it. The performance of the proposed algorithm is experimentally evaluated using Jain's fairness index as a metric by implementing it on an actual testbed consisting of 20 sensor nodes and compared with those of the widely used shortest path tree and random data collection tree algorithms. The energy consumption of different nodes under the proposed algorithm are shown to be more balanced than under the shortest path tree and random data collection tree algorithms. Hence, the proposed algorithm provides a higher network lifetime than that under the other two algorithms.

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)