Please use this identifier to cite or link to this item:
|Title:||Combinatorial auction-based task allocation in multi-application wireless sensor networks|
Quality of Service (QoS)
Wireless sensor networks (WSNs)
|Source:||Edalat, N.,Xiao, W.,Roy, N.,Das, S.K.,Motani, M. (2011). Combinatorial auction-based task allocation in multi-application wireless sensor networks. Proceedings - 2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing, EUC 2011 : 174-181. ScholarBank@NUS Repository. https://doi.org/10.1109/EUC.2011.22|
|Abstract:||Wireless sensor networks (WSNs) are usually assigned tasks for a single application. Recently, the concept of shared sensor networks, which support multiple concurrent applications, has emerged, reducing the deployment and administrative costs, and increasing the usability and efficiency of the network. Supporting task allocation for multiple concurrent applications in sensor networks (such as target tracking, event detection, etc.) requires sharing applications' tasks (such as sensing, computation, etc.) and available network resources. In this paper, we model the distributed task allocation problem for multiple concurrent applications using a reverse combinatorial auction, in which the bidders (sensor nodes) bid the cost value (in terms available resources) for accomplishing the subset of the applications' tasks. The main objective is to maximize the network lifetime by sharing tasks and network resources among applications, while enhancing the overall application QoS (e.g., deadline). We also propose a heuristic two-phase winner determination protocol to solve the combinatorial reverse auction problem. Simulation results show that the proposed scheme offers efficiency and network scalability. © 2011 IEEE.|
|Source Title:||Proceedings - 2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing, EUC 2011|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.