@inproceedings{nayak_hosseinalipour_dai_2017, title={Dynamic advertising in VANETs using repeated auctions}, DOI={10.1109/glocom.2017.8254662}, abstractNote={Vehicular ad-hoc networks (VANETs) have been an active area in the research community during the last decade with focus primarily on routing protocols, security aspects and safety. Recent advances in wireless communication and the inherent dynamic nature of VANETs provide excellent opportunity for advertisement dissemination. In this paper, we address the problem of dynamic advertising in VANETs. We consider a city divided into a grid, where the blocks have different vehicular densities that vary over time. Several advertising companies compete for the blocks to broadcast their advertisements in the network. The content dissemination in the network is controlled by a data management unit that receives requests from advertising companies for each block. To solve the problem of block allocation, we adapt the repeated auction scheme for the dynamic setting. Two new metrics are defined to better represent the real- world scenario and fairness in repeated auctions. We propose an algorithm which is a combination of adaptive linear prediction and nonparametric Bayesian belief update, enabling smart bidding and improving the utilities of the competing advertising companies significantly in the long- run. Through simulations, we show that the proposed algorithm achieves better performance than two baselines approaches.}, booktitle={Globecom 2017 - 2017 ieee global communications conference}, author={Nayak, A. and Hosseinalipour, S. and Dai, H. Y.}, year={2017} }
 @inproceedings{hosseinalipour_nayak_dai_2017, title={Real-time strategy selection for mobile advertising in VANETs}, DOI={10.1109/glocom.2017.8253975}, abstractNote={Vehicular ad-hoc networks (VANETs) has recently attracted a lot of attention due to their great potentials for different applications such as collision avoidance, route finding and autonomous driving. A wide range of coverage and accessibility to the end users in VANETs make them a good target for commercial advertising. This paper addresses the problem of mobile advertising in VANETs. We consider a case where different advertisers compete for the VANET infrastructure. It is assumed that a city is partitioned into a grid of blocks and the central data center manager (CDM) sets the rental price for each block considering the geographical position and the predicted density of vehicles inside the block. The regret-based minimization method is adopted to tackle the problem in response to its dynamic nature. Regret bound of the proposed algorithm and its convergence to the best strategy are shown rigorously. Furthermore, a good potential of the proposed algorithm is revealed through simulations.}, booktitle={Globecom 2017 - 2017 ieee global communications conference}, author={Hosseinalipour, S. and Nayak, A. and Dai, H. Y.}, year={2017} }