2011 - MILCOM 2011 Military Communications Conference 2011
DOI: 10.1109/milcom.2011.6127487
|View full text |Cite
|
Sign up to set email alerts
|

Combinatorial auction-based multiple dynamic mission assignment

Abstract: Abstract-This paper proposes a combinatorial auction based approach to solving a multiple dynamic mission assignment (MDMA) problem. The problem presents itself in scenarios in which mobile nodes perform multiple missions, and the missions are supported by multiple nodes in a mobile ad hoc network. In this scenario, missions may dynamically arrive, may have to be completed at different times, and different numbers of members may be required for mission execution. The proposed MDMA protocol aims to minimize com… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 10 publications
0
5
0
Order By: Relevance
“…In wireless cellular networks, several auction algorithms are commonly employed. These include the Vickrey-Clarke-Groves (VCG) auction [100], which is a sealed-bid auction designed to auction multiple items simultaneously to maximize social welfare; Vickrey's auction [101], another sealed-bid auction where the winning bidder pays the second-highest bid price; and combinatorial auctions [102], where multiple items are auctioned at the same time, allowing bidders to place bids on combinations of items. An auction-based distribution strategy was presented [103] to address power allocation issues in CRANs, demonstrating the adaptability and efficiency of auction methods in optimizing network resource distribution.…”
Section: Auction Theorymentioning
confidence: 99%
“…In wireless cellular networks, several auction algorithms are commonly employed. These include the Vickrey-Clarke-Groves (VCG) auction [100], which is a sealed-bid auction designed to auction multiple items simultaneously to maximize social welfare; Vickrey's auction [101], another sealed-bid auction where the winning bidder pays the second-highest bid price; and combinatorial auctions [102], where multiple items are auctioned at the same time, allowing bidders to place bids on combinations of items. An auction-based distribution strategy was presented [103] to address power allocation issues in CRANs, demonstrating the adaptability and efficiency of auction methods in optimizing network resource distribution.…”
Section: Auction Theorymentioning
confidence: 99%
“…The authors investigated a group member selection process for mission execution. They also proposed a combinatorial auction-based mission assignment algorithms for MANET environments and analyzed the merit of the proposed auction-based algorithm in communication cost and mission completion performance [17]. However, The above works [16], [17] did not address the effect of dynamically arriving tasks and risk behaviors.…”
Section: B Task Assignment In Manetsmentioning
confidence: 99%
“…Maximize P m (t), given j∈M r m,j (t) ≤ P risk m (17) where P m (t) is the completion ratio of task m at time t, M is the set of task members assigned to task m, and P risk m is the acceptable risk threshold for task m modeled as:…”
Section: Winner Determinationmentioning
confidence: 99%
See 1 more Smart Citation
“…However, their solution assumed that the distribution of services' profit and requirement is known a priori, which may not be the case in practice. Recently, Cho et al [24] proposed a multiple dynamic mission (service) assignment problem for tactical mobile ad hoc networks. The proposed solution is based on combinatorial auction theory, which can minimize communication overhead while maximizing node utilization and mission completion ratio.…”
Section: Related Workmentioning
confidence: 99%