Game theory based construction efficient topology in wireless sensor networks
type: Item
instance of: scholarly article
title: Game theory based construction efficient topology in wireless sensor networks
zbMATH Open document ID: 1395.94429
DOI: 10.1155/2015/754940
author: M. J. Abbasi
author: Muhammad Shafie Bin Abd Latiff
author: Hassan Chizari
author: N. Fisal
published in: Mathematical Problems in Engineering
publication date: 2018-08-27T00:00:00Z
review text: Summary: Topology control is one of the most important techniques used in wireless sensor networks; to some extent it can reduce energy consumption in which each node is capable of minimizing its transmission power level while preserving network connectivity. Reducing energy consumption has been addressed through different aspects till now. In this paper, we present a minimum spanning tree- (MST-) based algorithm, called noncooperative minimum spanning tree (NMST), for topology control in wireless multihop networks. In this algorithm, each node constructs its minimum power-cost spanning tree which is a tree and can connect the node with one hop away from its neighbor node in constructed topology. In addition we address the power-cost allocation problem when node acts selfishly. A class of strategies is proposed which construct minimum power-cost spanning tree such that the sum of the power-cost (as proxy of weight), at the same time, is a strong Nash equilibrium for a noncooperative game associated with the problem of efficient topology construction. Simulation results show that NMST can maximize the sensor network lifetimes.
Mathematics Subject Classification ID: 94C99
zbMATH DE Number: 6927164
Wikidata QID: Q59119816
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2015/754940
OpenAlex ID: W1544368773
description: scientific article; zbMATH DE number 6927164