human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "staying alive system design for self sufficient sensor networks"):
  Abstract: Self-sustainability is a crucial step for modern sensor networks. Here, we offer an original and comprehensive framework for autonomous sensor networks powered by renewable energy sources. We decompose our design into two nested optimization steps: the inner step characterizes the optimal network operating point subject to an average energy consumption constraint, while the outer step provides online energy management policies making the system energetically self-sufficient in the presence of unpredictable and intermittent energy sources. Our framework sheds new light into the design of pragmatic schemes for the control of energy harvesting sensor networks} and permits to gauge the impact of key sensor network parameters, such as the battery capacity, the harvester size, the information transmission rate and the radio duty cycle. We analyze the robustness of the obtained energy management policies in the cases where the nodes have differing energy inflow statistics and where topology changes may occur, devising effective heuristics. Our energy management policies are finally evaluated considering real solar radiation traces, validating them against state of the art solutions and describing the impact of relevant design choices in terms of achievable network throughput and battery level dynamics.

Includes members:
  Member "dynamic compression transmission for energy harvesting multihop networks with correlated sources":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reconstruction of correlated sources with energy harvesting constraints in delay constrained and delay tolerant communication scenarios")
  Member "solarstat modeling photovoltaic sources through stochastic markov processes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy sustainable paradigms and methods for future mobile networks a survey")
  Member "energy efficient transmission for wireless energy harvesting nodes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal compression and transmission rate control for node lifetime maximization")
  Member "optimal save then transmit protocol for energy harvesting wireless transmitters":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mimo underlay cognitive radio optimized power allocation effective number of transmit antennas and harvest transmit tradeoff")
  Member "transmission with energy harvesting nodes in fading wireless channels optimal policies":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "closed form analysis of non linear age of information in status updates with an energy harvesting transmitter")
  Member "optimal packet scheduling in an energy harvesting communication system":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "timely updates in energy harvesting two hop networks offline and online policies")
  Member "optimal energy management policies for energy harvesting sensor nodes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "achievable rate of multi antenna wsrns with eh constraint in the presence of a jammer")

Question: Please tell me which class the source paper 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)