摘要

Recent study in wireless sensor networks (WSNs) has found that the link layer varies significantly with spatial and temporal factors and approximately 5% to 15% of the links are asymmetric links. The link layer services are used to measure and estimate the link layer between neighbors and provide link layer relay mechanism to mitigate the effects of the unidirectional links. A distributed algorithm to build the shortest hops routing tree for every node using the link layer services is developed. From statistic analysis and simulation using TOSSIM, it is found that the algorithm can prevent building a broken routing tree and can build a better routing tree. A shorter routing tree is built for more than 15% nodes and the number of the hops is reduced by 14%-100%.

全文