Please use this identifier to cite or link to this item: https://doi.org/10.1002/sec.631
Title: Auction-based task allocation with trust management for shared sensor networks
Authors: Edalat, N.
Xiao, W.
Motani, M. 
Roy, N.
Das, S.K.
Keywords: Combinatorial auction
Multiple applications
Quality of service (QoS)
Task sharing
Trust management
Wireless sensor networks (WSNs)
Issue Date: Nov-2012
Source: Edalat, N., Xiao, W., Motani, M., Roy, N., Das, S.K. (2012-11). Auction-based task allocation with trust management for shared sensor networks. Security and Communication Networks 5 (11) : 1223-1234. ScholarBank@NUS Repository. https://doi.org/10.1002/sec.631
Abstract: Task allocation for wireless sensor networks with multiple concurrent applications (such as target tracking and event detection) requires sharing applications' tasks (such as sensing and computation) and available network resources. In this paper, we model the distributed task allocation problem for multiple concurrent applications by using a reverse combinatorial auction, in which the bidders (sensor nodes) are supposed to bid cost values (according to their available resources) for accomplishing the subset of the applications' tasks. Trust management schemes consist of a powerful tool for the detection of unexpected node behaviors (such as faulty or malicious). It is critical for participants (i.e., bidders and auctioneer) to estimate each other's trustworthiness before initiating the task allocation procedure. To address this issue, we introduce a real-time trust management module for our auction system that is able to validate the reliable bid value and determine faulty nodes and malicious entities. The main objective of our task allocation scheme is to maximize the network lifetime by sharing tasks and network resources within applications, while enhancing the overall application quality of service (e.g., deadline). We also propose a heuristic two-phase winner determination protocol to deal with the combinatorial reverse auction problem. Simulation results show that the proposed scheme offers the promising performance and efficiency. Copyright © 2012 John Wiley & Sons, Ltd. In this paper, the distributed task allocation problem in sensor networks with multiple concurrent applications is modeled as a reverse combinatorial auction, in which the sensor nodes bid cost values according to their available resources for the subset of the applications' tasks. For the bidders and the auctioneer to estimate each other's trustworthiness, a real-time trust management module is introduced in the auction procedure to validate the reliable bid value and determine faulty nodes and malicious entities. © 2012 John Wiley & Sons, Ltd.
Source Title: Security and Communication Networks
URI: http://scholarbank.nus.edu.sg/handle/10635/55159
ISSN: 19390122
DOI: 10.1002/sec.631
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

6
checked on Dec 14, 2017

WEB OF SCIENCETM
Citations

5
checked on Nov 21, 2017

Page view(s)

33
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.