2012
DOI: 10.1007/978-3-642-30729-4_11
|View full text |Cite
|
Sign up to set email alerts
|

MULE-Based Wireless Sensor Networks: Probabilistic Modeling and Quantitative Analysis

Abstract: Abstract. Wireless sensor networks (WSNs) consist of resource-constrained nodes; especially with respect to power. In most cases, the replacement of a dead node is difficult and costly. It is therefore crucial to minimize the total energy consumption of the network. Since the major consumer of power in WSNs is the data transmission process, we consider nodes which cooperate for data transmission in terms of groups. A group has a leader which collects data from the members and communicates with the outside of t… 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

2013
2013
2023
2023

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 28 publications
(42 reference statements)
0
2
0
Order By: Relevance
“…, M is the number of buffer data in a sensor node; initially start is 0 and size is M. (3) output: the compression representation of non-base attribute Y, in the receiving end which can be used to reconstruct the raw sampling data satisfied the predefined regression error bound (4) begin (5) double a, b, old a, old b; (6) int counterror; (7) loop: (8) int startpos= start; (9) int count= 8; (10) while (startpos+ count <= start+ size) do{ (11) IncRegress (startpos, count, eps, &a, &b, &counterror); (12) if (counterror> 0) then{ (13) if (count==8) then{ (14) Directly transmit the eight raw data Y[startpos ⋅ ⋅ ⋅ startpos+7] to the receiving sensor node; (15) startpos += 8; } (16) else{ (17) Transmit the 4-tuples (old a, old b, startpos, count/2) for regression representation of count/2 data; (18) //the approximation of Y[startpos.. startpos+count/2-1] can be reconstructed by the 4-tuples in the receiving end (19) startpos += count/2;…”
Section: The Proposed Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…, M is the number of buffer data in a sensor node; initially start is 0 and size is M. (3) output: the compression representation of non-base attribute Y, in the receiving end which can be used to reconstruct the raw sampling data satisfied the predefined regression error bound (4) begin (5) double a, b, old a, old b; (6) int counterror; (7) loop: (8) int startpos= start; (9) int count= 8; (10) while (startpos+ count <= start+ size) do{ (11) IncRegress (startpos, count, eps, &a, &b, &counterror); (12) if (counterror> 0) then{ (13) if (count==8) then{ (14) Directly transmit the eight raw data Y[startpos ⋅ ⋅ ⋅ startpos+7] to the receiving sensor node; (15) startpos += 8; } (16) else{ (17) Transmit the 4-tuples (old a, old b, startpos, count/2) for regression representation of count/2 data; (18) //the approximation of Y[startpos.. startpos+count/2-1] can be reconstructed by the 4-tuples in the receiving end (19) startpos += count/2;…”
Section: The Proposed Algorithmmentioning
confidence: 99%
“…Thereby, the amount of transmitted data is greatly reduced, resulting in network energy being saved, and thus the network lifetime is being prolonged. In terms of the way they are applied, there are four major categories for data approximation: probabilistic model [13,14], time series analysis model [15][16][17], data mining model [18], and data compression model [19][20][21][22][23][24].…”
Section: Introductionmentioning
confidence: 99%