Skip to main content

Advertisement

SpringerLink
Log in

Probabilistic Coverage in Wireless Sensor Networks: a Game Theoretical Approach

  • Research Paper
  • Published:
Iranian Journal of Science and Technology, Transactions of Electrical Engineering Aims and scope Submit manuscript

Abstract

In this paper, the problem of full area coverage in wireless sensor networks is investigated by keeping the minimum number of heterogeneous sensor nodes. The coverage problem is considered for both deterministic and probabilistic heterogeneous sensors. We propose a new distributed game theory-based algorithm to maximize the area coverage while minimizing the number of activated sensors. Due to the energy limitations in sensor networks, we formulate the area coverage problem as a multi-player game in which a utility function is formulated to consider the tradeoff between energy consumption and coverage quality. To achieve an efficient action profile, we present a new distributed payoff-based learning algorithm where each sensor only has access to the activities it has played and the utility values it has received. The simulation results show that our proposed game-theoretic algorithm has greater energy efficiency and can maximize area coverage, as compared to previous approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  • Ahmed N, Kanhere SS, Jha S (2005) Probabilistic coverage in wireless sensor networks. In: The IEEE conference on local computer networks, 2005. 30th anniversary. IEEE, pp 8

  • Ai J, Abouzeid AA (2006) Coverage by directional sensors in randomly deployed wireless sensor networks. J Comb Optim 11(1):21–41

    Article  MathSciNet  Google Scholar 

  • AlSkaif T, Zapata MG, Bellalta B (2015) Game theory for energy efficiency in wireless sensor networks: latest trends. J Netw Comput Appl 54:33–61

    Article  Google Scholar 

  • Ariel I, Babichenko Y (2011) Average testing and the efficient boundary. Center for the study of rationality

  • Cao Q, Yan T, Stankovic J, Abdelzaher T (2005) Analysis of target detection performance for wireless sensor networks. In: International conference on distributed computing in sensor systems. Springer, pp 276–292

  • Dürr H-B, Stanković MS, Johansson KH (2011) Distributed positioning of autonomous mobile sensors with application to coverage control. In: American control conference (ACC), 2011. IEEE, pp 4822–4827

  • Foster DP, Young HP (2006) Regret testing: learning to play Nash equilibrium without knowing you have an opponent. Theor Econ 1(3):341–367

    Google Scholar 

  • Fudenberg D, Maskin E (2009) The folk theorem in repeated games with discounting or with incomplete information. In: A long-run collaboration on long-run games. World Scientific, Singapore, pp 209–230

  • Habibi J, Mahboubi H, Aghdam AG (2016) A gradient-based coverage optimization strategy for mobile sensor networks. IEEE Trans Control Netw Syst 4(3):477–488

    Article  MathSciNet  Google Scholar 

  • Harizan S, Kuila P (2019) Coverage and connectivity aware energy efficient scheduling in target based wireless sensor networks: an improved genetic algorithm based approach. Wirel Netw 25(4):1995–2011

    Article  Google Scholar 

  • Hasanbeig M, Pavel L (2017) Distributed coverage control by robot networks in unknown environments using a modified EM algorithm. World Acad Sci Eng Technol Int J Comput Electr Autom Control Inf Eng 11(7):721–729

    Google Scholar 

  • Kashi SS (2019) Area coverage of heterogeneous wireless sensor networks in support of Internet of Things demands. Computing 101(4):363–385

    Article  MathSciNet  Google Scholar 

  • Khoufi I, Minet P, Laouiti A, Mahfoudh S (2017) Survey of deployment algorithms in wireless sensor networks: coverage and connectivity issues and challenges. Int J Auton Adapt Commun Syst 10(4):341–390

    Article  Google Scholar 

  • Li N, Marden JR (2013) Designing games for distributed optimization. IEEE J Sel Top Signal Process 7(2):230–242

    Article  Google Scholar 

  • Marden JR (2007) Learning in large-scale games and cooperative control, California Univ Berkeley Dept of Mechanical Engineering

  • Marden JR, Shamma JS (2017) Game theory and control. Annu Rev Control Robot Auton Syst 1:105–134

    Article  Google Scholar 

  • Marden JR, Wierman A (2013) Distributed welfare games. Oper Res 61(1):155–168

    Article  MathSciNet  Google Scholar 

  • Marden JR, Young HP, Pao LY (2014) Achieving pareto optimality through distributed learning. SIAM J Control Optim 52(5):2753–2770

    Article  MathSciNet  Google Scholar 

  • Mostafaei H, Chowdhury MU, Obaidat MS (2018) Border surveillance with WSN systems in a distributed manner. IEEE Syst J 12(4):3703–3712

    Article  Google Scholar 

  • Movassagh M, Aghdasi HS (2017) Game theory based node scheduling as a distributed solution for coverage control in wireless sensor networks. Eng Appl Artif Intell 65:137–146

    Article  Google Scholar 

  • Pradelski BS, Young HP (2012) Learning efficient Nash equilibria in distributed systems. Games Econ Behav 75(2):882–897

    Article  MathSciNet  Google Scholar 

  • Rahili S (2016) Distributed optimization in multi-agent systems: game theory based sensor coverage and continuous-time convex optimization, UC Riverside

  • Rahili S, Lu J, Ren W, Al-Saggaf UM (2018) Distributed coverage control of mobile sensor networks in unknown environment using game theory: algorithms and experiments. IEEE Trans Mob Comput 17(6):1303–1313

    Article  Google Scholar 

  • Sangwan A, Singh RP (2015) Survey on coverage problems in wireless sensor networks. Wirel Pers Commun 80(4):1475–1500

    Article  Google Scholar 

  • Sheu J-P, Lin H-F (2007) Probabilistic coverage preserving protocol with energy efficiency in wireless sensor networks. In: Wireless communications and networking conference, 2007. WCNC 2007. IEEE, pp 2631–2636

  • Wang X, Xing G, Zhang Y, Lu C, Pless R, Gill C (2003) Integrated coverage and connectivity configuration in wireless sensor networks. In: Proceedings of the 1st international conference on embedded networked sensor systems. ACM, pp 28–39

  • Weng C-I, Chang C-Y, Hsiao C-Y, Chang C-T, Chen H (2018) On-supporting energy balanced $k$-barrier coverage in wireless sensor networks. IEEE Access 6:13261–13274

    Article  Google Scholar 

  • Young HP (1993) The evolution of conventions. Econom J Econom Soc 61:57–84

    MathSciNet  MATH  Google Scholar 

  • Young HP (2001) Individual strategy and social structure: an evolutionary theory of institutions. Princeton University Press, Princeton

    Google Scholar 

  • Young HP (2009) Learning by trial and error. Games Econ Behav 65(2):626–643

    Article  MathSciNet  Google Scholar 

  • Young HP, Pradelski BSR (2010) Learning efficient Nash equilibria in distributed systems. https://ideas.repec.org

  • Yu J, Wan S, Cheng X, Yu D (2017) Coverage contribution area based $k$-coverage for wireless sensor networks. IEEE Trans Veh Technol 66(9):8510–8523

    Article  Google Scholar 

  • Zhang H, Hou JC (2005) Maintaining sensing coverage and connectivity in large sensor networks. Ad Hoc Sensor Wirel Netw 1(1–2):89–124

    Google Scholar 

  • Zhang L, Lu Y, Chen L, Dong D (2008) Game theoretical algorithm for coverage optimization in wireless sensor networks. In: Proceedings of the world congress on engineering, vol 1, pp 2–4

  • Zhu M, Martinez S (2013) Distributed coverage games for energy-aware mobile sensor networks. SIAM J Control Optim 51(1):1–27

    Article  MathSciNet  Google Scholar 

  • Zhu M, Martínez S (2013) Distributed coverage games for energy-aware mobile sensor networks. SIAM J Control Optim 51(1):1–27

    Article  MathSciNet  Google Scholar 

  • Zou Y, Chakrabarty K (2005) A distributed coverage-and connectivity-centric technique for selecting active nodes in wireless sensor networks. IEEE Trans Comput 54(8):978–991

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Electrical and Computer Engineering, Malek-Ashtar University of Technology, Tehran, Iran

    Elham Golrasan, Hossein Shirazi & Kourosh Dadashtabar

Authors
  1. Elham Golrasan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hossein Shirazi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kourosh Dadashtabar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hossein Shirazi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Golrasan, E., Shirazi, H. & Dadashtabar, K. Probabilistic Coverage in Wireless Sensor Networks: a Game Theoretical Approach. Iran J Sci Technol Trans Electr Eng (2021). https://doi.org/10.1007/s40998-020-00393-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s40998-020-00393-7

Keywords

Search

Navigation