We analyze the behavior of selfish sensor nodes when they have uncertainties and incomplete information about one another. We consider a network of such selfish nodes contending for the access of a common wireless communication channel. In this scenario, sensor platforms have only subjective belief distributions about the pay-off functions of their opponents. We characterize the set of all pure strategy Nash equilibria under incomplete information for such selfish sensors. A monotonicity property for the Nash equilibrium strategies is identified. That is, there exists a critical cut-off threshold c* such that if the cost of the collision is smaller than c*, sensors transmit. Otherwise, backing-off becomes more beneficial for them. For the uniformly and exponentially distributed beliefs, we also pinpoint the location of this critical cut-off threshold.
[1]
W. Rudin.
Principles of mathematical analysis
,
1964
.
[2]
Saurabh Ganeriwal,et al.
On selfish behavior in CSMA/CA networks
,
2005,
Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[3]
Stephen B. Wicker,et al.
A Duopoly Pricing Game for Wireless IP Services
,
2007,
2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.
[4]
R. Strichartz.
The way of analysis
,
1995
.
[5]
Stephen B. Wicker,et al.
The Analysis of a Game Theoretic MAC Protocol for Wireless Networks
,
2006,
2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks.