On the efficiency of routing in sensor networks

摘要: In sensor networks, a key efficiency measure for routing protocols is the stretch of computed paths, where ratio path length and Euclidean distance covered. literature, many have been evaluated via extensive simulations, often come without any theoretical guarantees. For those whose performances are theoretically guaranteed there an important gap between predictions experimental results. The contribution this paper twofold. First, we give results that explain observed algorithms proposed in literature. Second, propose ROAM2, deterministic protocol, requires single bit memory at each node ensures, with high probability (depending on distribution), paths constant stretch.