2000 character limit reached
Mobile Adhoc Offloading
Published 18 Jan 2014 in cs.NI | (1401.4528v1)
Abstract: This problem is a series of biddings and auctions. Each round of bidding and auction are different from previous ones because of the change of network topology, variance of budget set by the sender, and possible evolution of strategies of other nodes. The huge strategy space of relay nodes makes the formulation to a game very difficult. We present a brief qualitative analysis in this paper, and propose a bidding strategy based on learning algorithms.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.