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 "a type of virtual force based energy hole mitigation strategy for sensor networks"):
  Abstract: In the era of Big Data and Mobile Internet, how to ensure the terminal devices (e.g., sensor nodes) work steadily for a long time is one of the key issues to improve the efficiency of the whole network. However, a lot of facts have shown that the unattended equipments are prone to failure due to energy exhaustion, physical damage and other reasons. This may result in the emergence of energy-hole, seriously affecting network performance and shortening its lifetime. To reduce data redundancy and avoid the generation of sensing blind areas, a type of Virtual Force based Energy-hole Mitigation strategy (VFEM) is proposed in this paper. Firstly, the virtual force (gravitation and repulsion) between nodes is introduced that makes nodes distribute as uniformly as possible. Secondly, in order to alleviate the “energy-hole problem”, the network is divided into several annuluses with the same width. Then, another type of virtual force, named “virtual gravity generated by annulus”, is proposed to further optimize the positions of nodes in each annulus. Finally, with the help of the “data forwarding area”, the optimal paths for data uploading can be selected out, which effectively balances energy consumption of nodes. Experiment results show that, VFEM has a relatively good performance on postponing the generation time of energy-holes as well as prolonging the network lifetime compared with other typical energy-hole mitigation methods.

Includes members:
  Member "theory and experiment for wireless powered sensor networks how to keep sensors alive":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient fair and qos aware policies for wirelessly powered communication networks")
  Member "dreem me distributed regional energy efficient multi hop routing protocol based on maximum energy in wsns":
    also connected through other hyperedges:
      (none)

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)