Nodes in Wireless Sensor Networks (WSNs) are becoming more and more complex systems with the capabilities to run distributed structured applications. Which single task should be implemented by each WSN node needs to be decided by the application deployment strategy by taking into account both network lifetime and execution time requirements. In this paper, we propose an adaptive decentralised algorithm based on noncooperative game theory, where neighbouring nodes negotiate among each other to maximize their utility function. We then prove that an increment of the nodes utility corresponds to the same increment of the utility for the whole network. Simulation results show significant performance improvement with respect to existing algorithms.
Cooperative task assignment for distributed deployment of applications in WSNs
PILLONI, VIRGINIA;ATZORI, LUIGI;
2013-01-01
Abstract
Nodes in Wireless Sensor Networks (WSNs) are becoming more and more complex systems with the capabilities to run distributed structured applications. Which single task should be implemented by each WSN node needs to be decided by the application deployment strategy by taking into account both network lifetime and execution time requirements. In this paper, we propose an adaptive decentralised algorithm based on noncooperative game theory, where neighbouring nodes negotiate among each other to maximize their utility function. We then prove that an increment of the nodes utility corresponds to the same increment of the utility for the whole network. Simulation results show significant performance improvement with respect to existing algorithms.File | Dimensione | Formato | |
---|---|---|---|
Cooperative Task Assignment for Distributed Deployment of Applications in WSNs.pdf
accesso aperto
Tipologia:
versione post-print (AAM)
Dimensione
274.83 kB
Formato
Adobe PDF
|
274.83 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.