Shi Bai Weiyi Zhang Guoliang Xue Jian Tang and Chonggang Wang University of Minnesota ATampT Lab Arizona State University Syracuse University NEC Lab 2012 IEEE INFOCOM ID: 247211
Download Presentation The PPT/PDF document "DEAR: Delay-bounded Energy-constrained A..." 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.
Slide1
DEAR: Delay-bounded Energy-constrained Adaptive Routing in Wireless Sensor Networks
Shi Bai, Weiyi Zhang, Guoliang Xue, Jian Tang, and Chonggang WangUniversity of Minnesota, AT&T Lab, Arizona State University, Syracuse University, NEC Lab2012 IEEE INFOCOM
1Slide2
1. Introduction2. Algorithm2.1 Definition
2.2 Problem statement2.3 DEAR Algorithm3. Experiment4. Conclusion2OutlineSlide3
Wireless Sensor NetworksKey Issue: Energy Consumption
Delay-bounded Energy-constrained Adaptive Routing (DEAR) ProblemAdaptive reliabilitySplitting the traffic over multiple pathsDifferential delayIncreased memory and buffer overflowDeliverable energy constraintsEnergy consumption of transmitting packetIntroduction
3Slide4
Def 1. Packet AllocationP is a set of s-BS paths.
The aggregated packet of link e is the sum of the packet allocations on link e of the paths in P:q(e) = ƩL(p)Def 2. Differential delaydh => the highest path delaydl => the lowest path delay=> Dp= dh – d
l
Definition (1)
4Slide5
Def 3. Energy ConsumptionTransmitting energy consumption
E = w*qq => packet size transmitted on linkw => Energy consumption of transmitting 1 bitW=[C*(2^b-1)+F]*(1/b)C => the quality of transmission and noise powerF => the power consumption of electronic circuitryDef 4. Latency/DelayQueuing delayThe time waiting at output link for transmissionTransmission delayThe amount of time required to push all of the packet bits into the transmission mediaPropagation delay
The time takes for the head of the signal to travel from the sender to the receiver
Definition (2)
5Slide6
Transmission delay
Ignored transmission and queuing delayWithout considering the transmission delayAllocate of packets have no impact on delivery of packetsPath:p1=(A,B,BS), p2=(A,C,BS), p3=(A,BS)Path delay: d(p1)=2, d(p2)=3, d(p3)=2Ex a) packet split => p1=10, p3 = 2Ex b) packet split => p1= 6, p3 = 6Path delay are the sameDifferential delay
d(p1)-d(p3) = 2 – 2 = 0
Transmission delay(1)
6Slide7
Considering the transmission delay
Allocations of packets on multiple paths will have impact on path delaysPath delayd(p1) = Ʃd(e) + ƩƬ(v) Ex a) d(p1) = 2 + (10 pk/(2 pk/s) + 10/2) = 12, d(p3) = 2 + (2/4) = 2.5Ex b) d(p1) = 2 +(6/2 + 6/2) = 8, d(p3) = 2 + (6/4) = 3.5
Path delay are different
Ex a) Differential delay is 9.5=(12 - 2.5)
Ex b) Differential delay is 4.5
Transmission delay(2)
7Slide8
DEAR(Delay-bounded Energy constrained Adaptive Routing)
Seek set of paths P that can provide the followingDelay boundedEnergy constrainedAdaptive reliabilityGraph G=(V, E, b, d, w, β)V represents the set of sensor nodes and BS.E represents the set of links.b represents bandwidthd represents the delay of the path pw represents transmission energy consumptionβ represents the residual energy of sensor v
Problem Statement
8Slide9
Delay BoundedAny path p in P must satisfy the differential delay constraint:
dmin ≤ d(p) ≤ dmaxEnergy ConstrainedThe energy consumption of transmitting packet for each sensor i cannot exceed its residual energy level β(i)Adaptive reliabilityThe size of aggregated packet of all paths in P is no less than Q : q(P) ≥ QRoute the data such that any single link failure does no affect more than x% of the total packets
DEAR problem(1)
9Slide10
Feasible and infeasible solution by Adaptive reliability and delay constraint
Ex c) 2,2,8 In case 8 packet drop => 67%Ex d) 6,4,2In case delay is 8 over between 4 and 5 Ex e) 2,10In case 10 packet drop => over 70%DEAR problem(2)
10Slide11
IDEAR
Algorithm 111Slide12
Linear Program solution
12Restricted Maximum Flow schemeSlide13
ODEAR problemOptimization problemSPDEAR problem
(1+α) approximation algorithmAlgorithm 113Slide14
14
Graph Transformation(1)
Each u[t] means that node u can transmit packet at time t.
This bandwidth ensures that the packets sent by u at time
i
can not exceed b(e).
This ensures that only the packet, which arrive at BS no earlier than
d
min
and no later than
d
max
.Slide15
Requirement Condition
Packet Demand: 12 PacketReliability requirement x% = 70%Delay requirement: dmin = 2 and dmax = 5Maximum flow by IDEARP1=(A[0],B[2],BS[4],BS[5])P2=(A[0],C[3],BS[5])
P3=(A[0],BS[3],BS[4],BS[5])
P4=(A[0],A[1],BS[4],BS[5])
15
Graph Transformation(2)Slide16
Fully Polynomial Time Approximation Scheme for SPDEARScaling and rounding technique
dΘ= ⌊d(e)*Θ⌋ + 1 Algorithm 2
16Slide17
Approximation algorithm for ODEARd
min ≥ 0Algorithm 317Slide18
Efficient Heuristic for DEARRound the propagation delay of each link
dmin and dmax Algorithm 4
18Slide19
Network topologies in an 100 * 100 sqThe power of Sensor node was randomly distributed in [16, 20]
Bandwidth, propagation delay and transmission energy consumption of each communication link was randomly distributed in [6,10], [1,5], [1,3]19Result (1)Slide20
Performance of different number of nodes
Results (2)20Slide21
Performance of different reliability requirements
Results (3)21Slide22
Performance of different packet sizes
Results (4)22Slide23
Transmission delay in multipath routingThe previous work ignored
Delay-bounded Energy-constrained Adaptive Routing (DEAR)Adaptive multipath routingEnergy constraintDifferential delayConclusion23Slide24
Thank you.
24Q&A