Abstract
We aim to preserve the large amount of data generated inside base station-less sensor networks with minimum energy cost, while considering that sensor nodes are selfish. Previous research assumed that all the sensor nodes are cooperative and designed a centralized minimum-cost flow solution. However, in a distributed setting wherein energy- and storage-constrained sensor nodes are under different control, they could behave selfishly, only to maximize their own benefit. In this paper, we take a game theoretic approach and design a computationally efficient data preservation game. We show that in our game, individual sensor nodes, motivated solely by self-interest, achieve good system-wide data preservation solution.
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.
