J. Frigo, Hudson Ayers, V. Kulathumani, Shawn Hinzey, S. Sevanto, Michael Priocou, Xiougang Yang, K. McCabe, A. Saari, Kari Sentz
Environmental monitoring applications often require 24/7 operation in harsh, low resource (e.g. power and communication) environments over a large scale area with ad-hoc deployment of sensors. Data processing at the sensor is required to minimize communication overhead. Such an application scenario presents opportunities for research in wireless sensor networks (WSN)s that are distinct from existing commercial off-the-shelf (COTS) solutions. We present a novel modular, highly flexible, hardware solution with a core feature of a System on a Chip (SoC) with add-ons such as memories, interfaces, and different transmission input/output I/O modalities. The system can manage, process, and transmit data directly within an ad-hoc self healing, self forming, mesh network over long distance (19 km between nodes in the current implementation) or as a stand-alone system. Hardware has been produced and the system has been validated in real-world deployments.
{"title":"Novel WSN Hardware for Long Range Low Power Monitoring","authors":"J. Frigo, Hudson Ayers, V. Kulathumani, Shawn Hinzey, S. Sevanto, Michael Priocou, Xiougang Yang, K. McCabe, A. Saari, Kari Sentz","doi":"10.1109/DCOSS.2017.32","DOIUrl":"https://doi.org/10.1109/DCOSS.2017.32","url":null,"abstract":"Environmental monitoring applications often require 24/7 operation in harsh, low resource (e.g. power and communication) environments over a large scale area with ad-hoc deployment of sensors. Data processing at the sensor is required to minimize communication overhead. Such an application scenario presents opportunities for research in wireless sensor networks (WSN)s that are distinct from existing commercial off-the-shelf (COTS) solutions. We present a novel modular, highly flexible, hardware solution with a core feature of a System on a Chip (SoC) with add-ons such as memories, interfaces, and different transmission input/output I/O modalities. The system can manage, process, and transmit data directly within an ad-hoc self healing, self forming, mesh network over long distance (19 km between nodes in the current implementation) or as a stand-alone system. Hardware has been produced and the system has been validated in real-world deployments.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120893444","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Md Abdullah Al Hafiz Khan, Nirmalya Roy, H. S. Hossain
The new era of consumer devices ranging from smartphones, smartwatches, and smart jewelries augmented with our everyday activities and lifestyle help postulate human behavior, activity, gesture, social interaction, and gaming experience. Intelligently tasking and sharing the sensing, processing, storing, and computing tasks among those emerging consumer-friendly commodity devices based on their proximities, advocate the development of resource-aware collaborative and opportunistic smart living applications. Motivated by this emerging subsets of phenomenal applications, we first propose a finite-state machine (FSM) based human activity recognition framework which opportunistically exploits the relevant data sources from multiple heterogeneous devices to help infer a variety of user contexts. We depict a lightweight maximum entropy based classifier and exploit the a-priori conditional dependences among the feature sets to opportunistically select the right set of sensors with the most appropriate devices. Experimental results on real data traces demonstrate that our proposed Collaborative Opportunistic Activity Recognition, COAR framework helps infer the activities of daily living with ≈ 90% accuracy.
{"title":"COAR: Collaborative and Opportunistic Human Activity Recognition","authors":"Md Abdullah Al Hafiz Khan, Nirmalya Roy, H. S. Hossain","doi":"10.1109/DCOSS.2017.16","DOIUrl":"https://doi.org/10.1109/DCOSS.2017.16","url":null,"abstract":"The new era of consumer devices ranging from smartphones, smartwatches, and smart jewelries augmented with our everyday activities and lifestyle help postulate human behavior, activity, gesture, social interaction, and gaming experience. Intelligently tasking and sharing the sensing, processing, storing, and computing tasks among those emerging consumer-friendly commodity devices based on their proximities, advocate the development of resource-aware collaborative and opportunistic smart living applications. Motivated by this emerging subsets of phenomenal applications, we first propose a finite-state machine (FSM) based human activity recognition framework which opportunistically exploits the relevant data sources from multiple heterogeneous devices to help infer a variety of user contexts. We depict a lightweight maximum entropy based classifier and exploit the a-priori conditional dependences among the feature sets to opportunistically select the right set of sensors with the most appropriate devices. Experimental results on real data traces demonstrate that our proposed Collaborative Opportunistic Activity Recognition, COAR framework helps infer the activities of daily living with ≈ 90% accuracy.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130197690","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Duquennoy, Atis Elsts, Beshr Al Nahas, G. Oikonomou
Synchronized communication has recently emerged as a prime option for low-power critical applications. Solutions such as Glossy or Time Slotted Channel Hopping (TSCH) have demonstrated end-to-end reliability upwards of 99.99%. In this context, the IETF Working Group 6TiSCH is currently standardizing the mechanisms to use TSCH in low-power IPv6 scenarios. This paper identifies a number of challenges when it comes to implementing the 6TiSCH stack. It shows how these challenges can be addressed with practical solutions for locking, queuing, scheduling and other aspects. With this implementation as an enabler, we present an experimental validation and comparison with state-of-the-art MAC protocols. We conduct fine-grained energy profiling, showing the impact of link-layer security on packet transmission. We evaluate distributed time synchronization in a 340-node testbed, and demonstrate that tight synchronization (hundreds of microseconds) can be achieved at very low cost (0.3% duty cycle, 0.008% channel utilization). We finally compare TSCH against traditional MAC layers: low-power listening (LPL) and CSMA, in terms of reliability, latency and energy. We show that with proper scheduling, TSCH achieves by far the highest reliability, and outperforms LPL in both energy and latency.
{"title":"TSCH and 6TiSCH for Contiki: Challenges, Design and Evaluation","authors":"S. Duquennoy, Atis Elsts, Beshr Al Nahas, G. Oikonomou","doi":"10.1109/DCOSS.2017.29","DOIUrl":"https://doi.org/10.1109/DCOSS.2017.29","url":null,"abstract":"Synchronized communication has recently emerged as a prime option for low-power critical applications. Solutions such as Glossy or Time Slotted Channel Hopping (TSCH) have demonstrated end-to-end reliability upwards of 99.99%. In this context, the IETF Working Group 6TiSCH is currently standardizing the mechanisms to use TSCH in low-power IPv6 scenarios. This paper identifies a number of challenges when it comes to implementing the 6TiSCH stack. It shows how these challenges can be addressed with practical solutions for locking, queuing, scheduling and other aspects. With this implementation as an enabler, we present an experimental validation and comparison with state-of-the-art MAC protocols. We conduct fine-grained energy profiling, showing the impact of link-layer security on packet transmission. We evaluate distributed time synchronization in a 340-node testbed, and demonstrate that tight synchronization (hundreds of microseconds) can be achieved at very low cost (0.3% duty cycle, 0.008% channel utilization). We finally compare TSCH against traditional MAC layers: low-power listening (LPL) and CSMA, in terms of reliability, latency and energy. We show that with proper scheduling, TSCH achieves by far the highest reliability, and outperforms LPL in both energy and latency.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114342780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Nikoletseas, Theofanis P. Raptis, C. Raptopoulos
We elaborate on two fundamental models for the emerging technology of Wireless Power Transfer in ad hoc communication networks. The first model is scalar, basically assuming that the received power by multiple transmitters is additive. The second model is vectorial, highlighting the detailed interference between RF waves of different power sources, thus, it is more precise (especially in the far field regions of dense charging systems) and allows addressing interesting superadditive (constructive) and cancellation (destructive) phenomena on the received power. Under these models, we present selected state of the art algorithms for key problems, such as how to deploy and configure the wireless chargers and how to achieve good trade-offs between efficient charging and electromagnetic radiation. We conclude with some future trends and directions in this fascinating topic.
{"title":"Towards more Realistic Models for Wireless Power Transfer Algorithm Design","authors":"S. Nikoletseas, Theofanis P. Raptis, C. Raptopoulos","doi":"10.1109/DCOSS.2017.13","DOIUrl":"https://doi.org/10.1109/DCOSS.2017.13","url":null,"abstract":"We elaborate on two fundamental models for the emerging technology of Wireless Power Transfer in ad hoc communication networks. The first model is scalar, basically assuming that the received power by multiple transmitters is additive. The second model is vectorial, highlighting the detailed interference between RF waves of different power sources, thus, it is more precise (especially in the far field regions of dense charging systems) and allows addressing interesting superadditive (constructive) and cancellation (destructive) phenomena on the received power. Under these models, we present selected state of the art algorithms for key problems, such as how to deploy and configure the wireless chargers and how to achieve good trade-offs between efficient charging and electromagnetic radiation. We conclude with some future trends and directions in this fascinating topic.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122373879","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Low-Power Wide-Area Network (LPWAN) technologies such as Long Range (LoRa) are emerging that enable power efficient wireless communication over very long distances. LPWAN devices typically communicate directly to a sink node which removes the need of constructing and maintaining a complex multi-hop network. However, to ensure efficient and reliable communication LPWAN devices often provide a large number of transmission parameters. For example, a LoRa device can be configured to use different spreading factors, bandwidth settings, coding rates and transmission powers, resulting in over 6720 possible settings. It is a challenge to determine the setting that minimises transmission energy cost while meeting the required communication performance. This paper is the first to present a thorough analysis of the impact of LoRa transmission parameter selection on communication performance. We study in detail the impact of parameter settings on energy consumption and communication reliability. Using this study we develop a link probing regime which enables us to quickly determine transmission settings that satisfy performance requirements. The presented work is a first step towards an automated mechanism for LoRa transmission parameter selection that a deployed LoRa network requires, but is not yet specified within the Long Range Wide Area Network (LoRaWAN) framework.
{"title":"LoRa Transmission Parameter Selection","authors":"Martin C. Bor, U. Roedig","doi":"10.1109/DCOSS.2017.10","DOIUrl":"https://doi.org/10.1109/DCOSS.2017.10","url":null,"abstract":"Low-Power Wide-Area Network (LPWAN) technologies such as Long Range (LoRa) are emerging that enable power efficient wireless communication over very long distances. LPWAN devices typically communicate directly to a sink node which removes the need of constructing and maintaining a complex multi-hop network. However, to ensure efficient and reliable communication LPWAN devices often provide a large number of transmission parameters. For example, a LoRa device can be configured to use different spreading factors, bandwidth settings, coding rates and transmission powers, resulting in over 6720 possible settings. It is a challenge to determine the setting that minimises transmission energy cost while meeting the required communication performance. This paper is the first to present a thorough analysis of the impact of LoRa transmission parameter selection on communication performance. We study in detail the impact of parameter settings on energy consumption and communication reliability. Using this study we develop a link probing regime which enables us to quickly determine transmission settings that satisfy performance requirements. The presented work is a first step towards an automated mechanism for LoRa transmission parameter selection that a deployed LoRa network requires, but is not yet specified within the Long Range Wide Area Network (LoRaWAN) framework.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133757698","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Alexandra S. Pereira, T. R. Silva, Fabrício A. Silva, A. Loureiro
The focus of this work is on the detection of incidents that have a direct impact on the traffic of vehicles in large cities, such as, accidents, road constructions-renovations and traffic jams using Online Social Networks(OSNs). The proposed model aims to find problems being reported, as well as information on the location of the event. The results obtained were significant in the task of categorizing the incident, reaching up to 94% accuracy and 98% of general hits in the task of determining usual traffic incidents, besides promising results in obtaining references to the points in the city where the incidents take place, with up to 58% recall.
{"title":"Traffic Event Detection Using Online Social Networks","authors":"Alexandra S. Pereira, T. R. Silva, Fabrício A. Silva, A. Loureiro","doi":"10.1109/DCOSS.2017.36","DOIUrl":"https://doi.org/10.1109/DCOSS.2017.36","url":null,"abstract":"The focus of this work is on the detection of incidents that have a direct impact on the traffic of vehicles in large cities, such as, accidents, road constructions-renovations and traffic jams using Online Social Networks(OSNs). The proposed model aims to find problems being reported, as well as information on the location of the event. The results obtained were significant in the task of categorizing the incident, reaching up to 94% accuracy and 98% of general hits in the task of determining usual traffic incidents, besides promising results in obtaining references to the points in the city where the incidents take place, with up to 58% recall.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114333455","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Nicolas Primeau, R. Falcon, R. Abielmona, E. Petriu
Supply chains in the current world require extensive use of transportation modes. In combination with ever growing supply chain streamlining efforts, supply chains are particularly vulnerable to disruptions that cause profound effects on downstream actors. Much information is needed to mitigate disruptions, information that could be gathered via a maritime Internet of Things (mIoT). In this paper, we put forth a methodology to detect potentially disruptive events in a maritime supply chain and generate candidate mitigating responses. The proposed framework places risk as the cornerstone of the data-driven analysis and uses a multi-criteria decision approach to propose appropriate actions. An application of the system to mitigate a disruption in a maritime segment of a supply chain is studied. Solutions are composed of combinations of actions to reduce the consequences of a disruption. This system is validated through a scenario in which a weather event causes a disruption in maritime transportation destined to fulfill a supply contract. Finally, conclusions on the system are provided.
{"title":"Continuous Risk-Aware Response Generation for Maritime Supply Chain Disruption Mitigation","authors":"Nicolas Primeau, R. Falcon, R. Abielmona, E. Petriu","doi":"10.1109/DCOSS.2017.25","DOIUrl":"https://doi.org/10.1109/DCOSS.2017.25","url":null,"abstract":"Supply chains in the current world require extensive use of transportation modes. In combination with ever growing supply chain streamlining efforts, supply chains are particularly vulnerable to disruptions that cause profound effects on downstream actors. Much information is needed to mitigate disruptions, information that could be gathered via a maritime Internet of Things (mIoT). In this paper, we put forth a methodology to detect potentially disruptive events in a maritime supply chain and generate candidate mitigating responses. The proposed framework places risk as the cornerstone of the data-driven analysis and uses a multi-criteria decision approach to propose appropriate actions. An application of the system to mitigate a disruption in a maritime segment of a supply chain is studied. Solutions are composed of combinations of actions to reduce the consequences of a disruption. This system is validated through a scenario in which a weather event causes a disruption in maritime transportation destined to fulfill a supply contract. Finally, conclusions on the system are provided.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126848974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Sayakkara, N. Jayasuriya, T. Ranathunga, C. Suduwella, N. Vithanage, C. Keppitiyagama, K. Zoysa, Kasun Hewage, T. Voigt
A significant number of human and elephant lives have been lost due to the human-elephant conflict in Sri Lanka. To save lives of humans and elephants, it is therefore important to minimize encounters between them. In this paper, we present Eloc, a system that detects the presence of elephants using their infrasonic emissions near human habitats and then localize their positions. The high cost of infrasonic detectors is an important challenge to the real-world deployment of such localization systems, in particular in developing countries where the human-elephant conflict occurs. In order to address this problem, we design a low cost infrasonic detector that can be easily built using commodity off-the-shelf hardware. We present promising results in localizing an artificial infrasonic source and real-world experiments that suggest that we can localize free ranging elephants in the wild using this low cost infrasonic detector with an accuracy of around 10 m at distances of several hundred meters.
{"title":"Eloc: Locating Wild Elephants Using Low-Cost Infrasonic Detectors","authors":"A. Sayakkara, N. Jayasuriya, T. Ranathunga, C. Suduwella, N. Vithanage, C. Keppitiyagama, K. Zoysa, Kasun Hewage, T. Voigt","doi":"10.1109/DCOSS.2017.34","DOIUrl":"https://doi.org/10.1109/DCOSS.2017.34","url":null,"abstract":"A significant number of human and elephant lives have been lost due to the human-elephant conflict in Sri Lanka. To save lives of humans and elephants, it is therefore important to minimize encounters between them. In this paper, we present Eloc, a system that detects the presence of elephants using their infrasonic emissions near human habitats and then localize their positions. The high cost of infrasonic detectors is an important challenge to the real-world deployment of such localization systems, in particular in developing countries where the human-elephant conflict occurs. In order to address this problem, we design a low cost infrasonic detector that can be easily built using commodity off-the-shelf hardware. We present promising results in localizing an artificial infrasonic source and real-world experiments that suggest that we can localize free ranging elephants in the wild using this low cost infrasonic detector with an accuracy of around 10 m at distances of several hundred meters.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"395 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124201875","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The paper is motivated by recent surge of interest in utilization of a large number of sensor nodes in cyber-physical systems (CPSs) and the critical importance of managing sensor's restricted resources. In this regard, we propose a multi-sensor and open-loop estimation algorithm with an information-based triggering mechanism. In the open-loop topology considered in this paper, each sensor transfers its measurements to the fusion centre (FC) only in occurrence of specific events (asynchronously). Events are identified using the information-based triggering mechanism without incorporation of a feedback from the FC and/or implementation of a local filter at the sensor level. We propose a multi-sensor triggering approach based on the projection of each local observation into the state-space which corresponds to the achievable gain in the sensor's information state vector. The simulation results show that the proposed multi-sensor information-based triggering mechanism closely follows its full-rate estimation counterpart.
{"title":"Multi-sensor and Information-Based Event Triggered Distributed Estimation","authors":"Somayeh Davar, Arash Mohammadi","doi":"10.1109/DCOSS.2017.22","DOIUrl":"https://doi.org/10.1109/DCOSS.2017.22","url":null,"abstract":"The paper is motivated by recent surge of interest in utilization of a large number of sensor nodes in cyber-physical systems (CPSs) and the critical importance of managing sensor's restricted resources. In this regard, we propose a multi-sensor and open-loop estimation algorithm with an information-based triggering mechanism. In the open-loop topology considered in this paper, each sensor transfers its measurements to the fusion centre (FC) only in occurrence of specific events (asynchronously). Events are identified using the information-based triggering mechanism without incorporation of a feedback from the FC and/or implementation of a local filter at the sensor level. We propose a multi-sensor triggering approach based on the projection of each local observation into the state-space which corresponds to the achievable gain in the sensor's information state vector. The simulation results show that the proposed multi-sensor information-based triggering mechanism closely follows its full-rate estimation counterpart.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130456064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We study the problem of distributing loads in mobile crowdsensing systems (MCS). In this context, we present a multi-commodity network game, more explicitly, an atomic routing game, to depict the linking of several crowd participants into bundles that are capable of successfully completing desired sensing tasks. The nodes of the network correspond to the resources of the crowd participants and the players of our game are sensing service requesters that wish to route their demand along paths trough the network. One resource may serve several requests at the same time, which can be modeled efficiently using the network structure. Resource usage involves load-dependent costs. Our model caters for the uncertainty inherent from crowd involvement and mobility by incorporating certainty parameters in the model. These certainty parameters describe the quality of the partial result a participant can produce. Requesters may set a minimum certainty level for the successful completion of their overall sensing tasks that has to be met. In our model, we analyze four different solution concepts for balancing loads with respect to costs and quality of results: (1) a distributed brute force approach (engaging all suitable crowd participants), (2) a random selection of suitable crowd participants, (3) a Nash equilibrium (as result of decentralized selfish cost-minimizing game play) and (4) a (centralized) social optimum. All considered distributed solutions or an epsilon-approximation of a solution can be computed efficiently (for affine cost functions). Furthermore, well-known results for the price of anarchy of atomic routing games can be transfered to our model, i.e., the relative solution quality of a Nash equilibrium compared to a social optimum is provably bounded. In addition, we provide an extensive experimental study that supports theoretical results and gives further suggestions on the impact of uncertainty. We merge the findings of our analysis into a truthful distributed mechanism such that requesters have no incentive to deviate from an efficient solution.
{"title":"Load Balancing Mechanisms to Regulate Costs and Quality in Mobile Crowdsensing Systems","authors":"Julia Buwaya, J. Rolim","doi":"10.1109/DCOSS.2017.38","DOIUrl":"https://doi.org/10.1109/DCOSS.2017.38","url":null,"abstract":"We study the problem of distributing loads in mobile crowdsensing systems (MCS). In this context, we present a multi-commodity network game, more explicitly, an atomic routing game, to depict the linking of several crowd participants into bundles that are capable of successfully completing desired sensing tasks. The nodes of the network correspond to the resources of the crowd participants and the players of our game are sensing service requesters that wish to route their demand along paths trough the network. One resource may serve several requests at the same time, which can be modeled efficiently using the network structure. Resource usage involves load-dependent costs. Our model caters for the uncertainty inherent from crowd involvement and mobility by incorporating certainty parameters in the model. These certainty parameters describe the quality of the partial result a participant can produce. Requesters may set a minimum certainty level for the successful completion of their overall sensing tasks that has to be met. In our model, we analyze four different solution concepts for balancing loads with respect to costs and quality of results: (1) a distributed brute force approach (engaging all suitable crowd participants), (2) a random selection of suitable crowd participants, (3) a Nash equilibrium (as result of decentralized selfish cost-minimizing game play) and (4) a (centralized) social optimum. All considered distributed solutions or an epsilon-approximation of a solution can be computed efficiently (for affine cost functions). Furthermore, well-known results for the price of anarchy of atomic routing games can be transfered to our model, i.e., the relative solution quality of a Nash equilibrium compared to a social optimum is provably bounded. In addition, we provide an extensive experimental study that supports theoretical results and gives further suggestions on the impact of uncertainty. We merge the findings of our analysis into a truthful distributed mechanism such that requesters have no incentive to deviate from an efficient solution.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132272973","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}