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: "evaluating wireless proactive routing protocols under scalability and traffic constraints"
  Abstract: In this paper, we evaluate and analyze the impact of different network loads and varying no. of nodes on distance vector and link state routing algorithms. We select three well known proactive protocols; Destination Sequenced Distance Vector (DSDV) operates on distance vector routing, while Fisheye State Routing (FSR) and Optimized Link State Routing (OLSR) protocols are based on link state routing. Further, we evaluate and compare the effects on the performance of protocols by changing the routing strategies of routing algorithms. We also enhance selected protocols to achieve high performance. We take throughput, End-to-End Delay (E2ED) and Normalized Routing Load (NRL) as performance metrics for evaluation and comparison of chosen protocols both with default and enhanced versions. Based upon extensive simulations in NS-2, we compare and discuss performance trade-offs of the protocols, i.e., how a protocol achieves high packet delivery by paying some cost in the form of increased E2ED and/or routing overhead. FSR due to scope routing technique performs well in high data rates, while, OLSR is more scalable in denser networks due to limited retransmissions through Multi-Point Relays (MPRs).

Connected through hyperedge HE-1 (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-2 (induced by source paper "imod leach improved modified leach protocol for wireless sensor networks"):
  with members:
    - "ach away cluster heads scheme for energy efficient clustering protocols in wsns"
    - "advanced leach a static clustering based heteroneous routing protocol for wsns"
    - "modleach a variant of leach for wsns"
    - "heer hybrid energy efficient reactive protocol for wireless sensor networks"
    - "energy efficient mac protocols in wireless body area sensor networks a survey"
    - "east energy efficient adaptive scheme for transmission in wireless sensor 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"

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)