원문정보
초록
영어
In wireless sensor networks, clustering divides network into clusters and makes cluster heads (CHs) responsible for data aggregation. CHs play a significant role in such topology and focus should be fixed on the CH selection. Due to the constraints on available resources, however, a sensor node is likely to be selfish and refuse to serve as a CH. Based on game theory, this paper models the problem and discusses the condition of Nash Equilibrium. Moreover, in case of disconnection between a CH and the sink, data replication is adopted. We set candidate CHs that replicate data in the original CHs respectively under the scenario of a second price sealed auction. Simulation results show that nodes have tendency to cooperate due to the reduction in delay and loss rate. Moreover the throughput of the sink can still be guaranteed if any CH fails to work.
목차
1. Introduction
2. Related Work
3. Our Proposed Game-theoretic Approach
3.1. Relevant models
3.2. Selection of cluster heads
3.3. Game-theoretic model for CH selection
3.4. Data replication and selection of candidate CHs
4. Performance Evaluation
5. Conclusions
Acknowledgements
References