Ad hoc networks are subject to multiple challenges, particularly the problem of limited resources such as energy and vulnerability in terms of security. Indeed, the nodes are subject to various attacks and malicious actions. Thus, each mobile is confronted with a dilemma: cooperate to ensure security, in this case the node spend a part of its energy, or not cooperate which allows it to save energy but making the security of the network more vulnerable. In this work, we develop an approach which takes into account two conflicting objectives: contribute to network security while reducing energy consumption. The approach is based on alternating two steps: Clustering-Evolutionary game. The clustering step is performed by an algorithm that takes into account the energy constraint in election of cluster-heads. The interactions between each pair of cluster-heads, when exchanging data, in their contribution to the security of the network, are modeled as an evolutionary game which is the second step of the proposed approach.
Accepté le :
DOI : 10.1051/ro/2015047
Mots-clés : Ad hoc networks, security, clustering, evolutionary games, replicator dynamic, convergence, simulation
@article{RO_2016__50_2_285_0,
author = {Adel-Aissanou, Karima and Berri, Sara and Bouhaddi, Myria and Radjef, Mohammed Said},
title = {Security modeling of an ad hoc network under the constraint of energy by an approach in two steps: {Clustering-Evolutionary} game},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {285--296},
publisher = {EDP-Sciences},
volume = {50},
number = {2},
year = {2016},
doi = {10.1051/ro/2015047},
mrnumber = {3479869},
zbl = {1338.90092},
language = {en},
url = {http://archive.numdam.org/articles/10.1051/ro/2015047/}
}
TY - JOUR AU - Adel-Aissanou, Karima AU - Berri, Sara AU - Bouhaddi, Myria AU - Radjef, Mohammed Said TI - Security modeling of an ad hoc network under the constraint of energy by an approach in two steps: Clustering-Evolutionary game JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2016 SP - 285 EP - 296 VL - 50 IS - 2 PB - EDP-Sciences UR - http://archive.numdam.org/articles/10.1051/ro/2015047/ DO - 10.1051/ro/2015047 LA - en ID - RO_2016__50_2_285_0 ER -
%0 Journal Article %A Adel-Aissanou, Karima %A Berri, Sara %A Bouhaddi, Myria %A Radjef, Mohammed Said %T Security modeling of an ad hoc network under the constraint of energy by an approach in two steps: Clustering-Evolutionary game %J RAIRO - Operations Research - Recherche Opérationnelle %D 2016 %P 285-296 %V 50 %N 2 %I EDP-Sciences %U http://archive.numdam.org/articles/10.1051/ro/2015047/ %R 10.1051/ro/2015047 %G en %F RO_2016__50_2_285_0
Adel-Aissanou, Karima; Berri, Sara; Bouhaddi, Myria; Radjef, Mohammed Said. Security modeling of an ad hoc network under the constraint of energy by an approach in two steps: Clustering-Evolutionary game. RAIRO - Operations Research - Recherche Opérationnelle, Special issue: Research on Optimization and Graph Theory dedicated to COSI 2013 / Special issue: Recent Advances in Operations Research in Computational Biology, Bioinformatics and Medicine, Tome 50 (2016) no. 2, pp. 285-296. doi : 10.1051/ro/2015047. http://archive.numdam.org/articles/10.1051/ro/2015047/
, , and , A stochastic model to study the impact of the transmission frequency of hello messages on the connectivity of Ad hoc Networks. Telecommun. Syst. 57 (2014) 197–207. | DOI
and , Survey of Clustering Algorithms for MANET. Int. J. Comput. Sci. Eng. 2 (2009) 98–104.
and , Game Theory Approaches for Improving Intrusion Detection in MANETs. Sci. Res. Essays 31 (2011) 6535–6539.
T. Alpcan, T. Başar and K.C. Nguyen, Stochastic Games for Security in Networks with Interdependent Nodes. Proc. of Int. Conf. Game Theory Networks, GameNets (2009).
D.J. Baker, A. Ephremides and J.E. Wieselthier, A Design Concept for Reliable Mobile Radio Networks with Frequency Hopping Signaling, In Proc. of the IEEE 75 (1987) 56–73.
, On the connectivity of Ad Hoc Networks. Comput. J. 47 (2004) 442–447. | DOI
, , , and , Mechanism design-based secure leader election model for intrusion detection in MANET. IEEE Trans. Dependable Secure Comput. 8 (2011) 89–103. | DOI
, and , WCA: A weighted clustering algorithm for mobile Ad Hoc Networks. Clust. Comput. 5 (2002) 193–204. | DOI
and , A game theoretical framework on intrusion detection in heterogeneous networks. Trans. Inf. Fotrnsics Security 4 (2009) 155–178.
C. Comaniciu, Y. Liu and H. Man, A Bayesian Game Approach for Intrusion Detection in Wireless Ad Hoc Networks. Proc. of GameNets (Workshop on Game Theory for Networks), Pise, Italie (2006) 1–12.
and , HEED: A hybrid energy-efficient distributed clustering approach for Ad Hoc sensor networks. IEEE Trans. Mobile Comput. 3 (2004) 366–371. | DOI
and , Multicluster mobile, multimedia radio network. ACM/Baltzer J. Wireless Networks 1 (1995) 225–265. | DOI
and , A Novel Energy threshold based Location Aided Routing in MANET, Int. J. Comput. Sci. Inform. Technol. 4 (2013) 392–397.
and , Evolutionary stable strategies and game dynamics. Math. Biosci. 40 (1978) 145–156. | DOI | MR | Zbl
and , Cluster based leader election and intrusion detection system for MANET. Int. J. Comput. Sci. Manag. Res. 2 (2013) 1459–1462.
C.A. Kamhoua, K. makki and n. pissinou, game theoretic modeling and evolution of trust in autonomous multi-hop networks application to network security and privacy. IEEE Commun. Soc. (2011) 1–6.
and , The logic of animal conflict. Nature 246 (5427) 15–18 (1973). | DOI | Zbl
R. Myerson, Game Theory: Analysis of Conflict. Harvard University Press (1997). | MR | Zbl
E.A. Panaousis and C. Politis, Non-Cooperative Games Between Legitimate Nodes and Malicious Coalitions in MANET’s. Proc. of the Future Network and Mobile Summit 2011 conference (2011).
, , and , Strategies for designing energy efficient clusters-based WSN topologies. J. Heuristics 18 (2012) 655-675. | DOI
and , Using Bayesian Game model for intrusion detection in wireless Ad Hoc Networks. Int. J. Commun., Network Syst. Sci. 3 (2010) 602–607.
and , Game strategies in network security. Int. J. Inform. Security 4 (2005) 71–86. | DOI
Cité par Sources :
