Grouping Nodes in Wireless Sensor Networks Using Coalitional Game Theory - Formal Techniques for Distributed Systems Access content directly
Conference Papers Year : 2010

Grouping Nodes in Wireless Sensor Networks Using Coalitional Game Theory

Abstract

Wireless sensor networks are typically ad-hoc networks of resource-constrained nodes; in particular, the nodes are limited in power resources. It can be difficult and costly to replace sensor nodes, for instance when implanted in the human body. Data transmission is the major consumer of power, so it is important to have power-efficient protocols. In order to reduce the total power consumption in the network, we consider nodes which cooperate to transmit data. Nodes which cooperate, form a group. A mobile node may at some point be without a group, in which case it is desirable for the node to be able to join a group. In this paper we propose a modification of the AODV protocol to decide whether a node should join a given group, using coalitional game theory to determine what is beneficial in terms of power consumption. The protocol is formalized in rewriting logic, implemented in the Maude tool, and validated by means of Maude's model exploration facilities.
Fichier principal
Vignette du fichier
61170093.pdf (419.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01055142 , version 1 (11-08-2014)

Licence

Attribution

Identifiers

Cite

Fatemeh Kazemeyni, Einar Broch Johnsen, Olaf Owe, Ilangko Balasingham. Grouping Nodes in Wireless Sensor Networks Using Coalitional Game Theory. Joint 12th IFIP WG 6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 30th IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2010, Amsterdam, Netherlands. pp.95-109, ⟨10.1007/978-3-642-13464-7_9⟩. ⟨hal-01055142⟩
150 View
139 Download

Altmetric

Share

Gmail Facebook X LinkedIn More