140 likes | 336 Views
Relay Sensor Placement in Wireless Sensor Networks. Xiuzhen Cheng, Dign-Zhu Du, Lusheng Wang, and Baogang Xu (ACM WINET 2004) Presented by Taehee Kim. Table of Contents. Related Work Problem Definition Relay sensor placement problem SMT-MSP
E N D
RelaySensorPlacementinWirelessSensorNetworks XiuzhenCheng,Dign-ZhuDu,LushengWang,andBaogangXu (ACMWINET2004) PresentedbyTaeheeKim
TableofContents • RelatedWork • ProblemDefinition • Relaysensorplacementproblem • SMT-MSP • SteinertreeproblemwithminimumnumberofSteinerpointsandboundededge-length • Twoapproximatealgorithms • Ratio3algorithmforSTP-MSP • 2.5-approximatealgorithmofSTP-MSP • Conclusion
RelatedWork • WirelessSensorNetworks • isAdhocmultihopsystems • Haskeyissues:Connectivity,performance,lifetime,andcost • RelatedWork • Focusontopologycontrolbyminimizingthemaximumtransmitpower[8,14]orminimizingtotaltransmitpower[3,18]tomaintainglobaltopology.
ProblemDefinition • Relaysensorplacementproblem: Givenasetofdutysensors(requiredsensors)intheplane, placeminimumnumberofrelaysensorstomaintainglobalconnectivity suchthatthetransmissionrangeofeachsensorisatmostR,whereRisaconstant.
ProblemDefinition • Relaysensorplacementproblem • ismodeledbySteinerMinimumTreewithMinimumnumberofSteinerPointsandboundededgelength(SMT-MSP) • Theyproposetwoapproximatealgorithms, • aratio3and2.5-approximatealgorithmofSMT-MSP • BecauseSMT-MSPisaNP-hard • Assumption: • Sensorsarefixedandtheirplacementsarepre-determinedina2-dimensionalplane
SMT-MSP • SMT-MSP • Findatreeinterconnectingagivensetofnterminalpoints andaminimumnumberofSteinerpoints suchthattheEuclideanlengthofeachedgeisnomorethanagivenpositiveconstant
SMT-MSP • SMT-MSPheuristic • Step1.ComputeaminimumspanningtreeT Step2.DivideeachedgeinTintosmallpiecesoflengthatmostRusingtheminimumnumberofSteinerpoints Step3.OutputthefinaltreeasTA • Worst-caseperformanceratioof4[2]
Ratio3algorithmforSTP-MSP • 3-approximateAlgorithmforSTP-MSP • hasPerformanceratioatmost3 • hasO(n3)runningtime • Input:AsetPofnterminals,apositiveconstantR • Output:ASteinertreeTAinwhicheachedgehaslengthatmostR
Ratio3algorithmforSTP-MSP • Ratio3algorithm
2.5-approximatealgorithmforSTP-MSP • 2.5-approximateAlgorithm • isarandomizedalgorithmwithPerformanceratioatmost2.5 • ASteinertreefornterminalsisak-restrictedSteinertreeifeachfullcomponentspansatmostkterminals • H3(V,F,W):aweighted3-hypergraph,where • V=P • F={(a,b)|a∈Vandb∈V} ∪{(a,b,c)|a∈V,b∈Vandc∈V} • w(e)=thesmallestnumberofSteinerpointstoformanoptimalsolutionoftheSTP-MSPproblemontheterminalsine
Conclusion • ComputerelaysensorstomaintainglobalconnectivityinWSNswhentransmissionrangeofallsensorsarerestricted • Futurework • istheoptimalrelaysensorplacementfork-connectivity,wherek>1,toimprovefaulttoleranceinsensornetworks • isarelaysensorplacementwiththedesigntradeoffbetweentransmitpowerpersensorandthenumberofsensorsinthenetworkfortopologycontrol