Tolerance-Oriented Wi-Fi Advertisement Scheduling: A Near Optimal Study on Accumulative User Interests

Xu, W; Fan, X; Wu, T; Tao, W; Xi, Y; Yang, P; Tian, C

Tolerance-Oriented Wi-Fi Advertisement Scheduling: A Near Optimal Study on Accumulative User Interests

Xu, W Fan, X

Wu, T Tao, W Xi, Y Yang, P Tian, C

Permalink

Publisher:: Springer
Publication Type:: Journal Article
Citation:: Mobile Networks and Applications, 2021, 26, (6), pp. 2242-2257
Issue Date:: 2021-12-01

Closed Access

	Filename	Description	Size
	Tolerance Oriented Wi-Fi Advertisement Scheduling A Near Optimal Study on Accumulative User Interests(1).pdf		3.04 MB		View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Xu, W
dc.contributor.author	Fan, X https://orcid.org/0000-0001-8945-3046
dc.contributor.author	Wu, T
dc.contributor.author	Tao, W
dc.contributor.author	Xi, Y
dc.contributor.author	Yang, P
dc.contributor.author	Tian, C
dc.date.accessioned	2022-05-30T07:10:35Z
dc.date.available	2022-05-30T07:10:35Z
dc.date.issued	2021-12-01
dc.identifier.citation	Mobile Networks and Applications, 2021, 26, (6), pp. 2242-2257
dc.identifier.issn	1383-469X
dc.identifier.issn	1572-8153
dc.identifier.uri	http://hdl.handle.net/10453/157829
dc.description.abstract	While public Wi-Fi hotspots provide ubiquitous Internet access to mobile users, they can also generate revenues for venue owners and mobile advertisers by disseminating advertisements. There have been some research efforts in promoting Wi-Fi monetization from different perspectives, but most of them ignore users’ tolerance towards watching advertisements. Indeed, tolerance plays a fundamental role in Wi-Fi advertising, as it directly influences the effectiveness of advertisements and the long-term profits of advertisers. To address this issue, we study Wi-Fi advertisement scheduling by considering both the tolerance of users in viewing advertisements and resource constraints of Wi-Fi hotspots for broadcasting advertisements. With the goal of maximizing the overall accumulative interests of users, we formulate a mixed integer programming problem for Wi-Fi advertisement scheduling. We prove that the objective function of this problem is monotone and submodular, subject to a knapsack constraint and a partition matroid constraint. On this basis, we solve it by proposing a novel greedy swap algorithm, which has a 1−e−22-approximation performance guarantee. Through extensive synthetic and trace-driven evaluations, we show that the proposed algorithm effectively improves users’ interests towards different Wi-Fi advertisements and achieves robust results near to the optimal solution.
dc.language	en
dc.publisher	Springer
dc.relation.ispartof	Mobile Networks and Applications
dc.relation.isbasedon	10.1007/s11036-021-01849-8
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0805 Distributed Computing, 0999 Other Engineering
dc.subject.classification	Networking & Telecommunications
dc.title	Tolerance-Oriented Wi-Fi Advertisement Scheduling: A Near Optimal Study on Accumulative User Interests
dc.type	Journal Article
utslib.citation.volume	26
utslib.for	0805 Distributed Computing
utslib.for	0999 Other Engineering
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
utslib.copyright.status	closed_access	*
pubs.consider-herdc	false
dc.date.updated	2022-05-30T07:10:33Z
pubs.issue	6
pubs.publication-status	Published
pubs.volume	26
utslib.citation.issue	6

Abstract:

While public Wi-Fi hotspots provide ubiquitous Internet access to mobile users, they can also generate revenues for venue owners and mobile advertisers by disseminating advertisements. There have been some research efforts in promoting Wi-Fi monetization from different perspectives, but most of them ignore users’ tolerance towards watching advertisements. Indeed, tolerance plays a fundamental role in Wi-Fi advertising, as it directly influences the effectiveness of advertisements and the long-term profits of advertisers. To address this issue, we study Wi-Fi advertisement scheduling by considering both the tolerance of users in viewing advertisements and resource constraints of Wi-Fi hotspots for broadcasting advertisements. With the goal of maximizing the overall accumulative interests of users, we formulate a mixed integer programming problem for Wi-Fi advertisement scheduling. We prove that the objective function of this problem is monotone and submodular, subject to a knapsack constraint and a partition matroid constraint. On this basis, we solve it by proposing a novel greedy swap algorithm, which has a 1−e−22-approximation performance guarantee. Through extensive synthetic and trace-driven evaluations, we show that the proposed algorithm effectively improves users’ interests towards different Wi-Fi advertisements and achieves robust results near to the optimal solution.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/157829