Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics
Proceedings of the 2nd ACM conference on Electronic commerce
Winner determination in combinatorial auction generalizations
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
A Secure Routing Protocol for Wireless Ad Hoc Networks
HICSS '06 Proceedings of the 39th Annual Hawaii International Conference on System Sciences - Volume 09
Auction-based spectrum sharing
Mobile Networks and Applications
ICPPW '06 Proceedings of the 2006 International Conference Workshops on Parallel Processing
Decentralized, adaptive resource allocation for sensor networks
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Combinatorial Reverse Auction based Scheduling in Multi-Rate Wireless Systems
IEEE Transactions on Computers
On-line sensing task optimization for shared sensors
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Wireless network virtualization as a sequential auction game
INFOCOM'10 Proceedings of the 29th conference on Information communications
Near optimal multi-application allocation in shared sensor networks
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Hi-index | 0.00 |
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.