Characterizing data deliverability of greedy routing in wireless sensor networks

Abstract

As a popular routing protocol in wireless sensor networks (WSNs), greedy routing has received great attention. The previous works characterize its data deliverability in WSNs by the probability of all nodes successfully sending their data to the base station. Their analysis, however, neither provides the information of the quantitative relation between successful data delivery ratio and transmission power of sensor nodes nor considers the impact of the network congestion or link collision on the data deliverability. To address these problems, in this paper, we characterize the data deliverability of greedy routing by the ratio of successful data transmissions from sensors to the base station. We introduce η-guaranteed delivery which means that the ratio of successful data deliveries is not less than η, and study the relationship between the transmission power of sensors and the probability of achieving η-guaranteed delivery. Furthermore, with considering the effect of network congestion and link collision, we provide a more precise and full characterization for the deliverability of greedy routing. Extensive simulation and real-world experimental results show the correctness and tightness of the upper bound of the smallest transmission power for achieving η-guaranteed delivery.