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 "optimization of a power splitting protocol for two way multiple energy harvesting relay system"):
  Abstract: Energy harvesting (EH) combined with cooperative communications constitutes a promising solution for future wireless technologies. They enable additional efficiency and increased lifetime to wireless networks. This paper investigates a multiple-relay selection scheme for an EH-based two-way relaying (TWR) system. All relays are considered as EH nodes that harvest energy from renewable energy and radio frequency (RF) sources. Some of them are selected to forward data to the destinations. The power splitting (PS) protocol, by which the EH node splits the input RF signal into two components for EH and information transmission, is adopted at the relay nodes. The objective is to jointly optimize i) the set of selected relays, ii) their PS ratios, and iii) their transmit power levels in order to maximize data rate-based utilities over multiple coherent time slots. A joint-optimization solution based on geometric programming (GP) and binary particle swarm optimization is proposed to solve non-convex problems for two utility functions reflecting the level of fairness in the TWR transmission. Numerical results illustrate the system's behavior versus various parameters and show that the performance of the proposed scheme is very close to that of the optimal branch-and-bound method and that GP outperforms the dual problem-based method.

Includes members:
  Member "rf based energy harvesting in decode and forward relaying systems ergodic and outage capacities":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "relay selection scheduling and power control in wireless powered cooperative communication networks")
  Member "throughput maximization for two way relay channels with energy harvesting nodes the impact of relaying strategies":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient coded cooperative networks with energy harvesting and wireless power transfer")
  Member "wireless powered relays in cooperative communications time switching relaying protocols and throughput analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "energy harvesting wireless communications a review of recent advances":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "analysis of d2d communication with rf energy harvesting and interference management")
  Member "secure communication via a wireless energy harvesting untrusted relay":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secure transmission and self energy recycling with partial eavesdropper csi")
  Member "outage analysis of cooperative transmission with energy harvesting relay time switching vs power splitting":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cooperative spectrum sharing relaying protocols with energy harvesting cognitive user")
  Member "joint resource optimization for multicell networks with wireless energy harvesting relays":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimizing df cognitive radio networks with full duplex enabled energy access points")
  Member "wireless networks with rf energy harvesting a contemporary survey":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")

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)