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: "on heterogeneous neighbor discovery in wireless sensor networks"
  Abstract: Neighbor discovery plays a crucial role in the formation of wireless sensor networks and mobile networks where the power of sensors (or mobile devices) is constrained. Due to the difficulty of clock synchronization, many asynchronous protocols based on wake-up scheduling have been developed over the years in order to enable timely neighbor discovery between neighboring sensors while saving energy. However, existing protocols are not fine-grained enough to support all heterogeneous battery duty cycles, which can lead to a more rapid deterioration of long-term battery health for those without support. Existing research can be broadly divided into two categories according to their neighbor-discovery techniques — the quorum based protocols and the co-primality based protocols. In this paper, we propose two neighbor discovery protocols, called Hedis and Todis, that optimize the duty cycle granularity of quorum and co-primality based protocols respectively, by enabling the finest-grained control of heterogeneous duty cycles. We compare the two optimal protocols via analytical and simulation results, which show that although the optimal co-primality based protocol (Todis) is simpler in its design, the optimal quorum based protocol (Hedis) has a better performance since it has a lower relative error rate and smaller discovery delay, while still allowing the sensor nodes to wake up at a more infrequent rate.

Connected through hyperedge HE-1 (induced by source paper "on optimal neighbor discovery"):
  with members:
    - "neighbor discovery latency in ble like protocols"
    - "talk more listen less energy efficient neighbor discovery in wireless sensor networks"
    - "maximizing broadcast throughput under ultra low power constraints"
    - "slotless protocols for fast and energy efficient neighbor discovery"
    - "panda neighbor discovery on a power harvesting budget"
    - "near optimal radio use for wireless network synchronization"
    - "deterministic and energy optimal wireless synchronization"

Connected through hyperedge HE-2 (induced by source paper "neighbor discovery latency in ble like protocols"):
  with members:
    - "maximizing broadcast throughput under ultra low power constraints"
    - "slotless protocols for fast and energy efficient neighbor discovery"
    - "panda neighbor discovery on a power harvesting budget"
    - "precise energy modeling for the bluetooth low energy protocol"

Connected through hyperedge HE-3 (induced by source paper "maximizing broadcast throughput under ultra low power constraints"):
  with members:
    - "robust neighbor discovery in multi hop multi channel heterogeneous wireless networks"
    - "panda neighbor discovery on a power harvesting budget"
    - "energy harvesting wireless communications a review of recent advances"
    - "queue based random access algorithms fluid limits and stability issues"
    - "movers and shakers kinetic energy harvesting for the internet of things"
    - "on the design of efficient csma algorithms for wireless networks"

Connected through hyperedge HE-4 (induced by source paper "slotless protocols for fast and energy efficient neighbor discovery"):
  with members:
    - "neighbor discovery latency in ble like protocols"
    - "precise energy modeling for the bluetooth low energy protocol"

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)