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 "am discnt angular multi hop distance based circular network transmission protocol for wsns"):
  Abstract: The nodes in wireless sensor networks (WSNs) contain limited energy resources, which are needed to transmit data to base station (BS). Routing protocols are designed to reduce the energy consumption. Clustering algorithms are best in this aspect. Such clustering algorithms increase the stability and lifetime of the network. However, every routing protocol is not suitable for heterogeneous environments. AM-DisCNT is proposed and evaluated as a new energy efficient protocol for wireless sensor networks. AM-DisCNT uses circular deployment for even consumption of energy in entire wireless sensor network. Cluster-head selection is on the basis of energy. Highest energy node becomes CH for that round. Energy is again compared in the next round to check the highest energy node of that round. The simulation results show that AM-DisCNT performs better than the existing heterogeneous protocols on the basis of network lifetime, throughput and stability of the system.

Includes members:
  Member "hybrid deec towards efficient energy utilization in 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 "ach away cluster heads scheme for energy efficient clustering protocols in wsns":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "modeling and evaluating performance of routing operations in reactive routing protocols")
  Member "improving network efficiency by removing energy holes in wsns":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "energy optimization and performance analysis of cluster based routing protocols extended from leach for wsns")
  Member "maximizing the lifetime of multi chain pegasis using sink mobility":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "survey on variants of distributed energy efficient clustering protocols in heterogeneous wireless sensor network")
  Member "identifying design requirements for wireless routing link metrics":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distance aware relaying energy efficient dare to monitor patients in multi hop body area sensor networks")
  Member "performance study of etx based wireless routing metrics":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an energy efficient decoding scheme for wireless body area sensor networks")

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)