An auction-based strategy for distributed task allocation in wireless sensor networks
The DOI matches its Crossref record.
Abstract
Game theory provides a mathematical tool for the analysis of distributed decision making interactions between agents with conflicting interests. We apply game theory for distributed task allocation in wireless sensor networks (WSNs) where the decision makers in the game are the sensor nodes willing to perform the task to maximize their profits. They have to cope with limited resources (i.e., available energy levels) that imposes a conflict of interest. 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, owing to their perceived fairness and allocation efficiency, are among the well-known game theoretic mechanisms for energy balanced distributed task allocation. In this paper, the real-time distributed task allocation problem is formulated as an incomplete information, incentive compatible and economically-robust reverse auction game. The main objective of this scheme is to maximize the overall network lifetime considering the application's deadline as the constraint. In the proposed game theoretic model, the distributed best response for bid updates globally converges to the unique Nash Equilibrium in a completely asynchronous manner. Another problem addressed in this paper is the winner determination problem. Given a distributed pool of bids from bidders (i.e., sensor nodes), a centralized winner determination protocol (WDP) would require costly message exchanges with high energy consumption and overhead. Hence, we propose the Energy and Delay Efficient Distributed Winner Determination Protocol (ED-WDP) for the reverse auction-based scheme. Our simulation results show a fairer energy balance achieved through this bid formulation in comparison to other well-known static schemes. Moreover, by utilizing the ED-WDP among the numerous distributed resources, the message exchange overhead, energy consumption and delay for winner determination are significantly reduced compared to a centralized WDP.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Antonopoulos, I., Robu, V., Couraud, B., Kirli, D., Norbu, S., Kiprakis, A., Flynn, D., Elizondo-Gonzalez, S., & Wattam, S. (2020) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2020.109899 · Cited by 656
Luong, N. C., Hoang, D. T., Wang, P., Niyato, D., Kim, D. I., & Han, Z. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2582841 · Cited by 357
Artificial Intelligence Enabled Demand Response: Prospects and Challenges in Smart Grid Environment
Khan, M. A., Saleh, A. M., Waseem, M., & Sajjad, I. A. (2023) · IEEE Access · doi:10.1109/access.2022.3231444 · Cited by 179
A Novel Privacy-Preserving Incentive Mechanism for Multi-Access Edge Computing
You, F., Yuan, X., Ni, W., & Jamalipour, A. (2024) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2024.3391303 · Cited by 11
Metadata
- Authors
- Edalat, N., Tham, C.-K., & Xiao, W.
- Venue
- Computer Communications
- Publisher
- Elsevier BV
- Published
- 2012-05
- Volume
- 35
- Issue
- 8
- Pages
- 916-928
- ISSN
- 0140-3664 (ISSN-L)
- OpenAlex
- W2073937142
- Cited by
- 105
- References
- 0
- FWCI
- 7.17
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An auction-based strategy for distributed task allocation in wireless sensor networks. https://app.cochat.ai/papers/10.1016/j.comcom.2012.02.004
- The paper
- Edalat, N., Tham, C.-K., & Xiao, W. (2012). An auction-based strategy for distributed task allocation in wireless sensor networks. Computer Communications. https://doi.org/10.1016/j.comcom.2012.02.004
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.