TY  - JOUR
T1  - Secure Cluster-Based Routing Scheme for Wireless Sensor Networks Using Bargaining Game Model
AU - Velayutham, R. 
JO  - Asian Journal of Information Technology
VL  - 15
IS  - 4
SP  - 825
EP  - 832
PY  - 2016
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2016.825.832
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2016.825.832
KW  - Bargaining game
KW  -clustering
KW  -malicious nodes security
KW  -wireless sensor networks
KW  -malicious nodes
AB  - Game theory is a mathematical framework that describes the occurrence of conflict and cooperation between decision makers. Recently, game theory provides an insight into approaches for optimization to enhancing security for Wireless Sensor Networks (WSNs). Reaching an agreement becomes an optimization problem in clustering process. Players in a bargaining problem bargain for the objective as a whole at a particular instant. The problem divided into parts of the whole objective become subject to bargaining during different stages. Each player prefers to reach an agreement in these games. A player with an agreement alone allowed to clustering process. Otherwise, a player who not reaches an agreement is considered as malicious. This scheme is not allowed the malicious nodes to participate in clustering process. Bargaining solution is involved while each player agreement favour their interest. In bargaining game theory, individual player make their decisions is sufficient for predicting an agreement results in providing efficient clustering process in WSNs. An agreement has been represented by utility function.
ER  -