Latest revision as of 15:29, 3 February 2021

Abstract

© 2015 IEEE.In this paper, we study the problem of multi-resource fairness in multi-user sensor networks with heterogeneous and time-varying resources. Particularly we focus on data gathering applications run on Wireless Sensor Networks (WSNs) or Internet of Things (IoT) in which users require to run a serious of sensing operations with various resource requirements. We consider both the resource demands of sensing tasks, and data forwarding tasks needed to establish multi-hop relay communications. By exploiting graph theory, queueing theory and the notion of dominant resource shares, we develop Symbiot, a light-weight, distributed algorithm that ensures multi-resource fairness between these users. With Symbiot, nodes can independently schedule its resources while maintaining network-level resource fairness through observing traffic congestion levels. Large-scale simulations based Contiki OS and Cooja network emulator show the effectiveness of Symbiot in adaptively utilizing available resources and reducing average completion times.

Original document

The different versions of the original document can be found in:

• http://hdl.handle.net/10044/1/23872 under the license https://creativecommons.org/licenses/by-nc-nd

• http://livrepository.liverpool.ac.uk/2023959/1/symbiot-final-font-embedded.pdf under the license http://www.rioxx.net/licenses/all-rights-reserved

• http://spiral.imperial.ac.uk/bitstream/10044/1/23872/6/symbiot.pdf

• http://xplorestaging.ieee.org/ielx7/7335977/7336120/07336232.pdf?arnumber=7336232,

http://dx.doi.org/10.1109/hpcc-css-icess.2015.23 under the license cc-by-nc-nd

• https://dblp.uni-trier.de/db/conf/hpcc/hpcc2015.html#TahirYAM15,

http://spiral.imperial.ac.uk/bitstream/10044/1/23872/6/symbiot.pdf,

https://ieeexplore.ieee.org/document/7336232,

https://dl.acm.org/citation.cfm?id=2860713.2861736,

https://doi.org/10.1109/HPCC-CSS-ICESS.2015.23,

http://livrepository.liverpool.ac.uk/id/eprint/2023959,

http://spiral.imperial.ac.uk/handle/10044/1/23872,

https://academic.microsoft.com/#/detail/2178374864