2015
DOI: 10.1007/s11036-015-0609-0
|View full text |Cite
|
Sign up to set email alerts
|

An Energy-efficiency Node Scheduling Game Based on Task Prediction in WSNs

Abstract: For wireless sensor networks, unbalanced task load will decrease the lifetime of network. In this paper, we investigate how to schedule the sensor nodes to sleep or wakeup according to the dynamically changing task load. We first demonstrate that for a sensor network with uniform node distribution and constant data reporting, balancing the task load of the whole network cannot be realized. Then we define the concept of state transition and design a state transition model for sensor nodes. By introducing Markov… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 29 publications
0
2
0
Order By: Relevance
“…The sensors are dispatched to each cluster of events to reduce and balance energy consumption during movement, and it greatly extends the lifetime. Aimed at guaranteeing the task completion instantaneously and extending the life-cycle of network, the authors in [30] presented an energy-efficiency node scheduling algorithm based on game theory for WSNs, and the payoff function includes both the residual energy and local task load of the sensor nodes. A Hungarian algorithm (HA) [31] is used to solve the NP-hard problem of deterministic coverage enhancement with small time complexity [32], that is, the shortest moving scheme between the initial position of each sensor node and the position to be deployed is determined by the maximum matching algorithm of bipartite graph [33,34].…”
Section: Related Workmentioning
confidence: 99%
“…The sensors are dispatched to each cluster of events to reduce and balance energy consumption during movement, and it greatly extends the lifetime. Aimed at guaranteeing the task completion instantaneously and extending the life-cycle of network, the authors in [30] presented an energy-efficiency node scheduling algorithm based on game theory for WSNs, and the payoff function includes both the residual energy and local task load of the sensor nodes. A Hungarian algorithm (HA) [31] is used to solve the NP-hard problem of deterministic coverage enhancement with small time complexity [32], that is, the shortest moving scheme between the initial position of each sensor node and the position to be deployed is determined by the maximum matching algorithm of bipartite graph [33,34].…”
Section: Related Workmentioning
confidence: 99%
“…Energy control is another important issue in WSN applications without a fixed supplement of electricity [ 23 , 24 , 25 ]. The majority of energy control procedures are based on task scheduling [ 26 , 27 ], topology optimization [ 28 , 29 ] and smart clustering [ 30 , 31 ] but do not focus on reducing energy consumption by unnecessary nodes. Several anchor nodes are necessary in current position estimation, whereas others can be set to sleep to save energy.…”
Section: Introductionmentioning
confidence: 99%