Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Predictability and Fairness in Social Sensing

Full text
Author(s):
Ghosh, Ramen [1] ; Marecek, Jakub [2] ; Griggs, Wynita M. [3, 4] ; Souza, Matheus [5] ; Shorten, Robert N. [6]
Total Authors: 5
Affiliation:
[1] Univ Coll Dublin, Sch Elect & Elect Engn, Dublin D04 V1W8 4 - Ireland
[2] Czech Tech Univ, Fac Elect Engn, Prague 12135 - Czech Republic
[3] Monash Univ, Dept Civil Engn, Clayton, Vic 3800 - Australia
[4] Monash Univ, Dept Elect & Comp Syst Engn, Clayton, Vic 3800 - Australia
[5] Univ Estadual Campinas, Sch Elect & Comp Engn, BR-13083970 Campinas - Brazil
[6] Imperial Coll London, Dyson Sch Design Engn, London SW7 2AZ - England
Total Affiliations: 6
Document type: Journal article
Source: IEEE INTERNET OF THINGS JOURNAL; v. 9, n. 1, p. 37-54, JAN 1 2022.
Web of Science Citations: 0
Abstract

We consider the design of distributed algorithms that govern the manner in which agents contribute to a social sensing platform. Specifically, we are interested in situations, where fairness among the agents contributing to the platform is needed. A notable example is the platforms operated by public bodies, where fairness is a legal requirement. The design of such distributed systems is challenging due to the fact that we wish to simultaneously realize an efficient social sensing platform but also deliver a predefined quality of service to the agents (for example, a fair opportunity to contribute to the platform). In this article, we introduce iterated function systems (IFSs) as a tool for the design and analysis of systems of this kind. We show how the IFS framework can be used to realize systems that deliver a predictable quality of service to agents, can be used to underpin contracts governing the interaction of agents with the social sensing platform, and which are efficient. To illustrate our design via a use case, we consider a large, high-density network of participating parked vehicles. When awoken by an administrative center, this network proceeds to search for moving missing entities of interest using RFID-based techniques. We regulate which vehicles are actively searching for the moving entity of interest at any point in time. In doing so, we seek to equalize vehicular energy consumption across the network. This is illustrated through simulations of a search for a missing Alzheimer's patient in Melbourne, Australia. The experimental results are presented to illustrate the efficacy of our system and the predictability of access of agents to the platform independent of initial conditions. (AU)

FAPESP's process: 16/19504-7 - A Contribution to Sampled-Data and Switched Systems Control
Grantee:Matheus Souza
Support Opportunities: Regular Research Grants