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 "beenish balanced energy efficient network integrated super heterogeneous protocol for wireless sensor networks"):
  Abstract: In past years there has been increasing interest in field of Wireless Sensor Networks (WSNs). One of the major issue of WSNs is development of energy efficient routing protocols. Clustering is an effective way to increase energy efficiency. Mostly, heterogenous protocols consider two or three energy level of nodes. In reality, heterogonous WSNs contain large range of energy levels. By analyzing communication energy consumption of the clusters and large range of energy levels in heterogenous WSN, we propose BEENISH (Balanced Energy Efficient Network Integrated Super Heterogenous) Protocol. It assumes WSN containing four energy levels of nodes. Here, Cluster Heads (CHs) are elected on the bases of residual energy level of nodes. Simulation results show that it performs better than existing clustering protocols in heterogeneous WSNs. Our protocol achieve longer stability, lifetime and more effective messages than Distributed Energy Efficient Clustering (DEEC), Developed DEEC (DDEEC) and Enhanced DEEC (EDEEC).

Includes members:
  Member "ceec centralized energy efficient clustering a new routing protocol for wsns":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "modeling and evaluating performance of routing operations in reactive routing protocols")
  Member "hsep heterogeneity aware hierarchical stable election protocol for wsns":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "modleach a variant of leach for wsns")
  Member "energy efficient sleep awake aware eesaa intelligent sensor network routing protocol":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "modeling and evaluating performance of routing operations in reactive routing protocols")
  Member "tsep threshold sensitive stable election protocol for wsns":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an energy efficient decoding scheme for wireless body area sensor networks")
  Member "on performance evaluation of variants of deec in wsns":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an energy efficient decoding scheme for wireless body area sensor networks")
  Member "survey of extended leach based clustering routing protocols for wireless sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "how functional complexity affects the scalability energy efficiency trade off of hcc wsn clustering")

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)