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 "on greedy routing in dynamic uav networks"):
  Abstract: Unmanned aerial vehicles (UAVs), commonly known as drones, are becoming increasingly popular for various applications. Freely flying drones create highly dynamic environments, where conventional routing algorithms which rely on stationary network contact graphs fail to perform efficiently. Also, link establishment through exploring optimal paths using hello messages (as is used in AODV algorithm) deems extremely inefficient and costly for rapidly changing network topologies. #R##N#In this paper, we present a distance-based greedy routing algorithm for UAV networks solely based on UAVs' local observations of their surrounding subnetwork. Thereby, neither a central decision maker nor a time-consuming route setup and maintenance mechanism are required. To evaluate the proposed method, we derive an analytical bound for the expected number of hops that a packet traverses. Also, we find the expected end-to-end distance traveled by each packet as well as the probability of successful delivery. The simulation results verify the accuracy of the developed analytical expressions and show considerable improvement compared to centralized shortest path routing algorithms.

Includes members:
  Member "leader follower based coalition formation in large scale uav networks a quantum evolutionary approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "wildfire monitoring in remote areas using autonomous unmanned aerial vehicles")
  Member "optimal measurement policy for predicting uav network topology":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "wildfire monitoring in remote areas using autonomous unmanned aerial vehicles")
  Member "dynamic routing for flying ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "securing fleets of consumer drones at low cost")

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)