Non-Cooperative Game Based Social Welfare Maximizing Bandwidth Allocation in WSNs

In this paper, we deal with possible data transmission congestion on the sink node in wireless sensor networks (WSNs). We consider a scenario in which all the sensor nodes have a certain amount of storage space and acquire data from the surroundings at heterogeneous speed. Because receiving bandwidt...

Full description

Saved in:
Bibliographic Details
Main Authors: Mo Dong, Haiming Jin, Gaofei Sun, Xinbing Wang, Wei Liu, Xudong Wang
Format: Conference Proceeding
Language:English
Subjects:
Bandwidth
Channel allocation
Containers
Games
Peer to peer computing
Silicon
Wireless sensor networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we deal with possible data transmission congestion on the sink node in wireless sensor networks (WSNs). We consider a scenario in which all the sensor nodes have a certain amount of storage space and acquire data from the surroundings at heterogeneous speed. Because receiving bandwidth of the sink node is limited, a proper bandwidth allocation mechanism should be implemented to avoid possible congestion or data loss due to the overflow of some sensor nodes. To address this problem, we firstly design a novel bandwidth allocation mechanism, SWM, that can maximize the social utility, an indicator of every sensor node's satisfaction degree and the social fairness. Furthermore, we model the allocation process under the SWM as a noncooperative game and figure out the unique Nash Equilibrium. The uniqueness of the equilibrium demonstrates that this network will actually approach to a fair and stable state.
ISSN:1930-529X
2576-764X
DOI:10.1109/GLOCOM.2011.6134186