2005
DOI: 10.1360/crad20051121
|View full text |Cite
|
Sign up to set email alerts
|

A Resource Optimizing Scheduling Algorithm of Differentiated Service of Double Minimum Balance in Web Clusters

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2012
2012
2012
2012

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
0
0
Order By: Relevance
“…So far, a lot of energy-saving routing protocol has been successively put forward [1][2][3][4][5][6][7], Heinzelman [6] and others propose a called LEACH clumps and protocol, the basic idea is through random cycle options cluster head, will the whole network of energy load average assigned to each node, which can reduce the network energy consumption, prolong the network life cycle. HEED protocol [8] , put forward the basic thought of choice is based mainly on cluster head Lord and times two parameters, will node as conditions residual energy, as the main parameters selection cluster head, times relies on cluster communications within the parameters of the price.…”
Section: Introductionmentioning
confidence: 99%
“…So far, a lot of energy-saving routing protocol has been successively put forward [1][2][3][4][5][6][7], Heinzelman [6] and others propose a called LEACH clumps and protocol, the basic idea is through random cycle options cluster head, will the whole network of energy load average assigned to each node, which can reduce the network energy consumption, prolong the network life cycle. HEED protocol [8] , put forward the basic thought of choice is based mainly on cluster head Lord and times two parameters, will node as conditions residual energy, as the main parameters selection cluster head, times relies on cluster communications within the parameters of the price.…”
Section: Introductionmentioning
confidence: 99%