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 "mobility diversity in mobile wireless networks"):
  Abstract: We introduce the novel concept of mobility diversity for mobile sensor or communication networks as the diversity introduced by transmitting data over different topologies of the network. We show how node mobility can provide diversity by changing the topology of the network. More specifically, we consider a mobile network of a sensor node and a number of sink nodes which are all moving randomly according to different Wiener process mobility models. Assuming that the network topology evolves with time and assuming that the connectivity of the sensor node to at least one sink node is needed for successful communication, we calculate three performance measures for this network, i) the expected number of time instants, where the sensor node is connected to at least one sink node, ii) the probability of outage, being the probability that no sink node is in the vicinity of the sensor node during the observation interval, and finally, iii) the maximum number of consequent failures in the communication. Our theoretical and numerical analysis show that increasing the mobility parameter of the sensor node increases the average number of successful transmissions, decreases the probability of outage, and reduces the maximum delay in the senor-sink communication.

Includes members:
  Member "network capacity region and minimum energy function for a delay tolerant mobile ad hoc network":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the capacity of fractal d2d social networks with hierarchical communications")
  Member "throughput and delay in random wireless networks with restricted mobility":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on throughput capacity for a class of buffer limited manets")

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)