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 and simulating network connectivity in routing protocols for manets and vanets"
  Abstract: This paper presents a framework for node distribution with respect to density, network connectivity and communication time. Using NS2, we evaluate and compare performance of three routing protocols; Ad-hoc Ondemand Distance Vector (AODV), Dynamic Source Routing (DSR) and Fisheye State Routing (FSR) both in MANETs (IEEE 802.11) and VANETs (IEEE 802.11p). We further enhanced these protocols by changing their routing information exchange intervals; MOD AODV, MOD DSR and MOD FSR. A comprehensive simulation work is performed for the comparison of these routing protocols for varying motilities and scalabilities of nodes. As a result, we can say that AODV outperforms DSR and FSR both in MANETs and VANETs. Index Terms: MANETs, VANETs, AODV, DSR, FSR, Routing, Throughput, E2ED, NRL. I. INTRODUCTION Mobile Ad-hoc Network (MANETs) are self-configuring network of mobile nodes connected by wireless links. Vehicular Ad-hoc Networks (VANETs) belong to special class of MANETs. They are distributed and selfassembling communication networks that are made up of multiple autonomous moving vehicles and peculiarize by very high node mobility. Routing protocols are designed to calculate paths for communication networks. In table driven, proactive protocols are based upon periodic exchange of control messages and maintains routing tables. However, the reactive protocol tries to discover a route only when demand arrives. Our simulation work based upon three protocols comparison in MANETs and in VANETs named as AODV [1], DSR [2] and FSR [3]. Moreover, we introduce some modifications in their routing exchange intervals; 1) in MOD AODV, augments AODV’s Expanding Ring Search algorithm (ERS) limits, 2) in MOD DSR, time associated with storage of routes in Route Cache is modified and 3) Scope intervals in FSR are adjusted in MOD FSR.

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"

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)