human: Given a node-centered hypergraph: <hypergraph>, where nodes represent authors and hyperedges represent groups of authors who co-authored the same paper.

Details of the hypergraph:
Center node: "Sensing lena-massively distributed compression of sensor images"
  Abstract: The sensor broadcast problem: in our setup, sensors measure each one pixel of an image that unfolds over a field, and broadcast a rate constrained encoding of their measurements to every other sensor-the goal is for all sensors to form an estimate of the entire image is considered. In recent work, we proposed a protocol that uses wavelets to decorrelate sensor data, taking advantage of the compact support of the basis functions to keep costly inter-sensor communication at a minimum. In this paper, we prove an asymptotic optimally result for these protocols: the rate of growth for the traffic they generate is /spl Theta/(log(n/D)) (n nodes, total distortion D), matching exactly the rate of growth of the rate/distortion function. We thus close the gap between theory and practice for this new form of massively distributed (one pixel/sensor) image compression, by providing the first efficient and provably optimal algorithms to solve the sensor broadcast problem.

Connected through hyperedge HE-1 (induced by source paper "On the interdependence of routing and data compression in multi-hop sensor networks"):
  with members:
    - "On the many-to-one transport capacity of a dense wireless sensor network and the compressibility of its data"

Connected through hyperedge HE-2 (induced by source paper "On the many-to-one transport capacity of a dense wireless sensor network and the compressibility of its data"):
  with members:
    - "On the interdependence of routing and data compression in multi-hop sensor networks"
    - "Data Capacity Improvement of Wireless Sensor Networks Using Non-Uniform Sensor Distribution"
    - "Estimation Diversity and Energy Efficiency in Distributed Sensing"
    - "Imposed Route Reuse in Ad Hoc Network Routing Protocols Using Structured Peer-to-Peer Overlay Routing"
    - "Matched source-channel communication for field estimation in wireless sensor networks"

Question: Please tell me which research area the center author belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Computer science