Spontaneous Cooperation in Multi-domain Sensor Networks

  • Levente Buttyán
  • Tamás Holczer
  • Péter Schaffer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3813)


Sensor networks are large scale networks consisting of several nodes and some base stations. The nodes are monitoring the environment and send their measurement data towards the base stations possibly via multiple hops. Since the nodes are often battery powered, an important design criterion for sensor networks is the maximization of their lifetime. In this paper, we consider multi-domain sensor networks, by which we mean a set of sensor networks that co-exist at the same physical location but run by different authorities. In this setting, the lifetime of all networks can be increased if the nodes cooperate and also forward packets originating from foreign domains. There is a risk, however, that a selfish network takes advantage of the cooperativeness of the other networks and exploits them. We study this problem in a game theoretic setting, and show that, in most cases, there is a Nash equilibrium in the system, in which at least one of the strategies is cooperative, even without introducing any external incentives (e.g., payments).


Sensor Network Nash Equilibrium Time Slot Base Scenario Path Loss Exponent 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless Sensor Networks: A Survey. Computer Networks 38(4), 393–422 (2002)CrossRefGoogle Scholar
  2. 2.
    Buchegger, S., Le Boudec, J.-Y.: Performance Analysis of the CONFIDANT Protocol (Cooperation Of Nodes-Fairness In Dynamic Ad-hoc NeTworks). In: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), June 2002, pp. 80–91 (2002)Google Scholar
  3. 3.
    Buttyán, L., Hubaux, J.-P.: Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks. In: ACM/Kluwer Mobile Networks and Applications (MONET), October 2003, vol. 8(5) (2003)Google Scholar
  4. 4.
    Félegyházi, M., Hubaux, J.-P., Buttyán, L.: Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks. IEEE Transactions on Mobile Computing (to appear)Google Scholar
  5. 5.
    Félegyházi, M., Hubaux, J.-P., Buttyán, L.: Cooperative Packet Forwarding in Multi-Domain Sensor Networks. In: Proceedings of the First International Workshop on Sensor Networks and Systems for Pervasive Computing (PerSeNS) (March 2005)Google Scholar
  6. 6.
    Michiardi, P., Molva, R.: CORE: A COllaborative REputation mechanism to enforce node cooperation in Mobile Ad Hoc Networks. In: Communication and Multimedia Security 2002 (September 2002)Google Scholar
  7. 7.
    Shah, R.C., Rabaey, J.M.: Energy Aware Routing for Low Energy Ad Hoc Sensor Networks. In: IEEE Wireless Communications and Networking Conference, WCNC (2002)Google Scholar
  8. 8.
    Srinivasan, V., Nuggehalli, P., Chiasserini, C.F., Rao, R.R.: Cooperation in Wireless Ad Hoc Networks. In: Proceedings of IEEE INFOCOM 2003, San Francisco, March 30 - April 3 (2003)Google Scholar
  9. 9.
    Ye, F., Chen, A., Lu, S., Zhang, L.: A scalable solution to minimum cost forwarding in large sensor networks. In: Proceedings of the Tenth International Conference on Computer Communications and Networks, pp. 304–309 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Levente Buttyán
    • 1
  • Tamás Holczer
    • 1
  • Péter Schaffer
    • 1
  1. 1.Laboratory of Cryptography and System Security (CrySyS), Department of TelecommunicationsBudapest University of Technology and EconomicsHungary

Personalised recommendations