Game Theory Based Construction Efficient Topology in Wireless Sensor Networks
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 th...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2015-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2015/754940 |
id |
doaj-4838cb5adec348739496b020da3109ee |
---|---|
record_format |
Article |
spelling |
doaj-4838cb5adec348739496b020da3109ee2020-11-24T21:48:20ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472015-01-01201510.1155/2015/754940754940Game Theory Based Construction Efficient Topology in Wireless Sensor NetworksM. J. Abbasi0Muhammad Shafie Bin Abd Latiff1Hassan Chizari2N. Fisal3Faculty of Electrical Engineering, UTM-MIMOS COE Telecommunication Technology, Universiti Teknologi Malaysia, 81310 Johor, MalaysiaDepartment of Computer Science, Universiti Teknologi Malaysia (UTM), 81310 Johor, MalaysiaDepartment of Computer Science, Universiti Teknologi Malaysia (UTM), 81310 Johor, MalaysiaFaculty of Electrical Engineering, UTM-MIMOS COE Telecommunication Technology, Universiti Teknologi Malaysia, 81310 Johor, MalaysiaTopology 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.http://dx.doi.org/10.1155/2015/754940 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
M. J. Abbasi Muhammad Shafie Bin Abd Latiff Hassan Chizari N. Fisal |
spellingShingle |
M. J. Abbasi Muhammad Shafie Bin Abd Latiff Hassan Chizari N. Fisal Game Theory Based Construction Efficient Topology in Wireless Sensor Networks Mathematical Problems in Engineering |
author_facet |
M. J. Abbasi Muhammad Shafie Bin Abd Latiff Hassan Chizari N. Fisal |
author_sort |
M. J. Abbasi |
title |
Game Theory Based Construction Efficient Topology in Wireless Sensor Networks |
title_short |
Game Theory Based Construction Efficient Topology in Wireless Sensor Networks |
title_full |
Game Theory Based Construction Efficient Topology in Wireless Sensor Networks |
title_fullStr |
Game Theory Based Construction Efficient Topology in Wireless Sensor Networks |
title_full_unstemmed |
Game Theory Based Construction Efficient Topology in Wireless Sensor Networks |
title_sort |
game theory based construction efficient topology in wireless sensor networks |
publisher |
Hindawi Limited |
series |
Mathematical Problems in Engineering |
issn |
1024-123X 1563-5147 |
publishDate |
2015-01-01 |
description |
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. |
url |
http://dx.doi.org/10.1155/2015/754940 |
work_keys_str_mv |
AT mjabbasi gametheorybasedconstructionefficienttopologyinwirelesssensornetworks AT muhammadshafiebinabdlatiff gametheorybasedconstructionefficienttopologyinwirelesssensornetworks AT hassanchizari gametheorybasedconstructionefficienttopologyinwirelesssensornetworks AT nfisal gametheorybasedconstructionefficienttopologyinwirelesssensornetworks |
_version_ |
1725892789588197376 |