On Network Augmentation

λ-Augmented Tree for Robust Data Collection in Advanced Metering Infrastructure

“…The goal of this work is to mitigate the weakness of the NANBB spanning tree based communication topology by assigning backup links to thwart against single point of failure and increase its reliability [18]. This may be measured by the probability that the network remains connected despite link failure; that is, any SM somehow remains capable of transmitting its power demand to the RG under link failure, provided that other SMs are operative.…”

“…The path (SM , SM ) between SM and any SM ∈ (SM ) is simply the edge = [SM , SM ]. The degree of (SM ) deg SM is the size of the neighbor set (SM ) (i.e., deg SM = | (SM )|) [18].…”

“…Mark label : visited (15) Mark label SM : visited (16) Add to Γ (17) else (18) Set the label of ( ) as: back-edge. (19) if…”

“…International Journal of Distributed Sensor Networks for lSM ∈ (lSM) do (10) Compute = { ∈ − Γ, incident to lSM } (11) if | | = 1 then (12) Add to (13) Mark : visited (14) Mark SM ← opposite (lSM , ): visited (15) else (16) for ∈ do (17) Compute SM ← opposite (lSM , ) (18) if SM : unvisited then (19) Compute weight of (20)…”

“…When a node creates a packet that it wants to use for loop detection, it appends its address to a sequence number to for lSM ∈ (cSM ) do (10) Compute = { ∈ − , incident to lSM } (11) = { }, ∈ Γ, incident to lSM , | | = 1 (12) while | | < do (13) if | | = − 1 then (14) Add to (15) Mark ∈ : visited (16) Mark SM ← opposite (lSM , ∈ ): visited (17) else (18) for ∈ do (19) Compute SM ← opposite (lSM , ) (20) if SM : unvisited then (21) Compute weight (22) Mark : visited (23) Add the least weighted to (24) Mark SM ← opposite (lSM , ): visited create an identifier that it stores in its loop detection table. The identifier is unique and can be used to trace the packet in the entire network.…”