Abstract
Cooperation enhancement in ad hoc networks becomes a research hotspot to encourage cooperative forwarding among selfish nodes. In this paper, we model an overlapping coalition formation game to solve the problem. In this game, each node can freely make its decision to join multiple coalitions simultaneously, in order to maximize its utility for its cooperation. Then, we propose a distributed algorithm (called OCF) using three move rules for the different choices for each node to find a stable coalition structure. At last, we verify the performance of OCF algorithm through extensive simulation. The analysis results demonstrate that the OCF algorithm has a better performance than the classical algorithms for coalition games with disjoint coalition formation (called DCF) and the AODV algorithm with non-cooperative scheme.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
