## 1 Introduction
In this paper, we use the pull-type RevAuc. In a RevAuc, the server needs to know the participating mobile hosts and their locations by some method. It is easier to build a system with a pull-type RevAuc than with a push-type RevAuc because actions for the RevAuc are started by mobile hosts, and the server can acquire information on the participating mobile hosts and their locations from mobile hosts in a pull-type RevAuc procedure while the server needs to track the position of each participating mobile host with some method such as periodic reports of location by mobile hosts in a push-type RevAuc. Figure 1: Example of MCS using RevAuc. The volume of communication traffic between a server and mobile hosts is a problem when realizing a service that collects current sensing data at a specified location by a pull-type RevAuc. The reasons are related to the three characteristics required during data acquisition by a pull-type RevAuc:  
Timeliness: Obtaining data within a specified timeframe. Quality: Obtaining higher-quality data. Cost: Obtaining lower-cost data. To satisfy the above characteristics, the server needs to receive bids from all mobile hosts that can obtain data within the pre-determined amount of time \(T_{q}\) and select a bid with the highest evaluation score. To participate in a RevAuc, a mobile host needs to query the server for a bid invitation within a period shorter than \(T_{q}\) and send a bid if it is willing to provide data. Even though the amount of data in each message for a query for a bid invitation, the actual bid invitation, and the bid is small, the traffic related to a RevAuc can significantly increase the cost of cellular communication in the system because all mobile hosts transmit all these messages periodically. Thus, a reduction in traffic for bid-related messages to lower the cost of cellular communication in system operation is a need for a pull-type RevAuc. In this paper, we propose a new communication method for a pull-type RevAuc that reduces the cellular traffic between a server and mobile hosts compared to the existing method. The proposed method has the following three features. Reduced cellular traffic by using D2D communication. The proposed method reduces cellular traffic compared to the existing method by sending a bid invitation and collecting bids through D2D communication with the help of so-called representative mobile hosts (REPs). Among mobile hosts that can communicate with a mobile host (referred to as MH-A) by one-hop D2D communication (one-hop neighbors of MH-A), one mobile host volunteers to serve as a REP autonomously. Selection of a successful bidder that can provide data at almost the same location for almost the same size of reward within the same amount of time as in the existing method. In the proposed method, bid invitations are forwarded by REPs. If a REP for a mobile host does not receive a bid invitation from a server, the mobile host cannot receive the bid invitation. However, in the existing method without D2D communication, the mobile host may receive the bid invitation from the server and may provide the requested data for a POI. In this case, the RevAuc result can be different between the proposed method and the existing method without D2D communication. If a server selects suitable REPs to which it sends a bid invitation, a mobile host that can provide the requested data in the existing method without D2D communication will be able to receive the bid invitation and join the RevAuc. In the proposed method using D2D communication, a server should select  
Figure 2: Sequence of pull-type and push-type RevAuc. REPs to which it will send a bid invitation for a data request \(q\) so that a set of mobile hosts that receive the bid invitation via REPs includes the set of mobile hosts that receive bid invitations in the existing method to obtain almost the same result as in the existing method. Mitigation of the effects of misbehaving REPs that fail to fulfill the role of REP.