Search citation statements

Paper Sections

Select...

2

1

Citation Types

0

3

0

Year Published

2011

2017

Publication Types

Select...

2

Relationship

0

2

Authors

Journals

(3 citation statements)

0

3

0

“…Thus, our approximation discussed in Lemma 1 is satisfied. Four routing algorithms (which use the Euclidean distance between two nodes as one of the parameter for controlling the data transfer) were simulated in this environment, which include PEGASIS (Lindsey and Raghavendra, 2002) [6], SHORT [5], LBEERA [11] and HDS [12] using the algorithm stated in section 3.3. The Poisson distribution function is used to determine which nodes will act as relay node.…”

confidence: 99%

“…Thus, our approximation discussed in Lemma 1 is satisfied. Four routing algorithms (which use the Euclidean distance between two nodes as one of the parameter for controlling the data transfer) were simulated in this environment, which include PEGASIS (Lindsey and Raghavendra, 2002) [6], SHORT [5], LBEERA [11] and HDS [12] using the algorithm stated in section 3.3. The Poisson distribution function is used to determine which nodes will act as relay node.…”

confidence: 99%

“…Also, LBEERA [11] selects leader for each lower chain according to the remaining energy of nodes and chooses super leader among all leaders for higher chain according to the residual energy of leader and the distance between leader and the BS. In order to reduce the overhead of re-elected leader and super leader, we prefer to select leader and super leader every several rounds rather than each round [12].…”

confidence: 99%

“…for various values of node density [7] (defined as the number of nodes per unit area of the sensing field) range from 0.01 to 0.1. The criteria for the first node death (FND) and last node death (LND) [8] of the sensor network are plotted. Figure 4 is the plot of the same but for the criterion of last node dies.…”

confidence: 99%