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 "allocation of repetition redundancy in lora"):
  Abstract: We consider a multipoint-to-point network in which sensors periodically send measurements to a gateway. The system uses Long Range (LoRa) communications in a frequency band with duty-cycle limits. Our aim is to enhance the reliability of the measurement transmissions. #R##N#In this setting, retransmission protocols do not scale well with the number of sensors as the duty cycle limit prevents a gateway from acknowledging all receptions if there are many sensors. We thus intend to improve the reliability without acknowledgments by transmitting multiple copies of a measurement, so that the gateway is able to obtain this measurement as long as it receives at least one copy. Each frame includes the current and a few past measurements. #R##N#We propose a strategy for redundancy allocation that takes into account the effects of fading and interference to determine the number of measurements to be included in a frame. Numerical results obtained using the simulation tool LoRaSim show that the allocation of redundancy provides up to six orders of magnitude decrease in the outage probability. Compared to a system that blindly allocates the maximum redundancy possible under duty-cycle and delay constraints of the gateway and memory constraints of the sensors, our technique provides up to 30% reduction in the average energy spent to successfully deliver a measurement to the gateway.

Includes members:
  Member "low power wide area network analysis can lora scale":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "performance analysis of single cell adaptive data rate enabled lorawan")
  Member "low power wide area networks an overview":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "random access based reliable uplink communication and power transfer using dynamic power splitting")
  Member "cooperative relaying under spatially and temporally correlated interference":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "spatio temporal correlation of interference in manet under spatially correlated shadowing environment")

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)