/
J- RoC : a Joint Routing and Charging Scheme to Prolong Sensor Network J- RoC : a Joint Routing and Charging Scheme to Prolong Sensor Network

J- RoC : a Joint Routing and Charging Scheme to Prolong Sensor Network - PowerPoint Presentation

mediumgeneral
mediumgeneral . @mediumgeneral
Follow
343 views
Uploaded On 2020-08-28

J- RoC : a Joint Routing and Charging Scheme to Prolong Sensor Network - PPT Presentation

Lifetime Zi Li Yang Peng Wensheng Zhang and Daji Qiao Iowa State University Ames IA USA IEEE 2011 propose Prolong Sensor Network Lifetime Find max network lifetime Consider two part Data routing charging path ID: 806362

sensor energy charging routing energy sensor routing charging node time nodes rate charge network lifetime cost beacons future minimum

Share:

Link:

Embed:

Download Presentation from below link

Download The PPT/PDF document "J- RoC : a Joint Routing and Charging Sc..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.


Presentation Transcript

Slide1

J-RoC: a Joint Routing and Charging Scheme to Prolong Sensor Network Lifetime

Zi

Li, Yang

Peng

,

Wensheng

Zhang, and

Daji

Qiao

Iowa State University, Ames, IA,

USA

IEEE

2011

Slide2

proposeProlong Sensor Network Lifetime Find max network lifetime

Consider two part: Data routing, charging path

Slide3

Routing CostNodes periodically broadcast beacons

The

beacons are broadcasted periodically, nodes can dynamically change their

parents.

Receiving the costs from neighbor nodes, sensor

node i calculates it‘s energy-minimum routing cost c’i node i routing cost ETX i,j ,t number of transmissions needed to send a packet successfully over link (i, j).

Slide4

Charge aware routing cost

E

s

is

the battery capacityei,j,t =estimates the nodal energy consumption rate

Charge energy

Slide5

Charging Scheduling First, selects a set of sensor nodes that should be charged in the next

Tc

interval. Secondly, it determines a sequence in which the sensor nodes are charged so that the movement time is minimized.

Maximize

ρ

i be the percentage of charging energy that should be allocated to sensor node i in one Tc interval.

Slide6

Future nodal energy consumption

rate C

i,t

=

erx and etx expected energy consumed to transmit and receive a packetSi,t the set of energy-minimum paths from sensor node i to the sinkrj,t future sensory data packet generation rate of node i estimated at time t

Slide7

Charging sequence

Merge

VRPTN

Slide8

prototype system

Slide9

Optimal solution0

the

MC’s

movement delay

is ignored and the link qualities are perfect

Flow constraintTotal charge time

Life time

Slide10

Conclution