human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "modeling routing overhead generated by wireless proactive routing protocols"
  Abstract: In this paper, we present a detailed framework consisting of modeling of routing overhead generated by three widely used proactive routing protocols; Destination-Sequenced Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR). The questions like, how these protocols differ from each other on the basis of implementing different routing strategies, how neighbor estimation errors affect broadcast of route requests, how reduction of broadcast overhead achieves bandwidth, how to cope with the problem of mobility and density, etc, are attempted to respond. In all of the above mentioned situations, routing overhead and delay generated by the chosen protocols can exactly be calculated from our modeled equations. Finally, we analyze the performance of selected routing protocols using our proposed framework in NS-2 by considering different performance parameters; Route REQuest (RREQ) packet generation, End-to-End Delay (E2ED) and Normalized Routing Load (NRL) with respect to varying rates of mobility and density of nodes in the underlying wireless network.

Connected through hyperedge HE-1 (induced by source paper "an energy efficient decoding scheme for wireless body area sensor networks"):
  with members:
    - "heer hybrid energy efficient reactive protocol for wireless sensor networks"
    - "energy efficient mac protocols in wireless body area sensor networks a survey"
    - "e horm an energy efficient hole removing mechanism in wireless sensor networks"
    - "divide and rule scheme for energy efficient routing in wireless sensor networks"
    - "density controlled divide and rule scheme for energy efficient routing in wireless sensor networks"
    - "towards lp modeling for maximizing throughput and minimizing routing delay in proactive protocols in wireless multi hop networks"
    - "srp ms a new routing protocol for delay tolerant wireless sensor networks"
    - "aid an energy efficient decoding scheme for ldpc codes in wireless body area sensor networks"

Connected through hyperedge HE-2 (induced by source paper "modeling and evaluating performance of routing operations in reactive routing protocols"):
  with members:
    - "evaluating and comparing probability of path loss in dsdv olsr and dymo at 802 11 and 802 11p"
    - "ach away cluster heads scheme for energy efficient clustering protocols in wsns"
    - "heer hybrid energy efficient reactive protocol for wireless sensor networks"
    - "evaluating wireless reactive routing protocols with linear programming model for wireless ad hoc networks"
    - "on energy efficiency and delay minimization in reactive protocols in wireless multi hop networks"
    - "e horm an energy efficient hole removing mechanism in wireless sensor networks"
    - "density controlled divide and rule scheme for energy efficient routing in wireless sensor networks"
    - "towards lp modeling for maximizing throughput and minimizing routing delay in proactive protocols in wireless multi hop networks"

Connected through hyperedge HE-3 (induced by source paper "investigating quality routing link metrics in wireless multi hop networks"):
  with members:
    - "evaluating impact of mobility on wireless routing protocols"
    - "identifying design requirements for wireless routing link metrics"
    - "interference and bandwidth adjusted etx in wireless multi hop networks"
    - "performance study of etx based wireless routing metrics"

Connected through hyperedge HE-4 (induced by source paper "evaluating wireless proactive routing protocols under mobility and scalability constraints"):
  with members:
    - "performance study of ieee802 11e qos in edcf contention based static and dynamic scenarios"
    - "performance study of etx based wireless routing metrics"

Connected through hyperedge HE-5 (induced by source paper "on using multiple quality link metrics with destination sequenced distance vector protocol for wireless multi hop networks"):
  with members:
    - "identifying design requirements for wireless routing link metrics"
    - "interference and bandwidth adjusted etx in wireless multi hop networks"
    - "performance study of etx based wireless routing metrics"

Connected through hyperedge HE-6 (induced by source paper "analysis and modeling experiment performance parameters of routing protocols in manets and vanets"):
  with members:
    - "identifying design requirements for wireless routing link metrics"
    - "interference and bandwidth adjusted etx in wireless multi hop networks"

Connected through hyperedge HE-7 (induced by source paper "evaluating wireless proactive routing protocols under scalability and traffic constraints"):
  with members:
    - "evaluating impact of mobility on wireless routing protocols"

Question: Please tell me which class the center node 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)