2011
DOI: 10.4236/wsn.2011.31003
|View full text |Cite
|
Sign up to set email alerts
|

Modeling of Node Energy Consumption for Wireless Sensor Networks

Abstract: Energy consumption is the core issue in wireless sensor networks (WSN). To generate a node energy model that can accurately reveal the energy consumption of sensor nodes is an extremely important part of protocol development, system design and performance evaluation in WSNs. In this paper, by studying component energy consumption in different node states and within state transitions, the authors present the energy models of the node core components, including processors, RF modules and sensors. Furthermore, th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
105
0
3

Year Published

2012
2012
2023
2023

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 178 publications
(109 citation statements)
references
References 5 publications
1
105
0
3
Order By: Relevance
“…Similar studies in this area have been reported in [45], [46] and [62]. In this work mean energies consumed to transmit and receive data packets from a single state is considered.…”
Section: Energy Computationmentioning
confidence: 58%
“…Similar studies in this area have been reported in [45], [46] and [62]. In this work mean energies consumed to transmit and receive data packets from a single state is considered.…”
Section: Energy Computationmentioning
confidence: 58%
“…The used simulation are listed in Table I according to the radio basic energy dissipation model [4][5][6]. Last node die 1605 2500…”
Section: Simulation Resultsmentioning
confidence: 99%
“…Many routing protocols have been proposed to improve the performance of the network, in particular the lifetime and energy consumption [2][3][4][5][6][7][8][9][10][11].…”
Section: Introductionmentioning
confidence: 99%
“…In this method, firstly, some points are randomly attributed as clusters' centers, in terms of the required clusters [14]. Then each datum, based on similarity, is attributed to one of clusters.…”
Section: K-means Algorithmmentioning
confidence: 99%