thetracintheperiodsbetweensuccessivetopologychanges. Thispaperisorganizedasfollows:Insection2,theproblemisformulated.Insection 3,weproposeaowredirectionalgorithm.Insection4,weproposethemaximum residualenergypathroutingalgorithm.Insection5,randomgraphsaregeneratedin ordertoevaluatetheperformancesofthesethreealgorithms.
2Flows,OptimalEnergyConsumptionandTrans- missionPowerLevels
Consideradirectedgraph
G
(
N;A
)where
N
isthesetofallnodesand
A
isthesetof alldirectedlinks(
i;j
)where
i;j
2
N
.Let
S
i
bethesetofnodesthatcanbereachedby node
i
withacertainpowerlevelinitsdynamicrange.Weassumethatlink(
i;j
)exists if
j
2
S
i
.Leteachnode
i
havetheinitialbatteryenergy
E
i
,andlet
Q
i
betherateat whichinformationisgeneratedatnode
i
.Thetransmissionenergyrequiredfornode
i
totransmitabittoitsneighboringnode
j
is
e
ij
,andtherateatwhichinformationis transmittedfromnode
i
tonode
j
iscalledtheow
q
ij
.Wehaveasetoforiginnodes
O
wheretheinformationisgenerated,andasetofdestinationnodes
D
amongwhichany nodecanbereachedinorderfortheinformationtransferbeconsidereddone. Theconservationofowconditionateachnode
i
isassumed,i.e.,thesumofall incomingowmustbethesameasthesumofalloutgoingow,
X
j
:
i
2
S
j
q
ji
+
Q
i
=
X
k
2
S
i
q
ik
;
8
i
2
N
?
D:
(1) Subjecttothisconstraint,wewouldliketomaximizethelifetimeofthenetwork.The timeittakesforthebatteryofnode
i
todrainoutunderow
q
=
f
q
ij
g
isgivenby
T
i
(
q
)=
E
i
P
j
2
S
i
e
ij
q
ij
:
(2)
Systemlifetime
:Thelifetimeofthesystemunderow
q
isdenedastheminimum batterylifetimeoverallnodes,
T
sys
(
q
)=min
i
2
N
T
i
(
q
)
:
(3) Usingthedenitionofthesystemlifetime,wecanexpresstheproblemasfollows: max
q
T
sys
(
q
)
;
orequivalently,max
q
min
i
2
N
E
i
P
j
2
S
i
e
ij
q
ij
;
(4) subjectto(1),theowconservation. Onecanobservethattheproblemofmaximizingthesystemlifetimegiventheinfor- mationgenerationratesisequivalenttoalinearprogrammingproblem11]givenby Maximize
T
(5) s.t.^
q
ij
0
;
8
j
2
S
i
;
8
i
2
N
?
D;
(6)
P
j
2
S
i
e
ij
^
q
ij
E
i
;
8
i
2
N
?
D;
(7)
P
j
:
i
2
S
j
^
q
ji
+
TQ
i
=
P
k
2
S
i
^
q
ik
;
8
i
2
N
?
D;
(8) where^
q
ij
=
Tq
ij
istheamountofinformationtransferedduring
T
fromnode
i
to
j
.
Leave a Comment