Mobile Sink Management for Nonuniformly Distributed Sensor Node Coverage Using a Game Theoretic Approach

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 235)


The paper proposes a novel approach to explore the controlled and coordinated sink movement for Wireless Sensor Network (WSN). Past research showed that using mobile agents for single hop data gathering has several boons over the classical cluster based multi hop data forwarding and collection scheme. In this paper, we explore the mobility of multiple mobile sinks in a network to achieve optimum network coverage. We have incorporated the cooperative behavior among the mobile sinks using the basic idea of game theory. The entire data collection process is portrayed as a game, where the mobile sinks are the players. Players try to increase their payoffs by collecting data from maximum number of sensor nodes. The game is played repetitively. The cooperative nature of the game motivates a mobile sink to move in such a way that it minimizes the common strategies played by the other players, and maximizes the cumulative overall payoff. Our proposed algorithm gives substantial performance enhancement in terms better network coverage, and lower network energy consumption in a randomly deployed sensor environment.


Wireless Sensor Network Mobile Sink Grid Structure Game Theory Cooperative Game Nash Equilibrium 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kinalis, A., Nikoletseas, S.: Scalable Data Collection Protocols for Wireless Sensor Networks with Multiple Mobile Sinks. In: Proceedings of the 40th Annual Simulation Symposium, ANSS 2007, pp. 60–72 (2007)Google Scholar
  2. 2.
    Konstantopoulos, C., Pantziou, G., Gavalas, D., Mpitziopoulos, A., Mamalis, B.: A Rendezvous-Based Approach Enabling Energy-Efficient Sensory Data Collection with Mobile Sinks. IEEE Transactions on Parallel and Distributed Systems 23(5), 809–817 (2012)CrossRefGoogle Scholar
  3. 3.
    Goldenberg, D.K., Lin, J., Morse, A.S., Rosen, B.E., Yang, Y.R.: Towards Mobility as a Network Control Primitive. In: MobiHoc 2004, Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 163–174 (2004)Google Scholar
  4. 4.
    Saad, E.M., Awadalla, M.H., Saleh, M.A., Keshk, H., Darwish, R.R.: A Data Gathering Algorithm for a Mobile Sink in Large-Scale Sensor Networks. In: MMACTEE 2008, Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering, pp. 288–294 (2008)Google Scholar
  5. 5.
    Banerjee, I., Chanak, P., Sikdar, B.K., Rahaman, H.: EERIH: Energy Efficient Routing via Information Highway in Sensor Network. In: IEEE International Conference on Emerging Trends in Electrical and Computer Technology, Kanyakumari, India, March 23-24, pp. 1057–1062 (2011)Google Scholar
  6. 6.
    Luo, J., Hubaux, J.P.: Joint Mobility and Routing for Lifetime Elongation in Wireless Sensor Networks. In: Proceedings of IEEE INFOCOM 2010, pp. 1735–1746 (2010)Google Scholar
  7. 7.
    Machado, R., Tekinay, S.: A Survey of Game-theoretic Approaches in Wireless Sensor Networks. Published in The International Journal of Computer and Telecommunications Networking 52(16), 3047–3061 (2008)MATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Santanu Datta
    • 1
  • Indrajit Banerjee
    • 1
  • Tuhina Samanta
    • 1
  1. 1.Bengal Engineering and Science UniversityShibpurIndia

Personalised recommendations