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 "lpch and udlpch location aware routing techniques in wsns"):
  Abstract: Wireless sensor nodes along with Base Station (BS) constitute a Wireless Sensor Network (WSN). Nodes comprise of tiny power battery. Nodes sense the data and send it to BS. WSNs need protocol for efficient energy consumption of the network. In direct transmission and minimum transmission energy routing protocols, energy consumption is not well distributed. However, LEACH (Low-Energy Adaptive Clustering Hierarchy) is a clustering protocol, randomly selects the Cluster Heads (CHs) in each round. However, random selection of CHs does not guarantee efficient energy consumption of the network. Therefore, we proposed new clustering techniques in routing protocols, Location-aware Permanent CH (LPCH) and User Defined Location-aware Permanent CH (UDLPCH). In both protocols, network field is physically divided in to two regions, equal number of nodes are randomly deployed in each region. In LPCH, number of CHs are selected by LEACH algorithm in first round. However in UDLPCH, equal and optimum number of CHs are selected in each region, throughout the network life time number of CHs are remain same. Simulation results show that stability period and throughput of LPCH is greater than LEACH, stability period and throughput of UDLPCH is greater than LPCH.

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 "advanced leach a static clustering based heteroneous routing protocol for wsns":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "imod leach improved modified leach protocol for wireless sensor networks")
  Member "z sep zonal stable election protocol for wireless sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dreem me distributed regional energy efficient multi hop routing protocol based on maximum energy in wsns")
  Member "e horm an energy efficient hole removing mechanism in wireless sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an energy efficient decoding scheme for wireless body area sensor networks")
  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 "density controlled divide and rule scheme for energy efficient routing 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 "on adaptive energy efficient transmission in wsns":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (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)