A new routing algorithm to increase reliability in wireless sensor networks

摘要

Background: This research redefines some basic notion of wireless connectivitybased on probabilistic links, and demonstrates that link statistics can be captureddynamically through an efficient yet adaptive link estimator. Together, linkestimation and neighborhood management build a probabilistic connectivity graphwhich can be exploited by a routing algorithm to increase reliability. Together, thesethree processes constitute our holistic approach to routing. Objective: We study andevaluate link estimation, neighborhood table management, and reliable routingprotocol techniques, focusing on the many-to-one, periodic data collection workloadcommonly found in sensor network applications today. Results: Our final systemuses a variant of an exponentially weighted moving average estimator, frequencybased table management, and minimum transmission cost-based routing.Conclusion: our analysis ranges from large-scale, high-level simulations to in-depthempirical experiments and emphasizes the intricate interactions between the routingtopology and the underlying connectivity graph, which underscores the need for awhole-system approach to the problem of routing in wireless sensor networks.