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 "bound based power optimization for multi hop heterogeneous wireless industrial networks under statistical delay constraints"):
  Abstract: The noticeably increased deployment of wireless networks for battery-limited industrial applications in recent years highlights the need for tractable performance analysis methodologies as well as efficient QoS-aware transmit power management schemes. In this work, we seek to combine several important aspects of such networks, i.e., multi-hop connectivity, channel heterogeneity and the queuing effect, in order to address these needs. We design delay-bound-based algorithms for transmit power minimization and network lifetime maximization of multi-hop heterogeneous wireless networks using our previously developed stochastic network calculus approach for performance analysis of a cascade of buffered wireless fading channels. Our analysis shows an overall transmit power saving of up to 95% compared to a fixed power allocation scheme when using a service model in terms of the Shannon capacity limit. For a more realistic set-up, we evaluate the performance of the suggested algorithm in a WirelessHART network, which is a widely used communication standard for process automation and other industrial applications. We find that link heterogeneity can significantly reduce network lifetime when no efficient power management is applied. Moreover, we show, using extensive simulation study, that the proposed bound-based power allocation performs reasonably well compared to the real optimum, especially in the case of WirelessHART networks.

Includes members:
  Member "statistical delay bound for wirelesshart networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "power minimization under statistical delay constraints for multi hop wireless industrial networks")
  Member "towards a system theoretic approach to wireless network capacity in finite time and space":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the reliability of lte random access performance bounds for machine to machine burst resolution time")
  Member "non equilibrium information envelopes and the capacity delay error tradeoff of source coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "power minimization under statistical delay constraints for multi hop wireless industrial networks")
  Member "delay constrained throughput analysis of a correlated mimo wireless channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "delay performance of miso wireless communications")
  Member "energy efficient scheduling of delay constrained traffic over fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finite horizon throughput maximization for a wirelessly powered device over a time varying channel")
  Member "an end to end probabilistic network calculus with moment generating functions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "analysis of uplink scheduling for haptic communications")

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.PF(Performance)