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 "imod leach improved modified leach protocol for wireless sensor networks"):
  Abstract: Increased use of Wireless sensor Networks (WSNs) in variety of applications has enabled the designers to create autonomous sensors, which can be deployed randomly, without human supervision, for the purpose of sensing and communicating valuable data. Many energy-efficient routing protocols are designed for WSNs based on clustering structure. In this paper, we have proposed iMODLEACH protocol which is an extension to the MODLEACH protocol. Simulation results indicate that iMODLEACH outperforms MODLEACH in terms of network life-time and packets transferred to base station. The mathematical analysis helps to select such values of these parameters which can suit a particular wireless sensor network application. INDEX TERMS— Wireless Sensor Networks, Routing Protocols, Clustering, Base Station, Cluster Head.

Includes members:
  Member "ach away cluster heads scheme for energy efficient clustering protocols in 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 "advanced leach a static clustering based heteroneous routing protocol for wsns":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lpch and udlpch location aware routing techniques in wsns")
  Member "modleach a variant of leach for wsns":
    also connected through other hyperedges:
      (none)
  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 "energy efficient mac protocols in wireless body area sensor networks a survey":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an energy efficient decoding scheme for wireless body area sensor networks")
  Member "east energy efficient adaptive scheme for transmission in wireless sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "modleach a variant of leach for wsns")
  Member "e horm an energy efficient hole removing mechanism in wireless sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an energy efficient decoding scheme for wireless body area sensor networks")
  Member "density controlled divide and rule scheme for energy efficient routing in wireless sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)