|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
l |
Achieves
fair energy conservation by:
|
|
|
|
o |
Putting
nodes to sleep for equal time periods
|
|
|
|
o |
Providing
the routing algorithm with energy threshold info
|
|
to
help it make fair energy conscious decisions
|
|
|
l |
Fully
distributed algorithm – functionality does not
|
|
|
depend
on a node or a set of nodes
|
|
|
l |
Modular
nature – easily integrated with existing
|
|
|
routing
algorithms
|
|
|
l |
Ability
to determine with certainty neighbors’ sleep
|
|
|
state
|
|
|
l |
Configurable
in such a way that introduces no
|
|
|
additional
traffic to the network
|
|