Soft Real Time Auction Scheme for Task Allocation in Wireless Sensor Networks

Abstract

In resource constrained wireless sensor networks, one of the fundamental challenges is to achieve a fair energy balance among nodes to maximize the overall network lifetime. Auction based schemes are one of the best method to maximize the network Lifetime. Existing Real Time Effective Auction (RTE-A), task allocation algorithm based on Auction method is not efficient in terms of evaluating the best bid value. As it solely based on real time auction method where successor of the current task may not be the best because, in the RTE-A the auction process is stopped as soon as auctioneer get bid value higher than threshold value. Real Time Effective Auction (RTE-A) algorithm is too stringent with respect to time constraints. But many applications may require resource allocation process which is flexible w.r.t time constraints. In our proposed algorithm a soft real time auction approach is used. Where winner of the auction process is not decided as soon as auctioneers get the bid value higher than threshold value But Auctioneer will have a particular time slot, which is based on application requirement. The auctioneer will decide winner at the end of the specific time slot based on maximum bid value. . In our proposed algorithm (SRT-A), we also improve real time task allocation approach by using wait time at the bidder side. The wait time method, tries to get the best bid value by allowing the node with highest bid value to bid earlier than other nodes. Proposed algorithm gives much better bid value in less time in real time application compare to RTE-A algorithm.