1 / 10

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

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. propose. Prolong Sensor Network Lifetime Find max network lifetime

kobe
Download Presentation

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

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. J-RoC: a Joint Routing and Charging Scheme to Prolong Sensor Network Lifetime Zi Li, Yang Peng, Wensheng Zhang, and DajiQiao Iowa State University, Ames, IA, USAIEEE 2011

  2. propose • Prolong Sensor Network Lifetime • Find max network lifetime • Consider two part: Data routing, charging path

  3. Routing Cost • Nodes periodically broadcast beacons The beacons are broadcasted periodically, nodes can dynamically change their parents. • Receiving the costs from neighbor nodes, sensor nodeicalculates it‘senergy-minimum routing cost c’i node i routing cost ETXi,j ,t number of transmissions needed to send a packet successfully over link (i, j).

  4. Charge aware routing cost • Esis the battery capacity • ei,j,t = Charge energy estimates the nodal energy consumption rate

  5. 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.

  6. Future nodal energy consumption rate C i,t= erx andetxexpected energy consumed to transmit and receive a packet Si,tthe 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

  7. Charging sequence • Merge • VRPTN

  8. prototype system

  9. Optimal solution • 0 • the MC’s movement delay is ignored and the link qualities are perfect Life time Flow constraint Total charge time

  10. Conclution

More Related