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 "dreem me distributed regional energy efficient multi hop routing protocol based on maximum energy in wsns"):
  Abstract: Wireless distributed sensor network consists of randomly deployed sensors having low energy assets. These networks can be used for monitoring a variety of environments. Major problems of these networks are energy constraints and their finite lifetimes. To overcome these problems different routing protocols and clustering techniques are introduced. We propose DREEMME which uses a unique technique for clustering to overcome these two problems efficiently. DREEM-ME elects a fix number of cluster heads (CHs) in each round instead of probabilistic selection of CHs. Packet Drop Technique is also implemented in our protocol to make it more comprehensive and practical. In DREEM-ME confidence interval is also shown in each graph which helps in visualising the maximum deviation from original course. Our simulations and results show that DREEM-ME is much better than existing protocols of the same nature.

Includes members:
  Member "eapess an adaptive transmission scheme in wireless sensor networks":
    also connected through other hyperedges:
      (none)
  Member "eddeec enhanced developed distributed energy efficient clustering for heterogeneous wireless sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "survey on variants of distributed energy efficient clustering protocols in heterogeneous wireless sensor network")
  Member "q leach a new routing protocol for wsns":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a new rank order clustering algorithm for prolonging the lifetime of wireless sensor networks")
  Member "heer hybrid energy efficient reactive protocol for wireless sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "survey on variants of distributed energy efficient clustering protocols in heterogeneous wireless sensor network")
  Member "z sep zonal stable election protocol for wireless sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reech me regional energy efficient cluster heads based on maximum energy routing protocol for wsns")
  Member "divide and rule scheme for energy efficient routing in wireless sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an energy efficient decoding scheme for wireless body area sensor networks")
  Member "on adaptive energy efficient transmission in wsns":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an energy efficient decoding scheme for wireless body area sensor networks")
  Member "ceec centralized energy efficient clustering a new routing protocol for wsns":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "modeling and evaluating performance of routing operations in reactive routing protocols")

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)