Global Connectivity from Local GeometricConstraints for Sensor Networks withVarious Wireless FootprintsAuthors:RaissaD'Souza,DavidGalvin,CristopherMoor,DanaRandallVenue:IPSN'2006Presentator:YunhuaiLIU
Global Connectivity from Local Geometric Constraints for Sensor Networks with Various Wireless Footprints Authors: Raissa D’Souza, David Galvin, Cristopher Moor, Dana Randall Venue: IPSN’2006 Presentator: Yunhuai LIU
OutlineIntroductionKnowledge before this paperGlobal connectivity of GeSparseness of GeWhen will greedy routing works
Outline ⚫ Introduction ⚫ Knowledge before this paper ⚫ Global connectivity of Gθ ⚫ Sparseness of Gθ ⚫ When will greedy routing works
Adaptive Power Topology ControlSave energy by reduced transmission powerConnectivity must be preserved
Adaptive Power Topology Control ⚫ Save energy by reduced transmission power ⚫ Connectivity must be preserved
Localized Algorithms of θ-graph (Ge)Use local information to guarantee global connectivityAssume location information or direction informationO-graph, or GeNeighbor nodes divide the circle of a node to many sectors withthe largest angle < e-constraintKey issue: what is the critical value of 0that canguaranteetheglobal connectivity?0
Localized Algorithms of θ-graph (Gθ ) ⚫ Use local information to guarantee global connectivity ⚫ Assume location information or direction information ⚫ Θ-graph, or Gθ ⚫ Neighbor nodes divide the circle of a node to many sectors with the largest angle < θ ⚫ θ-constraint θ Key issue: what is the critical value of θ that can guarantee the global connectivity?
What We Have Known Before<5T/6ByWattenhoferinInfocom'01andPODC'o01Under unit disk modelThe first proposal of APTCO<TTBy the same author of this paper in Infocom'o3Again, disk modelNo boundary effect is considered
What We Have Known Before ⚫ θ<5π/6 ⚫ By Wattenhofer in Infocom’01 and PODC’01 ⚫ Under unit disk model ⚫ The first proposal of APTC ⚫ θ<π ⚫ By the same author of this paper in Infocom’03 ⚫ Again, disk model ⚫ No boundary effect is considered